{"meta":{"query_hash":"3ade09b83c66","filters":{"topic":"AI-based Problem Solving and Planning"},"cohort_total":618,"direct_labels_cover":1,"predictions_cover":618,"exported":618,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/3ade09b83c66","api":"https://metacan.xera.ac/api/v1/cohort?topic=AI-based+Problem+Solving+and+Planning"},"results":[{"id":"W1008021760","doi":"10.1017/cbo9780511794797.013","title":"Individuals and Relations","year":2010,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Exploit; Computer science; Code (set theory); Object (grammar); Modular design; Class (philosophy); Artificial intelligence; Theoretical computer science; Programming language; Set (abstract data type); Computer security","score_opus":0.017339853499482746,"score_gpt":0.18618337417530667,"score_spread":0.16884352067582392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1008021760","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000774384,0.00015550473,0.027512042,0.00008175776,0.00019749162,0.00016745667,0.00009566622,0.00022905601,0.9714836],"genre_scores_gemma":[0.000897019,0.000020931411,0.009223364,0.0000802034,0.000058976035,3.0621104e-7,0.000025627432,0.00001789665,0.9896757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99897736,0.000027780297,0.000127753,0.00046728988,0.00019343414,0.00020635777],"domain_scores_gemma":[0.99885947,0.0001570261,0.00017373596,0.00056667475,0.00007981396,0.00016329576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001517621,0.00023855573,0.00022357388,0.00018561323,0.00037626902,0.00012795052,0.0006969097,0.0004249921,0.0000031850411],"category_scores_gemma":[0.000010434455,0.0002848205,0.0000767265,0.000008741889,0.00014668822,0.00017907552,0.00060009636,0.00078681065,0.000020294397],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022965046,0.000002040151,0.000025645551,0.000017299759,0.0000403243,0.000073189236,0.00012514378,0.0000023155078,0.000020535415,0.98558336,0.0123134535,0.0017944034],"study_design_scores_gemma":[0.00021725563,0.000028084422,0.00007012908,0.000112546775,0.000060055696,0.000026273756,0.000003548382,0.00035698537,0.00008320994,0.00018866472,0.99850935,0.0003438775],"about_ca_topic_score_codex":0.000050398765,"about_ca_topic_score_gemma":0.0000012778356,"teacher_disagreement_score":0.9861959,"about_ca_system_score_codex":0.000037581434,"about_ca_system_score_gemma":0.00011496168,"threshold_uncertainty_score":0.9999604},"labels":[],"label_agreement":null},{"id":"W101068393","doi":"","title":"Planning with 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":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Nondeterministic algorithm; Heuristic; Heuristics; Correctness; Domain (mathematical analysis); Plan (archaeology); Automaton; Representation (politics); Mathematical optimization; Theoretical computer science; Artificial intelligence; Algorithm; Mathematics","score_opus":0.02727259878257064,"score_gpt":0.26761995335849625,"score_spread":0.24034735457592563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W101068393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089660764,0.00017627179,0.89633346,0.0002756358,0.000062862695,0.00010097134,0.0000012322444,0.00034751865,0.013041298],"genre_scores_gemma":[0.7386222,2.4475497e-7,0.2601155,0.00017015194,0.00006291324,0.0000021295564,0.00000461268,0.000011176066,0.0010110919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985518,0.00007376515,0.00020911438,0.00038689093,0.0003502095,0.0004282453],"domain_scores_gemma":[0.9992445,0.00014568747,0.000065696644,0.000379376,0.00008074439,0.00008400163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040922503,0.00015834083,0.00015952325,0.00012743083,0.0002631453,0.00028529362,0.00048758695,0.000051902556,0.000020783504],"category_scores_gemma":[0.000009650817,0.00012318473,0.000030054238,0.00038789242,0.000038989605,0.00034299184,0.00011079564,0.00017945973,0.00002946757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118615186,0.00032230205,0.26788393,0.00019737992,0.00010499078,0.0021006877,0.0021309615,0.5890956,0.009249761,0.10314964,0.015710257,0.009935906],"study_design_scores_gemma":[0.0008143825,0.00032368282,0.01634008,0.00032530248,0.000015814792,0.00026401115,0.00009148151,0.9715457,0.0036096165,0.004291992,0.001635241,0.0007426759],"about_ca_topic_score_codex":0.0006749322,"about_ca_topic_score_gemma":0.000007712159,"teacher_disagreement_score":0.6489614,"about_ca_system_score_codex":0.00003629167,"about_ca_system_score_gemma":0.0001645518,"threshold_uncertainty_score":0.50233275},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.11457126068263553,"score_gpt":0.31723246448689313,"score_spread":0.20266120380425762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W105409620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009655631,0.000025843963,0.94161993,0.012583862,0.00051562814,0.0001203268,0.0000058604596,0.00027313866,0.035199765],"genre_scores_gemma":[0.9509874,0.0000069692305,0.04705975,0.0011287017,0.00027719027,0.000018493389,0.000008928511,0.000011835784,0.00050071155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980563,0.000051401155,0.00041938468,0.0005382781,0.0005897627,0.00034489806],"domain_scores_gemma":[0.9988463,0.00014126298,0.00017571388,0.00039573925,0.0003071533,0.00013382718],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033726354,0.00022465442,0.0001723805,0.00023381971,0.00016602842,0.00048897776,0.0011023445,0.000071274975,0.0003461747],"category_scores_gemma":[0.00008729518,0.00019224238,0.00005863658,0.00023580843,0.00008780668,0.0005751471,0.0001310476,0.00034955877,0.0010144556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000533474,0.0001029643,0.0002277127,0.0000033154515,0.00002910293,0.0000565269,0.0010726128,0.028553262,0.0011303931,0.70878285,0.0003806533,0.2596073],"study_design_scores_gemma":[0.000084957486,0.0004064783,0.00041425147,0.00046919475,0.0000069564862,0.000082947045,0.0002793793,0.87244016,0.0683325,0.047918715,0.008938551,0.0006259196],"about_ca_topic_score_codex":0.000037123806,"about_ca_topic_score_gemma":0.000027016857,"teacher_disagreement_score":0.9413318,"about_ca_system_score_codex":0.00008953448,"about_ca_system_score_gemma":0.00014727771,"threshold_uncertainty_score":0.99976337},"labels":[],"label_agreement":null},{"id":"W108063708","doi":"","title":"Subsquags and Normal Subsquags.","year":2001,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics","score_opus":0.010845959186554335,"score_gpt":0.22056343495027286,"score_spread":0.20971747576371852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W108063708","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9815055,0.0008788564,0.005994703,0.0012883942,0.0014202961,0.00011644601,0.000001182288,0.0003649441,0.008429679],"genre_scores_gemma":[0.9959973,0.000058712732,0.0031500298,0.00034619562,0.000012931353,0.0000069968005,0.0000035667413,0.00001097224,0.00041328152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879384,0.00006956957,0.00018553353,0.00034697397,0.00022320416,0.00038086248],"domain_scores_gemma":[0.9991404,0.00014416652,0.00006810996,0.00042805503,0.0000585161,0.00016074209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003937905,0.00015552517,0.00015883992,0.000084277046,0.00023397464,0.000187319,0.000522299,0.000083371124,0.000024330375],"category_scores_gemma":[0.000037094364,0.00015427246,0.000037681486,0.00037434316,0.000045361852,0.0004942223,0.00018110346,0.00020061497,0.000086694614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013460007,0.00006806619,0.06823263,0.00001706038,0.000019250423,0.00015025056,0.0011460329,0.000027042419,0.00014214584,0.9052108,0.004455627,0.020517658],"study_design_scores_gemma":[0.004206011,0.0008179071,0.07699284,0.00018807278,0.00004084869,0.00058672664,0.00013896199,0.058328617,0.0028403592,0.76293594,0.09116135,0.0017623795],"about_ca_topic_score_codex":0.00007321972,"about_ca_topic_score_gemma":0.0000057990464,"teacher_disagreement_score":0.14227484,"about_ca_system_score_codex":0.000023612669,"about_ca_system_score_gemma":0.0000473097,"threshold_uncertainty_score":0.62910485},"labels":[],"label_agreement":null},{"id":"W114767740","doi":"","title":"Learning partial-order macros from solutions","year":2005,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Macro; Heuristic; Graph; Domain (mathematical analysis); Planner; Set (abstract data type); Ranking (information retrieval); Node (physics); Theoretical computer science; Process (computing); Artificial intelligence; Mathematics","score_opus":0.018962358693709727,"score_gpt":0.23699807319496188,"score_spread":0.21803571450125214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W114767740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009768259,0.00021135177,0.9717358,0.0042793984,0.0001420668,0.000042871983,0.0000015724507,0.0005170217,0.013301693],"genre_scores_gemma":[0.77154857,0.000005673442,0.22331639,0.0007542322,0.0001734253,0.000006233652,0.00000836038,0.0000061917726,0.0041809278],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908674,0.000057943158,0.00014058036,0.00025817088,0.00013868263,0.00031785786],"domain_scores_gemma":[0.9994388,0.00013776463,0.000040537914,0.00026260252,0.000038748418,0.00008149997],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021189549,0.00008836178,0.000082598424,0.000036882575,0.0003540322,0.00016300235,0.00035620332,0.000049261434,0.00036124483],"category_scores_gemma":[0.000042762964,0.000081228194,0.00003449887,0.00019760233,0.000018264172,0.00034258846,0.00014781985,0.00019426261,0.0008602386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010574757,0.00016744265,0.024960157,0.000009018175,0.00008440825,0.000028713244,0.008522237,0.23526251,0.004186044,0.09856849,0.058095805,0.5701046],"study_design_scores_gemma":[0.00019426015,0.000035013403,0.00086328445,0.000015356858,0.0000043753553,0.0000035152077,0.000037003792,0.8129329,0.0014534418,0.0009200671,0.18334766,0.00019308938],"about_ca_topic_score_codex":0.0002626197,"about_ca_topic_score_gemma":0.000040639567,"teacher_disagreement_score":0.7617803,"about_ca_system_score_codex":0.000020235975,"about_ca_system_score_gemma":0.000050178904,"threshold_uncertainty_score":0.9999177},"labels":[],"label_agreement":null},{"id":"W1193463709","doi":"10.1609/aimag.v36i2.2587","title":"Report on the Twenty‐Second International Conference on Case‐Based Reasoning","year":2015,"lang":"en","type":"article","venue":"AI Magazine","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Case-based reasoning; Computer science; Library science; Operations research; Political science; Engineering; Artificial intelligence","score_opus":0.05757947039239149,"score_gpt":0.29731065582137484,"score_spread":0.23973118542898336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1193463709","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11334504,0.00008991269,0.32241702,0.09895019,0.0037198444,0.00047635593,0.000035403755,0.00067765336,0.46028855],"genre_scores_gemma":[0.98321515,5.5636406e-7,0.007019688,0.0056183585,0.00012723128,0.000013563746,0.00002240252,0.0000092209,0.0039738016],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987876,0.000086308886,0.00020509753,0.00034734714,0.0003625414,0.00021113853],"domain_scores_gemma":[0.9987549,0.00020187958,0.0001383582,0.00061441987,0.00018047975,0.000109930625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087615685,0.00013510729,0.00010679578,0.0000759772,0.00012726914,0.00022601048,0.0005741558,0.000045986933,0.00020985161],"category_scores_gemma":[0.00024824028,0.00009680244,0.0000402887,0.00015302374,0.00003456679,0.00017294887,0.000102601596,0.00027788497,0.0003890469],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011017346,0.00023114595,0.007032348,0.000016957298,0.00007749693,0.020851457,0.0012734259,0.005465589,0.0004460101,0.39795008,0.55188817,0.014657164],"study_design_scores_gemma":[0.0012872716,0.0006917522,0.0019871318,0.00036854058,0.000013493725,0.004519298,0.00007475713,0.755261,0.0020144251,0.008029498,0.22515346,0.00059934554],"about_ca_topic_score_codex":0.000028255194,"about_ca_topic_score_gemma":0.000017245085,"teacher_disagreement_score":0.8698701,"about_ca_system_score_codex":0.000052519914,"about_ca_system_score_gemma":0.00017335429,"threshold_uncertainty_score":0.50005406},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01597510617832052,"score_gpt":0.2519783742469103,"score_spread":0.23600326806858976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W121593559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065067105,0.0007926826,0.85510474,0.00022822186,0.00022486257,0.00009282779,0.000001311874,0.000491914,0.077996336],"genre_scores_gemma":[0.8282833,0.0000024860528,0.1693424,0.0011678312,0.00002612413,0.0000067309975,0.0000071470035,0.000012563931,0.0011513948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986579,0.000080076854,0.00022734216,0.00036077393,0.00022499195,0.00044890324],"domain_scores_gemma":[0.9992742,0.00015471036,0.000084712294,0.00032667705,0.00003006338,0.00012964064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000480668,0.00016282896,0.00014036418,0.00009974686,0.00035824464,0.00024385459,0.00040569474,0.00007050953,0.000043227275],"category_scores_gemma":[0.00006863871,0.0001479774,0.000056433615,0.00033566984,0.000012700704,0.00043006343,0.0000619736,0.00017241703,0.00005044424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010082354,0.00008559791,0.09360259,0.00006615127,0.00009796376,0.00016423195,0.0074127945,0.015724668,0.018371005,0.7521164,0.09097762,0.021370916],"study_design_scores_gemma":[0.0024890108,0.00065754855,0.0009031764,0.00056200376,0.000035659585,0.0006436637,0.00078115496,0.5630813,0.084456965,0.069494486,0.27390018,0.002994833],"about_ca_topic_score_codex":0.00011719534,"about_ca_topic_score_gemma":0.000001754765,"teacher_disagreement_score":0.7632162,"about_ca_system_score_codex":0.000020075426,"about_ca_system_score_gemma":0.000049358758,"threshold_uncertainty_score":0.6034343},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010065486372718147,"score_gpt":0.2388836938946008,"score_spread":0.22881820752188264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1262127546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.340387,0.00012043838,0.6414306,0.0006826121,0.00025458523,0.00020948338,0.0000015766755,0.000116770854,0.016796904],"genre_scores_gemma":[0.9814223,4.7279715e-7,0.017602988,0.00034919364,0.000023713632,0.000005743088,7.685068e-7,0.000005278953,0.00058956334],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988541,0.00006332728,0.0003215302,0.00021769914,0.0001616269,0.00038173393],"domain_scores_gemma":[0.9992035,0.0003454664,0.00010037478,0.00024053188,0.000046377503,0.00006375458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012114068,0.000108883185,0.00014506526,0.00011046474,0.00008207359,0.000037902857,0.0005590299,0.000037391514,0.000005273928],"category_scores_gemma":[0.000049651284,0.000079565936,0.000047276848,0.00043304372,0.000036125813,0.00021840907,0.00009117644,0.00017371164,0.000024160561],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037529843,0.00069404335,0.48852137,0.0005608056,0.0001286221,0.00023432013,0.06367253,0.016747853,0.01742877,0.11557802,0.040158246,0.2559001],"study_design_scores_gemma":[0.019011997,0.001280459,0.15859365,0.0034356783,0.000038650585,0.00029725657,0.006171855,0.54484326,0.120372646,0.060865294,0.08105897,0.0040302905],"about_ca_topic_score_codex":0.00003445749,"about_ca_topic_score_gemma":0.00019597916,"teacher_disagreement_score":0.64103526,"about_ca_system_score_codex":0.000040174375,"about_ca_system_score_gemma":0.0001047924,"threshold_uncertainty_score":0.32446048},"labels":[],"label_agreement":null},{"id":"W12713029","doi":"10.1385/bter:91:1:57","title":"Temporally-expressive planning as constraint satisfaction problems","year":2007,"lang":"en","type":"article","venue":"International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Planner; Semantics (computer science); Encoding (memory); Constraint programming; Constraint (computer-aided design); Automated planning and scheduling; Constraint satisfaction; Focus (optics); Scheduling (production processes); Temporal logic; Artificial intelligence; Theoretical computer science; Programming language; Mathematical optimization; Mathematics","score_opus":0.04623718749288479,"score_gpt":0.32598502249042516,"score_spread":0.27974783499754036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W12713029","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5996823,0.0002599278,0.3627729,0.0011904201,0.0010330835,0.00022907818,0.000012664576,0.002077111,0.032742515],"genre_scores_gemma":[0.9608635,0.0000063354346,0.03844847,0.0003800272,0.00009978866,0.000009744017,0.000039987102,0.00001579552,0.00013638767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790615,0.000070744325,0.00047535167,0.00058730494,0.0005189601,0.00044148316],"domain_scores_gemma":[0.9986692,0.0003598909,0.000320896,0.00021513212,0.00023440596,0.00020046954],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009584041,0.0002861286,0.00023220443,0.0003753922,0.00035469746,0.0005948283,0.00048937276,0.00018530994,0.00004177764],"category_scores_gemma":[0.0001820549,0.00027888335,0.00005001864,0.00019332537,0.00007652828,0.00051447225,0.00012198319,0.0005419379,0.000049500075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039710168,0.00018721478,0.17771046,0.00015873725,0.00054809556,0.0018494069,0.021633994,0.21812797,0.058557663,0.4597526,0.0012763508,0.059800427],"study_design_scores_gemma":[0.0007819621,0.00023612966,0.018686615,0.0018298251,0.00001026004,0.0002826905,0.0010372376,0.9684923,0.0027352762,0.00495938,0.00039462262,0.00055369356],"about_ca_topic_score_codex":0.00014004772,"about_ca_topic_score_gemma":0.0000031839543,"teacher_disagreement_score":0.75036436,"about_ca_system_score_codex":0.00007113017,"about_ca_system_score_gemma":0.00014843285,"threshold_uncertainty_score":0.9999663},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.15470392933671911,"score_gpt":0.33638119803484745,"score_spread":0.18167726869812834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W131525165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023031458,0.000032000084,0.94877255,0.015704138,0.0010010991,0.0001584277,0.00003256237,0.00018337414,0.011084408],"genre_scores_gemma":[0.9858645,0.000027564167,0.012165794,0.0013515201,0.00030026518,0.000022121803,0.000028916738,0.000010306489,0.00022900716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778295,0.00008775043,0.0006151254,0.00060051953,0.0005437492,0.00036991842],"domain_scores_gemma":[0.9988896,0.00019876115,0.00015816702,0.0004530542,0.00018823233,0.00011217679],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005036861,0.00022119626,0.000190991,0.00035436815,0.00008718351,0.00031299345,0.00094114547,0.00006063922,0.00062566705],"category_scores_gemma":[0.00018970897,0.00021983725,0.00006827995,0.00024753946,0.000074619595,0.0006901206,0.0002481731,0.00038161495,0.0015468928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018651763,0.00019280083,0.00072348217,0.000004162325,0.000011722534,0.00007870941,0.00070063357,0.0054590683,0.0011841807,0.42035085,0.00038182968,0.5708939],"study_design_scores_gemma":[0.00009093294,0.00013699141,0.0013933494,0.0003908076,0.0000033178426,0.000041681007,0.0001928955,0.9104501,0.052481294,0.027826563,0.0064377384,0.00055434526],"about_ca_topic_score_codex":0.00033622028,"about_ca_topic_score_gemma":0.000641763,"teacher_disagreement_score":0.96283305,"about_ca_system_score_codex":0.00012103708,"about_ca_system_score_gemma":0.00013706616,"threshold_uncertainty_score":0.9992305},"labels":[],"label_agreement":null},{"id":"W131788687","doi":"10.1609/aaai.v25i1.8039","title":"A Local Monte Carlo Tree Search Approach in Deterministic 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":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Monte Carlo tree search; Satisficing; Planner; Computer science; Monte Carlo method; Random walk; Mathematical optimization; Scaling; Tree (set theory); Quality (philosophy); Plan (archaeology); Mathematics; Artificial intelligence; Statistics","score_opus":0.16540684520601592,"score_gpt":0.2982410021422671,"score_spread":0.1328341569362512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W131788687","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6562998,0.0000964386,0.27232182,0.0005792192,0.0004041435,0.0007543141,0.000005720867,0.00022663813,0.06931186],"genre_scores_gemma":[0.9883753,0.0000037138354,0.011358907,0.00008185652,0.00002573823,0.000029736384,2.197732e-7,0.00001375444,0.00011075994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779856,0.000039345752,0.0005657328,0.0005893951,0.00047687738,0.0005301038],"domain_scores_gemma":[0.9989315,0.000120814926,0.00022811178,0.00033128553,0.00027283255,0.000115407005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087829377,0.00025254596,0.00030543288,0.00023777441,0.00017351171,0.000153886,0.0022976622,0.00012356688,0.000017723974],"category_scores_gemma":[0.00014778225,0.00019862712,0.000095290845,0.00075392774,0.0002941472,0.0002700904,0.0004012224,0.0005536628,0.000034700206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036508864,0.0006186141,0.011111404,0.0002458166,0.000037320355,0.000023689016,0.053041067,0.0061203437,0.006111701,0.71504956,0.000121137986,0.20715427],"study_design_scores_gemma":[0.000055321707,0.0003589108,0.0022041332,0.0005671733,0.000010180954,0.00001816905,0.0023562761,0.87715596,0.08558845,0.031312283,0.00001000656,0.00036311382],"about_ca_topic_score_codex":0.00027132942,"about_ca_topic_score_gemma":0.0000125721945,"teacher_disagreement_score":0.87103564,"about_ca_system_score_codex":0.000056546494,"about_ca_system_score_gemma":0.0001466575,"threshold_uncertainty_score":0.80997795},"labels":[],"label_agreement":null},{"id":"W135686785","doi":"10.1609/aaai.v28i1.9035","title":"Adding Local Exploration to Greedy Best-First Search in Satisficing Planning","year":2014,"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":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates; Alberta Innovates - Technology Futures","keywords":"Satisficing; Local search (optimization); Guided Local Search; Best-first search; Mathematical optimization; Beam search; Incremental heuristic search; Heuristic; Greedy algorithm; Mathematics; Hill climbing; Search algorithm; Computer science; Artificial intelligence","score_opus":0.1138181047269164,"score_gpt":0.3124380235152062,"score_spread":0.19861991878828983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W135686785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17506412,0.000018604365,0.81151366,0.005568256,0.00034202667,0.00043506574,0.0000018421567,0.00011479503,0.0069416277],"genre_scores_gemma":[0.9881065,0.000005015431,0.011424764,0.00027770034,0.000075257376,0.000029044317,5.9920234e-7,0.000014451497,0.00006670336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774516,0.000041915937,0.0005813119,0.0005729128,0.00056486914,0.00049381424],"domain_scores_gemma":[0.99867,0.00034771446,0.00020906409,0.00028810572,0.00035477817,0.0001303333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001446263,0.00023057846,0.0002729323,0.0003313429,0.00031503613,0.0003325781,0.0015857156,0.00009942116,0.000015498043],"category_scores_gemma":[0.0006292717,0.00019604295,0.00006196406,0.0010711683,0.000113531554,0.00067401974,0.00040558673,0.0004431956,0.00011743505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008434173,0.00009886828,0.0038659587,0.00009280079,0.000008655461,0.0000017350687,0.015606924,0.061593298,0.010874611,0.6341127,0.00015966821,0.2735004],"study_design_scores_gemma":[0.00004760989,0.00046694095,0.00042703532,0.0019246849,0.0000060782254,0.000004409371,0.0024376048,0.789782,0.16751394,0.036809538,0.00021169339,0.00036847487],"about_ca_topic_score_codex":0.00024925757,"about_ca_topic_score_gemma":0.000070799775,"teacher_disagreement_score":0.81304234,"about_ca_system_score_codex":0.00008840878,"about_ca_system_score_gemma":0.00007906898,"threshold_uncertainty_score":0.7994399},"labels":[],"label_agreement":null},{"id":"W136570180","doi":"","title":"Search control in planning for temporally extended goals","year":2005,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Reachability; Computer science; Planner; Automaton; Büchi automaton; Set (abstract data type); Control (management); State (computer science); Extension (predicate logic); Theoretical computer science; Finite-state machine; Artificial intelligence; Deterministic automaton; Algorithm; Programming language","score_opus":0.029821064375602703,"score_gpt":0.3019559432507025,"score_spread":0.2721348788750998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W136570180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011061549,0.00025750717,0.97938275,0.0040464043,0.00006539381,0.0002789872,0.0000029845426,0.00018456497,0.004719836],"genre_scores_gemma":[0.7999498,6.173347e-7,0.19765374,0.0012933115,0.00007291832,0.00002610956,0.0000029090436,0.0000065983127,0.0009939924],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885184,0.000058015696,0.00023194705,0.0002994508,0.0001668032,0.00039194018],"domain_scores_gemma":[0.9991872,0.00038908518,0.00003901415,0.00025530683,0.000049932016,0.00007951472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094165513,0.00010530112,0.00015677627,0.00013509723,0.00009495782,0.00012480354,0.0005046384,0.00005996772,0.000019485478],"category_scores_gemma":[0.000039079787,0.00009311714,0.000044014563,0.00018244029,0.000013507713,0.00035607142,0.000049045608,0.00013691018,0.000036413614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032276748,0.00045692734,0.14574158,0.00016917905,0.00009813012,0.00015031196,0.0108704,0.29205808,0.007793501,0.14532253,0.06779038,0.3292262],"study_design_scores_gemma":[0.0016350974,0.00013863928,0.0032394582,0.00006547795,0.0000020193147,0.000007674659,0.000048611662,0.9807524,0.0013630887,0.0014152019,0.011109659,0.000222635],"about_ca_topic_score_codex":0.000043661552,"about_ca_topic_score_gemma":0.000013112312,"teacher_disagreement_score":0.7888883,"about_ca_system_score_codex":0.000036000307,"about_ca_system_score_gemma":0.00009793833,"threshold_uncertainty_score":0.3797207},"labels":[],"label_agreement":null},{"id":"W136736547","doi":"","title":"Conformant probabilistic planning via CSPs","year":2003,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Probabilistic logic; Computer science; Encoding (memory); Plan (archaeology); Scheme (mathematics); Mathematical optimization; Probabilistic analysis of algorithms; Algorithm; Artificial intelligence; Mathematics","score_opus":0.019293061574848072,"score_gpt":0.2375919759633129,"score_spread":0.21829891438846483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W136736547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037183496,0.00011255676,0.90772533,0.00015659665,0.00023685589,0.0000981013,3.5773834e-7,0.0003048043,0.08764706],"genre_scores_gemma":[0.89856875,7.049622e-7,0.09966425,0.00059486873,0.00001948599,0.000008745679,0.000002171743,0.0000063920247,0.0011346035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905217,0.000049659673,0.00018360134,0.00023666564,0.00016613056,0.00031175977],"domain_scores_gemma":[0.99933404,0.00013662224,0.00005311544,0.00033759285,0.00004059263,0.00009804792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004214075,0.00011474041,0.00011062065,0.000059008285,0.00016080214,0.00012720574,0.0003706172,0.000047551577,0.000070041686],"category_scores_gemma":[0.0000684766,0.000094446994,0.000032702545,0.00019248965,0.000021497099,0.00029004758,0.000050804963,0.00013271316,0.00017321255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050025087,0.00005063244,0.0059532975,0.000055671717,0.000022031965,0.00007098387,0.0018321398,0.011170862,0.00027398358,0.96341586,0.005928245,0.01122127],"study_design_scores_gemma":[0.0010858384,0.00041663682,0.001776743,0.00019718787,0.000017606415,0.00040118123,0.00014619261,0.77452064,0.006572363,0.09170009,0.121955544,0.0012100023],"about_ca_topic_score_codex":0.000015587493,"about_ca_topic_score_gemma":0.000001073619,"teacher_disagreement_score":0.89485043,"about_ca_system_score_codex":0.00002095502,"about_ca_system_score_gemma":0.000075562806,"threshold_uncertainty_score":0.38514367},"labels":[],"label_agreement":null},{"id":"W14600473","doi":"10.1097/00129492-200311000-00015","title":"Sensorineural hearing loss in postmeningitic children.","year":2003,"lang":"en","type":"article","venue":"PubMed","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science","score_opus":0.01946781350455965,"score_gpt":0.2038189485651147,"score_spread":0.18435113506055506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W14600473","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98737967,0.0002821676,0.00615683,0.0005443522,0.00030565527,0.00029445818,0.000001303001,0.00019651627,0.0048390487],"genre_scores_gemma":[0.9949215,0.0000025863942,0.004466759,0.00022189328,0.000028942919,0.000088680405,0.0000015819807,0.000007745279,0.0002602934],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99883807,0.00008466668,0.00015669886,0.00028025216,0.00014096247,0.0004993286],"domain_scores_gemma":[0.9994941,0.00008423419,0.000036965408,0.00026761676,0.00001582364,0.00010129747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042905365,0.00010479958,0.00011143559,0.00011528625,0.00007069519,0.00009890765,0.00027506455,0.000039414335,0.0000030214298],"category_scores_gemma":[0.00010684916,0.00010460846,0.00003242341,0.00033335606,0.000015824104,0.00023773035,0.000054915694,0.00017576102,0.000018242477],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041499143,0.00004063143,0.95204145,0.000009744253,0.000012026455,0.00011767821,0.00030695548,0.0015712221,0.00001499974,0.01666535,0.0001404306,0.029075358],"study_design_scores_gemma":[0.0004525171,0.000014661353,0.9933424,0.000012992314,0.0000025245458,0.00019212201,0.000003634692,0.0030211858,0.00090060104,0.0011645847,0.00066106324,0.00023170945],"about_ca_topic_score_codex":0.00005431634,"about_ca_topic_score_gemma":0.000005122049,"teacher_disagreement_score":0.041300952,"about_ca_system_score_codex":0.000038930903,"about_ca_system_score_gemma":0.000020642268,"threshold_uncertainty_score":0.4265809},"labels":[],"label_agreement":null},{"id":"W1485161468","doi":"","title":"Transforming Rules and Trees into Comprehensible Knowledge Structures","year":2000,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Theoretical computer science; Inheritance (genetic algorithm); Simple (philosophy); Tree structure; Semantics (computer science); Measure (data warehouse); Tree (set theory); Artificial intelligence; Data structure; Mathematics; Data mining; Programming language; Combinatorics","score_opus":0.013789047699550352,"score_gpt":0.24728855379679432,"score_spread":0.23349950609724396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485161468","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7058355,0.003869994,0.2092932,0.00086405425,0.00014748817,0.00016487717,0.0000024345163,0.00059522624,0.07922722],"genre_scores_gemma":[0.9064187,0.000046369187,0.09181389,0.00016906804,0.000037634756,0.000002736396,0.0000026597297,0.000006117146,0.0015028508],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930644,0.00003278414,0.00013112822,0.00024527227,0.00008524666,0.00019912478],"domain_scores_gemma":[0.99958706,0.00010650513,0.000014468433,0.00019251247,0.000018318486,0.00008113661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009750397,0.000116769275,0.00012271621,0.00006235315,0.00022243577,0.0001519899,0.0002856059,0.00004832009,0.00017364652],"category_scores_gemma":[0.0000027039664,0.00009365449,0.000028099654,0.00012197827,0.00003970598,0.00032117745,0.000032716005,0.00009347552,0.00004766931],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004916243,0.000015712838,0.0010207699,0.000033200256,0.000013624005,0.000005383015,0.0060429294,0.00035066414,0.00080320303,0.047889363,0.0011418435,0.9426784],"study_design_scores_gemma":[0.002252907,0.0005801751,0.025750056,0.0003262874,0.00004129288,0.00024435352,0.00039805262,0.3850016,0.022049593,0.19543569,0.3660779,0.0018420755],"about_ca_topic_score_codex":0.00015174363,"about_ca_topic_score_gemma":0.00008908523,"teacher_disagreement_score":0.9408363,"about_ca_system_score_codex":0.000008148494,"about_ca_system_score_gemma":0.00003025634,"threshold_uncertainty_score":0.38191193},"labels":[],"label_agreement":null},{"id":"W1485442455","doi":"10.48550/arxiv.1205.2647","title":"Generating Optimal Plans in Highly-Dynamic Domains","year":2012,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Plan (archaeology); Process (computing); State (computer science); Adaptation (eye); Tree (set theory); Order (exchange); Mathematical optimization; Algorithm; Mathematics","score_opus":0.03620234738660056,"score_gpt":0.1769605089965621,"score_spread":0.14075816160996155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485442455","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58190995,0.000045159875,0.41685918,0.00004540684,0.00014279128,0.000042993077,0.0000025182007,0.00009710424,0.0008549023],"genre_scores_gemma":[0.9842987,0.000010353152,0.014974576,0.000111484675,0.000045350876,3.1047702e-7,0.000005474999,0.0000078553,0.0005458837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989086,0.000098892255,0.000120529934,0.00033699855,0.000056552235,0.0004784272],"domain_scores_gemma":[0.999292,0.00011963272,0.000066066576,0.00035885413,0.000021374111,0.00014207095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003456817,0.00013400434,0.00012679887,0.00017176491,0.0001693309,0.000050152794,0.0005747835,0.000080077094,0.000012917522],"category_scores_gemma":[0.000015415248,0.00015070675,0.000048413433,0.0005604219,0.000032285567,0.0007649229,0.00018415305,0.00020672417,0.00008666387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001721464,0.000108424916,0.14174117,0.000017441556,0.000023497241,0.00028119568,0.0017656242,0.72543734,0.0009781278,0.12829073,0.00025393817,0.0010853164],"study_design_scores_gemma":[0.00042162833,0.000038205893,0.0055564903,0.000029201834,0.0000074370278,0.000011857205,0.000095636766,0.99237823,0.00014538782,0.000491009,0.0005723986,0.0002525009],"about_ca_topic_score_codex":0.00008161451,"about_ca_topic_score_gemma":0.000049525413,"teacher_disagreement_score":0.40238875,"about_ca_system_score_codex":0.00010797158,"about_ca_system_score_gemma":0.00004679091,"threshold_uncertainty_score":0.61456424},"labels":[],"label_agreement":null},{"id":"W149016448","doi":"10.1609/aaai.v28i1.9036","title":"Type-Based Exploration with Multiple Search Queues for Satisficing Planning","year":2014,"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":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Satisficing; Heuristics; Queue; Heuristic; Local search (optimization); Mathematical optimization; Computer science; Mathematics; Artificial intelligence","score_opus":0.1257566293352239,"score_gpt":0.3106312486616953,"score_spread":0.18487461932647137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W149016448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12547378,0.000015387846,0.8697483,0.002273705,0.00023564737,0.00052449014,0.0000038049677,0.00014567554,0.0015792125],"genre_scores_gemma":[0.97084063,0.0000015408956,0.028784813,0.00019680696,0.000052458417,0.000050397673,0.0000023778412,0.000014818465,0.00005614313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984817,0.000034680404,0.00032605362,0.00041184723,0.00042608532,0.00031963456],"domain_scores_gemma":[0.9982907,0.00058050704,0.00025969718,0.00023608569,0.00056984444,0.00006317194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009813661,0.00017716538,0.00019603166,0.00012915459,0.00046245893,0.00024459325,0.0010557648,0.00005416838,0.000016515884],"category_scores_gemma":[0.0005558033,0.00013080197,0.000053998898,0.00049076095,0.00010317501,0.00040111458,0.00012089901,0.00024784944,0.000009554294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005753231,0.00014011524,0.006241894,0.00018795012,0.00002471502,4.704214e-7,0.006752887,0.09144473,0.03303749,0.7671921,0.00028039207,0.09412191],"study_design_scores_gemma":[0.00005447397,0.0006524516,0.000082304505,0.00028068558,0.000006923209,0.0000010370936,0.00052417093,0.72154653,0.26041546,0.016065734,0.00019594956,0.00017427541],"about_ca_topic_score_codex":0.00006536792,"about_ca_topic_score_gemma":0.000010218607,"teacher_disagreement_score":0.84536684,"about_ca_system_score_codex":0.00003803956,"about_ca_system_score_gemma":0.0001307757,"threshold_uncertainty_score":0.53339493},"labels":[],"label_agreement":null},{"id":"W1491731914","doi":"10.1007/3-540-37724-7_8","title":"Reasoning about Robot Actions: A Model Checking Approach","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Robot; Mobile robot; Process (computing); Context (archaeology); Human–computer interaction; Model checking; State (computer science); Control (management); Artificial intelligence; Programming language","score_opus":0.043740931585913155,"score_gpt":0.2556137651049041,"score_spread":0.21187283351899092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491731914","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013228864,0.0011942224,0.9719631,0.0003241326,0.00077303627,0.0003046535,0.0000039746797,0.0004111277,0.025012527],"genre_scores_gemma":[0.059356585,0.00006749952,0.9376112,0.00094981847,0.00039956736,0.000018233759,0.000008383389,0.000052660707,0.0015360593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99529296,0.000043877164,0.000588804,0.0019886603,0.0011033068,0.0009823986],"domain_scores_gemma":[0.99717075,0.00035769213,0.00040867086,0.0016161791,0.00020856167,0.00023813888],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001170867,0.0006799462,0.00061156775,0.0009299111,0.0007072352,0.0010271881,0.0035118929,0.0004802299,0.000015788477],"category_scores_gemma":[0.00011155594,0.00066068803,0.00018545467,0.0007831108,0.00039945953,0.0009457737,0.0011010569,0.0016344447,0.00004258761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021114706,0.000021962094,0.000029692637,0.00004346094,0.00001085063,0.000031626343,0.0012945737,0.76874965,0.000029767889,0.01885602,0.000049505354,0.21088077],"study_design_scores_gemma":[0.00016379346,0.00005402798,0.000017008382,0.00081023463,0.000010002122,0.000115673225,1.8317813e-7,0.95629627,0.00012955934,0.041150786,0.00053020567,0.00072228425],"about_ca_topic_score_codex":0.000027351,"about_ca_topic_score_gemma":0.000007401121,"teacher_disagreement_score":0.2101585,"about_ca_system_score_codex":0.00038857892,"about_ca_system_score_gemma":0.00050235284,"threshold_uncertainty_score":0.99958444},"labels":[],"label_agreement":null},{"id":"W1491912604","doi":"10.1007/11766247","title":"Advances in artificial intelligence : 19th Conference of the Canadian Society for Computational Studies of Intelligence, Canadian AI 2006, Québec City, Québec, Canada, June 7-9, 2006 : proceedings","year":2006,"lang":"en","type":"book","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning; Reinforcement learning; Intelligent agent","score_opus":0.03811134588081132,"score_gpt":0.2653712383145166,"score_spread":0.22725989243370526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491912604","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035862037,0.029583722,0.41383067,0.10607182,0.0052439244,0.0077542095,0.0050985813,0.00026069366,0.43179777],"genre_scores_gemma":[0.49686864,0.00034173523,0.042087533,0.006931934,0.00053658796,0.00028790897,0.00035314792,0.00015252155,0.45244],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.996734,0.000028124978,0.0011369792,0.0006764203,0.0006726185,0.00075183285],"domain_scores_gemma":[0.99658984,0.0006136276,0.00063859054,0.00032246092,0.0015505683,0.00028488837],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006583704,0.00046642922,0.0007356803,0.00036201903,0.00051827054,0.000111039684,0.0017835682,0.00028431386,0.000035087756],"category_scores_gemma":[0.00016933224,0.0003989988,0.00024052017,0.000593679,0.00054267416,0.00031388362,0.00016676619,0.00060771074,0.000001511093],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012682847,0.00004059384,0.0049169986,0.0008356406,0.00015779759,0.000007463211,0.0034526305,0.06156898,0.0000010358191,0.24678001,0.65997446,0.022251682],"study_design_scores_gemma":[0.00014342973,0.00018088573,0.00050926494,0.0023791613,0.000104159844,0.000015484982,0.0009886611,0.16126947,0.00038670143,0.15320873,0.6792074,0.0016066638],"about_ca_topic_score_codex":0.99979883,"about_ca_topic_score_gemma":0.9999993,"teacher_disagreement_score":0.49651003,"about_ca_system_score_codex":0.0030854046,"about_ca_system_score_gemma":0.09762314,"threshold_uncertainty_score":0.99984616},"labels":[],"label_agreement":null},{"id":"W1497767639","doi":"10.1007/bfb0027513","title":"Database issues for a veterinary medical expert system","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Knowledge base; Expert system; Database; Computer science; Relational database management system; Relational database; Fuzzy logic; Base (topology); Veterinary medicine; Medicine; World Wide Web; Artificial intelligence; Mathematics","score_opus":0.03937850339527329,"score_gpt":0.30223100240054335,"score_spread":0.2628524990052701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497767639","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018162755,0.0039360696,0.9894193,0.0023981242,0.0020939666,0.00045236087,0.000022934983,0.00039901253,0.0012600933],"genre_scores_gemma":[0.02017623,0.00009464063,0.97348964,0.0029817992,0.0024287975,0.000051916748,0.00003699436,0.000059503545,0.0006804796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99544585,0.000053126794,0.0006045996,0.0016885616,0.0013931292,0.000814749],"domain_scores_gemma":[0.9966776,0.0009862895,0.0002496,0.0015549102,0.00019101589,0.000340625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018568253,0.0005653913,0.0006104308,0.00058099104,0.0003865494,0.00048014947,0.004350649,0.0004491481,0.000031814525],"category_scores_gemma":[0.00016804374,0.0005053153,0.0001548176,0.0003174883,0.0004054119,0.00062063447,0.0014577506,0.0007518182,0.0000481293],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024162708,0.00003534807,0.00001036695,0.00030026652,0.000021350264,0.0005358051,0.0014537822,0.0056121824,0.000120631295,0.02846183,0.0011009616,0.9623233],"study_design_scores_gemma":[0.00039818478,0.0003925427,0.000003122581,0.002837179,0.000006522268,0.00044344596,4.6179744e-7,0.9222188,0.00040600754,0.004592829,0.067894764,0.0008061153],"about_ca_topic_score_codex":0.000047594312,"about_ca_topic_score_gemma":0.00002127137,"teacher_disagreement_score":0.9615172,"about_ca_system_score_codex":0.00030646092,"about_ca_system_score_gemma":0.00083327905,"threshold_uncertainty_score":0.9997398},"labels":[],"label_agreement":null},{"id":"W15018536","doi":"10.1021/ic035133a","title":"Compiling control knowledge into preconditions for planning in the situation calculus","year":2003,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Situation calculus; Computer science; Calculus (dental); Domain (mathematical analysis); Control (management); Action (physics); Plan (archaeology); Transformation (genetics); Domain knowledge; Mathematics; Artificial intelligence","score_opus":0.13885397239882438,"score_gpt":0.36079424045340885,"score_spread":0.22194026805458447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W15018536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076984125,0.000047977584,0.9790526,0.0036185044,0.0009327747,0.00043671447,0.000014311704,0.000073163756,0.008125515],"genre_scores_gemma":[0.9888145,0.0000038915405,0.010192036,0.00062428456,0.000104929124,0.00016321865,0.000025396532,0.000008202656,0.00006356457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981744,0.00023611764,0.00055365515,0.00043455148,0.00030691325,0.00029430675],"domain_scores_gemma":[0.9981292,0.0010030994,0.00017603584,0.00029774144,0.00033395062,0.000059983737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013018799,0.00018421882,0.00017701718,0.0002627145,0.00028725681,0.00040857782,0.0008670391,0.00007886625,0.00006455375],"category_scores_gemma":[0.0006647562,0.00015661982,0.00009284327,0.0002694157,0.000070950846,0.00034302156,0.000033939697,0.0003006695,0.00012882915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022093778,0.00014375086,0.00015547378,0.000007944912,0.000015891637,0.0000072296934,0.005330787,0.019912554,0.00095122546,0.94703627,0.00016816799,0.026248606],"study_design_scores_gemma":[0.00011909418,0.00014193243,0.00027400546,0.00018477281,0.0000058075398,0.0000119026545,0.00083629764,0.7362582,0.007382358,0.25331673,0.0012467321,0.00022218673],"about_ca_topic_score_codex":0.000048355574,"about_ca_topic_score_gemma":0.00011285571,"teacher_disagreement_score":0.98111606,"about_ca_system_score_codex":0.00010754552,"about_ca_system_score_gemma":0.0001899006,"threshold_uncertainty_score":0.6386771},"labels":[],"label_agreement":null},{"id":"W1504993523","doi":"","title":"Reactive planning in a motivated behavioral architecture","year":2005,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Planner; Plan (archaeology); Robot; Architecture; Human–computer interaction; Computer science; Mobile robot; Context (archaeology); Perception; Artificial intelligence; Psychology","score_opus":0.022528802443482508,"score_gpt":0.2801674033087636,"score_spread":0.2576386008652811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504993523","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58850384,0.00009474754,0.39787897,0.001745503,0.00010502093,0.00012148873,0.0000013642237,0.00038495814,0.011164088],"genre_scores_gemma":[0.90103,1.9119814e-7,0.09820906,0.0003161014,0.000050476785,0.000005997891,0.000003549102,0.0000057356006,0.0003788728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991109,0.000050103252,0.00014835905,0.0002737931,0.00013665204,0.00028023636],"domain_scores_gemma":[0.9995573,0.000086418026,0.00004155631,0.00023277284,0.000018902618,0.000063008934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018504317,0.00011080392,0.00011051513,0.00015789348,0.000060285372,0.00006960237,0.0003725931,0.00006353723,0.00002233568],"category_scores_gemma":[0.0000138673095,0.00009631411,0.000027499402,0.00033061588,0.000013920288,0.0002876176,0.000088995905,0.0002958413,0.00003245043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001059111,0.00074299716,0.267156,0.00003008667,0.00004089399,0.0006343077,0.0634986,0.22133398,0.012680593,0.016448418,0.008458311,0.4088699],"study_design_scores_gemma":[0.004841477,0.0011418556,0.16970603,0.0010228961,0.000026220167,0.0003952428,0.0009877869,0.7015832,0.049068335,0.010410249,0.057898037,0.0029186558],"about_ca_topic_score_codex":0.00016061257,"about_ca_topic_score_gemma":0.000034609096,"teacher_disagreement_score":0.48024923,"about_ca_system_score_codex":0.000046961664,"about_ca_system_score_gemma":0.00004088829,"threshold_uncertainty_score":0.3927575},"labels":[],"label_agreement":null},{"id":"W1505083629","doi":"10.1609/aaai.v24i1.7563","title":"Searching Without a Heuristic: Efficient Use of Abstraction","year":2010,"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":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Heuristics; Heuristic; Incremental heuristic search; Null-move heuristic; Computer science; Abstraction; Consistent heuristic; Bidirectional search; Beam search; Search algorithm; Path (computing); Node (physics); Algorithm; Theoretical computer science; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.09218876173904127,"score_gpt":0.3059573326956114,"score_spread":0.2137685709565701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505083629","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93002695,0.000005158767,0.064437136,0.001159846,0.0006398947,0.00029627493,0.0000049264877,0.000093356175,0.003336452],"genre_scores_gemma":[0.9835921,0.0000035256464,0.016185096,0.00005208256,0.0000458726,0.000007668565,3.5240052e-7,0.000009458448,0.000103848775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99829584,0.00001859803,0.00049409224,0.00037848068,0.00051662745,0.0002963292],"domain_scores_gemma":[0.9982394,0.00026176835,0.00047442384,0.00032202236,0.0006132894,0.00008911981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076377374,0.00017238785,0.00021754058,0.00014631575,0.00020489846,0.0002552563,0.0012334954,0.000091134694,0.000029081873],"category_scores_gemma":[0.00085344183,0.00013010384,0.00009424861,0.00043350065,0.00023757809,0.00032408015,0.00024189455,0.0006290147,0.000031194206],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006098066,0.00015379183,0.0015636416,0.00006321285,0.000012050559,5.20999e-7,0.0017352146,0.002141694,0.2841086,0.6575173,0.000047925834,0.052595075],"study_design_scores_gemma":[0.000021887476,0.00013089793,0.0010628076,0.00027914764,0.000010221524,0.00000842221,0.00012427881,0.37711778,0.5941393,0.02679728,0.00012778795,0.00018021012],"about_ca_topic_score_codex":0.00019506397,"about_ca_topic_score_gemma":0.000015333304,"teacher_disagreement_score":0.63072,"about_ca_system_score_codex":0.000016413065,"about_ca_system_score_gemma":0.00011569439,"threshold_uncertainty_score":0.5305481},"labels":[],"label_agreement":null},{"id":"W1510392739","doi":"10.1007/978-3-540-85502-6_13","title":"Considerations for Real-Time Spatially-Aware Case-Based Reasoning: A Case Study in Robotic Soccer Imitation","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Artificial intelligence; Context (archaeology); Imitation; Cluster analysis; Focus (optics); Case-based reasoning; Preprocessor; Frame (networking); Representation (politics); Feature (linguistics); Constraint (computer-aided design); Selection (genetic algorithm); Human–computer interaction; Machine learning; Engineering","score_opus":0.042425529710907496,"score_gpt":0.28063370738072174,"score_spread":0.23820817766981425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510392739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034160696,0.00009736268,0.9932448,0.000563328,0.00060159154,0.001604978,0.000014576637,0.00021964246,0.00023764391],"genre_scores_gemma":[0.5756474,0.0000038033122,0.4235957,0.0004327551,0.00014473005,0.000057762998,0.000012921277,0.000036039466,0.00006888544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960071,0.0001562398,0.0007971836,0.0016737055,0.0006526712,0.0007131358],"domain_scores_gemma":[0.9941395,0.0036726792,0.00041947144,0.0011318948,0.00045190923,0.00018456098],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013493462,0.00059491076,0.0006737405,0.0011220922,0.000857215,0.0005998161,0.0008631255,0.00032725773,0.000016124386],"category_scores_gemma":[0.00036414544,0.0006009314,0.00013957679,0.0006057469,0.0003182904,0.00052990904,0.00030811163,0.0007031772,0.000013142288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014455804,0.00013626262,0.00060819136,0.00005774203,0.000019669249,0.039185263,0.007961875,0.9096319,0.00001856677,0.000596001,0.00012594854,0.04164409],"study_design_scores_gemma":[0.0009272814,0.00054999633,0.000071077004,0.00040122453,0.000022535058,0.008720763,0.0000034885156,0.98229337,0.00006351124,0.0062256632,0.000022028886,0.0006990676],"about_ca_topic_score_codex":0.0011010733,"about_ca_topic_score_gemma":0.003784539,"teacher_disagreement_score":0.57223135,"about_ca_system_score_codex":0.00042012575,"about_ca_system_score_gemma":0.001812317,"threshold_uncertainty_score":0.9996442},"labels":[],"label_agreement":null},{"id":"W1512553849","doi":"10.1007/b136277","title":"Advances in artificial intelligence : 18th Conference of the Canadian Society for Computational Studies of Intelligence, Canadian AI 2005, Victoria, Canada, May 9-11, 2005 : proceedings","year":2005,"lang":"en","type":"book","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning; Cluster analysis; Constraint satisfaction; Data mining; Probabilistic logic","score_opus":0.03994232140809781,"score_gpt":0.27937505943141644,"score_spread":0.23943273802331863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512553849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033364602,0.02225952,0.49489543,0.10246383,0.011869849,0.010665542,0.004693731,0.00030248842,0.35251597],"genre_scores_gemma":[0.5208585,0.0015790071,0.16129802,0.008104834,0.0018083793,0.0003859488,0.00041033217,0.00021094325,0.30534402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99666965,0.000028522296,0.0010521729,0.00065098645,0.0006796268,0.00091906916],"domain_scores_gemma":[0.9970108,0.00051683636,0.0005645115,0.00031232403,0.0011951694,0.0004003593],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007952477,0.0004399065,0.0006750247,0.00034883618,0.0004176484,0.00011421552,0.0017744037,0.00030927893,0.00006116536],"category_scores_gemma":[0.00014389282,0.0003771149,0.00021006065,0.00042416854,0.0003658741,0.0003819411,0.00013790786,0.0005236039,0.0000017663882],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009654963,0.000024786044,0.00084123795,0.00054295047,0.0001346215,0.000004511607,0.003822793,0.046282917,0.0000012335656,0.7300764,0.20000616,0.018252755],"study_design_scores_gemma":[0.00008707181,0.00006757017,0.000095988114,0.0015179665,0.00005298725,0.000008594015,0.00094900106,0.13876615,0.00032690848,0.08626291,0.7709403,0.0009245297],"about_ca_topic_score_codex":0.9494432,"about_ca_topic_score_gemma":0.9999447,"teacher_disagreement_score":0.6438135,"about_ca_system_score_codex":0.0024759036,"about_ca_system_score_gemma":0.04451562,"threshold_uncertainty_score":0.9998681},"labels":[],"label_agreement":null},{"id":"W151442501","doi":"10.1007/3-540-45164-1_3","title":"Short-Term Profiling for a Case-Based Reasoning Recommendation System","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Profiling (computer programming); Term (time); Information retrieval; Artificial intelligence; Programming language","score_opus":0.025741535658154083,"score_gpt":0.2620913291440486,"score_spread":0.23634979348589452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W151442501","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001786872,0.00018750057,0.994605,0.00032043137,0.0012764378,0.00087285653,0.000027516275,0.00045440558,0.0020771718],"genre_scores_gemma":[0.30063233,0.0000036673907,0.69831586,0.00039756444,0.00042708876,0.00005161264,0.00006385384,0.000048449354,0.00005955266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99623036,0.00006344689,0.00067486125,0.0017029512,0.00052463653,0.00080375635],"domain_scores_gemma":[0.9972161,0.0010217844,0.00030204834,0.00103516,0.00023662206,0.00018828709],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017112033,0.0005812781,0.00056175055,0.0007936418,0.00070516585,0.0008141233,0.0017025308,0.00038730045,0.000010580546],"category_scores_gemma":[0.00006311638,0.0005679909,0.00017699471,0.000464225,0.00018974941,0.00053218455,0.00029201043,0.0007272824,0.000013718541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020684414,0.000016794671,0.00018894015,0.00026425833,0.000014202511,0.0005229327,0.00041986766,0.10556324,0.00003121206,0.008561164,0.000021182614,0.8843755],"study_design_scores_gemma":[0.00028228926,0.00018821414,0.000008417601,0.0016987796,0.000017159127,0.0008164759,4.2261433e-7,0.9897977,0.00096168224,0.0048764264,0.00065981,0.0006926281],"about_ca_topic_score_codex":0.000023184768,"about_ca_topic_score_gemma":0.00002570719,"teacher_disagreement_score":0.8842344,"about_ca_system_score_codex":0.00052482315,"about_ca_system_score_gemma":0.0006445131,"threshold_uncertainty_score":0.9996772},"labels":[],"label_agreement":null},{"id":"W1514904414","doi":"10.1609/socs.v2i1.18196","title":"Predicting Solution Cost with Conditional Probabilities","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alberta Innovates; University of Regina","keywords":"Heuristic; Consistent heuristic; Path (computing); Incremental heuristic search; Mathematical optimization; Computer science; Bidirectional search; Algorithm; Bounded function; Best-first search; Search algorithm; Beam search; Mathematics","score_opus":0.015760573196842338,"score_gpt":0.24088293891240958,"score_spread":0.22512236571556724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514904414","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89724207,0.000049905164,0.0055638975,0.042479068,0.0056550987,0.000808098,0.000059587117,0.0002757254,0.04786656],"genre_scores_gemma":[0.9974534,0.0000034898635,0.0015674761,0.00013826907,0.00029499902,0.00003705696,0.0000111047275,0.000010192418,0.00048401716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99797237,0.000023968767,0.00024355177,0.00035163533,0.0011701356,0.00023831532],"domain_scores_gemma":[0.9981703,0.0002301398,0.00015340612,0.00014165317,0.0012412403,0.00006323173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005589072,0.00012823257,0.00013109096,0.000056561395,0.000272415,0.00026654647,0.0010946714,0.000064028376,0.000016488057],"category_scores_gemma":[0.00018348506,0.00009743241,0.000071869064,0.0003163657,0.00010243683,0.00043516542,0.00041765103,0.0003100704,0.0000067644182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116054325,0.00021113742,0.041584138,0.000059192986,0.00008002871,0.0000028169334,0.00066906255,0.0008870425,0.019900698,0.9351592,0.0010419452,0.0002886527],"study_design_scores_gemma":[0.0038261744,0.0010019252,0.009831894,0.0012859737,0.000037925267,0.0002098508,0.0003862861,0.0749075,0.7209611,0.17746589,0.009405069,0.0006804414],"about_ca_topic_score_codex":0.0000576529,"about_ca_topic_score_gemma":0.0000024847886,"teacher_disagreement_score":0.75769335,"about_ca_system_score_codex":0.00019374784,"about_ca_system_score_gemma":0.0002221527,"threshold_uncertainty_score":0.39731783},"labels":[],"label_agreement":null},{"id":"W1517613281","doi":"10.1023/a:1017936325308","title":"A Constraint-Based Robotic Soccer Team","year":2002,"lang":"en","type":"article","venue":"Constraints","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Computer science; Controller (irrigation); Java; Control engineering; Task (project management); Constraint (computer-aided design); Distributed computing; Real-time computing; Artificial intelligence; Systems engineering; Engineering; Operating system","score_opus":0.030761650256139875,"score_gpt":0.23130395438764637,"score_spread":0.20054230413150648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517613281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021524688,0.00031270704,0.9174519,0.0029101442,0.00055955455,0.00022120377,0.000010186183,0.00064835325,0.07573346],"genre_scores_gemma":[0.9433739,0.0000023657758,0.054266296,0.0017213662,0.0000564358,0.000011415643,0.000004180918,0.00001225539,0.00055178587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983919,0.00009410036,0.0002770229,0.0004586736,0.00026566023,0.00051259133],"domain_scores_gemma":[0.9987826,0.0002836963,0.00010305035,0.0005475351,0.000072504525,0.0002106325],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00031238573,0.00021202503,0.00022011493,0.00012901647,0.00021272751,0.00020160608,0.00072169094,0.000113395836,0.0012023855],"category_scores_gemma":[0.00011370112,0.00020800723,0.00010595079,0.0002973195,0.00041166687,0.00022795856,0.000072527,0.00027980361,0.0008527013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007818165,0.00042190283,0.013411555,0.000119616976,0.00012421387,0.00048733762,0.0023486677,0.007050677,0.001632885,0.08945975,0.07534932,0.8095863],"study_design_scores_gemma":[0.0016364952,0.00017904244,0.00080573733,0.000267509,0.000025954678,0.00025044184,0.00009861004,0.98319256,0.0012024542,0.0027889735,0.008687049,0.00086514023],"about_ca_topic_score_codex":0.000006932528,"about_ca_topic_score_gemma":0.0000014806851,"teacher_disagreement_score":0.9761419,"about_ca_system_score_codex":0.000043326254,"about_ca_system_score_gemma":0.000120485536,"threshold_uncertainty_score":0.99992526},"labels":[],"label_agreement":null},{"id":"W1522016728","doi":"10.18757/ejtir.2003.3.1.4234","title":"Decision Support in Dynamic Traffic Management","year":2003,"lang":"en","type":"article","venue":"European journal of transport and infrastructure research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ministry of Transportation of Ontario","funders":"","keywords":"Computer science; Operator (biology); Set (abstract data type); Fuel efficiency; Task (project management); Function (biology); Decision support system; Operations research; Control (management); Similarity (geometry); Fuzzy logic; Data mining; Artificial intelligence; Engineering","score_opus":0.017324699155231185,"score_gpt":0.2860057976596367,"score_spread":0.2686810985044055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522016728","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78364944,0.0008738347,0.20100689,0.00030036364,0.00036250456,0.00014866346,0.0000018454976,0.000021481557,0.013634976],"genre_scores_gemma":[0.9363283,0.00032416917,0.06315507,0.000036278383,0.000020447123,3.0811177e-7,0.0000012142427,0.000012115173,0.00012210311],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9978856,0.00043288802,0.00048430337,0.0002223625,0.0006103417,0.00036452463],"domain_scores_gemma":[0.9992944,0.00009858177,0.0000934416,0.0002229216,0.000116218194,0.00017442952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050398577,0.00011964924,0.00018369731,0.0005794087,0.00012088158,0.00008490817,0.0006367895,0.000029983017,0.000056938596],"category_scores_gemma":[0.000027129683,0.00009451667,0.000058796188,0.0005458123,0.00006596878,0.00031071916,0.000035322253,0.0007443415,0.0000075010753],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001916103,0.0000999593,0.027049944,0.0001630603,0.00007201051,0.009975895,0.005664513,0.019065214,0.00029313043,0.0054650106,0.00325102,0.9287086],"study_design_scores_gemma":[0.0041963696,0.001642056,0.8359107,0.000859205,0.000022497623,0.0015777869,0.0004937757,0.0059053223,0.00012509152,0.0065059518,0.14221612,0.00054516713],"about_ca_topic_score_codex":6.963334e-7,"about_ca_topic_score_gemma":0.0000028210288,"teacher_disagreement_score":0.92816347,"about_ca_system_score_codex":0.000038572365,"about_ca_system_score_gemma":0.00008911006,"threshold_uncertainty_score":0.38542777},"labels":[],"label_agreement":null},{"id":"W152472178","doi":"10.1609/aaai.v26i1.8373","title":"MAXSAT Heuristics for Cost Optimal Planning","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":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Nanjing University; Government of Jiangsu Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Maximum satisfiability problem; Heuristics; Heuristic; Computation; Encoding (memory); Set (abstract data type); Computer science; Mathematical optimization; Algorithm; Mathematics; Artificial intelligence; Boolean function","score_opus":0.11989317767544434,"score_gpt":0.3230394606003565,"score_spread":0.20314628292491216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W152472178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038800124,0.0001472617,0.9423164,0.0065102563,0.0010945539,0.00064817787,0.000031192412,0.00019874971,0.010253265],"genre_scores_gemma":[0.94435817,0.000013092756,0.054533534,0.00037006,0.00010695082,0.00004086461,0.0000027056062,0.000015408976,0.0005592256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99817944,0.000017093103,0.0004794688,0.00052227755,0.00037345185,0.00042829264],"domain_scores_gemma":[0.99802476,0.00031387788,0.00031510222,0.00030278185,0.000940849,0.00010261707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005336645,0.00021698607,0.00026421383,0.00007895617,0.0003398604,0.00038721028,0.0014634008,0.000103499486,0.00003118324],"category_scores_gemma":[0.00082089985,0.00018029791,0.00013469685,0.0004946078,0.00013307441,0.00026957507,0.00034624935,0.00030517584,0.000030608553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007217608,0.00011033719,0.0005011687,0.000103470076,0.00002520577,0.0000041764793,0.0019059938,0.0025405039,0.01742646,0.9283049,0.0016033275,0.047402263],"study_design_scores_gemma":[0.00005142979,0.0001955052,0.00007884678,0.0005274818,0.000020426061,0.000019188377,0.0006350579,0.31273356,0.5964551,0.08704894,0.0019078203,0.00032662522],"about_ca_topic_score_codex":0.000008036731,"about_ca_topic_score_gemma":0.0000014300143,"teacher_disagreement_score":0.90555805,"about_ca_system_score_codex":0.000037983187,"about_ca_system_score_gemma":0.0002167939,"threshold_uncertainty_score":0.73523355},"labels":[],"label_agreement":null},{"id":"W1527745059","doi":"10.1609/aaai.v24i1.7559","title":"Using Lookaheads with Optimal Best-First Search","year":2010,"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":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Speedup; Heuristics; Exploit; Breadth-first search; Distributed File System; Computer science; Search algorithm; Depth-first search; Algorithm; Search problem; Beam search; Best-first search; Parallel computing; Theoretical computer science; Operating system","score_opus":0.11117290488117013,"score_gpt":0.3144024564566372,"score_spread":0.2032295515754671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527745059","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84135014,0.00001542352,0.14579608,0.0030431526,0.00046700615,0.000400762,0.000004442825,0.00013679887,0.008786194],"genre_scores_gemma":[0.9399546,0.0000045857996,0.059661947,0.000093642506,0.00008723216,0.000009314416,2.8024039e-7,0.000016009886,0.00017243256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99794066,0.000013914989,0.00038858713,0.0005418861,0.0006187104,0.0004962638],"domain_scores_gemma":[0.9983737,0.00012613606,0.0002449821,0.00040100838,0.00071262434,0.00014153679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007031537,0.00025161004,0.00024313142,0.0001499887,0.00046604537,0.00042506537,0.002228486,0.00012325782,0.00006700265],"category_scores_gemma":[0.00015870373,0.00017602918,0.00007973855,0.0007197203,0.00039288195,0.0005120936,0.00037103955,0.00077547366,0.00007402543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012104805,0.00021151536,0.0032905845,0.00008135983,0.000026404832,0.0000034185155,0.0031670178,0.0035062302,0.11280322,0.8484004,0.000070482485,0.02831831],"study_design_scores_gemma":[0.00003990409,0.0003986635,0.0001055157,0.00040541653,0.00001692832,0.000037647733,0.00040107494,0.4184826,0.5672919,0.012336333,0.00014301177,0.00034098653],"about_ca_topic_score_codex":0.00016484463,"about_ca_topic_score_gemma":0.00003626449,"teacher_disagreement_score":0.8360641,"about_ca_system_score_codex":0.000028562205,"about_ca_system_score_gemma":0.00023753209,"threshold_uncertainty_score":0.7178262},"labels":[],"label_agreement":null},{"id":"W1529859013","doi":"10.1007/3-540-44583-8_24","title":"Ossa - A Conceptual Modelling System for Virtual Realities","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"","keywords":"Diagrammatic reasoning; Computer science; Conceptual graph; Modalities; Conceptual model; Conceptual design; Graphics; Conceptual system; Human–computer interaction; Conceptual framework; Natural (archaeology); Virtual reality; Artificial intelligence; Programming language; Computer graphics (images); Knowledge representation and reasoning","score_opus":0.035473209952560855,"score_gpt":0.24205444404899842,"score_spread":0.20658123409643758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529859013","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000043843367,0.000774639,0.9910858,0.00026614143,0.0022341073,0.0005012123,0.00003133876,0.0004317894,0.0046311105],"genre_scores_gemma":[0.25229844,0.000049305236,0.7431666,0.0009815539,0.0015063139,0.000049557235,0.000036344092,0.00008606452,0.0018258111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957982,0.00004795277,0.00067010865,0.0016426151,0.0008967088,0.0009444312],"domain_scores_gemma":[0.99660015,0.001313195,0.00036791514,0.0011810384,0.0003266342,0.00021108484],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013786212,0.0006177572,0.00068349513,0.0006294538,0.0005701326,0.00071110664,0.0030183217,0.00043831073,0.000006311614],"category_scores_gemma":[0.000051884454,0.0005867402,0.00019327377,0.0004041826,0.0007095687,0.0005993589,0.00066220516,0.0007366736,0.000022609102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012472138,0.000008474154,0.0000083322175,0.0000790156,0.0000139059475,0.0000642582,0.0024288227,0.6628052,0.000010460159,0.22602458,0.00008509327,0.10845935],"study_design_scores_gemma":[0.0003139061,0.00029761717,5.627084e-7,0.0010709208,0.000011026516,0.00010136596,0.000003389135,0.94396055,0.0002269218,0.046414163,0.0069059837,0.00069358986],"about_ca_topic_score_codex":0.000081605016,"about_ca_topic_score_gemma":0.000021263904,"teacher_disagreement_score":0.28115532,"about_ca_system_score_codex":0.00041494198,"about_ca_system_score_gemma":0.0007509567,"threshold_uncertainty_score":0.9996584},"labels":[],"label_agreement":null},{"id":"W1531013180","doi":"10.1007/3-540-45622-8_23","title":"Performance of Lookahead Control Policies in the Face of Abstractions and Approximations","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Markov decision process; Abstraction; Computer science; Interpretation (philosophy); Operator (biology); Bellman equation; Task (project management); State (computer science); Optimal control; Image (mathematics); Function (biology); Face (sociological concept); Mathematical optimization; Theoretical computer science; Artificial intelligence; Markov process; Algorithm; Mathematics; Programming language","score_opus":0.023005120205627866,"score_gpt":0.25839022305198256,"score_spread":0.2353851028463547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531013180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00847925,0.00038635414,0.9873866,0.00056755525,0.00017805747,0.00026899006,0.000008308969,0.000022509681,0.0027023812],"genre_scores_gemma":[0.9291702,0.000028354874,0.070405476,0.00030218338,0.000045754034,0.0000035236953,0.000001478678,0.0000063543625,0.000036684618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982911,0.000029650455,0.0004692728,0.0004127889,0.0004966322,0.00030057476],"domain_scores_gemma":[0.99787253,0.0010638993,0.00031498502,0.00058304577,0.00012358806,0.000041957654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013354768,0.00021033564,0.00031612828,0.00061875157,0.00014621747,0.00008911585,0.0013120918,0.00014752215,0.00000248241],"category_scores_gemma":[0.000048888134,0.00016043756,0.00004800022,0.00043081262,0.00061616773,0.00031353722,0.0001707361,0.0005217187,0.000001941888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021525977,0.000099401914,0.008049987,0.00035547442,0.00002317281,0.000018436573,0.01810399,0.44105834,0.00046658498,0.037644267,0.000017964641,0.49414086],"study_design_scores_gemma":[0.0003654351,0.00026645747,0.012356332,0.0006947813,0.000011321905,0.00007254294,0.000004781021,0.97273284,0.0008623892,0.012086827,0.0002000788,0.00034621722],"about_ca_topic_score_codex":0.00008740854,"about_ca_topic_score_gemma":0.00006970775,"teacher_disagreement_score":0.92069095,"about_ca_system_score_codex":0.000042953314,"about_ca_system_score_gemma":0.00020937294,"threshold_uncertainty_score":0.6542454},"labels":[],"label_agreement":null},{"id":"W1531750618","doi":"10.1007/11774303_16","title":"How “Consciousness” Allows a Cognitive Tutoring Agent Make Good Diagnosis During Astronauts’ Training","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"TUTOR; Computer science; Consciousness; Human–computer interaction; Task (project management); Process (computing); Context (archaeology); Cognition; Simple (philosophy); Artificial intelligence; Cognitive science; Psychology; Programming language; Engineering; Systems engineering","score_opus":0.02149455859686149,"score_gpt":0.22750901367308224,"score_spread":0.20601445507622074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531750618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028250343,0.0010132433,0.9897896,0.0009306627,0.00192332,0.0005226484,0.000024926516,0.00042868336,0.002541897],"genre_scores_gemma":[0.79611784,0.000032054504,0.2004994,0.00053242693,0.001051368,0.00007715696,0.000023022978,0.00008525856,0.0015814353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941548,0.00008139672,0.00063211867,0.002328218,0.0013710671,0.0014323738],"domain_scores_gemma":[0.996679,0.0011923308,0.0005192035,0.0010416716,0.0002656902,0.00030211097],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010329693,0.0009272202,0.00083586463,0.001025205,0.0007701938,0.0018516341,0.0028167309,0.0004356837,0.000011613763],"category_scores_gemma":[0.00015685856,0.00093321304,0.00026305605,0.0007049235,0.0005681753,0.00080491963,0.0013290734,0.0014490753,0.000020643596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014434645,0.00007038462,0.003927027,0.00018648386,0.00007496356,0.0011085836,0.00637464,0.07688003,0.00017646723,0.0031761867,0.00003737497,0.9079734],"study_design_scores_gemma":[0.005028529,0.0016170562,0.011046572,0.020989634,0.00025800077,0.0012914538,0.00002814186,0.8541327,0.012417886,0.06673038,0.015692368,0.010767273],"about_ca_topic_score_codex":0.000065437416,"about_ca_topic_score_gemma":0.0001336845,"teacher_disagreement_score":0.8972061,"about_ca_system_score_codex":0.00045310575,"about_ca_system_score_gemma":0.0006844943,"threshold_uncertainty_score":0.99931186},"labels":[],"label_agreement":null},{"id":"W1534152511","doi":"10.1007/978-3-540-79474-5_2","title":"A Quest for Adaptable and Interpretable Architectures of Computational Intelligence","year":2008,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fuzzy logic; Computer science; Artificial intelligence; Artificial neural network; Cognitive science; Machine learning; Psychology","score_opus":0.09133730792856361,"score_gpt":0.3385263802328255,"score_spread":0.2471890723042619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534152511","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000051905998,0.015806045,0.97303927,0.0003089614,0.00045022106,0.00053330266,0.00009165568,0.000080753656,0.0096379],"genre_scores_gemma":[0.36435956,0.0020194135,0.62295115,0.0004249581,0.0001674837,0.00010623982,0.00009848611,0.00006992458,0.009802792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971973,0.000051940595,0.0010165024,0.0008534367,0.0005134791,0.00036735286],"domain_scores_gemma":[0.99433154,0.0040691895,0.0005024885,0.000305697,0.0007062745,0.00008481538],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005344811,0.0004765546,0.0007714448,0.0004829904,0.00023942893,0.00005528473,0.00082257617,0.00018057166,0.000013728258],"category_scores_gemma":[0.00026910563,0.00047977318,0.00015148488,0.00017230236,0.0007270728,0.00015359628,0.0005526976,0.0004646545,0.000010786995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003595099,0.000025685813,0.000037769816,0.00029953872,0.00015216766,0.000018488527,0.0035810634,0.70965993,3.5365517e-7,0.25379202,0.00088941224,0.031507604],"study_design_scores_gemma":[0.00007688682,0.0002502464,0.000025880941,0.0012836632,0.00001697216,0.00008293213,0.00008991831,0.3989856,0.000044760152,0.5957609,0.0029657267,0.00041652142],"about_ca_topic_score_codex":0.000036199486,"about_ca_topic_score_gemma":0.000033684457,"teacher_disagreement_score":0.36430764,"about_ca_system_score_codex":0.00012441172,"about_ca_system_score_gemma":0.0003182732,"threshold_uncertainty_score":0.9997654},"labels":[],"label_agreement":null},{"id":"W1536575850","doi":"10.1007/11424918_7","title":"Planning for a Mobile Robot to Attend a Conference","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Desk; Robot; Mobile robot; Motion planning; Human–computer interaction; Artificial intelligence; Automated planning and scheduling; Robotics; Operations research; Engineering management; Multimedia; Engineering","score_opus":0.033563089086928115,"score_gpt":0.28057479871134194,"score_spread":0.24701170962441382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536575850","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000065859866,0.0005656299,0.99386674,0.0012522567,0.0010956469,0.0009184751,0.000016793672,0.0002523813,0.0019662026],"genre_scores_gemma":[0.08872966,0.000007085652,0.9061232,0.00317308,0.0007321983,0.000098859644,0.000011577966,0.00004642042,0.0010778911],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958618,0.000026326134,0.00054685795,0.0018314795,0.00074561144,0.0009879055],"domain_scores_gemma":[0.9969943,0.000875944,0.00026144087,0.001228081,0.00031730076,0.00032294603],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010334431,0.00060223177,0.0006147967,0.00082788937,0.00040683048,0.0008205505,0.003573398,0.00032902445,0.000024311268],"category_scores_gemma":[0.00009796979,0.00057903375,0.00014734593,0.000503743,0.00024686754,0.00049915764,0.0010345527,0.0007260242,0.000063598134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012046464,0.000016482127,0.000044521068,0.00004724524,0.000010332473,0.00004363443,0.0024295067,0.43187076,0.00017245168,0.006292452,0.00020424854,0.5588563],"study_design_scores_gemma":[0.00041214217,0.00072274875,0.000048291073,0.0015451901,0.000012493334,0.00008457452,6.6422126e-7,0.9291992,0.0009988861,0.041631773,0.024069041,0.0012750046],"about_ca_topic_score_codex":0.000016269858,"about_ca_topic_score_gemma":0.000032458687,"teacher_disagreement_score":0.5575813,"about_ca_system_score_codex":0.00025437566,"about_ca_system_score_gemma":0.0007171656,"threshold_uncertainty_score":0.9996661},"labels":[],"label_agreement":null},{"id":"W1541361506","doi":"10.1184/r1/6608450","title":"Planning with Primary Effects Experiments and Analysis","year":2018,"lang":"en","type":"article","venue":"Figshare","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Planner; Primary (astronomy); Computer science; Selection (genetic algorithm); Operations research; Mathematical optimization; Artificial intelligence; Engineering; Mathematics","score_opus":0.023210434328270607,"score_gpt":0.25969004914035915,"score_spread":0.23647961481208854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541361506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3397182,0.024314541,0.39492276,0.0012489215,0.0010116217,0.003630466,0.055151768,0.006959863,0.17304187],"genre_scores_gemma":[0.96305025,3.1223982e-7,0.029520998,0.00076136127,0.00010814834,0.000065380846,0.0061794897,0.000013037875,0.00030099912],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9992922,0.00003018246,0.00006936492,0.0002766077,0.00014581242,0.00018583333],"domain_scores_gemma":[0.99943095,0.0001351047,0.000053870626,0.0002579053,0.000044405784,0.00007776797],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00004227734,0.000100482415,0.00012641955,0.000106036205,0.00015720651,0.00013954757,0.0002592422,0.00003719356,0.0013411253],"category_scores_gemma":[0.000042228345,0.00008097127,0.000023352695,0.00043499455,0.0000075986336,0.00023000188,0.00014722862,0.00006977282,0.00013957075],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014501016,0.00020244681,0.13532454,0.0016586083,0.0024694765,0.0010863888,0.03248096,0.001547121,0.0019443146,0.00039094247,0.72942764,0.09332256],"study_design_scores_gemma":[0.0030745424,0.0029735854,0.5434778,0.011461878,0.00033956347,0.00013087828,0.00011677441,0.257864,0.042645473,0.0002771947,0.13486744,0.0027708896],"about_ca_topic_score_codex":0.0000037280524,"about_ca_topic_score_gemma":6.174122e-7,"teacher_disagreement_score":0.6233321,"about_ca_system_score_codex":0.000013406806,"about_ca_system_score_gemma":0.000029463485,"threshold_uncertainty_score":0.9995718},"labels":[],"label_agreement":null},{"id":"W1542194017","doi":"10.1007/3-540-44886-1_18","title":"Case Authoring from Text and Historical Experiences","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; National Research Council Canada","funders":"","keywords":"Technician; Computer science; Documentation; Domain (mathematical analysis); Technical documentation; Knowledge base; Task (project management); Software engineering; Reflection (computer programming); Truck; Engineering; Artificial intelligence; Systems engineering; Programming language","score_opus":0.031170056518140796,"score_gpt":0.23836123312984148,"score_spread":0.20719117661170067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542194017","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012797796,0.002700388,0.9912094,0.0006926858,0.0023769527,0.0001525258,0.0000027148021,0.00015028557,0.0014353091],"genre_scores_gemma":[0.27400544,0.000038762773,0.7231134,0.0016648738,0.00050870836,0.000016400483,0.0000027237543,0.000036503112,0.00061317324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966434,0.00005433252,0.00043960466,0.0016272129,0.000643173,0.00059222477],"domain_scores_gemma":[0.99770457,0.00080253475,0.00022129768,0.0009155387,0.00009336305,0.00026272834],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007244191,0.00047760032,0.00048020325,0.00047039852,0.0005069364,0.00062611594,0.0014858783,0.00032110888,0.000026153926],"category_scores_gemma":[0.00010509543,0.00043826358,0.00007506889,0.0003811294,0.00038361005,0.0005365917,0.0007275071,0.00081773754,0.000012692167],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061835767,0.00002714895,0.0003187945,0.00003923629,0.00001701761,0.006287817,0.02270304,0.005924189,0.00006667151,0.0065322663,0.00034968977,0.95772797],"study_design_scores_gemma":[0.0006590073,0.0005430317,0.000047598864,0.0011509861,0.0000319732,0.0062842043,0.000010316507,0.7808805,0.0012981384,0.17852312,0.027597299,0.0029738217],"about_ca_topic_score_codex":0.00019161389,"about_ca_topic_score_gemma":0.00004315635,"teacher_disagreement_score":0.9547541,"about_ca_system_score_codex":0.00044771752,"about_ca_system_score_gemma":0.000262568,"threshold_uncertainty_score":0.99980694},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Sandia National Laboratories","keywords":"Computer science; Fuzzy logic; Programming language; Artificial intelligence; Software engineering","score_opus":0.013650370720999156,"score_gpt":0.2290748992369409,"score_spread":0.21542452851594177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546235996","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54422134,0.0018723614,0.04217955,0.015142808,0.0005053402,0.00034349537,0.0000029053708,0.00035687725,0.3953753],"genre_scores_gemma":[0.97817725,0.000078561556,0.02029009,0.000694054,0.00007881986,0.000014822447,0.0000014842298,0.000008347971,0.0006565539],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988517,0.00010448661,0.00017867002,0.00031718143,0.00019685765,0.00035106472],"domain_scores_gemma":[0.9991671,0.00026158913,0.000059606868,0.0004134046,0.000027062059,0.00007124015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071226654,0.00012580867,0.00013345337,0.00007809334,0.00020842653,0.00021865501,0.0005784829,0.00006179334,0.000023371513],"category_scores_gemma":[0.00008037114,0.00009352046,0.000027227037,0.00041481215,0.0000499353,0.0003228197,0.00019615226,0.00027097546,0.000035025725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049408452,0.000098575576,0.18042071,0.00005251622,0.000035436613,0.00043149866,0.011458867,0.0009917603,0.0018949541,0.33218914,0.020257097,0.45212],"study_design_scores_gemma":[0.0027799935,0.0004060486,0.13511299,0.0009964064,0.000033631284,0.00083051546,0.0010350802,0.15937261,0.00081804185,0.566104,0.13078298,0.0017276953],"about_ca_topic_score_codex":0.000084012885,"about_ca_topic_score_gemma":0.000039356277,"teacher_disagreement_score":0.45039234,"about_ca_system_score_codex":0.00002453112,"about_ca_system_score_gemma":0.000049425824,"threshold_uncertainty_score":0.38136536},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Eleventh; Computer science; Artificial intelligence; Operations research; Political science; Engineering; Physics","score_opus":0.11875785230818826,"score_gpt":0.2035867998666089,"score_spread":0.08482894755842064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550696814","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90773475,0.000018388564,0.08551117,0.00047535964,0.0005061251,0.00051385304,0.0000118372745,0.00010775236,0.0051207654],"genre_scores_gemma":[0.9988418,0.000024664962,0.00063275837,0.00006841409,0.000028043694,0.0000018520421,0.0000023586958,0.00000853244,0.00039153095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983708,0.000068544425,0.000291373,0.00079742866,0.00014123863,0.0003305657],"domain_scores_gemma":[0.9985992,0.00013006198,0.00038938076,0.0005756144,0.00022419561,0.000081573824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038851774,0.00026011936,0.00029268177,0.00021043996,0.00010629098,0.00011145373,0.002460369,0.00023819086,0.000027423619],"category_scores_gemma":[0.00006495894,0.0002286477,0.00013562298,0.0007007461,0.00014719872,0.00021258736,0.0012299011,0.00084944424,0.000042086904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023225162,0.00008105484,0.0030160376,0.000079225225,0.000017139497,0.000011902029,0.0007340424,0.24789967,0.000091060814,0.74623215,0.00014268832,0.0016718117],"study_design_scores_gemma":[0.00006061259,0.00006598074,0.001066546,0.0005953029,0.000012484351,0.0000010794136,0.0001818316,0.7138989,0.0010969946,0.28270277,0.000041399275,0.00027609267],"about_ca_topic_score_codex":0.00055709627,"about_ca_topic_score_gemma":0.000059398382,"teacher_disagreement_score":0.46599922,"about_ca_system_score_codex":0.00015757112,"about_ca_system_score_gemma":0.0002537175,"threshold_uncertainty_score":0.93239826},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019699936789591012,"score_gpt":0.22826383834093122,"score_spread":0.20856390155134022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550791699","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000015905773,0.0014305664,0.01056731,0.0010283478,0.00028156652,0.00027702365,0.000012618505,0.0003630394,0.9860379],"genre_scores_gemma":[0.0002840409,0.0006223326,0.007995694,0.00060233654,0.00012795176,0.000010482031,0.000017418975,0.000030912586,0.9903088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984908,0.00003408044,0.00031032265,0.0004753067,0.00033747757,0.0003520189],"domain_scores_gemma":[0.9982103,0.00058154616,0.00014567567,0.0009060861,0.00008766298,0.00006874572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039933572,0.00030751107,0.00023068994,0.00008722817,0.00045335104,0.00035982725,0.0013162722,0.00022521178,0.00017656271],"category_scores_gemma":[0.000019800586,0.0001913164,0.000107819935,0.00006557734,0.000103110506,0.000105768435,0.0001754389,0.00050323625,0.0005719999],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064899414,0.0000032501978,0.0000029623895,0.000008156025,0.000043284705,0.000042521886,0.00018270216,0.000016454265,0.0000011434863,0.8423227,0.05402733,0.103343025],"study_design_scores_gemma":[0.00009800268,0.00006174093,0.0000016452412,0.00012713113,0.000011263986,0.000035744404,0.0000031304717,0.0028343676,0.000012772313,0.037182633,0.95932674,0.00030484603],"about_ca_topic_score_codex":0.000091763875,"about_ca_topic_score_gemma":0.000035910125,"teacher_disagreement_score":0.90529937,"about_ca_system_score_codex":0.000038075817,"about_ca_system_score_gemma":0.00043423788,"threshold_uncertainty_score":0.7801657},"labels":[],"label_agreement":null},{"id":"W1551913915","doi":"","title":"Game-SAT: A Preliminary Report.","year":2004,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Boolean satisfiability problem; Variable (mathematics); Solver; Game tree; PSPACE; Pruning; Computer science; Search tree; Domain (mathematical analysis); Mathematics; Tree (set theory); Sequential game; Theoretical computer science; Algorithm; Computational complexity theory; Combinatorics; Mathematical optimization; Search algorithm; Game theory; Mathematical economics","score_opus":0.01195437496025022,"score_gpt":0.23183581284093496,"score_spread":0.21988143788068473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551913915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019150592,0.00015865773,0.9521253,0.0027584066,0.00022963237,0.000070960356,3.8737593e-7,0.0004986709,0.025007408],"genre_scores_gemma":[0.8282002,0.0000015930225,0.168401,0.00062776793,0.000044675533,0.0000058569212,0.000005083749,0.0000052032224,0.0027085992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914694,0.00001588568,0.00016865713,0.00028590843,0.00016628236,0.00021631819],"domain_scores_gemma":[0.9992707,0.00005324153,0.000059239646,0.0005033519,0.000033281154,0.000080210884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025095374,0.000086147375,0.00008309694,0.000051222247,0.00007734678,0.00008837728,0.000409768,0.000045050107,0.000020617601],"category_scores_gemma":[0.00003709289,0.00007350286,0.00004111077,0.00019296339,0.000016669972,0.00026377532,0.00012927648,0.00010603133,0.00022049255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009393788,0.0007836674,0.025835196,0.00024106518,0.00015019697,0.023243254,0.017822484,0.09643251,0.0025809766,0.6204662,0.042460334,0.1698902],"study_design_scores_gemma":[0.0058009685,0.0042867083,0.05362165,0.0014347755,0.0000730747,0.018676808,0.00033852772,0.18366878,0.045320105,0.4754974,0.20703945,0.004241772],"about_ca_topic_score_codex":0.000095512674,"about_ca_topic_score_gemma":0.0000030566364,"teacher_disagreement_score":0.8090496,"about_ca_system_score_codex":0.000025076437,"about_ca_system_score_gemma":0.00011000546,"threshold_uncertainty_score":0.29973596},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.15994001886198067,"score_gpt":0.4311293688593298,"score_spread":0.2711893499973491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557519121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37778693,0.00018284403,0.6173208,0.001119923,0.00038666127,0.00015182272,7.660321e-7,0.000032226148,0.0030180498],"genre_scores_gemma":[0.9835452,0.00014791868,0.015870804,0.000014498303,0.0002852159,9.510731e-7,5.3797015e-7,0.000009965436,0.00012492064],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9963234,0.00038304174,0.0009273931,0.00025128206,0.0013596858,0.0007551763],"domain_scores_gemma":[0.99641436,0.0019786563,0.00018166569,0.00030160407,0.0008705085,0.00025320283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019410966,0.000110931804,0.00021921971,0.0015310328,0.0002249931,0.0002657706,0.0010298959,0.000117564596,0.00007408169],"category_scores_gemma":[0.00067678635,0.00010020982,0.00009457166,0.0019277221,0.00014279566,0.00057939236,0.00012197786,0.0013818414,0.00026305832],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066382275,0.0007207816,0.0039192447,0.00008410973,0.000045870584,0.0026970173,0.0064749657,0.027635805,0.10903009,0.03759545,0.0014483101,0.8096845],"study_design_scores_gemma":[0.00027748715,0.0038376646,0.019532032,0.0013270507,0.000015002038,0.00093438104,0.0051591527,0.28020835,0.40486303,0.28133795,0.0015238853,0.0009840402],"about_ca_topic_score_codex":0.00042452913,"about_ca_topic_score_gemma":0.00007439489,"teacher_disagreement_score":0.8087005,"about_ca_system_score_codex":0.00020220892,"about_ca_system_score_gemma":0.00038540852,"threshold_uncertainty_score":0.6727492},"labels":[],"label_agreement":null},{"id":"W155860189","doi":"10.1609/icaps.v22i1.13537","title":"Optimally Relaxing Partial-Order Plans with MaxSAT","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":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Flexibility (engineering); Computer science; Plan (archaeology); Encoding (memory); Mathematical optimization; Order (exchange); Minification; Operations research; Artificial intelligence; Mathematics","score_opus":0.03352342834652276,"score_gpt":0.2690857539899184,"score_spread":0.23556232564339563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W155860189","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96754396,0.0001312508,0.011661201,0.0026093689,0.00042634213,0.00013553258,0.000007226659,0.0005888224,0.016896322],"genre_scores_gemma":[0.94032454,0.000006290812,0.059280515,0.00018616293,0.000064563705,0.0000087546905,0.00000299608,0.000011766813,0.00011442269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867934,0.000012031239,0.00025949988,0.00027613068,0.00044607086,0.00032689815],"domain_scores_gemma":[0.9991172,0.000104513514,0.00028716898,0.00010691315,0.00028255364,0.00010163185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005740006,0.00018840532,0.00017263298,0.00012500604,0.00023228447,0.00029586945,0.0008087458,0.000083751744,0.000009593882],"category_scores_gemma":[0.00013627298,0.00013083273,0.000033747572,0.00022404648,0.000060535385,0.0006227318,0.00020139058,0.00032559197,0.0000057010348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031832844,0.0001951788,0.41951674,0.00019151047,0.00037451446,0.000010294419,0.0127385175,0.028010882,0.03566195,0.4993568,0.001025953,0.00259934],"study_design_scores_gemma":[0.00043909845,0.00012548149,0.009351161,0.0015094194,0.000021022537,0.00011103106,0.000580235,0.97486496,0.011841902,0.0005710142,0.00027123417,0.0003134683],"about_ca_topic_score_codex":0.000014641221,"about_ca_topic_score_gemma":2.9802231e-7,"teacher_disagreement_score":0.94685405,"about_ca_system_score_codex":0.00002773129,"about_ca_system_score_gemma":0.00006645659,"threshold_uncertainty_score":0.5335204},"labels":[],"label_agreement":null},{"id":"W155874214","doi":"","title":"TutorialPlan: automated tutorial generation from CAD drawings","year":2013,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Autodesk (Canada)","funders":"","keywords":"Computer science; Heuristics; Generator (circuit theory); Software; Answer set programming; Process (computing); Set (abstract data type); CAD; Software engineering; Representation (politics); Engineering drawing; Programming language; Human–computer interaction","score_opus":0.013924239434278871,"score_gpt":0.22035735527402034,"score_spread":0.20643311583974147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W155874214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28935143,0.0001401738,0.6720866,0.0035278983,0.018593172,0.00045520568,0.000012735799,0.0060046446,0.009828135],"genre_scores_gemma":[0.8514068,0.0000016522995,0.14241497,0.00067342335,0.003879702,0.00003011157,0.00008537221,0.0000131624965,0.0014947678],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883217,0.00007145502,0.00022808781,0.00035557055,0.00025322402,0.00025951132],"domain_scores_gemma":[0.9992359,0.00012218671,0.00007265016,0.00037162926,0.00009262323,0.000104997314],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001849117,0.00013855402,0.0001358113,0.00005151041,0.00018733596,0.0006105999,0.000467283,0.000117106516,0.00023935283],"category_scores_gemma":[0.00004514432,0.00011935839,0.00003897007,0.00017627886,0.000013663578,0.00082193455,0.00009476252,0.00011873302,0.00090526557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005207528,0.000044288612,0.0018894825,0.0000048128227,0.000046180317,0.000015818297,0.0019301748,0.0016603086,0.06140942,0.05319648,0.8688203,0.010977512],"study_design_scores_gemma":[0.00041552648,0.0000532089,0.0014822924,0.0000134864,0.000005555386,0.0000031564985,0.000006935731,0.9570843,0.0067868275,0.0025747688,0.03129478,0.00027915262],"about_ca_topic_score_codex":0.004891976,"about_ca_topic_score_gemma":0.000018823348,"teacher_disagreement_score":0.955424,"about_ca_system_score_codex":0.000038380473,"about_ca_system_score_gemma":0.00008326372,"threshold_uncertainty_score":0.9998726},"labels":[],"label_agreement":null},{"id":"W1562120698","doi":"10.1007/1-4020-8151-0_2","title":"Integrating Two Artificial Intelligence Theories in a Medical Diagnosis Application","year":2004,"lang":"en","type":"book-chapter","venue":"IFIP International Federation for Information Processing/IFIP","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Artificial intelligence; Artificial neural network; Computer science; Model-based reasoning; Inference; Applications of artificial intelligence; Artificial Intelligence System; Machine learning; Cognitive science; Psychology; Knowledge representation and reasoning","score_opus":0.021112457142990464,"score_gpt":0.2994375744231912,"score_spread":0.2783251172802007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562120698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018919074,0.00011533309,0.89052194,0.004588441,0.00081973866,0.00076416606,0.00006823419,0.00031493275,0.1027883],"genre_scores_gemma":[0.8571789,0.00014826351,0.1133408,0.005907297,0.0017832516,0.0026557434,0.005896955,0.00013820105,0.012950591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960042,0.000031636795,0.0017540419,0.000551202,0.001308878,0.00035001725],"domain_scores_gemma":[0.99688125,0.00037112602,0.0011499436,0.00033657413,0.0011174203,0.00014371154],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013988958,0.00047998992,0.00038468372,0.0007788118,0.0005786061,0.0020297128,0.0012552596,0.0004911363,0.0001921179],"category_scores_gemma":[0.00075194123,0.00048574197,0.00016390072,0.00020680738,0.00011616195,0.0039053394,0.00017906328,0.00070075324,0.00019194403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000306426,0.000021473652,0.000021349606,0.00009990981,0.000018603077,0.0000019807585,0.0014928033,0.003804912,0.0000031422042,0.6886283,0.0002451512,0.30563176],"study_design_scores_gemma":[0.00032502986,0.00007969327,0.0000081679955,0.0012107668,0.000013366272,0.00002614411,0.00012757533,0.35860676,0.00065155386,0.59579545,0.04258316,0.0005723542],"about_ca_topic_score_codex":0.00008399291,"about_ca_topic_score_gemma":0.00018483492,"teacher_disagreement_score":0.85716,"about_ca_system_score_codex":0.0006978416,"about_ca_system_score_gemma":0.0012881585,"threshold_uncertainty_score":0.99975944},"labels":[],"label_agreement":null},{"id":"W1565555505","doi":"10.1109/cdc.2002.1184532","title":"Probabilistic reasoning in distributed diagnosis for qualitative systems","year":2003,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Probabilistic logic; Medical diagnosis; Computer science; Scalability; Artificial intelligence; Model-based reasoning; Machine learning; Data mining; Knowledge representation and reasoning","score_opus":0.039708734212844515,"score_gpt":0.3125936688748589,"score_spread":0.27288493466201436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565555505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010304763,0.0003161142,0.9867038,0.00026963462,0.00020956631,0.00046789442,0.000021384743,0.00014276149,0.0015640748],"genre_scores_gemma":[0.9269123,0.000002355802,0.072356574,0.00005313603,0.000012474815,0.00043879496,0.000017797203,0.0000069912335,0.00019955331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869984,0.0003019748,0.00025367725,0.0003157545,0.0001241951,0.00030456722],"domain_scores_gemma":[0.9978229,0.0017089206,0.00007626248,0.0002446231,0.00008218199,0.00006515834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013866543,0.00011127271,0.00017134997,0.00006658972,0.00010111146,0.00014067438,0.00026660934,0.00005291473,0.000005063265],"category_scores_gemma":[0.001296693,0.00009733541,0.000036592857,0.000380722,0.00001792694,0.00020426442,0.000026114067,0.000086467626,0.000008696067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005294047,0.00006580238,0.0066920235,0.0001175391,0.0000124851285,0.0000069664634,0.0068665403,0.013312093,0.000006453412,0.96901727,0.0033668962,0.00053061714],"study_design_scores_gemma":[0.0019991982,0.0005101791,0.0014150599,0.001090569,0.000020052497,0.000024177054,0.005376686,0.9093964,0.00073400466,0.05698223,0.02136427,0.0010871859],"about_ca_topic_score_codex":0.0001764959,"about_ca_topic_score_gemma":0.000023643952,"teacher_disagreement_score":0.91660756,"about_ca_system_score_codex":0.00007705428,"about_ca_system_score_gemma":0.00007931457,"threshold_uncertainty_score":0.3969223},"labels":[],"label_agreement":null},{"id":"W1566277354","doi":"10.1007/11526018_11","title":"Qualitative Reasoning Model for Tradeoff Analysis","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Qualitative reasoning; Artificial intelligence","score_opus":0.04359065886211399,"score_gpt":0.3191653627257502,"score_spread":0.2755747038636362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566277354","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000029634683,0.00058828935,0.9960244,0.0010906091,0.0003563869,0.00035044074,0.000030478903,0.00020067311,0.0013290318],"genre_scores_gemma":[0.08517775,0.0000126372,0.9122562,0.0010456722,0.00029237015,0.000019428433,0.000025042764,0.00003100058,0.0011398983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99591726,0.00006138519,0.0006144913,0.0017532338,0.00084219733,0.0008114473],"domain_scores_gemma":[0.99645543,0.0014789738,0.00041235567,0.0011784543,0.0002731472,0.00020162361],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022631043,0.0005592704,0.00076851586,0.0013960155,0.00043508768,0.0005516881,0.0028472021,0.00035223842,0.000010631764],"category_scores_gemma":[0.00015225845,0.0005306938,0.00037186692,0.0011687374,0.00035561496,0.00063389644,0.0004730444,0.00073210616,0.000011806492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060743428,0.000014851551,0.000009067245,0.000022093296,0.000069820686,0.000008402889,0.0126036415,0.76149887,0.000009007667,0.026302448,0.000040132938,0.1994156],"study_design_scores_gemma":[0.00021116012,0.000073642,0.0000071938366,0.00019263003,0.000070303104,0.0000072204525,8.426256e-7,0.8978344,0.00008491503,0.100551546,0.00038038142,0.0005857707],"about_ca_topic_score_codex":0.000019942752,"about_ca_topic_score_gemma":0.000097813514,"teacher_disagreement_score":0.19882983,"about_ca_system_score_codex":0.00029486153,"about_ca_system_score_gemma":0.0006527848,"threshold_uncertainty_score":0.99971443},"labels":[],"label_agreement":null},{"id":"W1567723160","doi":"10.3233/978-1-60750-606-5-217","title":"Planning with Concurrency under Resources and Time Uncertainty","year":2010,"lang":"en","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Concurrency; Computer science; Distributed computing","score_opus":0.027702821139123965,"score_gpt":0.2541936243253958,"score_spread":0.2264908031862718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567723160","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012793683,0.0022789647,0.96611226,0.0004879687,0.000113544265,0.0003894543,0.000021333657,0.00009447157,0.03037409],"genre_scores_gemma":[0.18546322,0.002552957,0.65321535,0.0023178724,0.0022419754,0.0010665518,0.00048444088,0.00034215354,0.15231547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986867,0.000015979631,0.0003187205,0.0005819544,0.00016129238,0.0002353576],"domain_scores_gemma":[0.9991544,0.0001387998,0.00016854214,0.00037082337,0.00005574974,0.0001117023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022745293,0.00024986634,0.00027854438,0.00021092115,0.00029531922,0.00020146786,0.00040034959,0.0002494245,0.00001859691],"category_scores_gemma":[0.000007057524,0.00022922448,0.000027442768,0.000109476954,0.00034609853,0.0001300295,0.000109267196,0.00061344885,0.000025041387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021456148,0.000024836796,0.00033624677,0.000042548963,0.00003950778,0.000010611035,0.0017401186,0.0021832194,0.000059880644,0.6719029,0.0009053803,0.3227333],"study_design_scores_gemma":[0.000044983506,0.00011863868,0.000032705255,0.0004127117,0.000036989764,0.000020927413,0.00026195808,0.042188805,0.00020436806,0.7910152,0.16497356,0.00068916305],"about_ca_topic_score_codex":0.000025726253,"about_ca_topic_score_gemma":0.00001706456,"teacher_disagreement_score":0.32204413,"about_ca_system_score_codex":0.000023252114,"about_ca_system_score_gemma":0.000071490256,"threshold_uncertainty_score":0.9347503},"labels":[],"label_agreement":null},{"id":"W157156586","doi":"","title":"An Automated Explanation Approach for a Decision Support System based on MCDA.","year":2005,"lang":"en","type":"article","venue":"Explanation-aware Computing","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université Laval","funders":"","keywords":"Multiple-criteria decision analysis; Decision support system; Ranking (information retrieval); Computer science; Context (archaeology); Operations research; Compromise; Decision analysis; Process (computing); Action (physics); Management science; Process management; Risk analysis (engineering); Engineering; Artificial intelligence; Mathematics","score_opus":0.020432852197446068,"score_gpt":0.29467230804957883,"score_spread":0.2742394558521328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W157156586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040963893,0.000014240685,0.99122447,0.00033171076,0.00041109676,0.0005103297,0.000029395609,0.0022669253,0.0011154693],"genre_scores_gemma":[0.6324915,1.4451867e-7,0.3663986,0.00036064928,0.00023599977,0.000028642507,0.0004494848,0.000020542064,0.000014437303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971194,0.0002017867,0.00070103735,0.00081838906,0.00068873895,0.00047063254],"domain_scores_gemma":[0.9971748,0.0011950112,0.00040205196,0.0007257189,0.00032641634,0.00017598462],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019575874,0.0002969495,0.00030905707,0.0004727136,0.0006774983,0.0004392982,0.0009485219,0.00015781735,0.000009487861],"category_scores_gemma":[0.00016694503,0.0002899774,0.0001040521,0.0005294504,0.000014103655,0.0006606947,0.000059089445,0.0001891212,0.000043875683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003728798,0.0001448173,0.0009758845,0.000087023356,0.000015233833,0.000007956465,0.0010362666,0.91735303,0.00004647316,0.0055091237,0.011369411,0.06341749],"study_design_scores_gemma":[0.0007635534,0.00021917866,0.00065124384,0.00018725506,0.000007806638,0.000017869834,0.00015321412,0.99615335,0.00028694162,0.00002676232,0.0011914507,0.00034137323],"about_ca_topic_score_codex":0.00001581706,"about_ca_topic_score_gemma":0.0000040981,"teacher_disagreement_score":0.62839514,"about_ca_system_score_codex":0.00027144083,"about_ca_system_score_gemma":0.0001799946,"threshold_uncertainty_score":0.99995524},"labels":[],"label_agreement":null},{"id":"W1571851487","doi":"10.1007/978-3-540-73580-9_5","title":"Partial Pattern Databases","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Reduction (mathematics); Abstraction; Heuristic; Database; Table (database); Parallel computing; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.044547099493549944,"score_gpt":0.28028210286874966,"score_spread":0.2357350033751997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571851487","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000033001408,0.0005270521,0.99181074,0.00049256283,0.0020991517,0.00022419024,0.000014884845,0.00027132547,0.0045271195],"genre_scores_gemma":[0.11713561,0.00004476064,0.87360007,0.006343482,0.0018921376,0.000009691006,0.00005331269,0.00007909422,0.00084187224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99576247,0.000036140114,0.0005533667,0.0016493006,0.0010676398,0.0009310731],"domain_scores_gemma":[0.99684393,0.00078540365,0.00028722166,0.0016777607,0.00015869735,0.00024699228],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015088735,0.00055254216,0.00047400786,0.0007911819,0.00033369914,0.0004970762,0.0032565878,0.00025225725,0.000051027957],"category_scores_gemma":[0.00008479326,0.00051257253,0.00012113002,0.00050458463,0.00047249018,0.00065639,0.0014434094,0.0010445608,0.0001417743],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036256022,0.000017660604,0.00037465294,0.00003642042,0.000008482174,0.00032477005,0.00042829182,0.012035345,0.000023491202,0.0071436623,0.0001077725,0.9794958],"study_design_scores_gemma":[0.000426237,0.00026114524,0.00018537378,0.0013488417,0.00001607346,0.00020434016,1.5308082e-7,0.9318179,0.0026707097,0.031177647,0.030242378,0.0016492154],"about_ca_topic_score_codex":0.00010127274,"about_ca_topic_score_gemma":0.00009350508,"teacher_disagreement_score":0.9778466,"about_ca_system_score_codex":0.00017072467,"about_ca_system_score_gemma":0.0004984837,"threshold_uncertainty_score":0.9997326},"labels":[],"label_agreement":null},{"id":"W1573576464","doi":"10.1007/3-540-44914-0_18","title":"Experiments with Automatically Created Memory-Based Heuristics","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Heuristics; Heuristic; Computer science; Set (abstract data type); Lookup table; Table (database); State (computer science); Conjecture; Space (punctuation); Algorithm; Theoretical computer science; Artificial intelligence; Mathematics; Data mining; Programming language; Discrete mathematics","score_opus":0.014799633559551965,"score_gpt":0.23872508286784513,"score_spread":0.22392544930829317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573576464","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001411482,0.00023877315,0.987108,0.0004553887,0.0004562442,0.00036127932,0.00000758302,0.00047214946,0.010759425],"genre_scores_gemma":[0.11556588,0.00000716564,0.8813377,0.00233366,0.00019849825,0.000014777162,0.000018496532,0.000059746395,0.00046407612],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99578786,0.000055790406,0.0005475865,0.0015345073,0.0012568736,0.0008173846],"domain_scores_gemma":[0.99704796,0.0006359601,0.00027101507,0.0015534053,0.00020950445,0.00028214828],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060514716,0.000675524,0.0006028063,0.00066775817,0.00036569408,0.0007116027,0.0029619979,0.0003365205,0.000097811244],"category_scores_gemma":[0.00005075674,0.00055712496,0.000095652846,0.00062246306,0.0006522195,0.00034007028,0.00037220574,0.00084278034,0.0000906565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000611806,0.00012537825,0.00016057407,0.00012145498,0.000045335255,0.0012680934,0.0016136963,0.49197975,0.00010385999,0.0070323534,0.00014132203,0.49734703],"study_design_scores_gemma":[0.00055692357,0.00049166806,0.000046612862,0.0011697577,0.000015491902,0.000085570384,1.11584896e-7,0.97201246,0.0021175197,0.021681555,0.0009024713,0.000919872],"about_ca_topic_score_codex":0.00003144292,"about_ca_topic_score_gemma":0.000012722322,"teacher_disagreement_score":0.49642715,"about_ca_system_score_codex":0.00023350613,"about_ca_system_score_gemma":0.0011405275,"threshold_uncertainty_score":0.999688},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Artificial intelligence; Operations research; Engineering; Computer science; Library science","score_opus":0.10242958096062661,"score_gpt":0.19962758155391122,"score_spread":0.09719800059328461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576718874","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.897972,0.000024820463,0.09242235,0.00072618044,0.00064426794,0.0006529724,0.000016746268,0.00014318892,0.0073974803],"genre_scores_gemma":[0.9986197,0.00002678278,0.00061577297,0.000075280055,0.000029936802,0.0000017566689,0.0000023988018,0.000008679953,0.00061968906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983283,0.000067813446,0.00029301838,0.000821957,0.00014453633,0.0003443637],"domain_scores_gemma":[0.99854267,0.00014121679,0.00037904715,0.00059798645,0.00025223618,0.000086864624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037694685,0.00026781939,0.00029708238,0.00021848605,0.000110508554,0.00012541366,0.002476066,0.00024460803,0.000036715715],"category_scores_gemma":[0.00006875713,0.00021187571,0.00012914867,0.0007516325,0.00016518081,0.00022122887,0.0012200873,0.000848969,0.00004682891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025775103,0.00008559879,0.0032164177,0.00008276273,0.000017747618,0.000013555251,0.0010675304,0.36792815,0.00006608334,0.62508714,0.00015797582,0.0022512611],"study_design_scores_gemma":[0.00006470328,0.00006849625,0.0011163396,0.0005854437,0.000013590628,0.0000010800405,0.00019971305,0.7788074,0.00091596553,0.21787228,0.000058886857,0.00029609838],"about_ca_topic_score_codex":0.00069352076,"about_ca_topic_score_gemma":0.00005468369,"teacher_disagreement_score":0.41087925,"about_ca_system_score_codex":0.00019902078,"about_ca_system_score_gemma":0.00037058498,"threshold_uncertainty_score":0.8640041},"labels":[],"label_agreement":null},{"id":"W1578134982","doi":"10.3233/kes-2008-12402","title":"Using causal knowledge to guide retrieval and adaptation in case-based reasoning about dynamic processes","year":2008,"lang":"en","type":"article","venue":"International Journal of Knowledge-based and Intelligent Engineering Systems","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Adaptation (eye); Computer science; Model-based reasoning; Cognitive science; Artificial intelligence; Cognitive psychology; Knowledge representation and reasoning; Psychology; Neuroscience","score_opus":0.0354450954732924,"score_gpt":0.2925049134229963,"score_spread":0.2570598179497039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578134982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2495268,0.00615455,0.7427735,0.000072895964,0.0012170449,0.0001319362,0.0000054255966,0.00004311784,0.00007478309],"genre_scores_gemma":[0.96718985,0.00004618115,0.032448445,0.000023208395,0.00020369697,0.000004352881,0.0000028920456,0.000022095268,0.000059290633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819475,0.00008895627,0.0008444363,0.00028712227,0.0003268077,0.00025789536],"domain_scores_gemma":[0.99798524,0.00045792395,0.00029483877,0.00013704284,0.0009202987,0.00020462612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092334696,0.00023608269,0.00032285295,0.0009195541,0.00010219469,0.0001950868,0.00040035186,0.00009331666,0.0000015830012],"category_scores_gemma":[0.0006143642,0.00022813474,0.000057003526,0.0004950985,0.000031935717,0.0003629431,0.000054363474,0.00027694134,0.0000030065542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001318066,0.00012267796,0.0057597854,0.00041488392,0.00008978383,0.0015484911,0.006122719,0.9800022,0.0013179223,0.00045373864,0.00011145995,0.003924505],"study_design_scores_gemma":[0.0005382043,0.00019141244,0.00047480574,0.0027357142,0.0000123928385,0.0032233112,0.00016484334,0.98924595,0.0013037565,0.000004518227,0.0018560833,0.00024898315],"about_ca_topic_score_codex":0.000098034485,"about_ca_topic_score_gemma":0.000037990518,"teacher_disagreement_score":0.71766305,"about_ca_system_score_codex":0.0003761946,"about_ca_system_score_gemma":0.000675464,"threshold_uncertainty_score":0.9303065},"labels":[],"label_agreement":null},{"id":"W1581178003","doi":"10.1007/3-540-45622-8_27","title":"Using Abstraction for Heuristic Search and Planning","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Heuristic; Incremental heuristic search; Abstraction; Null-move heuristic; Consistent heuristic; Beam search; Estimator; Factor (programming language); Search algorithm; Theoretical computer science; Mathematical optimization; Artificial intelligence; Algorithm; Programming language; Mathematics","score_opus":0.07126629346759994,"score_gpt":0.302729903603125,"score_spread":0.23146361013552508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581178003","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003978893,0.0007973293,0.9965111,0.00018544872,0.0009883627,0.0003006304,0.0000056216163,0.00011097382,0.00070264743],"genre_scores_gemma":[0.17737174,0.000020023695,0.8213554,0.00039833738,0.00057086354,0.0000050637286,0.0000049892883,0.000034175475,0.00023938263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746996,0.000022056278,0.00033796177,0.0010892897,0.0005122147,0.00056854513],"domain_scores_gemma":[0.99815303,0.00083918555,0.00015068708,0.0005442534,0.00017201097,0.0001408567],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085734826,0.00034548002,0.0003359073,0.00060348253,0.0004682987,0.00059460895,0.0010102834,0.00025195538,0.0000066202924],"category_scores_gemma":[0.000090294045,0.00034126334,0.00006306846,0.00025368348,0.00026641303,0.0004503904,0.00040514313,0.00066033466,0.000006236853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000090310505,0.000014687444,0.00024000798,0.00017859886,0.000013303872,0.00010130457,0.0016795531,0.57350147,0.0001906568,0.004588333,0.00003509711,0.41944796],"study_design_scores_gemma":[0.00016743033,0.000106561994,0.00008103037,0.00068832224,0.0000071718587,0.00011004584,2.1236646e-7,0.9735983,0.00025730158,0.024188811,0.00039917836,0.0003956479],"about_ca_topic_score_codex":0.000028436452,"about_ca_topic_score_gemma":0.0000037453103,"teacher_disagreement_score":0.4190523,"about_ca_system_score_codex":0.00016574663,"about_ca_system_score_gemma":0.00021087955,"threshold_uncertainty_score":0.9999039},"labels":[],"label_agreement":null},{"id":"W1581836567","doi":"10.1609/socs.v4i1.18281","title":"Active Stratified Sampling with Clustering-Based Type Systems for Predicting the Search Tree Size of Problems with Real-Valued Heuristics","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Regina","keywords":"Heuristics; Cluster analysis; Sampling (signal processing); Heuristic; Partition (number theory); Tree (set theory); Computer science; Type (biology); Mathematics; Chen; Algorithm; Data mining; Mathematical optimization; Artificial intelligence; Combinatorics","score_opus":0.030885213682001034,"score_gpt":0.2737041193050974,"score_spread":0.24281890562309638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581836567","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9389713,0.000061946645,0.036642,0.0065990193,0.004242627,0.0026050396,0.000104325605,0.00017705979,0.010596712],"genre_scores_gemma":[0.99592006,0.000010398996,0.0035843689,0.000029990057,0.00021787218,0.000054867432,0.0000073673605,0.000025437304,0.00014966528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752647,0.00005221517,0.00037920696,0.0004197001,0.0013116566,0.00031075344],"domain_scores_gemma":[0.9954459,0.001277791,0.00033738048,0.00025449463,0.0026175343,0.00006689119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011010896,0.00019018831,0.0002566815,0.000059315582,0.00030389757,0.0003125793,0.0014393775,0.00008219992,0.0000021587941],"category_scores_gemma":[0.0003165107,0.00011641143,0.00007291592,0.00052922923,0.000118245254,0.00019024109,0.00027576025,0.0003801144,4.571369e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0076999343,0.0011900859,0.030474909,0.0025128257,0.0012495859,0.00000862849,0.009139063,0.40811187,0.124824576,0.41292068,0.00050651905,0.001361335],"study_design_scores_gemma":[0.00418189,0.0032840418,0.0018510259,0.00277987,0.000089768364,0.00003634073,0.0011916289,0.8003042,0.18369108,0.0018443726,0.00030410843,0.0004416823],"about_ca_topic_score_codex":0.00032743622,"about_ca_topic_score_gemma":0.000018838686,"teacher_disagreement_score":0.4110763,"about_ca_system_score_codex":0.0001554582,"about_ca_system_score_gemma":0.0005051895,"threshold_uncertainty_score":0.474712},"labels":[],"label_agreement":null},{"id":"W1581863564","doi":"10.1023/a:1011208900462","title":"Feature Weight Maintenance in Case Bases Using Introspective Learning","year":2001,"lang":"en","type":"article","venue":"Journal of Intelligent Information Systems","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"University of California, Irvine; Simon Fraser University","keywords":"Computer science","score_opus":0.017717687549317504,"score_gpt":0.2514292455076879,"score_spread":0.2337115579583704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581863564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034676395,0.00046502452,0.9621959,0.000339922,0.0009232124,0.00012026126,0.0000013747133,0.000030520805,0.001247402],"genre_scores_gemma":[0.9922194,0.000092569055,0.0072646122,0.00012108645,0.00014223784,0.000001927852,0.0000015837579,0.0000050149843,0.00015158641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984231,0.00014081676,0.00076016074,0.000083844665,0.00035168589,0.00024039901],"domain_scores_gemma":[0.9980703,0.00016898758,0.0010014714,0.00014831302,0.0005154887,0.00009545035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012767212,0.00013704045,0.00025869987,0.00052429555,0.00013495095,0.00031775644,0.00032860236,0.00008406981,0.0000063188404],"category_scores_gemma":[0.0001717865,0.00010886448,0.00008339599,0.00057103176,0.000019034946,0.0028146005,0.000051568535,0.00052861177,0.00002406326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009901975,0.000043435928,0.02235395,0.00013932059,0.00006481722,0.0025508679,0.013367885,0.9193575,0.00005884918,0.00809802,0.0035703718,0.030296009],"study_design_scores_gemma":[0.00046775513,0.00021907565,0.00018958419,0.001190893,0.000008679767,0.03822508,0.0057908106,0.86811,0.00035971846,0.000107987405,0.08508793,0.00024247104],"about_ca_topic_score_codex":0.00012574678,"about_ca_topic_score_gemma":0.0000060334905,"teacher_disagreement_score":0.95754296,"about_ca_system_score_codex":0.0003574108,"about_ca_system_score_gemma":0.00012132404,"threshold_uncertainty_score":0.44393647},"labels":[],"label_agreement":null},{"id":"W1584080658","doi":"10.1109/wcre.2004.5","title":"A brief summary of cognitive patterns for program comprehension","year":2005,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Program comprehension; GRASP; Computer science; Comprehension; Focus (optics); Cognition; Pattern language (formal languages); Cognitive science; Human–computer interaction; Artificial intelligence; Cognitive psychology; Programming language; Psychology; Software; Software system","score_opus":0.025151281044243575,"score_gpt":0.286677328820077,"score_spread":0.26152604777583344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584080658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06228758,0.0001357704,0.9338978,0.00062655617,0.00006851163,0.00045736902,0.000016153319,0.0002555067,0.002254748],"genre_scores_gemma":[0.8487385,0.0000028950171,0.15040664,0.00040120012,0.000044769244,0.000034573863,0.000022931197,0.0000053494314,0.00034312916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930024,0.00002611442,0.00016292311,0.00020666678,0.00011779041,0.00018624384],"domain_scores_gemma":[0.9992455,0.00036650363,0.00006684243,0.00015739708,0.00011356773,0.000050137187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014684157,0.00008177656,0.00011906889,0.000046782465,0.000061849845,0.000038753024,0.0002360654,0.000039910257,0.000013762149],"category_scores_gemma":[0.000022934788,0.0000705742,0.000056013025,0.00009705762,0.000018923347,0.00018816548,0.000082059436,0.000058143556,0.000006564756],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033432745,0.00026415326,0.01370123,0.00008035358,0.000027186361,0.000002248571,0.0009858345,0.00032901764,0.00018478616,0.0036052433,0.0056000296,0.97518647],"study_design_scores_gemma":[0.0024889004,0.0014215914,0.016389797,0.0010023209,0.000032990447,0.00001572193,0.00014626025,0.92065597,0.01611883,0.000902143,0.040254455,0.00057103956],"about_ca_topic_score_codex":0.00004738724,"about_ca_topic_score_gemma":0.000017946055,"teacher_disagreement_score":0.97461545,"about_ca_system_score_codex":0.000007790013,"about_ca_system_score_gemma":0.000032688367,"threshold_uncertainty_score":0.28779322},"labels":[],"label_agreement":null},{"id":"W1584671667","doi":"10.1007/3-540-47987-2_51","title":"ASIMIL: Overview of a Distance Learning Flight-Training System","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Distance education; Architecture; Training (meteorology); Software; Artificial intelligence; Human–computer interaction; Virtual reality; Real-time computing; Software engineering; Operating system","score_opus":0.042945078398434894,"score_gpt":0.2523435746889854,"score_spread":0.2093984962905505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584671667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000036595597,0.0040646847,0.983337,0.00022241424,0.0010907486,0.00024735305,0.0000055584214,0.0003182516,0.0106773805],"genre_scores_gemma":[0.5618583,0.00015369366,0.43584463,0.00043561353,0.0004466144,0.000011228596,0.0000075641115,0.00007277892,0.0011695714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995643,0.00009147508,0.00083411904,0.001467792,0.0011708237,0.0007927939],"domain_scores_gemma":[0.9967865,0.0008278851,0.0007297322,0.0012271284,0.00024230193,0.00018646031],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014992529,0.0005907102,0.00090766815,0.00070900464,0.00036822542,0.00036111166,0.003098408,0.00033959895,0.000023761891],"category_scores_gemma":[0.00011487617,0.00055320706,0.0002016061,0.0008201521,0.0004095217,0.00049491297,0.00083211134,0.0012295381,0.000037708414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006988881,0.000022772356,0.0003469484,0.00087479735,0.000033125114,0.00027101845,0.006518124,0.14810234,0.0000681358,0.09731369,0.000045548346,0.74639654],"study_design_scores_gemma":[0.00026084195,0.00023344986,0.000055888162,0.0066644726,0.000016636304,0.00013953474,0.0000016084517,0.9723863,0.00033044626,0.011270336,0.0077556064,0.00088485744],"about_ca_topic_score_codex":0.000020774161,"about_ca_topic_score_gemma":0.00001181549,"teacher_disagreement_score":0.82428396,"about_ca_system_score_codex":0.00029626468,"about_ca_system_score_gemma":0.0003764139,"threshold_uncertainty_score":0.99969196},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04438401684249059,"score_gpt":0.3012732997910121,"score_spread":0.2568892829485215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585557683","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9594037,0.0015794351,0.015908884,0.0041653765,0.0015364733,0.00026786551,0.000010795701,0.0009174102,0.016210046],"genre_scores_gemma":[0.9911872,0.000012917843,0.008051583,0.00037670985,0.00020769222,0.000020859658,0.0000041636413,0.000020845264,0.00011803687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978535,0.00003917639,0.00046730542,0.0004099391,0.0006721712,0.0005578747],"domain_scores_gemma":[0.9984699,0.0004514495,0.0005326263,0.00021406866,0.00019761658,0.0001343748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015564145,0.0003160551,0.00027548874,0.00020362958,0.00072897744,0.00063476147,0.0017988635,0.00013330577,0.000010282099],"category_scores_gemma":[0.0003824864,0.00020571303,0.000093150906,0.0003452545,0.00013542775,0.0008988867,0.00045765855,0.000648117,0.0000065703025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001015674,0.00007173033,0.1509589,0.00009404849,0.00021800626,0.0000062256963,0.021331068,0.022988483,0.00945764,0.79206055,0.0009114282,0.001800332],"study_design_scores_gemma":[0.00039332765,0.00008021648,0.01431891,0.0025086368,0.0000317426,0.00013587365,0.0028749255,0.95803946,0.006884391,0.013778621,0.0005132091,0.00044066977],"about_ca_topic_score_codex":0.000016116433,"about_ca_topic_score_gemma":6.48956e-8,"teacher_disagreement_score":0.93505096,"about_ca_system_score_codex":0.00005560907,"about_ca_system_score_gemma":0.000066730376,"threshold_uncertainty_score":0.83887345},"labels":[],"label_agreement":null},{"id":"W1586636150","doi":"10.1017/cbo9780511794797.006","title":"Propositions and Inference","year":2010,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Falsity; Inference; Epistemology; A priori and a posteriori; Philosophy; Mathematical economics; Computer science; Mathematics","score_opus":0.01814513347940552,"score_gpt":0.19764692487883717,"score_spread":0.17950179139943165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586636150","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005112294,0.00009404892,0.0696673,0.0000636302,0.00017268825,0.00019036734,0.000069144655,0.00023846781,0.92945325],"genre_scores_gemma":[0.0024211244,0.00003278039,0.008621604,0.0000790894,0.000057153782,5.0527154e-7,0.000020211513,0.000016222028,0.9887513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989986,0.000023385044,0.00011180862,0.00048123283,0.00017039184,0.00021461025],"domain_scores_gemma":[0.9988898,0.00011579733,0.0001367218,0.0005698917,0.000117063966,0.00017074955],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008986405,0.00024851866,0.0002173121,0.00014451309,0.00036570284,0.00014434302,0.00071897043,0.00033682009,0.0000019654713],"category_scores_gemma":[0.000008592699,0.0002848869,0.00006896681,0.000008101139,0.00019412686,0.00017535115,0.00059854373,0.0007363125,0.000011761947],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050967587,0.0000030585297,0.000004411079,0.0000376027,0.000026304178,0.00013712198,0.00008009245,0.0000015185707,0.00010624965,0.99448013,0.0026493426,0.0024690786],"study_design_scores_gemma":[0.00024935527,0.00006804643,0.000023744215,0.00024310334,0.000063742096,0.000045870212,0.0000038100088,0.0010341601,0.00042947364,0.00024155741,0.99709445,0.000502689],"about_ca_topic_score_codex":0.00008061651,"about_ca_topic_score_gemma":0.0000024407486,"teacher_disagreement_score":0.9944451,"about_ca_system_score_codex":0.000038398663,"about_ca_system_score_gemma":0.00015046167,"threshold_uncertainty_score":0.9999603},"labels":[],"label_agreement":null},{"id":"W1587152077","doi":"10.3233/aic-140603","title":"Towards a theory of random walk planning: Regress factors, fair homogeneous graphs and extensions","year":2014,"lang":"en","type":"article","venue":"AI Communications","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Random walk; Computer science; Satisficing; Branching (polymer chemistry); Homogeneous; Graph; Theoretical computer science; Mathematics; Artificial intelligence; Statistics; Combinatorics","score_opus":0.03477795111232695,"score_gpt":0.27896515777156766,"score_spread":0.2441872066592407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587152077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08873915,0.009963987,0.8842345,0.006928207,0.000208558,0.00038024486,0.000034163157,0.00052195485,0.008989238],"genre_scores_gemma":[0.96371007,0.00014230672,0.03568923,0.000304463,0.000006069203,0.000016410444,0.000025116782,0.000009954068,0.000096367236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986746,0.00049572147,0.00026685192,0.00022035862,0.00014862034,0.00019390478],"domain_scores_gemma":[0.995775,0.0016114956,0.00014971945,0.002235506,0.00012901129,0.00009930557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007627644,0.00013784264,0.00023130694,0.00013864931,0.00049814844,0.00007294574,0.0016097617,0.000074590534,0.000004598605],"category_scores_gemma":[0.00026938043,0.00011729454,0.00008867399,0.00028048278,0.00022157417,0.00017679494,0.00066915544,0.00025555014,0.0000030471065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003715736,0.00018952688,0.014482527,0.000044187214,0.00013999271,0.0000037848893,0.013550835,0.00067541096,0.00087523984,0.90998554,0.0031851602,0.05683064],"study_design_scores_gemma":[0.0042224242,0.00069728337,0.060512573,0.001153764,0.0002603488,0.00017046413,0.0012793296,0.21450245,0.0032414019,0.64641565,0.06598319,0.0015610958],"about_ca_topic_score_codex":0.00009997125,"about_ca_topic_score_gemma":0.000011645988,"teacher_disagreement_score":0.8749709,"about_ca_system_score_codex":0.000008699293,"about_ca_system_score_gemma":0.000061659215,"threshold_uncertainty_score":0.47831327},"labels":[],"label_agreement":null},{"id":"W1591206524","doi":"10.1007/3-540-44527-7_2","title":"Activating Case-Based Reasoning with Active Databases","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Active database; Computer science; Case-based reasoning; Construct (python library); Property (philosophy); Layer (electronics); Database; Event (particle physics); Action (physics); Reasoning system; Feature (linguistics); Data mining; Architecture; Artificial intelligence; Programming language","score_opus":0.021696966210591983,"score_gpt":0.248133013810236,"score_spread":0.22643604759964403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591206524","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005272213,0.00021456389,0.9913431,0.0003012194,0.0003473514,0.00033600227,0.000022699442,0.00032731664,0.006580566],"genre_scores_gemma":[0.1910066,0.000007274868,0.80734247,0.0011199387,0.0002948264,0.000013191018,0.000026372585,0.00005598234,0.00013337386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99577725,0.000068596775,0.00043190128,0.0018969515,0.000941874,0.00088342547],"domain_scores_gemma":[0.9961787,0.0014288563,0.00040531863,0.0015673185,0.00019198873,0.00022781028],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007487259,0.0006965472,0.0005645158,0.00080573244,0.0007247849,0.00061085314,0.0020259686,0.00022024105,0.000047406316],"category_scores_gemma":[0.00009612097,0.00059376506,0.00009403323,0.0008158241,0.0005232536,0.0010468,0.0005137246,0.0013336794,0.000022980368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031697546,0.00002144313,0.000081917555,0.00004085484,0.000017111288,0.0030764777,0.00079335796,0.17282891,0.000024016208,0.003198123,0.00001376183,0.8198723],"study_design_scores_gemma":[0.0005856973,0.00039168453,0.00005338521,0.003562305,0.000019778105,0.002492129,0.0000010254438,0.97628057,0.0043189027,0.0075985244,0.0031952085,0.0015007788],"about_ca_topic_score_codex":0.00023731145,"about_ca_topic_score_gemma":0.00013898504,"teacher_disagreement_score":0.81837153,"about_ca_system_score_codex":0.00029734167,"about_ca_system_score_gemma":0.0011950562,"threshold_uncertainty_score":0.9996514},"labels":[],"label_agreement":null},{"id":"W1594463172","doi":"10.5555/2484920.2485009","title":"Stratified tree search: a novel suboptimal heuristic search algorithm","year":2013,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Alberta","funders":"","keywords":"Beam search; Incremental heuristic search; Heuristics; Best-first search; Heuristic; Search algorithm; Benchmark (surveying); Algorithm; Computer science; Bidirectional search; Partition (number theory); Depth-first search; Search tree; Null-move heuristic; Iterative deepening depth-first search; Beam stack search; Tree traversal; Consistent heuristic; Mathematical optimization; Mathematics; Combinatorics","score_opus":0.04620001475153443,"score_gpt":0.2618127690073549,"score_spread":0.21561275425582047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594463172","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011088808,0.000044207034,0.9715958,0.0015686116,0.0001241544,0.00023231993,0.000005231442,0.00032585132,0.015015017],"genre_scores_gemma":[0.4386062,0.0000020258224,0.55669564,0.00028864286,0.000079046644,0.000018618333,0.0000088361385,0.0000119831475,0.0042890273],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981419,0.00007722416,0.00023539735,0.00046852202,0.00047187085,0.0006050716],"domain_scores_gemma":[0.9986996,0.0003007117,0.00003049663,0.00055662624,0.00016556914,0.00024698986],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005080629,0.00017310835,0.00016644811,0.00013095423,0.00021408359,0.0005610356,0.0009138783,0.00008089084,0.00034952429],"category_scores_gemma":[0.000026570762,0.00014620887,0.000059667746,0.00039823455,0.00005875886,0.0005427986,0.00024215192,0.0003346305,0.00090909406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013154897,0.0004613904,0.002183795,0.00009773769,0.00010409312,0.00011476401,0.0041168295,0.006604158,0.011536334,0.05935485,0.026568638,0.88884425],"study_design_scores_gemma":[0.00035621223,0.0001657409,0.0035064428,0.000021225555,0.0000027748492,0.00002935088,0.00008277185,0.99293005,0.0018067163,0.0005562981,0.0002973853,0.00024505606],"about_ca_topic_score_codex":0.0011927637,"about_ca_topic_score_gemma":0.000013567429,"teacher_disagreement_score":0.98632586,"about_ca_system_score_codex":0.000031485964,"about_ca_system_score_gemma":0.00018766375,"threshold_uncertainty_score":0.9998688},"labels":[],"label_agreement":null},{"id":"W1599294059","doi":"10.1007/978-3-540-68825-9_8","title":"Use of Fuzzy Histograms to Model the Spatial Distribution of Objects in Case-Based Reasoning","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Jaccard index; Histogram; Artificial intelligence; Representation (politics); Partition (number theory); Fuzzy logic; Granularity; Pattern recognition (psychology); Image (mathematics); Mathematics","score_opus":0.030985713196758934,"score_gpt":0.2376545933230285,"score_spread":0.20666888012626955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599294059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040287585,0.00019579426,0.9945414,0.00029255264,0.00036738717,0.00036505936,0.00002860656,0.00004893986,0.00013149872],"genre_scores_gemma":[0.7380494,0.0000062472473,0.26155865,0.00028689211,0.000046937992,0.0000056709223,0.0000120138075,0.00001326348,0.0000209496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972044,0.00007097384,0.00061532785,0.00086473627,0.0007629869,0.00048156406],"domain_scores_gemma":[0.9972195,0.0008935956,0.00041414815,0.0010984968,0.00026358032,0.00011064768],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008899414,0.00035729347,0.00049008895,0.0004958396,0.0002036237,0.00012299701,0.0015946454,0.00023119088,0.0000011788113],"category_scores_gemma":[0.00024544288,0.00029150295,0.0001192286,0.0008242686,0.00048287027,0.0002851899,0.00051079266,0.0006296633,0.0000016527797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014267686,0.000022347764,0.0002685413,0.000032109947,0.000003429938,0.00019980733,0.0016798094,0.8841187,0.00006251248,0.00097573665,0.000032733333,0.112590045],"study_design_scores_gemma":[0.00016189853,0.00018177925,0.00018259132,0.00082497083,0.0000057795587,0.00014798697,2.3046391e-7,0.99446845,0.0009915053,0.0025916686,0.0001270462,0.00031606873],"about_ca_topic_score_codex":0.0013646452,"about_ca_topic_score_gemma":0.00075790915,"teacher_disagreement_score":0.7340206,"about_ca_system_score_codex":0.00027217946,"about_ca_system_score_gemma":0.0008349766,"threshold_uncertainty_score":0.9999537},"labels":[],"label_agreement":null},{"id":"W1600816025","doi":"10.3386/w17022","title":"The Quantification of Systemic Risk and Stability: New Methods and Measures","year":2011,"lang":"en","type":"report","venue":"National Bureau of Economic Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Atomic Energy (Canada)","funders":"","keywords":"Systemic risk; Computer science; Economics","score_opus":0.5486109751741872,"score_gpt":0.5318565877911465,"score_spread":0.016754387383040692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600816025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023715816,0.22989081,0.4242702,0.0032503011,0.0036363762,0.0063590785,0.00041068974,0.00019984118,0.30826688],"genre_scores_gemma":[0.9446126,0.013790073,0.03965789,0.0000040583336,0.0002556556,0.00006943074,0.000038876427,0.000025979012,0.0015454233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968973,0.0009904784,0.0006496813,0.00046773773,0.0007860318,0.00020878772],"domain_scores_gemma":[0.9923693,0.0051169377,0.0005849901,0.000500243,0.0013393718,0.0000891713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.028722472,0.0001267164,0.00033154458,0.0003166124,0.0002355219,0.000117416836,0.00067747745,0.00020155008,0.000008401817],"category_scores_gemma":[0.002895537,0.00009852917,0.00005786658,0.00013873684,0.0002776592,0.0001568913,0.00024294606,0.00048660458,0.0000033502295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008927252,0.00004270179,0.016586306,0.0009623962,0.00040784274,8.7410297e-7,0.0021365976,0.00025241653,0.0013025432,0.53817487,0.016677333,0.42336687],"study_design_scores_gemma":[0.00059535267,0.00034818717,0.008021702,0.0009867721,0.00006248781,0.000111130226,0.0002908954,0.026546802,0.0056001814,0.933507,0.023413895,0.0005155682],"about_ca_topic_score_codex":0.0043342467,"about_ca_topic_score_gemma":0.0001147332,"teacher_disagreement_score":0.92089677,"about_ca_system_score_codex":0.00023247032,"about_ca_system_score_gemma":0.0035259866,"threshold_uncertainty_score":0.99546933},"labels":[],"label_agreement":null},{"id":"W1600934435","doi":"10.1109/ictta.2006.1684859","title":"A Hierarchical Task Network Planning Approach for Optimizing Energy Production","year":2006,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Task (project management); Hydroelectricity; Computer science; Production (economics); Production planning; Process (computing); Hydropower; Software; Industrial engineering; Systems engineering; Engineering; Electrical engineering","score_opus":0.016842996811832874,"score_gpt":0.2247104390185195,"score_spread":0.20786744220668663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600934435","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038666898,0.00028873503,0.9872069,0.0005355379,0.00029386402,0.00012803031,7.252984e-7,0.00040288863,0.010756664],"genre_scores_gemma":[0.211435,9.837813e-7,0.7855588,0.00022998593,0.00087032904,0.000058093097,0.000039553302,0.000012084382,0.0017951251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985963,0.00006158622,0.0002235158,0.0004979879,0.0001659139,0.0004546756],"domain_scores_gemma":[0.99937016,0.0001416188,0.000075699565,0.000306811,0.000046276335,0.000059441547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005081232,0.00014356167,0.0001492018,0.000073642055,0.00036370414,0.00017347699,0.00037809575,0.000087917535,0.0000018677308],"category_scores_gemma":[0.000022783343,0.00012808865,0.00006496635,0.00031460542,0.000024008881,0.00027374184,0.000090540816,0.00014654097,0.0000014625942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015871361,0.000038235452,0.00048336247,0.000017880242,0.000010611053,0.0000028355096,0.00016317476,0.84895283,0.00022409498,0.1024028,0.041133735,0.0065545873],"study_design_scores_gemma":[0.0001979157,0.000069850445,0.00010612328,0.000034091445,0.00000603757,0.00002798156,0.000012308757,0.9743502,0.0005110213,0.009310894,0.015134936,0.00023864706],"about_ca_topic_score_codex":0.00007802331,"about_ca_topic_score_gemma":0.0000018338792,"teacher_disagreement_score":0.21104833,"about_ca_system_score_codex":0.000025009522,"about_ca_system_score_gemma":0.00004725693,"threshold_uncertainty_score":0.52233034},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Artificial intelligence; Engineering; Computer science","score_opus":0.10560148907867185,"score_gpt":0.19831574344406228,"score_spread":0.09271425436539042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601278281","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8784969,0.000044196266,0.10526492,0.0005845192,0.00072512665,0.0007029118,0.000017140857,0.00015332157,0.014010979],"genre_scores_gemma":[0.99862456,0.000045922257,0.00070093723,0.000070177586,0.000030721232,0.0000017882412,0.000001948793,0.000008677764,0.0005152392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832344,0.00006644471,0.00029482975,0.0008256909,0.0001461623,0.0003434396],"domain_scores_gemma":[0.99853987,0.0001305979,0.0003856572,0.0005998857,0.00025739436,0.00008658033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000357705,0.00027018675,0.00029921753,0.00022556155,0.00011373942,0.00012462151,0.0025003306,0.00024716608,0.00005600253],"category_scores_gemma":[0.000057709884,0.00023242748,0.00012987525,0.00074052176,0.00016496182,0.00022546889,0.0012288848,0.0008444451,0.000063743704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023074012,0.000081930666,0.0026327143,0.000077357596,0.000017425018,0.000013006486,0.00060041924,0.20704855,0.000057514775,0.7877516,0.000351374,0.0013450239],"study_design_scores_gemma":[0.0000712109,0.00007094534,0.0011438822,0.0006368824,0.000015139039,0.0000011800599,0.00015992361,0.81443334,0.0011357954,0.18193424,0.000074407755,0.0003230521],"about_ca_topic_score_codex":0.0005306592,"about_ca_topic_score_gemma":0.00004784202,"teacher_disagreement_score":0.6073848,"about_ca_system_score_codex":0.00014997763,"about_ca_system_score_gemma":0.0002501348,"threshold_uncertainty_score":0.9478118},"labels":[],"label_agreement":null},{"id":"W1601612254","doi":"","title":"A situation-calculus semantics for an expressive fragment of PDDL","year":2007,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Rotation formalisms in three dimensions; Situation calculus; Computer science; Fragment (logic); Programming language; Semantics (computer science); Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.02860599691510556,"score_gpt":0.2939516641617928,"score_spread":0.26534566724668723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601612254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028364494,0.000037769405,0.9691822,0.00021972336,0.00011413637,0.0001498632,0.0000020669463,0.000068232825,0.0018615234],"genre_scores_gemma":[0.7149181,7.4091975e-7,0.28462183,0.00017797624,0.00003455815,0.0000045490315,0.0000048065963,0.0000034678378,0.00023400402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992688,0.000015645765,0.00019115773,0.00017790307,0.00015947242,0.00018702407],"domain_scores_gemma":[0.99921745,0.00023810957,0.000090020745,0.00027119837,0.000114893046,0.00006831079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052685366,0.000068850044,0.000094738025,0.00006002886,0.00007722028,0.00003488901,0.0003106242,0.000043346412,0.000009082077],"category_scores_gemma":[0.000036176705,0.000059451562,0.000036745623,0.00011529748,0.000014303311,0.0002033157,0.00005066571,0.000042083575,0.000004865992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011432526,0.0006779091,0.0075173173,0.00029382296,0.000117377655,0.00002631408,0.02798272,0.01523329,0.04894544,0.71656966,0.016177665,0.16634415],"study_design_scores_gemma":[0.00078278483,0.00064063905,0.0017035122,0.00009373856,0.000014875314,0.000006262108,0.00039560246,0.8484695,0.13625194,0.008063324,0.003264921,0.00031290637],"about_ca_topic_score_codex":0.000037422305,"about_ca_topic_score_gemma":0.000013368403,"teacher_disagreement_score":0.8332362,"about_ca_system_score_codex":0.000011990027,"about_ca_system_score_gemma":0.000038652965,"threshold_uncertainty_score":0.24243644},"labels":[],"label_agreement":null},{"id":"W1604763789","doi":"10.1007/978-3-540-24581-0_56","title":"Towards Automated Creation of Image Interpretation Systems","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Software portability; Artificial intelligence; Robustness (evolution); Domain (mathematical analysis); Task (project management); Process (computing); Software engineering; Systems engineering; Programming language; Engineering","score_opus":0.011157792632082442,"score_gpt":0.2512012808586639,"score_spread":0.24004348822658145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604763789","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060161736,0.0005570971,0.9886799,0.00022321587,0.0015633795,0.00030402263,0.000007174432,0.0003617131,0.008243348],"genre_scores_gemma":[0.36509314,0.000023559696,0.6339103,0.0004709172,0.00014372183,0.000010679277,0.000021334696,0.00003652408,0.00028979473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972077,0.00007882406,0.00062262913,0.0009194271,0.0007771467,0.00039428257],"domain_scores_gemma":[0.9977764,0.0003358938,0.00051143277,0.0008760074,0.00040159532,0.00009870444],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011483226,0.00037274006,0.00048668994,0.00076123554,0.00014073263,0.0004365861,0.001632336,0.00028115103,0.000008303875],"category_scores_gemma":[0.00013480372,0.00034680215,0.0000948517,0.000557289,0.00034315445,0.0006233196,0.0003149177,0.00044622974,0.00001733318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019052297,0.00004942786,0.000116009156,0.00046220355,0.000042866308,0.000089063506,0.004303456,0.428509,0.0012244647,0.036218323,0.0003179054,0.52864826],"study_design_scores_gemma":[0.00014413382,0.00014449916,0.000053176962,0.0009988582,0.000008614228,0.000043436386,2.3823802e-7,0.9812826,0.0015170898,0.015134505,0.00031833063,0.00035454583],"about_ca_topic_score_codex":0.000072025156,"about_ca_topic_score_gemma":0.0000067311917,"teacher_disagreement_score":0.5527736,"about_ca_system_score_codex":0.00022974503,"about_ca_system_score_gemma":0.00046540107,"threshold_uncertainty_score":0.9998984},"labels":[],"label_agreement":null},{"id":"W1605270666","doi":"10.1109/iat.2004.115","title":"Using event-streams for fault-management in MAS","year":2004,"lang":"en","type":"article","venue":"IEEE/WIC/ACM International Conference on Intelligent Agent Technology","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Dependability; Computer science; Software deployment; Fault management; Event (particle physics); Component (thermodynamics); Key (lock); Fault (geology); Domain (mathematical analysis); Distributed computing; Computer security; Software engineering; Engineering","score_opus":0.10509616986138848,"score_gpt":0.35929660470633973,"score_spread":0.25420043484495125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1605270666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054385457,0.000083183004,0.93016833,0.00911599,0.0019862587,0.00067033333,0.000021864567,0.00039180613,0.0031767925],"genre_scores_gemma":[0.9113178,0.00011681855,0.08744322,0.00033783706,0.00007139222,0.00015990515,0.000027446653,0.000021298965,0.00050423434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754447,0.000037129037,0.0006134912,0.0008093886,0.00043743322,0.0005581198],"domain_scores_gemma":[0.9985221,0.00009493549,0.00024403408,0.0008145732,0.00023917577,0.000085164014],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003099125,0.00033131987,0.00028218856,0.0011050993,0.00013778168,0.00016581509,0.002734418,0.0002491814,0.00007172071],"category_scores_gemma":[0.00012023001,0.0003376158,0.00012801752,0.00054657203,0.00010546127,0.00024125302,0.00041365917,0.00040036117,0.00015362607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005742201,0.00031292278,0.0006501802,0.000029711839,0.00013325145,0.00016640594,0.00043507898,0.028736409,0.0017198162,0.8617093,0.00031383045,0.10573566],"study_design_scores_gemma":[0.0022512046,0.00082762924,0.000121840356,0.0011446683,0.000038767696,0.00012404448,0.00080740306,0.36280867,0.08103262,0.53237706,0.017293826,0.00117226],"about_ca_topic_score_codex":0.00010421472,"about_ca_topic_score_gemma":0.00006150147,"teacher_disagreement_score":0.8569324,"about_ca_system_score_codex":0.00054766977,"about_ca_system_score_gemma":0.00014215385,"threshold_uncertainty_score":0.9999076},"labels":[],"label_agreement":null},{"id":"W1613844723","doi":"10.1609/socs.v5i1.18331","title":"Reaching the Goal in Real-Time Heuristic Search: Scrubbing Behavior is Unavoidable","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristic; Computer science; Bounded function; Computation; Data scrubbing; Mathematical optimization; Field (mathematics); State (computer science); State space; Algorithm; Mathematics; Artificial intelligence","score_opus":0.023964816352057803,"score_gpt":0.27308998156429953,"score_spread":0.24912516521224173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1613844723","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9584393,0.000034294993,0.000080419464,0.015687566,0.0023420865,0.00039887114,0.000013567442,0.00008469745,0.022919225],"genre_scores_gemma":[0.99751973,0.000025243915,0.00069845025,0.00021741011,0.00026845824,0.00003352743,0.0000037971056,0.000020137037,0.0012132355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971256,0.0000864207,0.00040946103,0.0005013536,0.001455971,0.0004211471],"domain_scores_gemma":[0.998271,0.00053320517,0.0001495167,0.00029936238,0.0006628978,0.00008405718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019832605,0.00018292983,0.00021117712,0.00012100749,0.00037806112,0.0005260245,0.002627709,0.00009866036,0.000036775462],"category_scores_gemma":[0.00027738925,0.0001349968,0.00012775444,0.00068303803,0.00008791283,0.0003826825,0.001139081,0.00075688,0.000032435255],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024105988,0.00094334694,0.059923824,0.00012550967,0.00012992552,0.000048494978,0.008704294,0.0013129264,0.41921768,0.5012119,0.0059178937,0.002223151],"study_design_scores_gemma":[0.0042931517,0.00072536094,0.02055033,0.002202974,0.00007029053,0.00017040696,0.0007940219,0.12445071,0.80135155,0.03880627,0.0054478757,0.001137045],"about_ca_topic_score_codex":0.00081507565,"about_ca_topic_score_gemma":0.0000037048824,"teacher_disagreement_score":0.46240562,"about_ca_system_score_codex":0.00033725082,"about_ca_system_score_gemma":0.00023496484,"threshold_uncertainty_score":0.5505009},"labels":[],"label_agreement":null},{"id":"W1615689114","doi":"10.1109/pacrim.1995.519584","title":"Dynamic simulation of robot manipulators using graphical programming packages","year":2002,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Robot; Visual programming language; Dynamic simulation; Graphical user interface; Robot manipulator; Software; Software package; Dynamic programming; Simulation; Control engineering; Programming by demonstration; Artificial intelligence; Programming language; Engineering","score_opus":0.04153300585195886,"score_gpt":0.2779085368929178,"score_spread":0.23637553104095893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1615689114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077526346,0.00022970806,0.92153543,0.00009253546,0.00012438369,0.000079245874,2.474238e-7,0.00017548115,0.00023663636],"genre_scores_gemma":[0.8252249,0.000004576065,0.17465776,0.000012712246,0.00000773185,9.925519e-7,8.7302374e-7,0.00000597326,0.00008448765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904794,0.000041608026,0.0002398365,0.00021997171,0.00020510501,0.00024556296],"domain_scores_gemma":[0.9993427,0.00018078586,0.000100410696,0.00025672116,0.000054267435,0.00006513266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020704775,0.00009840604,0.00011603746,0.00010972127,0.00017579437,0.00009908018,0.00025871603,0.00006497236,0.0000109595785],"category_scores_gemma":[0.000033175253,0.000089781184,0.00005658462,0.00037414816,0.000032025036,0.00027182425,0.00006419443,0.00009208702,0.0000059558192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003758682,0.00007466821,0.017967679,0.00004682972,0.000027799664,0.000013617564,0.00043458218,0.80391705,0.0010515511,0.009877394,0.00003290049,0.1665522],"study_design_scores_gemma":[0.000096144555,0.000047039415,0.0008887865,0.0000357546,0.000004117598,0.0000038807552,0.000010794134,0.9978123,0.00017162888,0.00064619374,0.00016983908,0.0001135265],"about_ca_topic_score_codex":0.000024542698,"about_ca_topic_score_gemma":0.0000064508545,"teacher_disagreement_score":0.74769855,"about_ca_system_score_codex":0.000021748669,"about_ca_system_score_gemma":0.000008847046,"threshold_uncertainty_score":0.36611703},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.328713626214809,"score_gpt":0.4722555756749504,"score_spread":0.14354194946014143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1621585639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0692778,0.00032118193,0.9258031,0.0024625892,0.00063981523,0.00009966575,5.015937e-7,0.000034749668,0.0013605729],"genre_scores_gemma":[0.9816054,0.000058138547,0.017715788,0.000039710456,0.0004472051,0.0000043592636,5.5444144e-7,0.000011802211,0.000117058284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971448,0.00034508144,0.00064916664,0.00025334567,0.0010001569,0.000607432],"domain_scores_gemma":[0.99646413,0.0014110873,0.0003203015,0.0002813433,0.0012755452,0.00024758416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034505748,0.00013575668,0.00022445135,0.0005457481,0.0005286296,0.0005403721,0.00092033064,0.00006662449,0.0000955862],"category_scores_gemma":[0.0008006478,0.000104250794,0.00007401509,0.0014345549,0.0001345827,0.00094391016,0.00014891702,0.0013620319,0.000080999765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039827861,0.0004778474,0.006557595,0.000039675753,0.0001503666,0.0014806936,0.011758571,0.09565782,0.0052089514,0.033391714,0.002105069,0.84277344],"study_design_scores_gemma":[0.00027272035,0.00441494,0.00042127827,0.0028431725,0.000040783172,0.003204652,0.0150249805,0.80771,0.08076125,0.014654701,0.06973782,0.00091372465],"about_ca_topic_score_codex":0.000056827517,"about_ca_topic_score_gemma":0.000015409576,"teacher_disagreement_score":0.9123276,"about_ca_system_score_codex":0.00011551314,"about_ca_system_score_gemma":0.0004463054,"threshold_uncertainty_score":0.59174263},"labels":[],"label_agreement":null},{"id":"W1621699515","doi":"","title":"AUTONOMOUS ROBOTICS TOOLBOX","year":2005,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Toolbox; Computer science; Robotics; Artificial intelligence; Robot; Java; Finite-state machine; Code (set theory); Task (project management); Software engineering; Human–computer interaction; Embedded system; Systems engineering; Programming language; Engineering; Set (abstract data type)","score_opus":0.014600160136504859,"score_gpt":0.22815741308038212,"score_spread":0.21355725294387726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1621699515","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006045147,0.000102586215,0.92743003,0.0065677,0.00014581127,0.00003517058,2.9712731e-7,0.0004374358,0.06467648],"genre_scores_gemma":[0.3895314,0.0000014291805,0.6021238,0.0015737622,0.00010177552,0.0000016033945,0.0000010659534,0.000004169757,0.006660979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993673,0.00001712258,0.00011743246,0.00018283249,0.000105954576,0.00020937172],"domain_scores_gemma":[0.99949956,0.00006414497,0.000027496813,0.00031738766,0.000023433258,0.00006798899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015776079,0.00007356737,0.00007022684,0.000039378327,0.00009017138,0.00012446044,0.00045879945,0.000037696147,0.0000626618],"category_scores_gemma":[0.000011847346,0.000064222666,0.000029276747,0.00012529524,0.000010175516,0.0003007308,0.00006617343,0.00008937351,0.0005437512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018273703,0.00006194785,0.0017580478,0.000008467583,0.000014918551,0.000019754507,0.0009927881,0.17687455,0.00017468637,0.43642786,0.043215346,0.3404498],"study_design_scores_gemma":[0.00016504651,0.00005125081,0.00054661353,0.000010976232,0.000002808382,0.000025431971,0.0000085203255,0.8690946,0.0011967232,0.0014365533,0.12723324,0.00022824125],"about_ca_topic_score_codex":0.000016572145,"about_ca_topic_score_gemma":0.000006947291,"teacher_disagreement_score":0.69222003,"about_ca_system_score_codex":0.00002574222,"about_ca_system_score_gemma":0.000053304906,"threshold_uncertainty_score":0.6989003},"labels":[],"label_agreement":null},{"id":"W1630075807","doi":"10.1109/robot.1991.131583","title":"Learning error-recovery strategies in telerobotic systems","year":2002,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Focus (optics); Computer science; Artificial intelligence; Reduction (mathematics); Operator (biology); Machine learning; Mathematics","score_opus":0.029443829493415476,"score_gpt":0.22816442855344687,"score_spread":0.1987205990600314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1630075807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0605197,0.0014370063,0.8368936,0.0006050166,0.0006990529,0.0001734681,3.482179e-7,0.0007098427,0.09896193],"genre_scores_gemma":[0.98668694,0.0000130814815,0.008780194,0.000066107175,0.0000342863,0.000006719149,8.5101226e-7,0.0000066882385,0.004405114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989558,0.00010850208,0.00020493903,0.0002637135,0.00016151536,0.00030556315],"domain_scores_gemma":[0.99946445,0.00017831406,0.00005647075,0.00022665506,0.000021917127,0.000052174968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030060462,0.000112035974,0.00014277828,0.00013629769,0.00009796978,0.0004077799,0.00039115516,0.0000611109,0.00006278835],"category_scores_gemma":[0.000028061222,0.000100746496,0.000030602518,0.00033307978,0.000013968997,0.0006835544,0.00006694349,0.0002491975,0.00026198704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000122573,0.000027252234,0.005826669,0.00003923693,0.000007511329,0.000053013922,0.001303808,0.9634909,0.00008456322,0.01961669,0.0018463777,0.00770272],"study_design_scores_gemma":[0.00015217486,0.00011301053,0.001113578,0.00009731115,0.0000013469397,0.000017283815,0.0004937087,0.99618894,0.000014364542,0.00044169914,0.0011797211,0.00018683959],"about_ca_topic_score_codex":0.00029229952,"about_ca_topic_score_gemma":0.00002095232,"teacher_disagreement_score":0.92616725,"about_ca_system_score_codex":0.00003315389,"about_ca_system_score_gemma":0.000026438687,"threshold_uncertainty_score":0.4108323},"labels":[],"label_agreement":null},{"id":"W1669368914","doi":"10.1007/978-3-540-24677-0_83","title":"Expertise in a Hybrid Diagnostic-Recommendation System for SMEs: A Successful Real-Life Application","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science; Recommender system; World Wide Web","score_opus":0.015227481876837447,"score_gpt":0.2526122738036633,"score_spread":0.23738479192682585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1669368914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002502114,0.00031332817,0.99511886,0.0012522745,0.0009844701,0.0011553543,0.000021867703,0.00026807518,0.0006355724],"genre_scores_gemma":[0.83120185,0.00003544701,0.1673756,0.0007123613,0.00033933355,0.00021036596,0.000064123895,0.000037452784,0.000023487333],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99643767,0.000050398274,0.0007452052,0.0015793258,0.00052283495,0.0006645861],"domain_scores_gemma":[0.9966203,0.0015607675,0.00044848936,0.0009679427,0.00020847563,0.00019400522],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012144598,0.00049248105,0.00054549397,0.000828994,0.00028410464,0.0004963434,0.002117584,0.0002538274,0.000005652193],"category_scores_gemma":[0.00027481315,0.00048728817,0.000108586784,0.00051844347,0.00018022928,0.0006428153,0.00043685077,0.00050742144,0.000020575439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019958856,0.00005227105,0.00057410356,0.00036841992,0.000011263816,0.000052309297,0.0018131563,0.13560317,0.000052715735,0.02611852,0.00004986133,0.83528423],"study_design_scores_gemma":[0.0007174893,0.00018157084,0.00017444474,0.0017653998,0.000009073557,0.000039710023,0.0000010153009,0.96322054,0.0009914414,0.03174833,0.0004263746,0.0007246375],"about_ca_topic_score_codex":0.0004116145,"about_ca_topic_score_gemma":0.00017467508,"teacher_disagreement_score":0.8345596,"about_ca_system_score_codex":0.0010388802,"about_ca_system_score_gemma":0.00092640053,"threshold_uncertainty_score":0.9997579},"labels":[],"label_agreement":null},{"id":"W1679808956","doi":"10.1109/iceccs.2012.41","title":"Translating PDDL into CSP# - The PAT Approach","year":2012,"lang":"en","type":"article","venue":"Institutional Knowledge (InK) - Institutional Knowledge at Singapore Management University (Singapore Management University)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Model checking; Notation; Set (abstract data type); Modeling language; Domain (mathematical analysis); Process (computing); State (computer science); Programming language; Automated planning and scheduling; Software; Software engineering; Artificial intelligence; Theoretical computer science","score_opus":0.0196021583306767,"score_gpt":0.21070424978058336,"score_spread":0.19110209144990667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1679808956","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050224303,0.0012582588,0.36693132,0.0008075205,0.0017623798,0.0010625224,0.000036189045,0.00074788736,0.6223715],"genre_scores_gemma":[0.8886767,0.0002651731,0.04968885,0.00024472352,0.00055264344,0.0000081578055,0.0005215531,0.000053323212,0.059988882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9943978,0.00059977226,0.00067464606,0.0016282755,0.0011171724,0.0015823079],"domain_scores_gemma":[0.9969232,0.00024052811,0.0004435587,0.0013440568,0.00041302442,0.0006356168],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0016520626,0.0009996546,0.0006263063,0.00194471,0.007949097,0.0003375466,0.0037222195,0.00035347615,0.000105559666],"category_scores_gemma":[0.000036042973,0.0010283383,0.000587785,0.0040159575,0.0014897707,0.0034415142,0.0038353698,0.00089802744,0.0007482825],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015111508,0.0011910918,0.0022486497,0.000623348,0.0007775662,0.0006230153,0.004120204,0.006575584,0.000022973685,0.94786364,0.0059651393,0.029837703],"study_design_scores_gemma":[0.0027131762,0.00007699201,0.0029316926,0.00053053227,0.00056729413,0.00010502458,0.0021519393,0.020265624,0.000037285892,0.0010957147,0.9681245,0.0014002274],"about_ca_topic_score_codex":0.00009570157,"about_ca_topic_score_gemma":0.00015818696,"teacher_disagreement_score":0.96215934,"about_ca_system_score_codex":0.003667639,"about_ca_system_score_gemma":0.000484727,"threshold_uncertainty_score":0.9992167},"labels":[],"label_agreement":null},{"id":"W168545986","doi":"","title":"Collaborative behavior-based approach for robot natural language interfaces","year":2006,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Knowledge base; Computer science; Human–computer interaction; Robot; Natural language; Service robot; Personal robot; Knowledge-based systems; Ambiguity; Social robot; Artificial intelligence; Robot control; Mobile robot; Programming language","score_opus":0.008145949912052282,"score_gpt":0.2502645886549848,"score_spread":0.24211863874293252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W168545986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015122701,0.0005723521,0.9789119,0.0002602814,0.00016758179,0.00034943473,0.000013561168,0.00030942608,0.00429276],"genre_scores_gemma":[0.6245365,9.712531e-8,0.3741399,0.00013059055,0.00003782361,0.00006383635,0.000046547575,0.0000058169794,0.0010388559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990831,0.000043072883,0.00015784222,0.00031833348,0.00014174159,0.00025589205],"domain_scores_gemma":[0.9993988,0.0001413674,0.00006852717,0.00025392574,0.00010096743,0.000036399077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019140913,0.0001377256,0.00013429312,0.00007478726,0.00014389961,0.00019838542,0.00045858105,0.00005510393,0.0000091141565],"category_scores_gemma":[0.000014554717,0.00011177813,0.000045922145,0.00029919014,0.000029275006,0.00022674455,0.000050155515,0.00010743366,0.000007001641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005371874,0.0028330507,0.03552816,0.00060473074,0.00019809802,0.00017920598,0.014279928,0.33695638,0.106051944,0.17300676,0.16548602,0.16433851],"study_design_scores_gemma":[0.0010025527,0.00028578678,0.0012634783,0.000027716365,0.000019778026,0.0000062426125,0.00041785208,0.9293128,0.06562934,0.00018857027,0.0013478714,0.0004980145],"about_ca_topic_score_codex":0.00015856874,"about_ca_topic_score_gemma":0.00002848597,"teacher_disagreement_score":0.60941386,"about_ca_system_score_codex":0.000029257284,"about_ca_system_score_gemma":0.00007804972,"threshold_uncertainty_score":0.45581797},"labels":[],"label_agreement":null},{"id":"W1700149322","doi":"10.1007/978-3-642-21043-3_50","title":"Partial Evaluation for Planning in Multiagent Expedition","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Speedup; Testbed; Computer science; Plan (archaeology); Computation; Partial evaluation; Distributed computing; Artificial intelligence; Operations research; Theoretical computer science; Parallel computing; Algorithm; Mathematics; Computer network","score_opus":0.06982681356884493,"score_gpt":0.302490180746989,"score_spread":0.2326633671781441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1700149322","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022688461,0.00053532503,0.9951223,0.00021482758,0.0019976667,0.00075554004,0.000005521599,0.00010141003,0.0010405204],"genre_scores_gemma":[0.4975385,0.000010316431,0.50059855,0.00072171167,0.0008299823,0.00012387788,0.00004398451,0.00003674329,0.00009634456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99684453,0.000059660175,0.0005060982,0.0012097234,0.0007967232,0.000583277],"domain_scores_gemma":[0.9981087,0.000574474,0.00029194643,0.0006917118,0.00022515225,0.00010804216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002423441,0.0003671112,0.0003478943,0.0007483902,0.00021870076,0.00025563312,0.0014301763,0.0002968173,0.000022848388],"category_scores_gemma":[0.00016780029,0.00036276007,0.00009072387,0.00029906424,0.00016727808,0.0005729851,0.00035061577,0.00051370106,0.00001480837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020980267,0.0000328876,0.00026527263,0.000050636278,0.000007130624,0.00003733875,0.0053382586,0.25477734,0.00008097147,0.0055713006,0.00008012525,0.73373777],"study_design_scores_gemma":[0.00045492523,0.00017093644,0.0001771954,0.0006532689,0.000007901507,0.000011706129,2.8468233e-7,0.89907897,0.0010281478,0.09726252,0.00072129554,0.00043286744],"about_ca_topic_score_codex":0.000036390193,"about_ca_topic_score_gemma":0.00003281293,"teacher_disagreement_score":0.7333049,"about_ca_system_score_codex":0.00031837303,"about_ca_system_score_gemma":0.0005320998,"threshold_uncertainty_score":0.99988246},"labels":[],"label_agreement":null},{"id":"W1704928189","doi":"10.3384/diss.diva-119445","title":"Troubleshooting Trucks: Automated Planning and Diagnosis","year":2015,"lang":"en","type":"book","venue":"Linköping University Electronic Press eBooks","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Engineering Link (Canada)","funders":"Linköpings Universitet","keywords":"Troubleshooting; Truck; Planner; Computer science; Listing (finance); Operations research; Control (management); Engineering; Reliability engineering; Automotive engineering; Artificial intelligence","score_opus":0.02466520059359713,"score_gpt":0.2247445853265204,"score_spread":0.20007938473292325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1704928189","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004967755,0.012496506,0.060128815,0.0001690824,0.00049476826,0.00081818143,0.000042873555,0.005803041,0.91954994],"genre_scores_gemma":[0.017496465,0.00028368295,0.009663183,0.000310408,0.00046033142,0.000011374425,0.00015945818,0.00015365052,0.9714615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970858,0.00019323041,0.0003056828,0.0009702862,0.0004273362,0.0010176743],"domain_scores_gemma":[0.99807227,0.00039379077,0.0004311286,0.0006687395,0.00015096845,0.00028312378],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060688757,0.00052855955,0.0005971369,0.0003531582,0.00052775926,0.00030214275,0.001439683,0.0005851303,0.0000020327739],"category_scores_gemma":[0.00003891973,0.00063941145,0.00012747472,0.00006637864,0.000107378066,0.00034331382,0.0008271817,0.0013996438,0.000005788418],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023298482,0.000086300475,0.00059834326,0.0012365788,0.001630733,0.0016658943,0.01660315,0.0066825463,0.000051020386,0.6871112,0.2290157,0.055085573],"study_design_scores_gemma":[0.001400624,0.00035018823,0.000015107721,0.0018634901,0.00022383728,0.000086891945,0.00005254341,0.13171051,0.000121821606,0.007004812,0.8558235,0.0013466404],"about_ca_topic_score_codex":0.00016177536,"about_ca_topic_score_gemma":0.000017506001,"teacher_disagreement_score":0.6801064,"about_ca_system_score_codex":0.0008466881,"about_ca_system_score_gemma":0.0016377915,"threshold_uncertainty_score":0.9996057},"labels":[],"label_agreement":null},{"id":"W172987266","doi":"","title":"Generating Domain-Specific Planners through Automatic Parameter Configuration in LPG","year":2011,"lang":"en","type":"article","venue":"University of Huddersfield Repository (University of Huddersfield)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Planner; Domain (mathematical analysis); Set (abstract data type); Parametric statistics; Computer science; Range (aeronautics); Mathematical optimization; Scale (ratio); Artificial intelligence; Engineering; Mathematics","score_opus":0.02471241361564298,"score_gpt":0.1774740103866368,"score_spread":0.15276159677099382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W172987266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09098798,0.0003920376,0.57528335,0.00049004465,0.0004591618,0.00031741813,0.0000041065787,0.00018545963,0.33188045],"genre_scores_gemma":[0.8635257,0.000050114046,0.13587125,0.000052517713,0.000017603885,6.760038e-8,0.000004625155,0.000006963636,0.00047117588],"study_design_codex":"not_applicable","study_design_gemma":"qualitative","domain_scores_codex":[0.9984109,0.00020775014,0.00026770143,0.00048344734,0.00029836947,0.00033182968],"domain_scores_gemma":[0.99856204,0.00025850857,0.000390955,0.0005716678,0.000121586185,0.00009523793],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023939768,0.00020958664,0.00038413078,0.00023647495,0.00041360632,0.00002637887,0.0009968199,0.00028716002,0.0032489984],"category_scores_gemma":[0.000011025855,0.00027809278,0.00018802415,0.0003467131,0.00024642353,0.00090512563,0.00018788235,0.00034830268,0.000011225123],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056773843,0.00085952575,0.012929721,0.0005723674,0.0005975588,0.00309458,0.36597842,0.0037835913,0.020167131,0.042581555,0.5363925,0.012475326],"study_design_scores_gemma":[0.002564694,0.00061928394,0.0004992942,0.0004358645,0.000078592086,0.000068756046,0.96144164,0.023252698,0.0071762633,0.002154312,0.00088831905,0.0008202669],"about_ca_topic_score_codex":0.0018861691,"about_ca_topic_score_gemma":0.00016235738,"teacher_disagreement_score":0.7725377,"about_ca_system_score_codex":0.0000032355845,"about_ca_system_score_gemma":0.00012977392,"threshold_uncertainty_score":0.9999671},"labels":[],"label_agreement":null},{"id":"W1758878976","doi":"10.1007/3-540-45065-3_12","title":"Authoring Cases from Free-Text Maintenance Data","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Bottleneck; Computer science; Order (exchange); Authoring system; Natural language; Text messaging; Software engineering; Natural language processing; World Wide Web; Multimedia; Embedded system","score_opus":0.06487594548208223,"score_gpt":0.28588465463466084,"score_spread":0.22100870915257861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1758878976","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047324545,0.0017447876,0.98924327,0.00095268653,0.0027805895,0.00024109958,0.000112117865,0.00033425473,0.0045438446],"genre_scores_gemma":[0.041445095,0.000056553996,0.95393366,0.0024091366,0.0012749756,0.000003630542,0.00008726744,0.000059891976,0.0007297813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942075,0.000046824203,0.000680528,0.0027372192,0.0012395222,0.0010884259],"domain_scores_gemma":[0.99145705,0.002166444,0.00040420433,0.0054824837,0.00020105495,0.00028877633],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0020107625,0.0006769228,0.0006265735,0.0007193647,0.00045198342,0.0008789589,0.01278698,0.00043711351,0.00004593491],"category_scores_gemma":[0.0005060005,0.00063114887,0.000100026766,0.0006566075,0.00057218637,0.0011763843,0.006493564,0.0014330038,0.000094304196],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012174081,0.00002570437,0.00025939388,0.000040624254,0.000025422434,0.0016031185,0.00087724795,0.015016493,0.000058636957,0.010813279,0.0012028791,0.970065],"study_design_scores_gemma":[0.00038639948,0.00015986257,0.00018738957,0.001790723,0.000019300689,0.00024763995,4.3705703e-7,0.82428986,0.00053978164,0.15046594,0.020537185,0.0013754816],"about_ca_topic_score_codex":0.0004149889,"about_ca_topic_score_gemma":0.00043100512,"teacher_disagreement_score":0.96868956,"about_ca_system_score_codex":0.0002723479,"about_ca_system_score_gemma":0.00066727475,"threshold_uncertainty_score":0.999614},"labels":[],"label_agreement":null},{"id":"W1760697510","doi":"10.1139/cjce-2013-0223","title":"Combining case-based reasoning with genetic algorithm optimization for preliminary cost estimation in construction industry","year":2013,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Case-based reasoning; Genetic algorithm; Computer science; Cost estimate; Matching (statistics); Identification (biology); Similarity (geometry); Contrast (vision); Estimation; Data mining; Mathematical optimization; Machine learning; Artificial intelligence; Engineering; Mathematics; Statistics; Systems engineering","score_opus":0.006788192131569717,"score_gpt":0.18585208336172418,"score_spread":0.17906389123015445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1760697510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018345939,0.00014629803,0.9808907,0.00015749304,0.00021030355,0.00019437984,0.0000025251495,0.000020646792,0.000031718002],"genre_scores_gemma":[0.5254452,3.6286806e-7,0.47448763,0.000019538256,0.000022498107,0.000011516432,0.00000247849,0.000009113148,0.0000016526188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992258,0.000022137234,0.00027601013,0.00011721215,0.00009604681,0.00026277546],"domain_scores_gemma":[0.9991654,0.00012592747,0.00016885638,0.00010988935,0.00016761252,0.00026230846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024682158,0.000112604714,0.00014096129,0.0004435511,0.000102578124,0.0001714155,0.00016123318,0.00010977578,0.000015060664],"category_scores_gemma":[0.00009877469,0.000117146745,0.000025324513,0.00030599485,0.00001740204,0.0005062909,0.0000054258107,0.0003287888,4.277799e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020727477,0.0000023901782,0.0017608798,0.000022803995,0.000007821026,0.00024811702,0.0002083606,0.9802183,0.0000041382673,0.00006796214,0.00005680854,0.017400332],"study_design_scores_gemma":[0.0005003894,0.00016426477,0.001223459,0.000574796,0.000009325084,0.0024145683,0.000055627857,0.99479854,0.000054123942,0.000033064265,0.000036636127,0.00013521561],"about_ca_topic_score_codex":0.0009134665,"about_ca_topic_score_gemma":0.001283257,"teacher_disagreement_score":0.5070993,"about_ca_system_score_codex":0.00016958831,"about_ca_system_score_gemma":0.00061495794,"threshold_uncertainty_score":0.47771057},"labels":[],"label_agreement":null},{"id":"W1782964968","doi":"10.1109/wcica.2004.1342403","title":"An intelligent human-robot interface using a probability approach","year":2004,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Natural language user interface; Natural language; Interface (matter); Robot; Ambiguity; Human–computer interaction; Service robot; Human–robot interaction; Meaning (existential); Mobile robot; Artificial intelligence; Natural (archaeology); Natural language understanding; Natural language generation; Service (business); Sentence; Programming language; Psychology","score_opus":0.08641442380457874,"score_gpt":0.32648897789918285,"score_spread":0.2400745540946041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1782964968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11927198,0.000065190405,0.8775164,0.00012063443,0.00008873336,0.00018296819,4.8726963e-7,0.0003608309,0.0023927693],"genre_scores_gemma":[0.58204687,2.6821274e-7,0.41779402,0.000083947474,0.000022594852,0.000004184728,0.0000018252247,0.000005705326,0.00004062657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998579,0.00008388525,0.00025951318,0.00054445054,0.00020165027,0.0003314608],"domain_scores_gemma":[0.99896425,0.000024827139,0.000069107526,0.00073814753,0.000064597676,0.00013908256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005786113,0.00016572874,0.00015603832,0.00007352829,0.0002408724,0.00024846586,0.0008904792,0.00007201461,0.00001785897],"category_scores_gemma":[0.00001562112,0.00014265627,0.00005346899,0.0002844029,0.000052614905,0.0005348649,0.00018321254,0.00020621574,0.000023823659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008389571,0.0006093899,0.0019939805,0.00007742447,0.00002394835,0.000008735297,0.005952516,0.84525585,0.012635367,0.12450943,0.000051338655,0.008873623],"study_design_scores_gemma":[0.0006362041,0.0006133641,0.000699181,0.00014561674,0.000016035183,0.000095156756,0.00029334796,0.8491728,0.057697687,0.0893908,0.00033803628,0.00090178807],"about_ca_topic_score_codex":0.00045863428,"about_ca_topic_score_gemma":0.0000162599,"teacher_disagreement_score":0.46277484,"about_ca_system_score_codex":0.00014261318,"about_ca_system_score_gemma":0.00010755196,"threshold_uncertainty_score":0.5817354},"labels":[],"label_agreement":null},{"id":"W1797158199","doi":"10.1609/icaps.v19i1.13364","title":"Improving Planning Performance Using Low-Conflict Relaxed Plans","year":2009,"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":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Australian Government","keywords":"Satisficing; Computer science; Heuristic; Plan (archaeology); Executable; Exploit; Mathematical optimization; Heuristics; Domain (mathematical analysis); State (computer science); Relaxation (psychology); Theoretical computer science; Algorithm; Artificial intelligence; Mathematics","score_opus":0.042858574521779845,"score_gpt":0.2841194638274261,"score_spread":0.24126088930564624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1797158199","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98853534,0.00011347328,0.005087791,0.00085241435,0.00037566276,0.00013103157,0.0000059376803,0.0005687815,0.004329566],"genre_scores_gemma":[0.97507995,0.000008066179,0.024418635,0.00032722246,0.000073740346,0.0000033414758,0.0000035406022,0.000012452431,0.000073033756],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981476,0.000014354157,0.00045582405,0.00047576663,0.0005340535,0.0003723754],"domain_scores_gemma":[0.99883085,0.00009949333,0.0005162562,0.00015485386,0.00030053753,0.00009800033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006407453,0.00027228132,0.00026326315,0.0002536894,0.00042001266,0.00048235807,0.0012767202,0.00014004785,0.000004140451],"category_scores_gemma":[0.00019353356,0.00022165618,0.00006870811,0.00028878442,0.00005800109,0.0006948034,0.00020276602,0.00051693566,0.0000026688688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047616684,0.00022275394,0.15204704,0.0004460452,0.00026798874,0.000037841397,0.015129634,0.17349029,0.54473394,0.094397,0.00055510725,0.01819618],"study_design_scores_gemma":[0.00035946682,0.00010975462,0.0074705873,0.0021794445,0.000012921919,0.00006909668,0.00025918742,0.9694668,0.019352324,0.00043133658,0.000023813544,0.0002652568],"about_ca_topic_score_codex":0.000018989138,"about_ca_topic_score_gemma":9.0092534e-8,"teacher_disagreement_score":0.7959765,"about_ca_system_score_codex":0.00006113448,"about_ca_system_score_gemma":0.00010454334,"threshold_uncertainty_score":0.9038877},"labels":[],"label_agreement":null},{"id":"W1804227813","doi":"10.1007/3-540-45049-1_50","title":"Building Logistics Networks Using Model-Based Reasoning Techniques","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Advice (programming); Artificial intelligence; Software engineering; Operations research; Programming language","score_opus":0.025247805678886005,"score_gpt":0.2667599703451272,"score_spread":0.2415121646662412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1804227813","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020110063,0.0006693332,0.9957952,0.00014808722,0.00061598903,0.00029810905,0.0000049066803,0.0005645549,0.0018837214],"genre_scores_gemma":[0.082889855,0.000023433367,0.9152378,0.0013197596,0.00041901067,0.000005024594,0.0000056452786,0.000053567765,0.000045921497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99572587,0.000054581356,0.0006307086,0.0017005884,0.00086203974,0.0010262023],"domain_scores_gemma":[0.9971377,0.00059246056,0.00039251617,0.0014516464,0.00020611008,0.00021954728],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013611026,0.00070518063,0.0006262025,0.000906941,0.00059575326,0.0008615081,0.0033176905,0.0005996489,0.000010501901],"category_scores_gemma":[0.000084525745,0.00070352585,0.00015924136,0.00071415293,0.0005789675,0.00049322913,0.00073544186,0.0014729575,0.000004915819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039847714,0.0000075234807,0.000019231267,0.000016460392,0.000003914384,0.00006536802,0.00006954434,0.7400506,0.000046307818,0.009341832,0.000006478649,0.2503687],"study_design_scores_gemma":[0.00009671669,0.00007986475,0.0000017057371,0.001433575,0.000012206484,0.00004740975,2.0220911e-8,0.902596,0.00094345515,0.09374272,0.000312215,0.000734131],"about_ca_topic_score_codex":0.00004583901,"about_ca_topic_score_gemma":0.000010197168,"teacher_disagreement_score":0.2496346,"about_ca_system_score_codex":0.00045580257,"about_ca_system_score_gemma":0.0010070045,"threshold_uncertainty_score":0.9995416},"labels":[],"label_agreement":null},{"id":"W1810217302","doi":"10.3233/kes-2006-10201","title":"A computational framework for package planning","year":2006,"lang":"en","type":"article","venue":"International Journal of Knowledge-based and Intelligent Engineering Systems","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Preference; Plan (archaeology); Set (abstract data type); Computation; Heuristic; Class (philosophy); Bounded function; Mathematical optimization; Automated planning and scheduling; Theoretical computer science; Artificial intelligence; Mathematics; Algorithm; Programming language","score_opus":0.01604085672000166,"score_gpt":0.26888950141796014,"score_spread":0.2528486446979585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1810217302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006293833,0.003354297,0.986947,0.00025275964,0.0028581056,0.00010300162,0.000011198069,0.000059992846,0.00011981139],"genre_scores_gemma":[0.8856054,0.0000040233913,0.113403335,0.000035032015,0.0008663405,0.000008642717,0.000009713059,0.000015215752,0.000052281513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987072,0.000031801508,0.00058012933,0.00017247,0.00031694194,0.0001915038],"domain_scores_gemma":[0.99804914,0.00086070754,0.00029338093,0.00010508371,0.00060248055,0.00008918898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005529318,0.00016335704,0.00022658076,0.00037695284,0.0000631149,0.00030145387,0.0005603625,0.0000815433,0.0000024334063],"category_scores_gemma":[0.00015847852,0.0001493332,0.00012164047,0.00013064586,0.000017605575,0.00022521401,0.000039391914,0.00020696493,0.0000043557557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029143079,0.000064292304,0.0020450086,0.00009585788,0.000097192584,0.00003265027,0.00036601027,0.8720706,0.00012962913,0.12133205,0.0014913904,0.002246179],"study_design_scores_gemma":[0.00044470944,0.00015937707,0.00048374792,0.0013363062,0.000012344974,0.00013154537,0.000032656273,0.9769282,0.00095993635,0.003393585,0.015911475,0.00020611423],"about_ca_topic_score_codex":0.000008527812,"about_ca_topic_score_gemma":1.8334478e-7,"teacher_disagreement_score":0.87931156,"about_ca_system_score_codex":0.00009942949,"about_ca_system_score_gemma":0.00011991363,"threshold_uncertainty_score":0.6089631},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0744431214151241,"score_gpt":0.3649893685409816,"score_spread":0.29054624712585747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1819804398","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004761696,0.38666525,0.61198974,0.0000074808254,0.00038974927,0.0002321952,0.000008321379,0.00014431443,0.000558162],"genre_scores_gemma":[0.000012364027,0.42237884,0.57666266,0.0007703831,0.000100504505,0.00002164588,0.000026799322,0.000021515581,0.000005299491],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925233,0.00014312721,0.0031953284,0.00028484757,0.0031645761,0.00068879157],"domain_scores_gemma":[0.9893871,0.007333212,0.001175521,0.0009963143,0.00012670447,0.00098113],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0041917004,0.00064657757,0.0016700323,0.00063415454,0.00043810508,0.00078416086,0.001974113,0.0012635654,0.00017841296],"category_scores_gemma":[0.0017235571,0.0004558204,0.00040470582,0.00081977807,0.0001671816,0.00059742964,0.0011596829,0.0015028082,0.0001970407],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026421685,0.000020407875,0.0000017334747,0.015201554,0.000021860305,0.0007360827,0.00033077272,0.00020981678,7.713952e-11,0.0030655146,0.0008286506,0.97958094],"study_design_scores_gemma":[0.00051793846,0.0000622436,6.2138724e-8,0.07457817,0.00007073854,0.008017356,0.00006422806,0.6540209,1.8472457e-8,0.0013102759,0.260871,0.0004870469],"about_ca_topic_score_codex":0.0000066141315,"about_ca_topic_score_gemma":0.0000141203745,"teacher_disagreement_score":0.9790939,"about_ca_system_score_codex":0.00013200947,"about_ca_system_score_gemma":0.0063133496,"threshold_uncertainty_score":0.99978936},"labels":[],"label_agreement":null},{"id":"W1823099761","doi":"10.5591/978-1-57735-516-8/ijcai11-330","title":"Monitoring the execution of partial-order plans via regression","year":2011,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Robustness (evolution); Benchmark (surveying); Exploit; Regression; Plan (archaeology); Data mining; Mathematical optimization; Mathematics","score_opus":0.044629647430552484,"score_gpt":0.25090241298618804,"score_spread":0.20627276555563556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1823099761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03909259,0.00013060762,0.9521249,0.0002163718,0.00044547435,0.00006389396,4.6220728e-7,0.00011641748,0.007809313],"genre_scores_gemma":[0.95981956,0.0000063464627,0.039836206,0.000031682994,0.000045061646,0.0000041645835,4.267506e-7,0.0000030769556,0.00025348432],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994006,0.00005149713,0.00013459877,0.0001361937,0.00013823473,0.00013887127],"domain_scores_gemma":[0.99945927,0.00006720747,0.00007373427,0.00032504718,0.000043840864,0.000030905478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028317142,0.00006542866,0.00006657072,0.000028543012,0.00011808677,0.0000187341,0.0003910448,0.000038358492,0.000024532388],"category_scores_gemma":[0.000014974634,0.000037432215,0.000024538745,0.00016329823,0.000022349053,0.0001717141,0.00008486342,0.00008470583,0.00001791981],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010815107,0.00030117817,0.44151354,0.00010646775,0.000102232974,0.000043788987,0.043577604,0.001481146,0.028032884,0.06764818,0.0060490207,0.4110358],"study_design_scores_gemma":[0.00053714303,0.00035137672,0.068133816,0.00055570813,0.000026018512,0.000033374723,0.00041113133,0.16912942,0.7484467,0.00848981,0.0033785668,0.0005069561],"about_ca_topic_score_codex":0.00024707202,"about_ca_topic_score_gemma":0.0000024593623,"teacher_disagreement_score":0.92072695,"about_ca_system_score_codex":0.000006154817,"about_ca_system_score_gemma":0.000019828723,"threshold_uncertainty_score":0.15264414},"labels":[],"label_agreement":null},{"id":"W182621935","doi":"","title":"Flexible execution of partial order plans with temporal constraints","year":2013,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Plan (archaeology); Schedule; Executor; Generalization; Variety (cybernetics); State (computer science); Order (exchange); Distributed computing; Operations research; Artificial intelligence; Programming language; Operating system; Engineering","score_opus":0.08728091937032868,"score_gpt":0.2954974309334702,"score_spread":0.20821651156314153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W182621935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02431121,0.00000579394,0.9593503,0.0034154581,0.0005431604,0.00024437267,0.000021961088,0.00013973092,0.011968038],"genre_scores_gemma":[0.97565794,0.0000047589942,0.023726897,0.0002497293,0.00007825124,0.000037442183,0.000023692111,0.000008707246,0.00021261156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809957,0.00006759869,0.0005482032,0.0004383689,0.00055466295,0.00029160007],"domain_scores_gemma":[0.9984369,0.00012342677,0.000276761,0.00033653606,0.00071059953,0.00011574589],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027525143,0.00020229517,0.00021092262,0.000203372,0.000095900104,0.00026666254,0.00076063775,0.00008218486,0.0010979364],"category_scores_gemma":[0.000108123386,0.00017035258,0.000055526853,0.0002767022,0.0002738651,0.00051095884,0.00009725077,0.00024176243,0.0005248281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006589026,0.00019260385,0.001159595,0.00001161673,0.000050124443,0.000018378116,0.0007915349,0.0041271574,0.005410474,0.8365106,0.00037235703,0.15128969],"study_design_scores_gemma":[0.0001751905,0.00092897034,0.0014820698,0.0006299018,0.000012466505,0.000077416276,0.00072754774,0.55550134,0.3330284,0.10596422,0.0007680613,0.00070443586],"about_ca_topic_score_codex":0.00047089317,"about_ca_topic_score_gemma":0.000034457466,"teacher_disagreement_score":0.9513467,"about_ca_system_score_codex":0.000044407316,"about_ca_system_score_gemma":0.00024374804,"threshold_uncertainty_score":0.99981517},"labels":[],"label_agreement":null},{"id":"W1826978891","doi":"","title":"A* search with inconsistent heuristics","year":2009,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Computer science; Heuristic; Social heuristics; Mathematical optimization; Artificial intelligence; Machine learning; Mathematics","score_opus":0.016752719127753658,"score_gpt":0.23400537660681942,"score_spread":0.21725265747906575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1826978891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009590081,0.00005576926,0.94885385,0.0036131237,0.000041052946,0.000053053143,4.1952816e-7,0.0002340959,0.037558567],"genre_scores_gemma":[0.80409074,0.0000015305789,0.19379972,0.0010783077,0.000019345143,5.824289e-7,9.717006e-7,0.00000198203,0.0010068011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934506,0.00002601404,0.00007980687,0.00017572746,0.00018213075,0.00019123609],"domain_scores_gemma":[0.9995074,0.00006239391,0.000016332415,0.00028504722,0.000052358,0.000076469885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017698707,0.000066571985,0.00006824535,0.000043085776,0.00009590375,0.00010881652,0.00031623806,0.000022769216,0.00001235506],"category_scores_gemma":[0.0000082634915,0.000047048732,0.000015111129,0.00018616211,0.000014828968,0.00010759257,0.000037635196,0.00010286485,0.00005500146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004652,0.0002669599,0.03107442,0.000035946756,0.000045213175,0.0004974102,0.0027828359,0.011893822,0.0005868747,0.6156199,0.02990408,0.30724603],"study_design_scores_gemma":[0.0021334225,0.0043835165,0.055788804,0.0003187162,0.000028785606,0.0005259364,0.00021780528,0.86621237,0.01276466,0.020780867,0.035147514,0.001697582],"about_ca_topic_score_codex":0.00002017082,"about_ca_topic_score_gemma":0.0000023234377,"teacher_disagreement_score":0.85431856,"about_ca_system_score_codex":0.000012940592,"about_ca_system_score_gemma":0.00006719106,"threshold_uncertainty_score":0.19185917},"labels":[],"label_agreement":null},{"id":"W1830253132","doi":"10.1007/978-3-540-69132-7_113","title":"Cognitive Tutoring System with \"Consciousness\"","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Consciousness; Cognitive architecture; Cognition; Proposition; Cognitive systems; Architecture; Cognitive science; Human–computer interaction; State (computer science); Artificial intelligence; Programming language; Psychology","score_opus":0.016206837702765667,"score_gpt":0.22322380931363,"score_spread":0.20701697161086435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1830253132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016057833,0.0008478208,0.9870034,0.00016003534,0.0012353742,0.0003618056,0.00000707415,0.00047404188,0.009749879],"genre_scores_gemma":[0.70843434,0.00003272339,0.28963733,0.00059721543,0.0006097016,0.000018903238,0.000008417907,0.00006014917,0.0006012114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958488,0.000046647347,0.00045602207,0.0016999376,0.0011289625,0.0008196541],"domain_scores_gemma":[0.99715745,0.00086545624,0.00035472904,0.0010202779,0.00037595443,0.00022610064],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069138897,0.00063404534,0.000625502,0.0007570412,0.00060569175,0.00052707247,0.0024074612,0.00030667547,0.000005094145],"category_scores_gemma":[0.00005124897,0.0005308255,0.000098678865,0.00067955774,0.00072110025,0.000621849,0.000744176,0.0010351075,0.00006300912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055196437,0.00005539132,0.0016541505,0.00046546562,0.000101432306,0.004267997,0.009222078,0.14161424,0.00004770182,0.026552001,0.000106353415,0.815858],"study_design_scores_gemma":[0.00128554,0.00086288754,0.00034905548,0.011929522,0.000043258373,0.0029539,0.0000030496872,0.97059697,0.0014708085,0.0052667786,0.002321617,0.0029166148],"about_ca_topic_score_codex":0.00006555659,"about_ca_topic_score_gemma":0.000046686822,"teacher_disagreement_score":0.8289827,"about_ca_system_score_codex":0.00037171872,"about_ca_system_score_gemma":0.0010611961,"threshold_uncertainty_score":0.9997143},"labels":[],"label_agreement":null},{"id":"W1833767862","doi":"10.1007/3-540-45108-0_89","title":"W5 - Case-Based Reasoning in Intelligent Training Systems","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Reusability; Case-based reasoning; TUTOR; Intelligent tutoring system; Intelligent decision support system; Software engineering; Component (thermodynamics); Human–computer interaction; Software; Focus (optics); Artificial intelligence","score_opus":0.03167152494968648,"score_gpt":0.24935279623397605,"score_spread":0.21768127128428957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1833767862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032465372,0.0016185241,0.99059933,0.00027566953,0.00157416,0.00043873882,0.0000070406113,0.00025935692,0.0049025156],"genre_scores_gemma":[0.66952413,0.000029930568,0.32866335,0.0010106323,0.00044838703,0.000023796176,0.000012519347,0.000064518856,0.00022270874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951606,0.000116343595,0.00086477795,0.0018421562,0.0009297357,0.0010863803],"domain_scores_gemma":[0.99685705,0.0010931634,0.00034254754,0.0013335735,0.00012281114,0.00025086233],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002160327,0.0006859788,0.00076126045,0.0015071256,0.00035889048,0.0009539613,0.002593956,0.00045666075,0.000028317469],"category_scores_gemma":[0.00009830703,0.000670996,0.00014158973,0.0009830015,0.00037317525,0.00048822028,0.00041606184,0.0014951077,0.000044543936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006484421,0.000014774186,0.00009329846,0.000050986222,0.0000059249933,0.0033672312,0.0024238972,0.59942174,0.0000068227228,0.0053107915,0.000010952889,0.3892871],"study_design_scores_gemma":[0.00025567983,0.00015587965,0.00001376946,0.0027391086,0.0000063278567,0.0012916394,0.0000015768438,0.9812557,0.00012160999,0.011396176,0.0019545413,0.000807984],"about_ca_topic_score_codex":0.00038463296,"about_ca_topic_score_gemma":0.00020107263,"teacher_disagreement_score":0.6691995,"about_ca_system_score_codex":0.0005185097,"about_ca_system_score_gemma":0.0011489711,"threshold_uncertainty_score":0.9995741},"labels":[],"label_agreement":null},{"id":"W1834145291","doi":"10.1109/robot.1999.770024","title":"Computing fault tolerant motions for a robot manipulator","year":2003,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Fault tolerance; Workspace; Redundancy (engineering); Computer science; Robot; Measure (data warehouse); Configuration space; Topology (electrical circuits); Task (project management); Motion planning; Control theory (sociology); Constraint (computer-aided design); Distributed computing; Artificial intelligence; Engineering; Data mining","score_opus":0.034061536486764014,"score_gpt":0.2654359041600825,"score_spread":0.23137436767331848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1834145291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037417533,0.00006725309,0.98945767,0.000497241,0.00030349803,0.0001629611,0.0000013391307,0.00026540822,0.005502878],"genre_scores_gemma":[0.6016823,3.016563e-7,0.39720646,0.00038502002,0.0000269829,0.0000056991203,0.0000022696745,0.0000056984222,0.00068524346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909914,0.000040557763,0.00018030172,0.0002749185,0.00011060919,0.0002944951],"domain_scores_gemma":[0.9993862,0.00014227672,0.000049477825,0.00027932457,0.00006271726,0.00007999789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003353088,0.00010368623,0.00011560758,0.000054669294,0.000296032,0.00013762985,0.0003032696,0.000044892706,0.00002028561],"category_scores_gemma":[0.000054975975,0.00009254403,0.00006554542,0.00017985482,0.0000098584815,0.00015549187,0.00004020742,0.00008111827,0.000034163495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023499526,0.000096706215,0.0020429722,0.00004952589,0.000032962813,0.000009766982,0.0011778648,0.12645514,0.0007171339,0.844197,0.008471526,0.016747065],"study_design_scores_gemma":[0.00035746026,0.0000680335,0.00046926233,0.000035886547,0.000005201578,0.000026574213,0.000036173424,0.98445904,0.0013570276,0.0040968154,0.00887478,0.00021373208],"about_ca_topic_score_codex":0.00002279395,"about_ca_topic_score_gemma":0.000004453714,"teacher_disagreement_score":0.8580039,"about_ca_system_score_codex":0.000019733734,"about_ca_system_score_gemma":0.000051151383,"threshold_uncertainty_score":0.37738362},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02488262853350111,"score_gpt":0.26077196190287566,"score_spread":0.23588933336937454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1848921964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04930841,0.0002208322,0.9391914,0.0004963577,0.00007815057,0.00013509739,0.0000016019982,0.0003699089,0.010198217],"genre_scores_gemma":[0.67364335,6.168724e-7,0.3249312,0.00015141322,0.00006836884,0.0000037320244,0.000006046198,0.00001479573,0.0011804833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983232,0.00006690556,0.000246811,0.00046122435,0.00039629813,0.0005055832],"domain_scores_gemma":[0.99898714,0.0002629779,0.000078098536,0.00044158942,0.00013427743,0.00009594738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040506275,0.0001968826,0.00018924057,0.00014473313,0.00039683745,0.00032380302,0.00054592267,0.000066720604,0.00003971398],"category_scores_gemma":[0.000022282115,0.00015498493,0.000032551747,0.0005698792,0.000047488662,0.00038342734,0.0001382182,0.00020278154,0.000035948204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008088355,0.00024154707,0.22739524,0.0002216598,0.00007628401,0.0010517488,0.0017184094,0.7224589,0.0013697655,0.029204182,0.013735088,0.0024462922],"study_design_scores_gemma":[0.0007681167,0.00025925942,0.014316445,0.00038259444,0.000014957809,0.00017676501,0.000072899405,0.9779729,0.0009302882,0.002076077,0.0023647477,0.0006649099],"about_ca_topic_score_codex":0.0010408126,"about_ca_topic_score_gemma":0.00005465131,"teacher_disagreement_score":0.62433493,"about_ca_system_score_codex":0.000043475167,"about_ca_system_score_gemma":0.00022849222,"threshold_uncertainty_score":0.63201016},"labels":[],"label_agreement":null},{"id":"W1853029798","doi":"10.1007/978-0-85729-130-1_15","title":"A Particle Swarm Optimization Approach for the Case Retrieval Stage in CBR","year":2010,"lang":"en","type":"book-chapter","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Particle swarm optimization; Computer science; Reuse; Task (project management); Key (lock); Artificial intelligence; Content-addressable memory; Memory model; Machine learning; Parallel computing; Shared memory; Artificial neural network; Engineering; Operating system; Systems engineering","score_opus":0.03702104457993492,"score_gpt":0.24614075791749826,"score_spread":0.20911971333756335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1853029798","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023924473,0.00020087468,0.9475249,0.0003244618,0.00015582761,0.00048218816,0.0000138231735,0.000103139755,0.051170874],"genre_scores_gemma":[0.008742838,0.000024645828,0.6931633,0.00041897284,0.00016175058,0.000032673353,0.00003980229,0.000040926858,0.2973751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989806,0.000017782684,0.00024304421,0.00038193256,0.00014588982,0.00023076736],"domain_scores_gemma":[0.9988096,0.00038629983,0.00012311302,0.0005537163,0.00006842695,0.000058848313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007253783,0.00017817446,0.00016424585,0.000059590628,0.00019497036,0.00018194797,0.0004726494,0.00023911578,0.000056564917],"category_scores_gemma":[0.00004563986,0.00012610598,0.00007019307,0.00006487526,0.000040111605,0.00014795885,0.00012377539,0.00042995004,0.000005940855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006657299,0.000045415705,0.000024664212,0.00011012148,0.000046592995,0.00036810528,0.0014339957,0.48846248,0.000022571094,0.4988408,0.0006318846,0.009946781],"study_design_scores_gemma":[0.00025391302,0.00005047796,4.5749525e-7,0.000018490951,0.000011857616,0.0000821994,0.000017131139,0.9911844,0.00018195051,0.0010152463,0.006990901,0.00019294245],"about_ca_topic_score_codex":0.00007075153,"about_ca_topic_score_gemma":0.000037157974,"teacher_disagreement_score":0.50272197,"about_ca_system_score_codex":0.000027412634,"about_ca_system_score_gemma":0.0000923012,"threshold_uncertainty_score":0.5142453},"labels":[],"label_agreement":null},{"id":"W185475015","doi":"10.1007/978-3-642-23199-5_18","title":"Sensitivity Analysis for Weak Constraint Generation","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Sensitivity (control systems); Constraint (computer-aided design); Domain (mathematical analysis); Mathematical optimization; Cluster analysis; Sample (material); Plan (archaeology); Artificial intelligence; Mathematics","score_opus":0.03718666369405884,"score_gpt":0.24780274004657218,"score_spread":0.21061607635251334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W185475015","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060989973,0.00017062682,0.9957653,0.0003964139,0.000978534,0.00034199833,0.000021017544,0.00014584248,0.0021192457],"genre_scores_gemma":[0.35138312,0.0000089649175,0.64705664,0.0007517033,0.0004477594,0.000010080662,0.000033798,0.000019146393,0.00028882068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970192,0.00005738826,0.00043257422,0.0014232666,0.0005145796,0.00055303203],"domain_scores_gemma":[0.99750334,0.0006755873,0.00030935605,0.0010476853,0.00031392794,0.00015009611],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018660646,0.0004201603,0.0005541165,0.0009899505,0.00035835363,0.00043868023,0.0011352196,0.00030885928,0.00001811583],"category_scores_gemma":[0.00009695742,0.0003972363,0.00025733584,0.00069541356,0.00041183826,0.00038593033,0.00041085342,0.0004733622,0.000014745685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007117159,0.000027458758,0.00044138049,0.000039377144,0.00014580229,0.0000611752,0.0012173923,0.24954315,0.0004970358,0.06540929,0.000082827595,0.682528],"study_design_scores_gemma":[0.00013627496,0.000114385155,0.0001300371,0.00008941534,0.00006344108,0.000030205692,7.4150456e-8,0.952155,0.0013866635,0.044570584,0.00079858646,0.00052536133],"about_ca_topic_score_codex":0.00006855036,"about_ca_topic_score_gemma":0.00028728996,"teacher_disagreement_score":0.7026118,"about_ca_system_score_codex":0.00016388622,"about_ca_system_score_gemma":0.0004924237,"threshold_uncertainty_score":0.99984795},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.027545056541078066,"score_gpt":0.24081900024469122,"score_spread":0.21327394370361316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1857953989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19348815,0.0006350351,0.7545616,0.0026112273,0.00021505442,0.00013366074,0.0000024385372,0.00068962964,0.047663175],"genre_scores_gemma":[0.95027757,0.00000609586,0.04729263,0.00085619383,0.000055166875,0.000006465735,0.0000047351123,0.0000067712213,0.0014943609],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991856,0.000027403486,0.000107294865,0.00024945042,0.00019533507,0.00023491289],"domain_scores_gemma":[0.99946874,0.000072954455,0.00004825009,0.00029083333,0.000047825328,0.00007137374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000107428445,0.00010842618,0.00011074262,0.00006161305,0.00018603074,0.00005558803,0.00041695876,0.000033615026,0.0000238764],"category_scores_gemma":[0.000011967122,0.00008063833,0.000017820515,0.0002534954,0.000042226948,0.0003528791,0.00007005696,0.0001529193,0.00019366689],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010938367,0.00019482966,0.676106,0.00009576278,0.00012691328,0.0019725647,0.012498297,0.017218776,0.0013231746,0.020363202,0.22392511,0.046066023],"study_design_scores_gemma":[0.0034116018,0.003010388,0.4916531,0.00094611465,0.00004260605,0.0025837151,0.00008491985,0.1576424,0.0048884125,0.010115533,0.32314742,0.0024737844],"about_ca_topic_score_codex":0.000013002751,"about_ca_topic_score_gemma":0.0000025467057,"teacher_disagreement_score":0.75678945,"about_ca_system_score_codex":0.00000836083,"about_ca_system_score_gemma":0.00007795644,"threshold_uncertainty_score":0.32883358},"labels":[],"label_agreement":null},{"id":"W1874655302","doi":"10.1109/isic.1991.187358","title":"Intelligent re-location based manipulation of objects using robot hands. I. Extracting qualitative abstracts from quantitative concepts","year":2002,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Qualitative reasoning; Artificial intelligence; Computer science; Robot; Context (archaeology); Object (grammar); Orientation (vector space); Transformation (genetics); Human–computer interaction; Qualitative analysis; Commonsense reasoning; Qualitative research; Computer vision; Mathematics","score_opus":0.20277049188773497,"score_gpt":0.38465534753130054,"score_spread":0.18188485564356557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1874655302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.122272484,0.000308931,0.8749785,0.00014924073,0.00016180596,0.00016144155,0.0000033876477,0.00010587967,0.0018583408],"genre_scores_gemma":[0.7136426,0.0000025465847,0.28617156,0.000085740874,0.000021284493,0.000003116267,0.00001628566,0.000008553378,0.00004832703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981108,0.00031538616,0.00057602295,0.00040532666,0.00035256837,0.00023994975],"domain_scores_gemma":[0.99695146,0.0017987565,0.0005557829,0.0003177577,0.00029898365,0.0000772678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074723753,0.0001778864,0.00023092507,0.00015527915,0.0001724567,0.00010914699,0.0002915389,0.00009385158,0.00012367497],"category_scores_gemma":[0.0004019578,0.00017521865,0.000059860493,0.0004516839,0.000049840855,0.0007397123,0.00004318506,0.00017699224,0.000038332622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041858526,0.0002245486,0.0013730061,0.00009346017,0.00007774114,0.00001516743,0.1439197,0.8161485,0.016807938,0.0077529917,0.00024285763,0.013302176],"study_design_scores_gemma":[0.00031641193,0.0001371201,0.001061222,0.00029482527,0.000013742374,0.0000010399888,0.0044773053,0.94793206,0.04449721,0.0010385411,0.0000121368175,0.00021840942],"about_ca_topic_score_codex":0.0015274321,"about_ca_topic_score_gemma":0.00008794851,"teacher_disagreement_score":0.5913701,"about_ca_system_score_codex":0.000083583414,"about_ca_system_score_gemma":0.00006283699,"threshold_uncertainty_score":0.71452093},"labels":[],"label_agreement":null},{"id":"W1888608175","doi":"10.1109/icsmc.1992.271675","title":"Verifying and testing expert system conceptual models","year":2003,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Expert system; Redundancy (engineering); Software engineering; Artificial intelligence; Data mining; Programming language","score_opus":0.07247832071281009,"score_gpt":0.23650427632463555,"score_spread":0.16402595561182548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1888608175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012744526,0.0008035787,0.92859125,0.000049326292,0.00014292821,0.00005642668,2.8508882e-7,0.00037836685,0.057233315],"genre_scores_gemma":[0.76159936,0.0000012661684,0.23807873,0.00016833612,0.000015165427,0.0000040599944,1.9264675e-7,0.000004207825,0.00012867611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992305,0.000063126026,0.00013244235,0.00024815754,0.000115458344,0.00021028725],"domain_scores_gemma":[0.99942356,0.00022750569,0.00003809126,0.00019390036,0.00003863265,0.00007828962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030058192,0.00009065988,0.00010419918,0.000033465134,0.00018916148,0.00013006735,0.00015926661,0.000039792587,0.0000033216088],"category_scores_gemma":[0.00005323174,0.00007876033,0.000013902615,0.00014489397,0.000027060069,0.00035904424,0.000055104156,0.000079207406,0.000008626473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012971497,0.000009653783,0.0017466735,0.00003957656,0.000010053051,0.00003299967,0.0053834063,0.00701804,0.0008768719,0.97357225,0.00082448893,0.010484671],"study_design_scores_gemma":[0.00021787366,0.000046249657,0.000025318617,0.00013008203,0.000001736744,0.00009800443,0.000993713,0.9946954,0.0014001764,0.0010517794,0.0011335432,0.00020607474],"about_ca_topic_score_codex":0.00006299263,"about_ca_topic_score_gemma":5.649604e-7,"teacher_disagreement_score":0.9876774,"about_ca_system_score_codex":0.000019798113,"about_ca_system_score_gemma":0.000043560558,"threshold_uncertainty_score":0.32117528},"labels":[],"label_agreement":null},{"id":"W190339099","doi":"","title":"Domain-specific preferences for causal reasoning and planning","year":2004,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Rotation formalisms in three dimensions; Preference; Computer science; Action (physics); Domain (mathematical analysis); Context (archaeology); Constraint (computer-aided design); Artificial intelligence; Situation calculus; Theoretical computer science; Mathematics","score_opus":0.032397649465055654,"score_gpt":0.259394603427356,"score_spread":0.22699695396230032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W190339099","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1058408,0.0006914085,0.8890868,0.00036662613,0.00017230843,0.000113054484,0.0000015701487,0.0001891034,0.0035383347],"genre_scores_gemma":[0.45429552,0.000007800413,0.54538184,0.00012615915,0.00007359738,0.000013284587,0.0000030916256,0.0000053098875,0.00009335989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991308,0.000017560684,0.00013555826,0.00032534252,0.0001183411,0.0002723822],"domain_scores_gemma":[0.9994699,0.00016925874,0.000049740876,0.00018890359,0.000038419905,0.00008381003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030095267,0.000111661255,0.0001145114,0.00006173729,0.00026190816,0.00023208153,0.0002785956,0.000051949624,0.000004491031],"category_scores_gemma":[0.0000109160455,0.00009385568,0.000023829973,0.000120439974,0.000028005536,0.00029456097,0.000079040736,0.00009275373,0.000006157938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023498102,0.000026477874,0.011204296,0.000040911767,0.000024191651,0.000027202095,0.0077458895,0.0039592064,0.0006215409,0.9544137,0.0027420174,0.01917108],"study_design_scores_gemma":[0.0064860657,0.0016575925,0.030291717,0.0016811345,0.000027173543,0.00031222243,0.0027884175,0.014642091,0.010973337,0.6432124,0.2854464,0.0024814568],"about_ca_topic_score_codex":0.000029566334,"about_ca_topic_score_gemma":0.000004154481,"teacher_disagreement_score":0.3484547,"about_ca_system_score_codex":0.000019807769,"about_ca_system_score_gemma":0.000051346105,"threshold_uncertainty_score":0.38273233},"labels":[],"label_agreement":null},{"id":"W1910090669","doi":"10.48550/arxiv.0909.0682","title":"On Planning with Preferences in HTN","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Planner; Computer science; Forward chaining; Preference; Heuristic; Task (project management); Artificial intelligence; Range (aeronautics); Outcome (game theory); Machine learning; Expert system; Mathematics","score_opus":0.05865993744098051,"score_gpt":0.27535303432553354,"score_spread":0.21669309688455302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1910090669","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9529608,0.00045543048,0.038089488,0.000617589,0.00031209935,0.00021278285,0.0000033115507,0.00029114532,0.007057344],"genre_scores_gemma":[0.98733133,0.000013705667,0.011755725,0.00055395515,0.00008760324,0.000026206397,0.000020422895,0.000014587099,0.00019644055],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9979591,0.00013134714,0.00029734513,0.0008437189,0.00033067784,0.00043782959],"domain_scores_gemma":[0.9985719,0.00024308565,0.00021963431,0.0008225508,0.0000453946,0.000097447526],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044027474,0.00034045745,0.00035034938,0.00024615804,0.000109653,0.00018422812,0.0013010552,0.00024735776,0.000010950626],"category_scores_gemma":[0.000047355305,0.00027863885,0.000052988617,0.00027152445,0.000033272452,0.00017640567,0.0003872363,0.0011771986,0.00007532467],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051748844,0.000097839045,0.8898336,0.00009741074,0.00003464817,0.00028914216,0.0037541552,0.09396501,0.000018056573,0.001769487,0.0010843,0.009004596],"study_design_scores_gemma":[0.0008648143,0.000988042,0.9354304,0.0067503937,0.00002372438,0.000022568707,0.00009247348,0.02789571,0.0007202593,0.024775244,0.0009546085,0.00148177],"about_ca_topic_score_codex":0.00014929738,"about_ca_topic_score_gemma":0.000026379683,"teacher_disagreement_score":0.0660693,"about_ca_system_score_codex":0.00006500114,"about_ca_system_score_gemma":0.00023424224,"threshold_uncertainty_score":0.99996656},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014137577882216264,"score_gpt":0.21473459972811992,"score_spread":0.20059702184590367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1938618045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044772353,0.0002804619,0.917022,0.0008060554,0.0004907235,0.0004066526,0.00008137113,0.0008914217,0.035248958],"genre_scores_gemma":[0.96648186,0.000002626146,0.032389916,0.00014788858,0.00011823364,0.000018652694,0.000010711906,0.000017323615,0.00081277976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887836,0.00016406793,0.00012359815,0.00033548224,0.00015876642,0.0003397461],"domain_scores_gemma":[0.9988856,0.00045463597,0.000094832634,0.00037310997,0.00005841852,0.00013342215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042639914,0.00014691436,0.00015382624,0.00019374127,0.0003489554,0.00016325885,0.00037658098,0.00016120072,0.000024381285],"category_scores_gemma":[0.000026959944,0.00016104741,0.00010682525,0.00033893145,0.00004186934,0.00031546017,0.000042931064,0.00014717999,0.000049387196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029492035,0.00072886975,0.018560885,0.0014057682,0.00050157745,0.0148399845,0.035889596,0.05810204,0.0030115177,0.46208882,0.24048117,0.16409485],"study_design_scores_gemma":[0.0020445972,0.00026369913,0.00047402832,0.00016845539,0.000058312187,0.00075911277,0.00047812244,0.9514094,0.00033007632,0.00077950006,0.042861097,0.00037360945],"about_ca_topic_score_codex":0.00013913322,"about_ca_topic_score_gemma":0.0000136555045,"teacher_disagreement_score":0.92170954,"about_ca_system_score_codex":0.00017202942,"about_ca_system_score_gemma":0.00005995101,"threshold_uncertainty_score":0.6567323},"labels":[],"label_agreement":null},{"id":"W194497922","doi":"10.1007/978-1-4471-0351-6_21","title":"WebGrid: Knowledge Elicitation and Modeling on the World Wide Web","year":2001,"lang":"en","type":"book-chapter","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Inference; Computer science; Knowledge acquisition; Expert system; Expert elicitation; Inference engine; Knowledge management; Artificial intelligence; Mathematics","score_opus":0.05005908765960191,"score_gpt":0.2570175221355232,"score_spread":0.2069584344759213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W194497922","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047685964,0.00082640647,0.13098243,0.002328032,0.00021952676,0.00015167266,0.0000026007422,0.00019507868,0.8652466],"genre_scores_gemma":[0.028524278,0.00022492441,0.007829148,0.002227304,0.000272049,0.0000118019525,0.000014708938,0.000044326378,0.96085143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988251,0.000032049673,0.00024822346,0.00045364708,0.00021619225,0.00022483792],"domain_scores_gemma":[0.9984515,0.0008085262,0.000100840116,0.00048258613,0.000081296166,0.00007529942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044040472,0.000276404,0.00019981006,0.00023437887,0.00026908773,0.00022233259,0.000495956,0.00013155474,0.00012776988],"category_scores_gemma":[0.000026056845,0.0001907525,0.0000657552,0.00007939805,0.000032125838,0.0001381643,0.00014959142,0.0004679312,0.0002707644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046167925,0.0000062810923,0.0000111506115,0.000017134826,0.000023677887,0.000008404713,0.00031223413,0.002800084,0.0000043419313,0.9511855,0.02380084,0.021825686],"study_design_scores_gemma":[0.000092850816,0.000041731008,0.0000016229894,0.0004055286,0.000012120267,0.0000055590785,0.000006171609,0.7066574,0.0000076172446,0.050253417,0.24223708,0.00027890588],"about_ca_topic_score_codex":0.000016591226,"about_ca_topic_score_gemma":0.00014968085,"teacher_disagreement_score":0.90093213,"about_ca_system_score_codex":0.000039222086,"about_ca_system_score_gemma":0.00009295889,"threshold_uncertainty_score":0.7778661},"labels":[],"label_agreement":null},{"id":"W1953189263","doi":"10.1184/r1/6609317","title":"Search Reduction in Planning with Primary Effects","year":2018,"lang":"en","type":"article","venue":"Figshare","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Iran Telecommunication Research Center; Carnegie Mellon University","keywords":"Reduction (mathematics); Primary (astronomy); Computer science; Mathematics","score_opus":0.03140004144621769,"score_gpt":0.2631977807183113,"score_spread":0.2317977392720936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1953189263","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6191829,0.0073103663,0.08304741,0.0045877816,0.0028861056,0.0061548515,0.0189525,0.007405926,0.2504722],"genre_scores_gemma":[0.98119044,2.3915342e-7,0.014284121,0.00023188697,0.00026793926,0.00006192877,0.003716568,0.000014863119,0.00023202632],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9992079,0.000053830925,0.00007627171,0.0002524731,0.00017106453,0.00023843032],"domain_scores_gemma":[0.9995164,0.00011195816,0.000031562115,0.00023360005,0.000055852415,0.000050618044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009799857,0.00008252885,0.000081711776,0.00010189806,0.00010229895,0.000092431714,0.00031652616,0.00004801666,0.0008828079],"category_scores_gemma":[0.00006130659,0.000071325674,0.000012314339,0.00036848066,0.000006825017,0.00030564226,0.000105795574,0.00017362465,0.0005115906],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016609314,0.00016142774,0.013447352,0.0018689404,0.00005276842,0.000928882,0.021314219,0.006979513,0.0031066462,0.00036401412,0.79038686,0.16122328],"study_design_scores_gemma":[0.005760698,0.0060288943,0.38825107,0.079931356,0.000019665182,0.0010874327,0.00029448283,0.24623659,0.13719958,0.0010310421,0.1305466,0.00361258],"about_ca_topic_score_codex":0.000010366789,"about_ca_topic_score_gemma":0.0000011942192,"teacher_disagreement_score":0.6598403,"about_ca_system_score_codex":0.000041782412,"about_ca_system_score_gemma":0.00009573547,"threshold_uncertainty_score":0.9666127},"labels":[],"label_agreement":null},{"id":"W1963913493","doi":"10.1002/widm.22","title":"Ensembles of case‐based reasoning classifiers in high‐dimensional biological domains","year":2011,"lang":"en","type":"article","venue":"Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Discovery Centre; Ontario Institute for Cancer Research","funders":"","keywords":"Classifier (UML); Computer science; Artificial intelligence; Disjoint sets; Case-based reasoning; Random subspace method; Cluster analysis; Machine learning; Cascading classifiers; Ensemble learning; Feature selection; Data mining; Pattern recognition (psychology); Mathematics","score_opus":0.1307819076493614,"score_gpt":0.33222079092292583,"score_spread":0.20143888327356443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963913493","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87936205,0.043974515,0.07200371,0.00016784537,0.00084981485,0.0005406909,0.00030404195,0.00012565147,0.0026717053],"genre_scores_gemma":[0.9085434,0.00047730852,0.090494476,0.000063580716,0.00006608186,0.000028881454,0.00023875343,0.000016319369,0.00007120828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715513,0.0005110884,0.0008419327,0.00094137056,0.00012862361,0.00042182943],"domain_scores_gemma":[0.9977061,0.0004887446,0.00034616826,0.0012765537,0.000044311295,0.00013810159],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001971457,0.00033704602,0.00071212515,0.00025606275,0.00024001235,0.00009046283,0.0011517889,0.00014896832,0.000017715387],"category_scores_gemma":[0.00018540779,0.00025622785,0.00010474435,0.00045352706,0.00023399781,0.0011147421,0.0029153351,0.0002725841,0.000013022719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008878019,0.0028839177,0.1749084,0.0028705837,0.0003711937,0.007770031,0.059929237,0.00012916139,0.002127427,0.018006891,0.061040126,0.66907525],"study_design_scores_gemma":[0.012018963,0.007953429,0.042942002,0.09893575,0.000772829,0.011291557,0.01314515,0.7698427,0.003322688,0.00903835,0.021622913,0.009113661],"about_ca_topic_score_codex":0.00005596755,"about_ca_topic_score_gemma":0.00013563385,"teacher_disagreement_score":0.7697135,"about_ca_system_score_codex":0.000038374958,"about_ca_system_score_gemma":0.0001584842,"threshold_uncertainty_score":0.999989},"labels":[],"label_agreement":null},{"id":"W1964067289","doi":"10.1007/s00500-002-0170-1","title":"Computational intelligence and visual computing: an emerging technology for software engineering","year":2002,"lang":"en","type":"article","venue":"Soft Computing","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computational intelligence; Visualization; Software engineering; Software; Fuzzy logic; Artificial intelligence; Software visualization; Abstraction; Software development; Data science; Human–computer interaction; Component-based software engineering; Programming language","score_opus":0.02537580998749105,"score_gpt":0.274650785339719,"score_spread":0.24927497535222792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964067289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052893065,0.00056463113,0.944528,0.0004412016,0.00030521635,0.00017677026,0.0000019990473,0.0010713888,0.000017717553],"genre_scores_gemma":[0.5867913,0.0000012578421,0.4129643,0.00011498141,0.00009582741,0.000002252151,0.0000058007254,0.000016292033,0.000008010389],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817723,0.000036050576,0.00039299607,0.00063025096,0.00020451771,0.0005589809],"domain_scores_gemma":[0.9984958,0.0008485015,0.00015472135,0.00021567626,0.00014944738,0.00013582919],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004801632,0.0002481624,0.00025751567,0.00034189885,0.0005620448,0.00023898749,0.0005550762,0.00012288679,0.0000047390968],"category_scores_gemma":[0.00029557472,0.0002818572,0.00005325966,0.0005851533,0.000057477133,0.0003154204,0.000360509,0.00029660793,0.000009251688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002228611,0.000048576156,0.0064883824,0.00008292601,0.000023209366,0.000011154337,0.0017596238,0.5680214,0.00004189035,0.010070924,0.00010120187,0.41334847],"study_design_scores_gemma":[0.00017730563,0.00016386666,0.00036949545,0.00013470242,0.0000058714413,0.000075647484,0.00007926763,0.9958965,0.0001290679,0.0021825852,0.00045388963,0.0003317825],"about_ca_topic_score_codex":0.0000054124866,"about_ca_topic_score_gemma":4.974088e-7,"teacher_disagreement_score":0.5338982,"about_ca_system_score_codex":0.000036730362,"about_ca_system_score_gemma":0.000026027426,"threshold_uncertainty_score":0.99996334},"labels":[],"label_agreement":null},{"id":"W1966851629","doi":"10.1016/j.artint.2007.10.019","title":"Duality in permutation state spaces and the dual search algorithm","year":2007,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Duality (order theory); Dual (grammatical number); Heuristic; Permutation (music); State (computer science); Mathematics; Algorithm; Class (philosophy); Symmetry (geometry); Search algorithm; Mathematical optimization; Computer science; Theoretical computer science; Combinatorics; Artificial intelligence","score_opus":0.046170881111703185,"score_gpt":0.31920800882190936,"score_spread":0.27303712771020616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966851629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20567614,0.00015356138,0.79205835,0.0015321261,0.00013338952,0.00012331171,0.0000015662129,0.00004346162,0.00027810756],"genre_scores_gemma":[0.9801557,0.000019875675,0.01953451,0.00017595779,0.00004438972,0.000003652642,0.0000015407716,0.0000039804086,0.000060407925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986933,0.00017632046,0.00030260815,0.0002731249,0.00024758425,0.000307046],"domain_scores_gemma":[0.9987649,0.0008459803,0.00005441915,0.00020832682,0.00006681159,0.000059570066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003781391,0.000091121794,0.00010816031,0.000091924325,0.00018599427,0.00023653862,0.00026058694,0.000036741792,0.00000662544],"category_scores_gemma":[0.00011324667,0.00006820273,0.0000226244,0.00043573236,0.00019768321,0.00026288355,0.00011552332,0.00021997497,0.000037609196],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048072907,0.000028012708,0.001221608,0.000007825295,0.0000051448833,0.000047287635,0.021022968,0.0025958251,0.00015026216,0.1089396,0.00001426578,0.8659191],"study_design_scores_gemma":[0.000097087825,0.00007701322,0.0053868396,0.000039610382,0.000003177742,0.000024526726,0.0019665393,0.81436,0.02643365,0.15120852,0.00017976093,0.0002232482],"about_ca_topic_score_codex":0.0012042657,"about_ca_topic_score_gemma":0.00052207743,"teacher_disagreement_score":0.8656959,"about_ca_system_score_codex":0.000022826423,"about_ca_system_score_gemma":0.000046483183,"threshold_uncertainty_score":0.2781227},"labels":[],"label_agreement":null},{"id":"W1967629079","doi":"10.1016/j.engappai.2004.09.012","title":"Expert system for an INS/DGPS integrated navigator installed in a Bell 206 helicopter","year":2004,"lang":"en","type":"article","venue":"Engineering Applications of Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; University of British Columbia; BC Innovation Council","funders":"","keywords":"Computer science; Aeronautics; Artificial intelligence; Simulation; Real-time computing","score_opus":0.025494288140332944,"score_gpt":0.2748148688408897,"score_spread":0.24932058070055674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967629079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028381605,0.0002120145,0.97023517,0.00012553587,0.00012111551,0.0005794234,0.000013078261,0.00028185893,0.00005020604],"genre_scores_gemma":[0.7983614,0.0000051551324,0.20105362,0.000021791702,0.000050600625,0.00046891454,0.000017698525,0.000015613363,0.0000051661564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986222,0.000016680187,0.00053793425,0.00039117315,0.00015229415,0.0002797467],"domain_scores_gemma":[0.99897814,0.00012117488,0.00010529455,0.000546798,0.00014533856,0.000103253406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003661868,0.00017519016,0.00021523604,0.00024607606,0.000089513065,0.00007589256,0.00077143015,0.00009922243,0.0000017852857],"category_scores_gemma":[0.00005070528,0.00018494156,0.000058578476,0.00079775526,0.000032203217,0.0002847725,0.00006232036,0.00017444346,0.000020176742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023065604,0.00023741269,0.000024727824,0.00014734252,0.00001680379,0.000002530466,0.0033450492,0.5985678,0.02695791,0.30201083,0.00001600351,0.06865053],"study_design_scores_gemma":[0.000111497495,0.0001868104,0.000020785037,0.0004071181,0.0000048969428,0.000008428597,0.00053571863,0.7827692,0.21089785,0.0027193632,0.0019602785,0.00037804554],"about_ca_topic_score_codex":0.00036675332,"about_ca_topic_score_gemma":0.00004787189,"teacher_disagreement_score":0.76997983,"about_ca_system_score_codex":0.00012671328,"about_ca_system_score_gemma":0.00011209627,"threshold_uncertainty_score":0.7541698},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.1859338231043957,"score_gpt":0.40765015742581884,"score_spread":0.22171633432142313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971439026","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10831059,0.0005781307,0.8874222,0.00044387678,0.00090764003,0.00015724165,0.0000010552006,0.0002254973,0.0019537765],"genre_scores_gemma":[0.46624103,0.000011984379,0.5330067,0.00015576686,0.00032197963,0.000006442948,0.000002048762,0.000018572011,0.00023543122],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969739,0.00057269866,0.0006120668,0.00070669263,0.0003220712,0.00081261765],"domain_scores_gemma":[0.99831855,0.00048082546,0.00011621829,0.00066320295,0.00019055553,0.00023064743],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023111503,0.00026565194,0.00027316262,0.0002357477,0.0005470171,0.0004214053,0.0010453723,0.00012858794,0.00009511221],"category_scores_gemma":[0.0001347584,0.00026824878,0.00012502357,0.0011238051,0.00011183809,0.00047023478,0.00038686075,0.00035687347,0.0003327486],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022565804,0.00021419107,0.00028937816,0.00002608001,0.000029688657,0.00010641919,0.007415156,0.02138928,0.26034656,0.07931235,0.00009348032,0.6307548],"study_design_scores_gemma":[0.000021642627,0.00011695165,0.000017722181,0.00008551352,0.000008388375,0.00007282623,0.00029749156,0.56251276,0.4034798,0.028995592,0.004007576,0.00038370967],"about_ca_topic_score_codex":0.00026907303,"about_ca_topic_score_gemma":0.000108015985,"teacher_disagreement_score":0.63037115,"about_ca_system_score_codex":0.0001939415,"about_ca_system_score_gemma":0.00020481326,"threshold_uncertainty_score":0.999977},"labels":[],"label_agreement":null},{"id":"W1971811803","doi":"10.1184/r1/6591389","title":"A Spectrum of Plan Justifications","year":2018,"lang":"en","type":"article","venue":"Figshare","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Iran Telecommunication Research Center; Carnegie Mellon University","keywords":"Intuition; Plan (archaeology); Computer science; Task (project management); Mathematical optimization; Mathematics; Engineering; Epistemology; Systems engineering","score_opus":0.059918011980460845,"score_gpt":0.2610982257523033,"score_spread":0.20118021377184245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971811803","genre_codex":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006252834,0.0018000555,0.13670734,0.014159784,0.001851683,0.0015852341,0.45888683,0.003599084,0.37515718],"genre_scores_gemma":[0.98400426,2.2002907e-7,0.009169155,0.00016506825,0.00016237122,0.00001975403,0.0060141613,0.0000059232257,0.00045911528],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995548,0.000015057839,0.00008962425,0.00013619648,0.00008660512,0.00011772222],"domain_scores_gemma":[0.9994504,0.00007669582,0.000060375667,0.00032184925,0.00005333838,0.00003734387],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000038778424,0.000047267942,0.000053949352,0.000045078483,0.000080497615,0.000033520733,0.00045580603,0.000028943756,0.0149567425],"category_scores_gemma":[0.00013679631,0.000044927983,0.000021303218,0.00020176679,0.0000054879065,0.00010271981,0.000080507954,0.000052867857,0.0018533652],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019544834,0.000021781829,0.00015986724,0.00006303403,0.0000084428575,0.000004633437,0.0012907117,0.000040586543,0.00022272296,0.00442005,0.98996085,0.0038053559],"study_design_scores_gemma":[0.00042732837,0.00045815637,0.017749416,0.0029009748,0.000010902341,0.000045121888,0.00004545113,0.10352472,0.056898043,0.0047824522,0.8125192,0.00063822564],"about_ca_topic_score_codex":0.000004169004,"about_ca_topic_score_gemma":0.000005374925,"teacher_disagreement_score":0.9777514,"about_ca_system_score_codex":0.0000063061448,"about_ca_system_score_gemma":0.000054453954,"threshold_uncertainty_score":0.9989238},"labels":[],"label_agreement":null},{"id":"W1972829642","doi":"10.1111/j.1756-8765.2010.01083.x","title":"AI and Cognitive Science: The Past and Next 30 Years","year":2010,"lang":"en","type":"article","venue":"Topics in Cognitive Science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"Cognition; Cognitive science; Psychology; Cognitive psychology; Neuroscience","score_opus":0.025766020349799697,"score_gpt":0.30604126722368663,"score_spread":0.28027524687388694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972829642","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9767706,0.00014931308,0.015390543,0.0024325773,0.00045652932,0.00022129307,0.0000046059654,0.00004375659,0.0045308056],"genre_scores_gemma":[0.99574035,0.0000121600015,0.002241313,0.0018321722,0.00008330292,0.000010307035,3.5268596e-7,0.0000033097638,0.000076715885],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9982618,0.00003790801,0.00014310927,0.00062191824,0.0004865897,0.0004486729],"domain_scores_gemma":[0.9988255,0.00044776802,0.000061735744,0.00022058451,0.00029666777,0.00014773356],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0021778685,0.00011856136,0.00010653812,0.00023370793,0.00073004083,0.00085503253,0.0008302613,0.000045567154,0.000014787971],"category_scores_gemma":[0.0008175688,0.00009209783,0.000012468799,0.001341487,0.0037183834,0.0011783665,0.0006312479,0.00052239234,0.000013242473],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011272704,0.00006311129,0.1357574,0.000018455641,0.0000063354732,0.00007120321,0.020492017,0.000004506886,0.006229213,0.060315773,0.00007761913,0.7769531],"study_design_scores_gemma":[0.0010433804,0.00025746014,0.9223117,0.00030906513,0.000018502176,0.00014864575,0.0016941846,0.044824637,0.0056478768,0.021815907,0.0012876684,0.0006409326],"about_ca_topic_score_codex":0.00004490248,"about_ca_topic_score_gemma":0.000020032783,"teacher_disagreement_score":0.78655434,"about_ca_system_score_codex":0.000015236338,"about_ca_system_score_gemma":0.00037844933,"threshold_uncertainty_score":0.9989929},"labels":[],"label_agreement":null},{"id":"W1976580313","doi":"10.1142/s0218194000000183","title":"KNOWLEDGE ENGINEERING OF A MONITORING AND CONTROL DECISION SUPPORT SYSTEM","year":2000,"lang":"en","type":"article","venue":"International Journal of Software Engineering and Knowledge Engineering","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Expert system; Computer science; Decision support system; Software engineering; Conceptual model; Object-oriented programming; Heuristics; Knowledge-based systems; Legal expert system; Knowledge engineering; Systems engineering; Engineering; Knowledge management; Artificial intelligence","score_opus":0.005613013261435456,"score_gpt":0.2214766038898474,"score_spread":0.21586359062841196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976580313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22653034,0.0057923067,0.76532674,0.000021195425,0.0020027952,0.0000686974,0.0000076921915,0.00020588352,0.000044347165],"genre_scores_gemma":[0.9083674,0.00014541252,0.09094417,0.00000212084,0.00046642058,0.0000042972965,9.2717005e-7,0.000031867166,0.000037401365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984595,0.00001647449,0.0006811088,0.00023700079,0.00031634604,0.00028955124],"domain_scores_gemma":[0.9983551,0.00076499686,0.00015434588,0.00017067505,0.00033609048,0.00021881534],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064130744,0.00027645554,0.00042424677,0.00055707706,0.000044565248,0.00013562033,0.0005855242,0.000113701,0.00000671654],"category_scores_gemma":[0.00031632755,0.00027561764,0.00011546658,0.00023646643,0.000014686296,0.0005119903,0.00010432956,0.00037533493,0.0000050626177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001287008,0.00016526105,0.011909641,0.0012958996,0.00091867923,0.00041038162,0.0054642763,0.6352788,0.012252641,0.0029666906,0.00017458359,0.32903442],"study_design_scores_gemma":[0.002132514,0.00025756072,0.009381141,0.004521296,0.00006267897,0.0015324089,0.00004302754,0.97006285,0.0045671454,0.000013915235,0.006854817,0.00057063886],"about_ca_topic_score_codex":0.0000042476827,"about_ca_topic_score_gemma":1.460041e-7,"teacher_disagreement_score":0.681837,"about_ca_system_score_codex":0.00011638389,"about_ca_system_score_gemma":0.000077410914,"threshold_uncertainty_score":0.9999696},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05360566751266353,"score_gpt":0.2694234057961437,"score_spread":0.21581773828348016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977070092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025824364,0.00011166522,0.9720697,0.0003974023,0.00015583742,0.00032885655,0.0000011092852,0.00006455543,0.00104655],"genre_scores_gemma":[0.99008024,0.0000012005762,0.009817971,0.000052193693,0.000005387605,0.000017369022,0.0000010408835,0.0000062168574,0.000018407483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987026,0.00020004835,0.00037847614,0.00032308284,0.00019486123,0.00020096058],"domain_scores_gemma":[0.9979774,0.001348518,0.00014904345,0.00037666262,0.00009677036,0.000051653347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010659457,0.0001193153,0.00012808574,0.000060191527,0.00021472543,0.00008505073,0.00030973507,0.000060804257,0.000037800935],"category_scores_gemma":[0.0013755205,0.00008780354,0.000029488372,0.0004467982,0.0001522645,0.00013374543,0.000047158373,0.00018434673,0.000012664597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038834078,0.000025234047,0.000059240738,0.000009003177,0.0000040124023,7.26627e-7,0.0007607871,0.57437164,0.00004171914,0.423344,0.0000054622665,0.001374272],"study_design_scores_gemma":[0.0000112856205,0.00011439842,0.000034176475,0.00008647182,0.00000444626,0.0000051946786,0.00007623654,0.61517185,0.0014322073,0.38297498,0.00000398459,0.00008479357],"about_ca_topic_score_codex":0.000016990078,"about_ca_topic_score_gemma":0.0000027383137,"teacher_disagreement_score":0.96425587,"about_ca_system_score_codex":0.00002439322,"about_ca_system_score_gemma":0.0000655177,"threshold_uncertainty_score":0.35805246},"labels":[],"label_agreement":null},{"id":"W1980348251","doi":"10.1017/s0269888912000434","title":"itSIMPLE: towards an integrated design system for real planning applications","year":2013,"lang":"en","type":"article","venue":"The Knowledge Engineering Review","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto; University of New Brunswick","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Computer science; Unified Modeling Language; Process (computing); Software engineering; Domain (mathematical analysis); Systems engineering; Engineering design process; Petri net; Engineering; Programming language","score_opus":0.04216769480283818,"score_gpt":0.29014629785412166,"score_spread":0.24797860305128347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980348251","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028373111,0.04230903,0.9546093,0.00022776015,0.00016978724,0.0014326923,0.0000037012971,0.0006813803,0.0005379967],"genre_scores_gemma":[0.16905509,0.0043288516,0.81159925,0.00042571948,0.0010398576,0.012120509,0.00012857009,0.00018763919,0.0011145119],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887,0.00010817863,0.00032091798,0.00028449387,0.00009548371,0.00032091592],"domain_scores_gemma":[0.99855304,0.00040220626,0.000086996704,0.0006632182,0.00017891658,0.00011564846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011604566,0.00020185059,0.00028987238,0.000057933816,0.00019384107,0.00013871113,0.0010399686,0.00005264959,0.000006387595],"category_scores_gemma":[0.00007792738,0.00013839049,0.00007229078,0.00049407745,0.0000117981435,0.00025605565,0.00007970377,0.00017848046,0.00012290358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003572095,0.00006745016,0.000020941261,0.012494498,0.000113383074,0.000003007938,0.0021513936,0.026362851,0.0006815848,0.04911057,0.02417465,0.8848161],"study_design_scores_gemma":[0.00012635112,0.00007775052,0.000073205294,0.0049519814,0.000050964336,0.000031033473,0.000028679311,0.8623099,0.00021553677,0.00012207507,0.1316842,0.00032837302],"about_ca_topic_score_codex":0.000024952411,"about_ca_topic_score_gemma":3.354071e-7,"teacher_disagreement_score":0.88448775,"about_ca_system_score_codex":0.000076069315,"about_ca_system_score_gemma":0.000104223334,"threshold_uncertainty_score":0.56434},"labels":[],"label_agreement":null},{"id":"W1982481381","doi":"10.1007/pl00011667","title":"ActiveCBR: An Agent System That Integrates Case-Based Reasoning and Active Databases","year":2001,"lang":"en","type":"article","venue":"Knowledge and Information Systems","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Active database; Computer science; Case-based reasoning; Property (philosophy); Artificial intelligence; Reasoning system; Feature (linguistics); Database; Data mining; Event (particle physics); Expert system; Machine learning","score_opus":0.034879124724015026,"score_gpt":0.26716649458248526,"score_spread":0.23228736985847023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982481381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25270215,0.0022543413,0.72370136,0.00006731561,0.0008668048,0.00063001586,0.00009035348,0.0006134705,0.019074174],"genre_scores_gemma":[0.99775594,0.000034182634,0.0019144941,0.000047023594,0.000062877305,0.00003917164,0.00008142954,0.0000061975393,0.00005870843],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890894,0.00016700677,0.00032916295,0.00021573088,0.00014958033,0.00022955278],"domain_scores_gemma":[0.99892014,0.00018832211,0.0002377404,0.00031490333,0.00017068058,0.00016819827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000626237,0.00018670004,0.00021540571,0.00022435423,0.00042298075,0.00056734163,0.00017373201,0.00006689233,0.0000018630691],"category_scores_gemma":[0.00003643083,0.00015377684,0.000023812458,0.0002482202,0.000033292563,0.005689398,0.00008394447,0.0001371192,0.000026367312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003040222,0.0002284856,0.04938471,0.0042029787,0.0002846793,0.0007375802,0.12150211,0.0027640269,0.00020381347,0.19805674,0.0063334582,0.6159974],"study_design_scores_gemma":[0.00066665944,0.00016115782,0.0010427978,0.0009995883,0.000019563455,0.0026020438,0.0134268375,0.8882624,0.0006064984,0.000004564121,0.091828436,0.00037948648],"about_ca_topic_score_codex":0.0004147634,"about_ca_topic_score_gemma":0.00003027445,"teacher_disagreement_score":0.88549834,"about_ca_system_score_codex":0.00008072267,"about_ca_system_score_gemma":0.00008257564,"threshold_uncertainty_score":0.6270838},"labels":[],"label_agreement":null},{"id":"W1982718004","doi":"10.1016/j.jal.2015.03.003","title":"Uncertain reasoning at FLAIRS","year":2015,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Artificial intelligence; Computer science","score_opus":0.040646080432969946,"score_gpt":0.25823348373113897,"score_spread":0.21758740329816903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982718004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13815607,0.0017734915,0.69664615,0.0038735592,0.0015255264,0.0001979711,0.0000014995373,0.00022249453,0.1576032],"genre_scores_gemma":[0.8473355,0.0000061817545,0.151694,0.0005625373,0.00018566339,0.0000012187321,7.098241e-7,0.000006522486,0.00020764953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890924,0.000037353926,0.00030669986,0.0001427142,0.00037187155,0.00023210424],"domain_scores_gemma":[0.9989825,0.0001119291,0.00036553547,0.00021088753,0.00011723893,0.00021192277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012018658,0.00010816983,0.00020107796,0.000101876925,0.00010140401,0.00008279733,0.000633301,0.00006503934,0.000012590521],"category_scores_gemma":[0.00006394853,0.00008170193,0.000052548916,0.00022830757,0.00002423673,0.00016533861,0.00014175198,0.00025460156,0.00006940566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070137787,0.00024788553,0.0060966513,0.000076958044,0.0002206648,0.0016213093,0.015870191,0.26649788,0.009593346,0.41330156,0.21593092,0.069841266],"study_design_scores_gemma":[0.009734027,0.004306874,0.0024698835,0.00077541394,0.00016573204,0.0048793587,0.002471152,0.18052398,0.018795976,0.468217,0.30510414,0.0025564632],"about_ca_topic_score_codex":0.000003815819,"about_ca_topic_score_gemma":0.0000010284991,"teacher_disagreement_score":0.70917946,"about_ca_system_score_codex":0.00014098453,"about_ca_system_score_gemma":0.00016480089,"threshold_uncertainty_score":0.3331708},"labels":[],"label_agreement":null},{"id":"W1983313062","doi":"10.1007/s10817-009-9158-1","title":"Preface: Special Issue on Uncertain Reasoning","year":2009,"lang":"en","type":"article","venue":"Journal of Automated Reasoning","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of Guelph","funders":"","keywords":"Computer science; Cognitive science; Management science; Epistemology; Psychology; Philosophy; Economics","score_opus":0.010693111983015832,"score_gpt":0.2717349721788356,"score_spread":0.26104186019581976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983313062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58288145,0.0041266736,0.17757912,0.025893798,0.012681366,0.0009479289,0.000014062887,0.006182565,0.18969303],"genre_scores_gemma":[0.8041727,0.000051182822,0.18837927,0.0011686094,0.0054588625,0.0000011248834,0.0000033730375,0.000029331872,0.00073555205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777585,0.00019080234,0.0006138465,0.0002807344,0.00065656926,0.00048217102],"domain_scores_gemma":[0.9982185,0.00023240385,0.00074711913,0.0003515502,0.00022094206,0.00022952737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012953214,0.00024672196,0.0003923975,0.00032321128,0.00030575934,0.00035573347,0.00089963985,0.00014739907,0.000060872288],"category_scores_gemma":[0.00048605964,0.00020547686,0.00015793928,0.0005913647,0.00002400565,0.0006787638,0.00005282707,0.000671492,0.00006249416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041890857,0.00049528293,0.0025081532,0.00006105902,0.00028504262,0.0033686266,0.011258845,0.20483755,0.004081266,0.022025205,0.32950056,0.42115954],"study_design_scores_gemma":[0.0022101442,0.0030658955,0.014622799,0.004672665,0.00006716401,0.0022276621,0.00025687198,0.8949203,0.0064627994,0.0017744304,0.06878798,0.000931283],"about_ca_topic_score_codex":0.000009361751,"about_ca_topic_score_gemma":5.2285054e-7,"teacher_disagreement_score":0.6900828,"about_ca_system_score_codex":0.00015376454,"about_ca_system_score_gemma":0.00024124968,"threshold_uncertainty_score":0.8379103},"labels":[],"label_agreement":null},{"id":"W1984701019","doi":"10.1007/s10489-010-0262-z","title":"Case learning for CBR-based collision avoidance systems","year":2010,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University; National Research Council Canada","funders":"Natural Science Foundation of Jiangsu Province; National Research Council Canada; Government of Jiangsu Province","keywords":"Computer science; Case-based reasoning; Collision avoidance; Collision; Artificial intelligence; Quality (philosophy); Machine learning; Computer security","score_opus":0.022987386690289283,"score_gpt":0.257844151856849,"score_spread":0.23485676516655973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984701019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02832318,0.00009546347,0.9681653,0.000114848335,0.00082890195,0.00049767824,0.000003741934,0.00035013352,0.0016207596],"genre_scores_gemma":[0.9054881,0.0000027490742,0.09379496,0.00015440064,0.000120081226,0.00017495065,0.000007543731,0.00001905068,0.00023820598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983732,0.000040178045,0.00034248174,0.0005720023,0.00023222306,0.0004398909],"domain_scores_gemma":[0.99794227,0.0010019027,0.00018303076,0.0005877386,0.00014156135,0.00014350837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009348203,0.00021007443,0.0002089308,0.00010742798,0.0005506388,0.00030439172,0.00078767835,0.000149721,0.000010273424],"category_scores_gemma":[0.00015804943,0.00020155449,0.00006475073,0.00038266138,0.0000638592,0.0001676312,0.00009334798,0.0005551376,0.000120038334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069509115,0.000108880755,0.0004294443,0.0002697752,0.000024821178,0.00035717964,0.0016288585,0.4698695,0.024605656,0.37363186,0.0017496863,0.12725481],"study_design_scores_gemma":[0.00013781487,0.00011999892,0.00000795812,0.000056549172,0.0000072547377,0.00026315858,0.00012447422,0.9274362,0.050899915,0.0015109562,0.019075153,0.00036056718],"about_ca_topic_score_codex":0.00010816821,"about_ca_topic_score_gemma":0.000015804544,"teacher_disagreement_score":0.8771649,"about_ca_system_score_codex":0.000027354828,"about_ca_system_score_gemma":0.000121133715,"threshold_uncertainty_score":0.8219153},"labels":[],"label_agreement":null},{"id":"W1992074915","doi":"10.1016/j.cogsys.2010.10.002","title":"Emotive and cognitive simulations by agents: Roles of three levels of information processing","year":2010,"lang":"en","type":"article","venue":"Cognitive Systems Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Korea Institute for Advancement of Technology; Agency for Science, Technology and Research","keywords":"Emotive; Information processing; Cognition; Affect (linguistics); Perception; Information processing theory; Cognitive psychology; Psychology; Computer science; Cognitive science; Communication; Neuroscience","score_opus":0.08538346068067589,"score_gpt":0.3688044701746155,"score_spread":0.2834210094939396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992074915","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53506964,0.0005717194,0.45945525,0.000054407607,0.000086335844,0.0007423365,0.000481603,0.000037627244,0.003501078],"genre_scores_gemma":[0.9992696,0.000002779645,0.0005658893,0.000011029979,0.000024503699,0.000022473085,0.000033485187,0.0000064687174,0.00006373801],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982301,0.00026280477,0.00037886592,0.00021778185,0.0006289857,0.0002814572],"domain_scores_gemma":[0.995295,0.0015751079,0.00023976638,0.0001381909,0.0026588365,0.00009310687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015111731,0.00011116169,0.00021127818,0.00035351352,0.00026875234,0.00017373578,0.0002783285,0.000106686646,0.000011973777],"category_scores_gemma":[0.0013305242,0.000102054895,0.000025122461,0.0006279803,0.00030201333,0.0011128633,0.00019347049,0.00042056013,0.0000132578525],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021405095,0.00035657166,0.121844724,0.0031530214,0.00033660364,0.0000118645285,0.054885868,0.0004475012,0.029057007,0.00863889,0.0010460421,0.78000784],"study_design_scores_gemma":[0.0034759906,0.0010097717,0.14591447,0.007052247,0.000066920176,0.00003424943,0.013103539,0.7777764,0.04701654,0.0033127035,0.0004848236,0.0007523513],"about_ca_topic_score_codex":0.00013885016,"about_ca_topic_score_gemma":0.000025543026,"teacher_disagreement_score":0.7792555,"about_ca_system_score_codex":0.000013004824,"about_ca_system_score_gemma":0.00022510502,"threshold_uncertainty_score":0.41616777},"labels":[],"label_agreement":null},{"id":"W1996632823","doi":"10.1016/j.artint.2014.04.002","title":"Erratum to ‘A logic for reasoning about ambiguity’ [Artificial Intelligence 209 (2014) 1–10]","year":2014,"lang":"en","type":"erratum","venue":"Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Ambiguity; Artificial intelligence; Computer science; Cognitive science; Automated reasoning; Psychology; Programming language","score_opus":0.06924589181398444,"score_gpt":0.32274997403646344,"score_spread":0.253504082222479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996632823","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017428338,0.001387309,0.94595736,0.0034358867,0.033815105,0.0012734463,0.00012821385,0.00078633666,0.013198941],"genre_scores_gemma":[0.06162513,0.0007575392,0.5913235,0.013088715,0.0284595,0.002037895,0.0016635624,0.0009155994,0.30012858],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99102324,0.00044294796,0.0022053155,0.0029061346,0.0012018966,0.0022204916],"domain_scores_gemma":[0.99320674,0.0012753115,0.0009808968,0.0026338978,0.0011222328,0.0007809329],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.003436327,0.0012903808,0.0013785112,0.0007901237,0.0012500304,0.0018077864,0.0053604557,0.0013170684,0.000437482],"category_scores_gemma":[0.003062168,0.0013376351,0.00060605205,0.0015152722,0.00030135363,0.00058466924,0.0010280643,0.0020427979,0.004336634],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008329713,0.00009860701,0.0000032011264,0.00015725456,0.00005294111,0.000030451785,0.0010705631,0.0034175348,0.00010650746,0.18507205,0.59815454,0.21175307],"study_design_scores_gemma":[0.00002230423,0.0012150989,0.000010524044,0.0014103155,0.00010929481,0.00003085828,0.0002961113,0.27961922,0.0077244127,0.36014688,0.34700948,0.002405496],"about_ca_topic_score_codex":0.00043185876,"about_ca_topic_score_gemma":0.0006320801,"teacher_disagreement_score":0.35463384,"about_ca_system_score_codex":0.00029594713,"about_ca_system_score_gemma":0.0009429892,"threshold_uncertainty_score":0.9999848},"labels":[],"label_agreement":null},{"id":"W1998456376","doi":"10.1016/s0140-6736(02)11313-4","title":"Series of errors","year":2002,"lang":"en","type":"article","venue":"The Lancet","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Health Sciences Centre; University of Toronto; Sunnybrook Health Science Centre","funders":"","keywords":"Series (stratigraphy); Medicine; Biology","score_opus":0.0516665147584585,"score_gpt":0.24253809887795041,"score_spread":0.1908715841194919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998456376","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32477567,0.0064113108,0.20056045,0.1623331,0.001693293,0.00039820734,0.000034751516,0.001274404,0.3025188],"genre_scores_gemma":[0.9828453,0.000020224572,0.0154005475,0.00048424114,0.00011779842,0.0000017170292,2.9565993e-7,0.0000024315432,0.001127445],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996355,0.000033366578,0.00006603105,0.00006873473,0.00007895562,0.00011736535],"domain_scores_gemma":[0.99949443,0.00005299795,0.000038803115,0.0003879923,0.000012478826,0.0000133105605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017940725,0.000037761656,0.00009591397,0.000012087619,0.000057263947,0.000022006192,0.00058974145,0.000013981355,0.00003632285],"category_scores_gemma":[0.000018035178,0.00002390652,0.000017009716,0.00011347509,0.000029788607,0.00010296605,0.000057800386,0.000054558812,0.000039016395],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023638097,0.00005153025,0.020422818,0.00009866009,0.000049045924,0.000021070695,0.01833571,0.0027276766,0.0014199757,0.3327287,0.5855746,0.038546555],"study_design_scores_gemma":[0.0019570312,0.00061105617,0.025574503,0.0003826068,0.000030388172,0.00016493925,0.00029897632,0.28920755,0.020062936,0.08717029,0.5736457,0.00089398946],"about_ca_topic_score_codex":0.000010664748,"about_ca_topic_score_gemma":0.000002428889,"teacher_disagreement_score":0.6580696,"about_ca_system_score_codex":0.0000025842778,"about_ca_system_score_gemma":0.000003849548,"threshold_uncertainty_score":0.10958962},"labels":[],"label_agreement":null},{"id":"W1999212967","doi":"10.1016/j.inffus.2009.09.005","title":"Multi-agent coordination by temporal plan fusion: Application to combat search and rescue","year":2009,"lang":"en","type":"article","venue":"Information Fusion","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Plan (archaeology); Search and rescue; Fusion; Artificial intelligence; Robot; Geography","score_opus":0.015946102353500417,"score_gpt":0.2551422592971792,"score_spread":0.2391961569436788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999212967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13444754,0.000042544758,0.8601146,0.004313753,0.00009235064,0.00040693695,0.00001065932,0.00018999868,0.0003816544],"genre_scores_gemma":[0.9654347,0.000009576305,0.032658264,0.00149518,0.00002172706,0.000013939683,0.0002486273,0.0000027750784,0.00011526403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998989,0.000046070258,0.00029322764,0.00016595835,0.0003231885,0.00018257184],"domain_scores_gemma":[0.99939585,0.000030508438,0.000061895174,0.0002552563,0.00012405438,0.00013244282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051665225,0.00011034188,0.00009382518,0.00018125566,0.00031438904,0.00023172352,0.00026751272,0.000080804035,0.0000065086115],"category_scores_gemma":[0.000027303142,0.00010352668,0.000017791137,0.00032701,0.000010337612,0.0012213113,0.00011295209,0.00012301111,0.00013305045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005873343,0.000093402145,0.0025154185,0.000051733346,0.000004935682,0.0000016330036,0.010488673,0.010160054,0.017750533,0.003771366,0.030237827,0.92486566],"study_design_scores_gemma":[0.00068715774,0.00025708377,0.01758357,0.00006190424,0.000002411011,0.00001111107,0.00013312224,0.93444455,0.0025120454,0.0001091007,0.043959327,0.00023859418],"about_ca_topic_score_codex":0.00018226054,"about_ca_topic_score_gemma":0.00000973378,"teacher_disagreement_score":0.9246271,"about_ca_system_score_codex":0.000053172575,"about_ca_system_score_gemma":0.000032981538,"threshold_uncertainty_score":0.42216954},"labels":[],"label_agreement":null},{"id":"W1999720320","doi":"10.1109/tsmcb.2002.979953","title":"Editorial advances on uncertain reasoning in intelligent systems","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Cognitive science; Artificial intelligence; Psychology","score_opus":0.023200956140781777,"score_gpt":0.2412142747055978,"score_spread":0.21801331856481604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999720320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019809099,0.013711295,0.7810506,0.0006285969,0.16235453,0.002263745,0.00010202241,0.00094573497,0.019134374],"genre_scores_gemma":[0.98918134,0.0013925325,0.0006447289,0.00008805102,0.0040836544,0.00014452806,0.000004012997,0.000050076087,0.0044111055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964098,0.0003715276,0.0008122134,0.0008957653,0.000803999,0.0007067489],"domain_scores_gemma":[0.9980688,0.0004916987,0.0002502842,0.00076235126,0.00011844186,0.0003084357],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006820271,0.00048281645,0.00052829727,0.00036495668,0.00030793223,0.0005561056,0.0006211905,0.00030972334,0.000024263662],"category_scores_gemma":[0.000018789126,0.0004707493,0.0001092799,0.00050529354,0.000105232044,0.00025958483,0.000010470165,0.0007306398,0.00021315721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012253264,0.0008345229,0.0005310913,0.0004703062,0.00015307897,0.00012178763,0.006551353,0.8886816,0.00010975447,0.017777089,0.04396904,0.040677834],"study_design_scores_gemma":[0.0014383637,0.001214285,0.000044508324,0.002336308,0.000053059503,0.00008843439,0.0006228472,0.6261948,0.00070308027,0.00021043823,0.36591375,0.0011801416],"about_ca_topic_score_codex":0.00053512346,"about_ca_topic_score_gemma":0.000093238,"teacher_disagreement_score":0.9693722,"about_ca_system_score_codex":0.00017519746,"about_ca_system_score_gemma":0.000039662107,"threshold_uncertainty_score":0.9997744},"labels":[],"label_agreement":null},{"id":"W2005906454","doi":"10.1109/icci-cc.2014.6921489","title":"Enhanced Particle Swarm Optimization algorithm with resuse guided retrieval capabilities","year":2014,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Particle swarm optimization; Computer science; Adaptability; Fitness function; Reuse; Similarity (geometry); Content-addressable memory; Process (computing); Function (biology); Memory model; Recall; Artificial intelligence; Algorithm; Machine learning; Genetic algorithm; Artificial neural network; Shared memory; Parallel computing","score_opus":0.012627605685909057,"score_gpt":0.22760411432631666,"score_spread":0.2149765086404076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005906454","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02555556,0.000018955872,0.9687739,0.00076629594,0.0001089189,0.000102520426,9.178913e-7,0.00038830907,0.0042846487],"genre_scores_gemma":[0.47112674,0.0000021367039,0.5274726,0.00030017362,0.000048555798,0.0000048280494,0.00000413718,0.000008106804,0.0010327261],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987869,0.00010942114,0.00020915117,0.0003420152,0.00026169993,0.00029078132],"domain_scores_gemma":[0.9989665,0.00021310875,0.00007238959,0.0004977255,0.00014983118,0.0001004589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055124547,0.00012336532,0.00013122588,0.000039223392,0.00016666419,0.00017176381,0.00035817095,0.0000498136,0.00003759142],"category_scores_gemma":[0.00012541367,0.000095535295,0.000025274498,0.00032474854,0.000048839393,0.0004207362,0.00006893679,0.000090965186,0.00003099639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008332497,0.00011756401,0.00066333084,0.000049879116,0.00004459017,0.00001017478,0.0057635186,0.9116781,0.0019103717,0.03256529,0.003738556,0.04337534],"study_design_scores_gemma":[0.00042712243,0.0002163173,0.00005157116,0.000026464033,0.0000046308182,0.0000060514976,0.00005041142,0.9342835,0.063604616,0.00076425105,0.0003883126,0.00017675587],"about_ca_topic_score_codex":0.00007597742,"about_ca_topic_score_gemma":0.000005393854,"teacher_disagreement_score":0.44557118,"about_ca_system_score_codex":0.000029696821,"about_ca_system_score_gemma":0.00006100443,"threshold_uncertainty_score":0.38958162},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03309167810542692,"score_gpt":0.3006811901368823,"score_spread":0.2675895120314554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008536450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04660109,0.00042486787,0.9512759,0.0000615379,0.0010307418,0.00020313625,0.0000143991965,0.000330114,0.000058252474],"genre_scores_gemma":[0.86652035,0.000012915999,0.13177608,0.0006553394,0.0008806483,0.000029968189,0.000039684357,0.000051578456,0.000033455923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979632,0.000056087167,0.0005250951,0.00045662382,0.0005235233,0.00047545787],"domain_scores_gemma":[0.99708235,0.0014104533,0.00008805901,0.0004825765,0.0005482667,0.00038826975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076394307,0.0002359004,0.00038837985,0.0000542274,0.00018159955,0.00011952611,0.00054741243,0.00020496288,0.000019184186],"category_scores_gemma":[0.0012650143,0.0002244328,0.000127911,0.00047686254,0.000042616462,0.00017548942,0.000073137926,0.0004753394,0.000017276156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020376048,0.000021717795,0.00035614392,0.00019116643,0.000046897174,0.0011855765,0.0011304255,0.75021476,0.000006638557,0.0018340964,0.0015107711,0.24348146],"study_design_scores_gemma":[0.00059871277,0.00012660907,0.000015033153,0.0007994454,0.000023229877,0.00028080455,0.0001096772,0.9865616,0.00003153096,0.00003177345,0.011153631,0.00026796415],"about_ca_topic_score_codex":0.00007029014,"about_ca_topic_score_gemma":9.668142e-7,"teacher_disagreement_score":0.8199192,"about_ca_system_score_codex":0.00007439596,"about_ca_system_score_gemma":0.00049937505,"threshold_uncertainty_score":0.9152104},"labels":[],"label_agreement":null},{"id":"W2014020629","doi":"10.1017/s0890060400145068","title":"SEED-Config: A case-based reasoning system for conceptual building design","year":2000,"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":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Conceptual design; Adaptation (eye); Generative Design; Process (computing); Representation (politics); Task (project management); Case-based reasoning; Object (grammar); Knowledge representation and reasoning; Human–computer interaction; Decomposition; Software engineering; Artificial intelligence; Information retrieval; Systems engineering; Programming language; Engineering","score_opus":0.03746279150245888,"score_gpt":0.25072088736310894,"score_spread":0.21325809586065006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014020629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013757487,0.0002222096,0.9847605,0.000060857223,0.00013853083,0.00062400626,0.000011969705,0.00041528474,0.000009119579],"genre_scores_gemma":[0.5969585,0.0000033703695,0.4027842,0.000023729548,0.000070105874,0.00011397291,0.00000642676,0.000020408077,0.000019285377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978024,0.00007922914,0.0005848779,0.0007094435,0.00018461508,0.00063947664],"domain_scores_gemma":[0.9976552,0.0015499158,0.00013808359,0.00038837665,0.00007682488,0.00019161288],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014364402,0.00034632662,0.00048441277,0.00044620055,0.00052002916,0.00049228565,0.00040392225,0.00013206653,0.000015229881],"category_scores_gemma":[0.000089932735,0.0003500094,0.0002792599,0.00045238168,0.00004207336,0.0003194626,0.000029697185,0.00016007543,0.0000051359334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051995263,0.000013872856,0.0000065411923,0.00007672626,0.0002457464,0.000054171895,0.000520404,0.9320501,0.0013055847,0.00787065,0.0000101278165,0.057794046],"study_design_scores_gemma":[0.00006210734,0.00012261377,0.0000041137155,0.000088891626,0.0002453061,0.00004428773,0.00012415985,0.7466462,0.25171593,0.00034859523,0.00026934917,0.00032841813],"about_ca_topic_score_codex":0.00012027084,"about_ca_topic_score_gemma":0.000006001187,"teacher_disagreement_score":0.58320105,"about_ca_system_score_codex":0.000084193925,"about_ca_system_score_gemma":0.00005180588,"threshold_uncertainty_score":0.9998952},"labels":[],"label_agreement":null},{"id":"W2017021543","doi":"10.3166/jesa.41.135-157","title":"Aided navigation for disabled people by re-use of experiments","year":2007,"lang":"en","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Wheelchair; Computer science; Focus (optics); Field (mathematics); Human–computer interaction; Similarity (geometry); Control (management); Artificial intelligence; Machine learning; Mathematics","score_opus":0.03339995444762571,"score_gpt":0.2899859124426352,"score_spread":0.2565859579950095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017021543","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.285294,0.00040901024,0.7131864,0.00011745801,0.00036297058,0.00020968184,0.000012823054,0.00014680551,0.0002608742],"genre_scores_gemma":[0.8154464,0.00001618694,0.18382448,0.000082607294,0.00007797946,0.000007101887,0.000014410831,0.000025830497,0.0005050441],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980023,0.0001509347,0.0007417356,0.00024412342,0.00043178536,0.0004291353],"domain_scores_gemma":[0.99800855,0.0006018447,0.00063230185,0.00032691195,0.00024841333,0.00018197492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012650705,0.00018641666,0.0003073205,0.00014074102,0.00036497923,0.00035985644,0.00054903177,0.000078159545,0.000015904037],"category_scores_gemma":[0.00025251924,0.00016521501,0.00012948744,0.00037449677,0.000042200616,0.0010565433,0.000086742766,0.00018017304,0.000011445599],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036398368,0.0008061701,0.04880086,0.0013145661,0.0005616972,0.00019817238,0.033781182,0.005574075,0.14664967,0.01654289,0.14577943,0.5996273],"study_design_scores_gemma":[0.0062340926,0.002689016,0.22533147,0.004689929,0.00016830418,0.0015840243,0.0009043365,0.58298945,0.13067597,0.026545323,0.016113056,0.002075021],"about_ca_topic_score_codex":0.00005269319,"about_ca_topic_score_gemma":0.0000067280757,"teacher_disagreement_score":0.5975523,"about_ca_system_score_codex":0.00012645856,"about_ca_system_score_gemma":0.000078946476,"threshold_uncertainty_score":0.6737273},"labels":[],"label_agreement":null},{"id":"W2019895519","doi":"10.1108/eum0000000006249","title":"Similarity assessment in a case‐based reasoning framework for building envelope design","year":2001,"lang":"en","type":"article","venue":"Logistics Information Management","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Envelope (radar); Building envelope; Similarity (geometry); Process (computing); Case-based reasoning; Building design; Computer science; Domain (mathematical analysis); Engineering; Systems engineering; Software engineering; Artificial intelligence; Architectural engineering; Mathematics; Programming language","score_opus":0.05969551920370992,"score_gpt":0.32819193269813357,"score_spread":0.26849641349442366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019895519","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000099429155,0.00001204139,0.99483323,0.0007069821,0.00022718418,0.0006173427,0.000005293255,0.00016653369,0.0033319688],"genre_scores_gemma":[0.22148688,0.000008961679,0.77739143,0.00095089676,0.000018817409,0.00009848148,0.000020235706,0.0000045759666,0.000019727659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865305,0.00007208351,0.00045645455,0.00019675831,0.00026054936,0.00036111684],"domain_scores_gemma":[0.9987058,0.0005390504,0.00021635067,0.0003894527,0.0000857496,0.0000636072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016415697,0.00015585229,0.00014516262,0.00029484375,0.00026912594,0.00039723108,0.00044108718,0.00008849502,0.000008490003],"category_scores_gemma":[0.00022504483,0.00016328416,0.00003865651,0.00047622732,0.000019243964,0.00070002594,0.00015558481,0.00023555923,0.000009792465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001206133,0.000022906775,0.0009505677,0.0000985727,0.00001222989,0.00015833162,0.00027893606,0.44072342,3.1603545e-7,0.52491814,0.0005734145,0.032251075],"study_design_scores_gemma":[0.00043639282,0.000066595356,0.000794926,0.00015544338,0.000011356518,0.000026457012,0.00013055044,0.94860893,0.000015563768,0.03807392,0.011465692,0.0002141625],"about_ca_topic_score_codex":0.000027722444,"about_ca_topic_score_gemma":0.0000033415597,"teacher_disagreement_score":0.5078855,"about_ca_system_score_codex":0.00020666036,"about_ca_system_score_gemma":0.00006611701,"threshold_uncertainty_score":0.6658535},"labels":[],"label_agreement":null},{"id":"W2027562469","doi":"10.1109/ictai.2011.86","title":"A Case-Based Reasoning Framework for Developing Agents Using Learning by Observation","year":2011,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Task (project management); Variety (cybernetics); Domain (mathematical analysis); Artificial intelligence; Obstacle avoidance; Human–computer interaction; Obstacle; Robot; Task analysis; Machine learning; Mobile robot; Engineering; Systems engineering","score_opus":0.16394894066154045,"score_gpt":0.3049484049658796,"score_spread":0.14099946430433916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027562469","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085318826,0.000049163973,0.91359586,0.00010582102,0.00018016074,0.00016460102,0.000001314541,0.0003180008,0.00026624848],"genre_scores_gemma":[0.36533985,4.889761e-7,0.63405573,0.00047480428,0.00002265826,0.000012268896,0.00000771924,0.000012515225,0.00007399025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987604,0.00008223248,0.00024591613,0.00037960542,0.00015253895,0.0003793148],"domain_scores_gemma":[0.9990513,0.00035141993,0.00017081502,0.00024258399,0.0001117835,0.00007211046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053187023,0.00015871867,0.00014413474,0.0000827605,0.0005652634,0.00015347257,0.00032785573,0.00012253904,0.00001808119],"category_scores_gemma":[0.0002900542,0.00015989026,0.00005541362,0.00035210254,0.000014437185,0.0004221622,0.00006919648,0.0002083906,0.000006693563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016247535,0.00025135034,0.24440202,0.0006580129,0.00026943185,0.001199693,0.029052706,0.03989032,0.003986093,0.5661717,0.006594048,0.10736214],"study_design_scores_gemma":[0.00025179842,0.00007567858,0.0002606946,0.00028770624,0.000011188927,0.00008835239,0.000099703415,0.9876487,0.005721801,0.00399556,0.0012268756,0.00033193713],"about_ca_topic_score_codex":0.00027808425,"about_ca_topic_score_gemma":0.000004162961,"teacher_disagreement_score":0.9477584,"about_ca_system_score_codex":0.00007632036,"about_ca_system_score_gemma":0.00011082164,"threshold_uncertainty_score":0.65201354},"labels":[],"label_agreement":null},{"id":"W2030659368","doi":"10.1007/s10703-013-0197-1","title":"Model checking approach to automated planning","year":2013,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Model checking; Process (computing); Domain (mathematical analysis); Field (mathematics); Automated planning and scheduling; State (computer science); State space; Software engineering; Artificial intelligence; Theoretical computer science; Programming language","score_opus":0.12667463912516952,"score_gpt":0.3628655870095945,"score_spread":0.23619094788442496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030659368","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010355402,0.0001178469,0.98533994,0.000031824744,0.00025216452,0.0007269286,7.4768695e-7,0.0014227135,0.011072315],"genre_scores_gemma":[0.29764837,1.2711516e-7,0.70191085,0.000099205026,0.0000274575,0.00021625205,0.000001129028,0.000016528467,0.00008006173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969479,0.00095501204,0.0005659945,0.00049709715,0.00028443208,0.0007495879],"domain_scores_gemma":[0.9985559,0.00045553036,0.0001600553,0.0005550189,0.00008099711,0.00019250764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055917967,0.00024859965,0.00038405383,0.00035522002,0.00021102866,0.00032246273,0.0010538375,0.00016013462,0.0000016501587],"category_scores_gemma":[0.00012614447,0.00022299372,0.000058555765,0.00077719847,0.000012941074,0.0011045691,0.00026182944,0.0002712128,0.0000721289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008754332,0.000022366872,0.00029638692,0.00016567191,0.000012690124,0.0000073680762,0.00580167,0.9665663,0.0019407164,0.008365926,0.0010843043,0.015727816],"study_design_scores_gemma":[0.00019911547,0.000056622874,0.00025095648,0.00034948598,0.000003488089,0.000043486267,0.00026737642,0.99652845,0.0015290453,0.0004415397,0.000038724,0.00029169314],"about_ca_topic_score_codex":0.000073010204,"about_ca_topic_score_gemma":8.205904e-8,"teacher_disagreement_score":0.29661283,"about_ca_system_score_codex":0.0001556258,"about_ca_system_score_gemma":0.0000959057,"threshold_uncertainty_score":0.909342},"labels":[],"label_agreement":null},{"id":"W203265101","doi":"","title":"The compression power of symbolic pattern databases","year":2008,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Computer science; Database; Heuristic; Table (database); Representation (politics); State (computer science); Space (punctuation); Lookup table; Theoretical computer science; Algorithm; Programming language; Artificial intelligence","score_opus":0.0338979411775821,"score_gpt":0.25404526776798786,"score_spread":0.22014732659040576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W203265101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14256045,0.00051596196,0.8475653,0.0008415212,0.00026365422,0.00007302561,0.000005252035,0.00014058914,0.008034276],"genre_scores_gemma":[0.9934448,0.000026617,0.0057247523,0.0002423352,0.000013124654,0.000001725646,0.0000025842205,0.0000029296316,0.0005411574],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993716,0.00004787403,0.00013241472,0.00013404479,0.00016981475,0.0001442762],"domain_scores_gemma":[0.9991114,0.00028978402,0.000056297013,0.0004713002,0.00003484162,0.000036364585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001548264,0.000060773193,0.00007417056,0.000023127895,0.00025544706,0.000020270969,0.00052882364,0.000014250939,0.000025161105],"category_scores_gemma":[0.000018760848,0.00003494751,0.000026947002,0.00010303355,0.000047009533,0.00014728258,0.00018501606,0.00007027355,0.00002850372],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034513218,0.0003562541,0.41085455,0.00007723366,0.00010109292,0.00016863526,0.013227281,0.0014617478,0.006604892,0.07121186,0.3054636,0.19043832],"study_design_scores_gemma":[0.0020156666,0.00063225173,0.2638011,0.00077469036,0.00002077179,0.00046613996,0.00048701576,0.32730407,0.09595479,0.0021788252,0.30487424,0.0014904521],"about_ca_topic_score_codex":0.00015071227,"about_ca_topic_score_gemma":0.000005202809,"teacher_disagreement_score":0.8508843,"about_ca_system_score_codex":0.0000033343067,"about_ca_system_score_gemma":0.000029221404,"threshold_uncertainty_score":0.1964718},"labels":[],"label_agreement":null},{"id":"W2038505136","doi":"10.1109/isi.2010.5484769","title":"Intelligent decision support for Marine safety and Security Operations","year":2010,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Defence Research and Development Canada","keywords":"Computer science; Robustness (evolution); Scalability; Decision support system; Task (project management); Computer security; Domain (mathematical analysis); Risk analysis (engineering); Systems engineering; Process management; Engineering; Business; Artificial intelligence","score_opus":0.013464664471612233,"score_gpt":0.2701548252859112,"score_spread":0.256690160814299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038505136","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011526315,0.0000068269246,0.9829215,0.0008751942,0.00032041816,0.00014162957,0.000004730687,0.00008154829,0.0041218298],"genre_scores_gemma":[0.39677647,0.000011506791,0.6016775,0.00040945475,0.00004948725,0.000008572728,0.000017099428,0.0000042211113,0.0010457273],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994237,0.000009045701,0.00014756377,0.00020768288,0.00007936671,0.00013267886],"domain_scores_gemma":[0.9993786,0.00021659545,0.000015069767,0.0002440813,0.0000641662,0.00008146096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004264235,0.00006657532,0.00007431096,0.000039047853,0.00019556233,0.0001350413,0.0002288964,0.000045895955,0.00016781072],"category_scores_gemma":[0.00008004804,0.000053623204,0.00002296843,0.00007319621,0.000016425432,0.00019389523,0.00019194618,0.00011476219,0.000017034019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000383656,0.00006953563,0.0062971064,0.000020434636,0.000013324931,0.000004624238,0.0013608458,0.0006448642,0.0007432187,0.43896362,0.0065135565,0.54533046],"study_design_scores_gemma":[0.00035661712,0.00017740128,0.002233025,0.000009898631,0.000005235426,0.000036437184,0.000018114311,0.8318813,0.0030490118,0.023328153,0.13868566,0.00021915972],"about_ca_topic_score_codex":0.000060890394,"about_ca_topic_score_gemma":0.00036895898,"teacher_disagreement_score":0.8312364,"about_ca_system_score_codex":0.000005410968,"about_ca_system_score_gemma":0.000046306202,"threshold_uncertainty_score":0.21866909},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021222938567931462,"score_gpt":0.23602731224334178,"score_spread":0.21480437367541033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W204258288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015533687,0.00007059922,0.9724419,0.0008019628,0.000043701017,0.0001558822,5.897965e-7,0.00017829034,0.010773383],"genre_scores_gemma":[0.65930414,2.115083e-7,0.33989215,0.0007610466,0.00001845292,0.000002970785,0.0000036395325,0.0000036682013,0.000013754257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992537,0.00003610284,0.00015032964,0.00017594114,0.00015325249,0.00023070954],"domain_scores_gemma":[0.9994291,0.00012512007,0.00005769323,0.00025000272,0.00005379874,0.000084253596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044517676,0.000119229044,0.000095192816,0.00013175535,0.0004122118,0.00039075527,0.0002582863,0.00002992119,5.939812e-7],"category_scores_gemma":[0.000022237717,0.000073692536,0.000014049634,0.0003982286,0.0000288781,0.00057404774,0.00010319331,0.0001336051,0.000015081796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004055896,0.000036733818,0.0023357105,0.000105584244,0.000027778004,0.000009390861,0.025305517,0.78016275,0.00018721732,0.07058131,0.00050032506,0.120707124],"study_design_scores_gemma":[0.0009373046,0.00020078868,0.0034683042,0.00034849663,0.000009559178,0.00011968929,0.0006021229,0.98402214,0.00072816375,0.0010839481,0.008067138,0.0004123464],"about_ca_topic_score_codex":0.00008302265,"about_ca_topic_score_gemma":0.0000048064585,"teacher_disagreement_score":0.64377046,"about_ca_system_score_codex":0.0000383944,"about_ca_system_score_gemma":0.00009618824,"threshold_uncertainty_score":0.3768062},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0366648073150374,"score_gpt":0.23460978040407846,"score_spread":0.19794497308904105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043379547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0115487855,0.0007885234,0.9868712,0.00039992147,0.00005777022,0.00014963679,0.0000018298607,0.00016081151,0.000021544018],"genre_scores_gemma":[0.8249364,0.00005253217,0.17479624,0.000023207629,0.00010174894,0.000028439925,0.0000031708742,0.00000976235,0.000048515314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988284,0.000024634757,0.00026514818,0.00044983282,0.00013268043,0.000299313],"domain_scores_gemma":[0.9992003,0.00039000448,0.00006938691,0.00019176352,0.000046701927,0.00010188053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000655988,0.00018489569,0.00022087785,0.00031871907,0.0002661687,0.00033138937,0.00017017052,0.000058606056,0.00001243567],"category_scores_gemma":[0.00007548075,0.00017341752,0.0000936183,0.0002617853,0.000036000867,0.00040622312,0.000062983054,0.00012603358,0.0000034404782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012863151,0.000018971776,0.000060426373,0.000027046444,0.00027403512,0.0000012380276,0.0035401362,0.787921,0.00089697103,0.11019006,0.000012390606,0.09704483],"study_design_scores_gemma":[0.000025292211,0.0000569822,0.00026581995,0.000029351986,0.000108657914,0.000005592249,0.00024429805,0.9428058,0.04777666,0.007971088,0.000465672,0.00024474875],"about_ca_topic_score_codex":0.000030709467,"about_ca_topic_score_gemma":0.000010772604,"teacher_disagreement_score":0.81338763,"about_ca_system_score_codex":0.00003181777,"about_ca_system_score_gemma":0.000013708253,"threshold_uncertainty_score":0.7071761},"labels":[],"label_agreement":null},{"id":"W2048399360","doi":"10.3166/jesa.41.673-706","title":"Vers une approche holonique des systèmes mécatroniques complexes. Proposition d'un système de pilotage auto-organisé et isoarchique","year":2007,"lang":"fr","type":"preprint","venue":"Journal Européen des Systèmes Automatisés","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Proposition; Philosophy; Linguistics","score_opus":0.03262953127261528,"score_gpt":0.2816333781663954,"score_spread":0.2490038468937801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048399360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063318394,0.011389906,0.90962654,0.0032309683,0.0016778087,0.0018324857,0.00016225805,0.0022553555,0.0065062796],"genre_scores_gemma":[0.5494899,0.0018644786,0.44346416,0.00079824997,0.0010238102,0.000116023984,0.00013490726,0.0003874898,0.0027209737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9821633,0.0070081605,0.0034635146,0.0021023573,0.002027597,0.0032350384],"domain_scores_gemma":[0.9899044,0.0014848501,0.0036438406,0.0018272836,0.0015771838,0.0015624372],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.011066785,0.0021985604,0.0024165134,0.0010447179,0.003167025,0.004926513,0.004095932,0.0014219724,0.00021369378],"category_scores_gemma":[0.00083248626,0.0021806378,0.0010805231,0.0017519138,0.0016850099,0.0022156911,0.0019374003,0.006157138,0.00035432362],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000741505,0.0022270258,0.0077491715,0.02209778,0.0037347598,0.011894936,0.11276426,0.06844401,0.028187944,0.18954884,0.010681565,0.54192823],"study_design_scores_gemma":[0.0026838877,0.0033232868,0.28255445,0.039415915,0.0011029805,0.04652222,0.0011021278,0.30187058,0.010876487,0.2991196,0.0062546944,0.005173779],"about_ca_topic_score_codex":0.00441238,"about_ca_topic_score_gemma":0.00019529398,"teacher_disagreement_score":0.5367544,"about_ca_system_score_codex":0.007171039,"about_ca_system_score_gemma":0.005359136,"threshold_uncertainty_score":0.9998744},"labels":[],"label_agreement":null},{"id":"W2051982622","doi":"10.4236/ti.2012.32016","title":"A Rule-Based Expert System for Industrial Training","year":2012,"lang":"en","type":"article","venue":"Technology and Investment","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"China Scholarship Council; Loughborough University","keywords":"Computer science; CLIPS; Expert system; Range (aeronautics); Software; Knowledge base; Base (topology); Chemical plant; Data mining; Machine learning; Artificial intelligence; Operating system; Engineering","score_opus":0.07137952249242278,"score_gpt":0.2607627433003964,"score_spread":0.1893832208079736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051982622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34911096,0.005418792,0.6287425,0.008860596,0.0015987512,0.0009643891,0.0000111272,0.002389732,0.0029031367],"genre_scores_gemma":[0.9261881,9.639251e-7,0.072434686,0.0010611027,0.00010464118,0.00016591653,0.0000037864925,0.000006566689,0.000034202014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991944,0.000027812966,0.00014936048,0.0002001212,0.000070538015,0.00035776763],"domain_scores_gemma":[0.9994992,0.00008707051,0.00006709096,0.00024438658,0.000017207387,0.00008504623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039612758,0.00011272471,0.00014924939,0.00021855188,0.00019818135,0.000028549299,0.00025709922,0.00022832227,0.0000016713968],"category_scores_gemma":[0.000039826373,0.000098933764,0.000026446067,0.0002239895,0.000074572636,0.00014684118,0.00006652414,0.00014285296,0.0000058255014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012873576,0.000039616945,0.002459224,0.000026777467,0.000023846587,0.0000028183383,0.0011990033,0.000011860883,0.00086147676,0.95582634,0.0019371262,0.037599057],"study_design_scores_gemma":[0.013031422,0.002877464,0.0006536595,0.0015567627,0.000114948976,0.00035574366,0.004804402,0.12769988,0.20226741,0.07557136,0.5686374,0.0024295626],"about_ca_topic_score_codex":0.0000049512314,"about_ca_topic_score_gemma":1.8573171e-7,"teacher_disagreement_score":0.880255,"about_ca_system_score_codex":0.0000437654,"about_ca_system_score_gemma":0.00006589516,"threshold_uncertainty_score":0.4034402},"labels":[],"label_agreement":null},{"id":"W2053197249","doi":"10.1118/1.3660517","title":"A self‐adaptive case‐based reasoning system for dose planning in prostate cancer radiotherapy","year":2011,"lang":"en","type":"article","venue":"Medical Physics","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nexen (Canada)","funders":"Engineering and Physical Sciences Research Council","keywords":"Radiation oncologist; Radiation therapy; Medicine; Medical physics; Prostate cancer; Radiation treatment planning; Population; Plan (archaeology); Cancer; Internal medicine","score_opus":0.036153219392179886,"score_gpt":0.28324085512832453,"score_spread":0.24708763573614465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053197249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016633058,0.0006757263,0.980912,0.000168761,0.00034351423,0.00041904728,0.000011223115,0.00032849246,0.00050817395],"genre_scores_gemma":[0.871594,0.00000502431,0.12758309,0.00037466118,0.00020445551,0.0001940399,0.0000043411296,0.00002302454,0.000017384134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844635,0.00010062147,0.00026380114,0.00039859893,0.00034823123,0.00044242144],"domain_scores_gemma":[0.9990343,0.00030460392,0.00013226752,0.0002751143,0.00006214629,0.00019155914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007046514,0.00018216054,0.0002672209,0.0000589389,0.00015789834,0.000045516932,0.0004229154,0.00009038036,0.0000057899338],"category_scores_gemma":[0.000038132494,0.00016083012,0.00006578883,0.00034172102,0.000041532094,0.00021206912,0.000048352365,0.0002986035,0.000002202277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014836675,0.001668044,0.07078639,0.0034799213,0.00067945325,0.027042173,0.22763526,0.022438211,0.0001869501,0.07188871,0.005372959,0.5673383],"study_design_scores_gemma":[0.0016570084,0.00025515314,0.00014165245,0.0011516742,0.000012301402,0.00010332813,0.00015782347,0.9942745,0.0011137124,0.00044437262,0.000392625,0.0002958366],"about_ca_topic_score_codex":0.00049943605,"about_ca_topic_score_gemma":0.000015998143,"teacher_disagreement_score":0.9718363,"about_ca_system_score_codex":0.00016446711,"about_ca_system_score_gemma":0.00042199387,"threshold_uncertainty_score":0.6558462},"labels":[],"label_agreement":null},{"id":"W2057434766","doi":"10.1016/j.artint.2004.01.004","title":"Towards a practical theory of reformulation for reasoning about physical systems","year":2004,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Terminology; Computer science; Class (philosophy); Context (archaeology); Physical system; Artificial intelligence; Theoretical computer science; Management science","score_opus":0.07585639535785717,"score_gpt":0.3487610667369615,"score_spread":0.27290467137910435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057434766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025576718,0.00008343617,0.9726188,0.0004380788,0.0003086594,0.0002299694,0.000004032611,0.000098398166,0.00064188725],"genre_scores_gemma":[0.9215557,0.0000025172758,0.07819429,0.000039944178,0.00015065822,0.000024967221,0.0000036544684,0.000008074941,0.000020208443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881184,0.000072404706,0.00033880523,0.00028656312,0.00023529743,0.00025511283],"domain_scores_gemma":[0.9988303,0.00042464506,0.0001784151,0.0003184885,0.00018095748,0.00006716771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008905794,0.00011341162,0.00017891893,0.000065215565,0.00014400338,0.0001066828,0.00032586989,0.0000654456,0.0000019463107],"category_scores_gemma":[0.0005324376,0.00009892458,0.00008039893,0.00026901622,0.00006300594,0.0004052851,0.00006358565,0.00013163516,0.000024859579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039847528,0.00006618518,0.0000125519155,0.000030066818,0.000009997566,0.000002790454,0.0021826136,0.029229319,0.0011212858,0.9142706,0.000009069311,0.05302571],"study_design_scores_gemma":[0.00003941859,0.00026000728,0.000055403838,0.00019599091,0.000012918414,0.000013022353,0.00028063694,0.45779762,0.07123188,0.4697893,0.00015775529,0.00016603299],"about_ca_topic_score_codex":0.00012033451,"about_ca_topic_score_gemma":0.000004512985,"teacher_disagreement_score":0.895979,"about_ca_system_score_codex":0.000055734185,"about_ca_system_score_gemma":0.00018376825,"threshold_uncertainty_score":0.40340272},"labels":[],"label_agreement":null},{"id":"W2059857409","doi":"10.1163/156855309x452539","title":"Improving Search and Rescue Using Contextual Information","year":2009,"lang":"en","type":"article","venue":"Advanced Robotics","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Search and rescue; Computer science; Artificial intelligence; Robotics; Robot; Context (archaeology); Rescue robot; Architecture; Human–computer interaction; Formalism (music); Systems engineering; Mobile robot; Engineering","score_opus":0.017867910432578345,"score_gpt":0.2620443480964364,"score_spread":0.24417643766385805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059857409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033413768,0.00016836385,0.9655667,0.00037229247,0.00010724488,0.000086376764,0.0000010457633,0.00011344826,0.0001707832],"genre_scores_gemma":[0.5788653,0.000007585054,0.4207127,0.00037168633,0.000018683677,3.4017148e-7,0.000002315672,0.0000023788114,0.000018980665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992565,0.000027698412,0.00017557769,0.00014227121,0.00015321316,0.00024477232],"domain_scores_gemma":[0.99953353,0.000057723846,0.000036949954,0.00021646426,0.00008061916,0.000074688454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002065396,0.00009265691,0.0000997524,0.00007643031,0.00020452245,0.00015625195,0.00020495035,0.000047838068,5.704069e-7],"category_scores_gemma":[0.00006299343,0.000090711575,0.00001676939,0.00017171625,0.00002094001,0.001460407,0.00007474295,0.00016306783,0.000005625221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006041044,0.000005844646,0.0001105929,0.000012951689,0.0000023326907,0.00000397267,0.00073334645,0.73177934,0.0017503013,0.014574018,0.000008491159,0.25101274],"study_design_scores_gemma":[0.00030688924,0.00011485125,0.0006014891,0.00004516778,0.000003180536,0.000022024495,0.000068772795,0.99722666,0.00071953423,0.0006278979,0.00012413661,0.00013938236],"about_ca_topic_score_codex":0.00003477191,"about_ca_topic_score_gemma":0.0000027267176,"teacher_disagreement_score":0.5454515,"about_ca_system_score_codex":0.000032151216,"about_ca_system_score_gemma":0.00005450639,"threshold_uncertainty_score":0.36991107},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028732502775229235,"score_gpt":0.2692422154708109,"score_spread":0.24050971269558166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064770256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015454193,0.00032452962,0.9808676,0.000268929,0.0014109667,0.00037531697,0.0000038767093,0.000090153684,0.0012043891],"genre_scores_gemma":[0.94930995,0.000015417552,0.048513792,0.00008023422,0.00067657896,0.00003587049,0.0000030491053,0.000017904567,0.0013472136],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982671,0.000101854865,0.0005438959,0.0002654477,0.00038481868,0.00043689052],"domain_scores_gemma":[0.9988101,0.00015134427,0.00027671683,0.00023658188,0.00028600873,0.00023926435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017102611,0.00016003115,0.00021915826,0.000182951,0.0003875958,0.000662272,0.0006977037,0.000088303284,0.000032932243],"category_scores_gemma":[0.00013813536,0.0001290188,0.00012947468,0.00022246821,0.000015092424,0.00047675823,0.00007780553,0.0002690333,0.000057150737],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010997853,0.0009489173,0.046093225,0.001090794,0.00063864066,0.0037113775,0.010990624,0.0277347,0.022491442,0.091559365,0.25857657,0.5350646],"study_design_scores_gemma":[0.0033600247,0.0028205123,0.0009870064,0.0026436227,0.0000460279,0.024407849,0.00046961455,0.3808038,0.0033879424,0.023837907,0.55565476,0.0015809098],"about_ca_topic_score_codex":0.000026641972,"about_ca_topic_score_gemma":0.0000020203415,"teacher_disagreement_score":0.9338558,"about_ca_system_score_codex":0.00009820854,"about_ca_system_score_gemma":0.00018407051,"threshold_uncertainty_score":0.6386304},"labels":[],"label_agreement":null},{"id":"W2064858","doi":"10.1038/sj.bdj.4807562","title":"The Environment as Theory: An Example Using the ACT-R/SOS Environment.","year":2004,"lang":"en","type":"article","venue":"International Conference on Cognitive Modelling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science","score_opus":0.13583206296145547,"score_gpt":0.2954661663969097,"score_spread":0.15963410343545423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043566026,0.00007747876,0.9496887,0.0010948827,0.00020883264,0.00019713103,0.000009651995,0.000050478026,0.0051068347],"genre_scores_gemma":[0.9901452,0.00012865473,0.008725369,0.00057610247,0.000094452575,0.00002919048,0.000017978053,0.000014908651,0.00026812943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981956,0.00020111211,0.0002283591,0.00048755866,0.0005823005,0.000305106],"domain_scores_gemma":[0.998773,0.0005390119,0.00015783767,0.00036457018,0.000081039936,0.00008455111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008031573,0.00020643734,0.000103691986,0.000056746238,0.00076628197,0.0005068092,0.0011138468,0.000056131412,0.00010581872],"category_scores_gemma":[0.000026181313,0.0001369279,0.00006424338,0.00005269972,0.00016299254,0.00040780226,0.00018962455,0.0003424904,0.00018527207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050810522,0.00006857863,0.000050127124,0.000001272509,0.000061198676,0.0000133239755,0.0025257985,0.41622737,0.00040006315,0.564836,0.0000033150106,0.015762106],"study_design_scores_gemma":[0.0003283551,0.00012324964,0.000018437891,0.00010709697,0.00001304868,0.00001209817,0.00059579284,0.8363132,0.0018882633,0.15948753,0.00091257266,0.000200353],"about_ca_topic_score_codex":0.0002613294,"about_ca_topic_score_gemma":0.000004747221,"teacher_disagreement_score":0.9465792,"about_ca_system_score_codex":0.00013396764,"about_ca_system_score_gemma":0.00012613431,"threshold_uncertainty_score":0.5893699},"labels":[],"label_agreement":null},{"id":"W2066424852","doi":"10.1109/iat.2006.99","title":"Planning with Action Abstraction and Plan Decomposition Hierarchies","year":2006,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Hierarchy; Plan (archaeology); Decomposition; Abstraction; Representation (politics); Task (project management); Construct (python library); Action (physics); Domain (mathematical analysis); Artificial intelligence; Automated planning and scheduling; Theoretical computer science; Programming language; Systems engineering; Engineering","score_opus":0.01850233284128134,"score_gpt":0.25968724375243424,"score_spread":0.2411849109111529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066424852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3822416,0.00005706468,0.60966,0.0003467317,0.00006332606,0.000045998426,5.6751065e-7,0.00022979124,0.0073548555],"genre_scores_gemma":[0.9367989,0.000001875082,0.06282417,0.00006205227,0.00006406659,0.0000037028599,0.000014244675,0.000004105864,0.00022689234],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9994533,0.000021143189,0.00009204373,0.00018851476,0.00011004979,0.00013497095],"domain_scores_gemma":[0.999717,0.0000787285,0.0000523957,0.00010261521,0.000017411396,0.000031852254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000100511796,0.00007997672,0.000061457606,0.00008984734,0.00020903668,0.00017615274,0.00007785898,0.000034704826,0.000004355368],"category_scores_gemma":[0.0000014205946,0.00006469277,0.000009372321,0.00009840576,0.000017605456,0.0005369215,0.000018614368,0.00010152831,0.000006282676],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047893578,0.0003317054,0.36879483,0.0002748708,0.00012287058,0.00030517924,0.0044516018,0.17402801,0.05089482,0.14996487,0.020075211,0.23027709],"study_design_scores_gemma":[0.0015142831,0.00082801696,0.6523515,0.00036515118,0.000029991124,0.00094406476,0.00032384566,0.28593412,0.030789051,0.01713455,0.00878375,0.0010016713],"about_ca_topic_score_codex":0.0002474184,"about_ca_topic_score_gemma":0.00003266375,"teacher_disagreement_score":0.55455726,"about_ca_system_score_codex":0.000015361175,"about_ca_system_score_gemma":0.000014654792,"threshold_uncertainty_score":0.26380947},"labels":[],"label_agreement":null},{"id":"W2067321549","doi":"10.1002/cplx.20199","title":"Why complex systems engineering needs biological development","year":2007,"lang":"en","type":"article","venue":"Complexity","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Complex system; Natural (archaeology); Biochemical engineering; Artificial intelligence; Biology; Engineering","score_opus":0.12035645573251472,"score_gpt":0.2659856705950171,"score_spread":0.14562921486250238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067321549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06312677,0.00021061314,0.9334612,0.0002418629,0.0004912429,0.0001240758,0.0000019770187,0.0005481076,0.0017941582],"genre_scores_gemma":[0.84162396,8.505483e-7,0.15769765,0.0005031427,0.00010225153,0.000005351412,0.000018093986,0.000007496114,0.000041224896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986126,0.000044102555,0.00033293522,0.000282311,0.00022476804,0.00050327496],"domain_scores_gemma":[0.99909574,0.00022300896,0.00007743622,0.00036299037,0.000065281056,0.00017556583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009495654,0.00018003411,0.00021746373,0.00016576017,0.00023997112,0.00014653239,0.0007664929,0.00008304189,0.00002259464],"category_scores_gemma":[0.00004253582,0.0001603112,0.000044809014,0.00045421228,0.000048471113,0.00012967786,0.00027473923,0.00019449831,0.000071384944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006590768,0.00041400336,0.06258569,0.0003951604,0.00021875116,0.00031451986,0.01031885,0.01390522,0.012584232,0.7977484,0.053159926,0.048289347],"study_design_scores_gemma":[0.0004566746,0.00011870562,0.108085044,0.00012931519,0.000003054716,0.000108034954,0.0001272891,0.25225762,0.0011975577,0.00090851495,0.63581204,0.0007961546],"about_ca_topic_score_codex":0.00006344241,"about_ca_topic_score_gemma":0.0000059340414,"teacher_disagreement_score":0.7968399,"about_ca_system_score_codex":0.00008548758,"about_ca_system_score_gemma":0.000041951414,"threshold_uncertainty_score":0.65373015},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.11839311153838611,"score_gpt":0.28783373762534487,"score_spread":0.16944062608695876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078022838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044428343,0.000033440803,0.99060285,0.0003206896,0.0002914617,0.0005137919,0.00006538406,0.00023887723,0.003490646],"genre_scores_gemma":[0.8879379,0.0000036103434,0.11128367,0.000411489,0.00013150665,0.000058241283,0.00013078147,0.000016265343,0.000026560068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801916,0.000012754593,0.00060416124,0.00058368087,0.00025834556,0.0005219194],"domain_scores_gemma":[0.9985472,0.00054253585,0.00019969566,0.0004086018,0.00016360174,0.00013834798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009950902,0.00019763761,0.00016430653,0.00012831864,0.00041361977,0.00015393783,0.00061281136,0.00012606908,0.000005084127],"category_scores_gemma":[0.000113846785,0.00020305504,0.00006717457,0.00032349754,0.00005411561,0.00022851465,0.00009644582,0.00017625606,0.00021087549],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056133664,0.0002799759,0.000041511445,0.000023121947,0.000041955216,0.000004124141,0.0055306545,0.031955943,0.00032034775,0.092415005,0.0026552777,0.86617076],"study_design_scores_gemma":[0.00013327211,0.00015456729,0.000025656822,0.000047063262,0.000020821939,0.0000011046126,0.00012349723,0.81224185,0.048196163,0.13684066,0.001787137,0.00042823175],"about_ca_topic_score_codex":0.000038017504,"about_ca_topic_score_gemma":0.000121340265,"teacher_disagreement_score":0.88349503,"about_ca_system_score_codex":0.00003527332,"about_ca_system_score_gemma":0.000048924245,"threshold_uncertainty_score":0.82803446},"labels":[],"label_agreement":null},{"id":"W2081250864","doi":"10.1007/s10489-007-0039-1","title":"Automated case creation and management for diagnostic CBR systems","year":2007,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.01879704733759381,"score_gpt":0.27867243596318286,"score_spread":0.25987538862558907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081250864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003733668,0.00045485076,0.99063826,0.000047136396,0.00023383695,0.00061577314,0.000002424702,0.00048335642,0.0037906717],"genre_scores_gemma":[0.93683434,0.0000450566,0.06275068,0.00009903545,0.00003624779,0.00009700376,0.0000061713504,0.0000082258875,0.00012322218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999023,0.000011613331,0.00024370533,0.00032715278,0.000119999735,0.00027453282],"domain_scores_gemma":[0.99866563,0.000866777,0.000079870646,0.00026211416,0.000042627657,0.00008299697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005509597,0.00011849341,0.00010813555,0.00009775866,0.00019427719,0.00014972025,0.00023747535,0.000053628497,0.0000016917882],"category_scores_gemma":[0.000041669497,0.00011442349,0.000017282217,0.00022453888,0.000030533505,0.000101548016,0.000080616715,0.00005995223,0.000027774113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022950677,0.000050698844,0.00032131703,0.00038941426,0.000046671965,0.0006226036,0.0019981947,0.008672114,0.00016313413,0.7480235,0.0022363325,0.23745306],"study_design_scores_gemma":[0.00022994936,0.00014570828,0.00043251377,0.00020606887,0.0000389125,0.00064209243,0.0009379827,0.9773695,0.006059483,0.005401122,0.008047287,0.0004893852],"about_ca_topic_score_codex":0.00006143245,"about_ca_topic_score_gemma":0.000006402865,"teacher_disagreement_score":0.96869737,"about_ca_system_score_codex":0.000030601128,"about_ca_system_score_gemma":0.000009963788,"threshold_uncertainty_score":0.46660545},"labels":[],"label_agreement":null},{"id":"W2084465640","doi":"10.1109/iccac.2014.26","title":"QuARAM Recommender: Case-Based Reasoning for IaaS Service Selection","year":2014,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Recommender system; Cloud computing; Provisioning; Selection (genetic algorithm); Software deployment; Service (business); Resource (disambiguation); Case-based reasoning; Service provider; World Wide Web; Artificial intelligence; Software engineering; Computer network","score_opus":0.021834038601084037,"score_gpt":0.2569758841948174,"score_spread":0.23514184559373338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084465640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032935257,0.000018791538,0.9882496,0.0041407896,0.00024075316,0.00016588185,0.0000013299328,0.00056124665,0.0033280898],"genre_scores_gemma":[0.5111993,2.7382558e-7,0.4845198,0.0038706257,0.00009901586,0.000035977697,0.0000099670515,0.000012406909,0.00025264898],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989117,0.00010792099,0.000183103,0.00036324176,0.00011353028,0.00032052476],"domain_scores_gemma":[0.99879766,0.0005708069,0.000089051166,0.00030552462,0.00014481934,0.000092166745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008493581,0.00013475242,0.0001316391,0.00008675143,0.0003870771,0.00017956158,0.00030283257,0.000082215505,0.00002223237],"category_scores_gemma":[0.00008179154,0.0001275324,0.000053406202,0.00035949127,0.0000057379093,0.00025159886,0.000036154248,0.00012717737,0.000032899552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015257318,0.0003310577,0.011826059,0.00066306844,0.00013186636,0.00008490703,0.0039549624,0.1074021,0.0012546688,0.22802658,0.16828696,0.4778852],"study_design_scores_gemma":[0.0004059944,0.00017581765,0.000032887227,0.0000395132,0.000006910654,0.00015100441,0.000023619703,0.9643846,0.0013715832,0.0011439096,0.03207008,0.00019403682],"about_ca_topic_score_codex":0.0005380903,"about_ca_topic_score_gemma":0.00027614366,"teacher_disagreement_score":0.8569825,"about_ca_system_score_codex":0.00004415514,"about_ca_system_score_gemma":0.000072384486,"threshold_uncertainty_score":0.520062},"labels":[],"label_agreement":null},{"id":"W2084507688","doi":"10.3182/20091014-3-cl-4011.00059","title":"Application of Inductive Monitoring System for equipment condition monitoring","year":2009,"lang":"en","type":"article","venue":"IFAC Proceedings Volumes","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Suncor Energy Incorporated","keywords":"Process (computing); Set (abstract data type); Cluster analysis; Baseline (sea); Computer science; Mode (computer interface); Data mining; Sensitivity (control systems); Real-time computing; Reliability engineering; Engineering; Artificial intelligence; Electronic engineering","score_opus":0.01755302854448358,"score_gpt":0.2700493886720815,"score_spread":0.2524963601275979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084507688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48400167,0.00024825294,0.5132602,0.00023744494,0.00052052195,0.0005903975,0.0000052779055,0.00043264907,0.0007036246],"genre_scores_gemma":[0.93020755,0.0000031345878,0.06933235,0.000006174128,0.00030062892,0.00010170265,0.0000026070352,0.000008257091,0.000037584083],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988258,0.0000057076327,0.00029351367,0.00035274285,0.00025267224,0.0002695943],"domain_scores_gemma":[0.9991395,0.000049316437,0.0002913384,0.00013206984,0.00032118458,0.000066623295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034172373,0.00014394564,0.00019520224,0.00012481396,0.0001945028,0.00011682466,0.00040131644,0.00008734259,2.2030567e-7],"category_scores_gemma":[0.000035939556,0.00015027089,0.000057189733,0.00026218352,0.00001785773,0.0006758461,0.000046508136,0.000106452506,0.000004206295],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007228393,0.0001633271,0.16246419,0.0010346123,0.000097589706,0.0000019825236,0.010686362,0.0006419264,0.36419302,0.0785119,0.0004603094,0.3816725],"study_design_scores_gemma":[0.0011198231,0.0009483391,0.052515022,0.0015819257,0.0000613987,0.00002149434,0.0030196737,0.09355688,0.83587545,0.009595113,0.0009583765,0.00074647315],"about_ca_topic_score_codex":0.00002078797,"about_ca_topic_score_gemma":3.5647002e-8,"teacher_disagreement_score":0.47168246,"about_ca_system_score_codex":0.00014490004,"about_ca_system_score_gemma":0.000032112104,"threshold_uncertainty_score":0.6127869},"labels":[],"label_agreement":null},{"id":"W2086585961","doi":"10.1016/s0020-0255(01)00134-7","title":"Unifying single-agent and two-player search","year":2001,"lang":"en","type":"article","venue":"Information Sciences","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Information retrieval","score_opus":0.07313310079595914,"score_gpt":0.30194613214654864,"score_spread":0.2288130313505895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086585961","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2827985,0.000109019355,0.671896,0.0021947185,0.0002798986,0.0000956008,0.0000010583069,0.00016765148,0.042457603],"genre_scores_gemma":[0.9782958,0.000010588545,0.020902012,0.00070115866,0.000021528884,0.0000021070748,0.0000013537848,9.108441e-7,0.0000645566],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905914,0.000032833123,0.00018447723,0.000119435135,0.0003782613,0.00022584379],"domain_scores_gemma":[0.9995552,0.000112322305,0.00006519376,0.00012888391,0.000065080116,0.000073340954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010488325,0.000065605454,0.000058256388,0.00019108091,0.0004684486,0.0007672426,0.00042910015,0.000022134567,0.000015562606],"category_scores_gemma":[0.000039932063,0.000053405405,0.000013194107,0.0006896718,0.000095379604,0.003632358,0.00012180575,0.00007458753,0.00009785188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008048255,0.000027220392,0.051057868,0.000038386912,0.000008838832,0.000010813804,0.02515118,0.03600591,0.0007039979,0.05064873,0.0016744877,0.8346645],"study_design_scores_gemma":[0.00040324216,0.0001998867,0.0073830294,0.00007504808,0.0000018832359,0.00015701135,0.0014232084,0.9360197,0.0013886665,0.0019198074,0.05071014,0.0003183316],"about_ca_topic_score_codex":0.00008884664,"about_ca_topic_score_gemma":0.000004933998,"teacher_disagreement_score":0.9000138,"about_ca_system_score_codex":0.000017905766,"about_ca_system_score_gemma":0.00007499353,"threshold_uncertainty_score":0.73985386},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.13610002940544252,"score_gpt":0.349719729616963,"score_spread":0.2136197002115205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089730874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006043845,0.00005016002,0.99053377,0.007173088,0.00029229512,0.00025156984,0.0000023683167,0.00038040758,0.00071193493],"genre_scores_gemma":[0.5304516,0.000022882605,0.46886742,0.00032752444,0.00014370917,0.00005578026,0.0000038111896,0.00000857127,0.000118736076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987353,0.000042223885,0.00030127238,0.0003728014,0.00019542825,0.00035295295],"domain_scores_gemma":[0.9988122,0.0004578495,0.00009335816,0.000349738,0.00020403681,0.000082807586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044434998,0.00012899721,0.00012697683,0.00007948294,0.00055549695,0.000086160166,0.00040217515,0.00009913143,0.00002196184],"category_scores_gemma":[0.00045518795,0.00012613152,0.000062976185,0.00035266657,0.00012473998,0.00046581656,0.00009475487,0.00016532927,0.0001463954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007546754,0.00029686576,0.00041108727,0.00004452235,0.000025495689,0.00006996693,0.003155779,0.0008822137,0.0025547142,0.7449472,0.02711193,0.22042477],"study_design_scores_gemma":[0.000024899504,0.00040702146,0.0000504741,0.00006185134,0.000009978397,0.00013088586,0.00005780235,0.67121655,0.18397167,0.106671624,0.03694557,0.00045165536],"about_ca_topic_score_codex":0.000074590185,"about_ca_topic_score_gemma":0.000037373815,"teacher_disagreement_score":0.67033434,"about_ca_system_score_codex":0.000035319747,"about_ca_system_score_gemma":0.00013106978,"threshold_uncertainty_score":0.5143494},"labels":[],"label_agreement":null},{"id":"W2091203323","doi":"10.1007/s10462-009-9144-3","title":"A query-based approach for test selection in diagnosis","year":2008,"lang":"en","type":"article","venue":"Artificial Intelligence Review","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Selection (genetic algorithm); Query optimization; Test (biology); Test case; Entropy (arrow of time); Computation; Minification; Machine learning; Data mining; Mathematical optimization; Algorithm; Mathematics","score_opus":0.12013476080787351,"score_gpt":0.3236326353724061,"score_spread":0.2034978745645326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091203323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027900093,0.0128575545,0.98446745,0.0012305183,0.00006936562,0.000717568,0.0000031890254,0.00012642097,0.0002489124],"genre_scores_gemma":[0.59068155,0.017021153,0.38675565,0.0035338507,0.00017338956,0.0017038424,0.000029043335,0.000032356675,0.000069196314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841726,0.000102986196,0.0005139497,0.00044266167,0.00017770991,0.00034541392],"domain_scores_gemma":[0.9987102,0.0007268287,0.00012971557,0.00024854092,0.0001083741,0.00007632659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008962445,0.00016174014,0.00029954617,0.00012127901,0.00020005324,0.00004728458,0.00048149156,0.00006558139,0.000019169354],"category_scores_gemma":[0.0006647383,0.00015084371,0.00012222394,0.0010678675,0.000043730317,0.00022943172,0.000032972574,0.00016744593,0.0000594758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013077788,0.00088016794,0.020977478,0.0027663365,0.000014955682,0.000023544055,0.0005615492,0.015543311,0.00018491248,0.027817214,0.004795956,0.9264215],"study_design_scores_gemma":[0.000056135348,0.00039490135,0.00025561274,0.0030268126,0.000026868747,0.000042526794,0.00001621827,0.956065,0.013489545,0.0051284493,0.020872338,0.0006255988],"about_ca_topic_score_codex":0.000095761236,"about_ca_topic_score_gemma":0.00002849189,"teacher_disagreement_score":0.94052166,"about_ca_system_score_codex":0.000059938295,"about_ca_system_score_gemma":0.00017096165,"threshold_uncertainty_score":0.6151228},"labels":[],"label_agreement":null},{"id":"W2096990926","doi":"10.1111/0824-7935.00143","title":"A Case‐Addition Policy for Case‐Base Maintenance","year":2001,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Convergence (economics); Computer science; Base (topology); Reuse; Key (lock); Case-based reasoning; Reduction (mathematics); Mathematical optimization; Quality (philosophy); Algorithm; Mathematics; Artificial intelligence; Engineering; Computer security","score_opus":0.06589625762017931,"score_gpt":0.32361301931853687,"score_spread":0.25771676169835755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096990926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045642913,0.00010320519,0.9918275,0.0020270143,0.00022867374,0.00025223565,0.00005486351,0.0002050558,0.00073718827],"genre_scores_gemma":[0.7586249,0.0000062238323,0.23977517,0.00097049295,0.00019841387,0.000054493397,0.00004451249,0.00001083977,0.00031496762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857056,0.000058680667,0.00033448028,0.00045934165,0.0001983468,0.00037857072],"domain_scores_gemma":[0.9980316,0.0010459867,0.0001356146,0.00028610116,0.00036023106,0.00014044163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003683364,0.00017479212,0.00014386608,0.00020795899,0.0004394858,0.00018093918,0.00040044144,0.00006495992,0.000036820307],"category_scores_gemma":[0.00024931156,0.00017760994,0.00009195513,0.0006272038,0.000067861474,0.00041022134,0.000091521506,0.00013984114,0.0000975496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023961851,0.00007343843,0.000102328544,0.00003743941,0.000023360599,0.01401179,0.0009384563,0.46523222,0.000011644121,0.38027975,0.0066052275,0.13266037],"study_design_scores_gemma":[0.00010371307,0.000102336315,0.00001809166,0.000047916816,0.000004439983,0.061439384,0.00007899623,0.81584656,0.00013842275,0.11809862,0.0039056956,0.00021581756],"about_ca_topic_score_codex":0.00018450285,"about_ca_topic_score_gemma":0.000023917202,"teacher_disagreement_score":0.7540606,"about_ca_system_score_codex":0.00010384243,"about_ca_system_score_gemma":0.00022565243,"threshold_uncertainty_score":0.7242723},"labels":[],"label_agreement":null},{"id":"W2097114036","doi":"10.1609/icaps.v24i1.13681","title":"A Comparison of Knowledge-Based GBFS Enhancements and Knowledge-Free Exploration","year":2014,"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":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Heuristics; Planner; Randomness; Heuristic; Satisficing; Benchmark (surveying); Machine learning; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.06480995116400483,"score_gpt":0.33580014182964607,"score_spread":0.27099019066564123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097114036","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94614714,0.00027836606,0.04015308,0.0013503459,0.00039996696,0.00016884963,0.00000574095,0.00028677154,0.011209726],"genre_scores_gemma":[0.98125,0.0000043362256,0.018589964,0.000041969164,0.000030603296,0.000010156898,0.0000034085353,0.0000074025106,0.00006215616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988725,0.000025857107,0.00037228662,0.0002931296,0.00028180028,0.00015438355],"domain_scores_gemma":[0.9987528,0.00020553592,0.00041129126,0.00012639527,0.00044798458,0.00005601558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064477365,0.0001574152,0.00023809551,0.00018287892,0.00016035126,0.00016527854,0.00083064515,0.00007765606,0.0000030764875],"category_scores_gemma":[0.0003693932,0.00012750435,0.000035228873,0.00018690681,0.000077865014,0.0003166503,0.00026573523,0.00019643157,0.0000018696124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003596841,0.0007936904,0.23499693,0.001254022,0.0003036262,9.401742e-7,0.03434873,0.017001806,0.2238046,0.4498713,0.002545362,0.034719326],"study_design_scores_gemma":[0.00046324177,0.0001455136,0.0019607488,0.001354431,0.000010715781,0.0000018197101,0.0002693145,0.93478066,0.05806549,0.0027407175,0.000078604215,0.00012872246],"about_ca_topic_score_codex":0.000010488589,"about_ca_topic_score_gemma":9.766615e-7,"teacher_disagreement_score":0.91777885,"about_ca_system_score_codex":0.000020396148,"about_ca_system_score_gemma":0.00007699154,"threshold_uncertainty_score":0.51994765},"labels":[],"label_agreement":null},{"id":"W2097299633","doi":"10.1109/icdcs.1992.235084","title":"Test result analysis and diagnostics for finite state machines","year":2003,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Finite-state machine; Fault (geology); Computer science; State (computer science); Algorithm; Artificial intelligence; Data mining","score_opus":0.012090663796415171,"score_gpt":0.2409517203701952,"score_spread":0.22886105657378003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097299633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005465777,0.00022920061,0.99191326,0.00041943148,0.000053677526,0.00007833975,0.00002777467,0.00008893158,0.0017235875],"genre_scores_gemma":[0.5614471,0.0000915644,0.4348727,0.0006644154,0.000017298373,0.000015251851,0.00001585623,0.00000737188,0.002868481],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993244,0.000032096,0.00014286106,0.0002370888,0.00008180312,0.00018177986],"domain_scores_gemma":[0.9966386,0.0029495314,0.000048038397,0.000234656,0.000059536782,0.00006963218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003593964,0.00008659514,0.00012191126,0.00011913815,0.00013558194,0.00014998278,0.00016543508,0.000025175485,0.000008252649],"category_scores_gemma":[0.0010889828,0.000069893635,0.000041719224,0.0004863889,0.000015998045,0.000118787844,0.000034217603,0.000051891984,0.000005108162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001526591,0.0001581428,0.8348376,0.00008924481,0.00042854296,0.00006467205,0.0025549103,0.026038602,0.00011383338,0.045103546,0.017994154,0.07260147],"study_design_scores_gemma":[0.00055017736,0.00019928529,0.013782167,0.000018849287,0.00012995867,0.0000068217964,0.000013133149,0.9494382,0.0010309546,0.014379104,0.020096615,0.00035472415],"about_ca_topic_score_codex":0.00006612333,"about_ca_topic_score_gemma":0.000068468864,"teacher_disagreement_score":0.9233996,"about_ca_system_score_codex":0.0000049677715,"about_ca_system_score_gemma":0.000024257106,"threshold_uncertainty_score":0.28501797},"labels":[],"label_agreement":null},{"id":"W2097552605","doi":"10.1109/glocom.1992.276592","title":"Customization of network surveillance expert systems","year":2003,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Scripting language; Knowledge base; Computer science; Expert system; Personalization; Process (computing); Software engineering; Knowledge-based systems; World Wide Web; Artificial intelligence; Programming language","score_opus":0.0123909353800806,"score_gpt":0.21881413463349828,"score_spread":0.20642319925341768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097552605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010037055,0.0011389321,0.9745103,0.00006399344,0.0005210024,0.00006353278,3.1090602e-7,0.00010955287,0.022588639],"genre_scores_gemma":[0.95622975,0.000015375155,0.04287643,0.00009425969,0.000042387866,0.0000040151704,0.0000014926788,0.000004047684,0.0007322653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992935,0.00012807427,0.00016135172,0.00014514812,0.00011819456,0.00015373493],"domain_scores_gemma":[0.99944645,0.00012681562,0.000074656484,0.00025842543,0.000059610724,0.0000340633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005029398,0.000060084796,0.00010832293,0.000024726063,0.00005652832,0.000042579977,0.00021045216,0.00003603783,0.000012275923],"category_scores_gemma":[0.000037483234,0.000051107443,0.000020333897,0.00026784165,0.00000948417,0.00011666757,0.000020078614,0.00003747691,0.0000127765115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056386393,0.000037226273,0.0618008,0.000050574647,0.000025043033,0.0000055544756,0.00082649343,0.45597157,0.00026467323,0.36511594,0.11222392,0.00367255],"study_design_scores_gemma":[0.00048479773,0.00009271553,0.0015163193,0.00012916728,0.0000017793336,0.00002376684,0.000060394854,0.8890009,0.0013658993,0.0007419799,0.10619171,0.00039055594],"about_ca_topic_score_codex":0.00006751125,"about_ca_topic_score_gemma":0.0000028096883,"teacher_disagreement_score":0.955226,"about_ca_system_score_codex":0.000010078074,"about_ca_system_score_gemma":0.00003714251,"threshold_uncertainty_score":0.2084101},"labels":[],"label_agreement":null},{"id":"W2098960454","doi":"10.1609/icaps.v20i1.13402","title":"Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement","year":2021,"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":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Satisficing; Plan (archaeology); Computer science; Graph; Metric (unit); Competition (biology); Action plan; Mathematical optimization; Operations research; Operations management; Artificial intelligence; Mathematics; Theoretical computer science; Engineering; Economics","score_opus":0.09831838808852035,"score_gpt":0.3290259229691195,"score_spread":0.23070753488059914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098960454","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94620043,0.00015432188,0.04511184,0.005353093,0.0006087107,0.0002779962,0.000038904356,0.00037131278,0.0018834007],"genre_scores_gemma":[0.97720796,0.000023372057,0.022418857,0.00017214676,0.000059267943,0.00001764211,0.000021091959,0.000008864596,0.00007082091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987981,0.000011787352,0.0002554682,0.00037628502,0.00035497287,0.0002034103],"domain_scores_gemma":[0.99901444,0.00015071707,0.00021138662,0.000078927376,0.000477683,0.00006687701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049040373,0.00015321902,0.00015355146,0.000146458,0.0002643996,0.00041934772,0.0004043079,0.00007084158,0.000003187243],"category_scores_gemma":[0.00014776314,0.00012850111,0.000043051856,0.00016000237,0.00003816365,0.00033949994,0.00017767758,0.00021979857,5.389452e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003076084,0.00022000277,0.026206883,0.0005651886,0.00045259006,0.000012254792,0.008854631,0.009981791,0.38834766,0.4859399,0.0006021031,0.07850939],"study_design_scores_gemma":[0.0005904081,0.0001374559,0.0021865247,0.0005694808,0.000014536341,0.000036894686,0.0009185241,0.9242072,0.06565484,0.005501812,0.00002844715,0.00015384395],"about_ca_topic_score_codex":0.000016751244,"about_ca_topic_score_gemma":9.544169e-7,"teacher_disagreement_score":0.91422546,"about_ca_system_score_codex":0.000031060303,"about_ca_system_score_gemma":0.00008246187,"threshold_uncertainty_score":0.5240123},"labels":[],"label_agreement":null},{"id":"W2100713230","doi":"10.1145/337180.337639","title":"Exploring O-O framework usage (poster session)","year":2000,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Session (web analytics); Computer science; World Wide Web","score_opus":0.08120717751103482,"score_gpt":0.2608699402256482,"score_spread":0.17966276271461337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100713230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13888139,0.00011233202,0.7550102,0.0022405642,0.00047469756,0.00008531505,7.497028e-7,0.00075101916,0.10244373],"genre_scores_gemma":[0.8023454,0.000025983083,0.1895106,0.0018512404,0.00012529646,0.000015352301,0.0000012736683,0.000009611563,0.006115265],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990741,0.000045817163,0.00014037482,0.00028116975,0.0001810818,0.0002774437],"domain_scores_gemma":[0.9992269,0.0001890206,0.000021680406,0.0004482179,0.000015918466,0.00009822772],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00020318077,0.00010547538,0.000093993694,0.000047338082,0.00017377718,0.00018172171,0.00051785534,0.000048553182,0.0015180934],"category_scores_gemma":[0.00001642667,0.00008504892,0.000040622694,0.000257065,0.000012234093,0.00090751867,0.0000805245,0.00019981267,0.0011678296],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001164302,0.000054584038,0.006868983,0.000020983858,0.000016847556,0.00009054258,0.004576586,0.0015211295,0.00012761018,0.026704215,0.005116138,0.9548907],"study_design_scores_gemma":[0.0017225151,0.00076727086,0.04138178,0.0024281144,0.000035050234,0.00024720578,0.0003375472,0.16143106,0.023084555,0.07074726,0.69401413,0.003803498],"about_ca_topic_score_codex":0.000024475277,"about_ca_topic_score_gemma":7.4963486e-7,"teacher_disagreement_score":0.95108724,"about_ca_system_score_codex":0.000012458112,"about_ca_system_score_gemma":0.000022777622,"threshold_uncertainty_score":0.9996099},"labels":[],"label_agreement":null},{"id":"W2101155486","doi":"10.1007/11527862_9","title":"Hierarchical Heuristic Search Revisited","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Heuristic; Key (lock); Ideal (ethics); Incremental heuristic search; Hierarchical database model; Data mining; Theoretical computer science; Search algorithm; Artificial intelligence; Algorithm; Beam search","score_opus":0.02079301094900387,"score_gpt":0.2614477346103344,"score_spread":0.2406547236613305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101155486","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004821344,0.0011770001,0.9880216,0.0020850408,0.00075236126,0.0003060735,0.00000871521,0.00030253778,0.0072984514],"genre_scores_gemma":[0.12001615,0.0000956175,0.87231636,0.0038623267,0.0016188907,0.000008118708,0.000024686002,0.00006991492,0.001987927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99496806,0.00009640264,0.00061517337,0.0018876327,0.0014003725,0.0010323494],"domain_scores_gemma":[0.9963658,0.0011579334,0.00019524174,0.0016947387,0.0002453519,0.00034096223],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016947807,0.00059505727,0.00061926595,0.0010341496,0.0004351789,0.00080322963,0.004264054,0.00041530747,0.00006983366],"category_scores_gemma":[0.00015855354,0.0005478348,0.0001578104,0.0008483289,0.0006760287,0.0004638259,0.001548192,0.0020065587,0.00021246466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009116437,0.00002751954,0.00013185649,0.00007920182,0.000013215045,0.00030081806,0.0008507008,0.05179304,0.00005174849,0.032731257,0.00019396143,0.9138176],"study_design_scores_gemma":[0.00029109028,0.00024477387,0.00016549145,0.0011020338,0.000009923241,0.00019240228,6.113196e-8,0.9079548,0.0002658668,0.07848591,0.010297167,0.0009904444],"about_ca_topic_score_codex":0.000019944931,"about_ca_topic_score_gemma":0.00001227114,"teacher_disagreement_score":0.91282713,"about_ca_system_score_codex":0.00030509062,"about_ca_system_score_gemma":0.0008208828,"threshold_uncertainty_score":0.9996973},"labels":[],"label_agreement":null},{"id":"W2101831437","doi":"","title":"Scale-Based Monotonicity Analysis in Qualitative Modelling with Flat Segments","year":2005,"lang":"en","type":"article","venue":"NPARC","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Monotonic function; Leverage (statistics); Computer science; Segmentation; Flatness (cosmology); Scale (ratio); Algorithm; Set (abstract data type); Robustness (evolution); Mathematical optimization; Data mining; Artificial intelligence; Mathematics","score_opus":0.02467916367125247,"score_gpt":0.28038848533225114,"score_spread":0.2557093216609987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101831437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.258493,0.00001971386,0.7388752,0.0007460244,0.000010516167,0.00007240404,0.0000027402475,0.00006659321,0.0017137824],"genre_scores_gemma":[0.61632544,0.0000013439769,0.38338873,0.0001837194,0.000009383599,0.000009466305,0.0000049836713,0.0000042209163,0.0000727211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861854,0.00018044637,0.00021962565,0.0003842004,0.00029485018,0.00030234398],"domain_scores_gemma":[0.99920636,0.00021264867,0.000088822926,0.00035593894,0.000052636722,0.0000835804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006772356,0.00013624216,0.00022232352,0.00028254924,0.00009817265,0.000082796374,0.0003853628,0.000051177605,0.000026149255],"category_scores_gemma":[0.000005181536,0.00010534321,0.0000639239,0.0010940005,0.000028695244,0.00030631147,0.0000424248,0.00018378768,0.000021141574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025878997,0.000040293784,0.007468468,0.0000070662154,0.000056343433,0.0000065334175,0.008486673,0.97569776,0.00021785866,0.0005643448,0.000034108572,0.007394678],"study_design_scores_gemma":[0.00039721033,0.00004189423,0.0002972912,0.000046148478,0.000028644441,4.2982535e-7,0.00009591422,0.9952662,0.0024471558,0.0010651413,0.00014372195,0.00017023973],"about_ca_topic_score_codex":0.00011584924,"about_ca_topic_score_gemma":0.0001530161,"teacher_disagreement_score":0.3578324,"about_ca_system_score_codex":0.00009132791,"about_ca_system_score_gemma":0.00008233855,"threshold_uncertainty_score":0.42957714},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.10229820460159553,"score_gpt":0.3197567451938249,"score_spread":0.21745854059222938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102323131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008558936,0.00037649166,0.9780405,0.0005013697,0.00026197912,0.00009567418,9.1296073e-7,0.00008330468,0.012080834],"genre_scores_gemma":[0.92337763,0.000031092597,0.07599267,0.0005173261,0.00002233638,0.000005430677,4.180462e-7,0.0000049529713,0.00004811116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988185,0.00029558493,0.00026894122,0.00028158,0.00011815424,0.00021723435],"domain_scores_gemma":[0.9981576,0.0013439351,0.000079049365,0.0002826879,0.00006631765,0.00007038482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017821451,0.00009610586,0.00009933258,0.00008866416,0.000089767826,0.00007832976,0.0003430027,0.000050209004,0.00002061056],"category_scores_gemma":[0.001252772,0.000092632465,0.000018325009,0.0002600936,0.00009160527,0.000346034,0.00015156715,0.00017042382,0.000090191475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052173717,0.00007186571,0.0005853942,0.000006521458,0.000005036862,0.0000772155,0.007275033,0.000069920185,0.00010485358,0.86729825,0.0000336916,0.12442002],"study_design_scores_gemma":[0.00003123328,0.000246994,0.001196028,0.00009347242,0.000013913272,0.0001186993,0.0020959103,0.038615834,0.012681789,0.94301254,0.0015040447,0.00038953955],"about_ca_topic_score_codex":0.00019642763,"about_ca_topic_score_gemma":0.00004671147,"teacher_disagreement_score":0.9148187,"about_ca_system_score_codex":0.000016219694,"about_ca_system_score_gemma":0.000047305788,"threshold_uncertainty_score":0.37774423},"labels":[],"label_agreement":null},{"id":"W2103178731","doi":"10.1109/wcica.2000.859984","title":"Online intelligent system for operation support","year":2002,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Expert system; Default gateway; Process (computing); Interface (matter); Gateway (web page); Software; Function (biology); Knowledge base; Intelligent decision support system; Embedded system; User interface; Human–computer interaction; Multimedia; Operating system; World Wide Web; Artificial intelligence; Computer network","score_opus":0.051143104458869514,"score_gpt":0.2604638636831663,"score_spread":0.2093207592242968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103178731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00082404533,0.00007114042,0.9932206,0.0009839403,0.0002909206,0.00014257921,0.0000047172166,0.00025637235,0.0042056413],"genre_scores_gemma":[0.731039,0.0000060789807,0.2621187,0.00052955345,0.000113294765,0.00001831256,0.000025538784,0.0000065471995,0.006142982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994163,0.000016119488,0.00015290987,0.00017874273,0.00009041698,0.00014553021],"domain_scores_gemma":[0.9996086,0.000060474893,0.000029687491,0.00020679217,0.000046025358,0.0000484414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017873792,0.000063948086,0.000073171694,0.000029729788,0.0000981463,0.000099642406,0.0002659099,0.00003159248,0.00008422728],"category_scores_gemma":[0.000011124715,0.000052461364,0.00003213767,0.00007495547,0.0000046683513,0.00017075539,0.00003620578,0.000040850213,0.00015162204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010072682,0.00041449998,0.001288911,0.00034677537,0.000057137397,0.000033282613,0.0040674307,0.011985036,0.00092224707,0.3033691,0.20009775,0.47740775],"study_design_scores_gemma":[0.000111809975,0.0001222125,0.00001809509,0.000021448212,0.0000025825134,0.000014446394,0.00005178016,0.96817136,0.0028288218,0.000058118152,0.028503167,0.000096137854],"about_ca_topic_score_codex":0.000010717519,"about_ca_topic_score_gemma":0.0000044116764,"teacher_disagreement_score":0.95618635,"about_ca_system_score_codex":0.000028515686,"about_ca_system_score_gemma":0.000013125367,"threshold_uncertainty_score":0.21393123},"labels":[],"label_agreement":null},{"id":"W2104837861","doi":"","title":"Knowledge transfer using bayesian belief network","year":2006,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Bayesian network; Computer science; Artificial intelligence; Bayesian probability; Knowledge transfer; Domain (mathematical analysis); Domain knowledge; Machine learning; Knowledge management; Mathematics","score_opus":0.017687044299478757,"score_gpt":0.23836218416683605,"score_spread":0.2206751398673573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104837861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037165552,0.0005458097,0.9435183,0.00021690778,0.00027624913,0.0000603574,5.247938e-7,0.00028757934,0.051377743],"genre_scores_gemma":[0.81818676,0.0000013560509,0.17936692,0.00023231552,0.00037554483,0.0000022070042,0.0000030067258,0.000010516,0.0018213706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900377,0.00005526561,0.00018241667,0.00027177873,0.00010983233,0.0003769176],"domain_scores_gemma":[0.9995196,0.00008429106,0.000015322079,0.00028424113,0.00003404955,0.00006250521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027079607,0.00012219133,0.00011857167,0.000049526527,0.00023790456,0.00013172538,0.00039597016,0.000065013446,0.00005377538],"category_scores_gemma":[0.000002329003,0.00010947841,0.0000563185,0.00038665975,0.000018737901,0.00022703131,0.00004982337,0.00011418173,0.000054912958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001090432,0.00022333425,0.02118153,0.0000646238,0.00003996989,0.00007032421,0.0013359529,0.19514069,0.0015215996,0.6696921,0.062407132,0.048311867],"study_design_scores_gemma":[0.0002889676,0.000051533225,0.0012575659,0.00007722141,0.000009441661,0.000025084912,0.0000056739736,0.95812064,0.00091512344,0.011211357,0.027669122,0.00036824847],"about_ca_topic_score_codex":0.00023390628,"about_ca_topic_score_gemma":0.0000770226,"teacher_disagreement_score":0.81447023,"about_ca_system_score_codex":0.000023629951,"about_ca_system_score_gemma":0.00006780133,"threshold_uncertainty_score":0.44644},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Estimation; Cost estimate; Computer science; Model building; Engineering; Systems engineering","score_opus":0.06934836077658472,"score_gpt":0.24700579021401353,"score_spread":0.1776574294374288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105263699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014715843,0.00019701774,0.98449713,0.000030974003,0.0003094603,0.00012982091,0.0000047857857,0.000032846754,0.00008214231],"genre_scores_gemma":[0.5660885,1.7322466e-7,0.43383318,0.000024758468,0.000035237077,0.0000025978068,4.498486e-7,0.000012272304,0.0000028125985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990782,0.00001437986,0.0002857286,0.00013405636,0.00010565566,0.0003819441],"domain_scores_gemma":[0.9990218,0.000087964225,0.00017915065,0.00015970145,0.00016643888,0.00038493896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000605822,0.0001328771,0.00016578582,0.0004614107,0.00018738369,0.00012258353,0.00031119405,0.000063456064,0.0000040998266],"category_scores_gemma":[0.00023500483,0.00014357649,0.00007579572,0.00023598786,0.000010903735,0.0005169484,0.000009693099,0.00019365923,3.0206908e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025446732,0.0000022972658,0.00019023928,0.000043528606,0.000012421621,0.00039844247,0.0014919088,0.99482226,0.00015899914,0.0015789018,0.00007957994,0.001218846],"study_design_scores_gemma":[0.00023706103,0.000042712705,0.00001946675,0.00043564747,0.000017744584,0.0012464591,0.00001823503,0.99692297,0.00061486155,0.00020824639,0.000073114046,0.00016349663],"about_ca_topic_score_codex":0.0008775876,"about_ca_topic_score_gemma":0.004404324,"teacher_disagreement_score":0.5513727,"about_ca_system_score_codex":0.00021408836,"about_ca_system_score_gemma":0.0012374498,"threshold_uncertainty_score":0.5854879},"labels":[],"label_agreement":null},{"id":"W2105801569","doi":"10.1017/s1471068402001564","title":"In Memoriam: RAYMOND REITER June 12, 1939 – September 16, 2002","year":2002,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Artificial intelligence; Library science; Art history; History","score_opus":0.03146516822735217,"score_gpt":0.28080583075615223,"score_spread":0.24934066252880005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105801569","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010097017,0.026247207,0.43883222,0.0134273125,0.0032485987,0.0012972312,0.000006023841,0.00060728646,0.5062371],"genre_scores_gemma":[0.7376054,0.00034918505,0.23819368,0.0028632972,0.0003934415,0.00005118103,0.0000047009407,0.000033729746,0.02050538],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977495,0.00092570175,0.00035029586,0.0003779687,0.00021692125,0.00037959448],"domain_scores_gemma":[0.9961465,0.0030274913,0.00028580733,0.00039144894,0.000058269965,0.000090474314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004487935,0.00018081442,0.00024969783,0.00012550528,0.00014277999,0.00013946017,0.0003818628,0.000115925766,0.00029787797],"category_scores_gemma":[0.0009218577,0.0001572514,0.000048172424,0.00034017276,0.00009977067,0.0014088823,0.00016697805,0.00035660085,0.00006084861],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060833956,0.0008761821,0.000665976,0.0003374181,0.00015452887,0.00070085435,0.016421532,0.00030757068,0.0007378394,0.37178844,0.023558754,0.5838426],"study_design_scores_gemma":[0.0014952777,0.00057410245,0.000046096444,0.00029076784,0.000087607004,0.00062522094,0.0010904364,0.004453549,0.00096602,0.07317533,0.91648173,0.0007138683],"about_ca_topic_score_codex":0.000016170045,"about_ca_topic_score_gemma":0.0000050048616,"teacher_disagreement_score":0.89292294,"about_ca_system_score_codex":0.000019428624,"about_ca_system_score_gemma":0.000015318283,"threshold_uncertainty_score":0.64125264},"labels":[],"label_agreement":null},{"id":"W2106445454","doi":"","title":"Using component abstraction for automatic generation of macro-actions","year":2004,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Component (thermodynamics); Macro; Abstraction; Computer science; Process (computing); Software engineering; Theoretical computer science; Distributed computing; Programming language","score_opus":0.17164522314028052,"score_gpt":0.33679559425202943,"score_spread":0.1651503711117489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106445454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17191395,0.000013182545,0.8271619,0.00025454926,0.00022314793,0.00010424914,0.000001707916,0.00008689684,0.00024040038],"genre_scores_gemma":[0.5992407,4.781679e-7,0.4006653,0.000032458418,0.0000292703,0.000004093064,0.0000050093035,0.0000022722072,0.000020364105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995149,0.000010872499,0.00016921807,0.0001180616,0.000088925466,0.00009801852],"domain_scores_gemma":[0.99964696,0.000041125782,0.00009231107,0.00014044988,0.000052930965,0.000026230666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001439075,0.000053044267,0.00007009999,0.00005935732,0.00014285668,0.00004451209,0.0001007556,0.000030297346,0.000008542183],"category_scores_gemma":[0.000009755497,0.00005055164,0.000036033183,0.000097064774,0.0000087748185,0.00026237624,0.000014117706,0.00003696105,0.0000046080395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030013364,0.00010886043,0.00015252123,0.00007368095,0.000025405137,0.0000012498236,0.0006866832,0.608048,0.32536107,0.049145866,0.00034524658,0.016048348],"study_design_scores_gemma":[0.00021668104,0.000041784104,0.0004641773,0.000027324944,0.0000063335356,0.0000120451805,0.000014824122,0.9414751,0.05591337,0.0015883488,0.00017051477,0.00006950442],"about_ca_topic_score_codex":0.0001855544,"about_ca_topic_score_gemma":0.000012907429,"teacher_disagreement_score":0.4273268,"about_ca_system_score_codex":0.000054777527,"about_ca_system_score_gemma":0.00006137945,"threshold_uncertainty_score":0.2061436},"labels":[],"label_agreement":null},{"id":"W2106715314","doi":"10.1007/978-3-642-14274-1_19","title":"Case Retrieval with Combined Adaptability and Similarity Criteria: Application to Case Retrieval Nets","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Adaptability; Information retrieval; Similarity (geometry); Computer science; Artificial intelligence; Biology; Ecology; Image (mathematics)","score_opus":0.01710110320431864,"score_gpt":0.25347889028259596,"score_spread":0.2363777870782773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106715314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023706406,0.00011607052,0.9725691,0.0015626508,0.00069808593,0.0008728402,0.000027589347,0.00022011365,0.00022715637],"genre_scores_gemma":[0.6403005,0.000002826366,0.358611,0.0008259846,0.00018252133,0.000005256821,0.0000073615106,0.00002740228,0.000037132013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956902,0.000085268344,0.00055396796,0.002159916,0.0007992873,0.0007113328],"domain_scores_gemma":[0.99597245,0.0009104782,0.00029382866,0.0018836155,0.00045751742,0.00048209503],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021058721,0.00062670273,0.0006141053,0.00049169525,0.00074916845,0.0008027445,0.0014254326,0.00055209064,0.000012614248],"category_scores_gemma":[0.00024408638,0.0005554573,0.00006689913,0.0008537056,0.0007471998,0.0005627629,0.001155607,0.001637002,0.000008832894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015484325,0.00041596653,0.002349942,0.0008059283,0.000118213626,0.09822051,0.014875104,0.036786012,0.0063407915,0.01565974,0.0001505646,0.8227288],"study_design_scores_gemma":[0.0010616488,0.001722712,0.00028600454,0.00043258822,0.000046762354,0.04761553,0.0000014761043,0.89955133,0.0043079704,0.04153095,0.0015273292,0.0019157004],"about_ca_topic_score_codex":0.00019929686,"about_ca_topic_score_gemma":0.000507905,"teacher_disagreement_score":0.8627653,"about_ca_system_score_codex":0.00019591319,"about_ca_system_score_gemma":0.00054387504,"threshold_uncertainty_score":0.9996897},"labels":[],"label_agreement":null},{"id":"W2109432774","doi":"10.1109/cimca.2005.1631475","title":"Drawing Reasonable Inferences From Inconsistent Premises","year":2006,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Counterfactual thinking; Coherence (philosophical gambling strategy); Computer science; Premises; Cognition; Artificial intelligence; State (computer science); Algorithm; Mathematics; Psychology; Social psychology","score_opus":0.01009529469847565,"score_gpt":0.20030994993900497,"score_spread":0.19021465524052933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109432774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071061075,0.00058757426,0.79550517,0.0011345117,0.0002564747,0.00008273099,0.000004186578,0.00057916023,0.1307891],"genre_scores_gemma":[0.8370407,0.0000021485998,0.16052245,0.00020849159,0.00006130083,0.000005039176,0.000009717952,0.000003671968,0.002146465],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908406,0.00004177308,0.00017383946,0.0002884802,0.00018734176,0.00022451687],"domain_scores_gemma":[0.9992781,0.0002606043,0.000058250956,0.00030953588,0.00004237482,0.000051120584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016824437,0.000104156126,0.00011312433,0.000043398668,0.00017165535,0.00029200315,0.00045076903,0.000048277914,0.00008903315],"category_scores_gemma":[0.0000282701,0.0000864137,0.00003899841,0.00016309578,0.000022079554,0.0003760197,0.0001380258,0.00008662274,0.00007329455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014125105,0.0002088614,0.43766144,0.000044339147,0.00007070975,0.0001001162,0.001303949,0.008864657,0.003946802,0.42056295,0.06905535,0.05816669],"study_design_scores_gemma":[0.0011559401,0.00020520756,0.15651646,0.00056391966,0.000040945873,0.000028387463,0.00024092458,0.29285,0.023518855,0.46223515,0.061060596,0.0015836102],"about_ca_topic_score_codex":0.0052941195,"about_ca_topic_score_gemma":0.00013798136,"teacher_disagreement_score":0.76597965,"about_ca_system_score_codex":0.000019778068,"about_ca_system_score_gemma":0.000087367145,"threshold_uncertainty_score":0.80031604},"labels":[],"label_agreement":null},{"id":"W2109729402","doi":"10.1109/igarss.1996.516969","title":"Case-based reasoning and software agents for intelligent forest information management","year":2002,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Canadian Sport Centre Pacific","funders":"","keywords":"Metadata; Computer science; Software; Database; Geographic information system; Metadata repository; Metadata modeling; World Wide Web; Information retrieval; Remote sensing","score_opus":0.03174101459129228,"score_gpt":0.2351563593645666,"score_spread":0.20341534477327433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109729402","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030916608,0.00006262767,0.9944495,0.00024363144,0.00010025241,0.00027478975,0.0000032614246,0.00019391403,0.0015803848],"genre_scores_gemma":[0.38387108,0.000008022749,0.6145943,0.0009191721,0.000014027638,0.000045677756,0.0000143754005,0.0000050638587,0.00052832556],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993426,0.000014283208,0.00017233711,0.00015319034,0.00011563111,0.00020194521],"domain_scores_gemma":[0.99950665,0.000106063555,0.00006273162,0.00021169572,0.000041891766,0.000070973816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000213196,0.000096353026,0.000073044954,0.000106819076,0.00021391927,0.00022182564,0.00017711295,0.000034191664,0.000025482062],"category_scores_gemma":[0.00003171285,0.000087135195,0.00002955577,0.0001248532,0.000010864777,0.00051855383,0.00007641647,0.00004792848,0.000029584122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011696781,0.00004903764,0.010125169,0.0003638193,0.000045285582,0.0002099913,0.0023358108,0.019574508,4.844656e-7,0.043908995,0.029296191,0.894079],"study_design_scores_gemma":[0.00035890506,0.00008420995,0.00025333007,0.00006785316,0.000009027928,0.0001007692,0.00007100527,0.9645707,0.00005250542,0.00061138044,0.033660233,0.00016008975],"about_ca_topic_score_codex":0.000027180731,"about_ca_topic_score_gemma":0.000008114828,"teacher_disagreement_score":0.9449962,"about_ca_system_score_codex":0.000025432993,"about_ca_system_score_gemma":0.0000054259062,"threshold_uncertainty_score":0.355327},"labels":[],"label_agreement":null},{"id":"W2110106189","doi":"10.1109/mwscas.1994.519061","title":"An artificial intelligent instructor for electrical circuits","year":2002,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Resistor; Capacitor; Electrical network; Computer science; Electronic circuit; Inductor; Electrical engineering; Electrical element; Prolog; Pull-up resistor; Inference; Electronic engineering; Artificial intelligence; Engineering; Voltage; Digital electronics","score_opus":0.0560825619404925,"score_gpt":0.26772493745141923,"score_spread":0.21164237551092674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110106189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021157077,0.00007079791,0.97554064,0.00038527692,0.00026553625,0.00013674803,0.000001719812,0.00026866118,0.0021735553],"genre_scores_gemma":[0.9453456,0.0000025715754,0.053653922,0.00046258722,0.00016349011,0.000013955923,0.0000031590814,0.0000073454553,0.00034737322],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990519,0.000031851752,0.00017952571,0.0002988595,0.00013918112,0.00029866942],"domain_scores_gemma":[0.9993737,0.0001189851,0.000037121587,0.00029801493,0.000050543462,0.00012165279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017337807,0.00009425496,0.000099392826,0.0000798243,0.00014614727,0.00016414051,0.00050226256,0.00005969217,0.00010783916],"category_scores_gemma":[0.00004072034,0.00008387038,0.00004687978,0.00024298811,0.000013296019,0.00025152141,0.000025580051,0.00009573096,0.00009387026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030103338,0.00010464336,0.00037000797,0.0000069844486,0.0000090281765,0.000004938321,0.0011994626,0.00027304055,0.002180782,0.16861016,0.004944015,0.82229394],"study_design_scores_gemma":[0.00010635923,0.0003646786,0.00009272268,0.0000063214834,0.0000033957872,0.000013207502,0.000015100978,0.96843,0.014695297,0.008274713,0.0077877585,0.0002104497],"about_ca_topic_score_codex":0.000010186941,"about_ca_topic_score_gemma":0.000003873991,"teacher_disagreement_score":0.96815693,"about_ca_system_score_codex":0.000025624566,"about_ca_system_score_gemma":0.00002146457,"threshold_uncertainty_score":0.34201348},"labels":[],"label_agreement":null},{"id":"W2110442726","doi":"10.1109/isic.1990.128483","title":"An intelligent controller for robot contact and non-contact task control","year":2002,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Controller (irrigation); Computer science; Robot; Interface (matter); Robotics; Implementation; Control engineering; Stability (learning theory); Intelligent control; Task (project management); Artificial intelligence; Robot control; Control (management); Architecture; Human–computer interaction; Mobile robot; Engineering; Machine learning; Software engineering; Systems engineering","score_opus":0.018176038425204606,"score_gpt":0.2405919835481761,"score_spread":0.2224159451229715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110442726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00359166,0.0005135933,0.9917205,0.0012419595,0.00020655032,0.00058532937,0.000011727874,0.00018891445,0.001939756],"genre_scores_gemma":[0.97553194,0.000017844786,0.021479288,0.002168673,0.00009567695,0.000058089496,0.0000039999168,0.000013970566,0.0006305328],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985676,0.000069139656,0.00029885527,0.00047810178,0.00015550677,0.00043082924],"domain_scores_gemma":[0.99865735,0.0005320712,0.000099411474,0.0003737473,0.0000948729,0.00024253127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047141378,0.00021406366,0.000337754,0.000088890134,0.00022042182,0.00031599298,0.00047607775,0.00009953523,0.000075179254],"category_scores_gemma":[0.000046755893,0.0001732686,0.00008638036,0.000096765434,0.000018578323,0.00048117543,0.00003630921,0.00014270669,0.00004537334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007166986,0.001130162,0.03579606,0.00021571101,0.00078001973,0.000114880444,0.010079538,0.009388634,0.051412143,0.16437413,0.053380594,0.6726114],"study_design_scores_gemma":[0.0027669778,0.00091718993,0.0016376753,0.000031263364,0.0000201586,0.000013993861,0.00003605144,0.9863173,0.00077495753,0.0007009252,0.006478745,0.0003048113],"about_ca_topic_score_codex":0.00010587932,"about_ca_topic_score_gemma":0.000016830758,"teacher_disagreement_score":0.9769286,"about_ca_system_score_codex":0.000028376346,"about_ca_system_score_gemma":0.00002023064,"threshold_uncertainty_score":0.7065689},"labels":[],"label_agreement":null},{"id":"W2113202694","doi":"10.1109/icde.1991.131461","title":"Meta-reasoning: An incremental compilation approach","year":2002,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Implicant; Computer science; Prime (order theory); Automated theorem proving; Process (computing); Artificial intelligence; Programming language; Theoretical computer science; Algorithm; Boolean function; Mathematics","score_opus":0.12599689698549074,"score_gpt":0.25374219816245835,"score_spread":0.1277453011769676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113202694","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005450434,0.0002404343,0.9118705,0.00028533416,0.00006893011,0.00008935711,0.0000019181502,0.0005773212,0.08141579],"genre_scores_gemma":[0.68904203,0.0000010446895,0.30989668,0.00031198273,0.000028704811,0.00000697446,0.000014928731,0.000004368797,0.0006933033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990885,0.0000861239,0.00013898964,0.0002826989,0.00021409865,0.00018958705],"domain_scores_gemma":[0.9994598,0.00004026651,0.00005099479,0.00033479408,0.00002582074,0.000088301436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033752128,0.000107330845,0.0001341972,0.000058954734,0.0001939615,0.00017246582,0.0004244655,0.000038192946,0.0002184484],"category_scores_gemma":[0.0000068516756,0.000084884334,0.000056991692,0.00019469205,0.00001667177,0.0006543595,0.000074538155,0.0000951006,0.00008891633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019786918,0.0018693494,0.050271716,0.00008978548,0.0020394274,0.00005085774,0.021053474,0.042193633,0.0029318752,0.7022948,0.09513258,0.08205267],"study_design_scores_gemma":[0.00013203258,0.0000606639,0.0005648588,0.0000022943584,0.000043522527,0.000014574559,0.00002831219,0.9971825,0.00039757878,0.0002096716,0.0012241247,0.000139871],"about_ca_topic_score_codex":0.000051913677,"about_ca_topic_score_gemma":0.0000020537193,"teacher_disagreement_score":0.95498884,"about_ca_system_score_codex":0.000017028966,"about_ca_system_score_gemma":0.000006388251,"threshold_uncertainty_score":0.34614828},"labels":[],"label_agreement":null},{"id":"W2113267394","doi":"10.1609/icaps.v20i1.13400","title":"Planning for Concurrent Action Executions Under Action Duration Uncertainty Using Dynamically Generated Bayesian Networks","year":2010,"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":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Concurrency; Bayesian network; Probabilistic logic; Duration (music); Chaining; Action (physics); Dynamic Bayesian network; State (computer science); Artificial intelligence; Distributed computing; Algorithm","score_opus":0.07556528448785273,"score_gpt":0.3406418268058319,"score_spread":0.26507654231797917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113267394","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5770373,0.000024823676,0.4201653,0.00080113014,0.0013222614,0.00018301806,0.0000070050937,0.00029328512,0.00016587654],"genre_scores_gemma":[0.96750677,0.000006042095,0.032127976,0.000112757385,0.00014766406,0.000020791036,0.00002950713,0.000013693266,0.000034808083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986009,0.000017123892,0.00040635545,0.00039678498,0.0003178362,0.0002610099],"domain_scores_gemma":[0.9985807,0.00016633334,0.000501049,0.00009959594,0.00057131134,0.00008099839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047665506,0.00021002459,0.00018210187,0.00018308143,0.00053283677,0.00047929934,0.00055339356,0.00018523875,0.0000045861875],"category_scores_gemma":[0.00017182309,0.00017788688,0.00006905832,0.00023071213,0.000064800275,0.0005000495,0.000105447856,0.00052629947,4.3190119e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008656145,0.0000568872,0.0035658404,0.00007475096,0.000108371445,9.274159e-7,0.00075181725,0.5196881,0.3711275,0.101811536,0.00016355484,0.0025641283],"study_design_scores_gemma":[0.00036656327,0.000057925747,0.0010340208,0.00057656097,0.00002390377,0.000029747223,0.000314608,0.98711234,0.008883289,0.0013478996,0.000054109238,0.00019901937],"about_ca_topic_score_codex":0.000033613112,"about_ca_topic_score_gemma":0.000004292712,"teacher_disagreement_score":0.4674242,"about_ca_system_score_codex":0.000078302146,"about_ca_system_score_gemma":0.00011825452,"threshold_uncertainty_score":0.72540164},"labels":[],"label_agreement":null},{"id":"W2114392474","doi":"10.1109/caia.1995.378802","title":"Nuclear Process Theory","year":2002,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Nuclear Physics","keywords":"Nuclear reaction; Process (computing); Nuclear data; Computer science; Physics; Nuclear physics; Particle physics; Programming language; Neutron","score_opus":0.016130948401856464,"score_gpt":0.2109865532233944,"score_spread":0.19485560482153794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114392474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012517738,0.0002902458,0.551501,0.0025819105,0.00020193482,0.000078993624,4.2850263e-7,0.0010473182,0.4317805],"genre_scores_gemma":[0.97523534,0.0000027976562,0.018313099,0.0013255151,0.000029434997,0.0000016019552,1.8678917e-7,0.00000544835,0.0050865556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949276,0.00002974502,0.00006737309,0.00015848398,0.000101644415,0.00014997913],"domain_scores_gemma":[0.99962425,0.000061456456,0.00002031824,0.00022623403,0.000020304728,0.000047449394],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017260536,0.000055087206,0.000049124577,0.000030355546,0.00010471403,0.00008887304,0.00045090244,0.000026824118,0.0007181573],"category_scores_gemma":[0.000018421675,0.00004414894,0.000019359648,0.00014440599,0.000013517256,0.00023351757,0.000046705667,0.00007437839,0.00079279684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027617766,0.00006312061,0.00082512666,0.00002461705,0.000012619209,0.000027864407,0.006375799,0.00038916722,0.00011289261,0.830838,0.03569922,0.12562878],"study_design_scores_gemma":[0.00036780868,0.00015621184,0.00025987468,0.000057346406,0.0000055226624,0.00005696457,0.00018411395,0.86126465,0.0012627753,0.08263253,0.05324733,0.00050486205],"about_ca_topic_score_codex":0.0000021814333,"about_ca_topic_score_gemma":1.8005161e-7,"teacher_disagreement_score":0.9627176,"about_ca_system_score_codex":0.000004942281,"about_ca_system_score_gemma":0.0000048756824,"threshold_uncertainty_score":0.9999852},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.09349248129293128,"score_gpt":0.3108650183312667,"score_spread":0.2173725370383354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114629047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06681743,0.0001775827,0.93084854,0.0003665076,0.00069077156,0.0001314962,0.000020900678,0.00025055255,0.00069620885],"genre_scores_gemma":[0.98307174,0.000007372309,0.016075142,0.00023677012,0.00027626596,0.0000074379846,0.00003375181,0.000017433746,0.00027410674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787503,0.00011036397,0.00044381397,0.0005764015,0.00041625477,0.00057812105],"domain_scores_gemma":[0.99841034,0.0006142697,0.00008986646,0.0006774967,0.0001001783,0.00010783459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054378837,0.00020834433,0.0001822502,0.0001521033,0.00033062734,0.0003225168,0.00085169135,0.00005459379,0.00012429935],"category_scores_gemma":[0.00012857128,0.0002077641,0.000073450836,0.0004991978,0.00009208771,0.0004784417,0.00031372267,0.0002811894,0.0006454432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055785018,0.00038432647,0.07416477,0.00009888349,0.000039108785,0.00039246952,0.002363565,0.054388955,0.010895144,0.1354475,0.0062289853,0.7155405],"study_design_scores_gemma":[0.000051969724,0.000077392295,0.0027725159,0.00012135147,0.000009819516,0.000024432538,0.00012741597,0.8823533,0.09834344,0.012298372,0.0032967944,0.00052321766],"about_ca_topic_score_codex":0.0044579683,"about_ca_topic_score_gemma":0.00042143173,"teacher_disagreement_score":0.9162543,"about_ca_system_score_codex":0.000043403183,"about_ca_system_score_gemma":0.00007345706,"threshold_uncertainty_score":0.8472374},"labels":[],"label_agreement":null},{"id":"W2114901227","doi":"10.1109/isic.1990.128482","title":"Qualitative theory of robot grasping-A formalisation of 'intuitive' robot grasping","year":2002,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Robot; Computer science; Artificial intelligence; Human–computer interaction","score_opus":0.09221109783383796,"score_gpt":0.310936105194074,"score_spread":0.21872500736023603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114901227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0100817885,0.00027792787,0.9800511,0.00030644255,0.00012417126,0.00012938923,0.0000017912075,0.00010146582,0.008925916],"genre_scores_gemma":[0.9356518,0.000011537721,0.06379248,0.0001340497,0.000020113956,0.000006892547,0.000004523609,0.000008155798,0.0003704521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983303,0.00036144227,0.00047774366,0.00026800443,0.00029898586,0.00026350556],"domain_scores_gemma":[0.9983167,0.0007379244,0.0003429773,0.00035170928,0.00019033592,0.00006034855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013515807,0.00014948135,0.00026318894,0.00018305541,0.00011265503,0.000034718374,0.00049099943,0.00007032457,0.00010716887],"category_scores_gemma":[0.00018314001,0.00013273534,0.00010198014,0.00042230374,0.00010116229,0.0006296756,0.00011380981,0.0001330941,0.000017669743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021978312,0.00013898454,0.00099252,0.00017318413,0.00009050639,0.0000039177658,0.10507344,0.022299482,0.005366169,0.8293576,0.00057859253,0.0359036],"study_design_scores_gemma":[0.0015499438,0.0014277545,0.005401745,0.0009860414,0.000060228558,0.000021131193,0.011987288,0.7091265,0.10719494,0.1610729,0.00013880015,0.0010327294],"about_ca_topic_score_codex":0.0001024898,"about_ca_topic_score_gemma":0.0000060897687,"teacher_disagreement_score":0.92557,"about_ca_system_score_codex":0.000026380956,"about_ca_system_score_gemma":0.000027735774,"threshold_uncertainty_score":0.541279},"labels":[],"label_agreement":null},{"id":"W2116541436","doi":"","title":"Beyond classical planning: procedural control knowledge and preferences in state-of-the-art planners","year":2008,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Exploit; Computer science; Automated planning and scheduling; Variety (cybernetics); Quality (philosophy); Domain (mathematical analysis); Control (management); Domain knowledge; State (computer science); State space; Human–computer interaction; Management science; Data science; Artificial intelligence; Engineering; Computer security","score_opus":0.020831251333125127,"score_gpt":0.2466802858114514,"score_spread":0.22584903447832627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116541436","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9295987,0.00095270644,0.044289414,0.0020583372,0.0003106797,0.00036743723,0.000007218453,0.00015058316,0.022264907],"genre_scores_gemma":[0.9955032,0.0000051464685,0.0028443972,0.00020355218,0.000015763322,0.000010491937,0.000001317795,0.0000044443323,0.0014116825],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9989784,0.000084495856,0.00024078898,0.00026914207,0.00016446057,0.00026275107],"domain_scores_gemma":[0.99933386,0.00028239598,0.00007674801,0.00019024963,0.000038665512,0.00007806114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021376782,0.00012661473,0.00019128341,0.0000841159,0.000118970056,0.000032954304,0.00044463025,0.00005215333,0.0000039322695],"category_scores_gemma":[0.000046854027,0.00008449181,0.000030626357,0.00025639305,0.00013029366,0.00022830752,0.00010634925,0.00020543252,0.000007747647],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012619096,0.00022918949,0.8870217,0.00013495953,0.000049093596,0.000060459588,0.02015637,0.003748525,0.00044591405,0.007284472,0.059111383,0.021631738],"study_design_scores_gemma":[0.0057538734,0.0010864936,0.48959243,0.00075471355,0.00002344545,0.0003479139,0.00027535428,0.45629895,0.0059624854,0.019165512,0.019436216,0.0013026326],"about_ca_topic_score_codex":0.00001642761,"about_ca_topic_score_gemma":0.000036437108,"teacher_disagreement_score":0.4525504,"about_ca_system_score_codex":0.0000148293675,"about_ca_system_score_gemma":0.00018443994,"threshold_uncertainty_score":0.3445476},"labels":[],"label_agreement":null},{"id":"W2119197205","doi":"10.1109/ast.2009.17","title":"Toward State Space Island Identification in Multi-process Bidirectional Heuristic Search","year":2009,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Speedup; Computer science; Overhead (engineering); Heuristic; Process (computing); Identification (biology); State space; State (computer science); Variety (cybernetics); Algorithm; Parallel computing; Mathematics; Artificial intelligence","score_opus":0.04640868598039233,"score_gpt":0.3102758843921355,"score_spread":0.26386719841174316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119197205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055511672,0.00009021455,0.9412769,0.0018085279,0.00012955685,0.00009100966,0.000003681927,0.00015345967,0.00093494734],"genre_scores_gemma":[0.9808632,0.00000923117,0.016928175,0.00013727516,0.000017579488,0.0000038454946,0.000008485058,0.0000034557793,0.0020287437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900526,0.00006008554,0.00017790726,0.0003042523,0.00022687543,0.00022563885],"domain_scores_gemma":[0.99955994,0.00007766031,0.000039155104,0.0001891149,0.000076566954,0.000057573707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046917607,0.00008486907,0.00008620532,0.0001601382,0.000083976716,0.00016786231,0.00032306882,0.0000335097,0.000018990324],"category_scores_gemma":[0.000041617983,0.00007944814,0.000019667197,0.00046028406,0.0000132602345,0.00030743252,0.000026013753,0.00015108217,0.000077361125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018908245,0.0016620749,0.19171074,0.00043686206,0.00007212641,0.00044160744,0.05770981,0.36778212,0.0145993065,0.031687427,0.019517032,0.31419182],"study_design_scores_gemma":[0.00052812725,0.00007989312,0.0868099,0.000056292272,0.0000020526404,0.000020877638,0.0000771614,0.90005386,0.0057373475,0.0060173264,0.0003504993,0.00026664988],"about_ca_topic_score_codex":0.00014929486,"about_ca_topic_score_gemma":0.000060794744,"teacher_disagreement_score":0.92535156,"about_ca_system_score_codex":0.00003536172,"about_ca_system_score_gemma":0.000081174694,"threshold_uncertainty_score":0.3239801},"labels":[],"label_agreement":null},{"id":"W2120637940","doi":"10.1109/robot.1988.12315","title":"Representing uncertainty in robot task planning","year":2003,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Planner; Task (project management); Representation (politics); Context (archaeology); Robot; Probabilistic logic; Computer science; Artificial intelligence; Component (thermodynamics); Operator (biology); Adversary; Process (computing); Human–computer interaction; Engineering; Programming language; Computer security","score_opus":0.025828876592671395,"score_gpt":0.2673237223068039,"score_spread":0.24149484571413252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120637940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041751582,0.00033761648,0.8605363,0.00050075765,0.00029166398,0.000108391345,3.32747e-7,0.00031610345,0.09615726],"genre_scores_gemma":[0.92550844,0.0000012011258,0.073291086,0.00031172408,0.00001827014,0.0000056071767,0.0000014994374,0.000005834235,0.0008563608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987298,0.00012732438,0.00022338094,0.0003802594,0.00016621234,0.00037298846],"domain_scores_gemma":[0.9992086,0.0002398844,0.000056035886,0.00040347688,0.000024905883,0.00006706168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083499844,0.0001083833,0.00012701005,0.00012084074,0.00011658215,0.0001343223,0.00040406242,0.00005415879,0.00002431726],"category_scores_gemma":[0.00019694804,0.0000996531,0.00003417772,0.00045085477,0.000013810331,0.00028770484,0.00008610031,0.00020300882,0.000036508765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052776645,0.000055338245,0.29679337,0.000024463756,0.000014128582,0.00022033972,0.0033217133,0.5874962,0.0012045938,0.09887999,0.0033753477,0.008609226],"study_design_scores_gemma":[0.0011888848,0.00009617816,0.011853698,0.00035638805,0.0000055628216,0.000098453085,0.00073563284,0.93972975,0.0033369402,0.019052776,0.022606026,0.00093973597],"about_ca_topic_score_codex":0.00019296176,"about_ca_topic_score_gemma":0.000010709688,"teacher_disagreement_score":0.8837568,"about_ca_system_score_codex":0.000030723262,"about_ca_system_score_gemma":0.00006247257,"threshold_uncertainty_score":0.40637356},"labels":[],"label_agreement":null},{"id":"W2121406482","doi":"10.1109/acc.2001.945650","title":"Sensor uncertainty management for an encapsulated logical device architecture: Part I - fusion of uncertain sensor data","year":2001,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Sensor fusion; Modular design; Architecture; Scalability; Software architecture; Reference architecture; Automation; Space-based architecture; Distributed computing; Software; Artificial intelligence; Engineering; Database","score_opus":0.0914992612694864,"score_gpt":0.31145975322711766,"score_spread":0.21996049195763126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121406482","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045685954,0.00007723661,0.9484679,0.0015075508,0.0002017036,0.00061424234,0.00006140793,0.0003175811,0.0030663905],"genre_scores_gemma":[0.43362153,0.000043748776,0.56259185,0.0013116876,0.00014693958,0.000024658537,0.00056039076,0.000021766191,0.0016774472],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784744,0.00017593893,0.00040192873,0.0007835728,0.00033086154,0.0004602816],"domain_scores_gemma":[0.99780136,0.00032400005,0.00014373119,0.0014681363,0.00010470338,0.00015808482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009264691,0.00021988535,0.00025975078,0.000111295216,0.00019064503,0.000090095906,0.0014554547,0.00010279151,0.00006598533],"category_scores_gemma":[0.00006308978,0.00016828258,0.00005833068,0.00044247747,0.00004850444,0.00025067295,0.00050466764,0.00014596092,0.000013018613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007836942,0.0010748857,0.0036278612,0.0006269662,0.00037272277,0.00040427182,0.002368439,0.35542852,0.008913085,0.03809234,0.02538131,0.56292593],"study_design_scores_gemma":[0.0009207325,0.0004635784,0.00044562083,0.000114546725,0.000041208135,0.000059595794,0.00017288861,0.9100802,0.00058424205,0.0029260786,0.083757415,0.00043390816],"about_ca_topic_score_codex":0.00022192035,"about_ca_topic_score_gemma":0.00005988407,"teacher_disagreement_score":0.562492,"about_ca_system_score_codex":0.000026032925,"about_ca_system_score_gemma":0.000042443196,"threshold_uncertainty_score":0.68623644},"labels":[],"label_agreement":null},{"id":"W2121729191","doi":"10.1609/socs.v4i1.18293","title":"Automatic Generation of Efficient Domain-Optimized Planners from Generic Parametrized Planners","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Planner; Benchmark (surveying); Computer science; Domain (mathematical analysis); Heuristics; Parameterized complexity; Context (archaeology); Set (abstract data type); Range (aeronautics); Preprocessor; Heuristic; Work (physics); Automated planning and scheduling; Mathematical optimization; Artificial intelligence; Algorithm; Engineering; Mathematics","score_opus":0.02448131788440136,"score_gpt":0.25144941176650953,"score_spread":0.22696809388210817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121729191","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9875673,0.00005682272,0.002229416,0.0032973508,0.0041017346,0.00023340833,0.000030815772,0.00006848083,0.0024146833],"genre_scores_gemma":[0.9841596,0.000010666896,0.015291545,0.00011509191,0.00027723747,0.000018626433,0.000026396456,0.00001468849,0.000086143074],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9973578,0.00006263526,0.0005135167,0.00044573736,0.0013623986,0.000257911],"domain_scores_gemma":[0.9981412,0.0004300699,0.00036017774,0.0002470246,0.0007348646,0.000086612585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007764124,0.00018359661,0.00030210323,0.00014563467,0.00015510002,0.0001995792,0.001587248,0.000111238856,0.0000347065],"category_scores_gemma":[0.0002808362,0.00015006844,0.00016718628,0.00062813214,0.0000739534,0.00015740322,0.00045451254,0.00027291517,0.000007981259],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041412198,0.0007972889,0.0031729268,0.00010121177,0.00045135157,0.000010055751,0.0032785512,0.051801853,0.74334013,0.19001766,0.0053442474,0.001270637],"study_design_scores_gemma":[0.0024008376,0.00016913953,0.00033084748,0.00022343552,0.000021686856,0.00000815134,0.000116865434,0.46168336,0.5298149,0.0045368294,0.00047091063,0.00022302174],"about_ca_topic_score_codex":0.0001309554,"about_ca_topic_score_gemma":6.2248233e-7,"teacher_disagreement_score":0.40988153,"about_ca_system_score_codex":0.00018285595,"about_ca_system_score_gemma":0.00018470656,"threshold_uncertainty_score":0.6119613},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007530868579034015,"score_gpt":0.26665761035862323,"score_spread":0.2591267417795892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122411895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01098257,0.00026381636,0.9860968,0.0014629223,0.000025208572,0.00011186059,0.0000034657426,0.00006353907,0.000989809],"genre_scores_gemma":[0.7888493,9.851641e-7,0.21059036,0.0005000014,0.000008762851,0.000024037623,0.00000807819,0.000004555801,0.000013953074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993526,0.000036033038,0.00017366446,0.00021003999,0.00005841663,0.0001692544],"domain_scores_gemma":[0.9994468,0.00006213198,0.000063837964,0.00034309347,0.000045368746,0.000038755014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021223428,0.00007481052,0.00011374936,0.00013382033,0.00003716993,0.000014643699,0.00026377203,0.000050861458,0.0000054807183],"category_scores_gemma":[0.00002592547,0.000075459684,0.000028640978,0.00048418163,0.00003278548,0.000067855115,0.000049425344,0.00011420037,0.00002920425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018070246,0.00034075743,0.020076068,0.00013054853,0.000034188226,0.0018395017,0.0009208363,0.11784751,0.051460892,0.745779,0.00052335166,0.061029274],"study_design_scores_gemma":[0.011890471,0.0017825045,0.0067063468,0.0012658058,0.00008787492,0.0026308915,0.00008459417,0.41381013,0.1764887,0.31252086,0.070157975,0.002573835],"about_ca_topic_score_codex":0.00016982245,"about_ca_topic_score_gemma":0.000032140404,"teacher_disagreement_score":0.7778667,"about_ca_system_score_codex":0.00002503813,"about_ca_system_score_gemma":0.00010066686,"threshold_uncertainty_score":0.30771565},"labels":[],"label_agreement":null},{"id":"W2126657415","doi":"10.24908/pceea.v0i0.4846","title":"SMALL-GROUP TUTORIALS AND OPEN BRAINSTORMING FOR PROBLEM-SOLVING IN ENVIRONMENTAL ENGINEERING SYSTEMS","year":2013,"lang":"en","type":"article","venue":"Proceedings of the Canadian Engineering Education Association (CEEA)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Brainstorming; Class (philosophy); Coaching; Engineering education; Computer science; Group work; Resource (disambiguation); Work (physics); Mathematics education; Problem-based learning; Engineering management; Engineering; Psychology; Artificial intelligence; Mechanical engineering","score_opus":0.008436396259165023,"score_gpt":0.18412099085005285,"score_spread":0.1756845945908878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126657415","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97631043,0.000880639,0.0065511954,0.004901438,0.004685023,0.0048895017,0.00003761427,0.00021930115,0.0015248441],"genre_scores_gemma":[0.97396195,0.0000051496463,0.024985684,0.000081646634,0.00015192742,0.00032019554,0.0000059375707,0.000024541609,0.00046298592],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988843,0.000008229671,0.00032650633,0.00025933536,0.00016615594,0.0003554735],"domain_scores_gemma":[0.9991655,0.00017293076,0.0002917496,0.000104958504,0.000103081766,0.00016177983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009494306,0.00015000344,0.00019725648,0.00025534842,0.0001656557,0.00064794597,0.0006835467,0.00010593744,0.0000024911837],"category_scores_gemma":[0.00055529736,0.00015410341,0.000037077767,0.0002688558,0.000006525766,0.0008009879,0.00011174924,0.00016218687,0.0000018725334],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008360272,0.0002826033,0.570106,0.0032846748,0.00037628048,5.7782165e-7,0.025452357,0.048793394,0.09392272,0.2089968,0.02825387,0.020522337],"study_design_scores_gemma":[0.001579024,0.00014172746,0.28925708,0.0024811814,0.00006357392,0.000022221382,0.0013396615,0.6446348,0.0025111672,0.0014491262,0.054903615,0.0016168561],"about_ca_topic_score_codex":0.013519797,"about_ca_topic_score_gemma":0.0008749779,"teacher_disagreement_score":0.59584135,"about_ca_system_score_codex":0.0014213183,"about_ca_system_score_gemma":0.0002585949,"threshold_uncertainty_score":0.99304926},"labels":[],"label_agreement":null},{"id":"W2127665473","doi":"10.1109/iembs.2008.4650170","title":"Imputation of missing values by integrating neural networks and case-based reasoning","year":2008,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Children's Hospital of Eastern Ontario; Izaak Walton Killam Health Centre; University of Ottawa; Carleton University","funders":"University of British Columbia","keywords":"Imputation (statistics); Missing data; Computer science; Artificial neural network; Data mining; Artificial intelligence; Machine learning; Case-based reasoning","score_opus":0.014273677910796955,"score_gpt":0.2392655763324815,"score_spread":0.22499189842168454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127665473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19933785,0.00045387915,0.79955184,0.00016662928,0.00005280309,0.00004100124,5.9577053e-7,0.00010412333,0.0002912502],"genre_scores_gemma":[0.8041995,0.000001745277,0.19559272,0.00015388416,0.000018094914,0.000001150637,0.0000044988624,0.00000521235,0.00002319404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918306,0.00009038772,0.00021138364,0.0002194406,0.00011376108,0.00018195085],"domain_scores_gemma":[0.99923986,0.00037221948,0.0001225255,0.00014246274,0.000057424346,0.00006549145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031537536,0.00010410199,0.00013229898,0.000054650252,0.0003028921,0.000074378295,0.00012702239,0.000049641603,0.0000029536004],"category_scores_gemma":[0.00007116402,0.000090461224,0.000028006209,0.000196985,0.00004845182,0.00027483192,0.000041298106,0.00013239674,2.5195462e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036012512,0.00008807466,0.07479025,0.00012489947,0.00004813962,0.0017171314,0.008767245,0.37047714,0.0026854286,0.0034623132,0.007793485,0.53000987],"study_design_scores_gemma":[0.00015649418,0.00006832362,0.00020239217,0.00006452812,0.0000035928924,0.0007399271,0.00006210831,0.99733096,0.0011276238,0.00012764017,0.000011218272,0.00010519498],"about_ca_topic_score_codex":0.0003519085,"about_ca_topic_score_gemma":0.000004100933,"teacher_disagreement_score":0.6268538,"about_ca_system_score_codex":0.000012099705,"about_ca_system_score_gemma":0.000035405006,"threshold_uncertainty_score":0.36889017},"labels":[],"label_agreement":null},{"id":"W2128680814","doi":"10.1109/icpp.2006.9","title":"A Parallel External-Memory Frontier Breadth-First Traversal Algorithm for Clusters of Workstations","year":2006,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Tree traversal; Computer science; Parallel computing; Algorithm; Graph traversal; Workload; Memory management; Workstation; Sorting; Process (computing); Parallel algorithm; Operating system","score_opus":0.009987045676142786,"score_gpt":0.22076745645308427,"score_spread":0.21078041077694148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128680814","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069934805,0.00019994118,0.99543214,0.0005765145,0.00026978293,0.00020501786,0.000015693238,0.000110014014,0.0024915694],"genre_scores_gemma":[0.04664085,0.000002978923,0.94788903,0.00017925842,0.00008528967,0.000030528547,0.000015044472,0.000010397485,0.0051466096],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899846,0.000024563054,0.00026817963,0.0002654026,0.0001742637,0.00026914699],"domain_scores_gemma":[0.99925894,0.00022221702,0.000111925234,0.0002763025,0.00007459028,0.000056047775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021081968,0.00012228164,0.00016003088,0.0000991728,0.00014259056,0.000077053744,0.00041832117,0.000062919586,0.000020973695],"category_scores_gemma":[0.0000071842683,0.000113936556,0.000099962665,0.00016377815,0.000038800874,0.00026768507,0.000046136094,0.00007565024,0.000009621228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008892441,0.00053878786,0.0036039236,0.00015428102,0.00013835423,0.000038146267,0.0044885897,0.1518441,0.00025362198,0.033926282,0.19984715,0.60507786],"study_design_scores_gemma":[0.0009890754,0.00009967588,0.0021318903,0.000074596406,0.000016173697,0.00000931919,0.00009991253,0.98866236,0.00027569375,0.00495633,0.0024615955,0.00022338542],"about_ca_topic_score_codex":0.0006008315,"about_ca_topic_score_gemma":0.00008212492,"teacher_disagreement_score":0.8368183,"about_ca_system_score_codex":0.000025220132,"about_ca_system_score_gemma":0.000058651814,"threshold_uncertainty_score":0.4646198},"labels":[],"label_agreement":null},{"id":"W2128697293","doi":"10.1109/caia.1990.89164","title":"Modeling digital circuits for trouble-shooting: an overview","year":2002,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"PricewaterhouseCoopers (Canada)","funders":"","keywords":"Troubleshooting; Set (abstract data type); Computer science; Representation (politics); Component (thermodynamics); Focus (optics); Digital electronics; Artificial intelligence; Circuit diagram; Electronic circuit; Data mining; Programming language; Electrical engineering; Engineering","score_opus":0.16111847423401407,"score_gpt":0.29430221125351846,"score_spread":0.1331837370195044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128697293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006013165,0.00081204076,0.98537046,0.0005203912,0.00013097226,0.00013781598,0.0000046136156,0.0004042645,0.006606292],"genre_scores_gemma":[0.9598536,0.000012176961,0.03859968,0.00050085166,0.00009078182,0.000012326971,0.000008626576,0.000012667276,0.00090926804],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891806,0.000016222195,0.00020151174,0.0003662449,0.0001594284,0.00033855665],"domain_scores_gemma":[0.9993039,0.00008837607,0.000037228045,0.00038068835,0.0000641162,0.00012573996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020835841,0.00012710191,0.00013529108,0.000058452264,0.00018263701,0.00052078825,0.0005722175,0.00005223515,0.00003370543],"category_scores_gemma":[0.000036747755,0.00011576038,0.000069276655,0.00017473097,0.000007151774,0.0013361784,0.000067523884,0.00009364595,0.00004488718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044787284,0.00024567565,0.0011779275,0.00014422614,0.000038273844,0.000014856658,0.0030489333,0.13867821,0.00015119082,0.15952407,0.0044403016,0.6925319],"study_design_scores_gemma":[0.00023800941,0.000098471464,0.0000053686736,0.00003343876,0.0000028788543,0.000009845059,0.000018895938,0.99401534,0.00004371954,0.0034128532,0.0019401731,0.00018101359],"about_ca_topic_score_codex":0.00001524543,"about_ca_topic_score_gemma":0.0000027596284,"teacher_disagreement_score":0.95384043,"about_ca_system_score_codex":0.000017569919,"about_ca_system_score_gemma":0.000019280635,"threshold_uncertainty_score":0.5021973},"labels":[],"label_agreement":null},{"id":"W2128780584","doi":"10.1109/tai.1991.167117","title":"Knowledge-based configuration of computer systems using hierarchical partial choice","year":2002,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Backtracking; Computer science; Scheme (mathematics); Inference; Expert system; Knowledge base; Context (archaeology); Inference engine; Theoretical computer science; Artificial intelligence; Knowledge-based systems; Data mining; Programming language; Mathematics","score_opus":0.05628350266121499,"score_gpt":0.27328734012434025,"score_spread":0.21700383746312527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128780584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010324833,0.00020554173,0.985326,0.00023685173,0.0007059234,0.00011995894,0.0000015483708,0.0001508507,0.0029285084],"genre_scores_gemma":[0.95097417,6.0885793e-7,0.04839066,0.000107722524,0.00029594408,0.0000036752385,0.0000032568107,0.000006686391,0.00021729525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988262,0.00016781612,0.00031533802,0.00026654906,0.00019570366,0.0002283926],"domain_scores_gemma":[0.9990082,0.00036504687,0.00011169438,0.00031817134,0.00010719033,0.00008973452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026207507,0.00011851294,0.00018482913,0.000103990504,0.000117484895,0.00013746359,0.00035599002,0.00007669867,0.00005602447],"category_scores_gemma":[0.000020710419,0.00010465335,0.000054157907,0.00026372247,0.00005755675,0.0002360884,0.000049450766,0.00014435044,0.000048871905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033371536,0.0010005003,0.013628825,0.0007176112,0.00013623115,0.000046721056,0.004378039,0.63748413,0.012751536,0.20572995,0.031493306,0.09259976],"study_design_scores_gemma":[0.00032069083,0.00009124153,0.00015377172,0.00008915257,0.0000055096593,0.000006130114,0.0000025008726,0.99263746,0.0025932777,0.00002177618,0.003946828,0.0001316815],"about_ca_topic_score_codex":0.00010913636,"about_ca_topic_score_gemma":0.0000023767861,"teacher_disagreement_score":0.94064933,"about_ca_system_score_codex":0.000025795009,"about_ca_system_score_gemma":0.000057417215,"threshold_uncertainty_score":0.42676398},"labels":[],"label_agreement":null},{"id":"W2129511462","doi":"10.1109/aihas.1991.138456","title":"Extracting qualitative descriptions from quantitative models","year":2002,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Graph; Domain (mathematical analysis); Physical system; Qualitative analysis; Theoretical computer science; Physical space; Artificial intelligence; Qualitative research; Mathematics","score_opus":0.24014625193898126,"score_gpt":0.3350213157549781,"score_spread":0.09487506381599686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129511462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009148745,0.0005111637,0.9531317,0.0012361743,0.00015529786,0.000062406725,0.000009579959,0.0003041036,0.035440855],"genre_scores_gemma":[0.5425801,0.0000066341236,0.45597103,0.00024007936,0.000017222266,0.000006626088,0.0000034381324,0.0000050699473,0.0011697377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881077,0.00021057235,0.00021053149,0.00033249994,0.00019407351,0.00024155299],"domain_scores_gemma":[0.9982881,0.0011636447,0.00008976397,0.000293636,0.00008146375,0.00008339256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003444599,0.00011887713,0.00012650123,0.00007618114,0.00025849935,0.00017986342,0.00040180265,0.00004909509,0.00022708352],"category_scores_gemma":[0.00009794792,0.000108618755,0.00005132831,0.00025984203,0.000029649626,0.0012869036,0.000072888724,0.00018382307,0.00034058656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003877186,0.00009696228,0.00010103395,0.0000055033233,0.0000540418,0.00001997668,0.22459795,0.011082627,0.0010371696,0.73984766,0.011467644,0.011685569],"study_design_scores_gemma":[0.00012463711,0.000045397857,0.00002545615,0.000032354896,0.0000043121677,0.0000021361943,0.0043255445,0.9164339,0.00022028796,0.07816031,0.0004514646,0.00017422422],"about_ca_topic_score_codex":0.00061143836,"about_ca_topic_score_gemma":0.000028551001,"teacher_disagreement_score":0.9053513,"about_ca_system_score_codex":0.000028151628,"about_ca_system_score_gemma":0.000015200732,"threshold_uncertainty_score":0.44293442},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.018355593524840216,"score_gpt":0.21372018877610013,"score_spread":0.19536459525125993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129900375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014827461,0.00013094621,0.9969228,0.0002721403,0.00008006327,0.000028143093,3.0266847e-7,0.00019959566,0.00088324957],"genre_scores_gemma":[0.549342,0.0000015724142,0.4503284,0.00015211,0.000009613007,0.0000020651212,7.4414555e-7,0.000002367297,0.00016111661],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994718,0.000010026767,0.00011520501,0.00015084357,0.00010561772,0.00014655307],"domain_scores_gemma":[0.99962044,0.00019679323,0.000014968014,0.00011439837,0.000017116037,0.000036268833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000105139196,0.000058854897,0.000055648772,0.000089512505,0.000028482407,0.00005374106,0.00028385618,0.000024162699,0.00009854756],"category_scores_gemma":[0.000052610674,0.000058047164,0.000015397825,0.00026907696,0.0000054192788,0.00019110338,0.000054677803,0.00009417304,0.000138909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.3218871e-7,0.000016816522,0.00608355,0.000008045058,0.0000019369131,0.000018479557,0.00061011076,0.9263141,0.000002724316,0.026805252,0.0007685497,0.03937018],"study_design_scores_gemma":[0.00003177563,0.000011367214,0.0013077158,0.000022277078,2.1124222e-7,0.000007991879,0.0000035827993,0.99676406,0.000045178178,0.0012105068,0.00051398046,0.000081352904],"about_ca_topic_score_codex":0.000014534607,"about_ca_topic_score_gemma":0.0000015526059,"teacher_disagreement_score":0.54785925,"about_ca_system_score_codex":0.000017605407,"about_ca_system_score_gemma":0.0000072811695,"threshold_uncertainty_score":0.23670946},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020539085118634923,"score_gpt":0.24013966417663246,"score_spread":0.21960057905799754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129975315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040807154,0.00018687382,0.82830596,0.0013391023,0.0000458526,0.000056604666,2.5519174e-7,0.00047148275,0.12878671],"genre_scores_gemma":[0.8787533,9.355378e-7,0.119788095,0.0007191675,0.000019287501,0.0000012802017,0.0000010592088,0.0000017366997,0.0007151495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935466,0.000018818468,0.00007991702,0.00020501293,0.00014796104,0.00019361387],"domain_scores_gemma":[0.9996129,0.0000542625,0.000033066844,0.00021838771,0.000022791599,0.000058537527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012274555,0.00008147729,0.000075727956,0.000045838806,0.00010559267,0.00014191518,0.00040100596,0.000027391783,0.000018740526],"category_scores_gemma":[0.000005724734,0.00005419153,0.0000127942285,0.0001788853,0.000010046764,0.0002983523,0.000023370174,0.000091732945,0.000030493156],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007674,0.00019053563,0.08694272,0.000034210123,0.00006490588,0.00029890178,0.0127626695,0.024996534,0.00077647594,0.3076281,0.03086638,0.5353618],"study_design_scores_gemma":[0.0038275663,0.00941866,0.27968752,0.00172764,0.00005385145,0.0005199598,0.0011122779,0.46431202,0.021793613,0.14454742,0.06875311,0.004246382],"about_ca_topic_score_codex":0.000013460032,"about_ca_topic_score_gemma":0.0000014703327,"teacher_disagreement_score":0.8379461,"about_ca_system_score_codex":0.0000059751387,"about_ca_system_score_gemma":0.000040237403,"threshold_uncertainty_score":0.22098665},"labels":[],"label_agreement":null},{"id":"W2130324230","doi":"10.1007/3-540-45486-1_9","title":"Keep It Simple: A Case-Base Maintenance Policy Based on Clustering and Information Theory","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"","keywords":"Computer science; Cluster analysis; Partition (number theory); Base (topology); Simple (philosophy); Data mining; Point (geometry); Process (computing); Artificial intelligence; Mathematics","score_opus":0.011208826655194036,"score_gpt":0.23306893811667656,"score_spread":0.22186011146148252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130324230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007775364,0.00009292012,0.9888474,0.0022369337,0.00033590925,0.00032145297,0.000020447997,0.00018312322,0.007884077],"genre_scores_gemma":[0.6568934,0.000052580985,0.30950412,0.032684363,0.00053034694,0.000021606185,0.000029224915,0.000052467058,0.00023193288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971043,0.000077377204,0.0005220317,0.0009394214,0.0006437249,0.00071317726],"domain_scores_gemma":[0.9971842,0.0010890216,0.00028223524,0.0010931463,0.00013100989,0.00022034413],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013525368,0.00052884,0.00040115704,0.0012790776,0.00047348262,0.00083809474,0.0013843649,0.0002843247,0.000027610287],"category_scores_gemma":[0.00018391851,0.0004773754,0.000084733365,0.00061140454,0.0004201524,0.0012702472,0.00049774785,0.0009001081,0.000037922688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025207988,0.000008119203,0.000012304486,0.000056515208,0.0000041624144,0.00041567377,0.00093172974,0.2777888,0.0000028071065,0.017247178,0.00003594042,0.70347154],"study_design_scores_gemma":[0.00036374666,0.00022470887,0.000018034398,0.0007074349,0.000005081854,0.00067720504,4.7166233e-7,0.91089123,0.000059606075,0.082691796,0.0038123622,0.0005483421],"about_ca_topic_score_codex":0.0001116474,"about_ca_topic_score_gemma":0.00006103402,"teacher_disagreement_score":0.70292324,"about_ca_system_score_codex":0.00028102827,"about_ca_system_score_gemma":0.0007722305,"threshold_uncertainty_score":0.9997678},"labels":[],"label_agreement":null},{"id":"W2132513170","doi":"","title":"Diagnosis as planning revisited","year":2010,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Medical diagnosis; Benchmark (surveying); Perspective (graphical); Computer science; Set (abstract data type); Artificial intelligence; Management science; Data science; Machine learning; Risk analysis (engineering); Medicine; Engineering","score_opus":0.014330917942663068,"score_gpt":0.2663263033345544,"score_spread":0.25199538539189137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132513170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33389944,0.0004752438,0.47627524,0.0062752077,0.0013429393,0.00024252046,0.0000026624655,0.0018662256,0.17962052],"genre_scores_gemma":[0.8862611,0.00000447525,0.110471204,0.0016712035,0.00011128945,0.000015260199,0.000003715237,0.000007476323,0.0014542863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992024,0.00002504006,0.0001287542,0.00026237415,0.00015317433,0.00022827812],"domain_scores_gemma":[0.99912775,0.00025500526,0.000044232915,0.0004292722,0.000038600323,0.000105146806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031016977,0.000094551404,0.0000952082,0.000075030905,0.00015266915,0.00019424403,0.0005867157,0.000067110355,0.00026747747],"category_scores_gemma":[0.00012398111,0.00008045053,0.00003710254,0.00025208344,0.000015396548,0.00028880508,0.00012392498,0.00027509037,0.00040369676],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008955775,0.00009788696,0.29306105,0.0000506237,0.000044052664,0.0002562001,0.0029489903,0.00044842224,0.005281253,0.33308828,0.15073796,0.21397632],"study_design_scores_gemma":[0.0009539997,0.0003135667,0.035690606,0.00038285457,0.000023723207,0.00024323123,0.000079835496,0.11692617,0.03450247,0.02938242,0.77996707,0.0015340686],"about_ca_topic_score_codex":0.000059014983,"about_ca_topic_score_gemma":0.0000022705424,"teacher_disagreement_score":0.62922907,"about_ca_system_score_codex":0.00000486346,"about_ca_system_score_gemma":0.000035129204,"threshold_uncertainty_score":0.51888394},"labels":[],"label_agreement":null},{"id":"W2132961188","doi":"","title":"A knowledge-based system for multiple hypothesis sensemaking support","year":2011,"lang":"en","type":"article","venue":"International Conference on Information Fusion","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Sensemaking; Computer science; Notional amount; Knowledge management; Data science; Knowledge representation and reasoning; Intelligence analysis; Decision support system; Process management; Artificial intelligence; Engineering","score_opus":0.09244771287266797,"score_gpt":0.27269889539720804,"score_spread":0.1802511825245401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132961188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038966585,0.0000033082108,0.88782185,0.0003955973,0.0011772694,0.00031498773,0.0000465273,0.00034546215,0.105998345],"genre_scores_gemma":[0.9558274,0.0000010848262,0.043486174,0.00032789988,0.00004570822,0.000068084126,0.000068728456,0.0000055955916,0.00016930349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892765,0.00003600132,0.00038858826,0.00017309005,0.00028794224,0.00018669908],"domain_scores_gemma":[0.9986418,0.00023699022,0.0002743256,0.00024521796,0.00053286384,0.00006883888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040636258,0.0001430679,0.00011853219,0.00031537085,0.00018786732,0.00021133182,0.00060376176,0.00008173442,0.000111338864],"category_scores_gemma":[0.00015024608,0.00013214195,0.00007696265,0.00012056292,0.000017591079,0.0009843097,0.00007583467,0.000097621894,0.00038585725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044850618,0.00018218684,0.0016513121,0.00029353524,0.00006216529,0.000008788481,0.012690304,0.0011109062,0.0014949702,0.7114988,0.004552372,0.26600614],"study_design_scores_gemma":[0.0009547923,0.00021486223,0.0007684858,0.00033258362,0.000005937342,0.000012093722,0.00031444416,0.9708556,0.010733711,0.00092553004,0.014619274,0.00026271795],"about_ca_topic_score_codex":0.000031646072,"about_ca_topic_score_gemma":0.0000053899453,"teacher_disagreement_score":0.9697447,"about_ca_system_score_codex":0.000106432075,"about_ca_system_score_gemma":0.00018518064,"threshold_uncertainty_score":0.53885925},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.06525791475197834,"score_gpt":0.37882640252474176,"score_spread":0.3135684877727634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133180954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10092291,0.00037097203,0.8945156,0.0010233897,0.00028876515,0.00010881004,8.693661e-7,0.000025426307,0.002743301],"genre_scores_gemma":[0.9057747,0.000018967612,0.09360936,0.000032980723,0.00042710075,0.000002766715,5.627056e-7,0.000015348081,0.00011818026],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962333,0.00028288324,0.00079027587,0.00031227138,0.0016870485,0.00069420727],"domain_scores_gemma":[0.9960357,0.0018509898,0.00028165433,0.00045164395,0.0011532586,0.00022673384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006385134,0.00016422312,0.00028351828,0.00078519084,0.00046169688,0.0005846304,0.0015400255,0.00010464007,0.000053842843],"category_scores_gemma":[0.00051188824,0.00011979434,0.00010389761,0.0014203835,0.00026569358,0.0005773912,0.00017795098,0.0010802803,0.000083175175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012186624,0.0005490212,0.0066282586,0.00009486771,0.00009006105,0.0035866548,0.0050052255,0.15364908,0.0055373474,0.12967546,0.012015181,0.68195015],"study_design_scores_gemma":[0.00022738703,0.0040410426,0.0014239061,0.0025489626,0.000024386552,0.001049885,0.0019077461,0.29359317,0.071341924,0.61814815,0.004946143,0.0007472781],"about_ca_topic_score_codex":0.00010920442,"about_ca_topic_score_gemma":0.00002068085,"teacher_disagreement_score":0.80485183,"about_ca_system_score_codex":0.00012354393,"about_ca_system_score_gemma":0.00058192894,"threshold_uncertainty_score":0.5637604},"labels":[],"label_agreement":null},{"id":"W2133447875","doi":"10.1145/1869397.1869402","title":"CORALS","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Intelligent Systems and Technology","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Planner; Plan (archaeology); Cruise missile; Process (computing); Set (abstract data type); Resource (disambiguation); Operations research; Conflict resolution; Resource allocation; Variety (cybernetics); Computer security; Artificial intelligence; Missile; Computer network; Law","score_opus":0.01746672045011682,"score_gpt":0.25081617406568346,"score_spread":0.23334945361556664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133447875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017320585,0.0002674753,0.9759504,0.003973792,0.0013114528,0.00016037989,0.0000046036257,0.00056373153,0.00044758516],"genre_scores_gemma":[0.9855461,0.000043146145,0.01365263,0.000051121217,0.000021726762,0.000046873713,7.855435e-7,0.0000080809405,0.0006295196],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99913484,0.000020842597,0.00021010707,0.00031310724,0.00010002336,0.00022107108],"domain_scores_gemma":[0.99887574,0.00013750009,0.000059767393,0.00080189656,0.000061,0.0000641173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016223585,0.00012489881,0.00015591556,0.00035601825,0.00023405596,0.00009057866,0.0006516898,0.00023274998,0.000022922413],"category_scores_gemma":[0.00003207896,0.00010973429,0.00003065992,0.00040817322,0.0000808386,0.00010871307,0.000017355445,0.0004940603,0.000090205416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009297642,0.000162142,0.0015199679,0.00006751794,0.000089001405,0.0000478501,0.00042029528,0.00056109077,0.008229103,0.44443795,0.0006702704,0.5437855],"study_design_scores_gemma":[0.0011781112,0.0021533917,0.0002778948,0.0005834598,0.00008710652,0.0032574874,0.0011700032,0.10198124,0.17418806,0.15019542,0.56283826,0.002089585],"about_ca_topic_score_codex":0.00008481227,"about_ca_topic_score_gemma":0.000022615452,"teacher_disagreement_score":0.96822554,"about_ca_system_score_codex":0.000010045528,"about_ca_system_score_gemma":0.000026082978,"threshold_uncertainty_score":0.44748345},"labels":[],"label_agreement":null},{"id":"W2133530124","doi":"10.1007/978-3-642-39521-5_2","title":"When Almost Is Not Even Close: Remarks on the Approximability of HDTP","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Heuristic; Analogy; Computational complexity theory; Theoretical computer science; Cognition; Projection (relational algebra); Artificial intelligence; Mathematical optimization; Algorithm; Mathematics; Epistemology","score_opus":0.020406032629037712,"score_gpt":0.23454690847582296,"score_spread":0.21414087584678526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133530124","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035954366,0.00023113308,0.9798513,0.008745198,0.000980217,0.000639614,0.000017853776,0.00010629785,0.009068858],"genre_scores_gemma":[0.40837902,0.000030299758,0.5757771,0.013084567,0.0005857272,0.00003693296,0.000010574053,0.00007041714,0.0020253446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99556273,0.00012053555,0.0006842594,0.0016223212,0.0013404397,0.000669733],"domain_scores_gemma":[0.99404234,0.0022152949,0.00052166026,0.0027310636,0.00034227734,0.00014733948],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022774106,0.0005700393,0.0006146808,0.00037173173,0.0003467877,0.00039573343,0.0050795428,0.0003955773,0.0001558031],"category_scores_gemma":[0.00026708527,0.00039565575,0.00019711263,0.00043698886,0.0009060867,0.00039338964,0.0013020283,0.0013097374,0.00010010888],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003702909,0.000108601336,0.00030700653,0.00021866578,0.000052350435,0.000040833547,0.007829466,0.010692661,0.00034745372,0.08344627,0.0039942362,0.89292544],"study_design_scores_gemma":[0.00030092275,0.000492777,0.00037596334,0.001356543,0.000015225038,0.00003948355,6.2604107e-7,0.52435213,0.0062696165,0.45925125,0.006535805,0.0010096633],"about_ca_topic_score_codex":0.00010353538,"about_ca_topic_score_gemma":0.000013659602,"teacher_disagreement_score":0.89191574,"about_ca_system_score_codex":0.00019252775,"about_ca_system_score_gemma":0.0005379725,"threshold_uncertainty_score":0.99984956},"labels":[],"label_agreement":null},{"id":"W2133600728","doi":"10.1109/tsmcb.2005.848491","title":"Toward a Systems- and Control-Oriented Agent Framework","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"","keywords":"Computer science; Distributed computing; Hybrid system; Scheme (mathematics); Control (management); Intelligent control; Multi-agent system; Control system; Core (optical fiber); Control engineering; Artificial intelligence; Engineering; Telecommunications; Machine learning","score_opus":0.021097410789381668,"score_gpt":0.2352026835462921,"score_spread":0.21410527275691044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133600728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025168808,0.004183228,0.96535504,0.00082805095,0.0020580757,0.00072917173,0.00006346064,0.00038492764,0.0012292414],"genre_scores_gemma":[0.9916442,0.0005071848,0.0040749502,0.0003823248,0.00029049965,0.00012167732,0.0000036384417,0.000048073052,0.00292746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996758,0.00030812266,0.00076467654,0.0008829581,0.0005949951,0.0006912506],"domain_scores_gemma":[0.9978667,0.000444389,0.0002489613,0.00079836114,0.00015045766,0.0004911515],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005848443,0.00049644796,0.00058397505,0.00023772116,0.00039884105,0.0006598919,0.00045518487,0.0003412799,0.000018733104],"category_scores_gemma":[0.000013165865,0.00048075657,0.00011413127,0.00032882203,0.0001563082,0.00023473355,0.000013562197,0.0006114079,0.00013034152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057243044,0.0024047154,0.0035381897,0.0025659301,0.0022025378,0.00048537293,0.03305939,0.5087847,0.0013741538,0.3070343,0.018814668,0.11916355],"study_design_scores_gemma":[0.0035032744,0.0012226524,0.0005838951,0.0020352844,0.00032848975,0.0005683333,0.00066993857,0.73514277,0.0010978022,0.0005315425,0.25243875,0.0018772468],"about_ca_topic_score_codex":0.00022223813,"about_ca_topic_score_gemma":0.000024230603,"teacher_disagreement_score":0.96647537,"about_ca_system_score_codex":0.000095129624,"about_ca_system_score_gemma":0.00006353576,"threshold_uncertainty_score":0.9997644},"labels":[],"label_agreement":null},{"id":"W2134205293","doi":"10.1109/icsmc.1995.538054","title":"Driving robots through natural language","year":2002,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","keywords":"Computer science; Planner; Robot; Natural language; Artificial intelligence; Context (archaeology); Robotics; Natural language understanding; Representation (politics); Natural language processing; Spoken language; Programming language; Human–computer interaction","score_opus":0.01644093178883343,"score_gpt":0.23445466886918576,"score_spread":0.21801373708035232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134205293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018047191,0.0030421133,0.85766935,0.0034239783,0.0007469408,0.00008992052,4.539659e-7,0.0010200673,0.115959994],"genre_scores_gemma":[0.8501023,0.0000055085834,0.14094427,0.00092478073,0.0000644291,0.0000018309111,0.0000010240238,0.0000051326374,0.007950735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922884,0.000030618598,0.00010543425,0.00022879244,0.00015233914,0.0002539923],"domain_scores_gemma":[0.99947876,0.00010003591,0.0000325117,0.00032806958,0.00001754718,0.00004310463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000972367,0.00009261495,0.000084676365,0.00003053348,0.00012741276,0.00013805475,0.00048717635,0.00003575449,0.00022318201],"category_scores_gemma":[0.00002811711,0.00007592189,0.000039665916,0.0002023291,0.000013057986,0.0005043573,0.000119058524,0.00015209026,0.00035679308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035269506,0.00020797345,0.016013615,0.00007136664,0.00009696357,0.0006066033,0.05969398,0.006344985,0.0064391918,0.16600527,0.28579962,0.4587169],"study_design_scores_gemma":[0.00033544446,0.000058706035,0.001424223,0.000074203206,0.0000048252223,0.000074501106,0.00015633719,0.981608,0.0031370467,0.0010991107,0.011554003,0.0004736197],"about_ca_topic_score_codex":0.00005989607,"about_ca_topic_score_gemma":0.000010632169,"teacher_disagreement_score":0.975263,"about_ca_system_score_codex":0.0000146566335,"about_ca_system_score_gemma":0.0000058798773,"threshold_uncertainty_score":0.4585972},"labels":[],"label_agreement":null},{"id":"W2134460830","doi":"10.56748/ejse.330","title":"Computer Application to Study Engineering Projects at the Early Stages of Development","year":2003,"lang":"en","type":"article","venue":"Electronic Journal of Structural Engineering","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Coquitlam College","funders":"","keywords":"Computer science; Context (archaeology); Logical conjunction; Software engineering; Engineering design process; Management science; Qualitative reasoning; Systems engineering; Engineering; Artificial intelligence; Programming language","score_opus":0.0051687804299543234,"score_gpt":0.2025734248001629,"score_spread":0.19740464437020858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134460830","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.577864,0.0002962765,0.42156184,0.000028837645,0.00010112975,0.00012684723,1.2981106e-7,0.000018402643,0.0000025770619],"genre_scores_gemma":[0.95102334,0.0000015166212,0.048892982,0.000010459754,0.000044632514,0.000005377439,2.4864738e-7,0.000010720373,0.000010727511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878186,0.00002907628,0.00037435614,0.00014464307,0.00029461225,0.00037545283],"domain_scores_gemma":[0.99938774,0.000089863344,0.00017105657,0.0001953605,0.00009079953,0.00006516933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000604243,0.00014618285,0.00018646954,0.00013828,0.000081125574,0.000039516195,0.0004455883,0.000026925045,0.0000022478273],"category_scores_gemma":[0.00003053904,0.00010497656,0.000044915687,0.00033347873,0.000004866576,0.00017063323,0.00007481205,0.00030809297,0.0000013725494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015779135,0.000023886378,0.008416466,0.000047852012,0.00024263511,0.000011571113,0.009291496,0.938201,0.014431721,0.009780853,0.000019710908,0.019517029],"study_design_scores_gemma":[0.0040235883,0.0052245366,0.2650745,0.0005846269,0.00013936966,0.0016321797,0.00042547798,0.3835587,0.3283154,0.00044286452,0.008395129,0.0021836134],"about_ca_topic_score_codex":0.0000051186844,"about_ca_topic_score_gemma":0.0000020896919,"teacher_disagreement_score":0.5546423,"about_ca_system_score_codex":0.00019843254,"about_ca_system_score_gemma":0.00014902672,"threshold_uncertainty_score":0.428082},"labels":[],"label_agreement":null},{"id":"W2135657084","doi":"10.1109/icsmc.1997.635174","title":"A hybrid intelligent system for process operations support","year":2002,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Process (computing); Operator (biology); Case-based reasoning; Artificial intelligence; Reasoning system; Representation (politics); Knowledge representation and reasoning; Programming language","score_opus":0.03597458740271991,"score_gpt":0.26192122393997413,"score_spread":0.22594663653725422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135657084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025815482,0.000063437335,0.9878061,0.00079980376,0.00021385796,0.00023952454,0.000005331778,0.00034492667,0.007945503],"genre_scores_gemma":[0.94478536,0.0000018594903,0.05154893,0.00028512615,0.000049714472,0.000082204846,0.0000064811356,0.0000060305124,0.0032342672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992734,0.000014789186,0.00017112168,0.00022952481,0.00011283696,0.00019832523],"domain_scores_gemma":[0.9995139,0.000056657755,0.000022958546,0.00024169746,0.00009430403,0.000070453054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019075559,0.000080421196,0.00008887848,0.00003896215,0.00019362023,0.00017387893,0.0003997154,0.000020246802,0.00010509289],"category_scores_gemma":[0.000019854979,0.00006695271,0.000038383205,0.00010185798,0.000008155425,0.000240402,0.00003495613,0.000049977705,0.00017673298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015237522,0.0004600213,0.0014600267,0.0012879836,0.00013711335,0.00011282597,0.014475025,0.07338856,0.00039461887,0.49619773,0.2174674,0.19460347],"study_design_scores_gemma":[0.00010532504,0.00009661274,0.0000031432032,0.00003375852,0.0000039367646,0.00004854543,0.0000739093,0.9849078,0.0069924174,0.00016920824,0.00744014,0.0001252264],"about_ca_topic_score_codex":0.000010632672,"about_ca_topic_score_gemma":0.0000028278957,"teacher_disagreement_score":0.9422038,"about_ca_system_score_codex":0.000025655227,"about_ca_system_score_gemma":0.000033427666,"threshold_uncertainty_score":0.2730252},"labels":[],"label_agreement":null},{"id":"W2137226660","doi":"10.1017/s1047951106000400","title":"Prioritization of congenital cardiac surgical patients using fuzzy reasoning – a solution to the problem of the waiting list?","year":2006,"lang":"en","type":"article","venue":"Cardiology in the Young","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Research Council Canada","keywords":"Medicine; Expert system; Prioritization; Process (computing); Inference engine; Knowledge base; Inference; Risk analysis (engineering); Medical emergency; Computer science; Process management; Artificial intelligence","score_opus":0.009841660144232494,"score_gpt":0.22409926064986843,"score_spread":0.21425760050563594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137226660","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9810363,0.00041614144,0.014910115,0.00026954222,0.0003658479,0.0003990811,0.000012594796,0.00002045866,0.0025699364],"genre_scores_gemma":[0.9971908,0.0000028852926,0.0025997793,0.000026495474,0.00014254384,0.000013617468,0.000008224727,0.0000059335575,0.000009762629],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99820906,0.00077027443,0.00033157752,0.00020505051,0.00023113338,0.00025288065],"domain_scores_gemma":[0.99896413,0.00031564862,0.0001965402,0.0003655545,0.00014300563,0.000015147897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014906579,0.00010403933,0.00022584581,0.000052074454,0.00023584078,0.000031187865,0.0006104635,0.00008617061,2.2862345e-7],"category_scores_gemma":[0.00008718809,0.000060642953,0.000118382384,0.00047078868,0.00009833574,0.00010134412,0.00019219625,0.00019270986,7.0381316e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019139106,0.000021736983,0.9188402,0.000025735237,0.000045902594,0.000022152097,0.0036824015,0.05834406,0.0011660182,0.015895855,0.0003774186,0.001559362],"study_design_scores_gemma":[0.0018773915,0.0003871226,0.7904173,0.0008534693,0.00024954925,0.00083074626,0.0011716831,0.19314028,0.002193986,0.0067329137,0.0013001894,0.00084536773],"about_ca_topic_score_codex":0.00046276083,"about_ca_topic_score_gemma":0.000018745883,"teacher_disagreement_score":0.13479622,"about_ca_system_score_codex":0.000052319556,"about_ca_system_score_gemma":0.00006450875,"threshold_uncertainty_score":0.24729478},"labels":[],"label_agreement":null},{"id":"W2138191415","doi":"10.1109/tai.1989.65323","title":"Current and future trends in artificial intelligence architectures and programming languages","year":2003,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institute of Steel Construction","keywords":"Lisp; Computer science; Programming language; Coding (social sciences); Fifth-generation programming language; Artificial intelligence; Massively parallel; Comparison of multi-paradigm programming languages; Programming paradigm; Parallel computing; Second-generation programming language; Mathematics","score_opus":0.020607387305772686,"score_gpt":0.2923723771484947,"score_spread":0.271764989842722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138191415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34999144,0.021906953,0.6183178,0.0036648228,0.0005607628,0.0002518767,0.0000024671967,0.0004006079,0.004903305],"genre_scores_gemma":[0.93673354,0.00003762654,0.06306232,0.000057845038,0.000065267894,0.0000057376396,0.00000125238,0.000003772745,0.00003264489],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992918,0.00005824277,0.00012039707,0.00025073747,0.00008399057,0.00019484438],"domain_scores_gemma":[0.9997228,0.000061823215,0.000025175916,0.00012254332,0.000008707178,0.000058955746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024622856,0.00009381645,0.00008678134,0.00015746243,0.00006746457,0.00013706657,0.00011655969,0.000033323147,0.000011080398],"category_scores_gemma":[0.00001656563,0.00007408839,0.000012797866,0.00028466448,0.000030456275,0.00006426771,0.000044513836,0.00016101808,0.0000011215728],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014417016,0.000013225601,0.0033754823,0.000009692209,0.000001358278,0.000006743931,0.0016768002,0.000045489956,0.000013587916,0.048440713,0.000021388638,0.9463941],"study_design_scores_gemma":[0.0014309012,0.0018686693,0.12371957,0.0010144775,0.00006402303,0.0009876458,0.011001329,0.23749195,0.025210418,0.2204659,0.37142482,0.0053202836],"about_ca_topic_score_codex":0.000028095681,"about_ca_topic_score_gemma":0.00008727422,"teacher_disagreement_score":0.9410738,"about_ca_system_score_codex":0.000005493892,"about_ca_system_score_gemma":0.0000129962855,"threshold_uncertainty_score":0.3021237},"labels":[],"label_agreement":null},{"id":"W2138339216","doi":"10.1007/978-3-540-40031-8_24","title":"Using Abstraction for Planning in Sokoban","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Abstraction; Heuristic; Domain (mathematical analysis); Reduction (mathematics); Space (punctuation); Decomposition; Theoretical computer science; Artificial intelligence; Mathematical optimization; Mathematics","score_opus":0.052063391063229755,"score_gpt":0.29534679806984443,"score_spread":0.24328340700661466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138339216","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027885864,0.00049350073,0.9952553,0.00030012007,0.0016564176,0.0003903042,0.000003896461,0.000099129495,0.0015224835],"genre_scores_gemma":[0.08532162,0.000006919074,0.9129091,0.0012283733,0.00032377575,0.000010883771,0.0000074391173,0.00003996176,0.00015194745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695784,0.00003182196,0.0005193055,0.0012422589,0.00052671187,0.00072204653],"domain_scores_gemma":[0.9980931,0.00064647314,0.00031655445,0.0007013596,0.00012760643,0.00011486667],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013578812,0.00042405602,0.0004309269,0.00096324197,0.00029720113,0.0004682977,0.0014711715,0.000358903,0.000005478476],"category_scores_gemma":[0.000098020726,0.00043449743,0.00010124496,0.000482284,0.00018231822,0.0006462158,0.0002577514,0.0008103652,0.000006039572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009860258,0.000021412634,0.0004981935,0.000081197686,0.000007720306,0.00009545095,0.0010556476,0.8127994,0.00028093354,0.0060243323,0.000043428332,0.17908242],"study_design_scores_gemma":[0.00030814274,0.00010472936,0.000099634206,0.0009495014,0.000005646627,0.00007918023,3.182708e-7,0.8990635,0.00076891825,0.09621828,0.0017892416,0.00061286887],"about_ca_topic_score_codex":0.000039612565,"about_ca_topic_score_gemma":0.000031014744,"teacher_disagreement_score":0.17846955,"about_ca_system_score_codex":0.00040015622,"about_ca_system_score_gemma":0.00046326563,"threshold_uncertainty_score":0.9998107},"labels":[],"label_agreement":null},{"id":"W2139042205","doi":"10.1609/socs.v2i1.18203","title":"Faster Optimal and Suboptimal Hierarchical Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Heuristic; Incremental heuristic search; Weighting; Computer science; Beam search; Best-first search; Search algorithm; Simple (philosophy); Greedy algorithm; Local search (optimization); Function (biology); Bidirectional search; Mathematical optimization; Algorithm; Mathematics; Artificial intelligence","score_opus":0.014948621013471504,"score_gpt":0.250929431142466,"score_spread":0.23598081012899452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139042205","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9557149,0.00004738472,0.00102593,0.023714054,0.00207943,0.00018556783,0.000010107192,0.00007071694,0.017151939],"genre_scores_gemma":[0.9949095,0.00001601981,0.0038458663,0.00020499527,0.0002724831,0.000008532653,0.0000026571474,0.000013531398,0.00072638935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99771285,0.00004472802,0.00026955895,0.00047134954,0.001174358,0.00032715325],"domain_scores_gemma":[0.9986273,0.00030435415,0.00007570872,0.00017704931,0.0006885774,0.00012698284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009431372,0.00015492701,0.00017612643,0.00008789569,0.00021855667,0.00043345802,0.0014994777,0.00009743624,0.000026149371],"category_scores_gemma":[0.00015114075,0.00012523001,0.00009587989,0.0003340617,0.00015726274,0.00034502152,0.0013356768,0.00054961763,0.000012057903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002083897,0.00028067932,0.013669226,0.00006897059,0.00010085469,0.000013071832,0.0013851416,0.0005335468,0.07735037,0.9025163,0.0013276361,0.002545814],"study_design_scores_gemma":[0.0038884294,0.0008889686,0.009112708,0.0006452761,0.000030061568,0.00028105857,0.00029083737,0.11452981,0.834953,0.02312844,0.011428484,0.00082290685],"about_ca_topic_score_codex":0.000030940355,"about_ca_topic_score_gemma":3.0569197e-7,"teacher_disagreement_score":0.87938786,"about_ca_system_score_codex":0.000087756074,"about_ca_system_score_gemma":0.00014221677,"threshold_uncertainty_score":0.51067317},"labels":[],"label_agreement":null},{"id":"W2139194126","doi":"10.1109/icar.1997.620246","title":"A novel method to create intelligent sensors with learning capabilities","year":2002,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Science Foundation","keywords":"Computer science; Knowledge base; Intelligent sensor; Expert system; Artificial intelligence; Wireless sensor network; Base (topology); Real-time computing; Operator (biology); Embedded system; Control engineering; Engineering","score_opus":0.033055065345190995,"score_gpt":0.25536687606738523,"score_spread":0.22231181072219425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139194126","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0091594085,0.000042646632,0.9729448,0.0014377546,0.000042522275,0.00010258336,6.3458646e-7,0.0003399449,0.015929697],"genre_scores_gemma":[0.22081263,0.0000018862946,0.764478,0.00046217995,0.000024573763,0.000010176166,4.835223e-7,0.000009907096,0.01420012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884444,0.00009226164,0.00015744458,0.00037740383,0.0002083504,0.00032009685],"domain_scores_gemma":[0.9990721,0.00036436704,0.000040916086,0.0003082669,0.00006953259,0.00014486034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045006012,0.00014386556,0.00015420484,0.00011014592,0.00018660711,0.00016114835,0.00034736533,0.000037355876,0.00017568882],"category_scores_gemma":[0.000061995386,0.00010736985,0.000035410136,0.00034226672,0.000019176263,0.00017033535,0.00010609591,0.00018784925,0.00021571739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003225681,0.000169074,0.00502088,0.0000769266,0.00010327104,0.00006250141,0.06370361,0.7100294,0.0026777664,0.044109937,0.004472882,0.16954145],"study_design_scores_gemma":[0.00027304515,0.00067217456,0.00023361258,0.00012197288,0.0000113058195,0.0001960733,0.0011386442,0.9488562,0.010275036,0.0003353623,0.037339598,0.00054700003],"about_ca_topic_score_codex":0.00047776394,"about_ca_topic_score_gemma":0.000018461486,"teacher_disagreement_score":0.23882674,"about_ca_system_score_codex":0.000032733406,"about_ca_system_score_gemma":0.00001572352,"threshold_uncertainty_score":0.43784153},"labels":[],"label_agreement":null},{"id":"W2139841729","doi":"10.1109/nafips.2002.1018085","title":"KASER: a qualitatively fuzzy object-oriented inference engine","year":2003,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Office of Naval Research","keywords":"Computer science; Expert system; Inference engine; Bottleneck; Artificial intelligence; Object (grammar); Legal expert system; Fuzzy logic; Inference; Relation (database); Knowledge acquisition; Machine learning; Data mining","score_opus":0.023080721514873358,"score_gpt":0.2825026988602912,"score_spread":0.2594219773454179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139841729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009269594,0.00014752083,0.92203754,0.00038574144,0.00022388564,0.00008897328,0.000002454676,0.00037114476,0.06747312],"genre_scores_gemma":[0.7553072,0.0000040275604,0.24204926,0.0005019188,0.000014341535,0.000010829908,0.000003634276,0.00000644331,0.002102351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99866366,0.00020299626,0.00021686213,0.0003524227,0.00022756994,0.00033649747],"domain_scores_gemma":[0.9987948,0.0005193831,0.000066366585,0.0003893705,0.00010530567,0.00012480693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006490621,0.0001503003,0.00014778292,0.00010155155,0.00013979428,0.000095230294,0.00037974244,0.0000543342,0.000077307304],"category_scores_gemma":[0.00041317905,0.0001296699,0.000045092547,0.0005637115,0.000026785987,0.00035598833,0.00006156367,0.00016462072,0.00019359098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004831367,0.00006750127,0.0030272705,0.000020764444,0.000023377153,0.000023332444,0.0053424197,0.0007456903,0.00049180177,0.978934,0.0039371927,0.007381822],"study_design_scores_gemma":[0.0068863994,0.0027447417,0.010779046,0.00074996543,0.00006624242,0.00018851632,0.0028684433,0.29465356,0.08944922,0.22057757,0.36541602,0.005620264],"about_ca_topic_score_codex":0.00007451225,"about_ca_topic_score_gemma":0.0000071324503,"teacher_disagreement_score":0.75835645,"about_ca_system_score_codex":0.000025034791,"about_ca_system_score_gemma":0.00014198243,"threshold_uncertainty_score":0.5287785},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.30467648472560893,"score_gpt":0.46082037062180975,"score_spread":0.15614388589620082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140994944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028137768,0.00041361022,0.96894145,0.0012233914,0.00046728904,0.00007782086,0.0000021935596,0.000025243968,0.0007112438],"genre_scores_gemma":[0.9709154,0.000048373742,0.02840744,0.00009337181,0.00046775892,7.2380004e-7,0.0000011020788,0.000009017145,0.00005685362],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9967976,0.00027930102,0.0007764463,0.0002251327,0.0012749247,0.0006465612],"domain_scores_gemma":[0.9961248,0.0019330285,0.00023553628,0.00043091516,0.000999447,0.00027628013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010726635,0.00011066182,0.00020620109,0.000635125,0.0003008555,0.00027459243,0.0015203455,0.000055621134,0.00008059816],"category_scores_gemma":[0.0006793815,0.000092092574,0.00009390027,0.00092221383,0.00015010452,0.0006412326,0.00027214488,0.0009494028,0.00014747516],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009457978,0.00022885497,0.0018559174,0.000031697287,0.000032006043,0.0007242956,0.0016876216,0.001453942,0.01149055,0.02170089,0.0031775765,0.9575221],"study_design_scores_gemma":[0.0001628342,0.0018862454,0.0018790168,0.0009122363,0.000016524682,0.0006010008,0.003267954,0.1880978,0.7181883,0.051833756,0.03244727,0.0007070716],"about_ca_topic_score_codex":0.00014528549,"about_ca_topic_score_gemma":0.000052359348,"teacher_disagreement_score":0.956815,"about_ca_system_score_codex":0.00007333916,"about_ca_system_score_gemma":0.00025528393,"threshold_uncertainty_score":0.41247356},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.21885424557427835,"score_gpt":0.3932797970025497,"score_spread":0.17442555142827137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141088850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044086386,0.0001876956,0.95358497,0.00038097892,0.0002922266,0.00039635017,0.000011286643,0.0001726328,0.0008874675],"genre_scores_gemma":[0.8532366,0.0000012689711,0.14590427,0.00036549298,0.00020873954,0.000025982827,0.0000032801734,0.000014021862,0.00024030307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998219,0.0001034469,0.0003861293,0.00051242934,0.0001989091,0.0005800568],"domain_scores_gemma":[0.9987136,0.0004889029,0.000048414448,0.00040497127,0.00015042727,0.00019368505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000800703,0.00018269512,0.00021204617,0.00012416391,0.00042690255,0.00028659264,0.0008665408,0.00009039648,0.00007563254],"category_scores_gemma":[0.00008396434,0.00018070059,0.000079991136,0.00045088408,0.000050682702,0.0002937247,0.000081634804,0.00018014936,0.00026767305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016289743,0.00012772881,0.0010375568,0.000036958416,0.000023046136,0.000028195258,0.008645399,0.56218076,0.0055048154,0.03033849,0.00071573857,0.3911984],"study_design_scores_gemma":[0.00004758646,0.00020841962,0.00002459216,0.00010549211,0.0000066648513,0.000008261299,0.00014975305,0.9616513,0.022479828,0.009198193,0.005814473,0.00030543213],"about_ca_topic_score_codex":0.000116953495,"about_ca_topic_score_gemma":0.0000102455615,"teacher_disagreement_score":0.8091503,"about_ca_system_score_codex":0.00004790725,"about_ca_system_score_gemma":0.00012076962,"threshold_uncertainty_score":0.73687565},"labels":[],"label_agreement":null},{"id":"W2141163190","doi":"10.1109/eeic.1991.162607","title":"Prospects for expert systems to aid the operation and maintenance of electrical equipment","year":2002,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Power Generation","funders":"","keywords":"Switchgear; Expert system; Computer science; Field (mathematics); Maintenance engineering; Electrical equipment; Systems engineering; Software; Engineering; Software engineering; Reliability engineering; Electrical engineering; Artificial intelligence","score_opus":0.026001953873799305,"score_gpt":0.24352044379358406,"score_spread":0.21751848991978476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141163190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028850595,0.000773545,0.99084663,0.0038628525,0.00010173842,0.00047425437,6.904137e-7,0.000042370066,0.0010128806],"genre_scores_gemma":[0.9603353,0.00001266434,0.0375812,0.0007102501,0.0000381937,0.00008370283,3.5383206e-7,0.0000031283673,0.0012351839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999434,0.000022862372,0.00012895434,0.00015822839,0.000107886,0.00014805893],"domain_scores_gemma":[0.9996204,0.00011371744,0.000029749655,0.00016038399,0.000038025348,0.000037746504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024922538,0.000053483403,0.0000781251,0.000023106326,0.00009392023,0.00009099983,0.00019811517,0.000019034826,0.0000040950104],"category_scores_gemma":[0.0000318885,0.000031572552,0.00001356879,0.00009095174,0.000008624304,0.00008967676,0.000041981508,0.000030985546,0.000005037169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041445517,0.00015444752,0.0014721922,0.00012429555,0.000041415933,0.000005581263,0.015154877,0.009516329,0.012976398,0.68323356,0.22226122,0.055018235],"study_design_scores_gemma":[0.00021266194,0.00032911196,0.00007702816,0.000042654323,0.0000012893851,0.000009428835,0.00003685233,0.98665065,0.0035154857,0.00016963655,0.008873006,0.0000821788],"about_ca_topic_score_codex":0.000031660125,"about_ca_topic_score_gemma":0.0000018564217,"teacher_disagreement_score":0.97713435,"about_ca_system_score_codex":0.000018464321,"about_ca_system_score_gemma":0.000009287005,"threshold_uncertainty_score":0.12874913},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013839456721287554,"score_gpt":0.24705596994309728,"score_spread":0.23321651322180972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141312052","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008189859,0.06577384,0.14517763,0.00069842447,0.002372842,0.00038790284,0.000032946005,0.0003836788,0.78435373],"genre_scores_gemma":[0.033212632,0.09230337,0.21208781,0.00072222203,0.0033544851,0.00004271613,0.00018098988,0.00031191215,0.65778387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986112,0.000023233355,0.00035838867,0.0006241459,0.00020075034,0.00018229862],"domain_scores_gemma":[0.9989117,0.00030797973,0.00018872619,0.00038627707,0.00009488026,0.00011044656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002700819,0.000298632,0.0003899583,0.0003808684,0.00009273032,0.00018375741,0.00030658502,0.00022220773,0.0000046940263],"category_scores_gemma":[0.000008677673,0.00028060662,0.00010536629,0.00010913325,0.00013183305,0.00017864576,0.00045048536,0.00040557474,0.000007107757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024915478,0.000006305587,0.00031109506,0.00023748442,0.00007550869,0.000032730477,0.0016127053,0.000008674589,4.941903e-7,0.9117304,0.004747689,0.08123442],"study_design_scores_gemma":[0.000264375,0.00025744268,0.00095700007,0.0022277639,0.00011234373,0.00010311007,0.00000858592,0.07204878,0.00000776365,0.35038295,0.57291985,0.00070999784],"about_ca_topic_score_codex":0.000017846593,"about_ca_topic_score_gemma":0.0000067883097,"teacher_disagreement_score":0.56817216,"about_ca_system_score_codex":0.000006738408,"about_ca_system_score_gemma":0.0000594972,"threshold_uncertainty_score":0.9999646},"labels":[],"label_agreement":null},{"id":"W2142687459","doi":"10.1109/icac.2005.12","title":"Automatic Diagnosis of Performance Problems in Database Management Systems","year":2005,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Computer science; Workload; Database; Transaction processing; Database transaction; Database tuning; Database testing; Resource (disambiguation); Resource allocation; Online transaction processing; Process (computing); Resource management (computing); Database administrator; Database server; Online analytical processing; Database design; Distributed computing; Database schema; Data warehouse; View","score_opus":0.01800011011679083,"score_gpt":0.22721123983635375,"score_spread":0.2092111297195629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142687459","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5151776,0.0015834062,0.4528214,0.0009991354,0.00037798577,0.0010642242,0.0000074004993,0.00054141175,0.027427424],"genre_scores_gemma":[0.9391597,0.00007944142,0.060211487,0.000067587134,0.000014838947,0.00009134398,0.0000036344081,0.0000046600503,0.0003673025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989694,0.000042008767,0.00032433114,0.00022340544,0.00021671111,0.00022418096],"domain_scores_gemma":[0.9993212,0.00008151851,0.00008626496,0.00044759834,0.000020181875,0.00004320512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055102,0.00009634124,0.00014266804,0.0001678799,0.000039020117,0.000051970546,0.0005351933,0.000025595878,0.000028645318],"category_scores_gemma":[0.0000058935166,0.00008255537,0.000019921466,0.00036441608,0.000013165921,0.00050334993,0.00016461567,0.00007513177,0.000058474456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032856744,0.00047571468,0.26862,0.003499791,0.000057923917,0.000026819167,0.002556303,0.26124662,0.000053752687,0.04824249,0.0066702114,0.40854704],"study_design_scores_gemma":[0.00024446961,0.000043577376,0.004298293,0.00066284306,0.0000037938767,0.0000042372,0.00002824699,0.98962396,0.00034577478,0.000022408065,0.0045958776,0.00012651086],"about_ca_topic_score_codex":0.000090224894,"about_ca_topic_score_gemma":0.000015895474,"teacher_disagreement_score":0.72837734,"about_ca_system_score_codex":0.000037410908,"about_ca_system_score_gemma":0.000017756794,"threshold_uncertainty_score":0.33665106},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.015423767687501793,"score_gpt":0.21121211191907482,"score_spread":0.19578834423157304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143380318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20473965,0.0002501513,0.79432434,0.000040294,0.00046163725,0.000067397734,5.1266e-7,0.00008175619,0.000034247034],"genre_scores_gemma":[0.7321007,7.984415e-7,0.26771596,0.000015975971,0.00015125425,9.737649e-7,3.1388237e-7,0.0000131807,8.3789246e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986976,0.000038623486,0.00060338376,0.0001634934,0.00020572604,0.00029119206],"domain_scores_gemma":[0.9989959,0.0003037294,0.00030214567,0.00016772615,0.00015057753,0.00007992859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009366884,0.00015699823,0.00027146027,0.00035639756,0.00011157872,0.00017403235,0.00033620928,0.00008338422,0.0000011423023],"category_scores_gemma":[0.00015133875,0.00015645387,0.00009731824,0.00032702973,0.0000040579125,0.00033445063,0.000039448467,0.0003425818,4.889305e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031681377,0.0000060841435,0.00029419534,0.00014491516,0.0000089970745,0.0003270136,0.00079386844,0.99523634,0.00036111946,0.00024829674,0.000025892956,0.0025501172],"study_design_scores_gemma":[0.00051490363,0.00008061042,0.00004420612,0.0011462605,0.000007714387,0.002288572,0.000037034628,0.99550164,0.00014250714,0.00001660155,0.00006295315,0.00015700092],"about_ca_topic_score_codex":0.000004910361,"about_ca_topic_score_gemma":0.0000027669298,"teacher_disagreement_score":0.52736104,"about_ca_system_score_codex":0.00017564328,"about_ca_system_score_gemma":0.000041857656,"threshold_uncertainty_score":0.63800037},"labels":[],"label_agreement":null},{"id":"W2143436670","doi":"10.1109/time.1996.555700","title":"Irrelevance in uncertain temporal reasoning","year":2002,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Probabilistic logic; Relevance (law); Computer science; Markov chain; Representation (politics); Bayesian probability; Artificial intelligence; Event (particle physics); Probabilistic relevance model; Phenomenon; Knowledge representation and reasoning; Markov process; Machine learning; Theoretical computer science; Probabilistic analysis of algorithms; Mathematics; Statistics","score_opus":0.02774491118736208,"score_gpt":0.23878620441321585,"score_spread":0.21104129322585377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143436670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038164206,0.0019351465,0.8323248,0.0054968973,0.00045444575,0.00019264361,0.0000011423979,0.00079541886,0.12063531],"genre_scores_gemma":[0.8207703,0.000008273709,0.17612693,0.00044750632,0.000024477082,0.0000048006045,8.2367404e-7,0.0000044570015,0.0026124087],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991409,0.000046885332,0.00015077266,0.00025897342,0.00013686332,0.00026556058],"domain_scores_gemma":[0.99950194,0.00010482232,0.000038128805,0.00028426904,0.000016247195,0.00005457824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002757115,0.00008654081,0.000095016185,0.00007802913,0.00006680045,0.0000806614,0.00042123024,0.000040761915,0.000099671845],"category_scores_gemma":[0.00004674421,0.00007847374,0.000022712362,0.00039030844,0.000013374804,0.0003167044,0.00006919431,0.0001492997,0.00016269727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011623965,0.00023873766,0.4411924,0.00006898636,0.000027290464,0.0006477602,0.00860852,0.025366105,0.0002845295,0.18849249,0.072533965,0.26252759],"study_design_scores_gemma":[0.00024287081,0.000042190415,0.0019904533,0.000088521745,6.538999e-7,0.000016095906,0.000026103278,0.98467726,0.00013474516,0.0016443987,0.010936083,0.0002006547],"about_ca_topic_score_codex":0.00025542892,"about_ca_topic_score_gemma":0.000037103393,"teacher_disagreement_score":0.9593111,"about_ca_system_score_codex":0.000030975232,"about_ca_system_score_gemma":0.000014397024,"threshold_uncertainty_score":0.32000664},"labels":[],"label_agreement":null},{"id":"W2145001295","doi":"10.1007/978-3-642-30353-1_10","title":"Preference-Based Planning via MaxSAT","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Maximum satisfiability problem; Formalism (music); Computer science; Encoding (memory); Planner; Algorithm; Artificial intelligence","score_opus":0.04569257288611066,"score_gpt":0.24585186237095552,"score_spread":0.20015928948484485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145001295","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000057041005,0.0019738267,0.9898942,0.0005235263,0.0018866981,0.0003188883,0.000005790929,0.00038377073,0.004956255],"genre_scores_gemma":[0.3608826,0.000012684033,0.6355772,0.0022469289,0.0007705178,0.000014932115,0.000020815905,0.000061314015,0.00041298018],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953814,0.000063193205,0.00058730156,0.0015909974,0.0011785907,0.0011985289],"domain_scores_gemma":[0.99656415,0.00083884,0.0004002804,0.0016528501,0.0001971775,0.00034668023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013585553,0.00072726264,0.000612215,0.0009731645,0.00044497158,0.0006298265,0.003916848,0.0005047378,0.00006095977],"category_scores_gemma":[0.00006415118,0.0006698334,0.00015626894,0.0006071913,0.00047025512,0.0007683065,0.0009732428,0.0013663218,0.00014421387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001135937,0.000033917,0.0010844903,0.00009279425,0.00001498965,0.00012257232,0.0012251714,0.14432985,0.00014210433,0.0052597444,0.000086223146,0.84759676],"study_design_scores_gemma":[0.00041839216,0.0002619472,0.00034655313,0.0015420038,0.000018760094,0.000088865585,1.2168347e-7,0.91090035,0.0021979772,0.07653895,0.0062140636,0.0014720252],"about_ca_topic_score_codex":0.000028286233,"about_ca_topic_score_gemma":0.000011109016,"teacher_disagreement_score":0.84612477,"about_ca_system_score_codex":0.00029965854,"about_ca_system_score_gemma":0.00074874586,"threshold_uncertainty_score":0.9995753},"labels":[],"label_agreement":null},{"id":"W2145012678","doi":"","title":"Planning 3D task demonstrations of a teleoperated space robot arm","year":2008,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Space Agency; Université de Sherbrooke","funders":"","keywords":"Computer science; Task (project management); Robot; Teleoperation; Trajectory; Robotic arm; Programmer; Motion planning; Human–computer interaction; Artificial intelligence; Computer vision; Simulation; Engineering; Embedded system","score_opus":0.0293095096821512,"score_gpt":0.24321778331477534,"score_spread":0.21390827363262413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145012678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040286046,0.0002592903,0.93740654,0.00056909403,0.00009508908,0.000083567225,0.0000021229985,0.0002433409,0.021054924],"genre_scores_gemma":[0.7604892,0.000006147547,0.23855418,0.00011561352,0.000018855977,0.0000035270255,0.00000434542,0.0000044801286,0.00080363953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910724,0.00004640712,0.00021652112,0.0002320625,0.00017448368,0.00022327284],"domain_scores_gemma":[0.99932355,0.0001364499,0.000076336546,0.0002987734,0.00008663725,0.00007823132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016114407,0.0001089886,0.00014455801,0.00009890064,0.00024198648,0.000040856623,0.00036180628,0.000057037818,0.00003605587],"category_scores_gemma":[0.000033232187,0.00009646014,0.000036305646,0.00045273316,0.00004988139,0.00027783576,0.00006286266,0.00013870477,0.0000339094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046751815,0.00075273437,0.19211404,0.0001052309,0.0002217286,0.00062718126,0.02064818,0.5663116,0.06003751,0.0920303,0.03953772,0.027567035],"study_design_scores_gemma":[0.0008738199,0.0004912609,0.01214714,0.00020205851,0.000017602253,0.00044452504,0.00019892477,0.9477542,0.031536933,0.0005654488,0.0050671357,0.00070097245],"about_ca_topic_score_codex":0.00011648576,"about_ca_topic_score_gemma":0.000006181702,"teacher_disagreement_score":0.72020316,"about_ca_system_score_codex":0.000011961497,"about_ca_system_score_gemma":0.00017375556,"threshold_uncertainty_score":0.39335304},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021402230824240788,"score_gpt":0.22936309623736945,"score_spread":0.20796086541312866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145271296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057038117,0.0018155581,0.9397325,0.0003940138,0.00023497618,0.00043303974,0.000011344842,0.00016036758,0.000180114],"genre_scores_gemma":[0.9908166,0.00033022906,0.008209634,0.00010638748,0.000034039287,0.00031734694,0.0000037701018,0.000016348438,0.00016563648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866146,0.00009291817,0.0002317793,0.00036868505,0.00015756267,0.0004875807],"domain_scores_gemma":[0.99915755,0.00032231692,0.00009374914,0.0002461512,0.00005356458,0.00012669615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041542423,0.00019652139,0.00021540173,0.00013521839,0.00046121702,0.00018715159,0.00017427883,0.00012484919,0.000002595736],"category_scores_gemma":[0.0000069752564,0.00017787627,0.00006441047,0.00019840678,0.000042782212,0.0003275821,0.0000017824204,0.00025337972,0.000005998343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002131079,0.0020361312,0.008837865,0.0044365586,0.0011888966,0.000053288146,0.05223655,0.057178784,0.019688284,0.2059957,0.004046758,0.64217013],"study_design_scores_gemma":[0.003964306,0.0036043357,0.0005197497,0.0014063139,0.00019656918,0.0002024449,0.00048450677,0.84935313,0.12583545,0.003285636,0.009629203,0.0015183482],"about_ca_topic_score_codex":0.00013607676,"about_ca_topic_score_gemma":0.0000430663,"teacher_disagreement_score":0.93377846,"about_ca_system_score_codex":0.000071393595,"about_ca_system_score_gemma":0.000078164034,"threshold_uncertainty_score":0.72535837},"labels":[],"label_agreement":null},{"id":"W2145344000","doi":"10.1109/icis.2007.85","title":"Control Network Programming","year":2007,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal College of Physicians and Surgeons of Canada; Mount Royal University","funders":"","keywords":"Computer science; Programming style; Inductive programming; Programming language; Declarative programming; Programming domain; Procedural programming; Nondeterministic algorithm; Reactive programming; Programming paradigm; Functional logic programming; Functional reactive programming; Theoretical computer science","score_opus":0.008639186590412424,"score_gpt":0.2289692390747864,"score_spread":0.22033005248437396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145344000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008464376,0.00013217627,0.9844326,0.0004743245,0.0002393405,0.00008150489,7.8825884e-8,0.00039267656,0.013400895],"genre_scores_gemma":[0.6893438,2.7739395e-7,0.3091525,0.0009026845,0.00015222785,0.0000020980406,5.2971313e-7,0.0000033432539,0.00044248984],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991516,0.000019506244,0.00013365987,0.00017279437,0.00012539221,0.0003970818],"domain_scores_gemma":[0.99942034,0.00020576149,0.000037563692,0.00022069855,0.000029968221,0.000085646905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010248314,0.000069026624,0.000076215096,0.00002879055,0.00013231741,0.00010608535,0.00033986784,0.000038444516,0.00001453719],"category_scores_gemma":[0.000016719376,0.00005759977,0.000031212578,0.00023897919,0.000011758096,0.00014792707,0.00004242587,0.000096111195,0.0000628935],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013484077,0.00003295004,0.03898667,0.0000099931995,0.000026025133,0.00008649757,0.00036297273,0.0043115914,0.00007442159,0.2598159,0.013788655,0.6824908],"study_design_scores_gemma":[0.0017453298,0.00040045578,0.014382333,0.00011530232,0.000016770866,0.00008492248,0.000048486327,0.30541605,0.0008179619,0.011578377,0.66449106,0.00090294285],"about_ca_topic_score_codex":0.00003088648,"about_ca_topic_score_gemma":0.000012368348,"teacher_disagreement_score":0.68849736,"about_ca_system_score_codex":0.000011053,"about_ca_system_score_gemma":0.000021903026,"threshold_uncertainty_score":0.23488504},"labels":[],"label_agreement":null},{"id":"W2145582560","doi":"10.3233/978-1-61499-098-7-786","title":"ArvandHerd: Parallel Planning with a Portfolio","year":2012,"lang":"en","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Portfolio; Computer science; Business; Finance","score_opus":0.04187644850523137,"score_gpt":0.26169783125681245,"score_spread":0.21982138275158108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145582560","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000065087042,0.004766195,0.92662346,0.0001995854,0.00013537896,0.00040202084,0.000009810603,0.00010024514,0.06775681],"genre_scores_gemma":[0.050464477,0.0026718634,0.8429958,0.0009970319,0.0015134279,0.0010009968,0.00024353615,0.00019216507,0.099920705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984915,0.000013587095,0.00040523952,0.00053238886,0.00020166926,0.0003556011],"domain_scores_gemma":[0.9990237,0.00007020779,0.00021364907,0.0004941192,0.000050998045,0.00014732555],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002452006,0.00028772873,0.00031791136,0.0002732211,0.00021743025,0.00014483476,0.00051442976,0.0002232305,0.000029553717],"category_scores_gemma":[0.0000043695422,0.00027053338,0.00004857569,0.00014697657,0.00014961469,0.00023200666,0.000100040736,0.00044021587,0.00006461914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001564075,0.00002881681,0.0007065135,0.000026288839,0.000031644726,0.000014175635,0.0005855898,0.0015916065,0.0000025665017,0.625239,0.002414011,0.36934412],"study_design_scores_gemma":[0.000046582158,0.00009938311,0.00005209984,0.00042417573,0.000050877945,0.0000319581,0.00021517916,0.013398888,0.00009344237,0.58834916,0.3963862,0.0008520386],"about_ca_topic_score_codex":0.000017647997,"about_ca_topic_score_gemma":0.0000090113335,"teacher_disagreement_score":0.3939722,"about_ca_system_score_codex":0.00004380068,"about_ca_system_score_gemma":0.00008924632,"threshold_uncertainty_score":0.99997467},"labels":[],"label_agreement":null},{"id":"W2145850473","doi":"","title":"Qualitative & Semi-Quantitative Reasoning Techniques for Engineering Projects at Conceptual Stage","year":2003,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Qualitative reasoning; Computer science; Abstraction; Management science; Artificial intelligence; Engineering; Epistemology","score_opus":0.32200430610803715,"score_gpt":0.5632870592119252,"score_spread":0.24128275310388808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145850473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1680067,0.010756435,0.81435657,0.000107465734,0.00052075955,0.001369399,0.00009712182,0.00031265966,0.004472898],"genre_scores_gemma":[0.74602747,0.0005399764,0.25179884,0.00024599757,0.00007354864,0.0002487918,0.00001824794,0.00007525661,0.0009718452],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99692154,0.0005542589,0.00074872834,0.0006331005,0.0005585473,0.0005837969],"domain_scores_gemma":[0.9956464,0.002321086,0.00086593657,0.00047819363,0.00046704532,0.00022129377],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0036787274,0.0003771136,0.00068889966,0.0005853692,0.00044055612,0.001070634,0.0024600888,0.00012847435,0.0003339687],"category_scores_gemma":[0.0018080141,0.00035941025,0.0001747882,0.0009961727,0.00012185176,0.0029819512,0.000636243,0.00040804353,0.0000056339163],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000743911,0.00066179765,0.10068779,0.0012693558,0.0014099497,0.00023872568,0.14756013,0.012114486,0.31938192,0.3066421,0.09358356,0.015706286],"study_design_scores_gemma":[0.0022688953,0.00036507938,0.008184688,0.0050932183,0.00014097895,0.00007624147,0.007410883,0.032177776,0.80995065,0.015779737,0.11529501,0.0032568213],"about_ca_topic_score_codex":0.00016120262,"about_ca_topic_score_gemma":0.0000083984505,"teacher_disagreement_score":0.57802075,"about_ca_system_score_codex":0.00019007256,"about_ca_system_score_gemma":0.00027424362,"threshold_uncertainty_score":0.9999663},"labels":[],"label_agreement":null},{"id":"W2148101643","doi":"10.1109/icif.2010.5712112","title":"Towards a knowledge-based system prototype for aeronautical Search and Rescue operations","year":2010,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université Laval","funders":"","keywords":"Search and rescue; Computer science; Set (abstract data type); Knowledge-based systems; Artificial intelligence","score_opus":0.02977810159911743,"score_gpt":0.3007430089711532,"score_spread":0.27096490737203577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148101643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03500218,0.0000385868,0.9593854,0.0017319954,0.00022316842,0.0008747112,0.0000054076495,0.0002745601,0.0024640227],"genre_scores_gemma":[0.72069937,1.302967e-7,0.27869532,0.000071363924,0.000061033326,0.00016680222,0.0000039474917,0.000006004692,0.00029602312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991466,0.000053301996,0.00014346924,0.0002959621,0.00011749833,0.00024318497],"domain_scores_gemma":[0.99926287,0.00012146437,0.000004660636,0.00031640247,0.00016170081,0.00013291677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069749047,0.00009493119,0.00011043388,0.000067512454,0.00029140315,0.00024293431,0.00032244154,0.00008560251,0.000012494704],"category_scores_gemma":[0.00006681996,0.000074664225,0.00003027596,0.00014516992,0.00004445274,0.00014032218,0.00008348292,0.00019864057,0.00002827699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000489569,0.00012003709,0.0005062719,0.00043008578,0.000017682534,0.0000052806627,0.0010381727,0.0031228794,0.004487371,0.96160877,0.00070048834,0.027913995],"study_design_scores_gemma":[0.00036627386,0.00024272833,0.00030023177,0.000042992593,0.000003913184,0.000010682752,0.000020008776,0.9932329,0.0036680736,0.00007304606,0.0019206791,0.000118482094],"about_ca_topic_score_codex":0.00014809293,"about_ca_topic_score_gemma":0.00031464756,"teacher_disagreement_score":0.99011,"about_ca_system_score_codex":0.00001715816,"about_ca_system_score_gemma":0.00037523068,"threshold_uncertainty_score":0.30447188},"labels":[],"label_agreement":null},{"id":"W2148237494","doi":"10.1109/20.877763","title":"A paradigm for the non-routine design of electromagnetic devices using a case based reasoning approach","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Magnetics","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Set (abstract data type); Programming language","score_opus":0.03401760147417717,"score_gpt":0.2533407344642771,"score_spread":0.2193231329900999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148237494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01137492,0.00027818722,0.98728055,0.00022048705,0.00008998394,0.0005631972,0.000013856444,0.000080531776,0.000098263474],"genre_scores_gemma":[0.6079501,0.0000107890055,0.39174843,0.00011547488,0.000017678864,0.00004680046,7.875846e-7,0.000014008661,0.00009593279],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986633,0.00013022857,0.0003020951,0.00033277707,0.00020213272,0.00036945313],"domain_scores_gemma":[0.99840236,0.00085638865,0.00009825254,0.00051975774,0.000047813857,0.00007540628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004788936,0.00020086675,0.00019784416,0.00011208335,0.00048273246,0.00010477176,0.00044236795,0.000086176515,0.000050969713],"category_scores_gemma":[0.0000053836343,0.00016518288,0.00011081713,0.0005024332,0.000069693306,0.000114188115,0.0000011900454,0.0002261053,0.0000034798709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008367916,0.00014337331,0.0000062591425,0.000054049066,0.00002711768,0.000024633975,0.00061818305,0.9546598,0.00074829604,0.00007859092,0.00003604372,0.043519955],"study_design_scores_gemma":[0.00060483086,0.0008417645,0.00001812885,0.00006018662,0.00011528442,0.00030223184,0.00002615709,0.99334973,0.0042906706,0.00008068861,0.000118991484,0.0001913326],"about_ca_topic_score_codex":0.00014571809,"about_ca_topic_score_gemma":0.000009986383,"teacher_disagreement_score":0.5965752,"about_ca_system_score_codex":0.000029672969,"about_ca_system_score_gemma":0.00015543113,"threshold_uncertainty_score":0.6735962},"labels":[],"label_agreement":null},{"id":"W2150932684","doi":"10.1142/s0219622013500284","title":"FROM ADAPTATION-GUIDED RETRIEVAL TO REUSE-GUIDED RETRIEVAL: APPLICATION TO CASE RETRIEVAL NET MEMORY MODEL","year":2013,"lang":"en","type":"article","venue":"International Journal of Information Technology & Decision Making","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; University of Texas at San Antonio","keywords":"Computer science; Reuse; Information retrieval; Adaptation (eye); Adaptability; Inference; Document retrieval; Similarity (geometry); Case-based reasoning; Data retrieval; Data mining; Artificial intelligence","score_opus":0.022262669296825494,"score_gpt":0.3072882632174803,"score_spread":0.28502559392065485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150932684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24222544,0.00004305253,0.7482119,0.007931665,0.00083975046,0.0003566114,0.000018820943,0.00018797313,0.0001847959],"genre_scores_gemma":[0.58793384,0.0000070869173,0.41003844,0.0018307912,0.00013804926,0.000005851738,0.000011460608,0.00001182359,0.000022637274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99577975,0.00006348553,0.0019908354,0.000335854,0.0014841118,0.00034594286],"domain_scores_gemma":[0.9932907,0.00059020554,0.0014419969,0.00089307554,0.0035630458,0.0002209681],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014906611,0.00027387516,0.00036401895,0.0025127619,0.00022937082,0.00064895157,0.003243096,0.00034794264,0.000057729274],"category_scores_gemma":[0.0047550905,0.0002638421,0.0001395766,0.0015708953,0.000042388016,0.0035762957,0.00083258416,0.00061154435,0.00044034145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007175172,0.00007589282,0.0002787254,0.000011040388,0.00018826358,0.0002683102,0.007558735,0.6199147,0.005910185,0.00641243,0.048735395,0.3099288],"study_design_scores_gemma":[0.0010585034,0.0002145044,0.00023157353,0.00042093373,0.00002139933,0.002283397,0.00074748346,0.91442555,0.0064249737,0.07066405,0.0031195027,0.00038814126],"about_ca_topic_score_codex":0.000059589038,"about_ca_topic_score_gemma":0.0000035750531,"teacher_disagreement_score":0.34570843,"about_ca_system_score_codex":0.0004565276,"about_ca_system_score_gemma":0.00031465778,"threshold_uncertainty_score":0.9999814},"labels":[],"label_agreement":null},{"id":"W2151413202","doi":"10.1017/s0269888906000671","title":"Image processing in case-based reasoning","year":2005,"lang":"en","type":"article","venue":"The Knowledge Engineering Review","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Image processing; Landmark; Variety (cybernetics); Artificial intelligence; Image (mathematics); Case-based reasoning; Computer vision; Spatial intelligence; Digital image processing","score_opus":0.013344198571186834,"score_gpt":0.2601711179524967,"score_spread":0.24682691938130988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151413202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011432535,0.4145001,0.5787368,0.0025722454,0.0001474547,0.0003565059,8.022387e-7,0.0004996545,0.0020432184],"genre_scores_gemma":[0.5031696,0.0023722185,0.49245098,0.0009955073,0.00043591615,0.00016508157,0.0000050149765,0.00007346741,0.00033219994],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891704,0.00007988779,0.00030225984,0.000255186,0.00010637193,0.0003392699],"domain_scores_gemma":[0.99918234,0.00017101063,0.00006954474,0.00045967582,0.00005183147,0.0000655952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013628091,0.00018361425,0.00024779243,0.0000893146,0.0001143759,0.00009764284,0.00059795065,0.000037251117,0.000011546136],"category_scores_gemma":[0.00019799461,0.000137132,0.00006405343,0.00073312124,0.000015356414,0.00028684863,0.0000909878,0.00032261704,0.00011401381],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020947175,0.00008617845,0.0001538458,0.0075714174,0.000010964678,0.000469665,0.0019365485,0.019607503,0.0003228901,0.0019575919,0.0032088812,0.96467245],"study_design_scores_gemma":[0.00013340342,0.000012056681,0.00007213322,0.0097076,0.000013001471,0.00034978965,0.0000028541751,0.9332703,0.00009487643,0.000008362977,0.05611526,0.00022036488],"about_ca_topic_score_codex":0.000007096301,"about_ca_topic_score_gemma":0.0000082103725,"teacher_disagreement_score":0.964452,"about_ca_system_score_codex":0.00008151732,"about_ca_system_score_gemma":0.0000992128,"threshold_uncertainty_score":0.55920804},"labels":[],"label_agreement":null},{"id":"W2152601355","doi":"","title":"Downward Path Preserving State Space Abstractions (Extended Abstract)","year":2009,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Regina","funders":"","keywords":"Spurious relationship; Abstraction; State space; Property (philosophy); State (computer science); Heuristic; Path (computing); Space (punctuation); Computer science; Algorithm; Function (biology); Theoretical computer science; Mathematics; Artificial intelligence; Programming language","score_opus":0.014018503272658281,"score_gpt":0.24820265274524192,"score_spread":0.23418414947258365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152601355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039747525,0.00027218525,0.76625186,0.009151429,0.0005018763,0.00027683782,0.00000994884,0.0016126937,0.18217565],"genre_scores_gemma":[0.9108135,0.000015532678,0.084060475,0.00057884597,0.000056079756,0.000004031279,0.0000049865334,0.00000712259,0.004459438],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99862397,0.00002746124,0.00024719164,0.0003890967,0.0002840796,0.00042821624],"domain_scores_gemma":[0.9989282,0.00011575457,0.00010951458,0.0006029945,0.0000762358,0.00016729439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003690016,0.00016647883,0.00014018503,0.00009806002,0.00026027748,0.00033560506,0.0006866897,0.00006186594,0.00017480446],"category_scores_gemma":[0.000036222933,0.00014843032,0.000068077265,0.00022206643,0.000014559546,0.0008441726,0.00008162045,0.00029521578,0.00029821997],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006209886,0.0008752921,0.0031807004,0.00010915265,0.00010193265,0.0005929065,0.0074988278,0.05425057,0.018227378,0.10805679,0.20761864,0.59942573],"study_design_scores_gemma":[0.0016247041,0.00081599975,0.48574242,0.00033319762,0.000034958186,0.00018965953,0.00028851835,0.23969981,0.013567337,0.13339522,0.12203689,0.0022712916],"about_ca_topic_score_codex":0.00017991464,"about_ca_topic_score_gemma":0.000018023797,"teacher_disagreement_score":0.871066,"about_ca_system_score_codex":0.000034397202,"about_ca_system_score_gemma":0.00009147077,"threshold_uncertainty_score":0.6052813},"labels":[],"label_agreement":null},{"id":"W2153300375","doi":"10.1109/ccece.2006.277350","title":"A Novel Earthquake Mitigation Information expert System: EMIS","year":2006,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Knowledge base; Computer science; Knowledge-based systems; Expert system; Process (computing); Emergency management; Knowledge representation and reasoning; Knowledge acquisition; Knowledge extraction; Data science; Knowledge engineering; Information system; Knowledge management; Risk analysis (engineering); Data mining; Engineering; Artificial intelligence","score_opus":0.007360040886875254,"score_gpt":0.19653032827905403,"score_spread":0.18917028739217878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153300375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010069209,0.000037367103,0.95893264,0.00050254655,0.00017136542,0.000078201854,0.0000018775357,0.0004405932,0.029766172],"genre_scores_gemma":[0.8866815,3.8747604e-7,0.11247687,0.00034607362,0.00006587941,0.000011010422,0.000025826226,0.0000025089785,0.0003899718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931955,0.000015787755,0.00021108642,0.0001113316,0.00018797198,0.00015426152],"domain_scores_gemma":[0.99956393,0.000043622676,0.00007553631,0.00021287739,0.0000683565,0.000035694844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019724671,0.00007660151,0.0000684096,0.00007496307,0.0001263114,0.00021606477,0.00021850268,0.00004923903,0.000008631587],"category_scores_gemma":[0.000009704993,0.00006802115,0.00002857288,0.00019253258,0.000008353668,0.0011472723,0.000036264544,0.00005335141,0.00015717067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012235886,0.00009650247,0.0044632154,0.00025302407,0.000025117086,0.000009387494,0.0057900185,0.016993959,0.00909424,0.7648611,0.08816356,0.110237636],"study_design_scores_gemma":[0.00075559394,0.00006918003,0.009926914,0.0001977972,0.000004114796,0.00008367467,0.0002765131,0.9370641,0.009108888,0.0005428656,0.04152997,0.00044039477],"about_ca_topic_score_codex":0.0008324302,"about_ca_topic_score_gemma":0.000012750424,"teacher_disagreement_score":0.9200701,"about_ca_system_score_codex":0.000032576103,"about_ca_system_score_gemma":0.000036668363,"threshold_uncertainty_score":0.2773822},"labels":[],"label_agreement":null},{"id":"W2153410625","doi":"10.1111/1468-0394.00140","title":"Developing a neural network approach for intelligent scheduling in GUESS","year":2000,"lang":"en","type":"article","venue":"Expert Systems","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Maryland Industrial Partnerships","keywords":"Computer science; Scheduling (production processes); Artificial neural network; Dynamic priority scheduling; Fair-share scheduling; Two-level scheduling; Artificial intelligence; Machine learning; Mathematical optimization; Schedule; Operating system","score_opus":0.055100280958159734,"score_gpt":0.2865697383176091,"score_spread":0.2314694573594494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153410625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0109176645,0.0047324756,0.9820953,0.00022226902,0.000703325,0.0004223923,6.5359814e-7,0.00017554252,0.00073037355],"genre_scores_gemma":[0.6744572,0.000024295228,0.32385805,0.00035014702,0.000594376,0.00025294517,0.000012350569,0.000018756618,0.0004318707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845284,0.00011417405,0.00037613112,0.00040917532,0.00016494966,0.00048272093],"domain_scores_gemma":[0.999361,0.00015331752,0.00006695885,0.00031531404,0.000034734094,0.00006870297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006875575,0.0001609382,0.00024039127,0.00006885478,0.00018057344,0.00022366906,0.0005978097,0.000085214495,0.0000037046],"category_scores_gemma":[0.000017745027,0.0001477326,0.000053858857,0.00034944768,0.000012270842,0.00023157742,0.00005588502,0.0001307403,0.000014058314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017688359,0.000025205865,0.0015170153,0.0000912664,0.000014830008,0.000010211313,0.0055990983,0.9444637,0.0000201612,0.00907858,0.0012963861,0.037865903],"study_design_scores_gemma":[0.00017994088,0.000028284194,0.000040647312,0.00024976453,7.6805316e-7,0.000021803064,0.00019729673,0.9826979,0.00005282462,0.00009181491,0.016215418,0.00022355895],"about_ca_topic_score_codex":0.00026850795,"about_ca_topic_score_gemma":0.00000387756,"teacher_disagreement_score":0.6635395,"about_ca_system_score_codex":0.00009093581,"about_ca_system_score_gemma":0.0000655566,"threshold_uncertainty_score":0.60243607},"labels":[],"label_agreement":null},{"id":"W2155932428","doi":"10.5772/5764","title":"Software Systems for Robotics An Applied Research Perspective","year":2006,"lang":"en","type":"article","venue":"International Journal of Advanced Robotic Systems","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Unmanned ground vehicle; Computer science; Robotics; Perspective (graphical); Focus (optics); Artificial intelligence; Software; Set (abstract data type); Human–computer interaction; Software development; Robot; Software engineering; Operating system","score_opus":0.04194360767545796,"score_gpt":0.3460281779821268,"score_spread":0.30408457030666886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155932428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009319495,0.0024930842,0.9894942,0.0005862621,0.005408784,0.00038700696,0.000008725956,0.00007118878,0.00061879284],"genre_scores_gemma":[0.83877814,0.000020880387,0.15875694,0.000027640228,0.0018488712,0.000031632517,0.000010739621,0.000028404094,0.00049677934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970373,0.00018827229,0.0007771148,0.00033864458,0.0012669212,0.0003917724],"domain_scores_gemma":[0.99433863,0.00091703027,0.0006317934,0.00032090637,0.0036559948,0.00013565096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018356353,0.00017818034,0.00035919237,0.0004997208,0.00020865176,0.0005899554,0.0016770209,0.00009864717,0.0000011202848],"category_scores_gemma":[0.00026819162,0.00015746015,0.000115099785,0.00027621427,0.000055951066,0.0007491132,0.00009703263,0.0003642367,0.000008530481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056282566,0.00007753974,0.0001908588,0.000027984379,0.00006786201,0.000046215508,0.000326624,0.81911373,0.00040068978,0.17808664,0.0009504231,0.0006551379],"study_design_scores_gemma":[0.004935677,0.0016611253,0.0009191271,0.0020350418,0.00005900651,0.0021853799,0.0069280467,0.9211077,0.00046789565,0.049436357,0.009267442,0.0009971802],"about_ca_topic_score_codex":0.00019259632,"about_ca_topic_score_gemma":0.0000055587843,"teacher_disagreement_score":0.83784616,"about_ca_system_score_codex":0.0005688283,"about_ca_system_score_gemma":0.0002835589,"threshold_uncertainty_score":0.64210385},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.14836674078168158,"score_gpt":0.40885550094117146,"score_spread":0.26048876015948985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155992093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0644659,0.00011211826,0.9321118,0.0017302854,0.0005669022,0.000066586275,2.4428599e-7,0.0000252639,0.0009208857],"genre_scores_gemma":[0.9780781,0.000037774647,0.021110889,0.00006272644,0.00061774935,0.0000022929357,2.611667e-7,0.000008068331,0.000082116385],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9967772,0.000630787,0.000664647,0.00023692976,0.0011566812,0.00053377205],"domain_scores_gemma":[0.9971391,0.0010824482,0.00021996687,0.00038579598,0.0009297839,0.00024288383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076390626,0.00010672746,0.00021850699,0.00042160574,0.00032191773,0.0003240113,0.0012708462,0.00008999485,0.00006392901],"category_scores_gemma":[0.0013322717,0.00008683373,0.00010925523,0.000775842,0.0001262197,0.00054190704,0.00018111807,0.0008169856,0.00023551854],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009908002,0.00013250817,0.000053894288,0.000019010053,0.000015977552,0.000039786235,0.002385088,0.0051722485,0.086939424,0.08648396,0.0010772669,0.8175818],"study_design_scores_gemma":[0.00004287922,0.001118846,0.000040299205,0.00018388311,0.0000035897908,0.00004278234,0.00034597435,0.19667897,0.71800715,0.07924316,0.0041247043,0.00016775978],"about_ca_topic_score_codex":0.000027096006,"about_ca_topic_score_gemma":0.0000057117213,"teacher_disagreement_score":0.91361225,"about_ca_system_score_codex":0.00006126242,"about_ca_system_score_gemma":0.00027827252,"threshold_uncertainty_score":0.35494414},"labels":[],"label_agreement":null},{"id":"W2156215722","doi":"10.1109/ccece.1999.808222","title":"A case-based expert system for power system restoration","year":2003,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Blackout; Expert system; Computer science; Graphical user interface; Electric power system; Legal expert system; Interface (matter); Object (grammar); Simple (philosophy); Rule-based system; Knowledge-based systems; Software engineering; Artificial intelligence; Power (physics); Programming language","score_opus":0.02868219805455301,"score_gpt":0.24646005930018514,"score_spread":0.21777786124563212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156215722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021309995,0.00013198039,0.98458606,0.00011617698,0.0006494286,0.00029880638,0.000002417682,0.00063128275,0.011452819],"genre_scores_gemma":[0.8436271,9.381385e-8,0.15589538,0.00016184781,0.000026772514,0.00007487309,0.000002702182,0.0000092592145,0.00020198889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893594,0.00013135865,0.0002225825,0.00030936569,0.00015734692,0.0002434332],"domain_scores_gemma":[0.9990123,0.00028946405,0.0000840774,0.0004428999,0.00008584956,0.00008544075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006783104,0.00012330688,0.00013546621,0.00008245552,0.00027133757,0.00017999278,0.0002146132,0.00007593781,0.000005203736],"category_scores_gemma":[0.000051925446,0.00010491438,0.000060692128,0.0001914082,0.000008450416,0.00021609917,0.0000127139,0.000054034455,0.000031716067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003091002,0.00006027665,0.00026780987,0.00057449524,0.0000326952,0.0011371616,0.0020355885,0.003970341,0.00089685817,0.96757174,0.021443471,0.0019786416],"study_design_scores_gemma":[0.0014713249,0.00042645572,0.000005962658,0.00044732785,0.000012945537,0.0027248415,0.0018663444,0.90804106,0.016956877,0.00008587845,0.06730833,0.00065266824],"about_ca_topic_score_codex":0.00006531038,"about_ca_topic_score_gemma":0.0000059950435,"teacher_disagreement_score":0.96748585,"about_ca_system_score_codex":0.0001409562,"about_ca_system_score_gemma":0.00013267307,"threshold_uncertainty_score":0.42782843},"labels":[],"label_agreement":null},{"id":"W2156622941","doi":"10.7939/r3fm9h","title":"Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement - Extended Version","year":2010,"lang":"en","type":"article","venue":"University of Alberta Library","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Satisficing; Plan (archaeology); Computer science; Quality (philosophy); Operations research; Graph; Mathematical optimization; Mathematics; Artificial intelligence; Theoretical computer science","score_opus":0.020181286645927794,"score_gpt":0.22022600402057252,"score_spread":0.20004471737464471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156622941","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7721979,0.000034833985,0.21675837,0.0049070274,0.0005744219,0.0005085783,0.000035857418,0.00017931263,0.0048037013],"genre_scores_gemma":[0.9548824,0.00001973275,0.043801084,0.00009600664,0.000044577504,3.4864425e-7,0.00013582264,0.000007782841,0.0010122443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993551,0.00002546643,0.00007705045,0.00025463183,0.00012569122,0.00016210046],"domain_scores_gemma":[0.9993665,0.00024061678,0.00007561665,0.00019741461,0.000025673506,0.00009413523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009912274,0.00009041488,0.00009689942,0.00015995314,0.00023436655,0.000050554514,0.0003366785,0.000070155096,0.0000387203],"category_scores_gemma":[0.000008267912,0.00010130149,0.00004343707,0.00013061376,0.000045183628,0.0012467611,0.00016548173,0.00014449141,0.0000036602246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001345144,0.00073480303,0.029149484,0.00060192397,0.00034222158,0.000056383975,0.040577497,0.00070611615,0.0512491,0.2002999,0.027164752,0.64777267],"study_design_scores_gemma":[0.009067193,0.0030004198,0.03837464,0.00024729955,0.0001267243,0.000040321356,0.004006621,0.82707775,0.063561425,0.018192342,0.03504511,0.0012601685],"about_ca_topic_score_codex":0.0004194886,"about_ca_topic_score_gemma":0.00006255477,"teacher_disagreement_score":0.8263716,"about_ca_system_score_codex":0.0000074098953,"about_ca_system_score_gemma":0.000060942933,"threshold_uncertainty_score":0.41309547},"labels":[],"label_agreement":null},{"id":"W2157688009","doi":"10.1109/igarss.1997.615219","title":"Automated forest inventory update with SEIDAM","year":2002,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Victoria; Natural Resources Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Natural Resources Canada; National Aeronautics and Space Administration","keywords":"Computer science; Component (thermodynamics); Software; Process (computing); Terrain; Database; Set (abstract data type); Software engineering; Data mining; World Wide Web; Operating system","score_opus":0.01683866906268664,"score_gpt":0.20838796685860478,"score_spread":0.19154929779591814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157688009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08226902,0.00043981805,0.80477774,0.0050901407,0.00033305679,0.00024152831,0.0000021872468,0.0075439047,0.09930263],"genre_scores_gemma":[0.9341299,0.000004259528,0.061168976,0.0012698012,0.00002664222,0.000006197246,0.0000033524789,0.000008900644,0.0033819957],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992355,0.000030155146,0.00010555372,0.0002254988,0.00016197731,0.0002413213],"domain_scores_gemma":[0.99946505,0.000028939769,0.000042552005,0.00034167827,0.000032174128,0.000089628316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011914727,0.00009920533,0.000084435356,0.00006194933,0.00011202082,0.000120015866,0.00041584225,0.000037148067,0.00013672678],"category_scores_gemma":[0.000006101426,0.00007305207,0.000019922743,0.00026350794,0.000023323571,0.0003169091,0.00006690594,0.00009133873,0.000498329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001524727,0.00024209698,0.14200462,0.00007988302,0.00011200896,0.00040784338,0.0030770374,0.024506379,0.0001503566,0.10948497,0.69310087,0.026818711],"study_design_scores_gemma":[0.00021131997,0.000076928714,0.0013590385,0.000026637244,0.000002698873,0.000027575426,0.0000058351693,0.98115,0.000112049674,0.00029170304,0.01658461,0.00015161601],"about_ca_topic_score_codex":0.000041457428,"about_ca_topic_score_gemma":0.000024795512,"teacher_disagreement_score":0.9566436,"about_ca_system_score_codex":0.000015506324,"about_ca_system_score_gemma":0.000017699136,"threshold_uncertainty_score":0.6405178},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08500217590443197,"score_gpt":0.2862445155951895,"score_spread":0.2012423396907575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158118484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00969482,0.000085451866,0.98748136,0.0001876958,0.00056011166,0.00014816051,0.000007509776,0.00027413105,0.0015607903],"genre_scores_gemma":[0.9624804,0.0000065479817,0.03621656,0.0001081201,0.00006791179,0.000030808667,0.000005762988,0.000011326688,0.0010725227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878675,0.000061015206,0.0002605595,0.00034998523,0.00012865533,0.00041304796],"domain_scores_gemma":[0.99912727,0.0002916688,0.0000999226,0.00026869596,0.00011927913,0.000093159535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005558223,0.0001252299,0.00011847804,0.00009099769,0.00046506233,0.00015233514,0.00044420778,0.000043353335,0.00007660942],"category_scores_gemma":[0.00023236492,0.00012278165,0.000065014894,0.00029435725,0.000033379114,0.0002852925,0.00009302125,0.00018429621,0.00041776724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010492836,0.0003061695,0.0051410357,0.00006629466,0.0000613257,0.00003777775,0.028798481,0.0085067125,0.0010113012,0.57609993,0.0019869953,0.37787905],"study_design_scores_gemma":[0.000058706246,0.0009328905,0.00042311518,0.000083664214,0.000024448134,0.00001288659,0.0014609527,0.69603735,0.0345079,0.24151635,0.02428939,0.00065236783],"about_ca_topic_score_codex":0.000109471934,"about_ca_topic_score_gemma":0.00006243891,"teacher_disagreement_score":0.9527856,"about_ca_system_score_codex":0.000016194612,"about_ca_system_score_gemma":0.000054138854,"threshold_uncertainty_score":0.5369692},"labels":[],"label_agreement":null},{"id":"W2158325819","doi":"","title":"Intelligent Rover Execution for Detecting Life in the Atacama Desert","year":2006,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Software deployment; Computer science; Architecture; Field (mathematics); Plan (archaeology); Planetary exploration; Supervisory control; Control (management); Mission control center; Systems engineering; Engineering; Astrobiology; Software engineering; Geology; Artificial intelligence; Geography","score_opus":0.02589207535253851,"score_gpt":0.2535826154358901,"score_spread":0.2276905400833516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158325819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041726697,0.000117281226,0.95405924,0.0012129238,0.000110384986,0.00017033849,5.291101e-7,0.00007967382,0.0025229035],"genre_scores_gemma":[0.9607303,0.0000010551599,0.03814291,0.0007743896,0.00008064031,0.000024370243,0.0000029872945,0.000003753802,0.0002395644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992789,0.000047785496,0.00016751332,0.00018032137,0.000119167344,0.00020631979],"domain_scores_gemma":[0.99930876,0.00038357693,0.000043427255,0.00021689023,0.00002622088,0.000021148235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006995142,0.000070923685,0.00006482997,0.000051368013,0.00012908016,0.00013559614,0.00041947103,0.00003815207,0.000005001193],"category_scores_gemma":[0.00008287873,0.00004824553,0.00003688934,0.0002076252,0.000008010438,0.00018526168,0.00004691052,0.00009286858,0.000014141889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093326955,0.0003694564,0.07693226,0.0001741533,0.00003640469,0.00003841003,0.009907497,0.07722987,0.0025403667,0.48125792,0.07397143,0.2774489],"study_design_scores_gemma":[0.00045813748,0.00017407481,0.009955166,0.00007627994,0.0000065170343,0.00001635366,0.00033132586,0.934622,0.009426365,0.025902592,0.018684948,0.0003462422],"about_ca_topic_score_codex":0.00061247614,"about_ca_topic_score_gemma":0.00016697824,"teacher_disagreement_score":0.9190036,"about_ca_system_score_codex":0.000025275038,"about_ca_system_score_gemma":0.000032648313,"threshold_uncertainty_score":0.19673955},"labels":[],"label_agreement":null},{"id":"W2159242099","doi":"10.1109/robot.1997.606799","title":"Experimental task analysis","year":2002,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Task (project management); Computer science; Implementation; Set (abstract data type); Strengths and weaknesses; Task analysis; Artificial intelligence; Software engineering; Programming language; Systems engineering; Engineering","score_opus":0.021501305357638906,"score_gpt":0.23266820079613187,"score_spread":0.21116689543849296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159242099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019497203,0.0005824182,0.9123326,0.0006776124,0.00008994977,0.000030050234,6.3126214e-7,0.0002944884,0.06649504],"genre_scores_gemma":[0.9543026,0.0000010580854,0.041679773,0.0004248037,0.000016851141,0.0000025489821,0.0000011425934,0.00000187904,0.0035693394],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944586,0.00002133014,0.000083563056,0.00018747135,0.00011885837,0.00014294458],"domain_scores_gemma":[0.9996008,0.00003354628,0.00002131958,0.0002783029,0.000010540035,0.000055455446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007543495,0.000058390502,0.00007853665,0.00010124668,0.00008324577,0.00009145032,0.00032665159,0.000021524242,0.0007781204],"category_scores_gemma":[0.000003623903,0.000049686845,0.0000653151,0.0005565951,0.000009092669,0.00017578703,0.00006460886,0.00004399822,0.00031149172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009897932,0.001269491,0.1246229,0.000024282306,0.002203852,0.00035248278,0.03294946,0.024935162,0.03015778,0.25090766,0.41267177,0.11989527],"study_design_scores_gemma":[0.00014180187,0.000058485824,0.00094608404,0.0000028869679,0.000025938587,0.0000051487186,0.00004528528,0.9786664,0.010733158,0.00013255113,0.0090442905,0.0001979598],"about_ca_topic_score_codex":0.00003836683,"about_ca_topic_score_gemma":0.0000013822341,"teacher_disagreement_score":0.95373124,"about_ca_system_score_codex":0.000011539043,"about_ca_system_score_gemma":0.0000028523255,"threshold_uncertainty_score":0.8519873},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.1124290222437872,"score_gpt":0.40916905857847136,"score_spread":0.29674003633468415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160927913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116004676,0.0004403629,0.87398,0.008454273,0.0002131702,0.00017761582,0.0000011699434,0.000085422405,0.0006433482],"genre_scores_gemma":[0.892694,0.00001962502,0.10629743,0.00025895511,0.0005371549,0.000004538226,5.598604e-7,0.000023888306,0.0001638365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99554974,0.0004587042,0.00097522733,0.000398743,0.0016531295,0.00096443295],"domain_scores_gemma":[0.99666876,0.00090302975,0.00031331842,0.00046876393,0.0012299289,0.00041619033],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.006285138,0.00022135078,0.0003589571,0.00068698183,0.0006320009,0.0010837514,0.0016751838,0.00013922082,0.000109418594],"category_scores_gemma":[0.000706595,0.00016785978,0.00011605611,0.0012163506,0.00023514636,0.0012597106,0.00027314783,0.0018798403,0.00019945059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003381265,0.00026265287,0.0015450768,0.00008248341,0.00009123896,0.0007465443,0.0079602795,0.0741058,0.01691009,0.024541525,0.0016240194,0.87179214],"study_design_scores_gemma":[0.00015039735,0.0021743283,0.00020017567,0.0006316257,0.000016759624,0.00055854145,0.0015120041,0.8741157,0.10434011,0.012051843,0.0037544477,0.00049403415],"about_ca_topic_score_codex":0.000051793835,"about_ca_topic_score_gemma":0.000019691059,"teacher_disagreement_score":0.87129813,"about_ca_system_score_codex":0.00020848801,"about_ca_system_score_gemma":0.0009604084,"threshold_uncertainty_score":0.9999532},"labels":[],"label_agreement":null},{"id":"W2161019132","doi":"10.1109/tai.1990.130317","title":"Specification of expert systems","year":2002,"lang":"en","type":"article","venue":"[1990] Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Blueprint; System requirements specification; Computer science; Software engineering; Formal specification; Software requirements specification; Focus (optics); Programming language; Algebraic specification; Functional specification; Specification language; Software; Software development; Software design; Engineering; Software construction","score_opus":0.18394525129376613,"score_gpt":0.31005084539909045,"score_spread":0.12610559410532432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161019132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05628485,0.0001942118,0.8994027,0.0053630555,0.005408874,0.0012467172,0.00008037266,0.00016735905,0.03185191],"genre_scores_gemma":[0.9939317,0.00005062443,0.005056299,0.00009714441,0.00022992301,0.000049959614,0.0000029222404,0.00001222381,0.00056917366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99795085,0.000012606233,0.00076219445,0.0004118988,0.0006037586,0.0002587077],"domain_scores_gemma":[0.99751,0.00032954817,0.00065470824,0.0002604068,0.001181835,0.0000635093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061203714,0.00019148402,0.00023836298,0.00018037402,0.00013904623,0.00034111904,0.0021051292,0.00010816032,0.000058516613],"category_scores_gemma":[0.00036744855,0.00015474236,0.0001522351,0.0003248692,0.00014752512,0.000898445,0.00010202543,0.0001834357,0.000028682278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054016356,0.00013760471,0.000056245415,0.000046315297,0.000032386888,2.1576535e-7,0.0012681488,0.0006451817,0.04850689,0.9040505,0.0017576702,0.043444805],"study_design_scores_gemma":[0.0000607631,0.00026295078,0.00006243842,0.00047953203,0.000008397513,0.000006604613,0.0006223537,0.45999584,0.50701463,0.027920948,0.0033141465,0.00025137764],"about_ca_topic_score_codex":0.000059272956,"about_ca_topic_score_gemma":0.0000030772073,"teacher_disagreement_score":0.93764687,"about_ca_system_score_codex":0.00006659487,"about_ca_system_score_gemma":0.000032353713,"threshold_uncertainty_score":0.631021},"labels":[],"label_agreement":null},{"id":"W2161241946","doi":"10.1016/j.artint.2010.06.002","title":"The computational complexity of avoiding spurious states in state space abstraction","year":2010,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spurious relationship; Abstraction; State space; Property (philosophy); Computer science; Path (computing); Heuristic; State (computer science); Space (punctuation); Computational complexity theory; Theoretical computer science; Algorithm; Mathematics; Programming language; Artificial intelligence","score_opus":0.054278770289771516,"score_gpt":0.30044245351503396,"score_spread":0.24616368322526244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161241946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39548746,0.000032105105,0.6020415,0.0016202199,0.0004530069,0.00009353962,0.000004198391,0.000048661444,0.00021933399],"genre_scores_gemma":[0.9792128,0.000009612818,0.02067797,0.000038985927,0.000028201677,0.0000038698745,0.000004059436,0.000004843062,0.0000196076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988058,0.00008967411,0.00039597362,0.00022454285,0.00023496932,0.00024900725],"domain_scores_gemma":[0.9983435,0.0010647599,0.00017527037,0.00024782392,0.00011964788,0.00004895405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010979495,0.00009688202,0.00010764775,0.00007778637,0.00034814252,0.00015288964,0.000492522,0.00003786603,0.000011308587],"category_scores_gemma":[0.00016876613,0.000081018086,0.00003459114,0.00032897462,0.00023993691,0.0002482974,0.000079044454,0.0004454908,0.000049079255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036456364,0.00009380145,0.002174189,0.000016146507,0.000010219586,0.000012634385,0.0050995685,0.26066157,0.0074898084,0.5944145,0.00009806975,0.12989303],"study_design_scores_gemma":[0.000012940963,0.000032549797,0.0020968972,0.00001706712,9.4779347e-7,0.00000505317,0.00017394942,0.49980432,0.033197884,0.4643337,0.00023390414,0.0000907641],"about_ca_topic_score_codex":0.0008078025,"about_ca_topic_score_gemma":0.0018731402,"teacher_disagreement_score":0.5837254,"about_ca_system_score_codex":0.000019121046,"about_ca_system_score_gemma":0.00008453397,"threshold_uncertainty_score":0.33038217},"labels":[],"label_agreement":null},{"id":"W2161420200","doi":"10.1109/ca.1994.324003","title":"NSAIL PLAN: an experience with constraint-based reasoning in planning and animation","year":2002,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Plan (archaeology); Constraint (computer-aided design); Animation; Human–computer interaction; Artificial intelligence; Computer graphics (images); Engineering","score_opus":0.034380664154277575,"score_gpt":0.24562235863278087,"score_spread":0.2112416944785033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161420200","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49852225,0.00017238983,0.495193,0.0002655663,0.000028290902,0.00009173995,8.931491e-7,0.00021187396,0.005513984],"genre_scores_gemma":[0.868719,8.157109e-7,0.13091472,0.0002808132,0.000010273269,0.00000915502,0.0000028078407,0.0000051083707,0.00005731012],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990382,0.00005681118,0.00015370328,0.0003393726,0.00016371463,0.00024818158],"domain_scores_gemma":[0.9994787,0.000120797165,0.000060520466,0.00022209824,0.000022236209,0.000095625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022989044,0.00012041336,0.00011466006,0.000113506576,0.00013140944,0.00020182785,0.00022541279,0.00004729841,0.00003770013],"category_scores_gemma":[0.000024114684,0.00010187233,0.00000806616,0.00024229876,0.000059010705,0.0006833307,0.000027215381,0.00013069155,0.000005013328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006403205,0.00017417094,0.79984117,0.000074498654,0.000013187635,0.0005067367,0.057271678,0.04044502,0.0013555302,0.031994805,0.00048895314,0.06777023],"study_design_scores_gemma":[0.00049671397,0.0002173668,0.008955434,0.0002057292,0.000001310852,0.000057312966,0.0006262126,0.9883724,0.00063816406,0.00005372975,0.0001617093,0.00021391793],"about_ca_topic_score_codex":0.00008133351,"about_ca_topic_score_gemma":0.000023338596,"teacher_disagreement_score":0.94792736,"about_ca_system_score_codex":0.000018696242,"about_ca_system_score_gemma":0.00002354727,"threshold_uncertainty_score":0.4154233},"labels":[],"label_agreement":null},{"id":"W2161534823","doi":"10.1609/aaai.v26i1.8132","title":"Fast and Accurate Predictions of IDA*'s Performance","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":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates; University of Regina","keywords":"Computation; Computer science; Chen; Line (geometry); Point (geometry); Algorithm; Mathematics; Geology","score_opus":0.06116951912428045,"score_gpt":0.2721131074201581,"score_spread":0.21094358829587764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161534823","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83271617,0.00018579792,0.13976218,0.0052337185,0.0006017349,0.0003316394,0.00001970792,0.00014629208,0.021002758],"genre_scores_gemma":[0.99494475,0.00009476577,0.0045699766,0.000080012505,0.000028729859,0.000008122485,5.181478e-7,0.0000057920693,0.00026733906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99874717,0.0000150666365,0.00039537853,0.0003326757,0.0002927199,0.00021698076],"domain_scores_gemma":[0.99868345,0.000097801145,0.0002881462,0.00022906618,0.0006375285,0.000063991116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033375176,0.00013890404,0.00019385741,0.000074020536,0.00019739896,0.00013624298,0.0007905354,0.00006401098,0.00002836169],"category_scores_gemma":[0.00022999216,0.000110136185,0.000056168217,0.0005566227,0.00019475797,0.0003917191,0.00032114392,0.00023217738,0.000011238453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050401643,0.00016596944,0.004214091,0.00023726122,0.000038366736,0.0000012960766,0.004493363,0.00188805,0.07431208,0.78822726,0.0002569055,0.12611495],"study_design_scores_gemma":[0.000023757251,0.00015719888,0.001227441,0.00046017117,0.000012299051,0.000014228008,0.00043236653,0.2984279,0.6803743,0.018651135,0.00007512943,0.0001440471],"about_ca_topic_score_codex":0.000013916301,"about_ca_topic_score_gemma":0.00000363042,"teacher_disagreement_score":0.76957613,"about_ca_system_score_codex":0.000013741212,"about_ca_system_score_gemma":0.00013799673,"threshold_uncertainty_score":0.4491223},"labels":[],"label_agreement":null},{"id":"W2161557103","doi":"10.1109/cbms.2002.1011380","title":"A case base reasoning framework to author personalized health maintenance information","year":2003,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Adaptation (eye); Computer science; Component (thermodynamics); Health information; Case-based reasoning; Java; Personalized medicine; Health care; Artificial intelligence; Bioinformatics; Programming language","score_opus":0.0243171565656449,"score_gpt":0.282225969730963,"score_spread":0.2579088131653181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161557103","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025912728,0.00007174312,0.98703724,0.005605533,0.00023405072,0.00019400836,0.0000038042197,0.0002763979,0.003985957],"genre_scores_gemma":[0.24629197,0.0000017121719,0.74360174,0.009291252,0.000016249536,0.000017048946,0.0000027333824,0.000005081051,0.00077223364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868256,0.00015749347,0.00027686683,0.00023351249,0.00021441455,0.00043517764],"domain_scores_gemma":[0.99890953,0.0001888364,0.000112341026,0.00039520307,0.0000894099,0.00030469577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012722389,0.00013311216,0.00015396834,0.000121229314,0.00035711058,0.00025436538,0.0002535398,0.00006306054,0.00007782834],"category_scores_gemma":[0.00072462735,0.00011752935,0.000045135715,0.00055700756,0.0000135817145,0.00071403506,0.0000541923,0.00022082383,0.00018489135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012443592,0.00002033805,0.0004902938,0.000046786394,0.000009560729,0.00026506305,0.016631283,0.0015307195,0.0000040481905,0.9203518,0.03291962,0.027718054],"study_design_scores_gemma":[0.0017672743,0.0008804847,0.000301754,0.0014983468,0.000012496613,0.009633724,0.004329933,0.50140554,0.00044385542,0.0181149,0.45995384,0.001657856],"about_ca_topic_score_codex":0.00023201932,"about_ca_topic_score_gemma":0.000008898531,"teacher_disagreement_score":0.9022369,"about_ca_system_score_codex":0.00009225582,"about_ca_system_score_gemma":0.00024570583,"threshold_uncertainty_score":0.4792708},"labels":[],"label_agreement":null},{"id":"W2161826750","doi":"","title":"ConGolog, Sin Trans: compiling ConGolog into basic action theories for planning and beyond","year":2008,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Situation calculus; Computer science; Axiom; Compiler; Programming language; Executable; Concurrency; Reification (Marxism); Recursion (computer science); Theoretical computer science; Mathematics","score_opus":0.040091754835287485,"score_gpt":0.2825709991759726,"score_spread":0.24247924434068513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161826750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21354757,0.0005235662,0.7826635,0.00090093835,0.00024528365,0.00017440833,0.000003189084,0.00026328475,0.0016782123],"genre_scores_gemma":[0.9194642,0.00001675038,0.07944214,0.00071815506,0.000059942842,0.000020582691,0.000011819666,0.000008965081,0.0002574622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896526,0.000065316206,0.00021212781,0.00036582016,0.0001101951,0.00028128535],"domain_scores_gemma":[0.99878323,0.0007958036,0.00007160601,0.00020525693,0.000064866974,0.00007924705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000391916,0.00015615924,0.0002058369,0.00009245045,0.0005983407,0.00009225049,0.00026498013,0.00010065306,0.000008938877],"category_scores_gemma":[0.00005426272,0.00013796339,0.000044390516,0.00013588445,0.00015141068,0.0004375781,0.000046555622,0.0001501632,0.000003685566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004969144,0.0002209582,0.14252894,0.0005739262,0.00030825788,0.00018215903,0.09834478,0.010513923,0.020517921,0.5979838,0.011761274,0.11656717],"study_design_scores_gemma":[0.00601954,0.0022729565,0.018547881,0.00035371055,0.00008742835,0.0009965474,0.0040819016,0.7283504,0.04589804,0.15869741,0.03237145,0.0023227446],"about_ca_topic_score_codex":0.000049006354,"about_ca_topic_score_gemma":0.000013799274,"teacher_disagreement_score":0.7178365,"about_ca_system_score_codex":0.00001825961,"about_ca_system_score_gemma":0.00006030703,"threshold_uncertainty_score":0.5625984},"labels":[],"label_agreement":null},{"id":"W2162790870","doi":"10.1109/caia.1992.200006","title":"Pitch Expert-an engineered collection of specialized knowledge structures","year":2003,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"Universidad de Especialidades Espíritu Santo","keywords":"Expert system; Computer science; Pulp (tooth); Pulp mill; Kraft process; Mill; Domain knowledge; Knowledge engineering; Set (abstract data type); Kraft paper; Artificial intelligence; Engineering; Pulp and paper industry; Mechanical engineering; Programming language","score_opus":0.023578683305006766,"score_gpt":0.269159666400238,"score_spread":0.24558098309523121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162790870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030590283,0.0005234176,0.91846895,0.00007703985,0.0008641007,0.00013681297,0.000001019034,0.00025675222,0.049081612],"genre_scores_gemma":[0.8636455,0.0000067193428,0.13481338,0.000049661106,0.000059191552,0.0000045984457,0.0000019953268,0.0000068213176,0.0014121121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992271,0.00010738484,0.00017508189,0.00020865821,0.00011772288,0.00016406462],"domain_scores_gemma":[0.99941957,0.00008664371,0.000048643917,0.00029995712,0.00007701364,0.00006816486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021466105,0.00009964643,0.0001394824,0.000107294756,0.00009361003,0.000047990143,0.0002770559,0.000060861552,0.00018468763],"category_scores_gemma":[0.000058718608,0.00008619296,0.000039547518,0.0003891923,0.000014562264,0.00018789442,0.000023027103,0.00007107119,0.00000845519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029209677,0.00025795307,0.0018251087,0.00005796077,0.00007487083,0.000009308946,0.020655494,0.0031355927,0.025588965,0.87862307,0.043888308,0.025854152],"study_design_scores_gemma":[0.0037947728,0.001038503,0.0057015936,0.000106458894,0.000024037037,0.0001009942,0.0006016091,0.25389385,0.54392433,0.049887113,0.13945761,0.0014691297],"about_ca_topic_score_codex":0.00006894191,"about_ca_topic_score_gemma":0.000021132177,"teacher_disagreement_score":0.83305526,"about_ca_system_score_codex":0.000023867688,"about_ca_system_score_gemma":0.00009840067,"threshold_uncertainty_score":0.3514847},"labels":[],"label_agreement":null},{"id":"W2164129997","doi":"10.1109/tai.1995.479519","title":"Reasoning about nuclear physics processes","year":2002,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Process (computing); Nuclear reaction; Physics; Representation (politics); Computer science; Nuclear physics; Programming language","score_opus":0.020629034529256532,"score_gpt":0.2112840572572353,"score_spread":0.1906550227279788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164129997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056096,0.0008618791,0.7855068,0.0014068391,0.00019510217,0.00009009689,0.0000010694584,0.0012476448,0.20508099],"genre_scores_gemma":[0.8270085,0.000037351932,0.16800582,0.0010969177,0.00013179755,0.0000033463853,9.396968e-7,0.000013984108,0.0037013567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928325,0.00001770844,0.00009592,0.00022949127,0.00015057313,0.0002230496],"domain_scores_gemma":[0.9994943,0.00006940267,0.000043953187,0.0002731179,0.00005718398,0.00006203221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009061303,0.000089123954,0.00008200598,0.000021898595,0.00018679937,0.00020377799,0.0004607203,0.000033245113,0.00014358065],"category_scores_gemma":[0.000050682513,0.00007801028,0.000023800805,0.00033228076,0.000016252216,0.00043378377,0.000085153755,0.00010428537,0.00046170302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051372467,0.0002522014,0.006809578,0.0003000266,0.000054781125,0.00008336531,0.016785981,0.0038466598,0.0003756598,0.40425336,0.16969752,0.39753574],"study_design_scores_gemma":[0.0002830994,0.000111235386,0.00032751265,0.00022136673,0.0000067492056,0.000031635052,0.00006177288,0.90693146,0.0011326735,0.003932992,0.08647091,0.0004886141],"about_ca_topic_score_codex":0.000017694578,"about_ca_topic_score_gemma":0.0000011458674,"teacher_disagreement_score":0.90308475,"about_ca_system_score_codex":0.000010127835,"about_ca_system_score_gemma":0.000016394655,"threshold_uncertainty_score":0.59344125},"labels":[],"label_agreement":null},{"id":"W2164626058","doi":"10.1109/tsmcb.2004.835081","title":"KASER: knowledge amplification by structured expert randomization","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Randomness; Dice; Object (grammar); Artificial intelligence; Inheritance (genetic algorithm); Expert system; Domain (mathematical analysis); Natural language processing; Theoretical computer science; Mathematics; Statistics","score_opus":0.015707687485655916,"score_gpt":0.23742177903690775,"score_spread":0.22171409155125182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164626058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012825378,0.0023328955,0.9803775,0.00034549087,0.0016090445,0.00065845676,0.00004754349,0.0003923629,0.0014113215],"genre_scores_gemma":[0.99339616,0.0005096318,0.002849952,0.00017417679,0.0001186655,0.000124407,0.00003286452,0.00004675373,0.0027473806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974845,0.00022304562,0.00064817764,0.0007626217,0.0004078889,0.0004737642],"domain_scores_gemma":[0.99838763,0.00018809356,0.00023037393,0.0007368584,0.00016254612,0.00029446374],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038723942,0.00041174068,0.00041579953,0.00020558738,0.00043422097,0.0004776721,0.00050241203,0.00026663803,0.000020173859],"category_scores_gemma":[0.000008852359,0.00040538431,0.00011236452,0.00040193755,0.00011134307,0.0002533473,0.000007705838,0.00034261294,0.00011381407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007438008,0.0020362267,0.00022523072,0.0007619631,0.00086008356,0.000056521876,0.036223188,0.6692978,0.02640701,0.07005278,0.046897437,0.14643793],"study_design_scores_gemma":[0.03535362,0.0024013722,0.00063874264,0.0027213602,0.00048833224,0.00051641604,0.0013155113,0.51367974,0.11482942,0.007122884,0.31503886,0.005893736],"about_ca_topic_score_codex":0.00030124938,"about_ca_topic_score_gemma":0.00006386386,"teacher_disagreement_score":0.9805708,"about_ca_system_score_codex":0.00016268493,"about_ca_system_score_gemma":0.00011250124,"threshold_uncertainty_score":0.9998398},"labels":[],"label_agreement":null},{"id":"W2165373042","doi":"10.13088/jiis.2014.20.4.141","title":"A Intelligent Diagnostic Model that base on Case-Based Reasoning according to Korea - International Financial Reporting Standards","year":2014,"lang":"en","type":"article","venue":"Journal of Intelligence and Information Systems","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"International Financial Reporting Standards; Accounting; Business; Accounting standard; Comparability; Financial accounting; Financial statement; Mark-to-market accounting; Accounts receivable; Transparency (behavior); Finance; Accounting information system; Audit; Political science","score_opus":0.0365478528098738,"score_gpt":0.2883210581232037,"score_spread":0.2517732053133299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165373042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04216351,0.000060526447,0.9550809,0.00037998834,0.0011037957,0.00014518079,0.000010094651,0.000034545297,0.0010214254],"genre_scores_gemma":[0.98228556,0.000024315768,0.01668176,0.00081199576,0.00016902752,0.000008263156,0.0000033267256,0.0000059216563,0.0000098545215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997166,0.0000831836,0.0015916203,0.00014751023,0.00078333786,0.00022835063],"domain_scores_gemma":[0.99593323,0.0006651774,0.0021422044,0.00022904987,0.0008287826,0.00020154573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004798724,0.0001705391,0.00029948438,0.00052027794,0.0002211194,0.00068197254,0.00041940346,0.00007795502,0.0000028228724],"category_scores_gemma":[0.0067450735,0.00013938271,0.000091390044,0.00025196315,0.000018273257,0.00236802,0.00007983169,0.00029147926,0.000010064151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006117665,0.000024092033,0.0026004245,0.00008071979,0.000018085004,0.00012917902,0.00316793,0.86056846,0.0000147208575,0.015153574,0.0010267297,0.117154926],"study_design_scores_gemma":[0.00011991608,0.00036633795,0.000051050665,0.0014021788,0.0000080834625,0.0014178988,0.0009765921,0.98917884,0.0014030201,0.00016877215,0.0047272565,0.00018004436],"about_ca_topic_score_codex":0.00004598808,"about_ca_topic_score_gemma":0.0000015036736,"teacher_disagreement_score":0.940122,"about_ca_system_score_codex":0.00018187622,"about_ca_system_score_gemma":0.000297092,"threshold_uncertainty_score":0.807497},"labels":[],"label_agreement":null},{"id":"W2165523012","doi":"10.1109/icsmc.1995.538038","title":"Hierarchical diagnosis of sequential circuits","year":2002,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Medical diagnosis; Sequential logic; Prolog; Set (abstract data type); Consistency (knowledge bases); Constraint (computer-aided design); Algorithm; Logic gate; Task (project management); Logic synthesis; Identification (biology); Theoretical computer science; Programming language; Artificial intelligence; Mathematics; Engineering","score_opus":0.04091652280308963,"score_gpt":0.2439055251811829,"score_spread":0.20298900237809325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165523012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05771512,0.00046757085,0.87194586,0.0032306975,0.00039051403,0.000110755944,0.0000043077966,0.0003271258,0.06580807],"genre_scores_gemma":[0.9822581,0.000014538168,0.016722463,0.0002723475,0.000038203998,0.000006207631,7.8089886e-7,0.0000034417874,0.00068390596],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927294,0.000046235316,0.00014938677,0.00018191982,0.00017591171,0.0001736225],"domain_scores_gemma":[0.99943155,0.0001709904,0.000039091417,0.00026292057,0.00002767565,0.00006776495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013849071,0.00006502184,0.00009717887,0.00006122381,0.00005567208,0.000038408885,0.0004296636,0.000042173957,0.00046212753],"category_scores_gemma":[0.00003280051,0.000057041525,0.000047558187,0.00020360253,0.00002954573,0.00015319602,0.00008804567,0.00009861526,0.00009219399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024647823,0.00036860403,0.08304813,0.000083470964,0.00006748598,0.000096177,0.0041357023,0.0010660259,0.0013991335,0.2469609,0.07765219,0.5851197],"study_design_scores_gemma":[0.0017129428,0.00084687525,0.011787716,0.0002852538,0.00003525784,0.00011629011,0.00003372501,0.8458694,0.06100676,0.022200106,0.054866035,0.0012396325],"about_ca_topic_score_codex":0.00003359021,"about_ca_topic_score_gemma":0.0000018114234,"teacher_disagreement_score":0.92454296,"about_ca_system_score_codex":0.000008014832,"about_ca_system_score_gemma":0.000012005363,"threshold_uncertainty_score":0.50599724},"labels":[],"label_agreement":null},{"id":"W2165576756","doi":"10.1109/isic.1989.238655","title":"Software environment and architecture for intelligent control","year":2003,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Expert system; Software engineering; Architecture; Intelligent decision support system; Software; Control (management); Intelligent control; Artificial intelligence; Programming language","score_opus":0.010533183842502899,"score_gpt":0.2045909231749382,"score_spread":0.1940577393324353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165576756","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005546161,0.0004085536,0.997737,0.00059908617,0.000058549424,0.0001710692,0.0000026819887,0.0000713018,0.0003971683],"genre_scores_gemma":[0.26308745,0.000009698122,0.7350682,0.0011178841,0.000016666494,0.000029005592,0.0000015820407,0.000006194342,0.00066334225],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943596,0.00003060841,0.000087335124,0.00020843623,0.00007101699,0.00016663586],"domain_scores_gemma":[0.9994913,0.00023645048,0.000023986455,0.00017477147,0.0000072408025,0.00006626361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020315115,0.00007853022,0.00007906728,0.000026775451,0.00009196288,0.000052731924,0.00013605713,0.000031477375,0.000024076724],"category_scores_gemma":[0.00004248205,0.000061620914,0.000026989372,0.000026803991,0.000016177264,0.000044385364,0.00002236953,0.000058929418,0.000010034211],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032593918,0.00010224809,0.017328667,0.00010314864,0.0000911454,0.00001337131,0.0027714304,0.028490959,0.0004754948,0.19396485,0.0074502053,0.7491759],"study_design_scores_gemma":[0.0018430805,0.0006610735,0.0006753192,0.000054486904,0.000026663318,0.000075727236,0.00007204228,0.043738287,0.0068936683,0.073862694,0.8713789,0.0007180431],"about_ca_topic_score_codex":0.0000034121454,"about_ca_topic_score_gemma":9.652168e-7,"teacher_disagreement_score":0.86392874,"about_ca_system_score_codex":0.000009991256,"about_ca_system_score_gemma":0.000015005612,"threshold_uncertainty_score":0.25128278},"labels":[],"label_agreement":null},{"id":"W2165919346","doi":"10.1109/mcom.2010.5434385","title":"A system of systems approach to disaster management","year":2010,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Interdependence; Process (computing); Emergency management; Risk analysis (engineering); Fuzzy logic; Operations research; Artificial intelligence","score_opus":0.029127941026753736,"score_gpt":0.26017080181749985,"score_spread":0.23104286079074612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165919346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037423589,0.00020045199,0.7965799,0.00067165797,0.0007622952,0.0005230966,0.0000115753655,0.00027219395,0.1972365],"genre_scores_gemma":[0.7502233,0.0000045396487,0.24878259,0.000041831787,0.000027782711,0.00010375824,0.000008842416,0.000008311867,0.0007990509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896276,0.00011330879,0.00032469505,0.00022226872,0.00019092808,0.0001860381],"domain_scores_gemma":[0.9958394,0.00011453719,0.00012644891,0.0037226789,0.00010204272,0.00009488265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005568091,0.000113921014,0.0001742602,0.0001681218,0.00015863992,0.00010745771,0.0029852313,0.000048217556,0.0000011022847],"category_scores_gemma":[0.000010832007,0.000105933475,0.0000430773,0.00050219597,0.000051369505,0.00013063423,0.0005799176,0.00021577158,0.00017117486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007817703,0.00038311325,0.0007641474,0.0006103025,0.0000868454,0.0000029705484,0.0026780323,0.0044155843,0.004823234,0.9619853,0.016405819,0.007836825],"study_design_scores_gemma":[0.00072454097,0.00011545312,0.0026589334,0.00058867125,0.000059745376,0.00010045554,0.00062821165,0.7908731,0.00031626213,0.00026845184,0.20303228,0.0006338944],"about_ca_topic_score_codex":0.00002960807,"about_ca_topic_score_gemma":0.000007333189,"teacher_disagreement_score":0.96171683,"about_ca_system_score_codex":0.000024109395,"about_ca_system_score_gemma":0.000020969332,"threshold_uncertainty_score":0.55473524},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.19083000481911286,"score_gpt":0.3618077080581525,"score_spread":0.17097770323903963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167994996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044852756,0.00005637815,0.94516665,0.005632508,0.0004412541,0.0001463107,0.0000085602505,0.00013490205,0.0035606737],"genre_scores_gemma":[0.96702933,0.000007858142,0.032269698,0.0003685495,0.00023058025,0.000007698942,0.000005924791,0.000005347178,0.00007501959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984971,0.000052673142,0.00033376864,0.00037953124,0.0005022947,0.00023458255],"domain_scores_gemma":[0.9992464,0.00015610512,0.00013575972,0.00014198692,0.00023230634,0.000087424094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060209614,0.00013698591,0.00010827391,0.00015069782,0.0003047046,0.00028693388,0.00026436686,0.000074781594,0.00012968776],"category_scores_gemma":[0.000103023856,0.00013956986,0.000029825354,0.00016939643,0.0000488965,0.00043511967,0.000063931766,0.00021779377,0.00019249982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020175581,0.00006894961,0.000082028404,0.0000074587315,0.0000079596375,0.0000038191,0.00055533886,0.02238016,0.0047784657,0.72192043,0.00011428536,0.25006092],"study_design_scores_gemma":[0.000026785396,0.00007355007,0.00020178485,0.00006967636,0.000003519275,0.000008403925,0.000063397034,0.93185526,0.026773233,0.03836534,0.00235012,0.00020893321],"about_ca_topic_score_codex":0.00003824419,"about_ca_topic_score_gemma":0.000019746156,"teacher_disagreement_score":0.92217654,"about_ca_system_score_codex":0.0001125068,"about_ca_system_score_gemma":0.00017563437,"threshold_uncertainty_score":0.56914943},"labels":[],"label_agreement":null},{"id":"W2169294634","doi":"","title":"Learning Plan Rewriting Rules","year":2001,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Rewriting; Planner; Computer science; Plan (archaeology); Domain (mathematical analysis); Quality (philosophy); Artificial intelligence; Automated planning and scheduling; Set (abstract data type); Control (management); Machine learning; Domain knowledge; Programming language; Mathematics","score_opus":0.021545702174464165,"score_gpt":0.2324689463361988,"score_spread":0.21092324416173464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169294634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109626785,0.00014260094,0.70640326,0.0013108045,0.00012693838,0.000042779826,2.693897e-7,0.0008961846,0.18145038],"genre_scores_gemma":[0.89523345,0.000011832229,0.099517055,0.00040525093,0.00009067458,0.0000023802904,0.000004144992,0.000006401026,0.0047288244],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992106,0.00006875681,0.00012082252,0.00021322188,0.000132099,0.00025452484],"domain_scores_gemma":[0.9994718,0.0002179759,0.0000409523,0.00018173795,0.000024221978,0.00006335388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046837179,0.000077328674,0.000076411525,0.000058078735,0.00024156708,0.00016756506,0.0003658394,0.000037175017,0.00006616843],"category_scores_gemma":[0.0000761099,0.00006985697,0.00002737972,0.00015598309,0.000010193958,0.00026056758,0.00009907737,0.00018102062,0.00024983656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002121749,0.00005794257,0.26149622,0.000039050985,0.000034831246,0.0004536109,0.0048263,0.010299028,0.0013052083,0.1556064,0.011517726,0.55434245],"study_design_scores_gemma":[0.0006289546,0.00031101168,0.012444221,0.00023618324,0.0000069807284,0.00040040692,0.0005891126,0.756369,0.0012803252,0.0075952657,0.21929918,0.0008393418],"about_ca_topic_score_codex":0.00006543545,"about_ca_topic_score_gemma":0.0000037221705,"teacher_disagreement_score":0.7856066,"about_ca_system_score_codex":0.00001087256,"about_ca_system_score_gemma":0.00002157033,"threshold_uncertainty_score":0.3211227},"labels":[],"label_agreement":null},{"id":"W2169517535","doi":"10.1109/iros.2008.4650761","title":"Reactive planning as a motivational source in a behavior-based architecture","year":2008,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Planner; Computer science; Component (thermodynamics); Architecture; Action selection; Task (project management); Context (archaeology); Robot; Human–computer interaction; Distributed computing; Control (management); Artificial intelligence; Engineering; Systems engineering; Perception","score_opus":0.02435600522161216,"score_gpt":0.25306314551777376,"score_spread":0.2287071402961616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169517535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46939197,0.000024490748,0.5256927,0.000484637,0.000036140413,0.00009197113,9.0606045e-7,0.00016267724,0.0041144746],"genre_scores_gemma":[0.9344031,1.3003442e-7,0.06421555,0.00081779214,0.000029465662,0.000028042756,0.0000096964195,0.000008059422,0.00048812],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9988848,0.00006786358,0.00016987385,0.00033193972,0.00027679,0.0002687071],"domain_scores_gemma":[0.99926645,0.00031001915,0.0000633334,0.0002460581,0.000037885595,0.00007627872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018082374,0.00013276587,0.00012412618,0.00022303184,0.00016383945,0.000039916733,0.00037617757,0.00007256313,0.000032083764],"category_scores_gemma":[0.000065273176,0.000121319325,0.000043287604,0.0003979188,0.000036937276,0.00017784914,0.00006245439,0.00031537536,0.000031375745],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111554895,0.0003977627,0.68479794,0.00002010648,0.00002084158,0.0011259217,0.020034058,0.2699606,0.002526266,0.0066917767,0.0014224934,0.012890663],"study_design_scores_gemma":[0.003413006,0.00092426734,0.6768941,0.0004947363,0.000014461061,0.00096017256,0.00038753718,0.29186624,0.010376595,0.0052205897,0.007882615,0.0015656496],"about_ca_topic_score_codex":0.00024226634,"about_ca_topic_score_gemma":0.000005802517,"teacher_disagreement_score":0.46501118,"about_ca_system_score_codex":0.00004639411,"about_ca_system_score_gemma":0.00021191766,"threshold_uncertainty_score":0.49472582},"labels":[],"label_agreement":null},{"id":"W2169580201","doi":"10.1109/icsmc.2007.4413703","title":"Intelligent model-based hierarchical fault diagnosis for satellite formations","year":2007,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Spacecraft; Fault detection and isolation; Fault (geology); Computer science; Satellite; Telemetry; Real-time computing; Space exploration; Process (computing); Embedded system; Remote sensing; Engineering; Aerospace engineering; Artificial intelligence; Telecommunications; Geography; Geology","score_opus":0.03550139691798868,"score_gpt":0.291205146256002,"score_spread":0.2557037493380133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169580201","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022047607,0.00011677652,0.9909231,0.002192399,0.00013135947,0.0002586463,0.000007225234,0.00027454612,0.003891159],"genre_scores_gemma":[0.49342427,0.000010000925,0.5047507,0.0014742545,0.000032932523,0.00005450524,0.000018509318,0.0000070306155,0.00022779066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988091,0.000020183817,0.0003122553,0.0002578204,0.00019339427,0.00040727618],"domain_scores_gemma":[0.9984553,0.00087307236,0.000058224887,0.00034853743,0.00009847087,0.00016642488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000786098,0.0001275207,0.000118385506,0.0001547753,0.00023423057,0.00012845293,0.000508042,0.00007770641,0.000012973073],"category_scores_gemma":[0.00007701723,0.000110002824,0.00010330607,0.00025212305,0.00002768341,0.00027410954,0.000062252606,0.00013578823,0.000038070673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037741414,0.00018825805,0.004068404,0.00008003594,0.000024072815,0.0000058426085,0.0019472686,0.15747999,0.00008089664,0.29451835,0.0059011723,0.53566796],"study_design_scores_gemma":[0.0001826254,0.00008287389,0.00016765227,0.00002858011,0.00000488545,0.0000015551548,0.000015365024,0.9624787,0.007935094,0.010615577,0.018314933,0.00017218462],"about_ca_topic_score_codex":0.0000132374425,"about_ca_topic_score_gemma":0.000022463155,"teacher_disagreement_score":0.8049987,"about_ca_system_score_codex":0.000043990094,"about_ca_system_score_gemma":0.00008448708,"threshold_uncertainty_score":0.4485785},"labels":[],"label_agreement":null},{"id":"W2169807456","doi":"","title":"Qualitative Model Abstraction for Diagnosis","year":2003,"lang":"en","type":"article","venue":"NPARC","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Abstraction; Discretization; Computer science; Process (computing); Task (project management); Artificial intelligence; Qualitative analysis; Landmark; Data mining; Theoretical computer science; Algorithm; Qualitative research; Engineering; Mathematics; Programming language; Systems engineering","score_opus":0.07446010966465179,"score_gpt":0.35026501567953555,"score_spread":0.2758049060148838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169807456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077874353,0.000028631568,0.97499573,0.0008365461,0.00012773971,0.000102546,0.000005630955,0.00008595801,0.016029771],"genre_scores_gemma":[0.63579905,0.000003157467,0.3635464,0.00017665252,0.000012428774,0.00007287772,0.0000020133295,0.0000039601255,0.00038344006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993976,0.000055995275,0.00010479756,0.00018193299,0.00009876642,0.00016092481],"domain_scores_gemma":[0.9992373,0.000454287,0.00005042037,0.00016146128,0.000051958723,0.000044551336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004909217,0.00006384344,0.000069494534,0.000035658893,0.00012215677,0.00005301138,0.00015661522,0.000037826918,0.000019092347],"category_scores_gemma":[0.00013957477,0.00006166885,0.000038825117,0.00008551407,0.000010406021,0.00022924462,0.000010975956,0.000067036606,0.000022215105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011728981,0.00010465544,0.00038937078,0.000049330207,0.000028353816,0.000002855122,0.028768526,0.029032525,0.0022176113,0.8650883,0.04276647,0.031540316],"study_design_scores_gemma":[0.0002878489,0.00008342795,0.000033712455,0.0000257708,0.000005966233,0.0000025861423,0.0003132699,0.52428055,0.00981743,0.45647842,0.008481564,0.00018943883],"about_ca_topic_score_codex":0.0000043323917,"about_ca_topic_score_gemma":0.0000012837046,"teacher_disagreement_score":0.62801164,"about_ca_system_score_codex":0.000021356873,"about_ca_system_score_gemma":0.000049171165,"threshold_uncertainty_score":0.25147825},"labels":[],"label_agreement":null},{"id":"W2169857462","doi":"10.3968/j.css.1923669720050103.006","title":"A Cased-Based Reasoning Decision Support System","year":2009,"lang":"en","type":"article","venue":"Canadian social science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Markup language; Bidding; Profit (economics); Microeconomics; Economics; Operations research; Computer science; Humanities; Engineering; Philosophy; XML; World Wide Web","score_opus":0.011147107183070605,"score_gpt":0.24450507019398082,"score_spread":0.23335796301091022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169857462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047065977,0.00012784201,0.56954914,0.004940284,0.0019377952,0.00051902654,0.000041206345,0.0009848156,0.3748339],"genre_scores_gemma":[0.9706055,1.6676867e-7,0.027329253,0.0018902605,0.000101701386,0.0000031333368,0.0000018547188,0.0000044591266,0.000063648615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979002,0.00004156621,0.00018700724,0.0005024795,0.00054687547,0.0008218975],"domain_scores_gemma":[0.99861157,0.000085035994,0.00007977096,0.00034741196,0.00015210036,0.0007240924],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013151951,0.00013321894,0.00014440806,0.00033288274,0.0016351407,0.0005160297,0.001398087,0.00008159809,0.000014390559],"category_scores_gemma":[0.00016875438,0.00013707668,0.000055399818,0.0017163844,0.00014835084,0.0005210018,0.000034634653,0.0001628516,0.00007804044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013548706,0.000031607226,0.010029455,0.00002862751,0.0000057702596,0.0015134598,0.00512853,0.00046080886,0.0010559732,0.42390457,0.021711633,0.536116],"study_design_scores_gemma":[0.0026428986,0.0012063462,0.06381518,0.0012487005,0.000047623285,0.00050279713,0.0027355817,0.775903,0.0036659886,0.005790878,0.1384925,0.0039485227],"about_ca_topic_score_codex":0.0048249797,"about_ca_topic_score_gemma":0.001784407,"teacher_disagreement_score":0.9235395,"about_ca_system_score_codex":0.00087123126,"about_ca_system_score_gemma":0.002950109,"threshold_uncertainty_score":0.9996646},"labels":[],"label_agreement":null},{"id":"W2169871173","doi":"10.1109/iros.1991.174519","title":"Qualitative physics for robot task planning. I. Grammatical reasoning and commonsense augmentations","year":2002,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Australian Government","keywords":"Commonsense reasoning; Task (project management); Computer science; Robot; Commonsense knowledge; Artificial intelligence; Motion (physics); Grammar; Domain (mathematical analysis); Qualitative reasoning; Task analysis; Natural language processing; Human–computer interaction; Domain knowledge; Engineering; Mathematics; Linguistics","score_opus":0.10482865103516939,"score_gpt":0.3589959155802623,"score_spread":0.25416726454509286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169871173","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00531261,0.00017647374,0.99052536,0.0018777528,0.00006579382,0.00017421573,0.0000089388805,0.00018017154,0.0016787031],"genre_scores_gemma":[0.4904779,0.0000024427457,0.5085303,0.00037925452,0.000036690442,0.00002964936,0.000010787597,0.000008160579,0.0005248275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990336,0.00012150323,0.00019022828,0.0002633267,0.00013586652,0.00025550742],"domain_scores_gemma":[0.99817145,0.0013879035,0.00007201491,0.00021243445,0.000053946602,0.00010222861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036456992,0.0001228229,0.0001483317,0.000039535775,0.00034416292,0.00017835572,0.00018540576,0.000041889238,0.0000075918233],"category_scores_gemma":[0.00011951281,0.00011225642,0.000039488536,0.00016227024,0.00005732344,0.00027088515,0.00006352304,0.00011020881,0.000016614244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023615608,0.0001962835,0.0016618554,0.00012447085,0.00012307514,0.000025366973,0.20598118,0.0071477704,0.00045863018,0.69668025,0.040599544,0.046977952],"study_design_scores_gemma":[0.00054417085,0.00016731402,0.0001401704,0.000082366096,0.000015743459,0.00001717528,0.0027626376,0.975463,0.0002368262,0.01958567,0.00073440134,0.00025057222],"about_ca_topic_score_codex":0.000028573319,"about_ca_topic_score_gemma":0.0000024658461,"teacher_disagreement_score":0.9683152,"about_ca_system_score_codex":0.000016563383,"about_ca_system_score_gemma":0.000012873518,"threshold_uncertainty_score":0.4577684},"labels":[],"label_agreement":null},{"id":"W2171440583","doi":"10.1609/icaps.v20i1.13423","title":"Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms","year":2021,"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":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"MacEwan University; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parallelizable manifold; Algorithm; Domain (mathematical analysis); Mathematical optimization; Mathematics","score_opus":0.06394127200578725,"score_gpt":0.3128285928497654,"score_spread":0.24888732084397813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171440583","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8485329,0.000037180624,0.14754997,0.002527383,0.00020131946,0.00027718337,0.000028110311,0.00032177323,0.00052416185],"genre_scores_gemma":[0.73493606,0.000001460808,0.26458523,0.0003077522,0.000053775475,0.000018158882,0.000011795318,0.000017154078,0.00006863241],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797434,0.000034055025,0.0003237627,0.00064027327,0.0006283385,0.0003992538],"domain_scores_gemma":[0.997732,0.0006487264,0.00021930876,0.00015038304,0.0010808244,0.00016875546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000742227,0.00023927528,0.00024656515,0.00019082706,0.00036985686,0.0008112063,0.00097190693,0.00007689359,0.0000037620764],"category_scores_gemma":[0.00075345516,0.00018785438,0.000057723802,0.00028408863,0.00005687099,0.0004574982,0.00033572112,0.00037798382,0.0000015655717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007644668,0.00036791502,0.02364289,0.0003198061,0.0004905564,0.00009112022,0.031360418,0.6167457,0.28341624,0.024076963,0.00017716103,0.01854673],"study_design_scores_gemma":[0.0004635466,0.00038901018,0.00028057117,0.0012910377,0.000011523563,0.00008035067,0.0015176941,0.9331617,0.062136266,0.0003841318,0.000046126173,0.00023805602],"about_ca_topic_score_codex":0.000036320365,"about_ca_topic_score_gemma":0.0000021184153,"teacher_disagreement_score":0.31641594,"about_ca_system_score_codex":0.00006997765,"about_ca_system_score_gemma":0.00013914634,"threshold_uncertainty_score":0.7822481},"labels":[],"label_agreement":null},{"id":"W2171533412","doi":"10.1109/icsmc.1997.635170","title":"Incorporating system dynamics in case-based reasoning for process operation support","year":2002,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Case-based reasoning; Computer science; Process (computing); Adaptation (eye); Artificial intelligence; Search engine indexing; Reasoning system; Model-based reasoning; Machine learning; Knowledge representation and reasoning","score_opus":0.021023842957438903,"score_gpt":0.24761153954733192,"score_spread":0.22658769658989303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171533412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032634042,0.000019733827,0.9619166,0.00041874812,0.00011864745,0.00033158483,0.0000050928143,0.00030306453,0.0042524342],"genre_scores_gemma":[0.83524406,8.784577e-8,0.16436294,0.00012984453,0.000026450052,0.00006214865,0.000019520068,0.000009411685,0.00014557036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998924,0.000051187813,0.00030441664,0.0003273015,0.00014111288,0.00025197535],"domain_scores_gemma":[0.99934566,0.00015271774,0.00011738448,0.00023317088,0.00009167882,0.000059392984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067751325,0.00012297164,0.00014505212,0.00012579106,0.00022941864,0.00021968028,0.00026601533,0.00007247294,0.000010877248],"category_scores_gemma":[0.000056008477,0.00011673008,0.000029957173,0.00031850144,0.000010407694,0.00044659193,0.000027741673,0.00011103291,0.000011430484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037468075,0.00027541217,0.11740484,0.0021091807,0.000031995398,0.0030787447,0.0061894674,0.4196648,0.0001224102,0.37573138,0.0024675226,0.07288677],"study_design_scores_gemma":[0.00036624164,0.00009656912,0.000016164437,0.00013719132,0.0000026812872,0.00024759374,0.00038268592,0.9982495,0.00025113847,0.00006843973,0.00002045316,0.00016136409],"about_ca_topic_score_codex":0.00012913425,"about_ca_topic_score_gemma":0.00029601727,"teacher_disagreement_score":0.80261,"about_ca_system_score_codex":0.00020325654,"about_ca_system_score_gemma":0.00008329004,"threshold_uncertainty_score":0.47601146},"labels":[],"label_agreement":null},{"id":"W2171955870","doi":"","title":"State-Set Search","year":2011,"lang":"en","type":"article","venue":"Annual Symposium on Combinatorial Search","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Abstraction; State (computer science); State space; Set (abstract data type); Computer science; Theoretical computer science; Domain (mathematical analysis); Abstraction model checking; Space (punctuation); Algorithm; Mathematics; Model checking; Programming language","score_opus":0.03679569407185995,"score_gpt":0.27114269070385694,"score_spread":0.23434699663199698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171955870","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70333916,0.0002773478,0.0436001,0.0052705756,0.019192433,0.0019305443,0.00024698244,0.0024377252,0.22370516],"genre_scores_gemma":[0.9959982,0.000016378734,0.0016778839,0.0002871186,0.00029277705,0.000019282954,0.000015216622,0.000032028838,0.001661109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9966632,0.00040953944,0.0003179109,0.0007024429,0.0009845768,0.00092232093],"domain_scores_gemma":[0.99809885,0.00029433222,0.00005380206,0.00083603367,0.00033402085,0.00038294483],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014666566,0.00026590042,0.00026186224,0.00022999322,0.00041693184,0.00021834002,0.0016951439,0.00015404746,0.00008921538],"category_scores_gemma":[0.000035705496,0.00025007245,0.000100049285,0.0006542186,0.000096380936,0.0005645004,0.00052744214,0.0006872242,0.0009983793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073287816,0.0012480712,0.011190538,0.00011431099,0.00015901146,0.0005514204,0.080629796,0.00076112605,0.001997595,0.8562741,0.028544763,0.017796379],"study_design_scores_gemma":[0.019724034,0.03448306,0.020244453,0.0009728936,0.00008987716,0.00020404387,0.0022754658,0.039401133,0.36674073,0.227548,0.27994385,0.008372459],"about_ca_topic_score_codex":0.0016110935,"about_ca_topic_score_gemma":0.000004727092,"teacher_disagreement_score":0.6287261,"about_ca_system_score_codex":0.00015654528,"about_ca_system_score_gemma":0.00044936143,"threshold_uncertainty_score":0.9999952},"labels":[],"label_agreement":null},{"id":"W2174820871","doi":"10.1609/aaai.v28i1.9045","title":"Cost-Based Query Optimization via AI Planning","year":2014,"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":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Query optimization; Computer science; Query expansion; Suite; Sargable; Context (archaeology); Plan (archaeology); Optimization problem; Query plan; Query language; Domain (mathematical analysis); Web search query; Mathematical optimization; Data mining; Information retrieval; Algorithm; Search engine; Mathematics","score_opus":0.07989796132133917,"score_gpt":0.30293042550432664,"score_spread":0.22303246418298747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174820871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042141806,0.00001464124,0.9850734,0.0043442403,0.00038387964,0.00029509078,0.0000019540648,0.00018293064,0.005489675],"genre_scores_gemma":[0.962433,0.0000022557072,0.03619654,0.0011643093,0.00007644865,0.000027740585,0.0000017531635,0.0000150441365,0.00008290401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808395,0.00004080535,0.0005027755,0.00049973605,0.0004802752,0.00039245322],"domain_scores_gemma":[0.9983327,0.00022669414,0.0004142628,0.00033924566,0.00057814573,0.000108943575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008914414,0.00024270819,0.00025348883,0.00016888932,0.00032449712,0.00034274612,0.0017146545,0.00012133888,0.000042956442],"category_scores_gemma":[0.00044955465,0.00019391517,0.00010220813,0.00061963004,0.00015769141,0.00045248604,0.00019338146,0.00038716747,0.000052231764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009927145,0.00015497244,0.0015903113,0.000096631775,0.000018064027,8.634905e-7,0.0016786173,0.34191597,0.008747065,0.53439105,0.00067524664,0.11063192],"study_design_scores_gemma":[0.000029860566,0.00015460332,0.000047031586,0.00032809685,0.000007651512,0.0000022109368,0.000056654193,0.8299364,0.14169377,0.02736538,0.0001728201,0.00020556487],"about_ca_topic_score_codex":0.00003731867,"about_ca_topic_score_gemma":0.0000018293862,"teacher_disagreement_score":0.9582188,"about_ca_system_score_codex":0.000042706004,"about_ca_system_score_gemma":0.00011633699,"threshold_uncertainty_score":0.79076314},"labels":[],"label_agreement":null},{"id":"W2187263253","doi":"","title":"Using Coarse State Space Abstractions to Detect Mutex Pairs","year":2013,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Regina","funders":"","keywords":"Semaphore; Benchmark (surveying); State (computer science); Computer science; Mathematics; State space; Abstraction; Space (punctuation); Algorithm; Programming language; Operating system; Statistics","score_opus":0.03666148876345725,"score_gpt":0.2687382298295925,"score_spread":0.23207674106613524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187263253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08657745,0.000017635806,0.9065343,0.0015187771,0.00023605487,0.0001645189,0.0000014278767,0.0003171283,0.0046326877],"genre_scores_gemma":[0.5024898,9.71035e-7,0.4950632,0.0005006919,0.000025031184,0.000008672801,5.457229e-7,0.0000075961348,0.0019035074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999069,0.000036727517,0.0001501914,0.00027069802,0.00015439357,0.0003190057],"domain_scores_gemma":[0.9991954,0.0001304327,0.00004825545,0.0003681092,0.000074312804,0.00018349709],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019256982,0.000111244255,0.00009411177,0.000103606806,0.00020251486,0.00028526463,0.00034289854,0.00003466292,0.00020870742],"category_scores_gemma":[0.000025934265,0.00009969345,0.000037361937,0.00025505875,0.000013171138,0.00053275307,0.00011112594,0.00013103538,0.0012743169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014410418,0.00012006009,0.0050354223,0.00006775149,0.00011133721,0.00012232264,0.0067416215,0.39312103,0.06630927,0.0067007225,0.1343651,0.38729092],"study_design_scores_gemma":[0.00026937583,0.00015691105,0.005194837,0.000069747744,0.000008907721,0.000059263144,0.0001685131,0.9556892,0.014791583,0.005687638,0.017268565,0.00063543866],"about_ca_topic_score_codex":0.002075674,"about_ca_topic_score_gemma":0.00007030904,"teacher_disagreement_score":0.5625682,"about_ca_system_score_codex":0.00003956956,"about_ca_system_score_gemma":0.0000646467,"threshold_uncertainty_score":0.9995033},"labels":[],"label_agreement":null},{"id":"W2189109991","doi":"","title":"RISK PREDICTION FOR MODERN TECHNOLOGICAL SYSTEMS","year":2008,"lang":"en","type":"article","venue":"Journal of Polish Safety and Reliability Association","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Atomic Energy (Canada)","funders":"","keywords":"Blackout; Predictability; Outcome (game theory); Risk analysis (engineering); Computer science; Actuarial science; Operations research; Econometrics; Engineering; Economics; Statistics; Business; Mathematics","score_opus":0.009292748324228498,"score_gpt":0.2144671880725882,"score_spread":0.2051744397483597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189109991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10317449,0.00047237927,0.8927204,0.002575681,0.0006092795,0.00017537552,0.00004655707,0.00007517034,0.00015066643],"genre_scores_gemma":[0.9879086,0.0005893097,0.011093685,0.000039702827,0.0002165946,0.0000029058936,0.0000030282329,0.000003744816,0.00014239755],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986905,0.00018453159,0.0005120862,0.00014686481,0.00029477495,0.00017124429],"domain_scores_gemma":[0.9978838,0.0006947747,0.00084015116,0.00013102771,0.00038481608,0.00006544069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031786477,0.0000785022,0.0002194541,0.0000758786,0.00036430673,0.000053595228,0.00019340575,0.00023538763,4.9488654e-7],"category_scores_gemma":[0.001777404,0.00006200556,0.00009528308,0.00013904089,0.0000349822,0.00046643865,0.0000342093,0.00033082117,6.1663997e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042477986,0.00046165747,0.80867857,0.00022085306,0.00025281598,0.000014174585,0.00531911,0.1269782,0.00026819465,0.012263762,0.01655612,0.028561732],"study_design_scores_gemma":[0.0020868776,0.00090292457,0.27218452,0.00016547188,0.000095864394,0.00021618912,0.00013320943,0.6688337,0.00012095419,0.029930754,0.025038537,0.00029102562],"about_ca_topic_score_codex":0.000027713215,"about_ca_topic_score_gemma":6.6732883e-7,"teacher_disagreement_score":0.88473415,"about_ca_system_score_codex":0.00028011278,"about_ca_system_score_gemma":0.000085627755,"threshold_uncertainty_score":0.28019896},"labels":[],"label_agreement":null},{"id":"W2189416168","doi":"10.1609/aaai.v27i1.8672","title":"A Fast Pairwise Heuristic for Planning under Uncertainty","year":2013,"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":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Partially observable Markov decision process; Heuristic; Pairwise comparison; Mathematical optimization; Bottleneck; Computer science; Greedy algorithm; Markov decision process; Sequence (biology); Markov process; Markov chain; Mathematics; Artificial intelligence; Markov model; Machine learning","score_opus":0.08542905099668778,"score_gpt":0.2954106598448335,"score_spread":0.2099816088481457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189416168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19405131,0.00009116478,0.7822768,0.012409962,0.0009403665,0.0017322892,0.00001724578,0.00038890104,0.008091957],"genre_scores_gemma":[0.9882662,0.0000040844475,0.01060495,0.0004911166,0.000079440586,0.00012208874,0.0000012607356,0.000015568465,0.00041525168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980568,0.000019376244,0.00052228547,0.0005271527,0.00037983738,0.0004945423],"domain_scores_gemma":[0.99807817,0.00036378225,0.00037817084,0.0003090172,0.0007461284,0.00012473819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052940694,0.00025763002,0.00027486504,0.00012132788,0.0003508897,0.00044140033,0.0018328821,0.000105333354,0.000061641134],"category_scores_gemma":[0.00043396882,0.00019113765,0.00013936807,0.00044971332,0.00018118651,0.0004413629,0.0002600266,0.0002976329,0.00010345305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006595381,0.00013436501,0.00049095997,0.00013134956,0.000033940352,5.045226e-7,0.0035665121,0.015089697,0.012503884,0.89189196,0.0027636902,0.0733272],"study_design_scores_gemma":[0.000046654593,0.00028198806,0.00020477989,0.00047364132,0.000013783683,0.000004401166,0.0010522904,0.6080973,0.03979956,0.3495613,0.00014723113,0.00031701478],"about_ca_topic_score_codex":0.000111969784,"about_ca_topic_score_gemma":0.000003186645,"teacher_disagreement_score":0.7942149,"about_ca_system_score_codex":0.000049527007,"about_ca_system_score_gemma":0.00012413158,"threshold_uncertainty_score":0.7794367},"labels":[],"label_agreement":null},{"id":"W2196640769","doi":"10.1609/aaai.v29i1.9641","title":"A Generalization of Sleep Sets Based on Operator Sequence Redundancy","year":2015,"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":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; Universität Basel; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Correctness; Redundancy (engineering); Computer science; Operator (biology); Pruning; Commutative property; Sequence (biology); Generalization; Algorithm; Set (abstract data type); Sleep (system call); Mathematics; Theoretical computer science; Artificial intelligence; Discrete mathematics; Programming language","score_opus":0.13759979250461188,"score_gpt":0.31668917139525044,"score_spread":0.17908937889063856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2196640769","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53584945,0.000114402734,0.41982338,0.012632196,0.0019146069,0.0014249823,0.000048790236,0.00043146536,0.027760698],"genre_scores_gemma":[0.98505366,0.0000048288407,0.014367158,0.0004184055,0.000039509578,0.000018122055,0.000001857203,0.000012570552,0.00008386508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979563,0.000044097043,0.00055555353,0.00046738947,0.00067548285,0.00030121123],"domain_scores_gemma":[0.9978281,0.0000960628,0.0004601997,0.00038673673,0.0010902359,0.0001386448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008545341,0.0002241884,0.0002684801,0.00016440295,0.00014372374,0.00017121417,0.0016969849,0.00010282936,0.000022522623],"category_scores_gemma":[0.0006583435,0.00017268654,0.00008632233,0.00081613846,0.00018269649,0.0003612254,0.00017361688,0.00024135037,0.00003967724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018229481,0.0002718415,0.0017731672,0.000108988665,0.000017690234,0.000001859432,0.0033407987,0.024633799,0.05322872,0.87427247,0.00081821455,0.041350186],"study_design_scores_gemma":[0.00004046866,0.00035904508,0.00004337251,0.00035509228,0.000006719019,0.0000019097126,0.000104858365,0.57881594,0.39115667,0.02888668,0.00006422932,0.00016503327],"about_ca_topic_score_codex":0.00007064774,"about_ca_topic_score_gemma":0.000003842571,"teacher_disagreement_score":0.8453858,"about_ca_system_score_codex":0.0000648572,"about_ca_system_score_gemma":0.00031584984,"threshold_uncertainty_score":0.70419526},"labels":[],"label_agreement":null},{"id":"W2197146024","doi":"10.1016/j.artint.2015.09.012","title":"Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces","year":2015,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Alberta","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematical optimization; Heuristic; Computer science; Focus (optics); Path (computing); Limit (mathematics); State space; Sampling (signal processing); Search cost; State (computer science); Space (punctuation); Algorithm; Mathematics; Statistics; Computer vision","score_opus":0.12555650689661343,"score_gpt":0.3233545835191511,"score_spread":0.19779807662253765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2197146024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34324786,0.00008571385,0.65529585,0.00051375665,0.00018703706,0.000110256326,0.0000014570621,0.00012265542,0.00043542066],"genre_scores_gemma":[0.9204433,0.0000027220447,0.07934503,0.000032733904,0.000108308086,0.0000110747,0.000005633032,0.00000830754,0.000042889205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983243,0.0001229985,0.00029717546,0.00042520685,0.00043956877,0.00039079544],"domain_scores_gemma":[0.9991259,0.00021951475,0.000076607466,0.00025739934,0.00018103528,0.00013955813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012485362,0.00013601672,0.00013240307,0.00016878544,0.00019287446,0.00029570138,0.00039410716,0.0000734642,0.0000071683603],"category_scores_gemma":[0.00013583833,0.00012752824,0.000024002169,0.0006892614,0.00008016933,0.00053459854,0.000095837706,0.0002884786,0.00004512201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023574366,0.00017278484,0.03540925,0.000024198645,0.000027589353,0.000075492564,0.0091715325,0.7464662,0.0039329766,0.0736534,0.00011751398,0.13071333],"study_design_scores_gemma":[0.0000626753,0.00027894278,0.0005755474,0.00016049786,0.000003602336,0.000030697902,0.0013022188,0.9571101,0.03601355,0.0041283322,0.00009409395,0.00023972077],"about_ca_topic_score_codex":0.001151151,"about_ca_topic_score_gemma":0.00055536866,"teacher_disagreement_score":0.57719547,"about_ca_system_score_codex":0.00013725043,"about_ca_system_score_gemma":0.00028661633,"threshold_uncertainty_score":0.5200451},"labels":[],"label_agreement":null},{"id":"W2198255514","doi":"10.1016/j.actaastro.2015.12.019","title":"Planetary micro-rover operations on Mars using a Bayesian framework for inference and control","year":2015,"lang":"en","type":"article","venue":"Acta Astronautica","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Beaver; Mars rover; Computer science; Bayesian network; Mars Exploration Program; Robot; Artificial intelligence; Scale (ratio); Control engineering; Engineering","score_opus":0.03732299600904378,"score_gpt":0.2900102871554425,"score_spread":0.25268729114639876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2198255514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035678204,0.00007396215,0.9613139,0.0023784034,0.00015800372,0.00020591343,0.000041235486,0.00006132064,0.00008907594],"genre_scores_gemma":[0.63597655,6.1157965e-7,0.36331555,0.00061676145,0.000048057493,0.0000071642785,0.0000116029205,0.000005825442,0.000017879573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990752,0.000053550146,0.00015212393,0.0002885286,0.00013816245,0.00029246192],"domain_scores_gemma":[0.9989486,0.0005012018,0.000040361396,0.0002901584,0.000048413396,0.0001712809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023020172,0.0001355031,0.00014796785,0.00005795884,0.00017212634,0.00018635418,0.00028289933,0.0000811342,0.000007809601],"category_scores_gemma":[0.00017835591,0.00012563425,0.00002497207,0.00008288664,0.000039358296,0.0002377683,0.00006043618,0.00018479605,0.000007366452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011859974,0.00079482177,0.17550884,0.0002463479,0.00066948595,0.00011393299,0.012505548,0.1714191,0.014000856,0.4856016,0.016994242,0.12095924],"study_design_scores_gemma":[0.001057059,0.00053458655,0.003578762,0.00015468325,0.000032219396,0.000019722085,0.000044856788,0.9815732,0.00028128576,0.007848905,0.0045743356,0.00030037735],"about_ca_topic_score_codex":0.000035428853,"about_ca_topic_score_gemma":0.0000046597866,"teacher_disagreement_score":0.81015414,"about_ca_system_score_codex":0.000030218844,"about_ca_system_score_gemma":0.0001615896,"threshold_uncertainty_score":0.5123216},"labels":[],"label_agreement":null},{"id":"W2198968609","doi":"","title":"Reading the Readers: Modelling Complex Humanities Processes to Build Cognitive Systems","year":2004,"lang":"en","type":"article","venue":"UCL Discovery (University College London)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"University of Oxford; Massachusetts Institute of Technology","keywords":"Stylus; Reading (process); Computer science; Process (computing); Task (project management); Construct (python library); Artificial intelligence; Human–computer interaction; Cognitive science; Natural language processing; Linguistics; Engineering; Psychology","score_opus":0.037124205047703904,"score_gpt":0.21493901275007743,"score_spread":0.1778148077023735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2198968609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0656484,0.00018810444,0.9267035,0.001776808,0.0002421275,0.0005463129,0.00025214348,0.00027759705,0.0043649883],"genre_scores_gemma":[0.98720324,0.00002438325,0.0066960156,0.0005829995,0.00008723359,0.0000045529055,0.000025902278,0.000018001852,0.0053576985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982018,0.000118672026,0.00018096078,0.00055194367,0.00040669096,0.0005399392],"domain_scores_gemma":[0.99863535,0.00043952028,0.00014304448,0.00041364363,0.00024417762,0.00012429123],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0003090903,0.00025668915,0.00027877162,0.00027451714,0.001438756,0.00046773825,0.0011832474,0.00008048072,0.0000057294224],"category_scores_gemma":[0.000047959988,0.00023946827,0.00008513117,0.0011347312,0.00012396026,0.0023072623,0.0003814119,0.00025877557,0.00006902561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018151756,0.0001259608,0.00034984367,0.00031797332,0.00016081189,0.0004551646,0.025785865,0.52932197,0.000080657745,0.43922427,0.0038429215,0.00015301864],"study_design_scores_gemma":[0.007576263,0.0015602803,0.00093001395,0.007098362,0.0004605965,0.00047612505,0.2612049,0.65206957,0.0011477706,0.011588971,0.051564116,0.004323038],"about_ca_topic_score_codex":0.001271861,"about_ca_topic_score_gemma":0.0001401843,"teacher_disagreement_score":0.9215548,"about_ca_system_score_codex":0.0002526331,"about_ca_system_score_gemma":0.00040841012,"threshold_uncertainty_score":0.99986124},"labels":[],"label_agreement":null},{"id":"W221046306","doi":"10.1609/aaai.v28i1.9049","title":"Computing Contingent Plans via Fully Observable Non-Deterministic Planning","year":2014,"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":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Observability; Planner; Observable; Computer science; AKA; Automated planning and scheduling; Robotics; Key (lock); Realization (probability); Artificial intelligence; Robot; Mathematics; Computer security","score_opus":0.06584585395061208,"score_gpt":0.28404810356261573,"score_spread":0.21820224961200363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W221046306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2561114,0.000024180703,0.7228876,0.0018085194,0.000986343,0.00043924843,0.0000053242625,0.0002615095,0.017475914],"genre_scores_gemma":[0.986934,0.0000023641066,0.012315202,0.00041066774,0.00014447591,0.000010600712,0.000001167949,0.000018878183,0.00016263421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974204,0.000037195172,0.00073738577,0.00065138924,0.00054165116,0.00061198475],"domain_scores_gemma":[0.99795234,0.00039243544,0.00064368814,0.00040679766,0.0004581304,0.00014659864],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012194939,0.00032567102,0.00040369818,0.00013444037,0.00051263213,0.00043636933,0.0024605365,0.00012531444,0.000019147488],"category_scores_gemma":[0.00048165125,0.00026290235,0.000131867,0.00050540274,0.00018122842,0.0003297691,0.0004956022,0.00047925717,0.00009200595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000162059,0.00029759618,0.0118276905,0.0003788887,0.000073756746,0.0000069462853,0.01163836,0.008472883,0.078366354,0.66741383,0.00097298936,0.22038867],"study_design_scores_gemma":[0.000050309405,0.00035620425,0.0007598115,0.0008727743,0.00001744831,0.000013032242,0.00026266073,0.83980674,0.114759326,0.04243402,0.00029032194,0.00037735104],"about_ca_topic_score_codex":0.000062842126,"about_ca_topic_score_gemma":0.0000043408636,"teacher_disagreement_score":0.8313339,"about_ca_system_score_codex":0.00004076541,"about_ca_system_score_gemma":0.00009720598,"threshold_uncertainty_score":0.9999823},"labels":[],"label_agreement":null},{"id":"W2211274022","doi":"10.1609/icaps.v24i1.13640","title":"The Complexity of Partial-Order Plan Viability Problems","year":2014,"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":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; University of Ottawa","keywords":"Heuristics; Plan (archaeology); Order (exchange); Computer science; Task (project management); Management science; Mathematical optimization; Mathematics; Engineering; Economics; Systems engineering","score_opus":0.06234092099937335,"score_gpt":0.28064504394064843,"score_spread":0.21830412294127507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2211274022","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9675087,0.00007965317,0.012372853,0.007751788,0.0005325883,0.0002536686,0.000010940894,0.00039578765,0.011094065],"genre_scores_gemma":[0.9891952,0.000005140647,0.010615701,0.00009058836,0.00003141589,0.00000870824,0.0000023321834,0.000006177977,0.000044689717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863064,0.000033078704,0.0003968949,0.00028701784,0.0004412933,0.00021108509],"domain_scores_gemma":[0.9985509,0.00029438705,0.00045436365,0.00015949727,0.00048743843,0.000053404965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013164738,0.00014989622,0.00019238699,0.000064233696,0.00033290265,0.00024608185,0.0012420445,0.000068936926,0.000003956322],"category_scores_gemma":[0.00055700925,0.00009418943,0.00005003866,0.00019082843,0.0002860516,0.00019247067,0.00026657345,0.00027186982,0.000001637127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008598603,0.00007723246,0.05406874,0.00016440122,0.00010933004,3.362547e-7,0.0029099237,0.009654334,0.017108789,0.91267645,0.00030828346,0.00283619],"study_design_scores_gemma":[0.00021094925,0.00008224065,0.005172887,0.0005353081,0.000007065161,0.000007322374,0.00015576917,0.96207994,0.010098327,0.02129941,0.00023248832,0.00011830779],"about_ca_topic_score_codex":0.000041418116,"about_ca_topic_score_gemma":0.0000012033537,"teacher_disagreement_score":0.9524256,"about_ca_system_score_codex":0.000018015007,"about_ca_system_score_gemma":0.00005753437,"threshold_uncertainty_score":0.38409334},"labels":[],"label_agreement":null},{"id":"W2222911679","doi":"","title":"Diagnostic problem solving via planning with ontic and epistemic goals","year":2014,"lang":"en","type":"article","venue":"Principles of Knowledge Representation and Reasoning","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Ontic; Planner; Computer science; Artificial intelligence; Medical diagnosis; Automated planning and scheduling; Machine learning; Epistemology","score_opus":0.01924517497698003,"score_gpt":0.26572870452363717,"score_spread":0.24648352954665714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2222911679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35728666,0.0032298656,0.6297628,0.00024246683,0.00009114415,0.00026735628,7.364465e-7,0.00015536256,0.008963568],"genre_scores_gemma":[0.928319,0.000049767372,0.07129596,0.000015808737,0.0000464171,0.000015746014,0.0000044922003,0.000014077866,0.00023876163],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860907,0.00016714283,0.00032890338,0.00045470637,0.00017571414,0.00026448767],"domain_scores_gemma":[0.9976185,0.0015629488,0.00026385902,0.00029355646,0.0001222523,0.00013889663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069417496,0.00017512249,0.00027676547,0.00014607223,0.00026738903,0.00013787695,0.00023126641,0.0000639832,0.0000019236795],"category_scores_gemma":[0.0005208781,0.00014660922,0.000030148736,0.0002449437,0.00010060524,0.0003630075,0.00022922091,0.00015726958,0.0000034002237],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003199153,0.000067973,0.86432624,0.00069655513,0.000080010985,0.000019460836,0.01551241,0.006220216,0.0017280795,0.03282939,0.00004442585,0.07844327],"study_design_scores_gemma":[0.0015848326,0.00038505893,0.21663451,0.004546132,0.00007887863,0.00035234334,0.00049071765,0.7678666,0.003737996,0.0026737074,0.000978675,0.00067052577],"about_ca_topic_score_codex":0.000062684776,"about_ca_topic_score_gemma":0.000016924803,"teacher_disagreement_score":0.7616464,"about_ca_system_score_codex":0.000019051075,"about_ca_system_score_gemma":0.000053168915,"threshold_uncertainty_score":0.5978551},"labels":[],"label_agreement":null},{"id":"W2227783245","doi":"","title":"Advances in Artificial Intelligence: 19th Conference of the Canadian Society for Computational Studies of Intelligence, Canadian AI 2006, Quebec City, ... (Lecture Notes in Computer Science)","year":2006,"lang":"en","type":"book","venue":"Springer eBooks","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Library science; Artificial intelligence; Data science; Operations research; Engineering","score_opus":0.04095342543751496,"score_gpt":0.28636844575784365,"score_spread":0.2454150203203287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2227783245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007486564,0.001618902,0.97764796,0.0010504904,0.00129518,0.0014547457,0.00021135881,0.000041340238,0.015931355],"genre_scores_gemma":[0.939091,0.000019043617,0.056820773,0.00066295854,0.0002141917,0.000049693153,0.000033282067,0.000035112418,0.0030739082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99707824,0.000054436383,0.0008628832,0.00069832447,0.0005814758,0.0007246226],"domain_scores_gemma":[0.9976767,0.00052541343,0.00041418662,0.0004646758,0.0007425877,0.00017648864],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011559941,0.0003725467,0.00059985573,0.0008231966,0.00040350884,0.00017365422,0.0017036821,0.00029332933,0.0000049513465],"category_scores_gemma":[0.000088965295,0.00032491097,0.00022688542,0.0004759639,0.0012485496,0.00020206992,0.0002600279,0.0006799999,0.0000013892156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013096146,0.000036344944,0.0037199075,0.000554371,0.000069228474,0.000013728722,0.009917996,0.41883448,0.000011084732,0.21327266,0.00065960415,0.35289752],"study_design_scores_gemma":[0.00015610436,0.00014665995,0.0009820103,0.003032461,0.00003611458,0.0000064202354,0.00007578759,0.31008717,0.0022256232,0.6747106,0.007513805,0.0010272796],"about_ca_topic_score_codex":0.56592464,"about_ca_topic_score_gemma":0.9925099,"teacher_disagreement_score":0.9383424,"about_ca_system_score_codex":0.0012265784,"about_ca_system_score_gemma":0.015950736,"threshold_uncertainty_score":0.9999203},"labels":[],"label_agreement":null},{"id":"W2231331107","doi":"","title":"Special Track on Case-Based Reasoning","year":2011,"lang":"en","type":"article","venue":"The Florida AI Research Society","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Case-based reasoning; Computer science; Track (disk drive); Field (mathematics); Data science; Artificial intelligence","score_opus":0.13433494284668407,"score_gpt":0.34594532812033996,"score_spread":0.2116103852736559,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2231331107","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42054656,0.0006463118,0.31748468,0.026418922,0.007196964,0.002617546,0.0000630042,0.0020752186,0.2229508],"genre_scores_gemma":[0.9556237,0.000019288851,0.034728788,0.0021673886,0.0056135366,0.00007425394,0.0000061577593,0.000040813917,0.0017260913],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969578,0.0005418484,0.00020384362,0.0004905833,0.00094457745,0.0008613668],"domain_scores_gemma":[0.9975098,0.0009829196,0.00005523122,0.0010237847,0.00023782258,0.00019048135],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0050833393,0.00017654344,0.00015822361,0.00006616085,0.00145573,0.0002877118,0.0014781833,0.00012087394,0.00017772167],"category_scores_gemma":[0.00019173998,0.00012428027,0.00020770289,0.0008443221,0.00026541785,0.000270924,0.00026948174,0.0013900922,0.00033025822],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015332324,0.00021238036,0.0013502273,0.00007233455,0.000108876215,0.001666138,0.04938534,0.0010296089,0.00024888877,0.065806605,0.8451144,0.034851883],"study_design_scores_gemma":[0.0036679208,0.003009248,0.0059009683,0.0008132316,0.000048350077,0.0010136204,0.004648602,0.6944691,0.023200464,0.025781006,0.23541524,0.002032235],"about_ca_topic_score_codex":0.00039394057,"about_ca_topic_score_gemma":0.000013854708,"teacher_disagreement_score":0.6934395,"about_ca_system_score_codex":0.0001348365,"about_ca_system_score_gemma":0.00034814552,"threshold_uncertainty_score":0.99984425},"labels":[],"label_agreement":null},{"id":"W2257479943","doi":"","title":"Instance-Specific Remodelling of Planning Domains by Adding Macros and Removing Operators","year":2013,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Macro; Domain (mathematical analysis); Computer science; Operator (biology); Set (abstract data type); Algorithm; Artificial intelligence; Mathematics; Programming language","score_opus":0.013673235178246701,"score_gpt":0.2178642192697875,"score_spread":0.2041909840915408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2257479943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30968428,0.0016535086,0.6826224,0.00012696699,0.00010898242,0.00013073694,0.0000028433758,0.00015164082,0.0055186767],"genre_scores_gemma":[0.7894956,0.00005646797,0.21000294,0.00015425382,0.000025821482,0.000005364722,0.0000031494478,0.000012136654,0.0002442834],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860907,0.000051047176,0.0003429946,0.00041730094,0.00021942791,0.0003601445],"domain_scores_gemma":[0.9991162,0.00021251157,0.0001220285,0.0003493907,0.00007619863,0.0001237089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037439412,0.00017119922,0.00021868898,0.00010726053,0.00026674816,0.00028961166,0.0004454172,0.00007965814,0.00003311958],"category_scores_gemma":[0.000019579587,0.0001544199,0.000033447803,0.00029089948,0.000050453018,0.0008165722,0.0001727966,0.00019467532,0.000013446961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053256186,0.00017562431,0.08882307,0.00045079348,0.00017140062,0.000104449384,0.03847138,0.055512793,0.37297136,0.14943132,0.09190085,0.20193373],"study_design_scores_gemma":[0.0010326877,0.00016974947,0.0008822906,0.0010063482,0.000008768541,0.00005931832,0.0010103292,0.9372754,0.034535356,0.0025915313,0.020406248,0.0010219836],"about_ca_topic_score_codex":0.00011438538,"about_ca_topic_score_gemma":0.0000010643224,"teacher_disagreement_score":0.8817626,"about_ca_system_score_codex":0.000029166025,"about_ca_system_score_gemma":0.000037986865,"threshold_uncertainty_score":0.6297061},"labels":[],"label_agreement":null},{"id":"W2266252559","doi":"10.1007/978-3-642-38484-4_20","title":"Synthesizing a Library of Process Templates through Partial-Order Planning Algorithms","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in business information processing","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Concurrency; Computer science; Template; Process (computing); Exploit; Context (archaeology); Variety (cybernetics); Distributed computing; Theoretical computer science; Programming language; Artificial intelligence","score_opus":0.01980785668614663,"score_gpt":0.24590575024184905,"score_spread":0.22609789355570242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2266252559","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010889634,0.0030646033,0.954051,0.00079791667,0.00028198166,0.0004337311,0.000014097482,0.00043799164,0.040809736],"genre_scores_gemma":[0.36473075,0.0002591929,0.628875,0.0029648996,0.00061589514,0.00018489614,0.0006882962,0.00025014672,0.0014308952],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723154,0.000027825448,0.0012311246,0.00043591348,0.00058956956,0.00048401597],"domain_scores_gemma":[0.9970791,0.00040947695,0.0014075913,0.00046431893,0.0005749658,0.000064559084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002505087,0.0005963065,0.0006889214,0.0006004457,0.00027337993,0.00078332913,0.0009770351,0.00064719626,0.00010160894],"category_scores_gemma":[0.00031982234,0.0005383174,0.00007401505,0.00078118365,0.00011356742,0.009284853,0.00024165986,0.0007393852,0.00004034906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005361136,0.000039195813,0.00078254036,0.007591085,0.00008165415,0.00003207853,0.023789488,0.24862204,0.000017585275,0.011210577,0.0004048976,0.7073752],"study_design_scores_gemma":[0.0012703071,0.00012183818,0.0002751429,0.03495548,0.00011329785,0.00015440349,0.00014657786,0.73287445,0.007513387,0.16354458,0.05568156,0.003348945],"about_ca_topic_score_codex":0.00002512923,"about_ca_topic_score_gemma":6.475098e-7,"teacher_disagreement_score":0.7040263,"about_ca_system_score_codex":0.000051958184,"about_ca_system_score_gemma":0.0006637546,"threshold_uncertainty_score":0.99970686},"labels":[],"label_agreement":null},{"id":"W2267298262","doi":"","title":"Korf's Conjecture and the Future of Abstraction-Based Heuristics","year":2013,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Cube (algebra); Abstraction; Heuristic; Conjecture; Computer science; Inverse; Theoretical computer science; Mathematics; Artificial intelligence; Discrete mathematics; Combinatorics; Epistemology; Philosophy","score_opus":0.0039409007273051066,"score_gpt":0.1891723741899666,"score_spread":0.1852314734626615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2267298262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055687208,0.0020733369,0.8819474,0.041650698,0.0009441751,0.0005402707,0.000007768801,0.00028244653,0.016866682],"genre_scores_gemma":[0.9729656,0.00000831451,0.025869088,0.00083367206,0.00007258323,0.000005629167,0.0000016802561,0.0000030528365,0.00024037874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994985,0.000040982526,0.00012261032,0.0001224002,0.000111996684,0.00010350287],"domain_scores_gemma":[0.99914986,0.00043463553,0.00007295132,0.000242868,0.000062242565,0.000037415542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018568896,0.00007107824,0.000096717486,0.000025230214,0.000094242736,0.000087744076,0.00023999058,0.000049930975,0.000060404753],"category_scores_gemma":[0.000019599827,0.000039575752,0.000027199698,0.0000925866,0.00006923784,0.000100216836,0.000030756793,0.0001306371,0.000016225207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047738315,0.00008748433,0.012801228,0.00019369546,0.000079984704,0.000011013733,0.0024596213,0.007311838,0.0005535237,0.7380529,0.100565374,0.13783558],"study_design_scores_gemma":[0.004231953,0.000270783,0.035238802,0.00011702046,0.00004385038,0.000057492663,0.0004977669,0.8152859,0.0046360176,0.098097615,0.040843826,0.00067894417],"about_ca_topic_score_codex":0.00022372181,"about_ca_topic_score_gemma":0.000008977161,"teacher_disagreement_score":0.9172784,"about_ca_system_score_codex":0.000003774023,"about_ca_system_score_gemma":0.00003949849,"threshold_uncertainty_score":0.16138524},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04241536260847029,"score_gpt":0.2743744785948414,"score_spread":0.2319591159863711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274199420","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9442941,0.0005237681,0.0064017004,0.0018576462,0.0005027756,0.00026374258,0.000012415322,0.0008547973,0.045289043],"genre_scores_gemma":[0.9742941,0.0000037814737,0.025128176,0.00022431553,0.00011217685,0.000017386874,0.0000043523187,0.000015123915,0.00020055663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981924,0.00002846033,0.0004073429,0.00037932227,0.0005651216,0.00042732613],"domain_scores_gemma":[0.99886614,0.00019567566,0.00040187556,0.00014687856,0.00023797416,0.00015147535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010975375,0.00026164766,0.0002918963,0.0002175834,0.00029929384,0.00036626452,0.0011944071,0.0001386543,0.0000059506206],"category_scores_gemma":[0.0003121681,0.00019822412,0.00009123974,0.0002526742,0.00009849834,0.0005365153,0.0002964469,0.00046647913,0.000003195063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013315688,0.0007137256,0.34937516,0.00067001075,0.0011744285,0.000020924228,0.07246166,0.0943426,0.05645728,0.4063071,0.009137493,0.008008076],"study_design_scores_gemma":[0.0008767197,0.000057098645,0.002760997,0.00093680783,0.000021604867,0.0000949174,0.0013455595,0.9893411,0.0034688322,0.0004576184,0.0003527643,0.00028601018],"about_ca_topic_score_codex":0.000018767274,"about_ca_topic_score_gemma":4.8557144e-8,"teacher_disagreement_score":0.8949985,"about_ca_system_score_codex":0.000039921684,"about_ca_system_score_gemma":0.00006455607,"threshold_uncertainty_score":0.8083345},"labels":[],"label_agreement":null},{"id":"W22742215","doi":"10.1021/ac00253a705","title":"Conflict Resolution Support System: A Software for the Resolution of Conflicts in Water Resource Management","year":2003,"lang":"en","type":"article","venue":"Analytical Chemistry","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute for Catastrophic Loss Reduction","keywords":"Resolution (logic); Conflict resolution; Resource (disambiguation); Computer science; Conflict management; Software; Resource management (computing); Business; Environmental resource management; Knowledge management; Process management; Political science; Environmental science; Artificial intelligence; Distributed computing; Operating system","score_opus":0.02295855041595155,"score_gpt":0.24611205873323133,"score_spread":0.2231535083172798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W22742215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011605693,0.00045819726,0.944406,0.0013433236,0.00010795015,0.00061173725,0.000014016636,0.00020835128,0.04124473],"genre_scores_gemma":[0.9884082,0.000005794605,0.008113342,0.00015521815,0.00003746977,0.00004761509,0.000031379837,0.000011290142,0.0031896837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986706,0.000049756964,0.00035087115,0.0003195618,0.00024663517,0.00036260395],"domain_scores_gemma":[0.99900854,0.00026364045,0.00007398922,0.0005026153,0.000082015664,0.00006917909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010557644,0.00012410508,0.00018069604,0.00003840587,0.00011292488,0.000045202607,0.00042095527,0.00010573464,0.00001760321],"category_scores_gemma":[0.00012505027,0.00008647941,0.00007717024,0.00022465724,0.00006694785,0.00006669145,0.000085357075,0.00015107359,0.000007903551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013553738,0.0014149254,0.018776111,0.02097717,0.0017684607,0.0008439377,0.013690982,0.119155295,0.02105471,0.634473,0.15365402,0.012836007],"study_design_scores_gemma":[0.0023734982,0.00015043808,0.0006110564,0.00065658323,0.00018874493,0.00008952139,0.0007462894,0.49956957,0.06767849,0.00072617276,0.42655745,0.0006521884],"about_ca_topic_score_codex":0.00002100332,"about_ca_topic_score_gemma":9.031023e-7,"teacher_disagreement_score":0.9768025,"about_ca_system_score_codex":0.000082453575,"about_ca_system_score_gemma":0.00003585524,"threshold_uncertainty_score":0.35265282},"labels":[],"label_agreement":null},{"id":"W2290243003","doi":"","title":"Using a recursive neural network to learn an agent's decision model for plan recognition","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Plan (archaeology); Artificial intelligence; Benchmark (surveying); Machine learning; A priori and a posteriori; Key (lock); Artificial neural network; Decision model; State (computer science); Algorithm","score_opus":0.49434150446930586,"score_gpt":0.41361309999127155,"score_spread":0.08072840447803431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290243003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033675697,0.00000910497,0.9622842,0.001267278,0.0015644904,0.00030695883,0.00003423813,0.0001119516,0.0007460897],"genre_scores_gemma":[0.75075704,0.0000024626547,0.24782005,0.0009468147,0.0003130109,0.000030583295,0.00004597706,0.000012741717,0.000071307644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980918,0.000082535815,0.00040820288,0.00057881046,0.00047958258,0.00035906347],"domain_scores_gemma":[0.99826515,0.00021030131,0.00015209058,0.00030452578,0.00077655393,0.00029136124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000698927,0.00019353037,0.00016121358,0.00018467235,0.00018863927,0.0004852446,0.0010221963,0.00009193793,0.000026968422],"category_scores_gemma":[0.00039393269,0.00019842162,0.00006418958,0.00024098394,0.000032300384,0.00061017834,0.00013542533,0.00020149408,0.00014699003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030388642,0.000054999913,0.00002418603,0.0000017566523,0.00000874896,0.0000067096207,0.0015786766,0.68435353,0.00029575767,0.092903905,0.0005116263,0.21995619],"study_design_scores_gemma":[0.000036391306,0.00028440706,0.0000036468634,0.0001038817,0.0000036221625,0.0000064651276,0.00013378524,0.7103404,0.001201148,0.28755754,0.00014755869,0.00018118258],"about_ca_topic_score_codex":0.00007224689,"about_ca_topic_score_gemma":0.000095040086,"teacher_disagreement_score":0.71708137,"about_ca_system_score_codex":0.00013492533,"about_ca_system_score_gemma":0.0002058624,"threshold_uncertainty_score":0.80913985},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0722721480175147,"score_gpt":0.27603751006543265,"score_spread":0.20376536204791795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293119400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44958228,0.00009703535,0.520464,0.012337009,0.0007257387,0.0005123089,0.0000074669015,0.00027013355,0.016004039],"genre_scores_gemma":[0.9869663,0.0000154545,0.012316693,0.0003475372,0.000087537635,0.000018968547,0.0000016568872,0.000010076717,0.00023575421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983822,0.000030677416,0.00033502877,0.00051368156,0.00044425935,0.0002941375],"domain_scores_gemma":[0.9983206,0.00007286285,0.0002608247,0.00027475326,0.0009972611,0.00007369516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035096952,0.0001852876,0.00019712884,0.00006645446,0.00029674007,0.0002822063,0.0007888458,0.00007868574,0.000033018765],"category_scores_gemma":[0.0002057618,0.00013237275,0.000063916035,0.0007672808,0.00010664923,0.00039779002,0.00018023209,0.00028421724,0.000039890692],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006469123,0.00016578176,0.00089815893,0.000036386373,0.000029786792,0.0000041087733,0.0033443563,0.001936255,0.28945512,0.657002,0.00066071225,0.046402648],"study_design_scores_gemma":[0.0000230404,0.00014881516,0.000087470675,0.00018485401,0.000010062671,0.0000112182415,0.00018276964,0.17037435,0.8148531,0.013867739,0.00009325913,0.00016337914],"about_ca_topic_score_codex":0.000031967258,"about_ca_topic_score_gemma":0.000015870257,"teacher_disagreement_score":0.64313424,"about_ca_system_score_codex":0.00003987433,"about_ca_system_score_gemma":0.00027836254,"threshold_uncertainty_score":0.5398004},"labels":[],"label_agreement":null},{"id":"W2293478223","doi":"10.1609/aaai.v28i1.8850","title":"Worst-Case Solution Quality Analysis When Not Re-Expanding Nodes in Best-First Search","year":2014,"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":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Heuristic; Quality (philosophy); Weighting; Upper and lower bounds; Bounded function; Computer science; Mathematical optimization; Process (computing); Quadratic equation; Mathematics","score_opus":0.161165875110203,"score_gpt":0.35136251817553654,"score_spread":0.19019664306533354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293478223","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5082581,0.000020560643,0.48027298,0.006065208,0.00022391757,0.00031376333,0.0000061416836,0.00011461677,0.0047247284],"genre_scores_gemma":[0.98944414,0.000010752663,0.010182542,0.0001620165,0.000055273777,0.000018657425,0.0000010914836,0.000010295908,0.00011524716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972534,0.00009139125,0.00080156355,0.0006991396,0.0006265261,0.00052796124],"domain_scores_gemma":[0.99802345,0.0005008983,0.00040980458,0.00046193693,0.00048171918,0.00012220549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033246512,0.00025422755,0.00043118943,0.00048855355,0.00044313056,0.00039943997,0.0016575445,0.00013582838,0.000043507083],"category_scores_gemma":[0.0008472298,0.00020933765,0.00018730396,0.0016759731,0.00019925143,0.0005330902,0.00044186437,0.00049690274,0.000057562545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018011098,0.00031252074,0.022397012,0.00017431403,0.000100497324,0.000008376835,0.014911304,0.005340471,0.013151449,0.8644441,0.00006289391,0.078916974],"study_design_scores_gemma":[0.0000642721,0.00019798019,0.0012026364,0.00047335893,0.00006534081,0.000011688833,0.0013038126,0.7828831,0.14322168,0.070096515,0.000036073026,0.00044352197],"about_ca_topic_score_codex":0.0015519321,"about_ca_topic_score_gemma":0.0006043301,"teacher_disagreement_score":0.7943476,"about_ca_system_score_codex":0.00009956063,"about_ca_system_score_gemma":0.000075336815,"threshold_uncertainty_score":0.8536542},"labels":[],"label_agreement":null},{"id":"W2294022199","doi":"10.1007/978-3-319-06483-3_15","title":"Partial Satisfaction Planning under Time Uncertainty with Control on When Objectives Can Be Aborted","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Abort; Computer science; Plan (archaeology); Control (management); Operations research; Mathematical optimization; Order (exchange); Artificial intelligence; Mathematics","score_opus":0.013102735579235032,"score_gpt":0.23088964101637782,"score_spread":0.2177869054371428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294022199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000572779,0.00008959261,0.99453026,0.0019864694,0.0006544831,0.00038792117,0.000017639088,0.00029109218,0.0014697489],"genre_scores_gemma":[0.9204247,0.0000024864753,0.073539995,0.005122182,0.0005054824,0.000015713362,0.000021050368,0.00004964453,0.0003187691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99609125,0.0001161788,0.0004194121,0.0015616141,0.0010534002,0.0007581306],"domain_scores_gemma":[0.996956,0.0012029486,0.0003988895,0.0010155422,0.00021277765,0.00021387884],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008906935,0.00063172495,0.0006165457,0.00059694354,0.00049265916,0.00057541486,0.0013765332,0.0003354141,0.000026998086],"category_scores_gemma":[0.00006107386,0.00051373825,0.00009073768,0.00033509528,0.0004764768,0.00029364455,0.0002159586,0.0010617198,0.000025592492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057023903,0.000010267591,0.00057571515,0.00001679465,0.00003736426,0.00005345932,0.001390351,0.9101528,0.00006431114,0.0044476963,0.00009340895,0.08310084],"study_design_scores_gemma":[0.0008697633,0.0008869055,0.001075396,0.0009986847,0.000025181016,0.000059222173,5.723681e-7,0.96717334,0.0002442227,0.026971927,0.0007632616,0.0009315187],"about_ca_topic_score_codex":0.00021679676,"about_ca_topic_score_gemma":0.00017670768,"teacher_disagreement_score":0.9209903,"about_ca_system_score_codex":0.00037618275,"about_ca_system_score_gemma":0.00069545506,"threshold_uncertainty_score":0.9997314},"labels":[],"label_agreement":null},{"id":"W2294462963","doi":"10.3233/978-1-61499-419-0-1197","title":"An Integrated Reconfigurable System for Maritime Situational Awareness","year":2014,"lang":"en","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Situational ethics; Situation awareness; Computer science; Systems engineering; Human–computer interaction; Engineering; Psychology; Aerospace engineering; Social psychology","score_opus":0.03934938872014841,"score_gpt":0.27096406525319783,"score_spread":0.2316146765330494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294462963","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000032473263,0.00034511238,0.98393196,0.00022433163,0.00035662632,0.0007115231,0.00010631246,0.00014858233,0.014172292],"genre_scores_gemma":[0.10866352,0.00035553926,0.8038694,0.00066343177,0.0018522217,0.003412225,0.0032720664,0.00020809301,0.07770348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983872,0.000030113099,0.0005237057,0.0006588939,0.00015093067,0.00024914963],"domain_scores_gemma":[0.9988131,0.00017020345,0.00021021129,0.0005044691,0.0001904035,0.00011163774],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004977069,0.00024989704,0.00034054005,0.0002668118,0.00033401002,0.0002433981,0.0006498245,0.00028107638,0.000015384978],"category_scores_gemma":[0.000014535585,0.0002674831,0.000065808184,0.00011827322,0.00009811842,0.00016481959,0.000029239653,0.0002612214,0.00003747941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008031168,0.000012878583,0.000024651068,0.00006007711,0.000012243318,6.9815394e-7,0.000086797976,0.0014003552,0.0000111232885,0.65430766,0.0011237802,0.34295171],"study_design_scores_gemma":[0.000027899932,0.00008520559,0.0000035217079,0.00033030365,0.000025942109,0.000006225711,0.00017120104,0.42724916,0.00067832816,0.39238927,0.17855604,0.00047691294],"about_ca_topic_score_codex":0.000052703468,"about_ca_topic_score_gemma":0.000048733473,"teacher_disagreement_score":0.4258488,"about_ca_system_score_codex":0.000098104494,"about_ca_system_score_gemma":0.00018518015,"threshold_uncertainty_score":0.9999777},"labels":[],"label_agreement":null},{"id":"W2295532854","doi":"10.1609/socs.v1i1.18160","title":"Common Misconceptions Concerning Heuristic Search","year":2010,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Incremental heuristic search; Heuristic; Node (physics); Null-move heuristic; Beam search; Consistent heuristic; Bidirectional search; Simple (philosophy); Computer science; Best-first search; Search algorithm; Function (biology); Mathematical optimization; Mathematics; Theoretical computer science; Algorithm; Epistemology; Engineering","score_opus":0.019377096203426453,"score_gpt":0.2739802742194933,"score_spread":0.2546031780160668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295532854","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93937045,0.000012369703,0.0005303187,0.01203144,0.007134639,0.00032894724,0.000014890782,0.0001497481,0.040427197],"genre_scores_gemma":[0.997801,0.000004417301,0.0010263573,0.00014063851,0.00046149085,0.000016335629,0.0000032774299,0.000015839161,0.0005306176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99771106,0.00003315333,0.00032761804,0.00039003915,0.0012038558,0.00033424306],"domain_scores_gemma":[0.9983813,0.0004433343,0.00015417366,0.000252791,0.00064840936,0.000119986704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012524687,0.00016557587,0.0001815256,0.00011004763,0.00037978234,0.00036724666,0.0031415753,0.00011323111,0.000051598607],"category_scores_gemma":[0.00022084276,0.00013437514,0.00012062662,0.00035542008,0.00022257703,0.00034114032,0.0007482808,0.000986249,0.000043868524],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005858083,0.00016078586,0.017861929,0.000029037337,0.000044863107,0.0000016342212,0.0009768826,0.0002920633,0.16038238,0.8170647,0.0018312393,0.0012958978],"study_design_scores_gemma":[0.004297404,0.0009911504,0.011494157,0.0008603719,0.00004582881,0.00011615581,0.0003483828,0.1119116,0.7538172,0.07672968,0.038150553,0.0012375088],"about_ca_topic_score_codex":0.00020669878,"about_ca_topic_score_gemma":0.000002986018,"teacher_disagreement_score":0.74033505,"about_ca_system_score_codex":0.00009722846,"about_ca_system_score_gemma":0.000116850715,"threshold_uncertainty_score":0.5837881},"labels":[],"label_agreement":null},{"id":"W2296391375","doi":"10.1007/bfb0018372","title":"The platypus expert system shell","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Backtracking; Computer science; Platypus; Domain (mathematical analysis); Expert system; Artificial intelligence; Shell (structure); Programming language; Representation (politics); Constraint (computer-aided design); Task (project management); Process (computing); Theoretical computer science; Mathematics; Engineering","score_opus":0.014670839722368482,"score_gpt":0.22896063741880365,"score_spread":0.21428979769643516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296391375","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010620792,0.0041111773,0.9784539,0.0016086611,0.002970762,0.0002893109,0.0000029980579,0.00036367623,0.0121889],"genre_scores_gemma":[0.17909351,0.00029361836,0.8065104,0.0046267943,0.0039805793,0.000040771327,0.000010000876,0.00012726882,0.005317041],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996053,0.000056256606,0.00056239264,0.0013720486,0.0010688462,0.00088749913],"domain_scores_gemma":[0.996168,0.001320398,0.00031040172,0.0018294508,0.00017735368,0.00019436053],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015145624,0.0005491212,0.00043519243,0.00037916712,0.0009655317,0.0011664458,0.005158875,0.0003461204,0.000008664789],"category_scores_gemma":[0.00005982633,0.0003909923,0.00014525515,0.0004355537,0.00053826673,0.0004557202,0.0011411426,0.0010357865,0.00014904291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006590939,0.000008939451,0.000021326008,0.000032670276,0.000013529665,0.00012100126,0.001190442,0.041121487,0.00003264327,0.054108012,0.0003746578,0.9029687],"study_design_scores_gemma":[0.00022522328,0.00013821365,0.00002086768,0.0010381616,0.0000059775407,0.00023401772,6.788981e-7,0.917999,0.0005212802,0.017894287,0.06105964,0.00086261064],"about_ca_topic_score_codex":0.00003402025,"about_ca_topic_score_gemma":0.000051841987,"teacher_disagreement_score":0.9021061,"about_ca_system_score_codex":0.00044465568,"about_ca_system_score_gemma":0.00058267673,"threshold_uncertainty_score":0.9998704},"labels":[],"label_agreement":null},{"id":"W2317952363","doi":"10.2514/6.2006-5913","title":"Autonomous Simulators: Taking Distance Learning to New Heights","year":2006,"lang":"en","type":"article","venue":"SpaceOps 2006 Conference","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Space Agency","funders":"","keywords":"Computer science; Artificial intelligence; Human–computer interaction; Simulation","score_opus":0.015422154726384127,"score_gpt":0.23714540305681725,"score_spread":0.2217232483304331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2317952363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02058302,0.0003531198,0.95798415,0.001824204,0.00032813218,0.00018542237,0.0000039308097,0.00064750697,0.018090514],"genre_scores_gemma":[0.92602956,0.0000023756024,0.05916922,0.00024070755,0.00024092593,0.000007770126,0.000009548435,0.000020146048,0.014279771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99786943,0.00008395151,0.000313812,0.00069881324,0.0003597229,0.00067427434],"domain_scores_gemma":[0.9986362,0.00017154672,0.00023121905,0.0005771816,0.0001244217,0.00025946234],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025648647,0.0002962513,0.0002786728,0.00014635426,0.0003381635,0.00056224037,0.0008974214,0.00010914904,0.00008277541],"category_scores_gemma":[0.000093074705,0.0002953283,0.000069590234,0.0005721556,0.000034138222,0.0004303709,0.00020729295,0.00036641807,0.00029301728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040013772,0.00011372045,0.04516238,0.00007061455,0.000038640632,0.00021806156,0.006079935,0.35467649,0.002280493,0.44507167,0.027972346,0.11827565],"study_design_scores_gemma":[0.0010679746,0.00038521006,0.015508048,0.0006420585,0.000022507491,0.000029692794,0.00012489625,0.42320117,0.004007077,0.023339856,0.5297925,0.001879011],"about_ca_topic_score_codex":0.0021226432,"about_ca_topic_score_gemma":0.0004290021,"teacher_disagreement_score":0.9054465,"about_ca_system_score_codex":0.000091313384,"about_ca_system_score_gemma":0.0003695168,"threshold_uncertainty_score":0.9999499},"labels":[],"label_agreement":null},{"id":"W2326804210","doi":"10.1177/154193120605000308","title":"Numerical Models in Representation Design: Computing Seawater Properties in an Ecological Interface","year":2006,"lang":"en","type":"article","venue":"Proceedings of the Human Factors and Ergonomics Society Annual Meeting","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Representation (politics); Interface (matter); Range (aeronautics); Complex system; Theoretical computer science; Ecology; Artificial intelligence; Engineering","score_opus":0.04344008347242933,"score_gpt":0.2535226092652448,"score_spread":0.21008252579281544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2326804210","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99482465,0.000057755522,0.004647025,0.00010296693,0.000043855754,0.00017072516,7.766234e-7,0.000047066398,0.00010520021],"genre_scores_gemma":[0.987516,0.0000029514879,0.012385223,0.000033603264,0.000032371074,0.000004356627,9.425738e-7,0.000009303414,0.000015241752],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987872,0.000037971062,0.00040121275,0.00036450388,0.000115061026,0.00029405084],"domain_scores_gemma":[0.9995068,0.000089165835,0.00021393137,0.00007941041,0.00007508647,0.000035626883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007208027,0.00015909591,0.00023106899,0.00004368288,0.0002493412,0.00017585246,0.0004648745,0.00010330681,4.164196e-7],"category_scores_gemma":[0.000027490449,0.00011409183,0.00006938542,0.00017860295,0.00007949195,0.0008374685,0.00030143018,0.00027168044,1.4077999e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030461393,0.00021079108,0.62861454,0.000100589416,0.000011483414,3.7130212e-7,0.04811889,0.31017756,0.01010899,0.0021417388,0.00016341472,0.00032118274],"study_design_scores_gemma":[0.00032087945,0.00010980419,0.11223816,0.0002296569,0.000004599282,0.0000021276844,0.0039528958,0.86421365,0.014487388,0.004184693,0.000004260571,0.00025186606],"about_ca_topic_score_codex":0.00062296673,"about_ca_topic_score_gemma":0.00001421158,"teacher_disagreement_score":0.5540361,"about_ca_system_score_codex":0.000082548286,"about_ca_system_score_gemma":0.000018641287,"threshold_uncertainty_score":0.465253},"labels":[],"label_agreement":null},{"id":"W2330370478","doi":"10.2514/6.2012-2440","title":"Bayesian Decision Making for Planetary Micro-Rovers","year":2012,"lang":"en","type":"article","venue":"Infotech@Aerospace 2012","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Bayesian probability; Computer science; Artificial intelligence; Astrobiology; Physics","score_opus":0.014196210263470434,"score_gpt":0.2593444074855263,"score_spread":0.24514819722205586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2330370478","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01005368,0.0014562773,0.9847539,0.0006456047,0.0012617406,0.0003184131,0.00002423735,0.00036713088,0.0011190044],"genre_scores_gemma":[0.565224,0.000010376267,0.43326092,0.00082552596,0.00027741631,0.000020488837,0.000016120759,0.000024055616,0.00034109733],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981374,0.00004282093,0.0002886564,0.0003465287,0.00030154848,0.00088303385],"domain_scores_gemma":[0.9981662,0.00068009563,0.00018260456,0.00069024804,0.00005546926,0.00022540044],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082153716,0.00026651577,0.00023993404,0.00015390512,0.00031701147,0.00019217667,0.00081463275,0.00022743878,0.000053658998],"category_scores_gemma":[0.00011536828,0.00025495153,0.00011597086,0.0002763343,0.000037960635,0.0015098772,0.00021712681,0.0002783807,0.00022884962],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028381462,0.00027694894,0.10287858,0.00029435664,0.00018663055,0.000032863914,0.0077987076,0.0075059957,0.00707714,0.019577974,0.4675781,0.38650888],"study_design_scores_gemma":[0.0030105528,0.0006271687,0.028780667,0.0012225857,0.00010603339,0.0002884226,0.00026735422,0.09882781,0.010352345,0.008489863,0.84505194,0.0029752543],"about_ca_topic_score_codex":0.000033915796,"about_ca_topic_score_gemma":0.000011617615,"teacher_disagreement_score":0.5551703,"about_ca_system_score_codex":0.0000736945,"about_ca_system_score_gemma":0.00006285237,"threshold_uncertainty_score":0.9999903},"labels":[],"label_agreement":null},{"id":"W2332012602","doi":"10.2514/6.2004-6224","title":"Inference Techniques for Diagnosis Based on Set Operations","year":2004,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Space Agency","funders":"","keywords":"Computer science; Inference; Set (abstract data type); Artificial intelligence; Data mining; Programming language","score_opus":0.036717085343572674,"score_gpt":0.30555229553404434,"score_spread":0.2688352101904717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2332012602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00092892756,0.000007716425,0.990714,0.00539402,0.000056194636,0.0002116476,0.000009641701,0.0004117267,0.0022661288],"genre_scores_gemma":[0.5642284,0.0000016490859,0.4333642,0.0021087704,0.000019295025,0.00019428531,0.000009348354,0.0000034478846,0.00007057504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941355,0.00001626696,0.00010569929,0.00021209058,0.000099254714,0.00015315972],"domain_scores_gemma":[0.99930704,0.00028097793,0.000016389466,0.00028706662,0.000060163486,0.000048348436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018194136,0.00008213812,0.00007059097,0.00007433545,0.00018494435,0.00014958206,0.00034275727,0.0000433931,0.000017467579],"category_scores_gemma":[0.00009866716,0.00006860626,0.00003435222,0.0001585809,0.000012021743,0.00019713397,0.00003071498,0.000065682885,0.000020874933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012164875,0.00027685394,0.0071124234,0.000047535,0.000013505855,0.0000093612325,0.00098485,0.30725697,0.00031633017,0.607817,0.013266533,0.0628865],"study_design_scores_gemma":[0.0007482453,0.0011770874,0.0005727067,0.0002979072,0.000008389082,0.0000022290246,0.00001673862,0.82205236,0.13539357,0.019813921,0.019359559,0.00055726623],"about_ca_topic_score_codex":0.00011208277,"about_ca_topic_score_gemma":0.00003647024,"teacher_disagreement_score":0.58800304,"about_ca_system_score_codex":0.000030396164,"about_ca_system_score_gemma":0.00012385478,"threshold_uncertainty_score":0.2797682},"labels":[],"label_agreement":null},{"id":"W2338756529","doi":"","title":"Monitoring the generation and execution of optimal plans","year":2009,"lang":"en","type":"dissertation","venue":"TSpace (University of Toronto)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Relevance (law); Plan (archaeology); Computer science; Variety (cybernetics); State (computer science); Operations research; Process management; Risk analysis (engineering); Artificial intelligence; Engineering; Programming language; Business","score_opus":0.017012616198082236,"score_gpt":0.23883236358697346,"score_spread":0.22181974738889124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2338756529","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9226478,0.0040654563,0.056470297,0.00045793448,0.00058218424,0.00023028588,0.000011565475,0.00007867891,0.015455831],"genre_scores_gemma":[0.9806648,0.0004239782,0.01673013,0.000003221702,0.000057170022,1.246944e-7,0.000042720363,0.000004045154,0.0020738472],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99941564,0.000046467874,0.00007330671,0.00018593721,0.00017622416,0.000102432554],"domain_scores_gemma":[0.9994102,0.00003699191,0.00022514861,0.00021599288,0.000079912934,0.00003172603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015410483,0.00010127428,0.00015281598,0.0000308562,0.0001968951,0.000021714453,0.00035473626,0.00012387498,0.000042293163],"category_scores_gemma":[0.000006290797,0.00010558671,0.00004748794,0.000043327822,0.000022934331,0.00036508084,0.000033702603,0.00010315506,8.03713e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002075143,0.00009340669,0.0019318769,0.00033913497,0.00019358315,0.000023566668,0.18716913,0.0041261776,0.02431463,0.005387299,0.0018931673,0.7743205],"study_design_scores_gemma":[0.001098807,0.00083138666,0.8138083,0.0011092767,0.00027810188,0.000011973521,0.04054167,0.12886845,0.011625073,0.00010215929,0.0008715701,0.0008532386],"about_ca_topic_score_codex":0.019770512,"about_ca_topic_score_gemma":0.0062028486,"teacher_disagreement_score":0.8118764,"about_ca_system_score_codex":0.00005603562,"about_ca_system_score_gemma":0.000060406834,"threshold_uncertainty_score":0.9867569},"labels":[],"label_agreement":null},{"id":"W2346229182","doi":"","title":"An Intuitive and Flexible Architecture for Intelligent Mobile Robots","year":2005,"lang":"en","type":"dissertation","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Architecture; Mobile robot; Computer science; Robot; Artificial intelligence; Task (project management); Domain (mathematical analysis); Human–computer interaction; Tree (set theory); Finite-state machine; Perception; Feature (linguistics); Machine learning; Engineering; Systems engineering; Programming language","score_opus":0.013787200970220953,"score_gpt":0.29935661484005566,"score_spread":0.2855694138698347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2346229182","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005348092,0.0011604709,0.9845013,0.00010316979,0.0004281095,0.00069803384,0.000017802533,0.0003257688,0.0074172504],"genre_scores_gemma":[0.21309008,0.00018897944,0.74622566,0.0010171508,0.00073525024,0.0007701448,0.0023820405,0.00010332258,0.035487376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875605,0.00003698506,0.00021856939,0.0005600728,0.00015062233,0.0002776756],"domain_scores_gemma":[0.9991382,0.00017080513,0.00011682551,0.0003430996,0.000105902334,0.00012518077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021142843,0.00024970653,0.00023460353,0.00017387081,0.0001697013,0.00023803387,0.00049897825,0.00021747472,0.000032012973],"category_scores_gemma":[0.000016871954,0.00021855017,0.00006537154,0.00012919633,0.000014280754,0.000196568,0.000033243832,0.00026724648,0.000010157219],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006606705,0.00007711972,0.000051577867,0.00023023774,0.000050570947,0.0000036276037,0.01251624,0.020555915,0.00031521957,0.01793629,0.0021867768,0.94601035],"study_design_scores_gemma":[0.0023891919,0.008905616,0.001904999,0.0029079274,0.00029663177,0.000112427035,0.01054825,0.5240223,0.1403922,0.10163496,0.20022337,0.0066621234],"about_ca_topic_score_codex":0.00004453123,"about_ca_topic_score_gemma":0.0002290253,"teacher_disagreement_score":0.9393482,"about_ca_system_score_codex":0.000028382285,"about_ca_system_score_gemma":0.000115965566,"threshold_uncertainty_score":0.8912217},"labels":[],"label_agreement":null},{"id":"W2348095904","doi":"","title":"Non-Classification Case Retrieval Based on Rank Correlation","year":2010,"lang":"en","type":"article","venue":"Information and Computation","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Rank (graph theory); Correlation; Case-based reasoning; Rank correlation; Set (abstract data type); Computer science; Data mining; Artificial intelligence; Pattern recognition (psychology); Machine learning; Mathematics","score_opus":0.013450460459999003,"score_gpt":0.24655326903728855,"score_spread":0.23310280857728954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2348095904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12285269,0.0000020809714,0.87290865,0.00075664493,0.00043733278,0.00016105216,0.0000024416174,0.0001514862,0.0027276427],"genre_scores_gemma":[0.97670543,6.5048897e-7,0.022481516,0.00066178374,0.00003377655,0.0000051171855,0.00009527517,0.0000031248258,0.000013329585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992462,0.00002849013,0.00027462316,0.00012744588,0.00021166974,0.00011157445],"domain_scores_gemma":[0.99927336,0.0001502217,0.00019434986,0.00016496351,0.00014837395,0.000068729074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043126955,0.0000973888,0.00007276778,0.00021336571,0.00027322813,0.00028707046,0.00010125857,0.000093423645,0.0000073217184],"category_scores_gemma":[0.00006136997,0.000095622236,0.000022693268,0.0002807383,0.000025719957,0.0014033896,0.000017701384,0.00021702884,0.00008740594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016390285,0.00009093454,0.003583449,0.0001121573,0.000014052306,0.00003876381,0.008275832,0.232189,0.0008122813,0.04531164,0.0031044928,0.7063035],"study_design_scores_gemma":[0.0005213178,0.00007682353,0.006262338,0.00001609492,0.000003333768,0.000099851044,0.00006522298,0.99119425,0.00013833199,0.0005345043,0.00097161415,0.00011633192],"about_ca_topic_score_codex":0.000016443508,"about_ca_topic_score_gemma":0.0000025637453,"teacher_disagreement_score":0.85385275,"about_ca_system_score_codex":0.000019126006,"about_ca_system_score_gemma":0.000063884145,"threshold_uncertainty_score":0.38993615},"labels":[],"label_agreement":null},{"id":"W2378328303","doi":"","title":"Case-Based Reasoning for Diagnosis and Solution Planning *","year":2013,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Case-based reasoning; Computer science; Model-based reasoning; Artificial intelligence; Knowledge representation and reasoning","score_opus":0.036188172952965954,"score_gpt":0.2595943719862174,"score_spread":0.22340619903325143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2378328303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076076865,0.00021857137,0.9212792,0.0011957054,0.00009462929,0.00024918764,0.0000015862081,0.000228976,0.0006552687],"genre_scores_gemma":[0.68727386,0.0000010443755,0.31199342,0.00042790014,0.00003101448,0.00014991843,0.0000033096505,0.000005752055,0.000113798895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992265,0.000030467383,0.0001284113,0.00026910464,0.00008018292,0.00026532242],"domain_scores_gemma":[0.99907756,0.00053270883,0.000053122036,0.00018715972,0.0000584516,0.00009101923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027581226,0.0001005137,0.00009774205,0.00007045546,0.00032402718,0.0002555224,0.00014887779,0.00005454893,0.000019597035],"category_scores_gemma":[0.000078964615,0.000089477086,0.00002989397,0.00010863713,0.000017944076,0.00040387973,0.00005281667,0.000070696704,0.00001271477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002835494,0.00015946389,0.3328284,0.00038604185,0.00009361659,0.00063065195,0.004878516,0.016124282,0.0009583941,0.06809906,0.14012091,0.4356923],"study_design_scores_gemma":[0.00032992187,0.000116722986,0.0010604534,0.00009336335,0.000006255107,0.00016993159,0.000036380574,0.99391335,0.0011464081,0.0010508696,0.0018844586,0.0001918626],"about_ca_topic_score_codex":0.00034379424,"about_ca_topic_score_gemma":0.0000052028186,"teacher_disagreement_score":0.9777891,"about_ca_system_score_codex":0.000016957985,"about_ca_system_score_gemma":0.00003056779,"threshold_uncertainty_score":0.364877},"labels":[],"label_agreement":null},{"id":"W238850005","doi":"10.21236/ada454603","title":"Building SASO Wargaming Simulations Without Programmers","year":2006,"lang":"en","type":"report","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science","score_opus":0.03933405179017768,"score_gpt":0.3217373453963647,"score_spread":0.28240329360618704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W238850005","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032333678,0.0006498623,0.9138455,0.00019929973,0.0010210975,0.00033045042,0.0000122294,0.0009730347,0.082645215],"genre_scores_gemma":[0.2364359,0.000019427,0.7408873,0.00012047673,0.000652594,0.000028103068,0.00016354049,0.000071571754,0.021621104],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969006,0.000068164496,0.00056480174,0.000811033,0.0010125191,0.0006428358],"domain_scores_gemma":[0.99799156,0.0002725981,0.0004008764,0.0008264104,0.00036994525,0.00013860334],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008227903,0.0004064035,0.00045163045,0.00033796567,0.0003786354,0.0005426031,0.00094486855,0.00035663618,0.00002989896],"category_scores_gemma":[0.00013760987,0.00037421676,0.00017919256,0.0005549546,0.00004071027,0.00034295494,0.0002778008,0.00060192606,0.000028379616],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065569657,0.0002450803,0.050269563,0.00091260235,0.00042241407,0.00025871454,0.0008908353,0.10952896,0.00035766853,0.013873423,0.18378988,0.6394443],"study_design_scores_gemma":[0.00026369846,0.00008132125,0.0005358206,0.0007993137,0.00008457434,0.000110865076,0.000010941307,0.2724975,0.0002652298,0.0015771195,0.72253466,0.00123893],"about_ca_topic_score_codex":0.0019524888,"about_ca_topic_score_gemma":0.000104705134,"teacher_disagreement_score":0.63820535,"about_ca_system_score_codex":0.00026540912,"about_ca_system_score_gemma":0.0012007284,"threshold_uncertainty_score":0.99987096},"labels":[],"label_agreement":null},{"id":"W2394636111","doi":"10.1609/icaps.v22i1.13502","title":"Planning Via Random Walk-Driven Local Search","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":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Random walk; Satisficing; Local search (optimization); Computer science; Node (physics); Plan (archaeology); Mathematical optimization; Random search; Search algorithm; Quality (philosophy); Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Engineering; Statistics; Geography","score_opus":0.04381493788673569,"score_gpt":0.29650923569130333,"score_spread":0.25269429780456765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394636111","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9090116,0.00031380483,0.079330444,0.0017907282,0.0007156556,0.00017838646,0.0000058283995,0.0006185453,0.008034989],"genre_scores_gemma":[0.9827798,0.000005761039,0.01679641,0.0001993287,0.00010543942,0.000008970034,0.000004241547,0.000013664705,0.000086355976],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826866,0.000026000547,0.00035043582,0.00032400232,0.00060597487,0.00042489838],"domain_scores_gemma":[0.99897456,0.00020635586,0.0002517116,0.00012145957,0.0003008097,0.00014512379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091780233,0.00021872859,0.00024127276,0.00019646417,0.00030130002,0.00029214687,0.001137024,0.00012098632,0.000012249371],"category_scores_gemma":[0.00013662991,0.0001677519,0.000071592134,0.00023705763,0.00009884798,0.0006244498,0.00036717448,0.0004805618,0.000010807313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007502342,0.00036682337,0.4587279,0.0004211039,0.00065327337,0.000021139276,0.036619842,0.14859334,0.12971401,0.20064709,0.0023230375,0.021162197],"study_design_scores_gemma":[0.00057532906,0.000057735902,0.005201031,0.0009789307,0.00001215527,0.000062314255,0.0005686302,0.9779062,0.013699692,0.0006433421,0.000078995574,0.0002155998],"about_ca_topic_score_codex":0.000026716627,"about_ca_topic_score_gemma":1.10703446e-7,"teacher_disagreement_score":0.8293129,"about_ca_system_score_codex":0.000050812712,"about_ca_system_score_gemma":0.00006258833,"threshold_uncertainty_score":0.68407243},"labels":[],"label_agreement":null},{"id":"W2395510642","doi":"","title":"Learning Case Feature Weights from Relevance and Ranking Feedback","year":2014,"lang":"en","type":"article","venue":"The Florida AI Research Society","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Université Laval","funders":"","keywords":"Ranking (information retrieval); Relevance feedback; Relevance (law); Computer science; Feature (linguistics); Scheme (mathematics); Information retrieval; Learning to rank; Machine learning; Data mining; Quality (philosophy); Artificial intelligence; Mathematics; Image retrieval","score_opus":0.025836170961000094,"score_gpt":0.3009987922058476,"score_spread":0.27516262124484747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395510642","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7025712,0.004217468,0.25219348,0.036507685,0.00083548983,0.0005748288,0.0000110839055,0.0006355802,0.0024531777],"genre_scores_gemma":[0.96793145,0.0002459458,0.027954202,0.00086011685,0.0008950533,0.000021998678,0.00000783395,0.000024847686,0.0020585652],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970644,0.0008441595,0.00015054616,0.00054950727,0.00070939295,0.0006820083],"domain_scores_gemma":[0.9955545,0.0033326787,0.00006182041,0.0006845643,0.00020414458,0.00016226115],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0043690894,0.000173441,0.00018818937,0.000037948426,0.0021482569,0.0006145524,0.00088916806,0.00014559581,0.000012663561],"category_scores_gemma":[0.00042094055,0.000120363184,0.00010410893,0.0005587969,0.00023279918,0.0004041069,0.00062495464,0.002072484,0.000056211524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017469222,0.00010360906,0.01880042,0.0004431485,0.0005257637,0.0011127909,0.18148446,0.0062599685,0.008774673,0.050278775,0.45086297,0.2811787],"study_design_scores_gemma":[0.0011510239,0.0002878599,0.0017115452,0.00037119724,0.000018685347,0.00038527427,0.0013285687,0.79660416,0.0017836202,0.033075485,0.16271502,0.0005675639],"about_ca_topic_score_codex":0.00044770635,"about_ca_topic_score_gemma":0.000018705548,"teacher_disagreement_score":0.7903442,"about_ca_system_score_codex":0.00006180426,"about_ca_system_score_gemma":0.00008630777,"threshold_uncertainty_score":0.9991508},"labels":[],"label_agreement":null},{"id":"W2395906882","doi":"10.1609/socs.v3i1.18234","title":"Multimapping Abstractions and Hierarchical Heuristic Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Abstraction; Domain (mathematical analysis); Benchmark (surveying); Heuristic; Set (abstract data type); Abstract interpretation; State (computer science); Theoretical computer science; State space; Function (biology); Space (punctuation); Key (lock); Programming language; Artificial intelligence; Mathematics","score_opus":0.01774095050964933,"score_gpt":0.26186038778479787,"score_spread":0.24411943727514854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395906882","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90398794,0.00008993305,0.0025507212,0.04380073,0.0049674707,0.00035248089,0.00002066001,0.00016226384,0.04406778],"genre_scores_gemma":[0.9968995,0.000021763482,0.0022806244,0.00012577669,0.00021787059,0.000008724066,0.0000024300664,0.000009942214,0.00043340304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981756,0.000033925848,0.00025326,0.00038567308,0.00090044097,0.00025109653],"domain_scores_gemma":[0.9985204,0.0004919014,0.00007937624,0.00015117292,0.00065293803,0.0001042093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000774265,0.00012198017,0.00014073103,0.00008704405,0.00029778082,0.00033789285,0.0010427408,0.000075328484,0.000018352019],"category_scores_gemma":[0.00028483316,0.00010336706,0.00007681359,0.00028439172,0.00011818611,0.0002670125,0.0007298755,0.000545676,0.000013373268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069775015,0.0002828354,0.008306055,0.00007989167,0.00008706261,0.000009249702,0.00094002835,0.00047768827,0.0980776,0.8879958,0.000930201,0.0027438204],"study_design_scores_gemma":[0.0044747014,0.00058995216,0.031561553,0.0012700767,0.000049191996,0.00038701628,0.00047852995,0.20121568,0.6538935,0.08036116,0.024637751,0.0010809124],"about_ca_topic_score_codex":0.00006950766,"about_ca_topic_score_gemma":6.6032925e-7,"teacher_disagreement_score":0.80763465,"about_ca_system_score_codex":0.000075854005,"about_ca_system_score_gemma":0.0001278429,"threshold_uncertainty_score":0.42151865},"labels":[],"label_agreement":null},{"id":"W2396701594","doi":"","title":"Plan libraries for plan recognition: do we really know what they model?","year":2010,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Plan (archaeology); Computer science; Probabilistic logic; Formalism (music); Equivalence (formal languages); Task (project management); Artificial intelligence; Data science; Engineering; Systems engineering","score_opus":0.04162948481855335,"score_gpt":0.23931054184193984,"score_spread":0.19768105702338648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396701594","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004908016,0.0006482753,0.9593705,0.012557194,0.0012794123,0.00037372744,0.000048924318,0.00086214347,0.019951832],"genre_scores_gemma":[0.16748124,0.0002907166,0.8267213,0.0015039293,0.00040079077,0.00008086379,0.000109847984,0.00003085032,0.0033804642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989115,0.000027050992,0.00019614617,0.00038127962,0.00016075274,0.00032328648],"domain_scores_gemma":[0.99887496,0.00039355338,0.00007463394,0.00045801367,0.000071481576,0.0001273374],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003304663,0.00015965376,0.00014628077,0.000082688945,0.00027374574,0.0012503496,0.0007214952,0.00013431355,0.00006349006],"category_scores_gemma":[0.000035669073,0.00012958334,0.0000622933,0.000093123286,0.000030330715,0.0019916934,0.00012405476,0.0002491557,0.00007333581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009189533,0.00008376991,0.00041956545,0.0000960142,0.00004581958,0.000015386555,0.008171162,0.0015346003,0.0007811118,0.2733874,0.063456416,0.65191686],"study_design_scores_gemma":[0.00050342287,0.00019426168,0.000025556998,0.000238459,0.000010919955,0.00003774071,0.0002209812,0.5225141,0.0026043493,0.41849235,0.054674875,0.00048297015],"about_ca_topic_score_codex":0.000024111236,"about_ca_topic_score_gemma":0.00008488534,"teacher_disagreement_score":0.6514339,"about_ca_system_score_codex":0.0000056523154,"about_ca_system_score_gemma":0.00014828102,"threshold_uncertainty_score":0.99978644},"labels":[],"label_agreement":null},{"id":"W2397145713","doi":"","title":"Towards a second generation random walk planner: an experimental exploration","year":2013,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Random walk; Planner; Computer science; Operator (biology); State space; Monte Carlo method; Mathematical optimization; Theoretical computer science; Mathematics; Artificial intelligence; Statistics","score_opus":0.03980206178376905,"score_gpt":0.2581261735764433,"score_spread":0.21832411179267425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397145713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31407717,0.00012639402,0.67811304,0.0006710279,0.0003460052,0.00023467686,0.000001324346,0.00028405662,0.0061463015],"genre_scores_gemma":[0.9388513,0.0000013466993,0.059266675,0.0006270244,0.0001800277,0.000083897394,0.00005079489,0.000006965779,0.00093195133],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909043,0.00008699963,0.0001757879,0.00028688041,0.00017388804,0.00018599213],"domain_scores_gemma":[0.99948686,0.000023474957,0.000049155933,0.00028601204,0.00005242957,0.00010208461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020738112,0.00011403631,0.00010174528,0.00006206646,0.00017125343,0.00044384928,0.0002838741,0.00005587894,0.00071906555],"category_scores_gemma":[0.0000073169185,0.00009558567,0.000029717532,0.00009870922,0.000011498852,0.0025990559,0.000052416563,0.00007159536,0.00021467649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000664925,0.00050819485,0.00076368824,0.00003189028,0.00006170077,0.000027920827,0.039521877,0.008096045,0.5331148,0.05388551,0.1746235,0.18929839],"study_design_scores_gemma":[0.0010869481,0.0002810732,0.00016545408,0.000007882424,0.0000020449636,0.000012402754,0.00029666623,0.8194761,0.17503019,0.0012043589,0.002158596,0.00027823035],"about_ca_topic_score_codex":0.00016430843,"about_ca_topic_score_gemma":0.000028184726,"teacher_disagreement_score":0.8113801,"about_ca_system_score_codex":0.00002613196,"about_ca_system_score_gemma":0.000042676376,"threshold_uncertainty_score":0.78732634},"labels":[],"label_agreement":null},{"id":"W2397806795","doi":"10.1609/socs.v3i1.18236","title":"Search-Aware Conditions for Probably Approximately Correct Heuristic Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation","keywords":"Incremental heuristic search; Speedup; Beam search; Heuristic; Bidirectional search; Iterative deepening depth-first search; Computer science; Search algorithm; Best-first search; Beam stack search; Quality (philosophy); Search problem; Field (mathematics); Guided Local Search; Algorithm; Mathematical optimization; Mathematics; Artificial intelligence; Parallel computing","score_opus":0.025915963393150592,"score_gpt":0.2807167400186607,"score_spread":0.2548007766255101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397806795","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8210236,0.00017053775,0.030903818,0.06827525,0.022116415,0.004327509,0.00066187716,0.0008123704,0.05170865],"genre_scores_gemma":[0.9964615,0.000010637888,0.0017370521,0.00018796383,0.00035866283,0.00009836486,0.000037007216,0.000027879096,0.0010809408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9970123,0.00006186761,0.00039734444,0.0006084218,0.0014232583,0.00049677066],"domain_scores_gemma":[0.9964644,0.0007223228,0.0001338693,0.0002708069,0.0022630545,0.00014555975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014062726,0.0002132621,0.00025521152,0.00013631416,0.00048554517,0.0005193725,0.0023042276,0.00012039181,0.000029234845],"category_scores_gemma":[0.00039948383,0.00018331321,0.00020150265,0.00059579837,0.00015556747,0.0003681729,0.0008105363,0.00050982827,0.000024398489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024138529,0.00057856675,0.0036112217,0.0003284703,0.00017280053,0.000010060443,0.0011307982,0.0015699218,0.051490773,0.9309043,0.0090748,0.0008868678],"study_design_scores_gemma":[0.0030236233,0.0007531058,0.0008315371,0.00089790317,0.000039502942,0.00013094158,0.00036129542,0.13514318,0.79328954,0.05929155,0.0055969213,0.0006408847],"about_ca_topic_score_codex":0.00007103901,"about_ca_topic_score_gemma":0.000001156312,"teacher_disagreement_score":0.8716128,"about_ca_system_score_codex":0.0002512959,"about_ca_system_score_gemma":0.00042130472,"threshold_uncertainty_score":0.74752957},"labels":[],"label_agreement":null},{"id":"W2397939602","doi":"","title":"Controlling the hypothesis space in probabilistic plan recognition","year":2013,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Université de Sherbrooke","funders":"","keywords":"Plan (archaeology); Computer science; Probabilistic logic; Heuristic; Sequence (biology); Artificial intelligence; Machine learning; Space (punctuation); Execution time; Combinatorial explosion; Theoretical computer science; Distributed computing; Mathematics","score_opus":0.15718557414285686,"score_gpt":0.2803320152353006,"score_spread":0.12314644109244374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397939602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14033565,0.000037821384,0.78517246,0.050670736,0.00171403,0.0011132064,0.000020873948,0.00027741652,0.020657783],"genre_scores_gemma":[0.9918261,0.000016777876,0.007022541,0.00074460375,0.000120496035,0.00013523742,0.000007173281,0.000009073153,0.00011799065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981062,0.00015958225,0.00052981783,0.00045582393,0.00042717427,0.00032142672],"domain_scores_gemma":[0.9982266,0.00082565605,0.00019294124,0.00034880533,0.00032833216,0.00007768502],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006136616,0.00019293402,0.00017943674,0.00021089667,0.00013896388,0.00063700805,0.0010059861,0.000076174416,0.0004665576],"category_scores_gemma":[0.00075267634,0.00014744853,0.000070757495,0.00025955235,0.00009902343,0.00042725372,0.0001024546,0.00036202435,0.0017370766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047038007,0.00017575402,0.00032314012,0.000010053693,0.000028148726,0.000024272633,0.0016682058,0.009021821,0.0032267938,0.5183826,0.0002785076,0.46681368],"study_design_scores_gemma":[0.000045498615,0.00008385615,0.0011528118,0.00021027274,0.0000029597468,0.000009911255,0.00024981977,0.5564623,0.008012949,0.43342683,0.00012463203,0.000218168],"about_ca_topic_score_codex":0.0006613657,"about_ca_topic_score_gemma":0.00015051638,"teacher_disagreement_score":0.85149044,"about_ca_system_score_codex":0.0000983351,"about_ca_system_score_gemma":0.00010378726,"threshold_uncertainty_score":0.9990402},"labels":[],"label_agreement":null},{"id":"W2399526712","doi":"10.1609/aaai.v27i1.8687","title":"Assumption-Based Planning: Generating Plans and Explanations under Incomplete Knowledge","year":2013,"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":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Planner; Plan (archaeology); Computer science; Automated planning and scheduling; State (computer science); Core (optical fiber); Assertion; Translation (biology); Artificial intelligence; Algorithm","score_opus":0.11252463266994085,"score_gpt":0.30649777650549215,"score_spread":0.1939731438355513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399526712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45422813,0.00012659084,0.5224752,0.009985635,0.00053886976,0.0007715844,0.000017723478,0.00030995326,0.011546326],"genre_scores_gemma":[0.9868344,0.0000040959508,0.012538113,0.0003569946,0.00006233095,0.000049818736,0.0000020594398,0.000011163989,0.00014100308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846596,0.000030373492,0.0004493263,0.00043546376,0.00029518097,0.00032370535],"domain_scores_gemma":[0.9985828,0.000317818,0.00029276806,0.00022526272,0.00047001036,0.000111362264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042189844,0.0002166825,0.00020746695,0.0001704145,0.00045667327,0.00048644198,0.0010306203,0.00009229673,0.000056019202],"category_scores_gemma":[0.00018713725,0.0001695533,0.00005921011,0.00040929264,0.00016496005,0.0004488924,0.0002061136,0.0003026935,0.000083490384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001592438,0.0001388401,0.0045846035,0.00008903692,0.000027753596,5.3685784e-7,0.0037657716,0.0064438484,0.056018867,0.89356834,0.0011790715,0.034167416],"study_design_scores_gemma":[0.000041828425,0.00012470377,0.0013794359,0.00036862152,0.000009643745,0.0000042322213,0.0005151574,0.85365075,0.07806844,0.06546268,0.000098154844,0.0002763272],"about_ca_topic_score_codex":0.000081104445,"about_ca_topic_score_gemma":0.000012309327,"teacher_disagreement_score":0.8472069,"about_ca_system_score_codex":0.000034281344,"about_ca_system_score_gemma":0.00011678785,"threshold_uncertainty_score":0.6914183},"labels":[],"label_agreement":null},{"id":"W2400456651","doi":"","title":"A Comparison of Case Acquisition Strategies for Learning from Observations of State-Based Experts.","year":2013,"lang":"en","type":"article","venue":"The Florida AI Research Society","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Chunking (psychology); Artificial intelligence; Machine learning; Similarity (geometry); Context (archaeology); Knowledge acquisition; State (computer science); Focus (optics); Data mining; Algorithm","score_opus":0.18165020496573464,"score_gpt":0.40499982424871617,"score_spread":0.22334961928298153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400456651","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5509445,0.00022745042,0.44671053,0.0015668512,0.00006216112,0.00038780793,0.000019167484,0.000050726234,0.00003083096],"genre_scores_gemma":[0.96465635,0.000005854773,0.03492346,0.00009942727,0.00006141084,0.00014643383,0.000035270506,0.0000097787515,0.000062012434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982155,0.00034042736,0.0003261878,0.00023859406,0.000515159,0.00036415327],"domain_scores_gemma":[0.995966,0.0025624065,0.0001461095,0.00044743583,0.0008113898,0.00006662238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015519217,0.00010519338,0.00021083097,0.000046293455,0.0006009412,0.00021270706,0.00062477426,0.000068460664,0.000030320305],"category_scores_gemma":[0.000113009046,0.00007911951,0.00014351064,0.00047682883,0.00020889551,0.00050574425,0.00014463055,0.0003743192,0.0000045369225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014385076,0.0004908669,0.031181524,0.00071525044,0.0004051631,0.000017812454,0.21645029,0.37080878,0.18585184,0.015191404,0.16644509,0.01229812],"study_design_scores_gemma":[0.00039483,0.00028057958,0.0013779142,0.00008868766,0.0000068740724,0.0000015233474,0.010858942,0.96343523,0.013997291,0.009055231,0.0003946764,0.00010818995],"about_ca_topic_score_codex":0.003273726,"about_ca_topic_score_gemma":0.000024924231,"teacher_disagreement_score":0.59262645,"about_ca_system_score_codex":0.00004868565,"about_ca_system_score_gemma":0.0003609989,"threshold_uncertainty_score":0.4948916},"labels":[],"label_agreement":null},{"id":"W2400703308","doi":"10.1609/socs.v3i1.18241","title":"Are We There Yet? — Estimating Search Progress","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Incremental heuristic search; Beam search; Heuristic; Best-first search; Iterative deepening depth-first search; Bidirectional search; Search algorithm; Computer science; Focus (optics); Path (computing); Mathematical optimization; Beam stack search; Search problem; Algorithm; Mathematics; Artificial intelligence","score_opus":0.02905911484794281,"score_gpt":0.28830203270278604,"score_spread":0.2592429178548432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400703308","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8417601,0.0003971348,0.0013608102,0.113345325,0.015083502,0.0006770011,0.000027558124,0.00035217492,0.026996396],"genre_scores_gemma":[0.9926602,0.000014266278,0.006032897,0.00015818661,0.00046173742,0.000021599428,0.000002324299,0.000020597106,0.00062818156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972534,0.00004325203,0.00032424674,0.00048133868,0.0015367813,0.0003609693],"domain_scores_gemma":[0.99785584,0.00027490556,0.00025780857,0.00024662973,0.0012653243,0.00009950885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009056724,0.00017865107,0.00020331971,0.000082051745,0.0003030909,0.0005333361,0.0024659939,0.00010046516,0.000027656572],"category_scores_gemma":[0.0002405359,0.00014218637,0.0001309713,0.00053399685,0.0000981185,0.00036500397,0.0011263054,0.0005328333,0.000020497257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016574198,0.0007562184,0.08306169,0.00037846772,0.00024127985,0.00004084049,0.0027105014,0.0021504376,0.024117393,0.8704406,0.009022506,0.0069143237],"study_design_scores_gemma":[0.003026133,0.00052067207,0.006469116,0.003970208,0.000033660745,0.00012949028,0.0007477506,0.23533902,0.66019213,0.07802203,0.010616652,0.00093314727],"about_ca_topic_score_codex":0.0000312249,"about_ca_topic_score_gemma":7.5101303e-7,"teacher_disagreement_score":0.7924186,"about_ca_system_score_codex":0.00016021055,"about_ca_system_score_gemma":0.0001568443,"threshold_uncertainty_score":0.57981914},"labels":[],"label_agreement":null},{"id":"W2401554262","doi":"10.1609/icaps.v25i1.13704","title":"Understanding and Improving Local Exploration for GBFS","year":2015,"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":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates; Alberta Innovates - Technology Futures","keywords":"Maxima and minima; Satisficing; Local search (optimization); Heuristic; Mathematics; Mathematical optimization; Algorithm; Computer science; Artificial intelligence","score_opus":0.20482249081506348,"score_gpt":0.30985478916159825,"score_spread":0.10503229834653477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401554262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27348438,0.0001303636,0.7168383,0.004893316,0.00054540165,0.00025221775,0.0000078805315,0.0004759887,0.0033721498],"genre_scores_gemma":[0.9692748,0.0000037555449,0.030510185,0.00011215289,0.00003783035,0.000011319376,0.000002965443,0.00000769186,0.000039259503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990502,0.000007852219,0.00021951288,0.00027314608,0.00028588396,0.00016337646],"domain_scores_gemma":[0.9992269,0.00011552675,0.00022807346,0.000057705663,0.00029219477,0.00007958412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006713479,0.00012767038,0.00013245024,0.00012252024,0.0001901142,0.00037547539,0.0004176769,0.000070888666,5.6958044e-7],"category_scores_gemma":[0.00026881034,0.00010168221,0.00002627822,0.000112299276,0.000060767827,0.0005898974,0.00016205879,0.00015576338,5.0410404e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021150916,0.000043382202,0.009828092,0.00019790561,0.00009951981,0.0000022373679,0.009673525,0.016586471,0.018970054,0.9376082,0.0010860265,0.0056931092],"study_design_scores_gemma":[0.0004145987,0.000106100015,0.00011175324,0.00045643,0.00000803242,0.0000150084215,0.002302793,0.96985364,0.0044130506,0.022162654,0.000031843734,0.00012409282],"about_ca_topic_score_codex":0.0000142419585,"about_ca_topic_score_gemma":5.031135e-7,"teacher_disagreement_score":0.95326716,"about_ca_system_score_codex":0.00006585181,"about_ca_system_score_gemma":0.00007743962,"threshold_uncertainty_score":0.41464803},"labels":[],"label_agreement":null},{"id":"W2402457175","doi":"","title":"Analysis and Cleaning of User Traces Through Comparison of Multiple Traces.","year":2013,"lang":"en","type":"article","venue":"The Florida AI Research Society","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"TRACE (psycholinguistics); Computer science; Obstacle; Property (philosophy); Robot; Controller (irrigation); Artificial intelligence; Data mining; Human–computer interaction","score_opus":0.07472016934842995,"score_gpt":0.37276910390793594,"score_spread":0.298048934559506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402457175","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88874453,0.0009524612,0.10769766,0.0019912685,0.000055328474,0.0002583574,0.0000064143037,0.000045518464,0.00024843868],"genre_scores_gemma":[0.97970855,0.00008507437,0.01991928,0.000059101534,0.0000462333,0.000017955475,0.0000030772662,0.0000074328304,0.00015332035],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978391,0.00033788112,0.0003482093,0.00030432735,0.0007529004,0.00041758578],"domain_scores_gemma":[0.9970414,0.0017963926,0.0001434287,0.00057517964,0.00036943424,0.000074178235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002354442,0.00011752608,0.00034621777,0.00007334749,0.00040845407,0.00015402993,0.0009540977,0.00008633402,0.000034591485],"category_scores_gemma":[0.00014052933,0.00008101883,0.00020030767,0.0015260212,0.00038936437,0.00054680154,0.0003396462,0.00056245516,0.000007898867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035458157,0.0002456597,0.71915394,0.00038060793,0.0014832629,0.0000017735535,0.18122725,0.014552393,0.014806596,0.004237987,0.03901495,0.024860144],"study_design_scores_gemma":[0.00048212014,0.00021410693,0.099469885,0.00008441401,0.00008119415,0.0000012723002,0.0065924134,0.86909795,0.020535976,0.0019570612,0.0012702219,0.00021336784],"about_ca_topic_score_codex":0.002436556,"about_ca_topic_score_gemma":0.000057344878,"teacher_disagreement_score":0.8545456,"about_ca_system_score_codex":0.000023650338,"about_ca_system_score_gemma":0.00007264967,"threshold_uncertainty_score":0.368336},"labels":[],"label_agreement":null},{"id":"W2404409324","doi":"10.5591/978-1-57735-516-8/ijcai11-070","title":"Learning where you are going and from whence you came: h- and g-cost learning in real-time heuristic search","year":2011,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Computer science; Heuristic; Machine learning; Artificial intelligence; Hyper-heuristic; Mathematical optimization; Mathematics; Robot learning","score_opus":0.02589976314118801,"score_gpt":0.23520853823004492,"score_spread":0.20930877508885692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404409324","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9392757,0.0010352578,0.04915557,0.00036871168,0.0000744235,0.0001967366,0.0000037133016,0.00044482297,0.009445059],"genre_scores_gemma":[0.95955586,0.0002503139,0.036880795,0.000057770947,0.00003555472,0.0000067621536,0.000006974136,0.000020601741,0.00318534],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981139,0.00026044482,0.00026503438,0.00065444375,0.0002300684,0.00047614414],"domain_scores_gemma":[0.99895644,0.00044894448,0.000110804256,0.0002639668,0.000054272758,0.00016555091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078020146,0.00020516821,0.00026499885,0.00015062722,0.00032521924,0.0002736302,0.00035894394,0.000107033615,0.000086761276],"category_scores_gemma":[0.00016400068,0.0001985448,0.00002251966,0.00028253422,0.00007562034,0.00049845176,0.000374655,0.0006730146,0.0000756636],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028264018,0.000026945952,0.93122244,0.000060940878,0.00001604304,0.00018760917,0.026198264,0.0010872303,0.0016306088,0.00042203194,0.00020724344,0.038912363],"study_design_scores_gemma":[0.0010899475,0.00040246086,0.2766837,0.0011974111,0.000018964189,0.00006449471,0.0024671261,0.71421856,0.00068562507,0.0008575621,0.0013855342,0.0009286563],"about_ca_topic_score_codex":0.0055002337,"about_ca_topic_score_gemma":0.00016784437,"teacher_disagreement_score":0.7131313,"about_ca_system_score_codex":0.00003283451,"about_ca_system_score_gemma":0.000060348008,"threshold_uncertainty_score":0.8314745},"labels":[],"label_agreement":null},{"id":"W2406156603","doi":"10.1609/socs.v3i1.18247","title":"A Theoretical Framework for Studying Random Walk Planning","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Random walk; Satisficing; Computer science; Branching (polymer chemistry); Graph; Mathematics; Theoretical computer science; Artificial intelligence; Statistics","score_opus":0.0236050720015905,"score_gpt":0.2930198622392588,"score_spread":0.2694147902376683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406156603","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74022245,0.00027470043,0.12068542,0.0692841,0.023809906,0.0017489117,0.0000399001,0.00041199283,0.043522604],"genre_scores_gemma":[0.9878791,0.0000049451237,0.0111643765,0.00028735408,0.00050880335,0.000044253557,0.000002420668,0.000016241795,0.00009249918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979505,0.00003154826,0.00031667599,0.0004191044,0.00096940936,0.00031278704],"domain_scores_gemma":[0.9973721,0.0013578522,0.00014565799,0.00018638658,0.0008580199,0.00008000155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011807741,0.00015361897,0.00021715865,0.00006601141,0.00029800308,0.00037631634,0.001836502,0.00011313328,0.000024354957],"category_scores_gemma":[0.0008935899,0.00012048575,0.00017363495,0.00032329626,0.00008858997,0.00021540267,0.00064965704,0.00042976136,0.0000044502117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025774128,0.00013361931,0.0026146288,0.000036768535,0.00007252061,0.000002158963,0.0010198222,0.00024650554,0.0075000706,0.9871645,0.00054923753,0.00040240504],"study_design_scores_gemma":[0.002700119,0.0003077671,0.0002823806,0.000772085,0.00002100777,0.00001992499,0.00019798976,0.03211403,0.1793596,0.78223073,0.00172746,0.00026689738],"about_ca_topic_score_codex":0.000006244868,"about_ca_topic_score_gemma":5.340406e-8,"teacher_disagreement_score":0.24765663,"about_ca_system_score_codex":0.00010501411,"about_ca_system_score_gemma":0.00011503557,"threshold_uncertainty_score":0.49132663},"labels":[],"label_agreement":null},{"id":"W2406251145","doi":"","title":"Case-Based Learning by Observation in Robotics Using a Dynamic Case Representation","year":2012,"lang":"en","type":"article","venue":"The Florida AI Research Society","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Robot; Computer science; Task (project management); Artificial intelligence; Robotics; Control (management); Representation (politics); Control engineering; Human–computer interaction; Robot control; Embedded system; Mobile robot; Engineering; Systems engineering","score_opus":0.1554760205396819,"score_gpt":0.40182237199975385,"score_spread":0.24634635146007194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406251145","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57154095,0.0003355335,0.42558715,0.0019390907,0.0001871461,0.0002814674,0.0000032472544,0.0000974463,0.000027929727],"genre_scores_gemma":[0.9577098,0.000013451501,0.041703854,0.00022306599,0.00012253897,0.000027062208,0.000020863494,0.000018846198,0.0001605416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969324,0.0009893726,0.00027292082,0.00033134987,0.0006491826,0.00082481524],"domain_scores_gemma":[0.99777335,0.0012500682,0.00009175515,0.00053014257,0.00021895373,0.00013570332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005996751,0.0001443233,0.00014518986,0.000085707055,0.0011465716,0.00029278238,0.00044683297,0.00012069406,0.000007096969],"category_scores_gemma":[0.00031559667,0.00012151324,0.000095900206,0.0015073441,0.00011665168,0.0008507898,0.00023529412,0.0012358893,0.000014217436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037842125,0.00018547558,0.083038375,0.00017255388,0.00006621889,0.0020909517,0.036184218,0.8480597,0.007523944,0.0015421005,0.011487566,0.0096110655],"study_design_scores_gemma":[0.00030187613,0.00004096555,0.00033899708,0.000044952576,0.0000059077374,0.0009284368,0.0010408919,0.9961667,0.00042118214,0.0002149433,0.00034829165,0.00014683571],"about_ca_topic_score_codex":0.001998738,"about_ca_topic_score_gemma":0.000043471282,"teacher_disagreement_score":0.3861688,"about_ca_system_score_codex":0.00039262365,"about_ca_system_score_gemma":0.00019710779,"threshold_uncertainty_score":0.88186175},"labels":[],"label_agreement":null},{"id":"W2406291270","doi":"","title":"Mental Model Ascription by Language-Enabled Intelligent Agents","year":2013,"lang":"en","type":"article","venue":"eScholarship (California Digital Library)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"University of Toronto; University of Essex; Office of Naval Research; University of Maryland, Baltimore County","keywords":"Ascription; Cognitive science; Computer science; Artificial intelligence; Cognitive architecture; Cognition; Psychology; Epistemology","score_opus":0.014836371182436456,"score_gpt":0.2160614188796064,"score_spread":0.20122504769716992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406291270","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69025975,0.0012270965,0.26388845,0.004712731,0.00058073126,0.001116958,0.0017008615,0.0024478433,0.034065604],"genre_scores_gemma":[0.980018,0.00001456525,0.010088141,0.0022565702,0.00005928898,0.000047859106,0.0009496053,0.000052183615,0.006513782],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791944,0.00007588458,0.00040463044,0.00057117554,0.0004428148,0.0005860545],"domain_scores_gemma":[0.99884796,0.000064889224,0.00013053375,0.0005448194,0.000033275446,0.00037854796],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016533307,0.00031410877,0.00021539722,0.00013973791,0.00021401912,0.0032662484,0.0011440994,0.0001379502,0.00046686683],"category_scores_gemma":[0.000058486316,0.00028677302,0.00013155528,0.00037524485,0.00004012009,0.008647458,0.0004872161,0.00040751637,0.005826004],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059807273,0.00074713666,0.052182596,0.00013910685,0.00015670412,0.00006687995,0.0021631666,0.0011806464,0.0064956555,0.0048534707,0.8132899,0.11866492],"study_design_scores_gemma":[0.0010573219,0.00022938174,0.0008341452,0.00025624497,0.000017733706,0.000033812685,0.00015927247,0.7792189,0.024761014,0.029358422,0.1625008,0.001572934],"about_ca_topic_score_codex":0.0000140797365,"about_ca_topic_score_gemma":1.9374448e-7,"teacher_disagreement_score":0.77803826,"about_ca_system_score_codex":0.000054960106,"about_ca_system_score_gemma":0.00007242747,"threshold_uncertainty_score":0.99995846},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.17345072975235198,"score_gpt":0.29621240104317037,"score_spread":0.12276167129081839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406423292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2765002,0.0001743715,0.69839627,0.000939096,0.0005598369,0.00047925694,0.0000044200156,0.00020961076,0.022736922],"genre_scores_gemma":[0.9894584,0.000012697234,0.010159137,0.00016086252,0.00004819849,0.000021367421,7.964019e-7,0.0000076131837,0.00013095177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987925,0.000037090977,0.0003433317,0.00035862823,0.00024956054,0.00021887753],"domain_scores_gemma":[0.99909663,0.00011364586,0.00025733357,0.00019460444,0.0002727063,0.000065063294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008538896,0.00015721892,0.0001468967,0.00011824572,0.00026485897,0.00015493932,0.00086677977,0.000075009666,0.000037622056],"category_scores_gemma":[0.0002544848,0.00012014704,0.000041339717,0.00029045934,0.00013124365,0.00048191624,0.00018593082,0.00020332875,0.000019882216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041765717,0.000045445682,0.0006595783,0.000017519727,0.000012131119,4.7356642e-7,0.007821449,0.0000448456,0.017789502,0.9299949,0.00010598964,0.0434664],"study_design_scores_gemma":[0.000027067385,0.00018971672,0.0005865553,0.00021436652,0.000013491088,0.000009804214,0.0005668197,0.13267688,0.43363827,0.43180355,0.00003920222,0.00023426906],"about_ca_topic_score_codex":0.000022944309,"about_ca_topic_score_gemma":0.000002624019,"teacher_disagreement_score":0.71295816,"about_ca_system_score_codex":0.000016579543,"about_ca_system_score_gemma":0.000045640372,"threshold_uncertainty_score":0.48994538},"labels":[],"label_agreement":null},{"id":"W2407434560","doi":"","title":"From Texts, Images, and Data to Attribute Based Case Representation.","year":2012,"lang":"en","type":"article","venue":"Industrial Conference on Data Mining","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Representation (politics); Natural language processing; Information retrieval; Artificial intelligence; Data mining","score_opus":0.4882787650101527,"score_gpt":0.3949974943645965,"score_spread":0.09328127064555619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407434560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2591732,0.0006226147,0.69860226,0.015920246,0.00346629,0.001101793,0.018806007,0.00064131815,0.0016662758],"genre_scores_gemma":[0.9072309,0.0000034816146,0.08781272,0.00053248747,0.000885014,0.000008329688,0.0034360965,0.000013918874,0.00007701048],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976319,0.00026413036,0.00033495057,0.0009860294,0.0003200897,0.0004628847],"domain_scores_gemma":[0.9948908,0.0010418302,0.00015967383,0.003475214,0.00006212946,0.00037035483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014701781,0.00021159554,0.0002451899,0.00012849462,0.00026480324,0.0006686226,0.0025764895,0.0001494657,0.000090799906],"category_scores_gemma":[0.0014667033,0.00020756452,0.000012502392,0.00035983772,0.00004305796,0.0022075512,0.0024332656,0.0003730363,0.00006420651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012268386,0.00012945989,0.040642824,0.000010907419,0.00008187282,0.0009179351,0.0021938013,0.00009302444,0.00067644974,0.0008168686,0.38033956,0.5739746],"study_design_scores_gemma":[0.008610879,0.00087776186,0.007641622,0.0019724795,0.00031753408,0.00080012035,0.00390812,0.7671671,0.0049532116,0.00031581137,0.19986682,0.0035685317],"about_ca_topic_score_codex":0.0016793361,"about_ca_topic_score_gemma":0.00003702676,"teacher_disagreement_score":0.7670741,"about_ca_system_score_codex":0.000023987963,"about_ca_system_score_gemma":0.00026748757,"threshold_uncertainty_score":0.84642357},"labels":[],"label_agreement":null},{"id":"W2408280519","doi":"10.1609/icaps.v22i1.13512","title":"Predicting Optimal Solution Cost with Bidirectional Stratified Sampling","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":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates; University of Regina","keywords":"Mathematical optimization; Path (computing); Focus (optics); Heuristic; Sampling (signal processing); State space; Limit (mathematics); Space (punctuation); Computer science; Total cost; State (computer science); Infinity; Mathematics; Algorithm; Statistics; Economics","score_opus":0.05816263018726656,"score_gpt":0.2944029400724816,"score_spread":0.23624030988521502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408280519","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97067213,0.000083785926,0.022550836,0.000979088,0.0004361413,0.00014130618,0.000007532306,0.00048985344,0.004639351],"genre_scores_gemma":[0.9483418,0.0000034549835,0.051394485,0.00007208665,0.00010441347,0.000013268201,0.000005197986,0.000009367716,0.000055950677],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871093,0.000012029916,0.00025999086,0.00026360547,0.00046124536,0.00029220502],"domain_scores_gemma":[0.99909705,0.00012545133,0.0003126167,0.00007544458,0.00029975554,0.000089696936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062790565,0.00016801263,0.00014607288,0.00013677173,0.0003400873,0.00029945927,0.00053823617,0.00008015207,0.000006675626],"category_scores_gemma":[0.00013806776,0.00012410725,0.00003543644,0.00020344001,0.000057681555,0.00067758677,0.00014396533,0.00032439965,0.000002166744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034063318,0.00020650358,0.6698173,0.00015784083,0.00034415835,0.0000024381338,0.008053921,0.054992467,0.08512664,0.17598873,0.0003939586,0.0045753717],"study_design_scores_gemma":[0.0003528006,0.0000746789,0.0147857275,0.0009561003,0.000014345119,0.00007435754,0.0004634496,0.97036767,0.012452094,0.00021763988,0.000053872387,0.00018726192],"about_ca_topic_score_codex":0.000024315776,"about_ca_topic_score_gemma":4.793974e-7,"teacher_disagreement_score":0.91537523,"about_ca_system_score_codex":0.000045600962,"about_ca_system_score_gemma":0.00007303571,"threshold_uncertainty_score":0.5060947},"labels":[],"label_agreement":null},{"id":"W2408598632","doi":"10.1609/socs.v3i1.18223","title":"Predicting Optimal Solution Cost with Bidirectional Stratified Sampling (Abstract)","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - Technology Futures; University of Regina","keywords":"Mathematical optimization; Path (computing); Focus (optics); Heuristic; Sampling (signal processing); Limit (mathematics); State space; Computer science; Space (punctuation); Total cost; Stratified sampling; Mathematics; Statistics; Economics","score_opus":0.027669585715042754,"score_gpt":0.269724330272183,"score_spread":0.24205474455714027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408598632","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96741945,0.000023906605,0.0036039487,0.007799714,0.00403537,0.00029979047,0.000017403563,0.0001517014,0.016648749],"genre_scores_gemma":[0.9949387,0.000005534149,0.004257104,0.00006944064,0.0004334282,0.000021001199,0.000008084364,0.000013476205,0.00025326363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99776196,0.000016429296,0.00030005857,0.00042074162,0.0012221308,0.00027866327],"domain_scores_gemma":[0.99822813,0.00025934086,0.0002036998,0.0001445094,0.0010836166,0.00008070072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068486074,0.00015332238,0.00014680864,0.00007598235,0.00035429228,0.00039812163,0.0010762865,0.000085918386,0.000020990687],"category_scores_gemma":[0.00016063826,0.00012295385,0.000083279505,0.0004027155,0.00006220596,0.0004808756,0.00035173082,0.00045227134,0.000005928113],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072472275,0.0008218362,0.07771641,0.00014652753,0.00037713285,0.0000123835725,0.0016703338,0.018767612,0.33875683,0.5561826,0.0017113641,0.0031121993],"study_design_scores_gemma":[0.0034511036,0.00061058893,0.017022826,0.0011210298,0.000035699246,0.00016599118,0.00029315014,0.09465481,0.8713218,0.0068256995,0.0038784912,0.0006187825],"about_ca_topic_score_codex":0.000105971565,"about_ca_topic_score_gemma":0.0000037365014,"teacher_disagreement_score":0.54935694,"about_ca_system_score_codex":0.00019749186,"about_ca_system_score_gemma":0.0002520059,"threshold_uncertainty_score":0.50139123},"labels":[],"label_agreement":null},{"id":"W2417553771","doi":"10.1007/s11787-016-0150-3","title":"The Klein Group, Squares of Opposition and the Explanation of Fallacies in Reasoning","year":2016,"lang":"en","type":"article","venue":"Logica Universalis","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Premise; Opposition (politics); Epistemology; Phenomenon; Propositional calculus; Inference; Binary number; Binary opposition; Computer science; Mathematics; Calculus (dental); Philosophy; Discrete mathematics; Political science; Law; Arithmetic","score_opus":0.006441353353435574,"score_gpt":0.18692809829889934,"score_spread":0.18048674494546377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2417553771","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57381296,0.0013085409,0.40168765,0.013121094,0.00013993784,0.00032691297,0.000014416879,0.00008426504,0.00950421],"genre_scores_gemma":[0.99805355,0.00014500554,0.0017212433,0.000024442861,0.000005259603,0.0000014681419,0.0000010224051,0.0000013214702,0.00004670823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999455,0.00015676368,0.00010984643,0.00009484973,0.000102078506,0.00008150188],"domain_scores_gemma":[0.9989546,0.00074383535,0.00010795778,0.00014810222,0.000033497858,0.000012039528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004977834,0.000044535776,0.00007634171,0.000043274584,0.00009080379,0.000021640524,0.0002597281,0.000026835674,0.0000019412287],"category_scores_gemma":[0.00007577075,0.000020130843,0.000019464806,0.00013584696,0.0001408742,0.0001771314,0.000066631845,0.000034925197,3.2150777e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096669646,0.000011566947,0.0047196136,0.000010559721,0.000011565157,0.000004102333,0.0044695595,0.00013784152,0.00298377,0.96142673,0.00020420822,0.02592382],"study_design_scores_gemma":[0.02646638,0.0030459282,0.31506363,0.005136784,0.00016361558,0.00009860367,0.023535911,0.1835367,0.04886892,0.36571297,0.026369078,0.0020014765],"about_ca_topic_score_codex":0.0002819147,"about_ca_topic_score_gemma":0.00007008376,"teacher_disagreement_score":0.59571373,"about_ca_system_score_codex":0.000013696953,"about_ca_system_score_gemma":0.000010355,"threshold_uncertainty_score":0.0820912},"labels":[],"label_agreement":null},{"id":"W243337683","doi":"10.7939/r3xw47z9h","title":"Better Time Constrained Search via Randomization and Postprocessing","year":2013,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Satisficing; Bounding overwatch; Set (abstract data type); Beam search; Mathematical optimization; Metric (unit); Iterative deepening depth-first search; Heuristic; Incremental heuristic search; Quality (philosophy); Hypersphere; Performance metric; Search algorithm; Algorithm; Artificial intelligence; Mathematics","score_opus":0.005677347678714625,"score_gpt":0.19954952848295837,"score_spread":0.19387218080424373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W243337683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066798225,0.000054508168,0.92354894,0.003311562,0.000032712564,0.00013724524,2.3092215e-7,0.00015678094,0.0059598037],"genre_scores_gemma":[0.8832612,0.0000010035842,0.11486112,0.0010766456,0.000026080415,0.0000050026915,0.0000039886695,0.0000045040456,0.0007604582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993999,0.000032721502,0.00010995211,0.00018064342,0.00010914141,0.00016764973],"domain_scores_gemma":[0.99961597,0.0001084658,0.000024553196,0.00011760279,0.00006891842,0.00006447058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024767203,0.00006961455,0.00008961696,0.000055020228,0.00012738176,0.00030316476,0.00014960639,0.00003665286,0.00018832025],"category_scores_gemma":[0.000011278825,0.000055309458,0.000013349456,0.000121753284,0.000034997745,0.0004869341,0.00006246473,0.00007104412,0.00019991171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057497426,0.000061164304,0.018208934,0.0001296813,0.00006496685,0.000020254192,0.0046360297,0.0009862804,0.04921431,0.005141419,0.011212778,0.9102667],"study_design_scores_gemma":[0.0012369198,0.000036463327,0.0011016992,0.000030158006,0.000002805937,0.000026393795,0.000009632937,0.9930373,0.0023734474,0.001886054,0.00011688575,0.00014227591],"about_ca_topic_score_codex":0.000050481554,"about_ca_topic_score_gemma":2.9122444e-7,"teacher_disagreement_score":0.992051,"about_ca_system_score_codex":0.0000056617328,"about_ca_system_score_gemma":0.0000278218,"threshold_uncertainty_score":0.29234248},"labels":[],"label_agreement":null},{"id":"W243483455","doi":"10.1007/978-3-319-11313-5_35","title":"An Intelligent Architecture for Autonomous Virtual Agents Inspired by Onboard Autonomy","year":2014,"lang":"en","type":"book-chapter","venue":"Advances in intelligent systems and computing","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Architecture; Autonomy; Computer science; Human–computer interaction; Computer architecture; Systems engineering; Engineering; Art; Visual arts; Political science","score_opus":0.016724577615390264,"score_gpt":0.2652785822912884,"score_spread":0.24855400467589817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W243483455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031007145,0.013874767,0.97190696,0.00006519077,0.0021923906,0.0010460633,0.000041560146,0.00030693747,0.010256087],"genre_scores_gemma":[0.74616945,0.0026182332,0.13164268,0.002006316,0.0034880186,0.0003719812,0.00090384285,0.0006398302,0.112159625],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961127,0.00011989851,0.0012697105,0.0014003712,0.00038552095,0.00071176956],"domain_scores_gemma":[0.99728864,0.0006783906,0.0008111156,0.0008213048,0.0001253612,0.00027515643],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009813735,0.0007651519,0.0009845562,0.00037021592,0.00035148393,0.0004538468,0.0013103287,0.0004194026,0.0000071277886],"category_scores_gemma":[0.000034570818,0.0007473852,0.00018418636,0.00008974527,0.00011225878,0.00028904589,0.0003243939,0.00069810625,0.00001956981],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025054811,0.000037753736,0.00018380943,0.0004444886,0.00007118187,0.000016317794,0.0020512904,0.1285143,0.000012452871,0.25191084,0.00041724244,0.61631525],"study_design_scores_gemma":[0.0002227942,0.00059996184,0.0000035389758,0.0016758743,0.000019504709,0.000031989934,0.00006621847,0.3639739,0.000086517495,0.005223392,0.62728196,0.00081431965],"about_ca_topic_score_codex":0.0000809698,"about_ca_topic_score_gemma":0.000024476767,"teacher_disagreement_score":0.84026426,"about_ca_system_score_codex":0.0003102732,"about_ca_system_score_gemma":0.00015999183,"threshold_uncertainty_score":0.9994977},"labels":[],"label_agreement":null},{"id":"W24613876","doi":"10.1007/978-3-642-30574-0_13","title":"Case-Based Reasoning for Biomedical Informatics and Medicine","year":2013,"lang":"en","type":"book-chapter","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of New Brunswick; University of Toronto","funders":"","keywords":"Health informatics; Computer science; Informatics; Data science; Medicine; Engineering; Pathology","score_opus":0.028915802205403497,"score_gpt":0.24994600552125226,"score_spread":0.22103020331584877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24613876","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000064846095,0.00029865003,0.78838515,0.0009253913,0.00022221442,0.0002907475,0.0000114510585,0.00019443026,0.20966545],"genre_scores_gemma":[0.00084858545,0.000026582857,0.82286185,0.002353991,0.0003351311,0.000031580214,0.00012732563,0.000041068633,0.17337391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986844,0.0000094795805,0.00048155413,0.0002593888,0.00028732812,0.00027784955],"domain_scores_gemma":[0.99828684,0.00067403854,0.00025464542,0.00042487588,0.0001230264,0.00023658024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051950465,0.00029117512,0.0003779284,0.00023446779,0.00020932994,0.00011504985,0.00035820948,0.00032532308,0.00022383586],"category_scores_gemma":[0.00007037278,0.00021709494,0.0000572685,0.000038971084,0.00015624457,0.00018245983,0.00012303505,0.0002840625,0.00004658068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006697592,0.0000068580225,0.0000068503655,0.00048450613,0.000063900836,0.0002863712,0.0009164647,0.000036616617,0.0000024050491,0.74769384,0.1458322,0.10466329],"study_design_scores_gemma":[0.00075637904,0.00044752395,5.6494855e-7,0.0009551517,0.00004597834,0.0010646977,0.000026882697,0.5322472,0.000005656626,0.01400206,0.44999617,0.00045176552],"about_ca_topic_score_codex":0.000057330235,"about_ca_topic_score_gemma":0.0000038057335,"teacher_disagreement_score":0.7336918,"about_ca_system_score_codex":0.000028701488,"about_ca_system_score_gemma":0.00013958225,"threshold_uncertainty_score":0.88528746},"labels":[],"label_agreement":null},{"id":"W2466152282","doi":"10.1080/0951192x.2015.1099072","title":"Integrated products–systems design environment using Bayesian networks","year":2015,"lang":"en","type":"article","venue":"International Journal of Computer Integrated Manufacturing","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Bayesian network; Computer science; Systems engineering; Bayesian probability; Artificial intelligence; Engineering","score_opus":0.04542854404515228,"score_gpt":0.24548341242834104,"score_spread":0.20005486838318876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2466152282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012570837,0.00052355014,0.9802331,0.00048176284,0.005847838,0.00016666255,0.000003097389,0.000098622746,0.00007455024],"genre_scores_gemma":[0.61467826,0.000022301205,0.38401294,0.00017786078,0.001007517,0.0000024509493,0.0000100653515,0.00002457089,0.00006401222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969937,0.00036705143,0.0009382535,0.0003811207,0.00093540415,0.00038444658],"domain_scores_gemma":[0.9976292,0.00018510081,0.0008025418,0.00034796027,0.00075110595,0.0002840742],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014285016,0.0003423591,0.00039364875,0.0005247393,0.00008876277,0.0008090975,0.002030526,0.0001337993,0.0000111683785],"category_scores_gemma":[0.000055830078,0.0002750098,0.00012488778,0.00018673654,0.000048386264,0.0010476537,0.00027456775,0.0007225245,0.000014378637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087729386,0.00007008187,0.00018995896,0.000005908215,0.00024564844,0.00041442187,0.0005176141,0.9677317,0.00017856162,0.0002287977,0.0034784686,0.0268511],"study_design_scores_gemma":[0.00074304926,0.0002660882,0.000068700894,0.00044753304,0.000020378577,0.0012966127,0.000075998665,0.97490925,0.0070901345,0.0004270268,0.014346607,0.00030863364],"about_ca_topic_score_codex":0.00012421802,"about_ca_topic_score_gemma":6.247114e-7,"teacher_disagreement_score":0.60210747,"about_ca_system_score_codex":0.0005823046,"about_ca_system_score_gemma":0.00041314555,"threshold_uncertainty_score":0.9999702},"labels":[],"label_agreement":null},{"id":"W2478146898","doi":"10.1142/9789812818997_0013","title":"Knowledge Reuse in the Design of Models of Computational Intelligence","year":2008,"lang":"en","type":"book-chapter","venue":"Statistical science and interdisciplinary research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Reuse; Computer science; Software engineering; Management science; Engineering","score_opus":0.22393163845220146,"score_gpt":0.4250761065756969,"score_spread":0.20114446812349543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2478146898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007796939,0.00067297334,0.9007118,0.0005982174,0.00005857127,0.00037413754,0.00004846243,0.00001081542,0.09744706],"genre_scores_gemma":[0.85829955,0.00037621622,0.13667262,0.00003594393,0.00004580903,0.00002505501,0.000014081784,0.00001890065,0.004511845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966014,0.0002459666,0.00053948385,0.00059400336,0.0015904797,0.0004286881],"domain_scores_gemma":[0.99419415,0.004057694,0.00012061106,0.00064408366,0.0008616789,0.00012180472],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0063169594,0.00017155352,0.00031481893,0.0006412321,0.00041544926,0.00008950296,0.0030328792,0.000105807994,0.000021597725],"category_scores_gemma":[0.0004265797,0.000119789904,0.000033859953,0.00060670945,0.0037920752,0.00037168045,0.0029413134,0.0007561633,0.000013837019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005215255,0.000087241155,0.0000074501413,0.000121449,0.000008251478,0.00007426043,0.015249416,0.00918817,0.00002401894,0.9324649,0.006955751,0.03576695],"study_design_scores_gemma":[0.00004675984,0.0005439697,0.00007074231,0.00033924184,0.0000020330483,0.000030326499,0.00012708662,0.41560987,0.000026374237,0.58296424,0.00013468397,0.00010468368],"about_ca_topic_score_codex":0.000020414205,"about_ca_topic_score_gemma":0.0000046567106,"teacher_disagreement_score":0.8582216,"about_ca_system_score_codex":0.00008470252,"about_ca_system_score_gemma":0.0011142158,"threshold_uncertainty_score":0.998919},"labels":[],"label_agreement":null},{"id":"W2484023105","doi":"10.4018/978-1-60960-165-2.ch007","title":"Automatically Generated Explanations for Markov Decision Processes","year":2011,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Task (project management); Markov decision process; Set (abstract data type); Template; Domain (mathematical analysis); Probabilistic logic; Selection (genetic algorithm); Markov process; Markov chain; Artificial intelligence; Machine learning; Programming language; Engineering; Mathematics; Systems engineering","score_opus":0.031163178687213678,"score_gpt":0.25708979313248187,"score_spread":0.22592661444526818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2484023105","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000074701716,0.00025717064,0.48925516,0.000056244764,0.00030073532,0.00032183027,0.00011714097,0.00035421146,0.50933003],"genre_scores_gemma":[0.017336173,0.0000141879655,0.8682766,0.0013606573,0.00044792308,0.00019807668,0.000077661694,0.000102005,0.112186715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981586,0.0000160845,0.0004665653,0.0006226028,0.0003652314,0.00037096243],"domain_scores_gemma":[0.9981863,0.00029733582,0.00026171727,0.0006099603,0.00046589348,0.00017878991],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023222748,0.00038671214,0.00036471197,0.00010722795,0.0002584886,0.00025901658,0.0010308069,0.0003848639,0.000029748886],"category_scores_gemma":[0.00013139882,0.0003584409,0.00013130649,0.000047932575,0.00004477087,0.00012699068,0.00018873143,0.00018455155,0.00011797493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018831575,0.0000087260605,0.0000041225667,0.000096773896,0.00004922558,0.000022350903,0.00010132852,0.000022173752,0.0000028914083,0.9364638,0.016274026,0.046935774],"study_design_scores_gemma":[0.0003857487,0.00020095365,0.000010714491,0.00077010645,0.00006306417,0.00005446577,0.0000017049919,0.005560536,0.000076703865,0.9172429,0.074973784,0.0006593237],"about_ca_topic_score_codex":0.000017971903,"about_ca_topic_score_gemma":0.00004501093,"teacher_disagreement_score":0.39714333,"about_ca_system_score_codex":0.00010611583,"about_ca_system_score_gemma":0.00073362933,"threshold_uncertainty_score":0.99988675},"labels":[],"label_agreement":null},{"id":"W2484812731","doi":"10.1017/cbo9781107709393.007","title":"Granularity for Risk Measures","year":2014,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Granularity; Computer science; Programming language","score_opus":0.025905531415219077,"score_gpt":0.19372501811809825,"score_spread":0.16781948670287916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2484812731","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011721399,0.000103450126,0.4749934,0.000015648411,0.00023802667,0.00027652385,0.00015738334,0.00023611418,0.52396774],"genre_scores_gemma":[0.0018090232,0.000047143963,0.008293323,0.000100840596,0.00016789629,0.0000015357034,0.000048185873,0.00003677067,0.9894953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99832034,0.000063239284,0.00019761942,0.00073323544,0.00031448022,0.00037109145],"domain_scores_gemma":[0.9979273,0.00030513978,0.00035103605,0.0009697547,0.00024827107,0.00019851066],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004218722,0.00038783523,0.00043390322,0.00017586468,0.0005176186,0.00015430809,0.0014705433,0.00042628244,6.4786076e-7],"category_scores_gemma":[0.000035591784,0.0004500791,0.00032935466,0.000009045457,0.00011944098,0.00012602743,0.00041366456,0.00057473214,0.0000123775935],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003686664,0.0000035925977,0.000012171736,0.000069840324,0.00009703125,0.000037405138,0.00006839015,0.000031540134,0.000005629622,0.95081705,0.036435284,0.012385182],"study_design_scores_gemma":[0.0005544276,0.00008048443,0.0000129808595,0.00014799542,0.0001596584,0.000007901065,0.0000023660464,0.0042841304,0.00013282087,0.00041190267,0.99366707,0.0005382799],"about_ca_topic_score_codex":0.00023880623,"about_ca_topic_score_gemma":0.0000043562245,"teacher_disagreement_score":0.95723176,"about_ca_system_score_codex":0.00010470331,"about_ca_system_score_gemma":0.00011909512,"threshold_uncertainty_score":0.9997951},"labels":[],"label_agreement":null},{"id":"W2495476839","doi":"10.1016/s1874-5075(05)80024-5","title":"Diagnostic Abduction in AI","year":2005,"lang":"en","type":"book-chapter","venue":"˜A œpractical logic of cognitive systems","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Psychology","score_opus":0.04538320663531706,"score_gpt":0.30350960166293167,"score_spread":0.2581263950276146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2495476839","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005505098,0.0031097122,0.3255428,0.001884557,0.0016304298,0.000955718,0.00006511662,0.00019207451,0.6665645],"genre_scores_gemma":[0.9355276,0.00026099558,0.00327805,0.0006844908,0.0010723623,0.000071999675,0.00009087891,0.000062005405,0.058951575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997276,0.0002314112,0.00080721435,0.0006970488,0.0005989934,0.00038930296],"domain_scores_gemma":[0.9914102,0.007020377,0.0006327392,0.00037742106,0.0004150365,0.00014425053],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009501707,0.0003982921,0.0007229152,0.00032757534,0.000076185584,0.00013015108,0.00036064323,0.00054287363,0.000102360005],"category_scores_gemma":[0.0018271193,0.00037085835,0.00014804893,0.0001157275,0.00014581566,0.00049459306,0.00015548535,0.0010760188,0.0004895229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058904083,0.00015343945,0.0002793284,0.00030319724,0.0001268169,0.00066606636,0.00033061675,0.00036181422,0.0000102454505,0.97882676,0.0024015976,0.01648121],"study_design_scores_gemma":[0.007982784,0.006725168,0.0043118917,0.060644932,0.0013816683,0.0045139017,0.0008720459,0.0836076,0.00031985823,0.41037914,0.41012454,0.009136476],"about_ca_topic_score_codex":0.00008716374,"about_ca_topic_score_gemma":0.000013536539,"teacher_disagreement_score":0.9354726,"about_ca_system_score_codex":0.000118222466,"about_ca_system_score_gemma":0.0002593326,"threshold_uncertainty_score":0.99987435},"labels":[],"label_agreement":null},{"id":"W2505577309","doi":"10.1017/cbo9780511794797.017","title":"Mathematical Preliminaries and Notation","year":2010,"lang":"en","type":"other","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Notation; Mathematical notation; Computer science; Programming language; Calculus (dental); Algebra over a field; Mathematics; Arithmetic; Pure mathematics","score_opus":0.007585301928873722,"score_gpt":0.21904775723574027,"score_spread":0.21146245530686655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2505577309","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000038496405,0.00013947628,0.47405282,0.0002955273,0.00009343286,0.00005450015,9.968452e-7,0.00025792822,0.5251015],"genre_scores_gemma":[0.0002579352,0.0000087286935,0.36504576,0.00011729846,0.00006661847,0.0000055667756,0.0000040586515,0.00004728163,0.63444674],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99952275,0.000013105191,0.00007462199,0.00018941677,0.000098504664,0.00010159269],"domain_scores_gemma":[0.9995704,0.00008861467,0.000054010197,0.00023677117,0.00000899124,0.00004115865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009393284,0.00009996175,0.00010825893,0.00007174364,0.000035582594,0.0001224561,0.00020254559,0.00017673126,0.0005158854],"category_scores_gemma":[0.000026526714,0.0000786766,0.000013834562,0.00004184272,0.00003264733,0.00005007522,0.000077134646,0.0001540823,0.0001367828],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010677775,0.000016003043,0.00005511461,0.00017673735,0.000015176522,0.000008093517,0.00064980565,0.0000011394156,0.00002340905,0.31903797,0.63949937,0.04051607],"study_design_scores_gemma":[0.00017898473,0.00008318074,0.00006513592,0.00036930808,0.000017640084,0.000042770946,0.000015415435,0.029484646,0.00011196098,0.028469563,0.9407172,0.00044416552],"about_ca_topic_score_codex":0.000029076384,"about_ca_topic_score_gemma":0.0000165793,"teacher_disagreement_score":0.30121782,"about_ca_system_score_codex":0.0000020662503,"about_ca_system_score_gemma":0.000022410171,"threshold_uncertainty_score":0.5648583},"labels":[],"label_agreement":null},{"id":"W2508110801","doi":"","title":"Autonomous and Intelligent Systems: Second International Conference, AIS 2011, Burnaby, BC, Canada, June 22-24, 2011, Proceedings (Lecture Notes in ... / Lecture Notes in Artificial Intelligence)","year":2011,"lang":"en","type":"book","venue":"Springer eBooks","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Intelligent decision support system; Computer science; Artificial intelligence; Library science; Operations research; Engineering","score_opus":0.027038002086954647,"score_gpt":0.22472524466753466,"score_spread":0.19768724258058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2508110801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071756504,0.010350745,0.70792514,0.0023572198,0.016828641,0.0040727337,0.00036460313,0.00072448293,0.25020078],"genre_scores_gemma":[0.9203072,0.00020284974,0.011446813,0.00069594383,0.0015185255,0.00024875932,0.0001403825,0.00022886643,0.06521065],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99593836,0.00006760227,0.0011807064,0.0013465522,0.00062356424,0.0008432248],"domain_scores_gemma":[0.9978878,0.0003614393,0.0006245923,0.00049816555,0.00036018397,0.0002678124],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007530722,0.0008317748,0.0008977651,0.00090381555,0.00016137012,0.0005881364,0.0015645401,0.00075765926,0.00058631017],"category_scores_gemma":[0.000102617385,0.0008222881,0.00011503237,0.0001014976,0.00014437178,0.00022769519,0.0005905039,0.0017586239,0.000073941876],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058928865,0.00042019133,0.011769358,0.0042569153,0.0012801071,0.0022722383,0.050086178,0.008491504,0.0015831413,0.2687134,0.021290513,0.6292471],"study_design_scores_gemma":[0.0012350049,0.000883487,0.000990542,0.012560562,0.00026345655,0.0006970512,0.0003361761,0.17945486,0.04200761,0.36107877,0.39044628,0.0100461785],"about_ca_topic_score_codex":0.07582693,"about_ca_topic_score_gemma":0.24762198,"teacher_disagreement_score":0.91313154,"about_ca_system_score_codex":0.00080981775,"about_ca_system_score_gemma":0.002672198,"threshold_uncertainty_score":0.9994228},"labels":[],"label_agreement":null},{"id":"W2511956019","doi":"10.1007/978-981-10-1981-4_4","title":"Expansion of Habitual Domains and DMCS","year":2016,"lang":"en","type":"book-chapter","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Simple (philosophy); Computer science; Management science; Mathematics; Engineering; Epistemology","score_opus":0.014622540680780697,"score_gpt":0.2118307578757764,"score_spread":0.1972082171949957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2511956019","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008959677,0.00048962416,0.3037761,0.0003925259,0.00017305577,0.00007973718,0.00001070349,0.00010528893,0.69488335],"genre_scores_gemma":[0.016749661,0.000177794,0.06735624,0.0003707356,0.00015489379,0.0000024307237,0.000006645793,0.000032964228,0.9151486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908984,0.000011188355,0.00021536772,0.00032562172,0.00021164378,0.00014631599],"domain_scores_gemma":[0.99911773,0.0001966808,0.00014102177,0.00041725894,0.000053050582,0.00007428062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001827215,0.00017765637,0.00023564498,0.000105373656,0.00005940329,0.00003161687,0.0003395977,0.00019232172,0.00009243096],"category_scores_gemma":[0.0000070333726,0.00012467493,0.000054714325,0.000014387201,0.00007123434,0.00012305035,0.00023164852,0.00012899993,0.00004810801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036364827,0.0000023098776,0.00003207355,0.000035246103,0.00001690586,0.000012641477,0.00016429344,0.0000014944216,0.00016671832,0.9493726,0.0035858168,0.046606287],"study_design_scores_gemma":[0.0017974045,0.001147158,0.0002527732,0.0044179354,0.00008317542,0.00015934277,0.000022625798,0.0037542025,0.0030616038,0.5428218,0.44022602,0.0022559357],"about_ca_topic_score_codex":0.000007384433,"about_ca_topic_score_gemma":0.0000031711902,"teacher_disagreement_score":0.4366402,"about_ca_system_score_codex":0.000012554702,"about_ca_system_score_gemma":0.00007854657,"threshold_uncertainty_score":0.5084096},"labels":[],"label_agreement":null},{"id":"W251588874","doi":"10.1007/978-3-642-34922-5_10","title":"Learning Techniques in Presence of Uncertainty","year":2012,"lang":"en","type":"book-chapter","venue":"Studies in fuzziness and soft computing","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science","score_opus":0.041743931164946825,"score_gpt":0.2972109819178459,"score_spread":0.25546705075289905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W251588874","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04628553,0.32016215,0.22936068,0.0016067942,0.0053513935,0.003510594,0.000028144335,0.002278591,0.3914161],"genre_scores_gemma":[0.97562605,0.002067978,0.018090975,0.00005227537,0.00022260303,0.000010161102,0.00000529175,0.0000346358,0.003890039],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831706,0.00007032759,0.00055703375,0.00045646087,0.0002262095,0.00037292117],"domain_scores_gemma":[0.9981415,0.0010639272,0.00035552072,0.0002612612,0.00013570877,0.000042070904],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011878518,0.00030427918,0.0006827027,0.00029521884,0.00015013776,0.000033353495,0.00043858853,0.00017739228,0.0000017595007],"category_scores_gemma":[0.0002102759,0.00028361363,0.000054825337,0.00013502261,0.0002055529,0.00014298731,0.0010234535,0.0006817758,0.000001116265],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023634551,0.000043122913,0.043372747,0.0019853245,0.00013065709,0.00011505735,0.027483515,0.011634778,0.000030752144,0.11058768,0.00021827561,0.80437446],"study_design_scores_gemma":[0.004497941,0.0021425916,0.01873452,0.11524776,0.00025526568,0.00028057495,0.0077609224,0.49494156,0.00053289783,0.24947324,0.095536396,0.010596313],"about_ca_topic_score_codex":0.0000941022,"about_ca_topic_score_gemma":0.000038802482,"teacher_disagreement_score":0.92934054,"about_ca_system_score_codex":0.00006082215,"about_ca_system_score_gemma":0.00004880238,"threshold_uncertainty_score":0.9999616},"labels":[],"label_agreement":null},{"id":"W2516590751","doi":"10.20982/tqmp.02.2.p077","title":"Getting parameters from learning data","year":2006,"lang":"en","type":"article","venue":"Tutorials in Quantitative Methods for Psychology","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Data science; Psychology","score_opus":0.20672096973123205,"score_gpt":0.5085546960707151,"score_spread":0.3018337263394831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516590751","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010363159,0.0011138486,0.9820232,0.0006157727,0.004461346,0.00028417748,0.00003180344,0.00017270606,0.00093400816],"genre_scores_gemma":[0.0086734425,0.000010267404,0.9904281,0.0002645902,0.00034010588,0.00004787769,0.00014480672,0.000022747507,0.000068059584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950717,0.002617332,0.0006437687,0.0010329962,0.00012900338,0.00050516997],"domain_scores_gemma":[0.9867373,0.011808477,0.000364737,0.00096114905,0.0000815211,0.000046807192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007977668,0.0002205809,0.0004878823,0.00022390283,0.00017828154,0.00011737433,0.0015514843,0.00017605195,0.000009911926],"category_scores_gemma":[0.0032977737,0.00022048544,0.000067480265,0.0004313981,0.00009787561,0.0004362003,0.00026466552,0.00038127392,0.000020310637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035794824,0.0002679788,0.011312322,0.000058426864,0.00016771161,0.000043114476,0.0046777558,0.008789084,0.078796946,0.5339898,0.01015369,0.35138527],"study_design_scores_gemma":[0.0021921555,0.0006104693,0.0040822057,0.00011452649,0.000035234592,0.000007717664,0.00015624119,0.19913642,0.0037985404,0.6666031,0.122501045,0.0007623258],"about_ca_topic_score_codex":0.00072481803,"about_ca_topic_score_gemma":0.000028071312,"teacher_disagreement_score":0.35062292,"about_ca_system_score_codex":0.000034012253,"about_ca_system_score_gemma":0.000051027808,"threshold_uncertainty_score":0.89911354},"labels":[],"label_agreement":null},{"id":"W2524164710","doi":"10.6000/2371-1647.2016.02.05","title":"Application of Fuzzy Numbers to the Assessment of CBR Systems","year":2016,"lang":"en","type":"article","venue":"Journal of Advances in Management Sciences & Information Systems","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fuzzy logic; Computer science; Case-based reasoning; Defuzzification; Artificial intelligence; Machine learning; Data mining; Operations research; Fuzzy number; Fuzzy set; Mathematics","score_opus":0.008801921970240212,"score_gpt":0.288934812038651,"score_spread":0.2801328900684108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2524164710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020963524,0.00038940116,0.98364824,0.0005816714,0.001130899,0.000401716,0.0000028006793,0.000010132008,0.011738772],"genre_scores_gemma":[0.9824088,0.00016714961,0.017286038,0.000039615752,0.00003205331,0.000020091526,2.9878737e-7,0.0000015499758,0.00004437153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975093,0.000112514055,0.001149083,0.00010054815,0.0009615567,0.00016702244],"domain_scores_gemma":[0.9975426,0.00018030414,0.0017185282,0.00027136746,0.00024286006,0.000044317207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044403956,0.000087714274,0.00021910043,0.00047544655,0.00009076497,0.00012580075,0.001280135,0.000022911127,7.447416e-7],"category_scores_gemma":[0.00003455297,0.00004733391,0.000046157427,0.0009729152,0.00007092291,0.0038218917,0.00011206563,0.000062536616,0.00000721816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009211398,0.000024176872,0.020920979,0.0004528752,0.000021827322,9.315959e-7,0.0013431977,0.6830826,0.00006431233,0.23525374,0.0007575811,0.058068585],"study_design_scores_gemma":[0.0023942145,0.0014988008,0.029768983,0.00748264,0.000049674618,0.000105850355,0.017883945,0.49676475,0.00031371188,0.0036708163,0.43935084,0.00071576197],"about_ca_topic_score_codex":0.00003190437,"about_ca_topic_score_gemma":0.000002274502,"teacher_disagreement_score":0.98031247,"about_ca_system_score_codex":0.00009252048,"about_ca_system_score_gemma":0.00006119465,"threshold_uncertainty_score":0.2770779},"labels":[],"label_agreement":null},{"id":"W2525590421","doi":"10.1108/ir-02-2016-0059","title":"Requirements for building an ontology for autonomous robots","year":2016,"lang":"en","type":"article","venue":"Industrial Robot the international journal of robotics research and application","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of New Brunswick; Defence Research and Development Canada; University of Waterloo","funders":"","keywords":"Robot; Robotics; Artificial intelligence; Ontology; Computer science; Automation; Robotic paradigms; Process ontology; Autonomous robot; Human–computer interaction; Mobile robot; Engineering; Conceptualization","score_opus":0.22642261275889702,"score_gpt":0.4315947405036962,"score_spread":0.20517212774479915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2525590421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032197072,0.00006874602,0.96439826,0.031345244,0.00050397817,0.00042094526,0.000008632719,0.000013337239,0.000021128852],"genre_scores_gemma":[0.84767616,0.00004412497,0.15018378,0.00015818882,0.0016357882,0.00008182485,0.000006867883,0.000014111842,0.00019917509],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843836,0.00010450046,0.0004158749,0.00022110985,0.0005357528,0.0002844073],"domain_scores_gemma":[0.99650013,0.0015895739,0.00032723488,0.0002194879,0.0012389795,0.00012456924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032547202,0.00009015869,0.00014159219,0.00019837468,0.0002680136,0.00025089513,0.0014958122,0.000106128464,0.0000015483892],"category_scores_gemma":[0.00066047546,0.00005521182,0.00005733982,0.000120325356,0.00009460284,0.00047101371,0.00014836669,0.00022076517,0.0000013495188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006780085,0.00017267118,0.0008622402,0.00000827505,0.00017415019,0.0000046036594,0.00021147593,0.031398356,0.052327864,0.26491448,0.004601893,0.644646],"study_design_scores_gemma":[0.011484156,0.005398338,0.0006428677,0.0005843396,0.000057852307,0.00033282998,0.00015674543,0.3837869,0.03522745,0.5036811,0.058045045,0.00060235866],"about_ca_topic_score_codex":0.000023597211,"about_ca_topic_score_gemma":0.00000906774,"teacher_disagreement_score":0.84445643,"about_ca_system_score_codex":0.00016230717,"about_ca_system_score_gemma":0.00028259231,"threshold_uncertainty_score":0.2779616},"labels":[],"label_agreement":null},{"id":"W2540405007","doi":"10.1613/jair.5128","title":"Optimal Partial-Order Plan Relaxation via MaxSAT","year":2016,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Flexibility (engineering); Computer science; Plan (archaeology); Encoding (memory); Mathematical optimization; Heuristic; Metric (unit); Order (exchange); Algorithm; Artificial intelligence; Mathematics; Operations management","score_opus":0.15473498814575595,"score_gpt":0.3874821599405522,"score_spread":0.23274717179479623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2540405007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041825157,0.00017808074,0.95116144,0.0058560995,0.0004874595,0.000095229465,0.000001300269,0.000029685634,0.00036552077],"genre_scores_gemma":[0.9473227,0.00010118823,0.05163166,0.000046854213,0.00054061995,0.000003894603,4.6038548e-7,0.000013030925,0.00033956696],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99677217,0.0004572205,0.0007355089,0.00026818452,0.0011726732,0.0005942505],"domain_scores_gemma":[0.9967875,0.0011435228,0.0003082879,0.00037262242,0.0011376189,0.00025044082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005630549,0.00012419868,0.00020348495,0.0004866753,0.00030964782,0.00026650523,0.001149724,0.000114140035,0.0001635284],"category_scores_gemma":[0.0010629824,0.00008137616,0.00009546232,0.00085611513,0.00016574573,0.0008745661,0.00018221025,0.00058409304,0.0004208913],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024274613,0.00016573913,0.00088378676,0.000017528942,0.000045210527,0.00022775712,0.0019084957,0.005662408,0.03800736,0.03771637,0.0026623192,0.91246027],"study_design_scores_gemma":[0.00025761442,0.003497135,0.00046428214,0.0010200884,0.000020648135,0.00060337747,0.0008099165,0.25075626,0.5826594,0.13542144,0.023732407,0.0007574083],"about_ca_topic_score_codex":0.00003376392,"about_ca_topic_score_gemma":0.0000074036466,"teacher_disagreement_score":0.9117029,"about_ca_system_score_codex":0.00011425217,"about_ca_system_score_gemma":0.0003721636,"threshold_uncertainty_score":0.54098463},"labels":[],"label_agreement":null},{"id":"W2548305205","doi":"10.7939/r3543x","title":"Downward Path Preserving State Space Abstractions","year":2009,"lang":"en","type":"article","venue":"University of Alberta Library","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Spurious relationship; Abstraction; Heuristics; Property (philosophy); Computer science; State space; Domain (mathematical analysis); Path (computing); Heuristic; Theoretical computer science; Benchmark (surveying); State (computer science); Algorithm; Mathematics; Artificial intelligence; Programming language; Machine learning","score_opus":0.0069644939160803145,"score_gpt":0.172425118101203,"score_spread":0.1654606241851227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548305205","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42650977,0.00030396148,0.16344428,0.028920785,0.0002988816,0.0002731416,0.000013828741,0.00065221696,0.37958315],"genre_scores_gemma":[0.89178485,0.000045514964,0.08170571,0.00032140306,0.000023402848,3.691127e-8,0.00001705146,0.000006260376,0.02609577],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994026,0.000035469624,0.0000767298,0.00020100185,0.00011131482,0.00017288666],"domain_scores_gemma":[0.9993365,0.0001384258,0.00008561353,0.0003298537,0.00001565121,0.00009395971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000046840967,0.00008189857,0.00010227551,0.00009191012,0.00016545843,0.000052414285,0.0006824314,0.00004231067,0.00017422123],"category_scores_gemma":[0.000008196655,0.000095052244,0.000056058227,0.0001885438,0.000023880906,0.0018492377,0.00015630785,0.00013008219,0.000053725482],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000277644,0.0007889823,0.0726655,0.00021117466,0.00020220631,0.000623826,0.0859356,0.030496942,0.002115398,0.15999693,0.57694614,0.069739684],"study_design_scores_gemma":[0.002099309,0.00091531867,0.19988185,0.00059487927,0.00006361914,0.00005097817,0.0014755654,0.12270993,0.004556354,0.03705446,0.62907326,0.0015244834],"about_ca_topic_score_codex":0.0006555675,"about_ca_topic_score_gemma":0.000021674761,"teacher_disagreement_score":0.46527508,"about_ca_system_score_codex":0.000008088463,"about_ca_system_score_gemma":0.00008668842,"threshold_uncertainty_score":0.3876118},"labels":[],"label_agreement":null},{"id":"W2548985425","doi":"10.1613/jair.4908","title":"Scrubbing During Learning In Real-time Heuristic Search","year":2016,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristic; Computer science; Incremental heuristic search; Bounded function; State (computer science); Computation; Simple (philosophy); Mathematical optimization; Data scrubbing; State space; Algorithm; Beam search; Search algorithm; Mathematics; Artificial intelligence","score_opus":0.12913082411398621,"score_gpt":0.39175393480266063,"score_spread":0.2626231106886744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548985425","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7889868,0.00018217452,0.2067495,0.0027114316,0.00019552693,0.00012874904,6.442266e-7,0.00005539081,0.0009897898],"genre_scores_gemma":[0.99160063,0.0002732486,0.007219475,0.0000063739863,0.0002638404,0.0000023993175,1.4776545e-7,0.000016019769,0.0006178908],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9956294,0.0009820184,0.00086254353,0.00033246443,0.001305607,0.00088799535],"domain_scores_gemma":[0.9961988,0.002218717,0.00025177145,0.00031902525,0.00075559487,0.00025613798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009739788,0.00013765982,0.0002859052,0.0012031144,0.00037254742,0.0003091594,0.0013137142,0.00010116745,0.00011511377],"category_scores_gemma":[0.0022895415,0.0000998285,0.00009832937,0.0013626779,0.00017004124,0.0007542946,0.000338756,0.0011843422,0.0003970015],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033363924,0.00021071488,0.011030624,0.00008387292,0.000036658552,0.0014993991,0.0049404786,0.015545367,0.49529356,0.012230114,0.00019847498,0.45859712],"study_design_scores_gemma":[0.0005350541,0.0029709511,0.009696319,0.006021819,0.000012495165,0.00077687285,0.0027500638,0.24370277,0.6631941,0.06845278,0.000738766,0.0011479851],"about_ca_topic_score_codex":0.0001303572,"about_ca_topic_score_gemma":0.00001253885,"teacher_disagreement_score":0.45744914,"about_ca_system_score_codex":0.0003008275,"about_ca_system_score_gemma":0.0005091258,"threshold_uncertainty_score":0.5145443},"labels":[],"label_agreement":null},{"id":"W2555956881","doi":"10.7939/r3348gj05","title":"Bidirectional Search That Is Guaranteed to Meet in the Middle: Extended Version","year":2015,"lang":"en","type":"article","venue":"University of Alberta Library","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristic; Midpoint; Node (physics); Computer science; Search algorithm; Algorithm; Bidirectional search; Mathematical optimization; Best-first search; Mathematics; Artificial intelligence; Beam search; Engineering; Geometry","score_opus":0.04135516513534372,"score_gpt":0.21211988005031243,"score_spread":0.1707647149149687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2555956881","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8745156,0.0001538878,0.006050695,0.029357167,0.0002540924,0.00024737156,0.000009635418,0.00009695225,0.08931462],"genre_scores_gemma":[0.97976285,0.0000056205045,0.0132605,0.001744647,0.000022181617,1.2841559e-7,0.0000105365225,0.0000053879558,0.005188169],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99918497,0.00012937626,0.000059530736,0.00020398077,0.00026449127,0.00015767143],"domain_scores_gemma":[0.999337,0.0002627748,0.000029726909,0.0002670502,0.000019475408,0.000083977706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020190731,0.000071345654,0.000091088434,0.00017221611,0.00010021811,0.00004008917,0.00091942324,0.000047862533,0.0000830621],"category_scores_gemma":[0.000012626222,0.00006479906,0.0000409761,0.00049040903,0.00003434684,0.0007207151,0.00026961477,0.00009017136,0.000059660273],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000437985,0.00024528246,0.0843568,0.000045410725,0.00005782478,0.00015388623,0.23656355,0.0015887275,0.000109870765,0.027794288,0.6462308,0.0024155376],"study_design_scores_gemma":[0.006598997,0.0016853547,0.069442734,0.001002809,0.00006340454,0.0001370833,0.043407205,0.12816009,0.009260116,0.012170589,0.72646093,0.001610691],"about_ca_topic_score_codex":0.0015635365,"about_ca_topic_score_gemma":0.00007890117,"teacher_disagreement_score":0.19315633,"about_ca_system_score_codex":0.000017051534,"about_ca_system_score_gemma":0.0001475347,"threshold_uncertainty_score":0.2642429},"labels":[],"label_agreement":null},{"id":"W255735106","doi":"","title":"A Cased-Based Reasoning Decision Support System/SYSTEME DU SUPPORT DECISION CBR DANS L'ACQUISITION GOVERNMENTALE","year":2005,"lang":"en","type":"article","venue":"Canadian social science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bidding; Markup language; Profit (economics); Operations research; Microeconomics; Economics; Computer science; Humanities; Engineering; Philosophy; World Wide Web; XML","score_opus":0.007080912567234225,"score_gpt":0.2279921899217631,"score_spread":0.22091127735452887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W255735106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26744372,0.00006936309,0.6360659,0.001264399,0.0020501416,0.0007133734,0.00019823463,0.000529775,0.09166511],"genre_scores_gemma":[0.9679179,8.668011e-7,0.030457396,0.0011185175,0.00033575177,0.000020880296,0.00001524022,0.000017647975,0.00011580822],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960489,0.00009426294,0.0004778559,0.0008708988,0.0014324996,0.00107557],"domain_scores_gemma":[0.9978227,0.00022202547,0.00022817055,0.0005574616,0.00020852676,0.00096109835],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0025822595,0.00026117335,0.00027125428,0.00035289105,0.0024301505,0.0007018671,0.0017034025,0.00015515166,0.00009219957],"category_scores_gemma":[0.00018047374,0.0002732914,0.000117907264,0.0014952191,0.000271948,0.0012490599,0.00014723404,0.00020622637,0.00031177982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017212931,0.00029977004,0.223863,0.0002914324,0.00006124196,0.0043386337,0.029609002,0.007105494,0.009987931,0.15331714,0.120973445,0.4499808],"study_design_scores_gemma":[0.0049815853,0.0011237653,0.05611504,0.0022571408,0.00011461066,0.0015404699,0.009584254,0.7527291,0.012056676,0.00063000486,0.15454668,0.004320647],"about_ca_topic_score_codex":0.007169305,"about_ca_topic_score_gemma":0.011069419,"teacher_disagreement_score":0.74562365,"about_ca_system_score_codex":0.00445304,"about_ca_system_score_gemma":0.0026732255,"threshold_uncertainty_score":0.9999719},"labels":[],"label_agreement":null},{"id":"W2563439192","doi":"10.1609/aimag.v33i4.2444","title":"Reports of the AAAI 2012 Conference Workshops","year":2012,"lang":"en","type":"article","venue":"AI Magazine","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Personalization; Context (archaeology); Computer science; Artificial intelligence; Robotics; Representation (politics); World Wide Web; Human–computer interaction; Robot; Geography","score_opus":0.018423294174936846,"score_gpt":0.24375597091393827,"score_spread":0.22533267673900143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563439192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06707785,0.0052635395,0.7982647,0.023545431,0.0059571695,0.00058670493,0.000010658952,0.0005140268,0.098779924],"genre_scores_gemma":[0.9868378,0.0000047326344,0.007967527,0.00075660873,0.00009084202,0.0000042064853,0.000002116625,0.000005684508,0.004330498],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990595,0.000061204504,0.00022517644,0.00015856251,0.00021074092,0.00028481364],"domain_scores_gemma":[0.9988706,0.00008788684,0.00016780272,0.00071367057,0.00008145141,0.00007856136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005318504,0.00009528164,0.00012202735,0.00003150235,0.00008025982,0.00003987124,0.00045529142,0.000052204174,0.00012001747],"category_scores_gemma":[0.00006794461,0.00006508274,0.000051936888,0.00027409894,0.000047620655,0.0005075836,0.00023204793,0.00017475801,0.00010054721],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013021952,0.0002634574,0.31296295,0.00009975371,0.000064508364,0.00004713984,0.0046404554,0.00044524987,0.007979405,0.08413952,0.50542,0.08392452],"study_design_scores_gemma":[0.00050490675,0.00012498477,0.3271332,0.0005339906,0.000054158776,0.0005516415,0.000025698322,0.014979625,0.009769711,0.011375079,0.63411963,0.00082740746],"about_ca_topic_score_codex":0.000011305745,"about_ca_topic_score_gemma":0.0000033992412,"teacher_disagreement_score":0.9197599,"about_ca_system_score_codex":0.00000988523,"about_ca_system_score_gemma":0.000060413826,"threshold_uncertainty_score":0.2653997},"labels":[],"label_agreement":null},{"id":"W2563461029","doi":"","title":"Foundations for generalized planning in unbounded stochastic domains","year":2016,"lang":"en","type":"article","venue":"Lirias (KU Leuven)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Vlaamse regering; Fonds Wetenschappelijk Onderzoek","keywords":"Correctness; Computer science; Plan (archaeology); State (computer science); Action (physics); Controller (irrigation); Theoretical computer science; Algorithm","score_opus":0.04244415176695839,"score_gpt":0.30082314735400545,"score_spread":0.2583789955870471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563461029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043850347,0.0001055699,0.9508572,0.0035320763,0.00062731525,0.00029238514,0.000015380465,0.0002021141,0.00051760423],"genre_scores_gemma":[0.9163784,0.000001936216,0.08149087,0.0004919556,0.0002038976,0.0001293318,0.000016832566,0.000021724441,0.0012650485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984865,0.000091332346,0.00032371117,0.00043153373,0.0001921092,0.00047479957],"domain_scores_gemma":[0.99837804,0.00088301324,0.0001228637,0.00045528158,0.00005830179,0.00010249076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005406004,0.00017491533,0.00021681495,0.00020966772,0.00025233635,0.00016269168,0.00058722857,0.000096860356,0.000026026015],"category_scores_gemma":[0.000254966,0.00013778525,0.00007872145,0.0003285298,0.000044343,0.00050492387,0.00010469515,0.000108018445,0.0000658323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032040456,0.00030637428,0.005768334,0.0001396582,0.00017199207,0.000106038955,0.010972948,0.054571114,0.008729555,0.7723585,0.016394084,0.13016103],"study_design_scores_gemma":[0.018897684,0.0009568334,0.008922336,0.0020429085,0.00009176944,0.00009692721,0.00021047961,0.40589613,0.0015444948,0.46149743,0.097252704,0.0025903175],"about_ca_topic_score_codex":0.00005172802,"about_ca_topic_score_gemma":0.000039246155,"teacher_disagreement_score":0.8725281,"about_ca_system_score_codex":0.00012554773,"about_ca_system_score_gemma":0.00017134656,"threshold_uncertainty_score":0.56187195},"labels":[],"label_agreement":null},{"id":"W2566652907","doi":"10.1609/aaai.v30i1.10436","title":"Bidirectional Search That Is Guaranteed to Meet in the Middle","year":2016,"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":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation; Compute Canada; National Science Foundation","keywords":"Node (physics); Heuristic; Search algorithm; Bidirectional search; Computer science; Brute force; Best-first search; Midpoint; Incremental heuristic search; Algorithm; Mathematical optimization; Beam search; Mathematics; Artificial intelligence; Engineering; Computer security; Geometry","score_opus":0.17798934605340982,"score_gpt":0.3083391178389802,"score_spread":0.1303497717855704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566652907","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7832317,0.0000715432,0.07143381,0.11273804,0.00093330385,0.0011924455,0.000029203085,0.00019656314,0.030173382],"genre_scores_gemma":[0.99639624,0.000009349719,0.0017000155,0.0014579259,0.000053974843,0.00003054595,9.142517e-8,0.000007691949,0.0003441822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980909,0.00004421857,0.00034602542,0.00045603496,0.00066772714,0.0003950428],"domain_scores_gemma":[0.99884677,0.00034160694,0.00013689735,0.00031738685,0.00029085804,0.00006650975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001311191,0.0001779067,0.00017863221,0.00018124912,0.00021085923,0.00022706794,0.0025211743,0.00007118169,0.00007079051],"category_scores_gemma":[0.00026978608,0.00009203697,0.00008631912,0.0008682668,0.00014704447,0.00028507158,0.00027307644,0.00018762155,0.00013698389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009982967,0.00013412288,0.0039797802,0.000029622792,0.000014971459,0.0000014510118,0.01479202,0.00005570277,0.040743455,0.88065225,0.0027242252,0.056772556],"study_design_scores_gemma":[0.00006280274,0.00032927992,0.0010857433,0.0010690829,0.000008338406,0.000015780353,0.0015764819,0.014476056,0.79835415,0.18161668,0.001047258,0.00035833078],"about_ca_topic_score_codex":0.00011463087,"about_ca_topic_score_gemma":0.00003159972,"teacher_disagreement_score":0.75761074,"about_ca_system_score_codex":0.000044942197,"about_ca_system_score_gemma":0.00010487598,"threshold_uncertainty_score":0.4685011},"labels":[],"label_agreement":null},{"id":"W2566659572","doi":"10.1609/aaai.v30i1.10081","title":"On the Completeness of Best-First Search Variants That Use Random Exploration","year":2016,"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":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Incremental heuristic search; Greedy algorithm; Computer science; Robustness (evolution); Completeness (order theory); Best-first search; Heuristic; Beam search; Greedy randomized adaptive search procedure; Mathematical optimization; Search algorithm; Graph; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence","score_opus":0.23837014475232568,"score_gpt":0.3007328333075417,"score_spread":0.06236268855521601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566659572","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48687565,0.00002023771,0.48284304,0.02539999,0.0006141007,0.0009570786,0.00002536413,0.00010738526,0.0031571628],"genre_scores_gemma":[0.9984255,0.000041396026,0.0011009169,0.00016690836,0.00003347398,0.000027272241,3.555659e-7,0.000010860738,0.0001933466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99805504,0.00006599096,0.0004639586,0.00041662384,0.00067338516,0.0003250297],"domain_scores_gemma":[0.99699265,0.0014355425,0.000397039,0.00044226565,0.00066625874,0.000066238994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001228895,0.00020631099,0.0002665586,0.00011853438,0.0003445598,0.00026021112,0.002017995,0.00007843399,0.00006034654],"category_scores_gemma":[0.00089065864,0.00010332744,0.00010499605,0.00047057142,0.0003145694,0.0007790511,0.00029620813,0.00021893957,0.00008786137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025250582,0.00012548502,0.00078688085,0.000035158864,0.000020308766,5.0599886e-7,0.002234016,0.000296582,0.028314171,0.9401253,0.0002213724,0.027587712],"study_design_scores_gemma":[0.00013660485,0.00043670172,0.00040172407,0.0015993576,0.000015595997,0.0000033346735,0.00051480584,0.058178417,0.754146,0.18421601,0.000084110594,0.00026738475],"about_ca_topic_score_codex":0.00011245239,"about_ca_topic_score_gemma":0.0000130808085,"teacher_disagreement_score":0.75590926,"about_ca_system_score_codex":0.00003324925,"about_ca_system_score_gemma":0.000095602656,"threshold_uncertainty_score":0.42135707},"labels":[],"label_agreement":null},{"id":"W256918177","doi":"10.1609/icaps.v24i1.13682","title":"Non-Deterministic Planning With Conditional Effects","year":2014,"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":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Planner; Soundness; Determinism; Computer science; Variety (cybernetics); Completeness (order theory); Key (lock); Extension (predicate logic); Core (optical fiber); Artificial intelligence; Programming language; Mathematics; Computer security","score_opus":0.018108935209690247,"score_gpt":0.2621770235230653,"score_spread":0.24406808831337506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W256918177","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9432272,0.000033685952,0.04112561,0.00140257,0.0003587972,0.00016664766,0.0000056190615,0.00048222064,0.0131977],"genre_scores_gemma":[0.9813914,9.883356e-7,0.018131226,0.00030684817,0.000061552484,0.000014150208,0.000006319907,0.000011730746,0.000075832504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986599,0.000012782376,0.00025078742,0.00036574565,0.00047647144,0.00023431997],"domain_scores_gemma":[0.9989428,0.00028026683,0.00031934283,0.00010691606,0.00026925362,0.00008145762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004282925,0.000203939,0.00021228699,0.00015725671,0.00026544067,0.00034440326,0.000871462,0.000080221216,0.000003087376],"category_scores_gemma":[0.00019948298,0.00014560501,0.000040081963,0.00016465785,0.00008643565,0.00029656957,0.00016651167,0.00030964523,0.0000044831872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037628913,0.00018138735,0.17063639,0.0007155162,0.00043326922,0.000039422768,0.0069359527,0.05713987,0.06584394,0.69228166,0.0014316036,0.003984716],"study_design_scores_gemma":[0.0005020753,0.00023083652,0.013062244,0.0021550015,0.000015122597,0.000067565765,0.00010522817,0.9692958,0.008410775,0.0058833756,0.00005617485,0.00021580755],"about_ca_topic_score_codex":0.000006387419,"about_ca_topic_score_gemma":9.9426984e-8,"teacher_disagreement_score":0.9121559,"about_ca_system_score_codex":0.000023356142,"about_ca_system_score_gemma":0.00006318043,"threshold_uncertainty_score":0.59376},"labels":[],"label_agreement":null},{"id":"W2573654191","doi":"10.1609/socs.v7i1.18409","title":"Numeric Planning via Search Space Abstraction (Extended Abstract)","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Leverage (statistics); Abstraction; Computer science; State space; Space (punctuation); Set (abstract data type); Theoretical computer science; Artificial intelligence; Programming language; Mathematics","score_opus":0.018560106576552268,"score_gpt":0.27173650500060836,"score_spread":0.2531763984240561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573654191","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8934512,0.000092950446,0.002385648,0.021496415,0.009790151,0.00037824264,0.000011305824,0.00023639297,0.072157696],"genre_scores_gemma":[0.9974264,0.0000102902495,0.0013572051,0.00012524155,0.0004495537,0.000011413621,0.0000056065746,0.000019495048,0.00059481035],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971356,0.000026128702,0.00036909684,0.0005177152,0.0015668125,0.0003846832],"domain_scores_gemma":[0.9980959,0.00030006163,0.00020911056,0.00024066019,0.0010355591,0.00011869258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009369602,0.00019486231,0.00020078654,0.0001240452,0.00030633135,0.00042262886,0.0017939912,0.00012479565,0.000050117662],"category_scores_gemma":[0.00015669916,0.00017028727,0.00014642454,0.00055496214,0.00006323739,0.00056740694,0.0005931149,0.0007057494,0.00004567724],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033681464,0.00083435344,0.016916942,0.00017587369,0.00025628947,0.00003966369,0.0025836546,0.005589378,0.54953873,0.41401482,0.0045918827,0.005121612],"study_design_scores_gemma":[0.0014717594,0.00027770916,0.023398526,0.000550232,0.000018202507,0.00011821108,0.0002587852,0.025216976,0.9172283,0.025181975,0.0057921303,0.000487205],"about_ca_topic_score_codex":0.00016080198,"about_ca_topic_score_gemma":5.921138e-7,"teacher_disagreement_score":0.38883287,"about_ca_system_score_codex":0.00024086975,"about_ca_system_score_gemma":0.00018818739,"threshold_uncertainty_score":0.69441134},"labels":[],"label_agreement":null},{"id":"W2574020264","doi":"10.1609/icaps.v26i1.13773","title":"From FOND to Robust Probabilistic Planning: Computing Compact Policies that Bypass Avoidable Deadends","year":2016,"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":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Probabilistic logic; Leverage (statistics); Exploit; Planner; Computer science; Class (philosophy); Mathematical optimization; Artificial intelligence; Mathematics; Computer security","score_opus":0.06966296944873947,"score_gpt":0.29929599307677135,"score_spread":0.2296330236280319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574020264","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9631098,0.000072560426,0.02280678,0.008585292,0.00048788477,0.00020318618,0.000034303444,0.0006445836,0.004055617],"genre_scores_gemma":[0.9798717,0.0000020123246,0.01948644,0.0003272793,0.00011337816,0.000005877075,0.0000041375292,0.000017528873,0.00017164148],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980055,0.000025819221,0.00040120268,0.00055150304,0.0006050371,0.00041095237],"domain_scores_gemma":[0.99838835,0.00051976414,0.00041064873,0.00017557702,0.0003452069,0.00016046468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005820956,0.00028759622,0.00031235797,0.00025039035,0.0003360081,0.00058842887,0.0015498924,0.00011570301,0.000012675164],"category_scores_gemma":[0.0004674568,0.00018991498,0.00006860689,0.00027071364,0.0000850943,0.0004345234,0.00040057235,0.0002873723,0.000010208875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046900232,0.00025929915,0.37399623,0.00025973268,0.00067447266,0.000028895387,0.027421353,0.17224321,0.19924839,0.20831908,0.010415276,0.00666507],"study_design_scores_gemma":[0.00066485,0.00015634802,0.02121367,0.005553722,0.000023229022,0.000033902907,0.0010087059,0.9397348,0.024280308,0.006665633,0.00018785223,0.00047695058],"about_ca_topic_score_codex":0.00013999331,"about_ca_topic_score_gemma":8.8841256e-7,"teacher_disagreement_score":0.76749164,"about_ca_system_score_codex":0.00009120654,"about_ca_system_score_gemma":0.00008486884,"threshold_uncertainty_score":0.7744508},"labels":[],"label_agreement":null},{"id":"W2574105631","doi":"","title":"Heuristic subset selection in classical planning","year":2016,"lang":"en","type":"article","venue":"ResearchSpace (University of Auckland)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Regina","funders":"","keywords":"Heuristics; Heuristic; Mathematical optimization; Computer science; Selection (genetic algorithm); Greedy algorithm; Incremental heuristic search; Tree (set theory); Greedy randomized adaptive search procedure; Artificial intelligence; Machine learning; Mathematics; Beam search; Search algorithm","score_opus":0.025197025925481235,"score_gpt":0.24966239418022929,"score_spread":0.22446536825474805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574105631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38447708,0.00012284539,0.60049635,0.011876054,0.00005674417,0.00013809178,0.000008847204,0.00014486631,0.0026791368],"genre_scores_gemma":[0.9903311,0.000028567925,0.0070097763,0.00001142452,0.000017272916,1.7096164e-7,0.0000015255471,0.0000043865166,0.0025957758],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9988145,0.00017464605,0.00007105647,0.0002745618,0.00032075576,0.00034445076],"domain_scores_gemma":[0.9991568,0.00042369898,0.00005489596,0.00017509467,0.000069806614,0.00011972798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057135883,0.000076751174,0.00014212243,0.00031562595,0.00014396361,0.000025301802,0.0005316122,0.000076814336,0.000042964337],"category_scores_gemma":[0.00010585928,0.000069472764,0.0000403682,0.00053965015,0.00008866572,0.00037950804,0.00019057126,0.00020069972,0.000052019655],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007382787,0.0003182371,0.7732221,0.00022615778,0.00009831198,0.0010727622,0.010097032,0.0018512658,0.022515139,0.031177826,0.09415078,0.06453212],"study_design_scores_gemma":[0.0076620053,0.0017576123,0.6716774,0.0021664219,0.00002303071,0.00009558998,0.0017608386,0.24203025,0.0020952886,0.01038915,0.059106763,0.0012356606],"about_ca_topic_score_codex":0.00031524803,"about_ca_topic_score_gemma":0.00023784953,"teacher_disagreement_score":0.60585403,"about_ca_system_score_codex":0.00009740105,"about_ca_system_score_gemma":0.00014217575,"threshold_uncertainty_score":0.2833017},"labels":[],"label_agreement":null},{"id":"W2575973620","doi":"10.1142/s0218213017600065","title":"Static and Dynamic Portfolio Methods for Optimal Planning: An Empirical Analysis","year":2017,"lang":"en","type":"article","venue":"International Journal of Artificial Intelligence Tools","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Computer science; Planner; Satisficing; Portfolio; Schedule; Range (aeronautics); Mathematical optimization; Operations research; Artificial intelligence","score_opus":0.15898489664651966,"score_gpt":0.501950625082249,"score_spread":0.3429657284357293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575973620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063156135,0.0000983069,0.9333087,0.0025206571,0.00072957244,0.00007609831,0.00001222281,0.000018858183,0.00007941448],"genre_scores_gemma":[0.52999604,0.000012147196,0.46965778,0.0001646233,0.0001261878,0.0000028568245,0.0000052951923,0.0000059482913,0.000029131439],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828863,0.000118902964,0.0007213041,0.00027609486,0.00036939082,0.0002256853],"domain_scores_gemma":[0.9972199,0.0007297472,0.0008638148,0.00035341785,0.0006578281,0.0001752968],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019603886,0.00014757509,0.00031409398,0.00044355477,0.00029149916,0.0015976143,0.0018573698,0.00007262535,0.000028597879],"category_scores_gemma":[0.0009811614,0.00013095781,0.00019578631,0.00013108498,0.00010933425,0.0015986116,0.00016506804,0.00022820188,0.0000029845603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020227392,0.00012341469,0.003901884,0.0000068237905,0.00077569927,0.00012924083,0.0025331622,0.0629588,0.0008422555,0.008198528,0.0001493054,0.9201786],"study_design_scores_gemma":[0.0000702537,0.00037409415,0.004041809,0.00005101786,0.00012596934,0.00009734807,0.00023681714,0.96240175,0.002870729,0.028576057,0.00096268865,0.00019146479],"about_ca_topic_score_codex":0.000019363737,"about_ca_topic_score_gemma":0.000006204681,"teacher_disagreement_score":0.91998714,"about_ca_system_score_codex":0.0000560325,"about_ca_system_score_gemma":0.0001486122,"threshold_uncertainty_score":0.9994388},"labels":[],"label_agreement":null},{"id":"W2577388749","doi":"","title":"Numeric Planning via Search Space Abstraction.","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Abstraction; Computer science; Space (punctuation); Theoretical computer science","score_opus":0.13603735342430087,"score_gpt":0.3368425459419655,"score_spread":0.20080519251766463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577388749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007259525,0.000017732944,0.95846933,0.016255047,0.0015059017,0.00012085677,0.00000929874,0.0002544912,0.016107844],"genre_scores_gemma":[0.98634535,0.000017759314,0.01223858,0.00034754002,0.00024651992,0.000018102182,0.0000046265227,0.000013971237,0.00076754007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976369,0.000092904025,0.0004999112,0.00063736015,0.0007062472,0.00042663523],"domain_scores_gemma":[0.9984164,0.00038117776,0.00018642258,0.00045194296,0.00039465807,0.00016935552],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00053636555,0.00023511672,0.00018555767,0.0003074881,0.00019763995,0.0003734551,0.0011484858,0.00009757032,0.0007488047],"category_scores_gemma":[0.00019201558,0.00018263327,0.000096421354,0.00026281137,0.00011348375,0.0006668384,0.00018500673,0.00031237453,0.0025848085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004538196,0.00009371347,0.00036266263,0.0000046600617,0.000031962085,0.00006807729,0.00056251185,0.0030999742,0.029024264,0.54483366,0.0003424622,0.4215307],"study_design_scores_gemma":[0.0001376466,0.00040450704,0.002527701,0.00094909617,0.00000862781,0.00012265629,0.0003584841,0.38369542,0.33964857,0.26607105,0.005060761,0.0010154666],"about_ca_topic_score_codex":0.00010943931,"about_ca_topic_score_gemma":0.000008243654,"teacher_disagreement_score":0.97908586,"about_ca_system_score_codex":0.00014762711,"about_ca_system_score_gemma":0.00015699741,"threshold_uncertainty_score":0.9981918},"labels":[],"label_agreement":null},{"id":"W2577869884","doi":"","title":"Belief State Estimation for Planning via Approximate Logical Filtering and Smoothing.","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Smoothing; Estimation; Computer science; State (computer science); Algorithm; Mathematical optimization; Artificial intelligence; Mathematics; Computer vision; Engineering","score_opus":0.1218737559416283,"score_gpt":0.32514029380844184,"score_spread":0.20326653786681353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577869884","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007870536,0.000016473827,0.98556256,0.0046298886,0.0005797553,0.00021256608,0.000022671229,0.00018020652,0.0009253525],"genre_scores_gemma":[0.9126938,0.00001282352,0.08676059,0.00026198686,0.00006770584,0.000048920872,0.000008409711,0.000010703411,0.00013506613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982829,0.000048151822,0.00047420888,0.0005491226,0.00032545073,0.00032014758],"domain_scores_gemma":[0.99877936,0.00043954185,0.00020450694,0.00023766638,0.00022667769,0.00011225064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005363385,0.00020471773,0.00018164414,0.0001794006,0.00018711339,0.00039034002,0.0005642006,0.00007069338,0.000056660676],"category_scores_gemma":[0.00031456334,0.00015571344,0.000057193425,0.000092001224,0.00009701763,0.0005236575,0.00017526245,0.00014195521,0.000067462846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007391293,0.000050161158,0.00007568171,0.000015736847,0.000021267379,0.000014747929,0.00089457055,0.0046036365,0.01991519,0.31582257,0.000054589156,0.65845793],"study_design_scores_gemma":[0.000057364858,0.00017665164,0.00014000127,0.0003314368,0.0000026053785,0.000015656744,0.000031155705,0.7078829,0.03959696,0.25135848,0.00018882033,0.00021797082],"about_ca_topic_score_codex":0.000021305044,"about_ca_topic_score_gemma":0.000004037235,"teacher_disagreement_score":0.90482324,"about_ca_system_score_codex":0.00006483378,"about_ca_system_score_gemma":0.000052658746,"threshold_uncertainty_score":0.634981},"labels":[],"label_agreement":null},{"id":"W2578999369","doi":"10.1609/icaps.v26i1.13752","title":"Efficient Representation of Pattern Databases Using Acyclic Random Hypergraphs","year":2016,"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":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Heuristic; Computer science; Representation (politics); Abstraction; Benchmark (surveying); Database; Domain (mathematical analysis); Theoretical computer science; Table (database); Algorithm; Data mining; Mathematics; Artificial intelligence","score_opus":0.06536379554403488,"score_gpt":0.3140520566603513,"score_spread":0.24868826111631642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578999369","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96295327,0.00005545451,0.034918133,0.0008775318,0.00024578246,0.00009660408,0.000016822045,0.00015522803,0.0006811705],"genre_scores_gemma":[0.9884077,0.000009048002,0.01147409,0.000050320577,0.000024579878,0.0000038068501,0.0000020201144,0.0000072114904,0.00002122515],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987362,0.000019438343,0.00035430962,0.0003056737,0.00042165344,0.00016269478],"domain_scores_gemma":[0.99880475,0.0002548937,0.0004520065,0.000126742,0.00031636312,0.00004523677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041562496,0.00013693498,0.00019817939,0.00018980686,0.00012215205,0.00008868357,0.0006701426,0.000044334804,0.0000066851812],"category_scores_gemma":[0.00033357425,0.00008599684,0.000060924172,0.00021861217,0.00007675692,0.00020311332,0.00022367526,0.00011067228,0.0000011256667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019212028,0.00010495355,0.1694002,0.00011778728,0.00017161552,0.0000037663515,0.0019973682,0.02188736,0.76465404,0.031421915,0.00013003325,0.009918833],"study_design_scores_gemma":[0.00067394663,0.00003388351,0.003392031,0.001984715,0.000013646898,0.000019365241,0.0001675659,0.909173,0.08389173,0.0005223148,0.00000636682,0.00012143846],"about_ca_topic_score_codex":0.000054770786,"about_ca_topic_score_gemma":2.7194693e-7,"teacher_disagreement_score":0.88728565,"about_ca_system_score_codex":0.00002161423,"about_ca_system_score_gemma":0.000046653226,"threshold_uncertainty_score":0.35068494},"labels":[],"label_agreement":null},{"id":"W2579521186","doi":"","title":"Non-Deterministic Planning with Temporally Extended Goals: Completing the Story for Finite and Infinite LTL (Amended Version).","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Theoretical computer science","score_opus":0.1005374627704798,"score_gpt":0.311975726419039,"score_spread":0.21143826364855917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579521186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017825603,0.000018982386,0.96693337,0.012014579,0.0005613764,0.00033965416,0.00004237338,0.00011442873,0.0021496112],"genre_scores_gemma":[0.98543394,0.000010561437,0.013225203,0.00082877575,0.00012939729,0.00006120164,0.000009992144,0.000014965011,0.00028594915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998108,0.00009445539,0.00043676404,0.00056892127,0.00044559434,0.00034622612],"domain_scores_gemma":[0.99699247,0.0018175951,0.00032230015,0.0003693031,0.00038579252,0.00011253974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083376816,0.00025042737,0.00021750067,0.0001831145,0.00042661157,0.00039314074,0.0008901944,0.000068093505,0.000060153532],"category_scores_gemma":[0.00047886837,0.00015427751,0.00006224478,0.0001297896,0.0002351898,0.00034124925,0.00019002764,0.0002470479,0.00009394298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000782667,0.00016986922,0.0012569407,0.000048402086,0.00016425113,0.000113320624,0.004382245,0.0036959685,0.011781037,0.5489087,0.0011662788,0.4275303],"study_design_scores_gemma":[0.00060995587,0.0019283417,0.0029980794,0.002854058,0.000037232367,0.00007997967,0.0013967245,0.8383015,0.020142945,0.11978313,0.010682442,0.0011856499],"about_ca_topic_score_codex":0.000016632577,"about_ca_topic_score_gemma":0.000011594573,"teacher_disagreement_score":0.96760833,"about_ca_system_score_codex":0.00006618978,"about_ca_system_score_gemma":0.00018799368,"threshold_uncertainty_score":0.6291254},"labels":[],"label_agreement":null},{"id":"W2583284593","doi":"10.4018/978-1-5225-0454-2.ch007","title":"Virtual Soar-Agent Implementations","year":2016,"lang":"en","type":"book-chapter","venue":"Advances in computational intelligence and robotics book series","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Soar; Computer science; Implementation; Cognitive architecture; Architecture; Human–computer interaction; Virtual machine; Cognition; Software engineering; Artificial intelligence; Programming language; Psychology","score_opus":0.027430847252322435,"score_gpt":0.29330856687988216,"score_spread":0.26587771962755974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2583284593","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.155438e-7,0.009847743,0.9426267,0.0016009046,0.0005141382,0.00019093351,0.000042474167,0.00008702704,0.04508937],"genre_scores_gemma":[0.009045986,0.04229347,0.57855415,0.002576176,0.00054674374,0.000066358254,0.00027505314,0.00012332412,0.36651874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981702,0.000027424536,0.0005799461,0.0005622516,0.00036174688,0.0002984085],"domain_scores_gemma":[0.9985842,0.0006445594,0.00025938466,0.00025462013,0.00015850364,0.000098710596],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001854354,0.0003434728,0.0003128607,0.00023579689,0.00026314592,0.00013839157,0.00048336724,0.00013640015,0.00009090714],"category_scores_gemma":[0.000020240981,0.0003069195,0.000070994996,0.0000639501,0.0002551937,0.0016815771,0.00026296903,0.00027773375,0.00008427967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006063978,0.000006290025,0.000029648536,0.000021035365,0.000015465914,0.000018250135,0.00024565528,0.29848757,4.019923e-7,0.6618848,0.000118750584,0.03916608],"study_design_scores_gemma":[0.00010055117,0.0002635789,0.000014853219,0.00056897744,0.000014250464,0.000051915504,0.000057028792,0.021802804,0.000029433475,0.8332134,0.14332916,0.00055404584],"about_ca_topic_score_codex":0.000002505777,"about_ca_topic_score_gemma":0.000030185496,"teacher_disagreement_score":0.36407256,"about_ca_system_score_codex":0.00008049048,"about_ca_system_score_gemma":0.00018492817,"threshold_uncertainty_score":0.9999383},"labels":[],"label_agreement":null},{"id":"W2583373444","doi":"","title":"Reasoning with Goal Models","year":2002,"lang":"en","type":"article","venue":"Unitn Eprints Research (Università Degli Studi di Trento)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Software engineering; Artificial intelligence; Goal orientation; Order (exchange); Management science; Machine learning; Theoretical computer science","score_opus":0.11059335841128368,"score_gpt":0.29525236611894906,"score_spread":0.18465900770766538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2583373444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19981173,0.00090983557,0.5183572,0.0031879435,0.00018105296,0.00063996314,0.000014050724,0.00072934845,0.27616888],"genre_scores_gemma":[0.974903,0.00013405658,0.013588879,0.000045951398,0.00004793661,0.000009244991,0.0000089217865,0.000023235585,0.01123876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962453,0.0004509913,0.00016633853,0.0008099904,0.0012613763,0.0010659766],"domain_scores_gemma":[0.9976543,0.00041090645,0.00007914757,0.0009874931,0.00047501386,0.00039314423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009991479,0.00024995435,0.0002610888,0.0007422775,0.0012632819,0.00029528333,0.0018653283,0.00010050377,0.00027347097],"category_scores_gemma":[0.00008052362,0.00023520266,0.000074950185,0.002086605,0.00023964622,0.001269363,0.0012046963,0.000873002,0.0004271109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025535078,0.0014860341,0.07342392,0.00017860415,0.00091152283,0.003958337,0.05246816,0.031775236,0.0003157638,0.51483417,0.022057906,0.298335],"study_design_scores_gemma":[0.0030342303,0.0007860362,0.014827811,0.0005951508,0.000039525105,0.000090547896,0.0051048947,0.9479681,0.00017202,0.0035883205,0.022741126,0.0010522078],"about_ca_topic_score_codex":0.00042605924,"about_ca_topic_score_gemma":0.00010005877,"teacher_disagreement_score":0.9161929,"about_ca_system_score_codex":0.00025724742,"about_ca_system_score_gemma":0.00010588963,"threshold_uncertainty_score":0.9716271},"labels":[],"label_agreement":null},{"id":"W2583680452","doi":"10.1609/aimag.v33i1.2390","title":"Reports of the AAAI 2011 Conference Workshops","year":2012,"lang":"en","type":"article","venue":"AI Magazine","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Alberta","funders":"","keywords":"Computer science; Context (archaeology); Artificial intelligence; Action (physics); Analytics; Knowledge representation and reasoning; Human–computer interaction; Data science","score_opus":0.019152693541036995,"score_gpt":0.23985040107173758,"score_spread":0.2206977075307006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2583680452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12398,0.004063119,0.73089683,0.026298689,0.0063470653,0.0006406355,0.000009124628,0.0005723273,0.10719222],"genre_scores_gemma":[0.9878686,0.0000044996164,0.007929279,0.00071340555,0.000073717,0.000003829886,0.0000015256486,0.000005194503,0.0033999162],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.99911565,0.000055988923,0.00021544159,0.00015828699,0.00019627622,0.00025833902],"domain_scores_gemma":[0.9989068,0.00007812575,0.0001613693,0.0007022818,0.000080891914,0.00007056896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048318738,0.00008993119,0.000116011965,0.000029726381,0.00007547195,0.000034992503,0.00045216602,0.000048743073,0.00015611778],"category_scores_gemma":[0.00005587175,0.00006130496,0.00004908237,0.00017821492,0.000045887005,0.00032606174,0.00022363535,0.00016316256,0.00016162031],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011756951,0.00022686759,0.42259786,0.00008535885,0.000056423694,0.000049595183,0.0044895266,0.00033278554,0.0057715317,0.06571267,0.43624187,0.06442377],"study_design_scores_gemma":[0.0005983593,0.00016986461,0.573254,0.0005405569,0.000061697894,0.0006387892,0.000031510383,0.020872172,0.017783275,0.015647203,0.36942193,0.0009806589],"about_ca_topic_score_codex":0.000019551884,"about_ca_topic_score_gemma":0.0000030471224,"teacher_disagreement_score":0.8638886,"about_ca_system_score_codex":0.000008917694,"about_ca_system_score_gemma":0.00006029434,"threshold_uncertainty_score":0.2499944},"labels":[],"label_agreement":null},{"id":"W2584093213","doi":"","title":"AutoCalibration of Integrated Lake Water Quality Models for the Lake Winnipeg Basin Initiative","year":2010,"lang":"en","type":"article","venue":"ScholarsArchive  (Brigham Young University)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Water quality; Hydrology (agriculture); Structural basin; Water resource management; Geology; Environmental science; Geography; Geomorphology; Ecology; Geotechnical engineering","score_opus":0.029199649981061747,"score_gpt":0.23803856494046485,"score_spread":0.2088389149594031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2584093213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050558135,0.0000101437,0.9403051,0.0009797865,0.00040962076,0.00043079487,0.0002859866,0.0001685723,0.006851825],"genre_scores_gemma":[0.95718044,0.0000050160143,0.04071741,0.00022829873,0.00005620388,0.0000039592205,0.00020659248,0.000015944172,0.0015861354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983657,0.00034734292,0.00025834783,0.00041718982,0.00026548855,0.00034596026],"domain_scores_gemma":[0.9982058,0.0006357802,0.0001725952,0.0005789365,0.0003097755,0.00009712479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009286621,0.00019328459,0.00022784664,0.00026053333,0.00057493005,0.00019884502,0.0011293073,0.000114223556,0.000038298094],"category_scores_gemma":[0.00012184125,0.0001368517,0.00014659487,0.00043194744,0.00020375656,0.0017639474,0.00024586395,0.00067648373,0.000008315106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056139345,0.00029074049,0.016965557,0.00012585724,0.00041502362,0.00006352286,0.017995788,0.010556722,0.036824424,0.9016696,0.0015748104,0.01295656],"study_design_scores_gemma":[0.003902135,0.00058006187,0.029143898,0.0002324408,0.00018948865,0.000037380698,0.0011281933,0.603103,0.047527276,0.112506144,0.20024227,0.0014077321],"about_ca_topic_score_codex":0.00013385605,"about_ca_topic_score_gemma":0.0016581595,"teacher_disagreement_score":0.9066223,"about_ca_system_score_codex":0.000023771223,"about_ca_system_score_gemma":0.00026854663,"threshold_uncertainty_score":0.558065},"labels":[],"label_agreement":null},{"id":"W2585975957","doi":"10.4018/978-1-5225-0454-2.ch009","title":"A Universal Architecture for Migrating Cognitive Agents","year":2016,"lang":"en","type":"book-chapter","venue":"Advances in computational intelligence and robotics book series","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Cognitive architecture; Architecture; Computer science; Human–computer interaction; Cognition; Set (abstract data type); Perception; Consistency (knowledge bases); State (computer science); Cognitive science; Artificial intelligence; Psychology; Programming language; Neuroscience","score_opus":0.025109147890438187,"score_gpt":0.2809907285732756,"score_spread":0.25588158068283745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585975957","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000013532248,0.008292486,0.968454,0.00091210625,0.00026021802,0.00030297937,0.00006626753,0.00006192216,0.021648692],"genre_scores_gemma":[0.00784143,0.009531753,0.8302654,0.0017523423,0.00043497802,0.00005326818,0.00023741607,0.000103959304,0.14977945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859655,0.000022071377,0.00036262686,0.00052875123,0.00022785585,0.00026211797],"domain_scores_gemma":[0.9979736,0.0013698586,0.00024616584,0.00013004325,0.00020683378,0.000073449795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013684148,0.00031588887,0.000303713,0.00019760839,0.000225827,0.0000943062,0.00034114628,0.00015503749,0.000013152906],"category_scores_gemma":[0.000050814306,0.0002774891,0.00007745815,0.00004868781,0.0002355408,0.0009363714,0.00015402467,0.00026300258,0.000010164047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029407725,0.0000055106448,0.000022753293,0.00007524196,0.000023657405,0.00001959139,0.00051967445,0.37773675,2.717879e-7,0.5680941,0.000046835474,0.05342625],"study_design_scores_gemma":[0.00017608471,0.00031301344,0.0000069246553,0.0020958541,0.000022589704,0.00004827844,0.00007571603,0.07833298,0.0000320897,0.860621,0.057719924,0.00055554695],"about_ca_topic_score_codex":0.0000016668721,"about_ca_topic_score_gemma":0.00002968829,"teacher_disagreement_score":0.2994038,"about_ca_system_score_codex":0.000046501424,"about_ca_system_score_gemma":0.00014361994,"threshold_uncertainty_score":0.99996775},"labels":[],"label_agreement":null},{"id":"W2594082185","doi":"","title":"Reengineering the Knowledge Component of a Data Warehouse-based Expert Diagnosis System","year":2008,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science; Expert system; Component (thermodynamics); Business process reengineering; Data warehouse; Knowledge base; Process (computing); Business intelligence; Legal expert system; Strengths and weaknesses; Subject-matter expert; Knowledge management; Software engineering; Data science; Artificial intelligence; Data mining; Operations management","score_opus":0.092741354956809,"score_gpt":0.26876988523261885,"score_spread":0.17602853027580984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594082185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006252118,0.0020145585,0.9885587,0.0007543409,0.00023167169,0.00016090501,0.000010452444,0.0005180739,0.0014991444],"genre_scores_gemma":[0.94715446,0.000019790468,0.05257825,0.000095301875,0.000051788324,0.000027113843,0.000008979522,0.000011169395,0.000053169097],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989167,0.00008534678,0.0002568825,0.0003120756,0.00021150007,0.00021751746],"domain_scores_gemma":[0.9976742,0.0006241386,0.0000722016,0.001510169,0.000054579417,0.00006467492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045214468,0.00012812806,0.00017842955,0.00007001415,0.00019879498,0.000033261138,0.0020311296,0.00003952407,0.000007746938],"category_scores_gemma":[0.000028547,0.00008542405,0.000043867727,0.00029471482,0.00004043118,0.00023482864,0.00043361195,0.000108708366,0.000024816103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097114134,0.0017872808,0.07989847,0.0023267372,0.00059981836,0.0006133086,0.04064685,0.27155018,0.0029057835,0.06583671,0.44335926,0.09037847],"study_design_scores_gemma":[0.00023531116,0.000044491677,0.000956928,0.0002506129,0.000004136224,0.000026145077,0.0000595554,0.98059833,0.0024410775,0.0000030525198,0.015220208,0.00016016646],"about_ca_topic_score_codex":0.00023480023,"about_ca_topic_score_gemma":0.000007281101,"teacher_disagreement_score":0.9409023,"about_ca_system_score_codex":0.000034088192,"about_ca_system_score_gemma":0.00009350424,"threshold_uncertainty_score":0.3774378},"labels":[],"label_agreement":null},{"id":"W2604367590","doi":"10.5539/mas.v11n5p42","title":"Improving Project Management Teaching Using Scaffolding Based on Cladistics Parsimony Analysis","year":2017,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Schema (genetic algorithms); Computer science; Sequence (biology); Cognition; Artificial intelligence; Mathematics education; Machine learning; Psychology","score_opus":0.03490687336449439,"score_gpt":0.298225741945471,"score_spread":0.26331886858097664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604367590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02045201,0.000009356853,0.9614456,0.00008438759,0.00017711743,0.00028232654,0.0000032191454,0.00020394997,0.017341992],"genre_scores_gemma":[0.72069925,3.8809884e-7,0.27900416,0.00018276497,0.00003276012,0.000013687924,0.000001563996,0.000010417795,0.000054997447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966775,0.000045579152,0.0002942863,0.0011873991,0.0010049823,0.00079026306],"domain_scores_gemma":[0.99716246,0.00010692434,0.00040455253,0.0021075432,0.00005733516,0.00016115987],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0026524498,0.00027057715,0.00028204138,0.00079675426,0.004573823,0.002417896,0.0035337938,0.00006236878,0.0000020578582],"category_scores_gemma":[0.00009243179,0.0002564162,0.000106430736,0.0008041859,0.00027741567,0.0006788197,0.0008213499,0.0003081469,0.00000887376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003851669,0.00018621262,0.007306896,0.00012918752,0.00013537031,0.000075479584,0.0021079164,0.6152745,0.053161256,0.05907863,0.00008848481,0.26241758],"study_design_scores_gemma":[0.00021392416,0.000024701269,0.0014501925,0.00005465298,0.000090234105,8.2973776e-7,0.00003278984,0.9954021,0.0012633911,0.0010724721,0.000057807836,0.00033689977],"about_ca_topic_score_codex":0.0001754763,"about_ca_topic_score_gemma":0.000007736179,"teacher_disagreement_score":0.7002472,"about_ca_system_score_codex":0.00024167761,"about_ca_system_score_gemma":0.00022535528,"threshold_uncertainty_score":0.9999888},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.07026156845158368,"score_gpt":0.30907883790142954,"score_spread":0.23881726944984585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604825101","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9262111,0.0000911676,0.044326317,0.004059232,0.00048148472,0.0006856394,0.000014965614,0.00018792065,0.02394213],"genre_scores_gemma":[0.993945,0.000016505628,0.0054909247,0.00019917966,0.00005731434,0.000019468049,4.864436e-7,0.000015465033,0.00025563216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981135,0.000013942747,0.00045334484,0.0005831107,0.00044056046,0.00039550124],"domain_scores_gemma":[0.9979834,0.00023386512,0.0008045743,0.00052497425,0.00032623336,0.0001269394],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00061682035,0.00029641387,0.00032983808,0.00012449932,0.00083818677,0.0012035967,0.002206123,0.000105398634,0.000015560814],"category_scores_gemma":[0.00046643076,0.00020768061,0.00006195664,0.00018308654,0.00048121827,0.0008408743,0.00045128842,0.000389178,0.000017855187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000957502,0.00043754786,0.0821475,0.00060342636,0.00017822775,0.000060462684,0.022854233,0.0013200813,0.029017393,0.62918186,0.0006180932,0.23262368],"study_design_scores_gemma":[0.00031816828,0.0021342784,0.043870095,0.0049322275,0.00008816364,0.000055155204,0.001253443,0.62357396,0.1450791,0.17674038,0.00046178998,0.0014932217],"about_ca_topic_score_codex":0.00007146729,"about_ca_topic_score_gemma":0.000008974448,"teacher_disagreement_score":0.6222539,"about_ca_system_score_codex":0.000016379152,"about_ca_system_score_gemma":0.00013402982,"threshold_uncertainty_score":0.9998332},"labels":[],"label_agreement":null},{"id":"W2614835516","doi":"","title":"NEUROBOT : expériences croisées neurobiologie et robotique pour la compréhension des mécanismes cognitifs","year":2012,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"NeuroDevNet","funders":"","keywords":"Psychology","score_opus":0.042654605690079166,"score_gpt":0.2615941298187693,"score_spread":0.2189395241286901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2614835516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12160376,0.00562721,0.80430347,0.033013772,0.0013868364,0.0007043158,0.000099574536,0.00083741505,0.032423627],"genre_scores_gemma":[0.7397708,0.0015964194,0.24819279,0.0007980745,0.00007604494,0.000081429105,0.00032366076,0.000084928084,0.009075828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9701082,0.02493366,0.0011185362,0.0018596853,0.0006705913,0.00130931],"domain_scores_gemma":[0.9806713,0.0116535025,0.0011706754,0.0028023322,0.0030874896,0.00061471795],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.012319528,0.0009805311,0.0008808944,0.00029484904,0.0014027326,0.0019912035,0.003782909,0.00072023505,0.00017921306],"category_scores_gemma":[0.0034418716,0.0010137096,0.0004395291,0.00078690646,0.0013078887,0.0010079728,0.004051085,0.0020497078,0.00025701194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006195146,0.0027745052,0.045308087,0.0011625171,0.0002698993,0.00019496409,0.09579209,0.01422811,0.016935661,0.6719344,0.006079393,0.14525837],"study_design_scores_gemma":[0.0035202152,0.000020711428,0.26285785,0.03617678,0.00058734854,0.0012883996,0.0017194585,0.36557704,0.1320838,0.08433534,0.1045134,0.0073196716],"about_ca_topic_score_codex":0.0043620886,"about_ca_topic_score_gemma":0.0014666711,"teacher_disagreement_score":0.6181671,"about_ca_system_score_codex":0.00014862815,"about_ca_system_score_gemma":0.0010797698,"threshold_uncertainty_score":0.9998973},"labels":[],"label_agreement":null},{"id":"W263108327","doi":"10.1007/3-540-28550-4_5","title":"Transportation Networks, Case-Based Reasoning and Traffic Collision Analysis: A Methodology for the 21st Century","year":2005,"lang":"en","type":"book-chapter","venue":"Advances in spatial science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Collision; Computer science; Computer security","score_opus":0.023821889466687646,"score_gpt":0.29482218892359785,"score_spread":0.2710002994569102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W263108327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020231998,0.017465508,0.9796072,0.00023009679,0.00048877555,0.00046708056,0.000024910178,0.00006555683,0.0014485383],"genre_scores_gemma":[0.5740076,0.0057200217,0.41864637,0.00043546568,0.0003363895,0.00009667878,0.00006143654,0.00003197097,0.00066407985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978306,0.000072844065,0.00042626366,0.00085796363,0.00038230373,0.000429993],"domain_scores_gemma":[0.9969572,0.001997822,0.00038485636,0.0004361634,0.0001237183,0.00010025815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002313187,0.0002671739,0.0003943684,0.00038559287,0.0006219447,0.00016032282,0.00081540295,0.00016334892,0.0000071281174],"category_scores_gemma":[0.00010920533,0.00020756168,0.00011603011,0.000673136,0.000454897,0.00059847406,0.00004120634,0.0003252273,6.019658e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002177075,0.000005048566,0.00008877065,0.000014238579,0.00001147588,0.000037195834,0.0003756191,0.63008004,0.0000018597308,0.027613316,0.0000033014746,0.34174737],"study_design_scores_gemma":[0.00030035665,0.00013280191,0.000199623,0.00018380219,0.00017253951,0.000027728911,0.000059454615,0.97209674,0.000013704876,0.0008462623,0.02562554,0.0003414521],"about_ca_topic_score_codex":0.00018533744,"about_ca_topic_score_gemma":0.0060174554,"teacher_disagreement_score":0.5738053,"about_ca_system_score_codex":0.000093980925,"about_ca_system_score_gemma":0.00021990547,"threshold_uncertainty_score":0.84641194},"labels":[],"label_agreement":null},{"id":"W2663077448","doi":"10.20965/jaciii.2009.p0511","title":"Special Issue on Soft Computing for Modeling and Simulation","year":2009,"lang":"en","type":"article","venue":"Journal of Advanced Computational Intelligence and Intelligent Informatics","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Soft computing; Excellence; Informatics; Soft skills; Event (particle physics); Government (linguistics); Modeling and simulation; Software; Software engineering; Engineering management; Data science; Artificial intelligence; Simulation; Management; Fuzzy logic; Engineering","score_opus":0.03538936970135051,"score_gpt":0.31915314569592357,"score_spread":0.28376377599457303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2663077448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009928244,0.00016338182,0.98854816,0.00040535242,0.0004101467,0.00016049968,0.0000022559566,0.000023794584,0.00035817557],"genre_scores_gemma":[0.56953394,0.000100133526,0.42828473,0.001066234,0.0009860896,5.982413e-7,0.0000051952998,0.0000057116395,0.000017336784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983339,0.000021818347,0.000977288,0.000120267025,0.00033672538,0.00021002752],"domain_scores_gemma":[0.99792266,0.00081372506,0.00053127186,0.0000983476,0.000512834,0.00012117976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053916237,0.00017387792,0.00025398112,0.00024997914,0.00022216293,0.00021264539,0.00028229505,0.00006193191,0.0000038732082],"category_scores_gemma":[0.00018639545,0.00015428291,0.00007381333,0.00017133888,0.0000290906,0.00096667546,0.000042650136,0.00023516994,0.0000047365943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038652135,0.000020191452,0.000009515706,0.000019746583,0.000009369275,9.505593e-7,0.002075821,0.62907195,0.0000011779651,0.00770502,0.00008997625,0.36095762],"study_design_scores_gemma":[0.0001417502,0.00093566073,0.000020642401,0.00022468093,0.000008501369,0.00004500595,0.0005459205,0.93789744,0.00015805343,0.05683127,0.0030310256,0.00016005493],"about_ca_topic_score_codex":3.9084057e-7,"about_ca_topic_score_gemma":9.603982e-8,"teacher_disagreement_score":0.5602634,"about_ca_system_score_codex":0.000043238495,"about_ca_system_score_gemma":0.00006522785,"threshold_uncertainty_score":0.62914747},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03166301535650045,"score_gpt":0.28407529041399643,"score_spread":0.25241227505749597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W269605412","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9790848,0.00029393373,0.013727559,0.00088472967,0.0006850679,0.00015967866,0.000016506197,0.0005333481,0.0046144053],"genre_scores_gemma":[0.9817498,0.000010617755,0.017676564,0.0002620879,0.000073132476,0.000016140808,0.000005301787,0.000018304192,0.00018807822],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983092,0.0000149325015,0.0004253042,0.00037155446,0.00042315098,0.00045586514],"domain_scores_gemma":[0.99872494,0.00024575592,0.00051539927,0.00012940473,0.00024899066,0.00013548485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007478953,0.00025080738,0.00023961147,0.00013756704,0.0003096579,0.00038007146,0.0010549127,0.00009021149,0.0000042482375],"category_scores_gemma":[0.00039419145,0.00020481055,0.000056021167,0.00019860128,0.000065910324,0.00076819235,0.00030840674,0.00042716265,0.000004183517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028411066,0.00026897577,0.1322929,0.0004969759,0.00036630133,0.000011956129,0.025117451,0.0077587827,0.7862602,0.030179488,0.0050635776,0.011899307],"study_design_scores_gemma":[0.0003344654,0.00008236597,0.0017485793,0.0015398471,0.0000113531805,0.00003601685,0.0005362814,0.95891166,0.0356483,0.000704371,0.00015033282,0.00029642825],"about_ca_topic_score_codex":0.000014147822,"about_ca_topic_score_gemma":5.7859378e-8,"teacher_disagreement_score":0.95115286,"about_ca_system_score_codex":0.000045403947,"about_ca_system_score_gemma":0.000055348428,"threshold_uncertainty_score":0.8351932},"labels":[],"label_agreement":null},{"id":"W2740257287","doi":"10.24963/ijcai.2017/606","title":"Numeric Planning via Abstraction and Policy Guided Search","year":2017,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Planner; Computer science; Abstraction; Plan (archaeology); Representation (politics); Automated planning and scheduling; Domain (mathematical analysis); Set (abstract data type); Rotation formalisms in three dimensions; Theoretical computer science; Algorithm; Artificial intelligence; Programming language; Mathematics","score_opus":0.054361946319941186,"score_gpt":0.3495995063305367,"score_spread":0.29523756001059553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740257287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08297305,0.00009403873,0.82579064,0.005543956,0.00024178553,0.00009199358,7.3497694e-7,0.00025827234,0.08500553],"genre_scores_gemma":[0.96349037,0.0000034293157,0.034165937,0.00024083354,0.00011995746,0.0000019758238,0.00000100487,0.000004861264,0.0019716327],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9992696,0.000023018965,0.00010975136,0.00022885053,0.0001412175,0.00022753834],"domain_scores_gemma":[0.99926484,0.000068609625,0.00007274299,0.000469344,0.000033391414,0.000091076094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003239431,0.00008042109,0.00008202956,0.00012441572,0.00069102296,0.0005483582,0.00047805833,0.000036162663,0.000015205072],"category_scores_gemma":[0.000045495708,0.000071880306,0.000017898288,0.000082732506,0.000035009078,0.0006208048,0.00018934863,0.00013109807,0.000051834675],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020719071,0.0000633287,0.2560667,0.00009859882,0.000065401386,0.00016023849,0.004395553,0.0056321737,0.008079784,0.059331205,0.018983895,0.64710236],"study_design_scores_gemma":[0.000643915,0.00010679374,0.4876279,0.000119098775,0.000006525025,0.00019705569,0.00005422744,0.4845395,0.0059156953,0.008262944,0.012002641,0.00052370125],"about_ca_topic_score_codex":0.0016315307,"about_ca_topic_score_gemma":0.000007903669,"teacher_disagreement_score":0.8805173,"about_ca_system_score_codex":0.000020060279,"about_ca_system_score_gemma":0.000060198534,"threshold_uncertainty_score":0.531486},"labels":[],"label_agreement":null},{"id":"W2740418058","doi":"10.24963/ijcai.2017/326","title":"Cause-Effect Knowledge Acquisition and Neural Association Model for Solving A Set of Winograd Schema Problems","year":2017,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Schema (genetic algorithms); Commonsense knowledge; Association (psychology); Artificial neural network; Knowledge acquisition; Artificial intelligence; Commonsense reasoning; Set (abstract data type); Scratch; Machine learning; ENCODE; Knowledge extraction","score_opus":0.04501237166592456,"score_gpt":0.3065625690844021,"score_spread":0.2615501974184775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740418058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19987457,0.00020462023,0.7975518,0.0008350052,0.00016053054,0.0004223087,0.000011948215,0.00013382974,0.00080536946],"genre_scores_gemma":[0.98067147,0.000004006527,0.018725587,0.000036769517,0.000049967508,0.00003350623,0.000007650632,0.000008008607,0.00046301127],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999136,0.00003633847,0.00018353808,0.00026558703,0.0001325457,0.0002460172],"domain_scores_gemma":[0.9988694,0.00028981137,0.00029158336,0.00036364916,0.00012886993,0.000056690595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091543613,0.00011983697,0.00018594999,0.00006150134,0.00046465566,0.0002825408,0.00036535188,0.00009352009,0.000001396478],"category_scores_gemma":[0.00012745053,0.000105711544,0.000058517468,0.0000490036,0.000022745284,0.00071958354,0.00016523057,0.00008590575,0.0000017465783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001686402,0.00028037178,0.6232947,0.0028745371,0.0005430322,0.0000088908455,0.029963206,0.044166375,0.041853268,0.044561774,0.031639975,0.18064523],"study_design_scores_gemma":[0.000522133,0.00014975245,0.0024368796,0.000096038886,0.000017946695,0.000002322414,0.000005398429,0.99308836,0.002339294,0.0011806572,0.000033799428,0.000127396],"about_ca_topic_score_codex":0.000036359063,"about_ca_topic_score_gemma":0.000025904548,"teacher_disagreement_score":0.94892204,"about_ca_system_score_codex":0.000033066917,"about_ca_system_score_gemma":0.00004106485,"threshold_uncertainty_score":0.43107918},"labels":[],"label_agreement":null},{"id":"W2740426680","doi":"10.24963/ijcai.2017/68","title":"An Admissible HTN Planning Heuristic","year":2017,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Deutsche Forschungsgemeinschaft","keywords":"Heuristics; Heuristic; Computer science; Task (project management); Rotation formalisms in three dimensions; Automated planning and scheduling; Decomposition; Hierarchy; Plan (archaeology); Artificial intelligence; Graph; Machine learning; Theoretical computer science; Mathematics; Engineering","score_opus":0.042616038065756374,"score_gpt":0.3357846367420884,"score_spread":0.29316859867633205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740426680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026197987,0.0001252815,0.9060946,0.0010280443,0.00042822352,0.00006204097,0.0000012976606,0.00048338898,0.06557913],"genre_scores_gemma":[0.91420406,0.000001048345,0.08358458,0.00031121433,0.000088567635,0.0000028375348,0.0000021867359,0.0000066150687,0.0017989165],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991136,0.000031447944,0.00011918785,0.00030802833,0.00015434025,0.0002733871],"domain_scores_gemma":[0.99841595,0.000065730266,0.00009697276,0.0012012748,0.00003356929,0.00018653058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032068632,0.00010314939,0.00010460162,0.000048493424,0.0008616119,0.0009110109,0.0016122119,0.000048721715,0.000057571917],"category_scores_gemma":[0.00009169821,0.00008968754,0.000027468108,0.0000413872,0.000027222151,0.0008392974,0.0001597023,0.00012807972,0.00011446036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005049464,0.00033290585,0.42960194,0.00015334596,0.000089912246,0.0011704819,0.009337719,0.0136986505,0.003715603,0.2304774,0.08316951,0.22820206],"study_design_scores_gemma":[0.0006331612,0.00039606667,0.06673342,0.00021086156,0.000010967291,0.00006371875,0.00007621011,0.8898834,0.0036178415,0.015733697,0.021885714,0.00075492566],"about_ca_topic_score_codex":0.00011791941,"about_ca_topic_score_gemma":0.0000035320202,"teacher_disagreement_score":0.88800603,"about_ca_system_score_codex":0.000010090744,"about_ca_system_score_gemma":0.00007285964,"threshold_uncertainty_score":0.8784899},"labels":[],"label_agreement":null},{"id":"W2740793701","doi":"10.24963/ijcai.2017/72","title":"Online Bridged Pruning for Real-Time Search with Arbitrary Lookaheads","year":2017,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Pruning; Computer science; Iterative deepening depth-first search; Beam search; Artificial intelligence; Search problem; State (computer science); Search algorithm; Incremental heuristic search; Machine learning; State space; Time complexity; Algorithm; Mathematics","score_opus":0.03405513096010456,"score_gpt":0.29219458665067954,"score_spread":0.258139455690575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740793701","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2250703,0.00003488957,0.7415862,0.004057781,0.00010802877,0.00037918644,0.000018068798,0.00048310493,0.028262407],"genre_scores_gemma":[0.41038045,0.000005730586,0.5800857,0.0003274349,0.00014996123,0.000013132434,0.000030175617,0.00002106956,0.008986347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883527,0.000033979697,0.0001438526,0.00037792645,0.00021728555,0.00039170383],"domain_scores_gemma":[0.99857694,0.0001996844,0.00008958806,0.0009089097,0.000101821206,0.00012308228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005193493,0.00013521186,0.00016831624,0.0000621218,0.00075300166,0.00046085473,0.0011264719,0.000055701003,0.00001854834],"category_scores_gemma":[0.000040367886,0.0001049584,0.0000430665,0.00006589033,0.00006165105,0.0005474779,0.00018715314,0.00016619664,0.000036365393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011674605,0.002016328,0.15610136,0.001204134,0.00082897284,0.00091704476,0.014699985,0.011338869,0.069736265,0.24450691,0.09221009,0.40527257],"study_design_scores_gemma":[0.0019677782,0.0010059293,0.03657875,0.00039145068,0.000021202188,0.000067385896,0.000044011922,0.94060665,0.012439134,0.0017686287,0.004363314,0.00074574753],"about_ca_topic_score_codex":0.00037257894,"about_ca_topic_score_gemma":0.000026890293,"teacher_disagreement_score":0.9292678,"about_ca_system_score_codex":0.00001937091,"about_ca_system_score_gemma":0.00016876543,"threshold_uncertainty_score":0.5791556},"labels":[],"label_agreement":null},{"id":"W2741263854","doi":"10.24963/ijcai.2017/599","title":"Additive Merge-and-Shrink Heuristics for Diverse Action Costs","year":2017,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Merge (version control); Computer science; Heuristic; Mathematical optimization; Artificial intelligence; Mathematics; Information retrieval","score_opus":0.05873737975381119,"score_gpt":0.31898547099292635,"score_spread":0.26024809123911513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741263854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040393462,0.000027579,0.98428357,0.0010790249,0.00061271695,0.00014013486,0.000027040465,0.00012415521,0.009666432],"genre_scores_gemma":[0.91473573,0.000030890224,0.082315594,0.00022760981,0.00012208792,0.000015353375,0.000010843355,0.000005980563,0.0025359183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946105,0.00001477878,0.00007536834,0.00020771963,0.000085782616,0.00015530451],"domain_scores_gemma":[0.9992714,0.0001705237,0.000090442256,0.00033149502,0.0000691173,0.00006700348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016936612,0.00007443876,0.00007888842,0.000027301172,0.00068720605,0.00024198463,0.00035722865,0.000042356667,0.000014550726],"category_scores_gemma":[0.0001545792,0.00006625831,0.000027819804,0.000019448444,0.000034496745,0.00037899194,0.0001653256,0.00006684246,0.000023699575],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039717135,0.000040907456,0.0064562336,0.000037343445,0.000053174048,0.000020156474,0.00079303514,0.000069172216,0.00022712414,0.13174355,0.0949214,0.7655982],"study_design_scores_gemma":[0.0020616397,0.00048953824,0.031737223,0.00017213763,0.000058392394,0.000029612054,0.00030365004,0.7317372,0.0071297246,0.012879336,0.2124901,0.00091146154],"about_ca_topic_score_codex":0.00015268599,"about_ca_topic_score_gemma":0.00005053178,"teacher_disagreement_score":0.9106964,"about_ca_system_score_codex":0.000020179974,"about_ca_system_score_gemma":0.000023876251,"threshold_uncertainty_score":0.52855027},"labels":[],"label_agreement":null},{"id":"W2756655043","doi":"10.1609/icaps.v27i1.13807","title":"Boosting Search Guidance in Problems with Semantic Attachments","year":2017,"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":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council","keywords":"Planner; Exploit; Computer science; Heuristic; Estimator; Boosting (machine learning); Leverage (statistics); Theoretical computer science; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.05653941684740136,"score_gpt":0.3161860120499285,"score_spread":0.25964659520252714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756655043","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98566186,0.00006602506,0.0014866265,0.0026414227,0.00015320758,0.00015032919,0.0000025962167,0.00018482967,0.009653125],"genre_scores_gemma":[0.9855476,0.000004911574,0.014206206,0.000071499286,0.000022383716,0.000009482545,0.0000010900396,0.000008720436,0.00012808922],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986332,0.0000110956025,0.00027028404,0.00036275067,0.00046466402,0.00025801235],"domain_scores_gemma":[0.99904895,0.0000720962,0.0003835524,0.00017674254,0.00026643727,0.00005224036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075757515,0.0001594286,0.0001764603,0.00014062322,0.0004269501,0.0007636572,0.001607985,0.000062434665,0.0000023158584],"category_scores_gemma":[0.00021528426,0.000115654955,0.000025318324,0.00009555176,0.0000877271,0.00055622443,0.00037918685,0.00034123685,0.00000219808],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007088168,0.000056558794,0.9231908,0.00018295423,0.00006605669,0.000013680248,0.0032665564,0.016057987,0.016158432,0.039117068,0.00006881031,0.0017502287],"study_design_scores_gemma":[0.00044310436,0.00007434533,0.06947757,0.004327176,0.000004357067,0.000026234635,0.00016366229,0.918682,0.00566406,0.0009643402,0.000010818056,0.00016236026],"about_ca_topic_score_codex":0.000105080915,"about_ca_topic_score_gemma":0.0000025831628,"teacher_disagreement_score":0.902624,"about_ca_system_score_codex":0.00003522714,"about_ca_system_score_gemma":0.00007279466,"threshold_uncertainty_score":0.73639643},"labels":[],"label_agreement":null},{"id":"W2759637265","doi":"10.1609/icaps.v27i1.13804","title":"The Two-Edged Nature of Diverse Action Costs","year":2017,"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":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Action (physics); Diversity (politics); Unit (ring theory); Computer science; Risk analysis (engineering); Feature (linguistics); Cost–benefit analysis; Distribution (mathematics); Search cost; Domain (mathematical analysis); Operations research; Total cost; Microeconomics; Economics; Business; Mathematics; Political science; Law","score_opus":0.04822625836150071,"score_gpt":0.3319589236488111,"score_spread":0.28373266528731034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759637265","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98439246,0.00010079507,0.00051243993,0.0034317959,0.00087942893,0.00010096881,0.000006597976,0.00015861067,0.0104169],"genre_scores_gemma":[0.996363,0.000020356352,0.0033691586,0.00006371073,0.00004562152,0.000003727992,0.0000012374977,0.0000051948864,0.00012799274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900246,0.000011467742,0.00022201253,0.00022200258,0.00038865602,0.0001533787],"domain_scores_gemma":[0.9985477,0.00015535725,0.00063792994,0.00018440656,0.00043462007,0.00004004194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062061555,0.00012220645,0.00013117708,0.00006838478,0.0008347446,0.00056987844,0.0017500427,0.00009301704,0.0000021546584],"category_scores_gemma":[0.0005609336,0.00007837518,0.000049888607,0.00006477831,0.00012657978,0.0004024681,0.00036579184,0.0004213334,0.0000014921312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034806228,0.000087203895,0.13673942,0.00013924848,0.0003394268,0.0000061302185,0.0034189522,0.0028579168,0.13706656,0.68828833,0.0017944876,0.02891428],"study_design_scores_gemma":[0.0004924322,0.000063088424,0.023178987,0.0012894704,0.00001472284,0.000018258168,0.00066105905,0.92733675,0.04306336,0.0035728328,0.0001501993,0.0001588237],"about_ca_topic_score_codex":0.000047890597,"about_ca_topic_score_gemma":0.000002064529,"teacher_disagreement_score":0.9244788,"about_ca_system_score_codex":0.000029549408,"about_ca_system_score_gemma":0.000055497105,"threshold_uncertainty_score":0.6420265},"labels":[],"label_agreement":null},{"id":"W2765665524","doi":"10.1016/j.ifacol.2017.08.2376","title":"Mixed-initiative system for tactical planning allowing real-time constraint insertions","year":2017,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Planner; Computer science; Dashboard; Constraint (computer-aided design); Decision maker; Operations research; Time constraint; Value (mathematics); Industrial engineering; Mathematical optimization; Artificial intelligence; Machine learning; Engineering; Software engineering; Mathematics","score_opus":0.06366781278131997,"score_gpt":0.30302503291715116,"score_spread":0.2393572201358312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765665524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12334668,0.00016426582,0.83893454,0.010214246,0.0017297403,0.0008739119,0.00027670883,0.0013661699,0.023093756],"genre_scores_gemma":[0.5098761,0.0000025480508,0.48941183,0.00018466658,0.00023806268,0.000036139947,0.00004378592,0.000019548397,0.00018734927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981514,0.00009774547,0.00036435077,0.00055732846,0.0002728316,0.00055630034],"domain_scores_gemma":[0.99776506,0.0008023474,0.0002929876,0.00077399303,0.00014792122,0.0002176698],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00067807426,0.00026382582,0.00036271283,0.000095736854,0.001503956,0.000526425,0.0009786937,0.00015521592,0.000012011888],"category_scores_gemma":[0.00045570638,0.00024837634,0.0001650489,0.00008367885,0.00012206352,0.0006960418,0.00019584737,0.00027324635,0.000077766264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011232015,0.001739279,0.04207598,0.0028799435,0.0032650137,0.0044273823,0.06452863,0.019487627,0.19534716,0.4253805,0.00395792,0.23578736],"study_design_scores_gemma":[0.0028789325,0.00062294,0.00961504,0.001992654,0.00014492223,0.0002516542,0.0016969566,0.97410303,0.004529994,0.0006961382,0.0021494606,0.0013182857],"about_ca_topic_score_codex":0.00007491978,"about_ca_topic_score_gemma":0.00000797082,"teacher_disagreement_score":0.9546154,"about_ca_system_score_codex":0.00011893521,"about_ca_system_score_gemma":0.00021596334,"threshold_uncertainty_score":0.99999684},"labels":[],"label_agreement":null},{"id":"W2767234684","doi":"","title":"Modeling Embodied Cognition in a Complex Real-Time Task","year":2000,"lang":"en","type":"article","venue":"eScholarship (California Digital Library)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Air Force Office of Scientific Research","keywords":"Cognition; Embodied cognition; Perception; Computer science; Task (project management); Cognitive model; Cognitive psychology; Artificial intelligence; Cognitive science; Psychology; Human–computer interaction; Engineering","score_opus":0.02034967667233906,"score_gpt":0.21871071019453978,"score_spread":0.19836103352220072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767234684","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5960069,0.00019433156,0.020689514,0.0015915654,0.000082356186,0.0005823669,0.0012607676,0.0023580936,0.37723416],"genre_scores_gemma":[0.98211366,0.000022884822,0.015005998,0.00079628406,0.000073947864,0.00001949534,0.0010825268,0.000046915175,0.0008382668],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977522,0.00013238986,0.000521418,0.00062712893,0.00035732752,0.0006095248],"domain_scores_gemma":[0.9990194,0.00014673523,0.000069010675,0.0004824406,0.000026323229,0.00025610154],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002699285,0.0003013695,0.00030065406,0.0002309921,0.00018254756,0.00180083,0.00089440105,0.00014860128,0.0006704792],"category_scores_gemma":[0.000050970026,0.00030628932,0.00011421153,0.0006459234,0.000039751503,0.005496029,0.00018577026,0.00043716835,0.005337942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016256921,0.0029544174,0.10831875,0.0006240817,0.0003424863,0.0021150326,0.0023329824,0.10492455,0.0057938336,0.04214703,0.033197943,0.6956232],"study_design_scores_gemma":[0.0011209837,0.00012341901,0.0008760271,0.00029831697,0.000010047885,0.00003732567,0.000010872357,0.91438305,0.00017229654,0.05778983,0.024331365,0.0008464453],"about_ca_topic_score_codex":0.00001702067,"about_ca_topic_score_gemma":0.0000011660545,"teacher_disagreement_score":0.8094585,"about_ca_system_score_codex":0.000032386837,"about_ca_system_score_gemma":0.00010243037,"threshold_uncertainty_score":0.9999389},"labels":[],"label_agreement":null},{"id":"W2767608158","doi":"","title":"Generating Explanatory Hypotheses: Mind, Computer, Brain, and World","year":2005,"lang":"en","type":"article","venue":"eScholarship (California Digital Library)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Philosophy of science; Psychology; Cognition; Epistemology; Set (abstract data type); Causality (physics); Mental representation; Cognitive science; Inference; Cognitive psychology; Explanatory power; Computer science; Philosophy","score_opus":0.016657971282565503,"score_gpt":0.21029264711328166,"score_spread":0.19363467583071617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767608158","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70974946,0.0044547324,0.23462033,0.017352704,0.0006858179,0.0007243684,0.0009962682,0.002527386,0.028888913],"genre_scores_gemma":[0.7901862,0.000008753156,0.19751458,0.009143164,0.00070618896,0.000015388528,0.00014472085,0.000066477936,0.0022145163],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978583,0.000114077004,0.00044461602,0.0006838137,0.0003377179,0.000561492],"domain_scores_gemma":[0.9983387,0.00058859686,0.00015002061,0.000507971,0.000027247812,0.0003874692],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00031134652,0.00033589266,0.0002691505,0.00028150852,0.0003121646,0.0033164301,0.0008883211,0.00010697277,0.000094775845],"category_scores_gemma":[0.00009797923,0.000320268,0.000094615614,0.0004997535,0.0000726959,0.0063147903,0.00053612445,0.0004722998,0.000848276],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000410633,0.00023760903,0.11769231,0.0000969735,0.000087834116,0.00018288434,0.00047016554,0.0016516148,0.0003479469,0.010311063,0.07054033,0.7983402],"study_design_scores_gemma":[0.00080160535,0.00012084776,0.0016505049,0.00023335259,0.00000796011,0.00008401203,0.000015563008,0.103308655,0.0017276157,0.0032952076,0.8878371,0.00091755536],"about_ca_topic_score_codex":0.0000015791809,"about_ca_topic_score_gemma":0.0000025831953,"teacher_disagreement_score":0.8172968,"about_ca_system_score_codex":0.000027390279,"about_ca_system_score_gemma":0.0001005659,"threshold_uncertainty_score":0.99992967},"labels":[],"label_agreement":null},{"id":"W2780421361","doi":"","title":"Apprentissage de la Complexité du Corps-Cerveau en Robotique Bio-Inspirée","year":2017,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"NeuroDevNet","funders":"","keywords":"Humanities; Philosophy","score_opus":0.02321027399806612,"score_gpt":0.25082515662248384,"score_spread":0.2276148826244177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2780421361","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02094416,0.0028871568,0.8310581,0.031920917,0.0010082407,0.0006306744,0.00013217615,0.000570103,0.110848516],"genre_scores_gemma":[0.6906582,0.0012579664,0.28008518,0.00021649378,0.00015582719,0.00010552853,0.0005678404,0.00010571021,0.026847275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9727984,0.02237437,0.0010537232,0.0018407055,0.0007836548,0.0011491311],"domain_scores_gemma":[0.9833154,0.007055801,0.0016063208,0.0053085107,0.0020672996,0.0006466825],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.020629795,0.0008951974,0.00091655354,0.0003019997,0.0021108778,0.003712228,0.007123358,0.0010439518,0.00033148951],"category_scores_gemma":[0.0036411746,0.0010436395,0.0005563305,0.00045135443,0.0011856256,0.0006652682,0.0049199397,0.0022604722,0.00031156922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024012086,0.001170722,0.032804396,0.00062445406,0.00027034112,0.00021575304,0.033487402,0.0038854287,0.0020244499,0.815616,0.008628972,0.10124805],"study_design_scores_gemma":[0.0019705053,0.000004484349,0.05773595,0.013346985,0.00022622215,0.00057594065,0.00018554275,0.6506358,0.02011963,0.04591254,0.20672105,0.0025653625],"about_ca_topic_score_codex":0.0077367397,"about_ca_topic_score_gemma":0.0013352961,"teacher_disagreement_score":0.7697035,"about_ca_system_score_codex":0.00040108032,"about_ca_system_score_gemma":0.0013008948,"threshold_uncertainty_score":0.9992014},"labels":[],"label_agreement":null},{"id":"W2783954694","doi":"10.4018/978-1-4666-5202-6.ch152","title":"Optimal Collaborative Design in Supply Chains","year":2014,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Supply chain; Business; Computer science; Marketing","score_opus":0.018821933951388106,"score_gpt":0.23814226261382582,"score_spread":0.21932032866243772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783954694","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016867669,0.0003307198,0.36889556,0.00014863093,0.0003095774,0.00034940793,0.000058171554,0.0001856289,0.6297054],"genre_scores_gemma":[0.25448292,0.00001881518,0.43751037,0.003283923,0.00086995313,0.00013073563,0.00003174818,0.00016624249,0.30350527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977667,0.00011430741,0.0004246364,0.00075987686,0.0004147718,0.0005197096],"domain_scores_gemma":[0.998513,0.0002026135,0.00026301324,0.00068759214,0.000150701,0.00018312207],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005084509,0.00049330405,0.0005419055,0.00014199849,0.00012730967,0.00024087777,0.0011195267,0.00046182497,0.000015133648],"category_scores_gemma":[0.00003095812,0.0005031441,0.00010908469,0.000070102804,0.00008497129,0.00008108642,0.00027289224,0.00046477388,0.00020875967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025760308,0.0000047825724,0.000027587994,0.000016930602,0.0000303927,0.00017946161,0.00040063163,0.002541736,0.000004378383,0.9854536,0.005825824,0.0054889107],"study_design_scores_gemma":[0.0033043718,0.0021435705,0.00015610474,0.0033876686,0.00011149201,0.00024655863,0.000051899242,0.10719381,0.00043669765,0.67685926,0.20137517,0.004733404],"about_ca_topic_score_codex":0.00006369631,"about_ca_topic_score_gemma":0.000051326897,"teacher_disagreement_score":0.32620016,"about_ca_system_score_codex":0.00026844296,"about_ca_system_score_gemma":0.00067710795,"threshold_uncertainty_score":0.99974203},"labels":[],"label_agreement":null},{"id":"W2788330867","doi":"10.1609/aaai.v32i1.12092","title":"Fat- and Heavy-Tailed Behavior in Satisficing Planning","year":2018,"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":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Satisficing; Randomness; Heuristic; Benchmark (surveying); Computer science; Heuristics; Mathematical optimization; Process (computing); Mathematics; Artificial intelligence; Statistics","score_opus":0.07938709591078513,"score_gpt":0.3101511081629452,"score_spread":0.2307640122521601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788330867","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9701198,0.00006376702,0.022176905,0.0014568472,0.00035929133,0.0003735309,0.000002422045,0.00010642316,0.0053410674],"genre_scores_gemma":[0.99423546,0.000008297917,0.005408931,0.00017047324,0.0000770771,0.000022130627,2.438742e-7,0.000010145093,0.000067219065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99832004,0.000022354507,0.00047511148,0.0004832103,0.0003185523,0.0003807275],"domain_scores_gemma":[0.9989883,0.00016167742,0.00026203928,0.00022292587,0.00028287715,0.000082214756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006085955,0.00020160539,0.00024065402,0.00019124016,0.0002546878,0.00026162303,0.0010558763,0.00009517592,0.00002494101],"category_scores_gemma":[0.00031674295,0.00016107704,0.000046162066,0.0005855675,0.00027737822,0.00038429827,0.0003272363,0.0003346548,0.00002808665],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002349901,0.00018391415,0.07264901,0.00008928016,0.000015544558,0.000006645628,0.014961103,0.00013253947,0.055799488,0.6645204,0.00023877108,0.19116835],"study_design_scores_gemma":[0.00010459057,0.00091015757,0.010420433,0.0016404849,0.00002182252,0.000023593751,0.0015700456,0.17162673,0.7223635,0.090569824,0.000110921486,0.0006379453],"about_ca_topic_score_codex":0.000113605834,"about_ca_topic_score_gemma":0.000026252266,"teacher_disagreement_score":0.666564,"about_ca_system_score_codex":0.000034380486,"about_ca_system_score_gemma":0.000060028935,"threshold_uncertainty_score":0.6568531},"labels":[],"label_agreement":null},{"id":"W2788438366","doi":"10.1609/aaai.v32i1.12082","title":"Linear and Integer Programming-Based Heuristics for Cost-Optimal Numeric Planning","year":2018,"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":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Integer programming; Linear programming; Mathematical optimization; Linear programming relaxation; Computer science; Heuristic; Branch and price; State (computer science); State variable; Relaxation (psychology); Mathematics; Algorithm","score_opus":0.09279822587069986,"score_gpt":0.32817093078137904,"score_spread":0.2353727049106792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788438366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03644428,0.000041293275,0.95894164,0.0021828935,0.0004389692,0.00077310234,0.000009552135,0.00016246442,0.0010058174],"genre_scores_gemma":[0.90492654,0.000002583691,0.0944624,0.0002934413,0.0001453011,0.000063016916,0.0000013363526,0.000016021651,0.0000893769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982598,0.00001565553,0.000451277,0.00051948085,0.0003099167,0.00044390155],"domain_scores_gemma":[0.9981401,0.00027683488,0.00036128407,0.00023831899,0.0008670809,0.000116396564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006650915,0.00024473656,0.00025792592,0.00012619434,0.00039457128,0.00030441352,0.0011699111,0.00010558714,0.000012705257],"category_scores_gemma":[0.0006517829,0.0001900077,0.00008378375,0.00046493896,0.0004383784,0.00023498508,0.00021483615,0.00027840916,0.000020003874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060753856,0.00034329752,0.0033020633,0.00035681765,0.000061158986,0.0000022927718,0.0072691655,0.001985913,0.009667315,0.58436877,0.0014465591,0.39058912],"study_design_scores_gemma":[0.00006296512,0.0008960976,0.000057477217,0.0004799003,0.00001948664,0.000005123249,0.00029824695,0.8205997,0.15998504,0.015197345,0.002100763,0.00029789718],"about_ca_topic_score_codex":0.000017478398,"about_ca_topic_score_gemma":0.0000018298883,"teacher_disagreement_score":0.86848223,"about_ca_system_score_codex":0.0000272722,"about_ca_system_score_gemma":0.00013672592,"threshold_uncertainty_score":0.774829},"labels":[],"label_agreement":null},{"id":"W2801231304","doi":"","title":"La révolution de l'intelligence du corps","year":2012,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"NeuroDevNet","funders":"","keywords":"Political science; Humanities; Philosophy","score_opus":0.025429359821197435,"score_gpt":0.23847702267724605,"score_spread":0.21304766285604862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801231304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013578503,0.0062178555,0.8836398,0.016093388,0.0008635074,0.00035289687,0.000042491494,0.00037201756,0.07883952],"genre_scores_gemma":[0.7383192,0.0013747753,0.2386262,0.00021725844,0.00011915637,0.000063759246,0.0002114541,0.000055659577,0.02101255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98143363,0.014872436,0.0008317082,0.0011760772,0.00064468075,0.0010414381],"domain_scores_gemma":[0.9884156,0.0050524576,0.000872219,0.0028972453,0.0021969243,0.00056553],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.018709918,0.0005912639,0.0005062125,0.00021500202,0.0009136185,0.0011001776,0.0032394591,0.0007298232,0.0003778135],"category_scores_gemma":[0.0023460644,0.0006909746,0.00033150316,0.0007105782,0.0005685681,0.00058459747,0.0023843944,0.0016122417,0.0005291924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000127264475,0.00069073675,0.015771814,0.0002691687,0.000086950065,0.000034589142,0.037241768,0.0021858602,0.0008131473,0.74281496,0.0039901137,0.19608818],"study_design_scores_gemma":[0.00048196924,0.0000016228677,0.022689056,0.007878855,0.0001590874,0.00050273753,0.00023409157,0.6708528,0.024589578,0.03425276,0.23664428,0.0017131731],"about_ca_topic_score_codex":0.0050251232,"about_ca_topic_score_gemma":0.00077088573,"teacher_disagreement_score":0.7247407,"about_ca_system_score_codex":0.00043799984,"about_ca_system_score_gemma":0.00095251907,"threshold_uncertainty_score":0.99993676},"labels":[],"label_agreement":null},{"id":"W2805961787","doi":"","title":"A case-based reasoning approach to learning state-based behavior","year":2018,"lang":"en","type":"article","venue":"The Florida AI Research Society","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Artificial intelligence; Inductive bias; Machine learning; State (computer science); Similarity (geometry); Multi-task learning; Case-based reasoning; Domain (mathematical analysis); Algorithm; Mathematics; Task (project management); Engineering","score_opus":0.08000807471956185,"score_gpt":0.3572953907984278,"score_spread":0.277287316078866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805961787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18228966,0.00008768151,0.811243,0.002898962,0.00028668024,0.00087138236,0.000010821926,0.00055587257,0.001755922],"genre_scores_gemma":[0.89307874,0.0000018239336,0.103900865,0.001374809,0.0004471272,0.0003080878,0.000013028756,0.000042505053,0.0008330119],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99508303,0.0010367371,0.00030423253,0.00082724966,0.001366832,0.0013819189],"domain_scores_gemma":[0.9964104,0.0011159818,0.00008298379,0.0012135239,0.00077790255,0.00039918753],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0083506815,0.0002720347,0.00024491985,0.00014952965,0.0030218998,0.00084994116,0.0018289041,0.0001345869,0.000028767785],"category_scores_gemma":[0.0004171971,0.00020697725,0.00021869416,0.002108015,0.0004448388,0.00029914879,0.0005600638,0.0017752416,0.00021363086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006791269,0.0015804262,0.036489654,0.000739026,0.00045066138,0.0026153997,0.16009793,0.22928183,0.010727399,0.01344954,0.4382858,0.105603226],"study_design_scores_gemma":[0.0006981782,0.00070461835,0.000506502,0.00012038199,0.00001538624,0.00014487901,0.00076236,0.97630197,0.0046148724,0.00019431673,0.015485614,0.00045094753],"about_ca_topic_score_codex":0.0006818023,"about_ca_topic_score_gemma":0.000014798912,"teacher_disagreement_score":0.7470201,"about_ca_system_score_codex":0.0002572331,"about_ca_system_score_gemma":0.0008077425,"threshold_uncertainty_score":0.99827605},"labels":[],"label_agreement":null},{"id":"W2808541151","doi":"10.24963/ijcai.2018/669","title":"Planning in Factored State and Action Spaces with Learned Binarized Neural Network Transition Models","year":2018,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Leverage (statistics); Computer science; Automated planning and scheduling; Exploit; Artificial intelligence; Plan (archaeology); Discretization; Curse of dimensionality; Theoretical computer science; Constraint (computer-aided design); Mathematical optimization; Mathematics","score_opus":0.05009573217793577,"score_gpt":0.2693127140951196,"score_spread":0.2192169819171838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808541151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49248007,0.00003455682,0.50651217,0.00049344753,0.00005010002,0.00006269756,3.700549e-7,0.000083174345,0.00028340396],"genre_scores_gemma":[0.9744137,0.0000048310894,0.025222482,0.00016092035,0.00004245119,0.000003890575,0.000003417007,0.0000064547517,0.00014183747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991459,0.00007831144,0.00011767478,0.00027349018,0.00012365262,0.00026092594],"domain_scores_gemma":[0.9996713,0.000060793573,0.000052237516,0.00012926359,0.000030199655,0.000056238892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022765627,0.00011107939,0.00012023657,0.00008058076,0.00015017795,0.00018285925,0.00011608395,0.00004218028,0.0000048985744],"category_scores_gemma":[0.0000026394832,0.00008725984,0.000011514711,0.00026530286,0.00003425587,0.0007895381,0.000025055308,0.00013490584,0.0000028987192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036539228,0.000022892684,0.0077106263,0.000021764696,0.000019101146,0.000034239114,0.021151712,0.950494,0.0009256555,0.00073325104,0.00038475468,0.018136593],"study_design_scores_gemma":[0.0005667484,0.00031519562,0.002828311,0.00007184008,0.0000027344142,0.000011926528,0.0001728949,0.99271345,0.00026531247,0.0028695075,0.00003876829,0.00014330124],"about_ca_topic_score_codex":0.0002433093,"about_ca_topic_score_gemma":0.00010208287,"teacher_disagreement_score":0.48193365,"about_ca_system_score_codex":0.00001642969,"about_ca_system_score_gemma":0.000025896212,"threshold_uncertainty_score":0.3558353},"labels":[],"label_agreement":null},{"id":"W2809867153","doi":"10.1609/icaps.v28i1.13885","title":"MS-Lite: A Lightweight, Complementary Merge-and-Shrink Method","year":2018,"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":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Merge (version control); Heuristics; Computer science; Algorithm; Parallel computing","score_opus":0.04241745071625335,"score_gpt":0.3183386825914925,"score_spread":0.27592123187523915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809867153","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91078156,0.00028734293,0.037061896,0.013958494,0.0010763332,0.0002964496,0.000027440054,0.0010168878,0.035493568],"genre_scores_gemma":[0.8813511,0.000010855499,0.11795688,0.0004240772,0.00009187644,0.0000064289684,0.0000037954662,0.0000090097865,0.00014596933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859816,0.000021525413,0.00033055615,0.000410797,0.00039863394,0.00024033761],"domain_scores_gemma":[0.9989961,0.00014606521,0.0002872783,0.000111252426,0.00037371856,0.00008563179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007343771,0.00019133749,0.0002036611,0.00017187043,0.00033011872,0.00032854202,0.0009280772,0.00007453168,0.000032659544],"category_scores_gemma":[0.00012017088,0.00014461463,0.00004401266,0.0002061484,0.00009895994,0.00033564545,0.00042516066,0.00026280843,0.000005108263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021969837,0.00011746522,0.058746107,0.00020115692,0.00045503813,0.000009349323,0.012519539,0.0005128642,0.09354323,0.8131754,0.006622348,0.013877807],"study_design_scores_gemma":[0.0003440235,0.00012784488,0.002951896,0.0008351203,0.00001635643,0.000050861345,0.0002651428,0.96629983,0.021529347,0.0064432276,0.000928278,0.00020806755],"about_ca_topic_score_codex":0.00005815813,"about_ca_topic_score_gemma":0.0000011375326,"teacher_disagreement_score":0.965787,"about_ca_system_score_codex":0.0000239167,"about_ca_system_score_gemma":0.00004828859,"threshold_uncertainty_score":0.5897214},"labels":[],"label_agreement":null},{"id":"W2809942986","doi":"","title":"Predicting the performance of IDA* with conditional distributions","year":2008,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Heuristic; Set (abstract data type); Computer science; Sample (material); Distribution (mathematics); Algorithm; Mathematics; Mathematical optimization; Artificial intelligence; Statistics","score_opus":0.09917547778702003,"score_gpt":0.2979532252419059,"score_spread":0.19877774745488586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809942986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21028496,0.000018370998,0.78241116,0.0025512155,0.00011265306,0.00014971841,0.0000691381,0.000080961996,0.0043218373],"genre_scores_gemma":[0.99608415,0.000009864797,0.003563689,0.00014882424,0.000060018054,0.000022311066,0.000037312147,0.0000037080063,0.00007011005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850386,0.00005973415,0.00029425984,0.00024249285,0.0007145986,0.00018505426],"domain_scores_gemma":[0.9984475,0.00043077423,0.00016513806,0.00019582637,0.0007105297,0.000050242365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038961417,0.0001138155,0.00010633226,0.00007741118,0.0005825134,0.000053712734,0.00058075687,0.0000448524,0.0000572229],"category_scores_gemma":[0.00015603885,0.00008040389,0.000035127003,0.0004202416,0.0002915541,0.00027564768,0.00005028088,0.00024181257,0.00006341987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028531811,0.00006701595,0.0031491912,0.000006211021,0.000012679081,0.0000030671854,0.00046248295,0.017612305,0.00031502225,0.9745822,0.000110797206,0.0036505018],"study_design_scores_gemma":[0.000044918645,0.0004239685,0.0127498675,0.000119137054,0.000005478913,0.000069883434,0.00009676897,0.8841427,0.041175693,0.060734637,0.0002152335,0.00022171895],"about_ca_topic_score_codex":0.000021875008,"about_ca_topic_score_gemma":0.000009437121,"teacher_disagreement_score":0.91384757,"about_ca_system_score_codex":0.000040618244,"about_ca_system_score_gemma":0.0004906793,"threshold_uncertainty_score":0.4480281},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.10763490228615796,"score_gpt":0.3884198155905721,"score_spread":0.28078491330441413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883445328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00838437,0.01747724,0.97118694,0.0008930709,0.00007282548,0.0007969663,0.000022956812,0.00007574125,0.0010899061],"genre_scores_gemma":[0.98430896,0.004020938,0.010438483,0.0009838203,0.000107929984,0.000101876525,0.000008153311,0.000009008994,0.000020827953],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998755,0.00011850569,0.0003912032,0.00034451892,0.0001859754,0.00020482078],"domain_scores_gemma":[0.99716574,0.002038407,0.00017082276,0.00022823874,0.00030906935,0.0000877419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062303204,0.00011676736,0.00024949925,0.000059036483,0.00012136735,0.000044332075,0.00019040302,0.000046243335,0.000057909132],"category_scores_gemma":[0.0013032265,0.00010935407,0.000056416888,0.00040360403,0.0005091046,0.000110616624,0.00011712752,0.00016818843,0.00014186118],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016404929,0.00006195303,0.00011192004,0.00042393836,0.000024576746,0.000005352186,0.0020013845,0.0000014238182,0.00003488502,0.04818442,0.00007383349,0.9490599],"study_design_scores_gemma":[0.00026474785,0.0042731813,0.0027159178,0.068614244,0.000989258,0.0007213988,0.005987074,0.037002522,0.049582683,0.80110925,0.025819141,0.0029205496],"about_ca_topic_score_codex":0.000034541914,"about_ca_topic_score_gemma":0.000016916774,"teacher_disagreement_score":0.9759246,"about_ca_system_score_codex":0.000008716725,"about_ca_system_score_gemma":0.00011843908,"threshold_uncertainty_score":0.44593295},"labels":[],"label_agreement":null},{"id":"W2890521966","doi":"10.1145/3234944.3234976","title":"Levenshtein in Blocks World","year":2018,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Levenshtein distance; Heuristics; Computer science; Benchmark (surveying); Encoding (memory); Artificial intelligence; String (physics); String metric; Automated planning and scheduling; Plan (archaeology); Domain (mathematical analysis); Similarity (geometry); Matching (statistics); State (computer science); Machine learning; String searching algorithm; Theoretical computer science; Pattern matching; Algorithm; Mathematics; Image (mathematics)","score_opus":0.019606208624121386,"score_gpt":0.24995418996834703,"score_spread":0.23034798134422566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890521966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056378897,0.00010364978,0.6497541,0.004012203,0.0004935027,0.00009831413,5.578441e-7,0.00040332397,0.28875548],"genre_scores_gemma":[0.91752195,3.2755977e-7,0.06810355,0.00085418153,0.00007865059,0.000002164744,3.7054184e-7,0.0000028770176,0.013435943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993809,0.000026533007,0.00010739139,0.00019064949,0.00009335075,0.00020117476],"domain_scores_gemma":[0.9995834,0.00006603684,0.000020432033,0.00026442567,0.00002356248,0.0000421128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027112121,0.000059278707,0.00006489888,0.00012951545,0.00005579498,0.000059157876,0.00038805412,0.000023022782,0.00016256612],"category_scores_gemma":[0.000015115961,0.00005161801,0.00001563191,0.00045170833,0.000023146846,0.00013330301,0.00009690579,0.00008797861,0.00023827252],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023739483,0.00017875971,0.16496626,0.000023925493,0.000023666895,0.00017606799,0.006931816,0.000583507,0.0022978822,0.29950252,0.24623278,0.27905908],"study_design_scores_gemma":[0.001428753,0.0004873998,0.03498301,0.0003150336,0.0000047965623,0.0000382094,0.00006603379,0.55164737,0.030944172,0.048488434,0.3304538,0.001142976],"about_ca_topic_score_codex":0.00015834332,"about_ca_topic_score_gemma":0.00048994523,"teacher_disagreement_score":0.86114305,"about_ca_system_score_codex":0.000014605866,"about_ca_system_score_gemma":0.000032789638,"threshold_uncertainty_score":0.30625907},"labels":[],"label_agreement":null},{"id":"W28947874","doi":"10.1155/2017/2945282","title":"A SNePS Approach to The Wumpus World Agent or Cassie Meets the Wumpus","year":2005,"lang":"en","type":"article","venue":"Canadian Respiratory Journal","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Component (thermodynamics); Computer science; Artificial intelligence","score_opus":0.05233726254038301,"score_gpt":0.2575636028194043,"score_spread":0.2052263402790213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W28947874","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07077267,0.024359057,0.3156449,0.4317753,0.010173801,0.0032781875,0.00011794894,0.0006183398,0.14325982],"genre_scores_gemma":[0.87710047,0.000014304835,0.016212465,0.094614655,0.003152435,0.00006308267,0.00000178106,0.000055175078,0.00878566],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974785,0.00040180053,0.00040066984,0.000365612,0.00046707827,0.0008863413],"domain_scores_gemma":[0.9974457,0.00020706035,0.00016906862,0.00082231883,0.00012200622,0.001233858],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0021031077,0.00024115079,0.00018890976,0.0003906401,0.0018347069,0.0009358025,0.0023386213,0.00008126652,0.00010772985],"category_scores_gemma":[0.00014091127,0.00013301411,0.000118183336,0.0008903222,0.000070122696,0.00029781726,0.000115181596,0.0009274211,0.00022196342],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024415785,0.000035701487,0.0015416199,0.000010270542,0.0000932747,0.0006506818,0.0057314956,0.025227759,0.00003996809,0.0064967177,0.7452477,0.2149004],"study_design_scores_gemma":[0.00021560508,0.00006754182,0.001412867,0.000047317215,0.000012951127,0.0006100781,0.00011842186,0.007537304,0.000041634867,0.00010227666,0.9895985,0.00023547109],"about_ca_topic_score_codex":0.0017409305,"about_ca_topic_score_gemma":0.07991062,"teacher_disagreement_score":0.80632776,"about_ca_system_score_codex":0.000558637,"about_ca_system_score_gemma":0.0023725047,"threshold_uncertainty_score":0.99946475},"labels":[],"label_agreement":null},{"id":"W2895802172","doi":"10.1109/re.2018.00067","title":"BloomingLeaf: A Formal Tool for Requirements Evolution Over Time","year":2018,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Semantics (computer science); Constraint (computer-aided design); Architecture; Constraint satisfaction problem; Software engineering; Formal semantics (linguistics); Artificial intelligence; Programming language; Theoretical computer science; Engineering","score_opus":0.0176533603429046,"score_gpt":0.25898694119806126,"score_spread":0.24133358085515666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895802172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034893736,0.000018793864,0.9587429,0.00020075012,0.00025184118,0.00017848804,0.0000027686394,0.0002155912,0.005495103],"genre_scores_gemma":[0.7957246,2.3117842e-7,0.19681488,0.00060579664,0.00026866418,0.00002090925,0.0000061160795,0.000008181682,0.0065506673],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908876,0.000017203014,0.00015837571,0.00023923912,0.0001549531,0.00034147274],"domain_scores_gemma":[0.9994554,0.00006736917,0.000058020974,0.00028755362,0.00008654362,0.000045109933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004554515,0.00008940041,0.00008195283,0.000057532587,0.00025044993,0.00010226813,0.00035680557,0.000050315786,0.000115185],"category_scores_gemma":[0.000043188207,0.00007863992,0.0000462013,0.0001329187,0.000024464645,0.0008153222,0.000122713,0.00004092538,0.00028569635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030663033,0.0003673027,0.030118778,0.00015337009,0.00019462386,0.000011222756,0.004229522,0.0002047976,0.04070606,0.3485243,0.43141434,0.14376904],"study_design_scores_gemma":[0.0012117191,0.00084220344,0.0035968113,0.00006853757,0.000014211656,0.000010097743,0.0000063669513,0.95004237,0.005644448,0.009206425,0.028967548,0.00038928934],"about_ca_topic_score_codex":0.000020495369,"about_ca_topic_score_gemma":0.0000024143412,"teacher_disagreement_score":0.94983757,"about_ca_system_score_codex":0.00004653404,"about_ca_system_score_gemma":0.000056127177,"threshold_uncertainty_score":0.3672144},"labels":[],"label_agreement":null},{"id":"W2899183792","doi":"10.4018/ijccp.2018070101","title":"A Biologically-Inspired Metaheuristic Approach for the Simultaneous Generation of Alternatives","year":2018,"lang":"en","type":"article","venue":"International Journal of Computers in Clinical Practice","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Firefly algorithm; Benchmark (surveying); Metaheuristic; Computer science; Mathematical optimization; Artificial intelligence; Machine learning; Mathematics","score_opus":0.14264015778157074,"score_gpt":0.43382820613745265,"score_spread":0.2911880483558819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899183792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057743913,0.0002458115,0.9850536,0.0053176503,0.0030402055,0.00013410993,0.000003498034,0.000011619788,0.00041908672],"genre_scores_gemma":[0.55480474,0.00006220111,0.44293076,0.0013080963,0.00088174175,0.0000018324704,0.0000015306055,0.0000033539645,0.000005767097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974196,0.00049462315,0.0012437069,0.00022295822,0.0004847368,0.00013437221],"domain_scores_gemma":[0.97484887,0.021765066,0.0015119854,0.00021631767,0.0016022818,0.00005548471],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.004682633,0.000108077234,0.00026368894,0.00013052057,0.00006529466,0.00012795458,0.0017821718,0.000078606456,0.0000025915342],"category_scores_gemma":[0.01159237,0.000070743234,0.00018434934,0.00014618241,0.00017628944,0.0004932643,0.00017406937,0.00036269557,0.0000019319166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00253377,0.002527564,0.0045710797,0.00003513805,0.0022286659,0.0003318807,0.0029423551,0.18424791,0.0007322504,0.05803699,0.0070326407,0.7347798],"study_design_scores_gemma":[0.0010342784,0.0009279369,0.00086963986,0.00005998131,0.000035229226,0.00016264219,0.000038711525,0.9831211,0.00014165703,0.0023928636,0.011118694,0.00009725542],"about_ca_topic_score_codex":0.000014760515,"about_ca_topic_score_gemma":0.0000013382604,"teacher_disagreement_score":0.7988732,"about_ca_system_score_codex":0.000037918093,"about_ca_system_score_gemma":0.00013427505,"threshold_uncertainty_score":0.9967334},"labels":[],"label_agreement":null},{"id":"W2902069995","doi":"10.1609/aiide.v14i1.13020","title":"Exhaustive and Semi-Exhaustive Procedural Content Generation","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Enumeration; Set (abstract data type); Genetic programming; Range (aeronautics); Content (measure theory); Theoretical computer science; Artificial intelligence; Machine learning; Algorithm; Mathematics; Programming language","score_opus":0.08584970034259369,"score_gpt":0.2829445013890499,"score_spread":0.19709480104645621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902069995","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9500087,0.000040012892,0.035422713,0.0036479887,0.0004425797,0.0006757272,0.000020088955,0.000068042005,0.009674178],"genre_scores_gemma":[0.9985863,0.000019770358,0.00040360133,0.0004729904,0.00010135659,0.000031101903,0.000002571718,0.000008984835,0.00037330014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984787,0.000008830441,0.00039592126,0.0005306104,0.00030198914,0.0002839383],"domain_scores_gemma":[0.9987336,0.00006567761,0.00031457742,0.00013306605,0.00064585847,0.00010724124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018302065,0.00025273915,0.00022485548,0.000102692764,0.00024551316,0.00064746663,0.00047179972,0.00006170311,0.000017648936],"category_scores_gemma":[0.0001662152,0.0001805625,0.00006215914,0.00017988641,0.00037069744,0.0012360506,0.00038207817,0.00022001613,0.000019896568],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009071207,0.00070260663,0.010649762,0.00013375982,0.0002573558,0.000003781059,0.032699656,0.00002740387,0.10817725,0.5628065,0.0013816764,0.28225315],"study_design_scores_gemma":[0.00015378551,0.0026406266,0.001632985,0.0009811482,0.000030932468,0.000035572226,0.0076130475,0.17120215,0.7939992,0.020792754,0.00037511621,0.00054269494],"about_ca_topic_score_codex":0.000026621026,"about_ca_topic_score_gemma":0.000004302291,"teacher_disagreement_score":0.68582195,"about_ca_system_score_codex":0.0000681657,"about_ca_system_score_gemma":0.000044357777,"threshold_uncertainty_score":0.7363125},"labels":[],"label_agreement":null},{"id":"W2902160170","doi":"","title":"Towards a Framework for Testing Learning from Observation of State-Based Agents.","year":2017,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; State (computer science); Artificial intelligence; Programming language","score_opus":0.38210236330653463,"score_gpt":0.3942640635304206,"score_spread":0.012161700223885963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902160170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02685131,0.0000088593015,0.9696001,0.0017520858,0.00029116555,0.00018810111,0.000034773715,0.00008112673,0.0011924979],"genre_scores_gemma":[0.7580874,0.0000011224039,0.2415585,0.00019540332,0.00006995526,0.000025023215,0.00002437979,0.0000071002128,0.00003112048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982899,0.00007155541,0.0004167002,0.00040850745,0.00058532046,0.00022803656],"domain_scores_gemma":[0.99633884,0.0014882684,0.00056402467,0.00035734978,0.001183168,0.000068341324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077920954,0.00015140868,0.00018445872,0.0001061848,0.00062665826,0.0004491255,0.0010447837,0.0001025383,0.00004271133],"category_scores_gemma":[0.006719028,0.00015644473,0.00006450871,0.00016415429,0.00009277654,0.000366685,0.00008272738,0.00028292957,0.000031109055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005550354,0.00006698027,0.0025205538,0.000018113991,0.000013328606,0.0000015716134,0.00045391786,0.052380003,0.0014450591,0.66315156,0.000029266683,0.27986416],"study_design_scores_gemma":[0.00002421848,0.00011155515,0.004335203,0.00016202334,0.000002446895,8.906942e-8,0.000020893776,0.55871236,0.02333089,0.41313806,0.000053710937,0.000108566244],"about_ca_topic_score_codex":0.00031370076,"about_ca_topic_score_gemma":0.000023880326,"teacher_disagreement_score":0.7312361,"about_ca_system_score_codex":0.000057205132,"about_ca_system_score_gemma":0.00053896365,"threshold_uncertainty_score":0.8043789},"labels":[],"label_agreement":null},{"id":"W2902387896","doi":"","title":"Foundations of Human-Agent Collaboration: Situation-Relevant Information Sharing.","year":2014,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Knowledge management; Information sharing; Human–computer interaction; World Wide Web","score_opus":0.11014330541967347,"score_gpt":0.354698715458783,"score_spread":0.24455541003910952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902387896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049294718,0.000005310069,0.97027886,0.0029280393,0.00031959979,0.00018896557,0.000015963507,0.000103007806,0.0212308],"genre_scores_gemma":[0.9892823,0.0000030028534,0.010018605,0.0003919711,0.000076126315,0.000026924192,0.00009328456,0.000004064116,0.00010372888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981231,0.00007388766,0.0006161643,0.0002592565,0.00075859553,0.00016899145],"domain_scores_gemma":[0.99741083,0.00028915916,0.00033295565,0.0002870006,0.0016108123,0.00006924543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000902799,0.00013401665,0.00014462616,0.00028112228,0.00034084122,0.00036623594,0.00063016854,0.00007809948,0.00015658919],"category_scores_gemma":[0.00066951575,0.00013822936,0.000044479002,0.0006063742,0.000069376714,0.0010524102,0.00007792532,0.00015430742,0.00038305754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006892327,0.000045001576,0.000054388678,0.000010045746,0.000006496015,1.3026232e-7,0.0010270869,0.0135041345,0.0008120341,0.95457166,0.00023113008,0.029731],"study_design_scores_gemma":[0.000036615686,0.00017027829,0.00044269834,0.000057976817,0.0000036308222,8.906138e-7,0.00012728023,0.6214898,0.010562731,0.3658657,0.0010776302,0.00016473189],"about_ca_topic_score_codex":0.00003871373,"about_ca_topic_score_gemma":0.00005310112,"teacher_disagreement_score":0.9843528,"about_ca_system_score_codex":0.00008769624,"about_ca_system_score_gemma":0.00030681456,"threshold_uncertainty_score":0.563683},"labels":[],"label_agreement":null},{"id":"W2903153676","doi":"","title":"Leveraging Constraint Logic Programming for Neural Guided Program Synthesis.","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; University of Toronto","funders":"","keywords":"Computer science; Logic programming; Programming language; Constraint programming; Concurrent constraint logic programming; Constraint logic programming; Logic program; Constraint satisfaction; Constraint (computer-aided design); Inductive programming; Theoretical computer science; Artificial intelligence; Functional logic programming; Programming paradigm; Mathematical optimization; Mathematics","score_opus":0.12365227752669244,"score_gpt":0.3885364596589281,"score_spread":0.26488418213223563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903153676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032135896,0.000017236494,0.90068626,0.017512552,0.0014124184,0.00107768,0.000011496746,0.0013508648,0.04579559],"genre_scores_gemma":[0.88053733,0.0000021571564,0.11774302,0.00022104465,0.00022495369,0.00037247184,0.0000364542,0.000012710518,0.0008498396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827665,0.00012835805,0.00033359474,0.00055422547,0.00036222578,0.00034493222],"domain_scores_gemma":[0.9980715,0.00065366254,0.00022006959,0.00029015017,0.0006686281,0.000095969546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045235903,0.00017423004,0.00015081262,0.00020647272,0.0005182873,0.0006935803,0.0008035755,0.00006324384,0.00013956158],"category_scores_gemma":[0.0011296675,0.00017123092,0.00010130855,0.00021164458,0.00016110213,0.00035022805,0.00012424837,0.00027578327,0.000066061715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005046102,0.0002401875,0.009080806,0.000025663086,0.00015578257,0.000027459431,0.0049046655,0.01282465,0.0012424864,0.39064944,0.0024309845,0.5783674],"study_design_scores_gemma":[0.00037446842,0.00036828138,0.0013047869,0.00014056136,0.000013270634,0.00004277035,0.00049468636,0.977428,0.0009364016,0.006469619,0.012136143,0.0002909734],"about_ca_topic_score_codex":0.00005667821,"about_ca_topic_score_gemma":0.000005243412,"teacher_disagreement_score":0.96460336,"about_ca_system_score_codex":0.000059226102,"about_ca_system_score_gemma":0.00013333032,"threshold_uncertainty_score":0.6982594},"labels":[],"label_agreement":null},{"id":"W2903157661","doi":"","title":"Dynamic Goal Recognition Using Windowed Action Sequences.","year":2017,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Artificial intelligence; Action recognition; Action (physics); Pattern recognition (psychology); Speech recognition; Class (philosophy)","score_opus":0.311107938398646,"score_gpt":0.4056791871074276,"score_spread":0.09457124870878164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903157661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062286094,0.000015692334,0.9256362,0.0021873505,0.0011060926,0.00021258973,0.000027612343,0.00017277985,0.008355609],"genre_scores_gemma":[0.9741177,0.000012637965,0.02540015,0.00023081672,0.00010423466,0.000012459135,0.000021828073,0.000008324957,0.000091873284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980756,0.00009436686,0.00034909608,0.00051375234,0.00067409896,0.00029305465],"domain_scores_gemma":[0.9983011,0.00016817027,0.00036633413,0.00042443382,0.00064158277,0.000098416946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007212388,0.00018383432,0.00015333027,0.00018421028,0.001132319,0.00097548286,0.0010381739,0.00013159633,0.00013165409],"category_scores_gemma":[0.0005608054,0.00019077258,0.000065353655,0.00015898513,0.00015197493,0.001133236,0.00010666205,0.00032987603,0.00045697697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070268165,0.0001208427,0.00019834675,0.000018232126,0.000025054816,0.000021754575,0.00044935598,0.009380961,0.01678024,0.2380521,0.000059166152,0.73482364],"study_design_scores_gemma":[0.000028166165,0.000069668815,0.00077733956,0.00010756009,0.0000041447192,0.000011668163,0.000048341833,0.74948454,0.01367634,0.23550661,0.000058365826,0.00022724029],"about_ca_topic_score_codex":0.00014785652,"about_ca_topic_score_gemma":0.00009967357,"teacher_disagreement_score":0.91183156,"about_ca_system_score_codex":0.00019579256,"about_ca_system_score_gemma":0.00045033713,"threshold_uncertainty_score":0.94066036},"labels":[],"label_agreement":null},{"id":"W2903401122","doi":"","title":"An AI Planning-Based Approach to the Multi-Agent Plan Recognition Problem (Preliminary Report).","year":2017,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Plan (archaeology); Artificial intelligence; Machine learning","score_opus":0.2694730179531619,"score_gpt":0.3839999608576474,"score_spread":0.11452694290448551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903401122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022469016,0.000013033475,0.9814519,0.008075017,0.0004056459,0.0005213201,0.00003873652,0.00017885865,0.007068565],"genre_scores_gemma":[0.91816616,9.3437404e-7,0.07945561,0.0018122423,0.00018173293,0.0001436544,0.000119460405,0.00001352136,0.00010666632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972049,0.00018810062,0.0005189511,0.0008208694,0.000884044,0.0003831365],"domain_scores_gemma":[0.997396,0.0002339669,0.00039359432,0.0010029342,0.0007657654,0.00020776228],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017187882,0.00025488329,0.0001860656,0.00019231433,0.0014780619,0.0013283328,0.0021345706,0.00013399262,0.00003279503],"category_scores_gemma":[0.0006346975,0.00020785497,0.00007074458,0.00020014435,0.000119894394,0.0006081134,0.00014174618,0.000468194,0.00034417614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035918108,0.0012733378,0.0009276949,0.00004569401,0.00004082401,0.00015216075,0.0040143933,0.40777466,0.0007647966,0.24762256,0.0031635452,0.33386117],"study_design_scores_gemma":[0.0000527938,0.00041654715,0.001535525,0.0001540521,0.0000065658887,0.000031770644,0.00012390513,0.95927817,0.0053337067,0.031540103,0.0011647171,0.00036217435],"about_ca_topic_score_codex":0.0001357704,"about_ca_topic_score_gemma":0.0000405018,"teacher_disagreement_score":0.9159193,"about_ca_system_score_codex":0.000085810134,"about_ca_system_score_gemma":0.00048471146,"threshold_uncertainty_score":0.9998219},"labels":[],"label_agreement":null},{"id":"W2904154908","doi":"10.1609/aaai.v33i01.33012379","title":"Enriching Non-Parametric Bidirectional Search Algorithms","year":2019,"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":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation; National Science Foundation","keywords":"Parametric statistics; Computer science; Node (physics); Algorithm; Mathematical optimization; Mathematics; Engineering","score_opus":0.06019225234362175,"score_gpt":0.29256652348478174,"score_spread":0.23237427114116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904154908","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7924701,0.000071374634,0.15864421,0.003715886,0.0020228794,0.00086070254,0.000007907073,0.0002830852,0.04192385],"genre_scores_gemma":[0.98655885,0.000014666912,0.012247398,0.00015941728,0.000080021295,0.000012149897,5.869715e-7,0.000012412552,0.00091451104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978079,0.000024187508,0.000441023,0.0005695037,0.0007253528,0.00043201828],"domain_scores_gemma":[0.9985007,0.00027261925,0.00025283598,0.00032071833,0.0005523526,0.00010079308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009940048,0.00021704938,0.00025429734,0.0003190671,0.0002507843,0.00034639024,0.0020160875,0.000105618084,0.000108044],"category_scores_gemma":[0.00023560433,0.00016739905,0.00012647241,0.0015998553,0.00010557346,0.00047721443,0.00040109982,0.00054273277,0.0004579665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072603754,0.0002524646,0.0076487805,0.00012952113,0.000049252216,0.0000014496493,0.002988624,0.0031820654,0.055391945,0.71692455,0.0004780873,0.21288069],"study_design_scores_gemma":[0.00004027114,0.00029286885,0.00095346896,0.000305212,0.000007810548,0.000010979608,0.0003132514,0.61399096,0.3429158,0.040654425,0.0001898496,0.0003250962],"about_ca_topic_score_codex":0.000112415924,"about_ca_topic_score_gemma":0.0000015286665,"teacher_disagreement_score":0.6762701,"about_ca_system_score_codex":0.000058109512,"about_ca_system_score_gemma":0.0001676779,"threshold_uncertainty_score":0.6826335},"labels":[],"label_agreement":null},{"id":"W2904232841","doi":"10.1609/aaai.v33i01.33017554","title":"Efficient Temporal Planning Using Metastates","year":2019,"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":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"State (computer science); Plan (archaeology); Computer science; Range (aeronautics); State space; Space (punctuation); Artificial intelligence; Mathematics; Algorithm; Geography; Statistics; Engineering","score_opus":0.0919222900024954,"score_gpt":0.3055255624659554,"score_spread":0.21360327246346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904232841","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9282173,0.000068400586,0.06253228,0.0009787332,0.00068434956,0.0004216522,0.000004640115,0.00014558982,0.006947064],"genre_scores_gemma":[0.9838595,0.0000015353502,0.015774358,0.0001390344,0.00003808221,0.0000057853285,4.88345e-7,0.000013418413,0.00016781394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979546,0.000024959732,0.00051645155,0.0005298517,0.00053782103,0.00043629954],"domain_scores_gemma":[0.9986036,0.00014172294,0.00044815234,0.000329346,0.00038652253,0.0000906818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078360405,0.0002468823,0.00029908743,0.00016647903,0.00022774728,0.00029456377,0.0017548843,0.00007986322,0.0000660776],"category_scores_gemma":[0.00015048083,0.00018352778,0.00012618568,0.0006848094,0.00012479143,0.00022604155,0.00039408755,0.0003498861,0.00012930905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010486517,0.00019301791,0.010333936,0.00014721691,0.000051673207,0.0000027303984,0.0053921686,0.07555766,0.10696742,0.7833944,0.00013937565,0.017715523],"study_design_scores_gemma":[0.000028373985,0.0001429468,0.00012374349,0.00047296888,0.000011217618,0.000007702699,0.0005007596,0.7821532,0.19336104,0.022879783,0.000071569935,0.00024666832],"about_ca_topic_score_codex":0.00006942359,"about_ca_topic_score_gemma":7.998336e-7,"teacher_disagreement_score":0.7605146,"about_ca_system_score_codex":0.00004693354,"about_ca_system_score_gemma":0.00013094896,"threshold_uncertainty_score":0.74840456},"labels":[],"label_agreement":null},{"id":"W2904534786","doi":"10.1016/j.procs.2018.11.056","title":"Developing a macro cognitive common model test bed for real world expertise","year":2018,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Macro; Test (biology); Cognition; Artificial intelligence; Programming language","score_opus":0.04543527759340191,"score_gpt":0.31308391821949677,"score_spread":0.26764864062609484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904534786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029353093,0.000037755817,0.9674685,0.00089114165,0.0005754663,0.00044089014,0.000007976881,0.0004284424,0.00079675857],"genre_scores_gemma":[0.54402864,0.0000027281035,0.45446298,0.0011219799,0.00023960926,0.00006478643,0.0000027117349,0.000010534313,0.0000660294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718803,0.000024530937,0.0003602501,0.001037543,0.0005201031,0.0008695326],"domain_scores_gemma":[0.9978522,0.0005223777,0.00017717577,0.00044657334,0.000748336,0.00025330696],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00097268744,0.00026752884,0.00025680667,0.00036558675,0.0012081605,0.0006730599,0.0020608006,0.000055157958,0.000001790756],"category_scores_gemma":[0.00018669447,0.0002523588,0.000058785386,0.0016832468,0.0005257808,0.0012659092,0.0007957084,0.00016218764,0.000036262205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015436583,0.00045974177,0.046799157,0.00037174026,0.000055504774,0.000053994634,0.060657553,0.0026282314,0.005722972,0.11954474,0.008793595,0.7547584],"study_design_scores_gemma":[0.000405369,0.00024080514,0.0008480187,0.0002451055,0.0000052391065,0.000016528924,0.000011178223,0.9789968,0.011880747,0.0068005314,0.0001473042,0.0004023725],"about_ca_topic_score_codex":0.000036257425,"about_ca_topic_score_gemma":0.00006227677,"teacher_disagreement_score":0.97636855,"about_ca_system_score_codex":0.0001561512,"about_ca_system_score_gemma":0.0010484414,"threshold_uncertainty_score":0.99999285},"labels":[],"label_agreement":null},{"id":"W2904811519","doi":"10.1609/aaai.v33i01.33017610","title":"Generalized Planning via Abstraction: Arbitrary Numbers of Objects","year":2019,"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":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Microsoft Research","keywords":"Nondeterministic algorithm; Abstraction; Class (philosophy); Computer science; Set (abstract data type); Task (project management); Action (physics); Observable; Theoretical computer science; Mathematical optimization; Artificial intelligence; Mathematics; Programming language","score_opus":0.05131861020903025,"score_gpt":0.28261574386964894,"score_spread":0.2312971336606187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904811519","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90482324,0.000087157496,0.020594476,0.0014391611,0.0012539693,0.00055780716,0.0000053230888,0.0001788135,0.07106005],"genre_scores_gemma":[0.9905836,0.000006658773,0.008611096,0.00018461987,0.00005260752,0.000008693952,8.0173743e-7,0.0000119832475,0.0005399657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99812424,0.00002075585,0.00059080566,0.00044201847,0.00049616036,0.00032600845],"domain_scores_gemma":[0.9984529,0.0001588244,0.00060743256,0.000327246,0.00037441327,0.00007915622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005219006,0.0002172152,0.0003183426,0.00017623369,0.00013706075,0.0001238101,0.0014874801,0.00009704944,0.00012555938],"category_scores_gemma":[0.000091767826,0.00017448746,0.0001371077,0.0006820423,0.00012533316,0.00048424807,0.00020350833,0.00038030875,0.000107063264],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001950927,0.00018602428,0.008726689,0.00024636064,0.000062058214,0.000002189306,0.0057065818,0.002854747,0.1951284,0.763301,0.00040887648,0.02318199],"study_design_scores_gemma":[0.000059487775,0.00022006709,0.0007373125,0.0006567584,0.0000138944115,0.000010624802,0.00048154258,0.08641644,0.81642324,0.094546355,0.00012994019,0.0003043372],"about_ca_topic_score_codex":0.00011753718,"about_ca_topic_score_gemma":0.000004405782,"teacher_disagreement_score":0.66875464,"about_ca_system_score_codex":0.00003184197,"about_ca_system_score_gemma":0.00012915007,"threshold_uncertainty_score":0.7115392},"labels":[],"label_agreement":null},{"id":"W2912371510","doi":"","title":"Inconsistent heuristics","year":2007,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Heuristic; Consistency (knowledge bases); Computer science; Mathematical optimization; Quality (philosophy); Field (mathematics); Incremental heuristic search; Consistent heuristic; Null-move heuristic; Artificial intelligence; Mathematics; Algorithm; Beam search; Search algorithm","score_opus":0.15358805703241057,"score_gpt":0.35392359311149396,"score_spread":0.2003355360790834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912371510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001643813,0.000024187038,0.9496124,0.0021855799,0.0004897408,0.00009865915,0.0000068965874,0.00015759282,0.04578113],"genre_scores_gemma":[0.97003424,0.0000049492864,0.028530722,0.0010277865,0.00013692712,0.0000048592706,0.000008209756,0.0000062753206,0.00024605033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804264,0.00005164325,0.0004304535,0.00039006508,0.00075632485,0.00032886307],"domain_scores_gemma":[0.9981987,0.00061578647,0.00012874539,0.00025044646,0.0006684188,0.0001379292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013788698,0.00015325414,0.00012925139,0.00021469522,0.00024124762,0.0002171479,0.00068969734,0.00009240538,0.000102447986],"category_scores_gemma":[0.0005346451,0.00015135232,0.000054533793,0.00042784694,0.0000851149,0.00019205209,0.00009082241,0.00028649563,0.0006749113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016239608,0.000060486247,0.000069108035,0.0000034039028,0.0000053868275,0.000014819207,0.00019690122,0.0010583402,0.00037151264,0.89051074,0.00030395243,0.10738911],"study_design_scores_gemma":[0.00003327517,0.00021554656,0.000944539,0.0000815984,0.000003995863,0.000017743492,0.00013510071,0.28838882,0.030382043,0.67611814,0.0032597664,0.00041939897],"about_ca_topic_score_codex":0.000022511758,"about_ca_topic_score_gemma":0.00004028708,"teacher_disagreement_score":0.9683904,"about_ca_system_score_codex":0.000098252254,"about_ca_system_score_gemma":0.00029127946,"threshold_uncertainty_score":0.86748445},"labels":[],"label_agreement":null},{"id":"W2912712767","doi":"","title":"Human-Agent Teaming as a Common Problem for Goal Reasoning.","year":2018,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Multi-agent system; Human–computer interaction; Artificial intelligence","score_opus":0.11159756347113302,"score_gpt":0.3768966286957244,"score_spread":0.26529906522459135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912712767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011577917,0.000027282382,0.93521225,0.0028649338,0.00051218923,0.0005776012,0.000023418357,0.00030798325,0.0488964],"genre_scores_gemma":[0.95632017,0.0000016969619,0.04163336,0.00086654845,0.00035157855,0.000089177534,0.00002097269,0.000013612223,0.0007029053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772114,0.000091790615,0.00047741467,0.0006090671,0.0006794859,0.00042113516],"domain_scores_gemma":[0.99802387,0.00033338068,0.00021535934,0.00030794498,0.0009874749,0.00013196666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010695904,0.00022021965,0.00020002181,0.00019837527,0.00078296283,0.00042575545,0.00095072365,0.00012256972,0.00015045248],"category_scores_gemma":[0.00036676982,0.00022005397,0.00008543743,0.00036559577,0.00016445343,0.00032569107,0.0001246214,0.00025892185,0.00057731447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030097915,0.00008502191,0.000047013735,0.000010165931,0.000011810307,0.0000025530264,0.00080327544,0.0004896568,0.001775047,0.9208908,0.0009875454,0.07486698],"study_design_scores_gemma":[0.00006259668,0.00095960934,0.00016960186,0.0002272105,0.0000065724553,0.000010759139,0.00013001569,0.34864387,0.036893304,0.60868627,0.0038015912,0.0004086137],"about_ca_topic_score_codex":0.00011194162,"about_ca_topic_score_gemma":0.000120934965,"teacher_disagreement_score":0.9447422,"about_ca_system_score_codex":0.00012670744,"about_ca_system_score_gemma":0.0003836781,"threshold_uncertainty_score":0.89735407},"labels":[],"label_agreement":null},{"id":"W2918645572","doi":"","title":"Probabilistic Planning with Sequential Monte Carlo methods","year":2018,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal; McGill University","funders":"","keywords":"Monte Carlo method; Computer science; Probabilistic logic; Artificial intelligence; Statistics; Mathematics","score_opus":0.02168055308230126,"score_gpt":0.2836773342317862,"score_spread":0.26199678114948494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918645572","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033520464,0.000677682,0.9605513,0.0015996909,0.00024213968,0.00053052075,0.000010114854,0.0015860957,0.001281971],"genre_scores_gemma":[0.4376744,0.000003894683,0.5606176,0.00094622315,0.00019084061,0.00015981734,0.000003956393,0.000039519287,0.00036372154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677044,0.00041792812,0.00047049636,0.000840535,0.0004573244,0.0010433005],"domain_scores_gemma":[0.9973988,0.00030223402,0.0002844201,0.0013644877,0.00026165775,0.00038842697],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016427857,0.0004413471,0.00042091348,0.00039205552,0.00060196454,0.0005361892,0.0014135658,0.0002558031,0.000019898087],"category_scores_gemma":[0.00021854529,0.0003869993,0.00011961219,0.0009361691,0.00021643596,0.0007062596,0.00041732646,0.00056831486,0.000025194564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010422976,0.0008855164,0.11737343,0.00047281227,0.0007894366,0.0018445202,0.017492812,0.1916483,0.023454243,0.3359286,0.021377355,0.2876907],"study_design_scores_gemma":[0.00061735645,0.0008881271,0.0055898004,0.00027473838,0.00005090597,0.0004521719,0.000072370356,0.9671904,0.012287512,0.0058462694,0.0058703967,0.0008599689],"about_ca_topic_score_codex":0.0038987712,"about_ca_topic_score_gemma":0.00052928616,"teacher_disagreement_score":0.7755421,"about_ca_system_score_codex":0.00030462182,"about_ca_system_score_gemma":0.00045986738,"threshold_uncertainty_score":0.9998582},"labels":[],"label_agreement":null},{"id":"W29265412","doi":"10.1111/1346-8138.14192","title":"Multiple agents moving target search","year":2003,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Domain (mathematical analysis); Search problem; Search algorithm; Bidirectional search; State (computer science); Multi-agent system; Incremental heuristic search; Artificial intelligence; Mathematical optimization; Beam search; Algorithm; Mathematics","score_opus":0.1572151320510519,"score_gpt":0.3316735627996419,"score_spread":0.17445843074859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W29265412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011332305,0.000019232628,0.9521996,0.002473633,0.0016134747,0.00017443093,0.000012455371,0.00019937543,0.031975485],"genre_scores_gemma":[0.9480729,0.000014089065,0.050557453,0.0006301357,0.000092414484,0.000019252091,0.0000120058985,0.0000134574475,0.0005883078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974644,0.00018662261,0.0005230724,0.0006388255,0.00073168235,0.00045540015],"domain_scores_gemma":[0.99854183,0.0002765937,0.00013872358,0.0004686921,0.00039633518,0.00017780882],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00079618127,0.00023657232,0.00019176315,0.00027705956,0.00023391315,0.00053531805,0.0011818114,0.0000936172,0.0009262673],"category_scores_gemma":[0.00065232476,0.00023518865,0.0001054619,0.00029666172,0.0000841414,0.00044771953,0.00016558597,0.0004086577,0.001347376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018982832,0.00015618086,0.0010695186,0.000006593131,0.000030231664,0.00005773974,0.00096616114,0.013158412,0.00324608,0.9322715,0.00037280036,0.048645817],"study_design_scores_gemma":[0.00005797454,0.00012379084,0.00033195887,0.0001410225,0.0000025633365,0.000021576938,0.00026336327,0.76469636,0.13008535,0.10009167,0.0037892542,0.00039510673],"about_ca_topic_score_codex":0.00010383568,"about_ca_topic_score_gemma":0.000015253354,"teacher_disagreement_score":0.9367406,"about_ca_system_score_codex":0.00011414157,"about_ca_system_score_gemma":0.00021568833,"threshold_uncertainty_score":0.999987},"labels":[],"label_agreement":null},{"id":"W2943253458","doi":"10.1080/08982112.2018.1548022","title":"Statistical reasoning in diagnostic problem-solving—The case of flow-rate measurements","year":2019,"lang":"en","type":"article","venue":"Quality Engineering","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Suspect; Hierarchy; Computer science; Domain (mathematical analysis); Statistical hypothesis testing; Statistical analysis; Flow (mathematics); Econometrics; Management science; Statistics; Mathematics; Engineering; Psychology; Economics","score_opus":0.026909854212799483,"score_gpt":0.2714776724664599,"score_spread":0.2445678182536604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943253458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37557718,0.00019182825,0.6232468,0.00011771096,0.00023684632,0.0002464389,0.000008678378,0.00010446441,0.00027009274],"genre_scores_gemma":[0.88623786,0.0000022578204,0.113661095,0.000034406272,0.000018575583,0.000012699524,0.0000035865612,0.000011188931,0.000018318262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984781,0.00020863334,0.0004758847,0.00028899813,0.00020520076,0.00034319033],"domain_scores_gemma":[0.99674445,0.0025615136,0.00010876807,0.00045859217,0.0000576011,0.000069057955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002974866,0.00014820708,0.0002306273,0.00008571085,0.000052077965,0.000071556875,0.00039072477,0.000054389784,0.000015108872],"category_scores_gemma":[0.0015968176,0.00012649917,0.000036796187,0.00033082528,0.000015769847,0.00020676065,0.00012006548,0.00026882364,0.000021740409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020079655,0.00010625487,0.062163264,0.00094368204,0.00007193895,0.0005559604,0.0073602544,0.8528822,0.0037109763,0.056614187,0.00019897328,0.015372224],"study_design_scores_gemma":[0.00046320175,0.00006961709,0.018471994,0.00055385067,0.000008743306,0.000086592096,0.000094259165,0.97848296,0.0007988369,0.0005134532,0.00014294987,0.00031351115],"about_ca_topic_score_codex":0.00062708295,"about_ca_topic_score_gemma":0.000044228298,"teacher_disagreement_score":0.5106607,"about_ca_system_score_codex":0.000060446262,"about_ca_system_score_gemma":0.00005643274,"threshold_uncertainty_score":0.5158487},"labels":[],"label_agreement":null},{"id":"W2946767906","doi":"10.1007/978-3-030-19212-9_33","title":"Metric Hybrid Factored Planning in Nonlinear Domains with Constraint Generation","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical optimization; Metric (unit); Computer science; Nonlinear system; Leverage (statistics); Solver; Nonlinear programming; Artificial intelligence; Mathematics","score_opus":0.022457740780019882,"score_gpt":0.24290758183309846,"score_spread":0.22044984105307858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946767906","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002671707,0.00044414584,0.9934701,0.00026220907,0.0009294992,0.0004319359,0.00001336739,0.00013193028,0.0016451108],"genre_scores_gemma":[0.48450524,0.000009513627,0.51424396,0.00071969646,0.00031770757,0.0000050537465,0.00003398163,0.000033064447,0.00013175073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962265,0.00005630862,0.00053429144,0.0015119285,0.0009508642,0.0007200914],"domain_scores_gemma":[0.997726,0.00062207767,0.00033904138,0.0009997009,0.00016404911,0.0001490813],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001029443,0.0005464736,0.000581069,0.0016116361,0.00020308087,0.00059893855,0.0019068167,0.00024030686,0.000012035548],"category_scores_gemma":[0.00007424082,0.00046355327,0.000077566736,0.0009290393,0.00036001127,0.0005802134,0.0004741044,0.0010871047,0.000028189419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014349268,0.000032719647,0.0024226978,0.000057149533,0.000020244637,0.0005676804,0.0014342149,0.7663058,0.00025022976,0.0040432485,0.000031492105,0.22482015],"study_design_scores_gemma":[0.00052647095,0.00030955469,0.00026617406,0.00071864406,0.000006748992,0.00015257653,4.0689844e-7,0.99150735,0.0013159068,0.0038605877,0.0005908396,0.00074474304],"about_ca_topic_score_codex":0.000047181795,"about_ca_topic_score_gemma":0.000060915005,"teacher_disagreement_score":0.48183355,"about_ca_system_score_codex":0.0003558554,"about_ca_system_score_gemma":0.0011594496,"threshold_uncertainty_score":0.9997816},"labels":[],"label_agreement":null},{"id":"W2947517210","doi":"10.48550/arxiv.1905.11346","title":"Error Analysis and Correction for Weighted A*'s Suboptimality (Extended Version)","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Variety (cybernetics); Upper and lower bounds; Mathematical optimization; Scale (ratio); Mathematics; Branch and bound; Computer science; Algorithm; Statistics; Mathematical analysis; Physics","score_opus":0.04793379003341202,"score_gpt":0.20055910490347606,"score_spread":0.15262531487006403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947517210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20420007,0.00005050617,0.79357404,0.00009818739,0.0009091173,0.00030062042,0.000049001497,0.00021224463,0.0006062311],"genre_scores_gemma":[0.98881704,0.000039114755,0.008031858,0.00007797574,0.000038561622,0.000001428095,0.00016433037,0.00001190579,0.0028177812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980489,0.00015588175,0.00018801523,0.0011951736,0.00008823932,0.00032380605],"domain_scores_gemma":[0.99807805,0.00035809868,0.00029984568,0.00092260883,0.00019469352,0.00014671255],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046568998,0.00028488578,0.00043674724,0.0005061157,0.00026598494,0.00014796283,0.0007943272,0.0003533419,0.000028190228],"category_scores_gemma":[0.000035371915,0.0003245556,0.0002865324,0.0009104944,0.000059191196,0.00032662405,0.0007575931,0.0004601963,0.000032029573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031394916,0.00015402514,0.08508074,0.00029679653,0.0016929744,0.000086786145,0.0005919242,0.88847065,0.000031737527,0.016074434,0.0047404096,0.0024655908],"study_design_scores_gemma":[0.00044444946,0.00008091718,0.0091942465,0.000049398524,0.00060147914,0.0000014204143,0.000039799223,0.9834609,0.00007277179,0.005084705,0.0005856349,0.00038425418],"about_ca_topic_score_codex":0.0003793507,"about_ca_topic_score_gemma":0.000052231335,"teacher_disagreement_score":0.7855422,"about_ca_system_score_codex":0.0001491405,"about_ca_system_score_gemma":0.00015668917,"threshold_uncertainty_score":0.99992067},"labels":[],"label_agreement":null},{"id":"W2950517718","doi":"10.48550/arxiv.1206.3285","title":"Dyna-Style Planning with Linear Function Approximation and Prioritized\\n Sweeping","year":2012,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Style (visual arts); Function (biology); Computer science; Art; Visual arts; Evolutionary biology","score_opus":0.06890680029640579,"score_gpt":0.18694204786523974,"score_spread":0.11803524756883395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950517718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23933268,0.0005502175,0.75675154,0.00006698075,0.0005983392,0.0004813795,0.000010341813,0.00029540496,0.0019131458],"genre_scores_gemma":[0.98381555,0.00012503697,0.014569052,0.000098790486,0.00038490843,0.0000024815458,0.00006907734,0.000049790342,0.0008853206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99615276,0.00037829723,0.00044909213,0.0018430286,0.000240834,0.0009359898],"domain_scores_gemma":[0.9969776,0.00035953237,0.00079561083,0.001090258,0.0003018625,0.00047513578],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011047529,0.0007261701,0.0006475971,0.00047376694,0.0010323753,0.0003921164,0.00087140076,0.00059936056,0.000038278064],"category_scores_gemma":[0.000047713955,0.0008240389,0.00015252935,0.0009538562,0.00023719041,0.0016942577,0.0011277379,0.001412628,0.00007436861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008644955,0.00022598135,0.07088516,0.0012687471,0.0004938427,0.00035651802,0.007889149,0.86476475,0.0001584655,0.040292516,0.00007846099,0.012721912],"study_design_scores_gemma":[0.0013761341,0.00027970597,0.006342237,0.0015709024,0.000390069,0.000052479056,0.0005543122,0.98532,0.000063192296,0.0020437124,0.00088800484,0.0011192731],"about_ca_topic_score_codex":0.00019753256,"about_ca_topic_score_gemma":0.000010724538,"teacher_disagreement_score":0.7444829,"about_ca_system_score_codex":0.0002725109,"about_ca_system_score_gemma":0.00031373682,"threshold_uncertainty_score":0.99942106},"labels":[],"label_agreement":null},{"id":"W2951033459","doi":"10.1017/s0263574720000521","title":"ARCog: An Aerial Robotics Cognitive Architecture","year":2020,"lang":"en","type":"article","venue":"Robotica","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Robotics; Artificial intelligence; Key (lock); Computer science; Architecture; Cognitive architecture; Human–computer interaction; Field (mathematics); Cognition; Cognitive robotics; Robot; Systems engineering; Engineering; Computer security","score_opus":0.031552599152811896,"score_gpt":0.25150263643828896,"score_spread":0.21995003728547707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951033459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012395607,0.00007036916,0.98562974,0.0105337845,0.00025299267,0.00013125289,0.0000063996777,0.0003875721,0.00174835],"genre_scores_gemma":[0.77193284,0.0000020003502,0.22425732,0.003266524,0.0004542099,0.0000041281546,0.000019943403,0.000016811851,0.000046222973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985951,0.00014290253,0.00018349144,0.00046062414,0.0002492659,0.0003686127],"domain_scores_gemma":[0.99901885,0.00022460603,0.00006407687,0.00027784382,0.00007000059,0.00034459648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014865618,0.00017482546,0.0001971159,0.000042438194,0.00017104915,0.00020078929,0.00065633096,0.000092388604,0.000032930417],"category_scores_gemma":[0.0001835107,0.00016395746,0.000059330618,0.00030397146,0.000052016163,0.0002268565,0.00018216186,0.0003663462,0.00016141123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016324231,0.00020170276,0.0014972227,0.00011541441,0.00011295022,0.0003724969,0.014540294,0.831333,0.0022926296,0.07958181,0.0029569317,0.066832334],"study_design_scores_gemma":[0.0013635748,0.001319319,0.0011380628,0.00017371408,0.00006737175,0.00007288916,0.00013862678,0.98144037,0.0017702782,0.008730855,0.002817778,0.0009671884],"about_ca_topic_score_codex":0.000010085294,"about_ca_topic_score_gemma":0.0000030171143,"teacher_disagreement_score":0.7706933,"about_ca_system_score_codex":0.00001114231,"about_ca_system_score_gemma":0.00011040239,"threshold_uncertainty_score":0.66859907},"labels":[],"label_agreement":null},{"id":"W2952418015","doi":"10.48550/arxiv.1302.6799","title":"Integrating Planning and Execution in Stochastic Domains","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Interleaving; Computer science; Markov decision process; Heuristic; Construct (python library); Mathematical optimization; Plan (archaeology); Function (biology); Bellman equation; Markov process; Artificial intelligence; Mathematics; Programming language","score_opus":0.05542457323309275,"score_gpt":0.1905143304958521,"score_spread":0.13508975726275935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952418015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3784681,0.00013564802,0.6202608,0.000043177664,0.00016069242,0.00014129415,0.000002398439,0.00011762827,0.00067031785],"genre_scores_gemma":[0.99310535,0.000010851099,0.006549457,0.000051882114,0.00003588687,0.0000015279101,0.000011711829,0.000010817105,0.00022253001],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847704,0.00013232902,0.00018858285,0.0008036172,0.00006593127,0.00033250832],"domain_scores_gemma":[0.99891794,0.00023398559,0.00019320958,0.00048211744,0.000055402455,0.00011736995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033218492,0.00025440493,0.00026053816,0.00034514413,0.00015539613,0.00018925773,0.00071473623,0.00024338627,0.00000650227],"category_scores_gemma":[0.00005671824,0.0002867403,0.000054499884,0.00035402225,0.00006250786,0.00038925014,0.0010226296,0.0007972652,0.000018800058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012103085,0.000026447855,0.012907065,0.0000695082,0.000025609595,0.0002458978,0.002440308,0.88015676,0.000041839536,0.10285033,0.00014627194,0.0010778768],"study_design_scores_gemma":[0.00028708795,0.00003590151,0.0023928133,0.0006415987,0.000014024966,0.000007661958,0.00022656035,0.9555817,0.000010180216,0.040446624,0.000024826651,0.000331023],"about_ca_topic_score_codex":0.00051701197,"about_ca_topic_score_gemma":0.000031345386,"teacher_disagreement_score":0.61463726,"about_ca_system_score_codex":0.00014842775,"about_ca_system_score_gemma":0.000112831905,"threshold_uncertainty_score":0.99995846},"labels":[],"label_agreement":null},{"id":"W2953350284","doi":"10.1109/icse.1998.671342","title":"Measuring cognitive activities in software engineering","year":2002,"lang":"en","type":"preprint","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Coding (social sciences); Computer science; Software; Software engineering; Software development; Cognition; Multidisciplinary approach; Data science; Psychology","score_opus":0.044120017681237515,"score_gpt":0.22024522462593524,"score_spread":0.17612520694469772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953350284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034865167,0.0008221088,0.95970666,0.000098536126,0.00058963784,0.00020790307,0.000010602106,0.00080883014,0.0028905624],"genre_scores_gemma":[0.8912002,0.000026349675,0.1078476,0.00008526558,0.000083388986,0.00005354883,0.000008533923,0.000023262726,0.00067187654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984426,0.000055273762,0.000248656,0.00057991367,0.0002775926,0.00039594664],"domain_scores_gemma":[0.9988878,0.00051855884,0.00009366758,0.00038021582,0.00004430013,0.000075468895],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032973505,0.00029105035,0.00030703834,0.00033510147,0.000058467496,0.00027595033,0.00070468907,0.00022771933,0.000039222017],"category_scores_gemma":[0.00021366456,0.00030981624,0.000085638305,0.00019123741,0.0000138776495,0.00027719792,0.0009742841,0.0009507768,0.000030350893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003195573,0.00038073267,0.09802181,0.00360007,0.00044727567,0.001147604,0.032463327,0.6338065,0.00020983498,0.0066682687,0.002227162,0.22099541],"study_design_scores_gemma":[0.0006805797,0.000064981046,0.008332776,0.0059541445,0.000021619824,0.00003752636,0.00017441489,0.9765527,0.0040000095,0.0016779792,0.0006229141,0.0018803497],"about_ca_topic_score_codex":0.00014849936,"about_ca_topic_score_gemma":0.000016578848,"teacher_disagreement_score":0.856335,"about_ca_system_score_codex":0.00010070795,"about_ca_system_score_gemma":0.0000864493,"threshold_uncertainty_score":0.9999354},"labels":[],"label_agreement":null},{"id":"W2963546679","doi":"10.1049/iet-rsn.2018.5276","title":"Multifunction cognitive radar task scheduling using Monte Carlo tree search and policy networks","year":2018,"lang":"en","type":"article","venue":"IET Radar Sonar & Navigation","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Defence Research and Development Canada","keywords":"Monte Carlo tree search; Computer science; Monte Carlo method; Scheduling (production processes); Task (project management); Radar; Tree (set theory); Mathematical optimization; Engineering; Systems engineering; Mathematics; Statistics; Telecommunications","score_opus":0.024500120678899222,"score_gpt":0.28766979659517794,"score_spread":0.2631696759162787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963546679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48374075,0.00047263887,0.5148933,0.00030067857,0.00020838014,0.00017380998,0.000007287866,0.00013266268,0.0000705232],"genre_scores_gemma":[0.90899307,0.000016808533,0.08994382,0.00016468669,0.0007762317,0.0000048900947,0.000031318512,0.000021023277,0.000048136742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982254,0.00019915093,0.00026480216,0.0005209111,0.0003569282,0.00043280833],"domain_scores_gemma":[0.9990395,0.00018414632,0.0001231393,0.00023654992,0.00026975214,0.00014696442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065749657,0.0002083048,0.00018542573,0.00015493904,0.00068257505,0.00025517875,0.00022388317,0.0001574426,0.0000030605613],"category_scores_gemma":[0.00005331968,0.00021838942,0.000052033374,0.0006404834,0.00014021203,0.00075246487,0.00013152495,0.0003432335,0.0000145103195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020892957,0.000098829485,0.009502826,0.00009844136,0.00015868603,0.00006943807,0.01434171,0.028296007,0.013808584,0.0017601127,0.00025722745,0.9313992],"study_design_scores_gemma":[0.00068472256,0.00019810176,0.0033896957,0.0004114022,0.000027994023,0.000062029714,0.00022423179,0.99236447,0.0017966286,0.00026916916,0.00029549308,0.000276036],"about_ca_topic_score_codex":0.0016330081,"about_ca_topic_score_gemma":0.00003845358,"teacher_disagreement_score":0.9640685,"about_ca_system_score_codex":0.0001301399,"about_ca_system_score_gemma":0.00018856396,"threshold_uncertainty_score":0.89056623},"labels":[],"label_agreement":null},{"id":"W2964981248","doi":"10.1609/icaps.v29i1.3462","title":"Relaxed BDDs: An Admissible Heuristic for Delete-Free Planning Based on a Discrete Relaxation","year":2021,"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":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Binary decision diagram; Heuristic; Computer science; Task (project management); Relaxation (psychology); Algorithm; State (computer science); Computation; Theoretical computer science; Binary number; Mathematical optimization; Mathematics; Artificial intelligence; Arithmetic","score_opus":0.04687297143215736,"score_gpt":0.3066115264322689,"score_spread":0.25973855500011156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964981248","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8712243,0.00019771022,0.10933499,0.008096627,0.0008914775,0.00041815636,0.00006113527,0.0011003338,0.008675292],"genre_scores_gemma":[0.9220948,0.0000029644061,0.077213794,0.00040994494,0.000059911985,0.00002721804,0.000033542714,0.000018586099,0.00013924463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820703,0.000029904691,0.0003965013,0.0005561497,0.00052562146,0.00028476227],"domain_scores_gemma":[0.99820447,0.00038475945,0.00043979724,0.0002486298,0.0006021468,0.00012021059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006850284,0.00023247323,0.00023602822,0.00019144762,0.0003778386,0.00052194606,0.0011061503,0.00013089774,0.0000077045515],"category_scores_gemma":[0.0015540202,0.00019376773,0.000080971804,0.00026415806,0.00004330413,0.00042214838,0.00018227978,0.00035463463,0.0000015448884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015444326,0.0005183867,0.054380335,0.0008867947,0.00040021632,0.00006777111,0.0101589095,0.37520382,0.09429538,0.45060235,0.0046086726,0.007332922],"study_design_scores_gemma":[0.0007365694,0.00025263394,0.0018423204,0.002202069,0.00001870599,0.000019849213,0.00032361486,0.97448945,0.01359444,0.006187723,0.0000984279,0.00023418273],"about_ca_topic_score_codex":0.000010635646,"about_ca_topic_score_gemma":4.883232e-7,"teacher_disagreement_score":0.59928566,"about_ca_system_score_codex":0.00005355068,"about_ca_system_score_gemma":0.00021334772,"threshold_uncertainty_score":0.79016185},"labels":[],"label_agreement":null},{"id":"W2965027281","doi":"10.24963/ijcai.2019/174","title":"Iterative Budgeted Exponential Search","year":2019,"lang":"en","type":"preprint","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Compute Canada; University of Denver","keywords":"Iterative deepening depth-first search; Search tree; Omega; Overhead (engineering); Tree (set theory); Heuristic; Mathematical optimization; Graph; Exponential function; Search algorithm; Computer science; Upper and lower bounds; Limit (mathematics); Mathematics; Branch and bound; Combinatorics; Algorithm; Discrete mathematics; Beam search; Incremental heuristic search","score_opus":0.030869395788688782,"score_gpt":0.2753862092209154,"score_spread":0.24451681343222662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965027281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010546772,0.00022069825,0.9631862,0.0010824233,0.0016875452,0.0003344645,0.000014286749,0.00044703984,0.022480542],"genre_scores_gemma":[0.8628309,0.0000112726975,0.12609796,0.0005092756,0.00023511758,0.000025848127,0.00009774192,0.000021498272,0.010170423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978785,0.00021053586,0.00026737375,0.00081464293,0.00042995444,0.00039902912],"domain_scores_gemma":[0.99834645,0.000195855,0.00009991885,0.001090182,0.00015835522,0.00010923684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004994357,0.00027163193,0.00029656204,0.00018743883,0.000116369185,0.00065493194,0.0015812464,0.00027952626,0.00017629743],"category_scores_gemma":[0.000020884965,0.00024175787,0.00013170404,0.000163709,0.000027400429,0.00021152584,0.0024088304,0.00093311653,0.0006895809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016822529,0.0006136826,0.015683731,0.0021166774,0.0012155769,0.0006070956,0.06099101,0.39428055,0.0056813722,0.17388743,0.22246276,0.122291885],"study_design_scores_gemma":[0.00041037062,0.00013113335,0.00079871,0.0003688037,0.000012868608,0.00001291081,0.000045441186,0.9832536,0.005937075,0.0038738188,0.0043252893,0.00082999916],"about_ca_topic_score_codex":0.0002092507,"about_ca_topic_score_gemma":0.0000032450519,"teacher_disagreement_score":0.8522841,"about_ca_system_score_codex":0.000055964963,"about_ca_system_score_gemma":0.00036914524,"threshold_uncertainty_score":0.98586},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.034693092630761306,"score_gpt":0.2746181787677578,"score_spread":0.23992508613699648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965569070","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98099864,0.000070805116,0.0040118922,0.0010645646,0.0003581318,0.00014229567,0.0000029160453,0.00035399865,0.012996769],"genre_scores_gemma":[0.98255146,0.000009315697,0.0169172,0.00013964003,0.000018647579,0.0000071873424,0.0000034679585,0.000009773821,0.0003432868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868107,0.000019625293,0.0003283138,0.0003779216,0.00035724134,0.0002358501],"domain_scores_gemma":[0.99925286,0.000115869756,0.00028077056,0.00009901668,0.00020402698,0.00004746944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006094693,0.00017105769,0.0002185737,0.00020936906,0.00009388377,0.00023464626,0.000980353,0.00009863582,0.000011960562],"category_scores_gemma":[0.00011613791,0.00013487671,0.0000467667,0.00022165768,0.000031407024,0.0005794755,0.00030687204,0.0004998436,0.000007781716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020377748,0.000110900466,0.21220276,0.00020762088,0.00009449525,0.000008791258,0.009092001,0.5188761,0.073684774,0.1837224,0.00019763938,0.0015987513],"study_design_scores_gemma":[0.00032668418,0.000089985755,0.00082461326,0.0013947684,0.0000028134707,0.000008960975,0.0004902803,0.98590094,0.0041952212,0.0065762913,0.000032599477,0.00015682803],"about_ca_topic_score_codex":0.00004468288,"about_ca_topic_score_gemma":3.5102073e-7,"teacher_disagreement_score":0.46702486,"about_ca_system_score_codex":0.000035239987,"about_ca_system_score_gemma":0.000061643645,"threshold_uncertainty_score":0.5500113},"labels":[],"label_agreement":null},{"id":"W2965757681","doi":"10.1609/socs.v10i1.18512","title":"Error Analysis and Correction for Weighted A*’s Suboptimality","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Universidad Carlos III de Madrid","keywords":"Heuristics; Variety (cybernetics); Upper and lower bounds; Mathematics; Mathematical optimization; Computer science; Scale (ratio); Branch and bound; Algorithm; Statistics; Mathematical analysis; Physics","score_opus":0.0169845282633852,"score_gpt":0.2713468938108689,"score_spread":0.2543623655474837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965757681","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9549646,0.000042308464,0.00939329,0.018337099,0.008517249,0.0003893808,0.000030576615,0.00011106911,0.00821445],"genre_scores_gemma":[0.9966197,0.0000078850735,0.0024518662,0.00011910855,0.0001632532,0.000018494979,0.000008416714,0.000006524019,0.0006047488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99870056,0.000019778867,0.00021925957,0.00034625948,0.00054762117,0.00016651792],"domain_scores_gemma":[0.9984908,0.00029542894,0.00013186652,0.0001239249,0.00090184395,0.00005613259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070186734,0.00010092311,0.00016379751,0.000107271895,0.00019396124,0.00022699177,0.0007239696,0.000072339084,0.000009479169],"category_scores_gemma":[0.00017659711,0.00008311585,0.00012628654,0.0006328518,0.00004066552,0.0002228329,0.00030604724,0.00018731137,0.0000013652228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053403294,0.0006136302,0.12580402,0.00013825546,0.0013589368,0.0000024790866,0.001694522,0.0011122881,0.08084424,0.7756904,0.008508721,0.0036985185],"study_design_scores_gemma":[0.0016566905,0.0003649406,0.013253064,0.00013481804,0.00017851555,0.000013291232,0.00010177278,0.4363423,0.5127901,0.030198205,0.004620167,0.00034612275],"about_ca_topic_score_codex":0.00010385029,"about_ca_topic_score_gemma":0.000003481293,"teacher_disagreement_score":0.74549216,"about_ca_system_score_codex":0.00008944239,"about_ca_system_score_gemma":0.000065419124,"threshold_uncertainty_score":0.3389366},"labels":[],"label_agreement":null},{"id":"W2966236725","doi":"","title":"On the Relationship Between Satisfiability and Markov Decision Processes.","year":2019,"lang":"en","type":"article","venue":"Uncertainty in Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Satisfiability; Markov process; Markov chain; Markov decision process; Boolean satisfiability problem; Theoretical computer science; Algorithm; Mathematics; Machine learning; Statistics","score_opus":0.0628719743448886,"score_gpt":0.3038967491543022,"score_spread":0.2410247748094136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966236725","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7674216,0.00006496286,0.22889769,0.0021865903,0.00016945791,0.00036148683,0.0000042172433,0.00006492827,0.0008290809],"genre_scores_gemma":[0.99581826,0.0000039088054,0.0038368094,0.00024322112,0.000030817522,0.000015374324,0.00000293473,0.0000059006165,0.000042749078],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983831,0.00017985229,0.000395295,0.00046974444,0.00029783702,0.00027416126],"domain_scores_gemma":[0.98641187,0.012796313,0.00009688078,0.00055035576,0.000080620266,0.00006395024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016768753,0.00014595958,0.00015879299,0.000113786846,0.000193813,0.00018971841,0.0006209235,0.000091751324,0.00005407703],"category_scores_gemma":[0.0032980603,0.00010547179,0.000028649434,0.0007615022,0.00009091165,0.00021913524,0.0001343575,0.00038610742,0.00020806387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004348467,0.000037782524,0.44987854,0.000045558427,0.00000389044,0.00000310771,0.002127273,0.01853644,0.000016006083,0.3856311,0.00012020149,0.14355661],"study_design_scores_gemma":[0.00003324817,0.00013985907,0.059436444,0.00028537025,0.0000028183863,0.000001783118,0.0001857865,0.10036164,0.0005040348,0.8386797,0.00013938124,0.00022998985],"about_ca_topic_score_codex":0.00019937835,"about_ca_topic_score_gemma":0.00017094953,"teacher_disagreement_score":0.45304853,"about_ca_system_score_codex":0.00006590353,"about_ca_system_score_gemma":0.00011642172,"threshold_uncertainty_score":0.43010145},"labels":[],"label_agreement":null},{"id":"W2966640145","doi":"10.1017/s1471068419000395","title":"Domain-Independent Cost-Optimal Planning in ASP","year":2019,"lang":"en","type":"article","venue":"Theory and Practice of Logic Programming","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Planner; Job shop scheduling; Answer set programming; Motion planning","score_opus":0.02277286717745461,"score_gpt":0.29907783561434914,"score_spread":0.27630496843689456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966640145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24586877,0.0033197238,0.72087497,0.001111061,0.0003379782,0.00078904594,0.0000015213872,0.00019559554,0.027501335],"genre_scores_gemma":[0.82108885,0.000013206017,0.17849858,0.0002643738,0.000020790758,0.0000146214015,0.000002334296,0.0000069703347,0.000090301175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803185,0.0007538069,0.00028474384,0.00035098082,0.00022443083,0.00035417834],"domain_scores_gemma":[0.9958709,0.0034275868,0.00026927303,0.00030971112,0.00004909226,0.0000734618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006518561,0.000148119,0.00022428427,0.00012108366,0.00009403794,0.00013082467,0.00039876095,0.00009892987,0.00001900519],"category_scores_gemma":[0.0003992153,0.00013203254,0.00003630824,0.0002496791,0.00005631079,0.00088817574,0.0002076419,0.00037050617,0.00002060483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007130216,0.00016491432,0.007151572,0.000121544515,0.000047078207,0.00021422384,0.010621882,0.0030339493,0.00090197526,0.77393544,0.00001535134,0.20307904],"study_design_scores_gemma":[0.011367161,0.0070418357,0.008959646,0.0032850998,0.00024463068,0.0038449208,0.052448295,0.02178314,0.004464419,0.53607804,0.3464372,0.004045654],"about_ca_topic_score_codex":0.000019341634,"about_ca_topic_score_gemma":5.962787e-7,"teacher_disagreement_score":0.57522005,"about_ca_system_score_codex":0.000021896367,"about_ca_system_score_gemma":0.00005366557,"threshold_uncertainty_score":0.53841305},"labels":[],"label_agreement":null},{"id":"W2973918868","doi":"10.4204/eptcs.306.20","title":"Mutex Graphs and Multicliques: Reducing Grounding Size for Planning","year":2019,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Semaphore; Mutual exclusion; Bottleneck; Graph; Representation (politics); Operator (biology)","score_opus":0.005906480353639804,"score_gpt":0.2485408980229939,"score_spread":0.2426344176693541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973918868","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62141967,0.0002327642,0.37579373,0.00054616656,0.00031369145,0.00047402154,5.379175e-7,0.0002557785,0.00096363697],"genre_scores_gemma":[0.8681087,0.000007660777,0.1314619,0.00031480333,0.00005089226,0.000027252228,4.39509e-7,0.000014586443,0.000013754875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965922,0.000025879785,0.00037224026,0.0011775444,0.00045005727,0.0013820525],"domain_scores_gemma":[0.9983235,0.00091481785,0.00013190474,0.00027392924,0.00016261831,0.00019320098],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036290577,0.0002664172,0.00030840858,0.00033779524,0.00042417028,0.000766539,0.0015725325,0.00009878519,0.000005230907],"category_scores_gemma":[0.0003582467,0.0002467137,0.000058089354,0.0012563196,0.00058934756,0.0013320554,0.0005576147,0.000513401,0.0000052195765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020824133,0.000022442235,0.0029751896,0.000055757035,0.0000048536667,0.0000021637873,0.0022396275,0.00018790967,0.0025900581,0.98350495,0.00002179793,0.008374408],"study_design_scores_gemma":[0.0005885059,0.0005035033,0.0011954997,0.00030865145,0.000004089835,0.000063604086,0.00004963896,0.68126976,0.002993368,0.3125565,0.000111974725,0.00035491114],"about_ca_topic_score_codex":0.000005885439,"about_ca_topic_score_gemma":2.3542422e-7,"teacher_disagreement_score":0.68108183,"about_ca_system_score_codex":0.00021533259,"about_ca_system_score_gemma":0.00022588656,"threshold_uncertainty_score":0.9999985},"labels":[],"label_agreement":null},{"id":"W2975721124","doi":"10.36001/phmconf.2019.v11i1.857","title":"Model-based On-board Decision Making for Autonomous Aircraft","year":2019,"lang":"en","type":"article","venue":"Annual Conference of the PHM Society","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institute for Advanced Research","keywords":"Prognostics; Component (thermodynamics); Backtracking; Contingency; Computer science; Fault (geology); Construct (python library); Fault detection and isolation; Contingency plan; Software; Engineering; Systems engineering; Artificial intelligence; Reliability engineering; Data mining; Computer security","score_opus":0.02731470898130036,"score_gpt":0.27185078298117293,"score_spread":0.24453607399987257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975721124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06521535,0.000024531742,0.9312198,0.0016316703,0.0003619706,0.00034431298,0.00004771919,0.00009533889,0.0010592914],"genre_scores_gemma":[0.85728043,0.0000012300727,0.14111865,0.0012119653,0.0000228691,0.000013619168,0.0000022867423,0.000010342184,0.00033862703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986894,0.00004371079,0.00024023135,0.0003813901,0.00033134292,0.00031388656],"domain_scores_gemma":[0.9980948,0.00059743697,0.00018673655,0.0007756321,0.0002964557,0.00004894272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005202403,0.00016954636,0.00022084186,0.000025807882,0.00020446611,0.00010190073,0.0013774605,0.00011689161,0.000012419794],"category_scores_gemma":[0.000075287695,0.00012545624,0.0003375078,0.00017220802,0.00006024742,0.00024273653,0.00022870497,0.0002133349,0.00001761682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013240335,0.00020194537,0.005386521,0.00022492232,0.00008332103,0.0000010799373,0.019779548,0.83138454,0.0010412051,0.040453218,0.026796453,0.07451484],"study_design_scores_gemma":[0.00037719076,0.00015280415,0.00034789785,0.00025984863,0.00000890075,6.190196e-7,0.00014576611,0.9868427,0.0006510139,0.0103332065,0.0007075469,0.00017249293],"about_ca_topic_score_codex":0.000012612798,"about_ca_topic_score_gemma":0.0000018923059,"teacher_disagreement_score":0.7920651,"about_ca_system_score_codex":0.000049370872,"about_ca_system_score_gemma":0.000409257,"threshold_uncertainty_score":0.5115957},"labels":[],"label_agreement":null},{"id":"W3011683765","doi":"10.1613/jair.1.11659","title":"Solving Delete Free Planning with Relaxed Decision Diagram Based Heuristics","year":2020,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Binary decision diagram; Computer science; Leverage (statistics); Task (project management); Heuristic; Representation (politics); Mathematical optimization; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.19278465288359,"score_gpt":0.3880335451590027,"score_spread":0.19524889227541267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011683765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03021815,0.0004755991,0.96394885,0.0047411416,0.00020592827,0.00013467178,0.000002442443,0.000051301762,0.00022192115],"genre_scores_gemma":[0.7827076,0.000023930355,0.2166831,0.00020761468,0.00034823266,0.000002398,7.312487e-7,0.000018735807,0.000007669335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99583757,0.0003937468,0.000854191,0.00037972743,0.0018458165,0.00068896357],"domain_scores_gemma":[0.99437386,0.0030009325,0.0003519157,0.0005050061,0.0012459424,0.0005223196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041449196,0.00018909405,0.00033723132,0.00043973222,0.00049765577,0.00063236535,0.0022316675,0.000118043594,0.000035096356],"category_scores_gemma":[0.0042825104,0.00014711982,0.00011726256,0.0015486609,0.00016135274,0.0005553955,0.00032972172,0.0016032071,0.000057625588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016471426,0.00028663262,0.00597448,0.00014449554,0.00010312648,0.003534084,0.008422214,0.34011626,0.0064761327,0.013545262,0.011413755,0.6083364],"study_design_scores_gemma":[0.0001438913,0.002469205,0.00015117356,0.00076494575,0.000012453318,0.00007332097,0.00059180305,0.95494974,0.021227514,0.01783551,0.001502096,0.00027837796],"about_ca_topic_score_codex":0.000024838138,"about_ca_topic_score_gemma":0.0000073899223,"teacher_disagreement_score":0.75248945,"about_ca_system_score_codex":0.000097401884,"about_ca_system_score_gemma":0.0007357866,"threshold_uncertainty_score":0.6965226},"labels":[],"label_agreement":null},{"id":"W3013078743","doi":"10.1007/978-3-030-38561-3_5","title":"KEPS Book: Planning.Domains","year":2020,"lang":"en","type":"book-chapter","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Problem solver; Computer science; Path (computing); Solver; Data science; Operations research; Software engineering; Engineering ethics; Engineering management; Management science; Engineering; Programming language","score_opus":0.028756921480777423,"score_gpt":0.23147034213238954,"score_spread":0.20271342065161213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013078743","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.2867962e-7,0.0019374598,0.24408826,0.0026260926,0.00035406233,0.00012147149,0.000011291137,0.0006950887,0.75016606],"genre_scores_gemma":[0.00035604258,0.000045793797,0.043490317,0.010736097,0.00043398797,0.000005964431,0.000052910334,0.00006719309,0.9448117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980385,0.000016847174,0.0003590939,0.00078967825,0.00044118095,0.00035471673],"domain_scores_gemma":[0.9985247,0.00018777339,0.00020738198,0.0007653194,0.000054324082,0.00026049017],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016886619,0.00044101823,0.00042632307,0.00014348257,0.00018469461,0.00023506714,0.0013575314,0.0003553325,0.0005438753],"category_scores_gemma":[0.000017414706,0.0004124502,0.00018872453,0.000049962182,0.000048960075,0.00024408406,0.0004465927,0.0007113941,0.0016115609],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048419174,0.0000036805247,0.000012114679,0.00003646351,0.000056724,0.0003598172,0.00057458086,0.00010143023,0.0000056254826,0.7398038,0.2556488,0.003392159],"study_design_scores_gemma":[0.00014918437,0.00011502484,0.0000051155216,0.00024515024,0.000017863242,0.00003222304,0.000003281081,0.0053728432,0.000029323668,0.022495003,0.9709787,0.0005563251],"about_ca_topic_score_codex":0.000008328214,"about_ca_topic_score_gemma":7.9593536e-7,"teacher_disagreement_score":0.71730876,"about_ca_system_score_codex":0.00004620027,"about_ca_system_score_gemma":0.00018111376,"threshold_uncertainty_score":0.99983275},"labels":[],"label_agreement":null},{"id":"W3014489768","doi":"10.1017/9781108164085.013","title":"Learning to Act","year":2017,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Transformational leadership; Appeal; Computer science; Artificial intelligence; Space (punctuation); Comprehension; Cognitive science; Mathematics education; Psychology; Social psychology","score_opus":0.024920857350787314,"score_gpt":0.2092663257038962,"score_spread":0.1843454683531089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014489768","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031784464,0.000057584755,0.029068777,0.00007242371,0.00033091402,0.00021095898,0.00002461511,0.0003734919,0.96982944],"genre_scores_gemma":[0.0019170978,0.00001464815,0.0025907918,0.000106425214,0.00012470952,4.0883333e-7,0.000015256642,0.00003121213,0.99519944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99845403,0.000044996308,0.00013781188,0.0006963539,0.0002941744,0.00037260685],"domain_scores_gemma":[0.99805737,0.000105918996,0.0002736839,0.0011408431,0.0001314365,0.00029073696],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020490521,0.00035056708,0.00035325013,0.00022011144,0.00073798356,0.00029442584,0.0022252316,0.00030690376,0.0000025605302],"category_scores_gemma":[0.000029248473,0.00042586308,0.00017406195,0.0000053556932,0.000076307384,0.000212802,0.0012126279,0.0007766948,0.00010785702],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002936168,0.0000037050393,0.000011427034,0.000054780907,0.000090404465,0.00076404767,0.0003881413,0.00014905428,0.000028966468,0.91876423,0.05646592,0.023249956],"study_design_scores_gemma":[0.00020168161,0.00010549865,0.000017565428,0.00032605877,0.00003933863,0.000016020473,0.0000059420445,0.00095062196,0.00010659897,0.00001535232,0.997714,0.0005013608],"about_ca_topic_score_codex":0.0001390792,"about_ca_topic_score_gemma":0.0000014776676,"teacher_disagreement_score":0.94124806,"about_ca_system_score_codex":0.00013249226,"about_ca_system_score_gemma":0.00017846367,"threshold_uncertainty_score":0.99981934},"labels":[],"label_agreement":null},{"id":"W3018946989","doi":"10.48550/arxiv.2004.12850","title":"Learning Neural-Symbolic Descriptive Planning Models via Cube-Space Priors: The Voyage Home (to STRIPS)","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Heuristics; Artificial intelligence; Domain (mathematical analysis); Representation (politics); Cube (algebra); Heuristic; Reinforcement learning; Theoretical computer science; Pruning; Machine learning; Mathematics","score_opus":0.10600036574044806,"score_gpt":0.19464949992286346,"score_spread":0.08864913418241539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3018946989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18392375,0.00021660695,0.81185716,0.0010020223,0.00050393795,0.00049062574,0.000012124851,0.0006912968,0.0013024467],"genre_scores_gemma":[0.99366784,0.000034854038,0.0044110036,0.0004466416,0.00016637283,0.0000039257097,0.00002148235,0.00005161383,0.0011962579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99617636,0.0006675182,0.00032154899,0.001772573,0.00025404646,0.0008079564],"domain_scores_gemma":[0.9971847,0.00047413065,0.00041813962,0.0012812017,0.00018754491,0.00045426452],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00063022616,0.00062746456,0.0005775983,0.00035956776,0.00087559316,0.0005178131,0.0035324185,0.00035339352,0.000011127658],"category_scores_gemma":[0.0001036152,0.000613486,0.00028836136,0.0012867427,0.00010577838,0.0007153616,0.003570319,0.0028952535,0.00012122345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005250696,0.000020775302,0.0012365398,0.000055743323,0.00009623552,0.0004945545,0.013357536,0.9694318,0.00013997572,0.013991607,0.0006362254,0.00048650155],"study_design_scores_gemma":[0.00031677165,0.00016455012,0.00038739093,0.00028701397,0.00007596174,0.000011292966,0.0009520223,0.97706854,0.00009920718,0.019244255,0.0006496301,0.00074337993],"about_ca_topic_score_codex":0.0003288503,"about_ca_topic_score_gemma":0.000008379445,"teacher_disagreement_score":0.8097441,"about_ca_system_score_codex":0.00027519363,"about_ca_system_score_gemma":0.0002904154,"threshold_uncertainty_score":0.99963164},"labels":[],"label_agreement":null},{"id":"W3022326288","doi":"10.1609/aaai.v26i1.8195","title":"Generalizing and Executing Plans","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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Plan (archaeology); Generalization; Computer science; Task (project management); Representation (politics); Key (lock); Process (computing); Order (exchange); Artificial intelligence; Management science; Operations research; Computer security; Systems engineering; Engineering; Programming language; Political science; Business; Mathematics","score_opus":0.07715901879387925,"score_gpt":0.2800754265498518,"score_spread":0.20291640775597253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022326288","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7988324,0.00046436526,0.1356309,0.017819762,0.0011409448,0.0004200779,0.000015379932,0.00035307626,0.04532308],"genre_scores_gemma":[0.9852023,0.000040420266,0.014026893,0.00037054846,0.000056837056,0.0000059674303,5.218966e-7,0.0000081089465,0.00028840956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99858075,0.000020635149,0.0003552062,0.00044434005,0.00029832104,0.00030073483],"domain_scores_gemma":[0.9989849,0.00012295021,0.00021635095,0.00022290237,0.00037322525,0.00007970838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004494214,0.00016252989,0.00019088623,0.000065279884,0.0002895102,0.00034391638,0.0008550909,0.00007132769,0.000022493197],"category_scores_gemma":[0.00032732764,0.00013042906,0.00006109645,0.0004451968,0.00011552443,0.000284574,0.00041822833,0.00026594198,0.000017224062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009834254,0.000035277335,0.0014114309,0.00004473805,0.000011728376,0.00000297042,0.002051866,0.000097680386,0.072699465,0.8716061,0.00018487142,0.051844027],"study_design_scores_gemma":[0.000024776711,0.00007551574,0.0002712816,0.00044409794,0.000010824791,0.000033659926,0.00071698753,0.10032501,0.7861642,0.11135806,0.00032443582,0.00025110252],"about_ca_topic_score_codex":0.000032051954,"about_ca_topic_score_gemma":0.000008287654,"teacher_disagreement_score":0.76024806,"about_ca_system_score_codex":0.000017914495,"about_ca_system_score_gemma":0.00010188235,"threshold_uncertainty_score":0.5318743},"labels":[],"label_agreement":null},{"id":"W3031211888","doi":"10.1007/s40745-020-00291-z","title":"Empowering Data Mining Sciences by Habitual Domains Theory, Part II: Reaching Wonderful Solutions","year":2020,"lang":"en","type":"article","venue":"Annals of Data Science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Management science; Computer science; Restructuring; Operations research; Decision analysis; Data science; Mathematics; Engineering; Political science; Mathematical economics","score_opus":0.31340056802892574,"score_gpt":0.39623512387785315,"score_spread":0.0828345558489274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3031211888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09002329,0.0028260548,0.8613955,0.036845934,0.00064353383,0.0002806904,0.001556837,0.00045353777,0.0059746206],"genre_scores_gemma":[0.87322277,0.00007980827,0.123693556,0.0026816966,0.00010851223,0.0000020612165,0.00016951714,0.000009658178,0.000032436204],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958841,0.0001609867,0.0004594604,0.0015943251,0.0010387321,0.0008623778],"domain_scores_gemma":[0.9959987,0.0005678062,0.0002950239,0.0026886095,0.00011691812,0.00033294974],"candidate_categories":["sts","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0093594445,0.00020069256,0.00024735936,0.00016070089,0.0022968329,0.0005790708,0.0153958835,0.00004699187,0.000016316366],"category_scores_gemma":[0.0020066805,0.00018412927,0.000030820232,0.0020071086,0.0013908446,0.009391739,0.011093044,0.00024880958,0.000015178186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049929662,0.00038502953,0.004754774,0.0001345092,0.000098447556,0.000048587277,0.027249536,0.00306303,0.03623821,0.1618094,0.5850586,0.18110995],"study_design_scores_gemma":[0.000389556,0.0007707864,0.0004249324,0.000489011,0.000026671698,0.000038220096,0.0020182906,0.8872532,0.0068183127,0.00327939,0.09746616,0.0010254221],"about_ca_topic_score_codex":0.000073288036,"about_ca_topic_score_gemma":0.000008740576,"teacher_disagreement_score":0.8841902,"about_ca_system_score_codex":0.0000100976495,"about_ca_system_score_gemma":0.00069834787,"threshold_uncertainty_score":0.99900204},"labels":[],"label_agreement":null},{"id":"W3035020106","doi":"","title":"Selective Dyna-style Planning Under Limited Model Capacity","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Style (visual arts); Geography","score_opus":0.09384211262854002,"score_gpt":0.297064049864816,"score_spread":0.20322193723627596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035020106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029742332,0.000030926785,0.9228,0.012527352,0.00018044506,0.00009323148,0.000013413576,0.00050146645,0.03411082],"genre_scores_gemma":[0.9780235,0.0000046471064,0.018557476,0.0027675969,0.00011512285,0.000009098393,0.00004439339,0.000016940734,0.00046120878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983236,0.00014119716,0.0002451615,0.00053296145,0.00047046228,0.00028661636],"domain_scores_gemma":[0.9990939,0.00018701337,0.00017977763,0.00016282845,0.00021535286,0.0001611297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024500058,0.00022073252,0.00018721008,0.00013808333,0.00024782142,0.000311262,0.0008995558,0.00008679031,0.00009309119],"category_scores_gemma":[0.0002770352,0.00021923347,0.000070671835,0.00024843458,0.00003185838,0.00040281223,0.00020369265,0.0010279276,0.000113182155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005400709,0.000028072343,0.0050610695,0.000008941558,0.000058564292,0.000015921918,0.003649914,0.8830871,0.0020121073,0.10254299,0.0002758704,0.0032054712],"study_design_scores_gemma":[0.0003370513,0.00016697755,0.0006554897,0.000078795616,0.000004160256,0.0000065081044,0.00007107262,0.99382114,0.00032608013,0.0036722755,0.00061322417,0.0002472232],"about_ca_topic_score_codex":0.00008036093,"about_ca_topic_score_gemma":0.0000047502563,"teacher_disagreement_score":0.94828117,"about_ca_system_score_codex":0.00008144814,"about_ca_system_score_gemma":0.00011155755,"threshold_uncertainty_score":0.8940081},"labels":[],"label_agreement":null},{"id":"W3035259124","doi":"10.24963/ijcai.2020/371","title":"Learning Neural-Symbolic Descriptive Planning Models via Cube-Space Priors: The Voyage Home (to STRIPS)","year":2020,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Heuristics; Artificial intelligence; Reinforcement learning; Domain (mathematical analysis); Heuristic; Pruning; Representation (politics); Cube (algebra); Theoretical computer science; Machine learning; Mathematics","score_opus":0.04303184532343465,"score_gpt":0.2366751059125522,"score_spread":0.19364326058911754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035259124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058379173,0.00031623917,0.92585677,0.010955473,0.00018188378,0.00030108276,0.0000018334522,0.00076965924,0.0032378612],"genre_scores_gemma":[0.96460944,0.0000040130744,0.030692318,0.0037413053,0.00015743537,0.00002026476,0.0000035912024,0.000028214243,0.000743386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764276,0.00030416055,0.0002975469,0.00068095705,0.00043417237,0.0006404242],"domain_scores_gemma":[0.9985679,0.0003972146,0.00012582955,0.00045805532,0.00008910655,0.0003618887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005444998,0.0002987702,0.00028228326,0.00010337884,0.0006746936,0.00051837304,0.0014407756,0.00009029889,0.000022289283],"category_scores_gemma":[0.00012854814,0.00022074036,0.00009715568,0.00088858855,0.00003832113,0.0008060334,0.0005646528,0.0008898642,0.0001496053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003489042,0.000016170019,0.0013808142,0.000022763044,0.000038099184,0.00007051125,0.08133271,0.8934708,0.0026773773,0.006927427,0.00583564,0.008192746],"study_design_scores_gemma":[0.0002310307,0.00029105024,0.0002907127,0.00005595414,0.0000100945645,0.000015506677,0.0014539353,0.9925457,0.00085605937,0.00095502485,0.002931681,0.0003632351],"about_ca_topic_score_codex":0.00011363788,"about_ca_topic_score_gemma":0.0000022622878,"teacher_disagreement_score":0.9062303,"about_ca_system_score_codex":0.000046234807,"about_ca_system_score_gemma":0.00008318225,"threshold_uncertainty_score":0.90015304},"labels":[],"label_agreement":null},{"id":"W3037289440","doi":"10.1609/icaps.v30i1.6672","title":"Predicting the Effectiveness of Bidirectional Heuristic Search","year":2020,"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":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Incremental heuristic search; Beam search; Heuristic; Bidirectional search; Computer science; Best-first search; Set (abstract data type); Search algorithm; Iterative deepening depth-first search; Artificial intelligence; Consistent heuristic; Space (punctuation); Mathematical optimization; Theoretical computer science; Algorithm; Mathematics","score_opus":0.04473747509593059,"score_gpt":0.28533179241940027,"score_spread":0.24059431732346967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037289440","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98947877,0.00008384689,0.0037730422,0.0024966714,0.00022991549,0.00013324236,0.00000898363,0.00023743557,0.003558102],"genre_scores_gemma":[0.99675053,0.000004787408,0.0030627125,0.00010869963,0.00004677306,0.000006133468,0.0000018120714,0.000006545753,0.000011988158],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998839,0.000049519444,0.00024896255,0.0002559436,0.00046232884,0.0001442353],"domain_scores_gemma":[0.9986878,0.0006086751,0.00021316203,0.000067747664,0.00037048646,0.000052138435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010826695,0.0001194141,0.00015805702,0.000067009045,0.00019576012,0.00015173166,0.0009239339,0.000052343414,0.000003917172],"category_scores_gemma":[0.00063642,0.00007811969,0.000049816626,0.00026827303,0.000081861646,0.00017411743,0.00025726255,0.00032178458,0.0000014469682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065955566,0.00009877422,0.4199786,0.000953169,0.00039203596,0.0000054648617,0.009796338,0.069508456,0.23222692,0.2641068,0.00029358076,0.0019803043],"study_design_scores_gemma":[0.00020613744,0.00009092836,0.018211074,0.0010629776,0.000009331448,0.000014371321,0.00029137105,0.94421595,0.0347881,0.0010134387,0.000010677207,0.000085615255],"about_ca_topic_score_codex":0.000027946951,"about_ca_topic_score_gemma":7.832699e-8,"teacher_disagreement_score":0.8747075,"about_ca_system_score_codex":0.000017340677,"about_ca_system_score_gemma":0.000081431186,"threshold_uncertainty_score":0.31856284},"labels":[],"label_agreement":null},{"id":"W3039087190","doi":"10.5539/cis.v13n3p73","title":"Integrating Radiology into an AI System for Physician Decision Making","year":2020,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Plan (archaeology); Radiography; Extension (predicate logic); Work (physics); Medical physics; Radiology; Artificial intelligence; Medicine","score_opus":0.01653770922960172,"score_gpt":0.27766925203642806,"score_spread":0.2611315428068263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3039087190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010395266,0.00002070472,0.98790294,0.0006007451,0.000382284,0.00014360849,0.0000014981223,0.00017755094,0.00037538193],"genre_scores_gemma":[0.6620548,6.84446e-7,0.3331733,0.004675066,0.00008679495,0.000004856658,0.0000028285124,0.0000015216053,1.7963146e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990025,0.000025843734,0.0002907247,0.00024851668,0.00021297415,0.00021942022],"domain_scores_gemma":[0.9991855,0.00014651055,0.0001323487,0.00019682296,0.00020902141,0.00012981496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070309994,0.000101692734,0.0001327691,0.00014625832,0.0005751165,0.00080970535,0.00078148674,0.000034326313,3.3801354e-7],"category_scores_gemma":[0.000065839835,0.00008519897,0.00002466342,0.0005680952,0.00008650115,0.008881337,0.00024404307,0.00009889676,0.000010897417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001070395,0.0000032965713,0.00021954872,0.00007762542,0.0000020435339,5.4684836e-7,0.013709889,0.005037279,0.00021054735,0.11455268,0.0005219239,0.86565393],"study_design_scores_gemma":[0.00016700425,0.0002099578,0.0003882606,0.00009411521,0.0000012478449,0.000013617949,0.00018039573,0.99524814,0.00022287415,0.00075380236,0.0026045723,0.00011603889],"about_ca_topic_score_codex":0.000003130236,"about_ca_topic_score_gemma":2.3915328e-7,"teacher_disagreement_score":0.99021083,"about_ca_system_score_codex":0.00003565188,"about_ca_system_score_gemma":0.00010495886,"threshold_uncertainty_score":0.7808007},"labels":[],"label_agreement":null},{"id":"W3040850713","doi":"10.1080/01691864.2020.1786723","title":"A library for constraint consistent learning","year":2020,"lang":"en","type":"article","venue":"Advanced Robotics","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council","keywords":"Reuse; Computer science; Constraint (computer-aided design); Task (project management); Software; Space (punctuation); Implementation; Code (set theory); Null (SQL); Learning curve; Machine learning; Artificial intelligence; State space; Human–computer interaction; Software engineering; Programming language; Data mining; Engineering; Set (abstract data type); Operating system; Mathematics","score_opus":0.025857336026436136,"score_gpt":0.23566781459507632,"score_spread":0.20981047856864019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040850713","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024421676,0.00029642935,0.9867277,0.010595573,0.00017294865,0.0001761472,0.000005346797,0.0005348529,0.0012467888],"genre_scores_gemma":[0.22368571,0.000015826907,0.7731356,0.0028141632,0.000066253415,0.000010236741,0.000014199155,0.00001679268,0.00024120562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991152,0.000034773133,0.00018686813,0.00029694324,0.00010237021,0.00026379424],"domain_scores_gemma":[0.9992008,0.00035043468,0.00009108488,0.00016554202,0.00003577775,0.0001563474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000068454494,0.000119430355,0.00015807245,0.00002380586,0.00016814242,0.000101457576,0.00035017592,0.00004542304,0.000007478589],"category_scores_gemma":[0.00015309209,0.00011833115,0.000069256756,0.00017355195,0.000037680667,0.00035668953,0.00012583344,0.00019582156,0.000021656857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001955145,0.000016126764,0.000771234,0.000074603224,0.0000229625,0.000026317863,0.0008941684,0.85461247,0.00063228235,0.09717467,0.0020893926,0.043666203],"study_design_scores_gemma":[0.00082154165,0.0004413707,0.000052768562,0.00008184549,0.00001349578,0.000015190926,0.00014204487,0.9146426,0.001438428,0.003873187,0.07813569,0.00034184108],"about_ca_topic_score_codex":3.0306785e-7,"about_ca_topic_score_gemma":8.8727845e-8,"teacher_disagreement_score":0.22344148,"about_ca_system_score_codex":0.000008605556,"about_ca_system_score_gemma":0.000091022535,"threshold_uncertainty_score":0.4825404},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"not_applicable","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"split"},{"id":"W3041442431","doi":"10.24963/ijcai.2020/663","title":"Lagrangian Decomposition for Classical Planning (Extended Abstract)","year":2020,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"European Commission","keywords":"Heuristics; Mathematical optimization; Solver; Computation; Computer science; Heuristic; Decomposition; Operator (biology); Lagrangian relaxation; Lagrangian; Abstraction; Algorithm; Mathematics; Applied mathematics","score_opus":0.03739064176648905,"score_gpt":0.2967809915805669,"score_spread":0.2593903498140779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041442431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004234246,0.000059133014,0.97550213,0.013743358,0.00012066395,0.00013580003,0.0000039139063,0.00042589914,0.0057748794],"genre_scores_gemma":[0.81742007,4.305177e-7,0.17948797,0.0028050083,0.00014647252,0.000011092878,0.000018439192,0.000007663456,0.00010286607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914235,0.000016365548,0.00016635591,0.00029916136,0.00013162298,0.0002441734],"domain_scores_gemma":[0.9993859,0.00021711882,0.000052425148,0.00014456754,0.00003694749,0.00016305408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001457824,0.000103454855,0.000116626055,0.000033561533,0.00015789272,0.00015627539,0.00037516473,0.00006314983,0.000022793545],"category_scores_gemma":[0.00003317847,0.00009339232,0.00007007963,0.00013799485,0.0000124203725,0.00027910052,0.000053810756,0.00012712265,0.000056893346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038272986,0.00031231184,0.003950942,0.00043373567,0.00019028904,0.00023711004,0.014160301,0.0186369,0.041349016,0.34359717,0.31182483,0.26492468],"study_design_scores_gemma":[0.0009415029,0.000424796,0.0042848834,0.00007351095,0.000013564136,0.000015450181,0.00007690524,0.93870384,0.007076019,0.0045677656,0.04338409,0.00043765543],"about_ca_topic_score_codex":0.0000048116303,"about_ca_topic_score_gemma":8.1855217e-7,"teacher_disagreement_score":0.92006695,"about_ca_system_score_codex":0.000013333747,"about_ca_system_score_gemma":0.000038783954,"threshold_uncertainty_score":0.38084283},"labels":[],"label_agreement":null},{"id":"W3098565106","doi":"10.22215/etd/2018-12958","title":"A Comparison of Case-Based Reasoning and Probabilistic Graphical Models in the Context of Learning from Observation","year":2018,"lang":"en","type":"dissertation","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Artificial intelligence; Computer science; Machine learning; Graphical model; Probabilistic logic; Classifier (UML); Domain (mathematical analysis); Case-based reasoning; Mathematics","score_opus":0.057481705423826,"score_gpt":0.3013556662726849,"score_spread":0.2438739608488589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098565106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8806274,0.00039140612,0.118100755,0.00006024222,0.0000774898,0.00026757517,0.000005051256,0.000035232693,0.00043483885],"genre_scores_gemma":[0.9717211,0.000002563719,0.027937138,0.000032844477,0.0000144462965,0.0000185651,0.0002336289,0.000009194872,0.000030481322],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836504,0.00028890723,0.0005436899,0.00034913162,0.00030079685,0.00015245566],"domain_scores_gemma":[0.997921,0.0010468232,0.00050240214,0.00030036352,0.00019966424,0.000029780418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007357885,0.00017614847,0.0004078171,0.00015508471,0.00010753294,0.000064141146,0.00037589055,0.00020532242,0.0000045752736],"category_scores_gemma":[0.00021507438,0.00013517996,0.000056228684,0.0003728264,0.000057452184,0.00016437595,0.000024190624,0.00040502538,3.839962e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073808525,0.0008508358,0.3150645,0.0026966336,0.00023423189,0.00019808995,0.28274274,0.13075231,0.0014902208,0.20095831,0.0009588901,0.06331515],"study_design_scores_gemma":[0.00029112454,0.00020634441,0.004809043,0.0007722491,0.000032186184,0.0000048696697,0.0041978895,0.9849095,0.00040882942,0.0042010034,0.000013212146,0.0001537863],"about_ca_topic_score_codex":0.0030693898,"about_ca_topic_score_gemma":0.0021584677,"teacher_disagreement_score":0.85415715,"about_ca_system_score_codex":0.000014680072,"about_ca_system_score_gemma":0.00013068695,"threshold_uncertainty_score":0.55124784},"labels":[],"label_agreement":null},{"id":"W3107287025","doi":"","title":"A Method for Operational Discovery in Maritime Operations","year":2020,"lang":"en","type":"article","venue":"NPARC","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Operations research; Operations management; Engineering","score_opus":0.02933023987645418,"score_gpt":0.28690818958104963,"score_spread":0.25757794970459547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107287025","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007533784,0.00001855495,0.97283113,0.024097437,0.000045018038,0.0001387968,0.000017281749,0.00004626095,0.0020521628],"genre_scores_gemma":[0.1778033,8.122962e-7,0.81819546,0.0036023413,0.000073293304,0.00004842925,0.000021043943,0.0000041100975,0.0002512033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993838,0.000052845615,0.00012656377,0.00021533748,0.000091031645,0.00013040628],"domain_scores_gemma":[0.9996327,0.00017395342,0.000011237012,0.000103365724,0.000029208317,0.000049540748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022979146,0.00005893599,0.0000830193,0.000030796513,0.00009516191,0.00021689547,0.0002661067,0.00002856391,0.000035467332],"category_scores_gemma":[0.000078041965,0.000056658133,0.000028954188,0.0001670932,0.0000066946964,0.0004933227,0.00006342796,0.0000816392,0.000014905708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027017773,0.00006295707,0.0015535362,0.00004212158,0.00001797074,0.000015467454,0.003735231,0.06853548,0.027828889,0.8499756,0.022131665,0.026074063],"study_design_scores_gemma":[0.00026366612,0.000055865366,0.00023695323,0.000012316378,0.0000015862191,0.000002425488,0.000011554379,0.98668367,0.0010733607,0.005985352,0.0055837682,0.00008949902],"about_ca_topic_score_codex":0.000017747858,"about_ca_topic_score_gemma":0.000014814952,"teacher_disagreement_score":0.91814816,"about_ca_system_score_codex":0.000013836807,"about_ca_system_score_gemma":0.00011727127,"threshold_uncertainty_score":0.23104516},"labels":[],"label_agreement":null},{"id":"W31312056","doi":"10.1609/icaps.v19i1.13387","title":"Computing Robust Plans in Continuous Domains","year":2009,"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":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robustness (evolution); Computer science; Random variable; Gaussian; State variable; Mathematical optimization; Mathematics; Statistics","score_opus":0.031302243109750494,"score_gpt":0.2745356781969923,"score_spread":0.24323343508724182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W31312056","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9783658,0.00006256727,0.005117356,0.003543457,0.00026080085,0.00011665511,0.00000487336,0.00041014515,0.012118351],"genre_scores_gemma":[0.97620744,0.0000050685862,0.023331247,0.0003625153,0.000036979192,0.0000016062747,0.0000025280972,0.0000056919985,0.000046937992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868023,0.000013535464,0.0003577091,0.0003360972,0.00035508905,0.0002573583],"domain_scores_gemma":[0.9992726,0.00011676441,0.00028285736,0.00009071923,0.00018071929,0.000056341974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005964279,0.00017048698,0.0002148248,0.00021168395,0.00015685469,0.0003105331,0.0009963159,0.00008934992,0.0000027952376],"category_scores_gemma":[0.00016950723,0.00013733318,0.00004309351,0.00025528076,0.000039215665,0.00027881423,0.00014107111,0.00036969673,0.000002014321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019959247,0.00026460274,0.21920188,0.000108926295,0.00011664017,0.000046103167,0.012408153,0.11661895,0.05212204,0.5847551,0.0010661202,0.013091847],"study_design_scores_gemma":[0.00041892502,0.00009149627,0.021965213,0.0013367967,0.0000041932626,0.00003861603,0.0003864327,0.9693604,0.0029277175,0.0032701904,0.000024235533,0.00017578375],"about_ca_topic_score_codex":0.000020988891,"about_ca_topic_score_gemma":8.8599603e-7,"teacher_disagreement_score":0.8527414,"about_ca_system_score_codex":0.000037458416,"about_ca_system_score_gemma":0.000051457806,"threshold_uncertainty_score":0.56002843},"labels":[],"label_agreement":null},{"id":"W3135927772","doi":"10.1613/jair.1.12283","title":"Computational Complexity of Computing Symmetries in Finite-Domain Planning","year":2021,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Vetenskapsrådet; Israel Academy of Sciences and Humanities","keywords":"Graph automorphism; Graph isomorphism; Automorphism; Time complexity; Homogeneous space; Mathematics; Isomorphism (crystallography); PSPACE; Discrete mathematics; Pruning; Graph; Automorphism group; Computational complexity theory; Combinatorics; Theoretical computer science; Computer science; Algorithm; Voltage graph; Line graph","score_opus":0.2931864096118457,"score_gpt":0.43983974178309837,"score_spread":0.14665333217125265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135927772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18806371,0.00055782584,0.8091534,0.0015845966,0.00020334913,0.000057632154,0.0000026286993,0.000010043703,0.0003668091],"genre_scores_gemma":[0.84305054,0.000010784083,0.15677992,0.000043647753,0.0000978737,4.1388012e-7,0.0000020959785,0.000005947127,0.000008774326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996243,0.0007742003,0.0011049304,0.00023930494,0.0011853324,0.00045325488],"domain_scores_gemma":[0.9932536,0.004026923,0.0003631227,0.00022600702,0.0019984392,0.00013189706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065685557,0.000111804664,0.00035877572,0.00086191646,0.00022728807,0.00021072132,0.00085472653,0.00007852506,0.000030487889],"category_scores_gemma":[0.002261582,0.00010916508,0.000108549444,0.0023267886,0.00033185564,0.00035251066,0.00031384965,0.0009618261,0.000012425197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108491535,0.0003844688,0.010449864,0.00011668936,0.000050853996,0.00095764676,0.0124878865,0.69469833,0.0021075013,0.22142635,0.0003072971,0.056904584],"study_design_scores_gemma":[0.00008976316,0.00033670705,0.0023031689,0.00072609447,0.0000026391822,0.00012876155,0.0045599528,0.60439277,0.027063584,0.3601136,0.00012391567,0.00015908327],"about_ca_topic_score_codex":0.000054155047,"about_ca_topic_score_gemma":0.000016317563,"teacher_disagreement_score":0.65498686,"about_ca_system_score_codex":0.000103380364,"about_ca_system_score_gemma":0.0008233588,"threshold_uncertainty_score":0.44516227},"labels":[],"label_agreement":null},{"id":"W3137385532","doi":"10.1016/j.athoracsur.2021.02.083","title":"Untangling the Mysteries of MAPCAs with the Identification of Different Patterns and Types","year":2021,"lang":"en","type":"letter","venue":"The Annals of Thoracic Surgery","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hospital for Sick Children","funders":"","keywords":"Medicine; Esophagus; Bronchus; Stenosis; Cardiology; Surgery; Lung; Internal medicine; Respiratory disease","score_opus":0.08448225579972546,"score_gpt":0.31046392868028144,"score_spread":0.22598167288055598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137385532","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46180966,0.0057358993,0.011417694,0.52013457,0.00044913118,0.0002697387,0.0000856751,0.00003261122,0.00006502635],"genre_scores_gemma":[0.9816844,0.00034844296,0.00006197291,0.017334674,0.00022593123,0.000015226902,0.00004085266,0.00001896834,0.00026952615],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980215,0.0006198118,0.0004971642,0.00023236306,0.00043208242,0.00019706765],"domain_scores_gemma":[0.994671,0.0030880289,0.00099924,0.0009820298,0.00024527233,0.0000144224705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018312908,0.00018584546,0.0004280527,0.00008936182,0.00013510241,0.00010378482,0.00077789405,0.00010908228,0.00000725321],"category_scores_gemma":[0.00009170975,0.00008195563,0.00013997674,0.00023467353,0.0002154736,0.00009974637,0.00021737396,0.00040282944,6.594331e-7],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047080228,0.00020938487,0.0591161,0.012063651,0.002953776,0.00027971715,0.037084207,0.0013344813,0.0029552935,0.0012909467,0.7433191,0.13892254],"study_design_scores_gemma":[0.0003234773,0.00072224665,0.07268098,0.031037273,0.0018340909,0.0005887021,0.006478652,0.015112153,0.7192279,0.011001712,0.13735473,0.0036380454],"about_ca_topic_score_codex":0.00007139236,"about_ca_topic_score_gemma":0.000011256744,"teacher_disagreement_score":0.71627265,"about_ca_system_score_codex":0.0000035653386,"about_ca_system_score_gemma":0.000072226234,"threshold_uncertainty_score":0.33420536},"labels":[],"label_agreement":null},{"id":"W3151433605","doi":"10.36001/phmconf.2010.v2i1.1958","title":"Diagnosis as Planning Revisited: An Abridged Report","year":2010,"lang":"en","type":"article","venue":"Annual Conference of the PHM Society","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Psychology","score_opus":0.028057738184166948,"score_gpt":0.2882608180578948,"score_spread":0.2602030798737278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3151433605","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9715946,0.00011805229,0.020349039,0.0034071712,0.0007307486,0.00021733416,0.00003353317,0.00022775248,0.003321787],"genre_scores_gemma":[0.98331726,0.000013379355,0.015299202,0.00064247765,0.00011450139,0.000015422209,0.00001186801,0.000010725718,0.00057517696],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99840415,0.00010065865,0.00034055248,0.00043136554,0.00040286945,0.000320394],"domain_scores_gemma":[0.9977643,0.00022007003,0.00033834713,0.0011432908,0.0004037327,0.0001302986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010694023,0.00017871113,0.0002335864,0.000022618136,0.00035828256,0.00018680787,0.0016367078,0.00014920159,0.00004540254],"category_scores_gemma":[0.00026525918,0.0001353805,0.00022006193,0.0002988727,0.00014511458,0.0007036092,0.00039966818,0.0006148605,0.000013657145],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045517234,0.0006943159,0.4388095,0.00034153296,0.000589967,0.00031649446,0.22856729,0.00096466875,0.027477419,0.08033932,0.14589062,0.07596333],"study_design_scores_gemma":[0.0034845849,0.0018648448,0.35281688,0.003406558,0.00055266294,0.0027419436,0.015701232,0.16086215,0.15522696,0.079509,0.21807134,0.005761861],"about_ca_topic_score_codex":0.00025282244,"about_ca_topic_score_gemma":0.0000052797373,"teacher_disagreement_score":0.21286607,"about_ca_system_score_codex":0.00001277094,"about_ca_system_score_gemma":0.0002621469,"threshold_uncertainty_score":0.5520657},"labels":[],"label_agreement":null},{"id":"W3159388902","doi":"10.71781/11000","title":"Lifelong learning of concepts in CRAFT","year":2020,"lang":"en","type":"dissertation","venue":"Open MIND","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université de Montréal","keywords":"Craft; Lifelong learning; Computer science; Cognitive science; Engineering; Psychology; Visual arts; Pedagogy; Art","score_opus":0.033070961265025005,"score_gpt":0.3341113334940951,"score_spread":0.3010403722290701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159388902","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5913571,0.002693121,0.02518176,0.0018713411,0.0022454401,0.0018170406,0.000023673183,0.000036723486,0.37477377],"genre_scores_gemma":[0.9139853,0.000017402275,0.06625739,0.00005952738,0.00006662709,0.000016540325,0.00041889158,0.000023948814,0.019154387],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99880666,0.00010780244,0.00032021874,0.00040601412,0.00018804487,0.00017124291],"domain_scores_gemma":[0.9992429,0.0001474372,0.00028759614,0.0002109086,0.000051878946,0.000059299047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034662188,0.00014744679,0.00031548183,0.00009461265,0.000057935726,0.00019925465,0.0012590989,0.00015018368,0.000222829],"category_scores_gemma":[0.00012606838,0.00015721477,0.000044072796,0.0003134092,0.000010969184,0.000262996,0.00015365567,0.00045652545,0.00013600118],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121917496,0.00008362765,0.012865023,0.00027511563,0.00007568022,0.0002685551,0.09082661,0.004407717,0.0025469174,0.0006054483,0.0022722133,0.8856512],"study_design_scores_gemma":[0.004658337,0.0016885906,0.026574135,0.011764974,0.00013693431,0.000025132216,0.011276623,0.2879266,0.09793667,0.0011048801,0.5529595,0.003947632],"about_ca_topic_score_codex":0.00013944611,"about_ca_topic_score_gemma":0.000120453675,"teacher_disagreement_score":0.88170356,"about_ca_system_score_codex":0.000018222234,"about_ca_system_score_gemma":0.00031372995,"threshold_uncertainty_score":0.64110327},"labels":[],"label_agreement":null},{"id":"W3169237383","doi":"10.1007/978-3-031-74003-9","title":"Information Processing and Management of Uncertainty in Knowledge-Based Systems","year":2024,"lang":"en","type":"book","venue":"Lecture notes in networks and systems","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Instituto Superior Técnico; Siemens; Pontifícia Universidade Católica do Rio de Janeiro; Mendelova Univerzita v Brně; Ben-Gurion University of the Negev; Université de Montpellier; Ostravská Univerzita v Ostravě; Università di Catania; University of Tsukuba; Universidad de Granada; Universidad de Oviedo; Université de Lyon; Bulgarian Academy of Sciences; Universidade de Lisboa; Turun Yliopisto; University of Southern California; Università degli Studi di Palermo; Universidad de Málaga; Universidad de Cádiz; Centre National de la Recherche Scientifique; Politechnika Warszawska; Sapienza Università di Roma; Universität Paderborn; Uniwersytet Rzeszowski; Università degli Studi di Trento; University of Texas at El Paso; Universitat de les Illes Balears; Universidad Complutense de Madrid; Università degli Studi di Perugia; Universiteit Maastricht; Universitat Autònoma de Barcelona; Universidade Federal do Rio Grande do Norte; University of Bristol; Uniwersytet Warszawski; Universiteit Gent; Università degli Studi di Milano-Bicocca; Université de Technologie de Compiègne; Universidad Politécnica de Madrid; Sorbonne Université; Uniwersytet Śląski w Katowicach; Università degli Studi di Milano; University of Alberta; San Francisco State University; Universidad de Sevilla; Universidad de Alcalá; Sejong University; University of Cincinnati","keywords":"Knowledge management; Computer science; Information management; Management information systems; Information system; Data science; Business; Engineering","score_opus":0.011443267552432914,"score_gpt":0.23180350279101639,"score_spread":0.22036023523858347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169237383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011442076,0.13377716,0.8545435,0.00006368494,0.0012085602,0.00089148694,0.000008684002,0.00009276218,0.009299712],"genre_scores_gemma":[0.99665475,0.00053425337,0.00068050413,0.000051631272,0.00024266812,0.00009434748,0.0000851809,0.000027588618,0.0016290633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984223,0.00011004251,0.00066280947,0.00031793743,0.00020670332,0.00028019384],"domain_scores_gemma":[0.9990291,0.00030913283,0.0002846233,0.00026044136,0.000064427106,0.00005228295],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009104558,0.00029426295,0.0005176381,0.0003822766,0.00005943489,0.0004691608,0.00026700518,0.00040229817,2.8360793e-7],"category_scores_gemma":[0.000009740807,0.00024630153,0.00003508769,0.000369639,0.000042623004,0.00019527359,0.00012643744,0.0005049339,0.0000013053261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000099029185,0.0000068006434,0.0002219378,0.011673151,0.000024740262,0.000021543345,0.0012004562,0.93428123,1.8374784e-7,0.0031120568,0.00044578974,0.049002197],"study_design_scores_gemma":[0.00026340233,0.000045826953,0.000035326277,0.020408217,0.000019558103,0.000012367714,0.00002144457,0.9687544,2.6856733e-7,0.0005409165,0.009651798,0.00024647792],"about_ca_topic_score_codex":0.0001441427,"about_ca_topic_score_gemma":0.00005684409,"teacher_disagreement_score":0.99654037,"about_ca_system_score_codex":0.00014564728,"about_ca_system_score_gemma":0.00015944889,"threshold_uncertainty_score":0.9999989},"labels":[],"label_agreement":null},{"id":"W3171839115","doi":"","title":"Observing Tips: Observing and Drawing Mars","year":2018,"lang":"en","type":"article","venue":"Journal of the Royal Astronomical Society of Canada","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mars Exploration Program; Astrobiology; Geology; Remote sensing; Computer science; Environmental science; Astronomy; Physics","score_opus":0.008641019828806685,"score_gpt":0.1859030236492217,"score_spread":0.17726200382041502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3171839115","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9666002,0.0002464244,0.027603459,0.0047988947,0.0005832503,0.00003576965,0.000002134293,0.000006391159,0.00012351172],"genre_scores_gemma":[0.9295775,6.7980164e-7,0.069752045,0.00028139915,0.00025075208,1.9793916e-7,9.96891e-8,0.0000057987595,0.00013149908],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989047,0.000060346316,0.00036257837,0.00012249456,0.00029196808,0.0002578845],"domain_scores_gemma":[0.9989629,0.00018908795,0.0003981424,0.00020394551,0.00010822855,0.00013770365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005887458,0.00010369406,0.0002110028,0.000010344324,0.0002602525,0.00006904404,0.0008849936,0.000044015862,0.000012228398],"category_scores_gemma":[0.000048328584,0.00007586244,0.00015489128,0.00008568605,0.00008449742,0.00015124722,0.00034696163,0.00028424055,2.3012116e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009567722,0.00008530902,0.5032688,0.00023581329,0.0007649241,0.000008967035,0.005293444,0.105549805,0.0022197727,0.001010614,0.32352227,0.057944607],"study_design_scores_gemma":[0.00094547187,0.0002855045,0.250721,0.0007108576,0.00005951625,0.000030284205,0.00064735353,0.72238535,0.0027346734,0.00067668076,0.02040709,0.00039623393],"about_ca_topic_score_codex":0.017262282,"about_ca_topic_score_gemma":0.0035943687,"teacher_disagreement_score":0.61683553,"about_ca_system_score_codex":0.00016946043,"about_ca_system_score_gemma":0.0007115716,"threshold_uncertainty_score":0.98928183},"labels":[],"label_agreement":null},{"id":"W3174309074","doi":"10.1613/jair.1.13768","title":"Classical Planning in Deep Latent Space","year":2022,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Bottleneck; Artificial intelligence; Domain (mathematical analysis); Representation (politics); Plan (archaeology); Automated planning and scheduling; Set (abstract data type); Space (punctuation); Rotation formalisms in three dimensions; Action (physics); Machine learning; Theoretical computer science; Mathematics; Programming language","score_opus":0.1989048434107749,"score_gpt":0.41514548535276874,"score_spread":0.21624064194199383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174309074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17988488,0.0014687234,0.8049047,0.011442247,0.00095887773,0.00019833252,0.0000014610557,0.000035591314,0.001105172],"genre_scores_gemma":[0.9861232,0.000020346115,0.0134828035,0.000062718886,0.0001796958,0.000007124053,4.4489545e-7,0.000009144942,0.00011453147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961543,0.0008360528,0.0006623026,0.00024837552,0.0014942411,0.0006047123],"domain_scores_gemma":[0.99819416,0.0008660844,0.00019269578,0.00026716886,0.0002958476,0.0001840543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008030459,0.00010069409,0.00021975941,0.0008884184,0.00046548716,0.00023063709,0.0014827733,0.000051017534,0.00012228117],"category_scores_gemma":[0.0004673168,0.00009338809,0.00009443615,0.001609752,0.00009153175,0.0003498457,0.0005682876,0.0021182557,0.00003813606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004162528,0.00065190886,0.008385977,0.00003248476,0.00003986483,0.0035554948,0.016982973,0.55771667,0.0049963393,0.14264737,0.003466131,0.26110852],"study_design_scores_gemma":[0.00009233355,0.0016527018,0.00071406993,0.0001606864,0.0000036634203,0.00037218438,0.004327847,0.9001729,0.009020496,0.07518905,0.008018638,0.00027544773],"about_ca_topic_score_codex":0.00005202907,"about_ca_topic_score_gemma":0.0000132035875,"teacher_disagreement_score":0.8062383,"about_ca_system_score_codex":0.00030666817,"about_ca_system_score_gemma":0.00042655223,"threshold_uncertainty_score":0.9202885},"labels":[],"label_agreement":null},{"id":"W3177062893","doi":"10.1609/icaps.v31i1.15964","title":"LM-cut and Operator Counting Heuristics for Optimal Numeric Planning with Simple Conditions","year":2021,"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":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Heuristic; Operator (biology); Simple (philosophy); State (computer science); Mathematical optimization; Computer science; Consistent heuristic; Algorithm; Mathematics; Null-move heuristic; Constant (computer programming); Incremental heuristic search; Search algorithm; Beam search","score_opus":0.0314566558341207,"score_gpt":0.29300295957440925,"score_spread":0.26154630374028853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3177062893","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9699812,0.0001626929,0.02632555,0.001501469,0.0001783091,0.00014396798,0.000043810047,0.00027451344,0.0013885114],"genre_scores_gemma":[0.93890125,0.0000065103523,0.06068641,0.00023772282,0.000045305547,0.000017102933,0.00002086539,0.00001285662,0.000071992516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988149,0.000010220326,0.00026773795,0.00037862055,0.0002956005,0.00023295275],"domain_scores_gemma":[0.9986924,0.00024533903,0.00025790502,0.000083926425,0.00064738165,0.000073026706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000324181,0.00017882382,0.00020666023,0.0000959177,0.00043095465,0.0005981335,0.0004310255,0.00007114715,0.0000049037267],"category_scores_gemma":[0.00030579756,0.0001423214,0.00003286158,0.00018877933,0.000071938084,0.00032743273,0.00017901375,0.00023783858,6.0038974e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004471777,0.00025293432,0.23125625,0.00095161045,0.0008951007,0.00008321641,0.01432514,0.14417179,0.1282424,0.4733644,0.003796403,0.002213578],"study_design_scores_gemma":[0.00048357164,0.00010820928,0.0019880126,0.001154345,0.000024249597,0.00012007132,0.0011229708,0.9814958,0.012041325,0.0010597367,0.00018649969,0.00021522942],"about_ca_topic_score_codex":0.00000750013,"about_ca_topic_score_gemma":3.528751e-7,"teacher_disagreement_score":0.837324,"about_ca_system_score_codex":0.000022195516,"about_ca_system_score_gemma":0.00014308817,"threshold_uncertainty_score":0.5803698},"labels":[],"label_agreement":null},{"id":"W3183380213","doi":"10.22215/etd/2021-14605","title":"A Model-Driven Approach to Integrated Cognition","year":2021,"lang":"en","type":"dissertation","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Friends of The Mater Foundation","keywords":"Computer science; Cognitive architecture; Cognition; Cognitive science; Cognitive model; Implementation; Task (project management); Common ground; Domain (mathematical analysis); Conceptual model; Artificial intelligence; Human–computer interaction; Software engineering; Psychology; Systems engineering; Engineering","score_opus":0.03150600420064097,"score_gpt":0.2605083832651019,"score_spread":0.22900237906446091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183380213","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016135443,0.00007573241,0.8261415,0.00007448097,0.000251062,0.00019403295,0.000011380758,0.0002878564,0.17135043],"genre_scores_gemma":[0.12816419,0.000009900214,0.80351526,0.0007968813,0.000066974855,0.00013787886,0.007562227,0.00003738071,0.059709292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998571,0.000056916986,0.00023660496,0.0006057883,0.00028194534,0.00024779115],"domain_scores_gemma":[0.99905455,0.00004058713,0.000090522415,0.00037695724,0.00031401662,0.00012339302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013805696,0.00023821932,0.0002471504,0.00019222024,0.000119120785,0.000297258,0.0005745734,0.00024455358,0.000024141053],"category_scores_gemma":[0.00003984272,0.00022070794,0.00008444511,0.00055364374,0.000004226142,0.000179541,0.0000534645,0.00035286823,0.0000803668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017574511,0.00096178474,0.000075728094,0.0013862015,0.00053270144,0.00011360681,0.054603904,0.41805145,0.0078052413,0.1594004,0.16389695,0.1929963],"study_design_scores_gemma":[0.000112697875,0.000032409167,0.000019774161,0.00028688507,0.000021904292,0.000004941716,0.00046253306,0.99621403,0.0010471222,0.0007878478,0.00065826817,0.00035160244],"about_ca_topic_score_codex":0.00006976008,"about_ca_topic_score_gemma":0.00006914112,"teacher_disagreement_score":0.57816255,"about_ca_system_score_codex":0.000038779774,"about_ca_system_score_gemma":0.00035357638,"threshold_uncertainty_score":0.90002084},"labels":[],"label_agreement":null},{"id":"W3190502896","doi":"10.24963/ijcai.2021/557","title":"Type-WA*: Using Exploration in Bounded Suboptimal Planning","year":2021,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Schwartz/Reisman Emergency Medicine Institute; Vector Institute; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; Microsoft Research","keywords":"Satisficing; Heuristics; Bounded function; Mathematical optimization; Heuristic; Computer science; Greedy algorithm; Quality (philosophy); Mathematics; Artificial intelligence","score_opus":0.10013900835510271,"score_gpt":0.31287136886159955,"score_spread":0.21273236050649685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3190502896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1911144,0.00027151286,0.80279136,0.00046417557,0.00030161673,0.000041392494,2.8260928e-7,0.00013648765,0.004878796],"genre_scores_gemma":[0.7389091,0.0000025538395,0.26041552,0.00028028735,0.00004132587,0.0000015674751,0.000008424367,0.000006027801,0.00033514935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991417,0.00006773875,0.00016617418,0.00026184687,0.00014250801,0.00022006426],"domain_scores_gemma":[0.99954325,0.00007403544,0.00004011536,0.00023108553,0.00006748666,0.000044055036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002542923,0.00008361933,0.000100943405,0.00008626437,0.000104736595,0.00022133002,0.00018791227,0.00005247181,0.000033348984],"category_scores_gemma":[0.000047832815,0.000086066764,0.000020865182,0.00054973207,0.000009461279,0.00073369883,0.00009993818,0.00012963517,0.000026927397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006980521,0.00027997777,0.13519634,0.00011917873,0.00006141346,0.0022474246,0.021214096,0.63622904,0.042196993,0.13571668,0.00469969,0.021969365],"study_design_scores_gemma":[0.00030321535,0.00003984878,0.0011679103,0.00011047963,0.0000029084745,0.000044302764,0.00024856883,0.9841621,0.008202036,0.0042288085,0.0012548596,0.00023494098],"about_ca_topic_score_codex":0.00006344273,"about_ca_topic_score_gemma":0.000017155055,"teacher_disagreement_score":0.54779476,"about_ca_system_score_codex":0.00004456581,"about_ca_system_score_gemma":0.00019115648,"threshold_uncertainty_score":0.35097006},"labels":[],"label_agreement":null},{"id":"W3196807260","doi":"10.1609/socs.v12i1.18570","title":"Avoiding Re-Expansions in Suboptimal Best-First Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Bounded function; Function (biology); Mathematical optimization; Mathematics; Computer science; Mathematical economics; Mathematical analysis; Biology","score_opus":0.024842404220111764,"score_gpt":0.27005177806901226,"score_spread":0.24520937384890049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196807260","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9384663,0.00006959336,0.00042160583,0.026669575,0.003479452,0.00027672978,0.000009461589,0.00008099398,0.030526264],"genre_scores_gemma":[0.9977688,0.000041381874,0.0012442026,0.0001277028,0.0002256524,0.000016722948,0.0000031022396,0.000016778316,0.0005556369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972755,0.00007546355,0.00038562523,0.0005145578,0.001340647,0.00040821382],"domain_scores_gemma":[0.99811304,0.00063882844,0.00010816512,0.00022764124,0.00080755167,0.00010479063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020480976,0.00017150464,0.00020561111,0.00017839235,0.0004119522,0.00033475284,0.0022292102,0.000113448375,0.000033117656],"category_scores_gemma":[0.0005489236,0.00015009909,0.0001262071,0.0008382395,0.00008616076,0.00043620818,0.0011546056,0.00093529484,0.000029584393],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001937408,0.0008751968,0.04020723,0.00011972582,0.00008545436,0.000038779523,0.0049143997,0.0049744355,0.09496,0.8506632,0.0018374817,0.0011304019],"study_design_scores_gemma":[0.0034200985,0.0005321882,0.0044488083,0.002219742,0.000020187219,0.00009961197,0.0014826999,0.08560401,0.8722743,0.021837516,0.0072675664,0.00079331355],"about_ca_topic_score_codex":0.00026260846,"about_ca_topic_score_gemma":0.0000099222425,"teacher_disagreement_score":0.82882565,"about_ca_system_score_codex":0.0002846754,"about_ca_system_score_gemma":0.00021645847,"threshold_uncertainty_score":0.6120863},"labels":[],"label_agreement":null},{"id":"W3199146973","doi":"10.29007/s6vh","title":"A Generic Model of the World and Intelligence","year":2019,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University","funders":"","keywords":"Computer science; Analogy; Artificial intelligence; Object (grammar); Identity (music); Artificial general intelligence; Human intelligence; Symbolic artificial intelligence; Cognitive science; Computational intelligence; Epistemology; Psychology","score_opus":0.023353025890957932,"score_gpt":0.24088109727323753,"score_spread":0.2175280713822796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199146973","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60614854,0.0003271987,0.38964298,0.0004999715,0.00037157186,0.00010781355,4.2582144e-7,0.000046342633,0.002855183],"genre_scores_gemma":[0.91761374,0.00000344416,0.08180846,0.00018325083,0.000014547099,6.581113e-7,1.3231485e-7,0.0000036166005,0.00037217012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992785,0.00005099009,0.00019660719,0.00020093762,0.000109111454,0.00016385366],"domain_scores_gemma":[0.99934626,0.00019969192,0.00009115896,0.00032370165,0.000019852276,0.000019368294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003482891,0.000075833326,0.00012034977,0.00006264775,0.000064918975,0.000037025857,0.00051478634,0.000022723596,0.00000395756],"category_scores_gemma":[0.000030663752,0.00005924979,0.000022459724,0.00047263887,0.000045092693,0.00014012863,0.00045725226,0.0001400841,0.0000025104416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005924665,0.000014820053,0.119734794,0.000086694905,0.000007562632,0.0000021133083,0.0054560937,0.7394076,0.0007663508,0.07137022,0.00008464268,0.06306317],"study_design_scores_gemma":[0.00004296465,0.000016356904,0.002439902,0.00012985518,8.485074e-7,0.000007174011,0.00004652257,0.98958397,0.0015276249,0.006034554,0.000093194656,0.0000770059],"about_ca_topic_score_codex":0.000022773065,"about_ca_topic_score_gemma":0.000016209027,"teacher_disagreement_score":0.3114652,"about_ca_system_score_codex":0.000014097803,"about_ca_system_score_gemma":0.00004169765,"threshold_uncertainty_score":0.24161363},"labels":[],"label_agreement":null},{"id":"W346395726","doi":"10.1016/j.artint.2008.11.011","title":"A heuristic search approach to planning with temporally extended preferences","year":2008,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Computer science; Planner; Suite; Heuristic; Automated planning and scheduling; Variety (cybernetics); Metric (unit); Motion planning; Mathematical optimization; Key (lock); Artificial intelligence; Robot; Mathematics; Engineering","score_opus":0.1390512601965133,"score_gpt":0.30582560529783703,"score_spread":0.16677434510132375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W346395726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075986,0.00009829692,0.91579086,0.00033512214,0.000104752944,0.00024366417,0.0000021353633,0.00026161436,0.007177539],"genre_scores_gemma":[0.84533805,0.0000032528228,0.1540955,0.00026510315,0.000067344874,0.000029452138,0.0000043546565,0.000011831441,0.00018508684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978497,0.00011123578,0.0003398629,0.0006618635,0.0005076062,0.0005297469],"domain_scores_gemma":[0.99878883,0.00021737989,0.000072180264,0.00052723853,0.00015675022,0.00023763563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004708209,0.00021272834,0.00021355008,0.00018360153,0.00047636885,0.00019531314,0.001089028,0.00006540529,0.000011795624],"category_scores_gemma":[0.000080897196,0.00017410923,0.0000388734,0.00087166723,0.00012337879,0.00033231327,0.00017827265,0.0002938277,0.00021996452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005278434,0.0011790154,0.019416828,0.0001662757,0.00014374741,0.00094301475,0.083951734,0.40676713,0.0021031285,0.25319517,0.0036836728,0.22792247],"study_design_scores_gemma":[0.00014359516,0.002833643,0.007347927,0.0005772906,0.000026997386,0.0007094659,0.0026484767,0.88736665,0.05020164,0.043968633,0.0019312446,0.0022444248],"about_ca_topic_score_codex":0.00019970338,"about_ca_topic_score_gemma":0.00000830485,"teacher_disagreement_score":0.7693521,"about_ca_system_score_codex":0.00002955706,"about_ca_system_score_gemma":0.00023224614,"threshold_uncertainty_score":0.7099968},"labels":[],"label_agreement":null},{"id":"W39392249","doi":"10.1111/sms.14740","title":"Automatic Generation of Memory Based Search Heuristics","year":2000,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Heuristics; Cardinality (data modeling); Heuristic; Computer science; Beam search; Incremental heuristic search; Space (punctuation); Ranking (information retrieval); Operator (biology); Table (database); Algorithm; Simple (philosophy); State (computer science); State space; Search algorithm; Theoretical computer science; Sequence (biology); Mathematics; Artificial intelligence; Mathematical optimization; Data mining","score_opus":0.20522953965088014,"score_gpt":0.35037923976499435,"score_spread":0.1451497001141142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W39392249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04541674,0.000026518583,0.93626034,0.0023080267,0.00021997516,0.0002007324,0.00002349558,0.00014796144,0.015396187],"genre_scores_gemma":[0.969935,0.000006205623,0.029337674,0.0003855297,0.00008799462,0.000010401458,0.000023494486,0.0000061995547,0.00020748594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980589,0.00014987982,0.00043120582,0.00032488772,0.00082687323,0.00020822494],"domain_scores_gemma":[0.99864614,0.0003521394,0.00009304409,0.00026062032,0.00057098863,0.00007705713],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00076023425,0.00013213242,0.00014903866,0.00017635683,0.00016831483,0.00013485407,0.00057205977,0.00007938707,0.0015295082],"category_scores_gemma":[0.00019779029,0.00013242027,0.000050450915,0.00041656464,0.00008761519,0.00018977458,0.000024867477,0.00019630321,0.0004026132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013564402,0.00012280875,0.000017701626,0.000018558389,0.0000067328947,0.000003833517,0.00034740142,0.1019645,0.0021799076,0.34123856,0.00029238933,0.553794],"study_design_scores_gemma":[0.000021841674,0.0001140809,0.00008958926,0.000051013307,0.00000224328,0.0000015179952,0.000015730904,0.91702986,0.056770846,0.025706027,0.000069336274,0.0001279244],"about_ca_topic_score_codex":0.000037848287,"about_ca_topic_score_gemma":0.000011065779,"teacher_disagreement_score":0.9245183,"about_ca_system_score_codex":0.000055650304,"about_ca_system_score_gemma":0.00052739686,"threshold_uncertainty_score":0.9993832},"labels":[],"label_agreement":null},{"id":"W39797758","doi":"","title":"Finding state similarities for faster planning","year":2008,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Context (archaeology); Task (project management); Set (abstract data type); Plan (archaeology); Action (physics); Heuristic; State (computer science); Function (biology); Similarity (geometry); Artificial intelligence; Theoretical computer science; Mathematical optimization; Algorithm; Mathematics; Programming language","score_opus":0.07031280761764884,"score_gpt":0.2747911334985984,"score_spread":0.20447832588094955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W39797758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032850742,0.00011560946,0.96036816,0.00047532227,0.00020066518,0.000100151046,0.000004566639,0.00026677627,0.0056179888],"genre_scores_gemma":[0.7429468,0.0000038140342,0.24745136,0.0011299723,0.00006713789,0.000019101684,0.0000064455844,0.000011580976,0.008363808],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915713,0.00001916955,0.00015093228,0.00023126916,0.000127346,0.00031415772],"domain_scores_gemma":[0.9993706,0.00028350455,0.000044886954,0.00020225375,0.000039141498,0.000059618735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020263952,0.0001029841,0.00011116505,0.00008097262,0.00036289182,0.00009755602,0.00034944166,0.0000349488,0.0000134259135],"category_scores_gemma":[0.00002567528,0.00009191644,0.000046293964,0.000105511026,0.000023046752,0.00037894025,0.000081763705,0.00008882411,0.00001791735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001511519,0.0001899707,0.22759016,0.00047925292,0.00025178303,0.00069428,0.107165836,0.1058023,0.0024131453,0.075659916,0.40791157,0.07169064],"study_design_scores_gemma":[0.0019002816,0.0005681737,0.008562241,0.0003209982,0.000012414476,0.00025945136,0.00046073133,0.855461,0.013838306,0.016654179,0.10055585,0.0014063453],"about_ca_topic_score_codex":0.00001283468,"about_ca_topic_score_gemma":0.0000010917847,"teacher_disagreement_score":0.7496587,"about_ca_system_score_codex":0.0000141671135,"about_ca_system_score_gemma":0.000048938175,"threshold_uncertainty_score":0.37482435},"labels":[],"label_agreement":null},{"id":"W4205514372","doi":"10.3233/faia210349","title":"Chapter 2. Symbolic Reasoning in Latent Space: Classical Planning as an Example","year":2021,"lang":"en","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Artificial intelligence; Representation (politics); Bottleneck; Symbol (formal); Plan (archaeology); Rotation formalisms in three dimensions; The Symbolic; Set (abstract data type); Automated planning and scheduling; Theoretical computer science; Mathematics; Programming language","score_opus":0.0662229638427432,"score_gpt":0.2864999157755158,"score_spread":0.2202769519327726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205514372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047958837,0.0029117744,0.9570715,0.000687067,0.00030813878,0.0005027641,0.00000994038,0.00012103066,0.037908208],"genre_scores_gemma":[0.46197575,0.003586665,0.4303299,0.0019259278,0.002130796,0.0011661819,0.00070621923,0.00035425872,0.09782432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978102,0.00003797553,0.00056346675,0.00095056783,0.00024312429,0.00039468566],"domain_scores_gemma":[0.9988401,0.00010345268,0.0001777654,0.0006383418,0.00006429769,0.00017604054],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000396371,0.00031896774,0.0004192819,0.00039565834,0.0002193835,0.0002682948,0.00056845706,0.00032489083,0.000038071394],"category_scores_gemma":[0.00001735126,0.0003586538,0.00006884088,0.00020620643,0.00014019047,0.0002546726,0.00018833092,0.000736865,0.000045144345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073819424,0.000034556077,0.0005158474,0.000015981053,0.000011515337,0.000045577806,0.0014828778,0.0013405904,0.000015536534,0.8531704,0.0001498196,0.1432099],"study_design_scores_gemma":[0.00006773033,0.0001311742,0.00015390839,0.0010817917,0.000028650493,0.000037720027,0.00078006857,0.1427078,0.00049153116,0.7323421,0.121115744,0.0010617729],"about_ca_topic_score_codex":0.00020865853,"about_ca_topic_score_gemma":0.00010613343,"teacher_disagreement_score":0.5267416,"about_ca_system_score_codex":0.000083577404,"about_ca_system_score_gemma":0.0001205898,"threshold_uncertainty_score":0.9998866},"labels":[],"label_agreement":null},{"id":"W4211005784","doi":"10.1017/9781108164085.014","title":"Individuals and Relations","year":2017,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Transformational leadership; Appeal; Artificial intelligence; Space (punctuation); Comprehension; Graduate students; Cognitive science; Data science; Mathematics education; Psychology; Pedagogy","score_opus":0.026698798339247206,"score_gpt":0.20343776946156086,"score_spread":0.17673897112231365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211005784","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022814813,0.00026118878,0.018288184,0.000083263476,0.00015852026,0.00016059392,0.00010507402,0.00017963037,0.9807407],"genre_scores_gemma":[0.001167604,0.000037150618,0.0031179613,0.000050302977,0.000053626176,2.8089684e-7,0.000022259757,0.000015972872,0.99553484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989885,0.000028720837,0.00011587448,0.00047283663,0.00019036737,0.00020367831],"domain_scores_gemma":[0.9985585,0.00012142861,0.00026407265,0.0008299772,0.00007609044,0.00014991422],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015581287,0.00023594385,0.00024239605,0.00015617334,0.0006597772,0.0002278721,0.0009992513,0.000296485,0.0000016725155],"category_scores_gemma":[0.00001428209,0.00028255387,0.000080903585,0.000003009601,0.00015865808,0.00025063162,0.00077406666,0.00043974188,0.00002013223],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002522478,0.0000016282795,0.000033668195,0.00002053334,0.000053704967,0.000114017865,0.000115345625,0.000003602319,0.0000019231315,0.96034735,0.036067545,0.0032381373],"study_design_scores_gemma":[0.00024130795,0.00002917419,0.00011919171,0.00021738879,0.00006767565,0.000021533953,0.0000029969358,0.0005424757,0.00001690004,0.0001866896,0.99821335,0.00034128854],"about_ca_topic_score_codex":0.00007212393,"about_ca_topic_score_gemma":9.653185e-7,"teacher_disagreement_score":0.9621458,"about_ca_system_score_codex":0.000051444877,"about_ca_system_score_gemma":0.00012234252,"threshold_uncertainty_score":0.9999627},"labels":[],"label_agreement":null},{"id":"W4211014620","doi":"10.1017/9781108164085.019","title":"References","year":2017,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Transformational leadership; Appeal; Artificial intelligence; Psychology","score_opus":0.041675041397554485,"score_gpt":0.2116641450633984,"score_spread":0.1699891036658439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211014620","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000066267703,0.00020373243,0.016622761,0.00005087419,0.0004039533,0.00014343775,0.00006768241,0.00029551313,0.9822054],"genre_scores_gemma":[0.00093846716,0.000054618547,0.0019650506,0.000056991343,0.00010925614,2.8277793e-7,0.00002107941,0.00001896642,0.9968353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99861276,0.00003375048,0.00013931756,0.00063115824,0.00028470223,0.0002983032],"domain_scores_gemma":[0.99790406,0.00009096845,0.00034952787,0.0013555222,0.00012859468,0.0001712977],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015817513,0.0003267862,0.00033525247,0.0001508908,0.00057981245,0.00026559064,0.0025598842,0.00034827404,0.0000028915147],"category_scores_gemma":[0.000011418786,0.00036641987,0.00015877261,0.000003136681,0.00016496389,0.00024618994,0.00085664203,0.0005379268,0.000050244016],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009320567,0.0000021856272,0.0000026736357,0.000034400935,0.00005197597,0.0003488396,0.000055658133,0.0000027243393,0.0000040470836,0.93898827,0.053166162,0.0073337397],"study_design_scores_gemma":[0.00019881033,0.0000481608,0.000011050537,0.00029890935,0.00004636036,0.000015952448,0.0000030141387,0.0004983964,0.00007434824,0.000126242,0.9982336,0.00044514207],"about_ca_topic_score_codex":0.00017981992,"about_ca_topic_score_gemma":0.0000024970245,"teacher_disagreement_score":0.94506747,"about_ca_system_score_codex":0.000081050406,"about_ca_system_score_gemma":0.00020496426,"threshold_uncertainty_score":0.99987876},"labels":[],"label_agreement":null},{"id":"W4211042487","doi":"10.1017/9781108164085.003","title":"Agent Architectures and Hierarchical Control","year":2017,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Transformational leadership; Appeal; Artificial intelligence; Control (management); Comprehension; Space (punctuation); Data science; Psychology","score_opus":0.018471374416919248,"score_gpt":0.19843445838605098,"score_spread":0.17996308396913174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211042487","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059279628,0.0003503129,0.061264545,0.00013001036,0.00020719848,0.00025168117,0.000112448535,0.00019267239,0.9374319],"genre_scores_gemma":[0.013673251,0.00003057861,0.001691374,0.00018147766,0.00012380771,5.502066e-7,0.000010635487,0.000022883107,0.98426545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99859816,0.000060592894,0.00013711475,0.00063647196,0.00025369079,0.00031397238],"domain_scores_gemma":[0.9983425,0.00018894309,0.0002260848,0.00092060684,0.00006390601,0.0002579715],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016199732,0.00033884821,0.0003801467,0.00016096472,0.00054208114,0.0002219247,0.0012811716,0.00029017922,0.0000011394911],"category_scores_gemma":[0.00001652404,0.00036067065,0.00014187276,0.0000024309707,0.00029855466,0.000069822294,0.00066304277,0.0007049735,0.0000068983327],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004843672,0.000003882881,0.00000979211,0.000060113845,0.0001144555,0.000705152,0.00012892809,0.000023345065,0.000013420792,0.9733617,0.009327002,0.016203808],"study_design_scores_gemma":[0.0007671018,0.000090023736,0.00008902693,0.00025243426,0.00008759561,0.00006461976,0.0000015184936,0.0031335356,0.00003650999,0.00020496071,0.9947788,0.00049386953],"about_ca_topic_score_codex":0.00009111621,"about_ca_topic_score_gemma":0.0000017593205,"teacher_disagreement_score":0.9854518,"about_ca_system_score_codex":0.00003932817,"about_ca_system_score_gemma":0.000121636025,"threshold_uncertainty_score":0.99988455},"labels":[],"label_agreement":null},{"id":"W4211044724","doi":"10.1017/9781108164085.017","title":"Retrospect and Prospect","year":2017,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Transformational leadership; Computer science; Appeal; Artificial intelligence; Space (punctuation); Graduate students; Comprehension; Data science; Cognitive science; Management science; Engineering; Psychology; Pedagogy","score_opus":0.021086572420969552,"score_gpt":0.19522009094905754,"score_spread":0.17413351852808798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211044724","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027103768,0.0003727954,0.009258656,0.0000541311,0.00025175654,0.00024842974,0.00006494088,0.00028800062,0.9894342],"genre_scores_gemma":[0.0020565868,0.00007897019,0.0021466992,0.000045303375,0.000109504595,3.6728153e-7,0.000011289628,0.000026081645,0.9955252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985589,0.000024307743,0.00013330861,0.00072954764,0.00025146827,0.00030247882],"domain_scores_gemma":[0.9981537,0.000065402935,0.00030292274,0.0011911005,0.00010011836,0.0001867947],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017293496,0.00034658914,0.00037376911,0.00013673461,0.00060135557,0.00031907242,0.0013461523,0.00030945154,0.0000014265439],"category_scores_gemma":[0.000013899475,0.00039597895,0.0001219229,0.0000036994888,0.00021404153,0.00023681483,0.0009230476,0.0005562274,0.0000137135885],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013914355,0.0000023389084,0.000028084229,0.000056962457,0.00005607331,0.00050162163,0.00006636616,8.80838e-7,0.000010537951,0.9739021,0.022476267,0.002884832],"study_design_scores_gemma":[0.00041002844,0.00009604581,0.000115428025,0.00034919937,0.00006772644,0.00005823453,0.000002151867,0.0007967367,0.00012211944,0.00020300868,0.9972012,0.00057809625],"about_ca_topic_score_codex":0.00010213692,"about_ca_topic_score_gemma":0.000001719788,"teacher_disagreement_score":0.97472495,"about_ca_system_score_codex":0.000106004634,"about_ca_system_score_gemma":0.0001230834,"threshold_uncertainty_score":0.9998492},"labels":[],"label_agreement":null},{"id":"W4211073438","doi":"10.1017/9781108164085.011","title":"Learning with Uncertainty","year":2017,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Transformational leadership; Appeal; Artificial intelligence; Space (punctuation); Comprehension; Psychology","score_opus":0.019607937336531225,"score_gpt":0.1922297637064948,"score_spread":0.1726218263699636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211073438","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031629246,0.00008304738,0.033911943,0.000037086258,0.00015028213,0.00017920832,0.000026063504,0.00036921445,0.9652115],"genre_scores_gemma":[0.002745433,0.000023118584,0.0018908603,0.000043450265,0.00008511356,4.0971636e-7,0.000027903177,0.000031643478,0.99515206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984729,0.000048099202,0.00012353927,0.00067947217,0.00032192777,0.0003540031],"domain_scores_gemma":[0.9980633,0.000110158544,0.00039431092,0.0010763585,0.00016795644,0.0001879066],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017504806,0.00037880352,0.00036570994,0.00014847102,0.0008184341,0.00026213442,0.0017513618,0.00029291143,0.0000019411477],"category_scores_gemma":[0.000011802315,0.0003881458,0.00012910874,0.000004865819,0.00019837981,0.00022853793,0.0006346533,0.00090199785,0.000023168552],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053142343,0.0000036726633,0.000015557887,0.00006444418,0.00012816388,0.0010493654,0.00018040475,0.00053452374,0.000006583491,0.97796714,0.01210851,0.007888513],"study_design_scores_gemma":[0.00042647411,0.00017262094,0.000009696565,0.00048174305,0.00007300091,0.000040101313,0.0000098543715,0.003766769,0.000043461903,0.000020510119,0.9943936,0.00056215347],"about_ca_topic_score_codex":0.00025534382,"about_ca_topic_score_gemma":0.0000038406324,"teacher_disagreement_score":0.9822851,"about_ca_system_score_codex":0.000129666,"about_ca_system_score_gemma":0.0002513917,"threshold_uncertainty_score":0.99985707},"labels":[],"label_agreement":null},{"id":"W4211079681","doi":"10.1017/9781108164085.005","title":"Reasoning with Constraints","year":2017,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Transformational leadership; Appeal; Artificial intelligence; Space (punctuation); Comprehension; Cognitive science; Psychology","score_opus":0.02079924289910996,"score_gpt":0.1946481557597843,"score_spread":0.17384891286067436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211079681","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012819051,0.00008718017,0.070773125,0.000026892136,0.00016404696,0.00018477104,0.0000640842,0.00028016037,0.92840695],"genre_scores_gemma":[0.0021762042,0.000015226412,0.007324695,0.000055406286,0.00007478067,3.5558037e-7,0.000020364228,0.000029069517,0.9903039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985336,0.00003119212,0.0001253809,0.0006639777,0.0002992928,0.0003465704],"domain_scores_gemma":[0.9979354,0.00008598369,0.00038333124,0.0012352027,0.00015364638,0.00020640933],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015980015,0.00036813057,0.0003606184,0.00013857007,0.00060969463,0.00026131136,0.0017094035,0.00029004665,0.0000029411656],"category_scores_gemma":[0.000010783151,0.00038799224,0.00011516186,0.000004031388,0.00042101572,0.00024160134,0.0005362167,0.00059665315,0.00002098171],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025061874,0.0000027407295,0.000010461129,0.0000407749,0.00010311378,0.0013364532,0.00008575512,0.000010615075,0.0000039686574,0.9788637,0.011777571,0.0077397814],"study_design_scores_gemma":[0.00055236026,0.00009329947,0.000022855185,0.0011054002,0.0000946362,0.00013828407,0.000008248994,0.0008528604,0.00009380328,0.000025928344,0.996336,0.00067632756],"about_ca_topic_score_codex":0.00009684521,"about_ca_topic_score_gemma":0.0000019302124,"teacher_disagreement_score":0.9845584,"about_ca_system_score_codex":0.000100032215,"about_ca_system_score_gemma":0.00030891292,"threshold_uncertainty_score":0.9998572},"labels":[],"label_agreement":null},{"id":"W4211081006","doi":"10.1017/9781108164085.008","title":"Supervised Machine Learning","year":2017,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Transformational leadership; Appeal; Space (punctuation); Graduate students; Data science; Psychology; Pedagogy","score_opus":0.027558574491813318,"score_gpt":0.19845989293022778,"score_spread":0.17090131843841447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211081006","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013822486,0.00037053114,0.028626245,0.00005190227,0.0003122293,0.00018562637,0.000067122775,0.00045687525,0.9699156],"genre_scores_gemma":[0.0013391745,0.000070219554,0.0020874972,0.00006289412,0.00010957824,3.4501858e-7,0.00006340141,0.000038539616,0.99622834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99835,0.00006524392,0.00016968176,0.0007137857,0.0003201156,0.00038115663],"domain_scores_gemma":[0.99797225,0.00012017861,0.00033442336,0.001219769,0.00013507977,0.00021828074],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022427081,0.0004145755,0.00041910168,0.00019729964,0.0008727589,0.0002820844,0.002283537,0.00037286428,0.0000054182915],"category_scores_gemma":[0.000021424064,0.0004886454,0.00022649062,0.0000048051284,0.00014010574,0.00026303696,0.0010839815,0.0010140453,0.00005138073],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002795658,0.0000051794354,0.000023823204,0.00008328358,0.00011214056,0.0009103024,0.00015389483,0.000050472532,0.000025737292,0.9730251,0.015203054,0.010379045],"study_design_scores_gemma":[0.00045376297,0.00006941365,0.000009435278,0.00028054355,0.00006483656,0.000026748754,0.0000030068675,0.012385732,0.00009091713,0.000027234822,0.9860235,0.00056488346],"about_ca_topic_score_codex":0.00030824324,"about_ca_topic_score_gemma":0.000002696936,"teacher_disagreement_score":0.9729979,"about_ca_system_score_codex":0.00010964288,"about_ca_system_score_gemma":0.00016513404,"threshold_uncertainty_score":0.9997565},"labels":[],"label_agreement":null},{"id":"W4211108184","doi":"10.1017/9781108164085.006","title":"Propositions and Inference","year":2017,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Appeal; Transformational leadership; Inference; Artificial intelligence; Space (punctuation); Comprehension; Graduate students; Data science; Cognitive science; Psychology; Pedagogy","score_opus":0.027831141919361764,"score_gpt":0.21531406778641587,"score_spread":0.18748292586705412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211108184","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000151352915,0.00015782657,0.047071483,0.00006491759,0.00013892472,0.0001827176,0.000075959855,0.00018732289,0.9521057],"genre_scores_gemma":[0.003028475,0.000055844248,0.0028112107,0.000047864734,0.000050041734,4.4634746e-7,0.000016909567,0.000013946859,0.9939753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990079,0.0000241733,0.00010146251,0.00048693625,0.00016771758,0.00021184114],"domain_scores_gemma":[0.99860084,0.00008962936,0.00020750635,0.0008335501,0.00011165237,0.00015680736],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009225548,0.00024581494,0.00023554282,0.00012166904,0.00063966605,0.00025656412,0.0010295123,0.00023530381,0.0000010359928],"category_scores_gemma":[0.000011749447,0.00028263484,0.00007270837,0.0000027978654,0.00020991053,0.00024519127,0.0007715007,0.00041249202,0.000011668829],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056927206,0.0000024859132,0.0000058859055,0.00004536797,0.00003560549,0.00021681476,0.000075092794,0.0000024004512,0.000010185769,0.98705024,0.008019771,0.0045304904],"study_design_scores_gemma":[0.00027686576,0.00007068809,0.000040290404,0.00046834492,0.00007180186,0.00003759423,0.0000032208025,0.0015711006,0.00008754381,0.0002390456,0.9966346,0.0004989231],"about_ca_topic_score_codex":0.00011539092,"about_ca_topic_score_gemma":0.0000018490288,"teacher_disagreement_score":0.9886148,"about_ca_system_score_codex":0.000052512976,"about_ca_system_score_gemma":0.00016005777,"threshold_uncertainty_score":0.99996257},"labels":[],"label_agreement":null},{"id":"W4211108189","doi":"10.1017/9781108164085.012","title":"Multiagent Systems","year":2017,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Transformational leadership; Appeal; Artificial intelligence; Comprehension; Psychology","score_opus":0.03486630078774797,"score_gpt":0.20487092427336479,"score_spread":0.17000462348561682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211108189","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000050227636,0.0004960656,0.055838376,0.000021961238,0.00093111687,0.00030861708,0.000102448794,0.0003381368,0.94195825],"genre_scores_gemma":[0.0013764076,0.000044623015,0.0010087342,0.000034427798,0.0001575305,6.913205e-7,0.00002507322,0.000029926454,0.99732256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99838877,0.000047782625,0.00018249507,0.0006920081,0.00033935448,0.00034956512],"domain_scores_gemma":[0.9974623,0.00009405193,0.000428574,0.0016341517,0.00015520526,0.00022572035],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019854472,0.00038260533,0.0004070639,0.00016654043,0.0005968392,0.00036078782,0.002328753,0.00038199904,0.0000011380715],"category_scores_gemma":[0.000010613453,0.0004414163,0.0001945408,0.0000031267448,0.00012688032,0.0002157456,0.00090327417,0.00052903575,0.0000604314],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010399235,0.0000039564534,0.0000022571307,0.000101205944,0.00009419361,0.00081020704,0.000076145545,0.00006521032,0.000007872682,0.93795043,0.05856388,0.0023142365],"study_design_scores_gemma":[0.00031678498,0.00003948302,0.0000056571494,0.00048089877,0.00006322813,0.000031702868,0.000004795118,0.007148741,0.000043154236,0.000008316308,0.99135363,0.000503637],"about_ca_topic_score_codex":0.00038299672,"about_ca_topic_score_gemma":0.0000010236072,"teacher_disagreement_score":0.93794215,"about_ca_system_score_codex":0.00016025598,"about_ca_system_score_gemma":0.0001736083,"threshold_uncertainty_score":0.9998038},"labels":[],"label_agreement":null},{"id":"W4211144813","doi":"10.1017/9781108164085.007","title":"Planning with Certainty","year":2017,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Certainty; Transformational leadership; Appeal; Artificial intelligence; Space (punctuation); Learning styles; Cognitive science; Data science; Mathematics education; Psychology; Epistemology","score_opus":0.0296057109067396,"score_gpt":0.2062227858067342,"score_spread":0.1766170748999946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211144813","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020206442,0.00014915976,0.06201178,0.000038159356,0.00019210088,0.00020090122,0.00005044555,0.00033324125,0.937004],"genre_scores_gemma":[0.0022538465,0.000009283504,0.003344126,0.00007155465,0.000103904,4.798053e-7,0.000027472375,0.000035287274,0.99415404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99838644,0.00003360487,0.00013902104,0.00071896997,0.00033337518,0.00038859545],"domain_scores_gemma":[0.9977439,0.00011111208,0.00039599216,0.0013913462,0.00014379322,0.00021386486],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015346955,0.00041743842,0.00039863223,0.00017617064,0.0007066631,0.0002781564,0.0020401427,0.00032035718,0.0000020797359],"category_scores_gemma":[0.000007850382,0.0004272038,0.00013132521,0.000004741542,0.00019001364,0.0002660182,0.00066372036,0.0006790328,0.000014962944],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061676204,0.0000040611094,0.000019860088,0.00006972008,0.00013880461,0.0020677333,0.00019254377,0.00013012691,0.0000046715872,0.96335346,0.030573783,0.0033835792],"study_design_scores_gemma":[0.0004972997,0.00011383807,0.0000251955,0.0007887344,0.000082756334,0.00006507929,0.000008719116,0.0017773634,0.00006736291,0.000034094734,0.99588907,0.00065047125],"about_ca_topic_score_codex":0.000190308,"about_ca_topic_score_gemma":0.0000020499497,"teacher_disagreement_score":0.9653153,"about_ca_system_score_codex":0.000120160694,"about_ca_system_score_gemma":0.00023499227,"threshold_uncertainty_score":0.99981797},"labels":[],"label_agreement":null},{"id":"W4211171579","doi":"10.1017/9781108164085.004","title":"Searching for Solutions","year":2017,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Transformational leadership; Appeal; Artificial intelligence; Space (punctuation); Comprehension; Graduate students; Data science; Psychology; Pedagogy","score_opus":0.061546713781970665,"score_gpt":0.23413411640149046,"score_spread":0.1725874026195198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211171579","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000013252483,0.0001092973,0.27944174,0.00006886171,0.00025671002,0.0002719878,0.0002323248,0.00019180017,0.7194259],"genre_scores_gemma":[0.00033919068,0.000018417131,0.0080471095,0.000049261067,0.00014288312,0.0000012353906,0.000039709572,0.000025653933,0.9913365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99866754,0.000028894954,0.00012643129,0.0005531021,0.0002076851,0.00041635262],"domain_scores_gemma":[0.9981646,0.00020411554,0.00024411031,0.0010586601,0.00015729138,0.00017119973],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00027559436,0.0002658393,0.000278269,0.00016716192,0.0013216104,0.00018635996,0.0018207488,0.00025915127,6.874055e-7],"category_scores_gemma":[0.000023717423,0.00032433946,0.00023115943,0.0000029268294,0.0001388345,0.00022970287,0.0008369993,0.000455675,0.000012583932],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012379827,0.0000027308915,3.858249e-7,0.00006137124,0.000060786235,0.00007326942,0.000073307376,0.00002635953,0.000011107295,0.948113,0.044259805,0.0073054708],"study_design_scores_gemma":[0.00032229346,0.000050113187,0.0000029366029,0.00026441138,0.00005766393,0.00001207303,0.0000032296166,0.006801465,0.00004545945,0.00030428596,0.9917602,0.00037589704],"about_ca_topic_score_codex":0.00014022365,"about_ca_topic_score_gemma":0.000002724094,"teacher_disagreement_score":0.94780874,"about_ca_system_score_codex":0.00011701301,"about_ca_system_score_gemma":0.00025173865,"threshold_uncertainty_score":0.99997854},"labels":[],"label_agreement":null},{"id":"W4211178391","doi":"10.1017/9781108164085.010","title":"Planning with Uncertainty","year":2017,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Transformational leadership; Computer science; Appeal; Artificial intelligence; Space (punctuation); Comprehension; Graduate students; Data science; Management science; Engineering; Psychology; Pedagogy","score_opus":0.028948320301954013,"score_gpt":0.2081591196094088,"score_spread":0.1792107993074548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211178391","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002526788,0.00016022,0.053907026,0.00003734078,0.00019814997,0.00020420314,0.00006376795,0.00033689503,0.9450671],"genre_scores_gemma":[0.001971641,0.000010665002,0.0028414326,0.00007619813,0.00010516837,5.1355124e-7,0.000032691438,0.00003351654,0.9949282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998364,0.000033294662,0.00014047348,0.00072812,0.00034542909,0.00038872386],"domain_scores_gemma":[0.9977304,0.000113314054,0.00040395654,0.0013891597,0.0001520406,0.00021118022],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016031634,0.00042154494,0.00040203275,0.00017130029,0.00071085856,0.00027582597,0.0020626204,0.00031796235,0.0000014881483],"category_scores_gemma":[0.000007829901,0.00042798035,0.00012926542,0.0000051146876,0.00020704277,0.00025765476,0.00064655155,0.0006788673,0.000016372142],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006678962,0.000003999301,0.000015563577,0.00006829452,0.0001422974,0.0018768909,0.0001909921,0.00040109782,0.0000054766824,0.9639256,0.030235846,0.003067175],"study_design_scores_gemma":[0.0005011329,0.00011871592,0.000015513118,0.0008505191,0.000083542196,0.000057736248,0.000008949705,0.0028195137,0.00005389641,0.000035242952,0.9948017,0.00065356056],"about_ca_topic_score_codex":0.00020102944,"about_ca_topic_score_gemma":0.0000020915709,"teacher_disagreement_score":0.9645658,"about_ca_system_score_codex":0.0001355656,"about_ca_system_score_gemma":0.00027803192,"threshold_uncertainty_score":0.9998172},"labels":[],"label_agreement":null},{"id":"W4211192158","doi":"10.1017/9781108164085.009","title":"Reasoning with Uncertainty","year":2017,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Transformational leadership; Appeal; Artificial intelligence; Space (punctuation); Comprehension; Psychology","score_opus":0.01990537237156129,"score_gpt":0.19563887325603269,"score_spread":0.1757335008844714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211192158","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021618293,0.00012316856,0.045869667,0.000037498423,0.00017707169,0.00019721081,0.00005731349,0.00032546217,0.953191],"genre_scores_gemma":[0.0013027791,0.000020837615,0.0048701917,0.000061911654,0.00009625617,4.8713525e-7,0.000028175156,0.00003248425,0.9935869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984009,0.000036133722,0.00012978283,0.00072630367,0.0003343675,0.00037248642],"domain_scores_gemma":[0.9976441,0.00009289218,0.00040148597,0.0014780633,0.00017483208,0.00020859201],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017608312,0.00039914245,0.00038359215,0.00014514691,0.00071262615,0.00027674026,0.0019837301,0.0003018474,0.000001676902],"category_scores_gemma":[0.000011225293,0.0004069454,0.00013220501,0.000005182457,0.00020605577,0.000255055,0.00064995186,0.0006374375,0.00001766744],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044350407,0.0000030712313,0.000008713533,0.00004710925,0.00010569029,0.00097151264,0.00010014942,0.00010200956,0.000003633906,0.97692525,0.017633772,0.0040547573],"study_design_scores_gemma":[0.0004403323,0.0000959696,0.000014972326,0.0008398265,0.00008709019,0.000058255817,0.000006297767,0.0028501789,0.000054533295,0.000028808385,0.9949085,0.00061519415],"about_ca_topic_score_codex":0.00035413812,"about_ca_topic_score_gemma":0.000005916052,"teacher_disagreement_score":0.9772748,"about_ca_system_score_codex":0.00015010657,"about_ca_system_score_gemma":0.0002972922,"threshold_uncertainty_score":0.99983823},"labels":[],"label_agreement":null},{"id":"W4211215363","doi":"10.1017/9781108164085.002","title":"Artificial Intelligence and Agents","year":2017,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Transformational leadership; Artificial intelligence; Appeal; Space (punctuation); Comprehension; Cognitive science; Data science; Psychology","score_opus":0.06645659284917399,"score_gpt":0.23208691153709402,"score_spread":0.16563031868792003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211215363","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021496227,0.00013935706,0.09521689,0.00004622142,0.00029978043,0.00015727729,0.00004702069,0.0001466453,0.9039253],"genre_scores_gemma":[0.0038635477,0.000062731975,0.0019662573,0.000059642844,0.0000948811,2.567042e-7,0.000011577953,0.00001808395,0.993923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987635,0.00002769818,0.00015115576,0.0005871984,0.00021502482,0.00025543483],"domain_scores_gemma":[0.99854666,0.000080169775,0.00025332166,0.0008611862,0.00008393852,0.00017472843],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015725722,0.00027970376,0.00026941622,0.00013542412,0.0005205759,0.0002605461,0.001323257,0.00026604207,0.000001951399],"category_scores_gemma":[0.000013291216,0.00033298845,0.00009317254,0.000003400838,0.00020611032,0.00019704731,0.00090156903,0.00041912385,0.00002339241],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000123150785,0.0000030641006,0.0000025014492,0.000037021604,0.000039985407,0.00036988733,0.000106711035,0.0000082580445,0.0000041994913,0.9529672,0.0068775923,0.03957126],"study_design_scores_gemma":[0.00006653642,0.00006875808,0.000015408421,0.0003388716,0.000067586865,0.00003156692,0.000007717475,0.006155881,0.00030274887,0.0007752981,0.99158293,0.00058668054],"about_ca_topic_score_codex":0.00010331056,"about_ca_topic_score_gemma":0.0000018505916,"teacher_disagreement_score":0.9847053,"about_ca_system_score_codex":0.000057152025,"about_ca_system_score_gemma":0.000098019,"threshold_uncertainty_score":0.9999122},"labels":[],"label_agreement":null},{"id":"W4211226519","doi":"10.1017/9781108164085.016","title":"Relational Planning, Learning, and Probabilistic Reasoning","year":2017,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Transformational leadership; Probabilistic logic; Comprehension; Space (punctuation); Cognitive science; Psychology","score_opus":0.03201898165424304,"score_gpt":0.21708048445618036,"score_spread":0.18506150280193734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211226519","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005658309,0.0004807173,0.02273845,0.000028916244,0.00017461259,0.00020571276,0.0000257994,0.0002889654,0.97600025],"genre_scores_gemma":[0.0019125483,0.000027274973,0.0037831399,0.000021250667,0.00009786664,6.3956224e-7,0.00004027153,0.000028264936,0.99408877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984773,0.000058203248,0.00016593025,0.00070676405,0.00029374036,0.00029806924],"domain_scores_gemma":[0.9984583,0.00020283616,0.0004418773,0.0005757456,0.00013096495,0.00019023044],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002609386,0.000341334,0.0003260568,0.00016048666,0.00094115624,0.00023996673,0.00079722365,0.0003575672,0.0000022793295],"category_scores_gemma":[0.00007763876,0.0004079414,0.00009907444,0.0000044802196,0.00018818643,0.0002487075,0.00073228567,0.0008980988,0.000010346921],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018952069,0.000002612015,0.00013265017,0.00006844188,0.000060839968,0.00035511085,0.00018199274,0.00017670338,0.000002333593,0.98848116,0.008884544,0.001634676],"study_design_scores_gemma":[0.00034961334,0.00007846247,0.00013748316,0.0007954879,0.00007325162,0.00006734699,0.00000587925,0.010465115,0.000005555578,0.00015101764,0.987359,0.00051180174],"about_ca_topic_score_codex":0.00005607214,"about_ca_topic_score_gemma":5.3363317e-7,"teacher_disagreement_score":0.9883301,"about_ca_system_score_codex":0.000102550606,"about_ca_system_score_gemma":0.00018714496,"threshold_uncertainty_score":0.9998372},"labels":[],"label_agreement":null},{"id":"W4211230460","doi":"10.1017/9781108164085.001","title":"Preface","year":2017,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Transformational leadership; Appeal; Artificial intelligence; Graduate students; Space (punctuation); Comprehension; Cognitive science; Psychology; Pedagogy","score_opus":0.02930322200108413,"score_gpt":0.20408841520555568,"score_spread":0.17478519320447156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211230460","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000055263363,0.00021303025,0.036274537,0.00005088137,0.0004020188,0.00020918348,0.000076401055,0.00035883908,0.96240956],"genre_scores_gemma":[0.00049687177,0.000036346548,0.0023979426,0.000066123226,0.0001097341,3.3770482e-7,0.0000194787,0.000028051163,0.9968451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99850714,0.000033443786,0.00014296031,0.0006858685,0.00029324632,0.00033735565],"domain_scores_gemma":[0.9975847,0.00008487628,0.00035191694,0.0016515872,0.0001270388,0.00019987221],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015713024,0.00036273134,0.0003489627,0.0001413258,0.00057694654,0.0002524902,0.0025838134,0.0003766916,0.0000024594144],"category_scores_gemma":[0.000011606858,0.00042919305,0.00018995165,0.0000031534432,0.00015218707,0.00026564745,0.0010602637,0.0005900398,0.00006241761],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011907297,0.0000030296105,0.0000021316862,0.00004879146,0.00006570724,0.0004366414,0.00006913686,0.000010038122,0.000008960712,0.92311174,0.07139121,0.004840684],"study_design_scores_gemma":[0.0002701958,0.00004384866,0.000008894431,0.00028666167,0.00005408237,0.00002162034,0.0000019137153,0.0009431977,0.0001363164,0.00005962025,0.9976851,0.0004886005],"about_ca_topic_score_codex":0.00012229825,"about_ca_topic_score_gemma":0.0000012612923,"teacher_disagreement_score":0.92629385,"about_ca_system_score_codex":0.00011465757,"about_ca_system_score_gemma":0.00020672883,"threshold_uncertainty_score":0.999816},"labels":[],"label_agreement":null},{"id":"W4211235525","doi":"10.1017/9781107358331.015","title":"Coherence as Constraint Satisfaction","year":2019,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Coherence (philosophical gambling strategy); Constraint satisfaction; Computer science; Constraint (computer-aided design); Constraint satisfaction problem; Psychology; Mathematics; Artificial intelligence; Statistics","score_opus":0.020555861948868204,"score_gpt":0.19777157411903362,"score_spread":0.1772157121701654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211235525","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010386006,0.00009169713,0.033319872,0.000033096225,0.00049643946,0.00032625065,0.000078827354,0.00031702893,0.9652329],"genre_scores_gemma":[0.0072852485,0.00001664228,0.0016974742,0.0001337729,0.000056048164,3.4285642e-7,0.000022541817,0.000022137576,0.9907658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998511,0.000047095655,0.00017320897,0.0006562359,0.00031648413,0.0002959797],"domain_scores_gemma":[0.99847436,0.00015484449,0.00027607588,0.0007903111,0.0001420845,0.00016233193],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013642998,0.00034048333,0.00033221845,0.00015848654,0.00020702714,0.0001327885,0.00086217094,0.0003695828,0.000011972684],"category_scores_gemma":[0.000008843822,0.00041127563,0.00015234809,0.000010635482,0.00014813912,0.00020276738,0.0004286093,0.00061047234,0.00020449076],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015906804,0.000002218809,0.000018178245,0.000054413667,0.000064071704,0.00023391297,0.000066015156,0.00002871007,0.000057232977,0.9725583,0.016930388,0.009970656],"study_design_scores_gemma":[0.00056287163,0.00015979417,0.00006778058,0.0005434281,0.000086340326,0.00010631462,0.000019458883,0.0013185983,0.00049131975,0.00012021808,0.99567074,0.0008531161],"about_ca_topic_score_codex":0.00041368217,"about_ca_topic_score_gemma":0.0000028327709,"teacher_disagreement_score":0.9787404,"about_ca_system_score_codex":0.00018075612,"about_ca_system_score_gemma":0.00044082565,"threshold_uncertainty_score":0.9998339},"labels":[],"label_agreement":null},{"id":"W4211251121","doi":"10.1017/9781108164085.018","title":"Mathematical Preliminaries and Notation","year":2017,"lang":"en","type":"other","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Notation; Computer science; Transformational leadership; Artificial intelligence; Space (punctuation); Appeal; Comprehension; Mathematics education; Cognitive science; Psychology; Mathematics","score_opus":0.014493078101598224,"score_gpt":0.24691547003262043,"score_spread":0.2324223919310222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211251121","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.054488e-7,0.00030154275,0.42469057,0.00023854115,0.00006423027,0.000047039965,0.0000010244491,0.00017494531,0.5744813],"genre_scores_gemma":[0.0002562038,0.00002340491,0.1686311,0.00006397669,0.00005661598,0.000004854627,0.0000033078431,0.00003662059,0.8309239],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995464,0.000013622325,0.0000560203,0.00018935201,0.0000953555,0.000099261706],"domain_scores_gemma":[0.9994295,0.0000638554,0.000089903035,0.0003715315,0.0000084264275,0.00003674472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000095809744,0.00009788987,0.00011827701,0.000057294837,0.00007888652,0.00022345182,0.00031158494,0.000112217254,0.0001557576],"category_scores_gemma":[0.000038658716,0.00007751726,0.000014644602,0.000014757167,0.000039244333,0.000074804506,0.00010480521,0.00007395498,0.0001165467],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.8041396e-7,0.00000651146,0.000036565132,0.00012689548,0.000012507846,0.000008198331,0.00029545103,8.2461736e-7,0.0000015502271,0.10217872,0.8671032,0.03022885],"study_design_scores_gemma":[0.00015628675,0.00006720471,0.000073025396,0.0008235379,0.000015808297,0.00002606162,0.000007267814,0.022369396,0.000029242223,0.01787151,0.95822155,0.00033909638],"about_ca_topic_score_codex":0.000040385636,"about_ca_topic_score_gemma":0.000009534693,"teacher_disagreement_score":0.2564426,"about_ca_system_score_codex":0.000003219943,"about_ca_system_score_gemma":0.000024301675,"threshold_uncertainty_score":0.3161062},"labels":[],"label_agreement":null},{"id":"W4229810260","doi":"10.22215/etd/2016-11321","title":"Contributions to Techniques for Learning Non-Reactive Behaviour from Observation","year":2016,"lang":"en","type":"dissertation","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Benchmark (surveying); Computer science; Artificial intelligence; Machine learning; Metric (unit); Jaccard index; Reactive nitrogen; Engineering; Pattern recognition (psychology)","score_opus":0.015620261445993612,"score_gpt":0.30955835535973714,"score_spread":0.29393809391374354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229810260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018031407,0.000030168474,0.97622925,0.00079821685,0.0004750426,0.00075455103,0.00019998726,0.00054069294,0.0029407113],"genre_scores_gemma":[0.53118056,0.000009176973,0.4165481,0.0005052233,0.0005870922,0.0013343564,0.007357015,0.00007108894,0.042407393],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99865687,0.00004357884,0.00028446116,0.0005245074,0.00020014828,0.0002904526],"domain_scores_gemma":[0.99824566,0.0004927025,0.00024374848,0.0003053306,0.0006119088,0.00010063615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003028128,0.00023317852,0.0002618084,0.00016522045,0.00035827878,0.00018149472,0.00051291054,0.0003128833,0.000019910121],"category_scores_gemma":[0.00027387566,0.0002003153,0.00010812549,0.0001804448,0.0000054880898,0.0003633422,0.00004065754,0.00026586273,0.000048657508],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004206644,0.00027624943,0.022750666,0.00017486603,0.000382731,0.000019732544,0.013977009,0.00014829135,0.15600267,0.047282018,0.061289463,0.69727564],"study_design_scores_gemma":[0.0015488833,0.0015248614,0.0670818,0.003854487,0.0002897616,0.0000030445342,0.0009664213,0.014850969,0.8117203,0.0352676,0.05973477,0.0031570815],"about_ca_topic_score_codex":0.0007877067,"about_ca_topic_score_gemma":0.00012238974,"teacher_disagreement_score":0.69411856,"about_ca_system_score_codex":0.00014404449,"about_ca_system_score_gemma":0.00021755004,"threshold_uncertainty_score":0.8168621},"labels":[],"label_agreement":null},{"id":"W4232581922","doi":"10.32920/ryerson.14647755.v1","title":"Efficient Lifted Planning with Regression-Based Heuristics","year":2021,"lang":"en","type":"preprint","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Heuristics; Planner; Benchmark (surveying); Computer science; Set (abstract data type); Automated planning and scheduling; Heuristic; Task (project management); Operator (biology); Artificial intelligence; Regression; Machine learning; Operations research; Mathematical optimization; Mathematics; Engineering; Programming language","score_opus":0.02248054395742178,"score_gpt":0.25953985814089664,"score_spread":0.23705931418347487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232581922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029026056,0.00085574656,0.9641872,0.00082112633,0.0007301411,0.00021964747,0.000009693384,0.00074841065,0.0034019565],"genre_scores_gemma":[0.6083052,0.0000017224512,0.39051327,0.0005917215,0.00008410806,0.00002642217,0.00010498567,0.000028952949,0.0003436129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971305,0.00018213785,0.00039621897,0.001095211,0.00068722083,0.0005087198],"domain_scores_gemma":[0.99714965,0.0005057687,0.0003295414,0.0015007263,0.00028854344,0.00022577203],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004651722,0.00047157085,0.00047590205,0.00021405489,0.00027064822,0.00072875706,0.0012820133,0.00032580705,0.000047846945],"category_scores_gemma":[0.000113130336,0.00034814767,0.00012191313,0.00041490872,0.000054065928,0.00003777519,0.0010401264,0.0011150619,0.000016004607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019983716,0.00008148991,0.0034208512,0.00020994803,0.000043364158,0.00067987136,0.00082319486,0.9904734,0.000024268378,0.00044726182,0.0021982538,0.001578112],"study_design_scores_gemma":[0.00032434464,0.00008106958,0.0005827603,0.0031458202,0.000025071979,0.000019266898,0.000059655387,0.9938964,0.0007094336,0.000095018215,0.00047680314,0.0005843581],"about_ca_topic_score_codex":0.00008765384,"about_ca_topic_score_gemma":0.0000036637823,"teacher_disagreement_score":0.5792792,"about_ca_system_score_codex":0.00008250901,"about_ca_system_score_gemma":0.0011459524,"threshold_uncertainty_score":0.99989706},"labels":[],"label_agreement":null},{"id":"W4234128596","doi":"10.1088/1742-6596/1550/1/011001","title":"Preface","year":2020,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Library science; China; Operations research; Control (management); Engineering; State (computer science); Computer science; Political science; Artificial intelligence; Law; Algorithm","score_opus":0.0423181439502608,"score_gpt":0.23595270718312222,"score_spread":0.19363456323286143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234128596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074743796,0.00011622707,0.9819505,0.008746333,0.00019719682,0.000028400194,0.0000017140861,0.000040493287,0.001444726],"genre_scores_gemma":[0.9631582,0.000020609295,0.035997525,0.0004938842,0.00024820302,3.769177e-7,4.090582e-7,0.000004485434,0.00007633636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992642,0.000043669923,0.00022079417,0.000105166495,0.00023091552,0.00013527712],"domain_scores_gemma":[0.99918294,0.000048403588,0.00026959062,0.00012792276,0.00024832797,0.00012284298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012860837,0.00009145559,0.00017892806,0.00001686946,0.00006746262,0.00018146046,0.00063563336,0.000026572641,0.000014534532],"category_scores_gemma":[0.000048955644,0.000076235134,0.00006546384,0.00017736103,0.00003372193,0.0011539988,0.00008934093,0.00023521886,0.000019148541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104811894,0.000077001154,0.0023341752,0.00012815701,0.00012425383,0.00014146724,0.025306666,0.0037631243,0.026159924,0.56071216,0.010156703,0.3709916],"study_design_scores_gemma":[0.001546427,0.0036910907,0.0021470438,0.0005894579,0.000070404014,0.000254667,0.0013420911,0.035899553,0.69684654,0.18978697,0.06670313,0.0011226393],"about_ca_topic_score_codex":0.0000016887224,"about_ca_topic_score_gemma":2.6039282e-7,"teacher_disagreement_score":0.95568377,"about_ca_system_score_codex":0.000008353426,"about_ca_system_score_gemma":0.00023091289,"threshold_uncertainty_score":0.31087786},"labels":[],"label_agreement":null},{"id":"W4234364729","doi":"10.1023/a:1011327402056","title":"Prefacr","year":2000,"lang":"en","type":"article","venue":"Foundations of Science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Philosophy of science; Philosophy; Epistemology; Sociology","score_opus":0.015576736631517896,"score_gpt":0.2662858527354479,"score_spread":0.25070911610393004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234364729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41501403,0.00007397635,0.45340216,0.0020987256,0.00041160194,0.00016759409,0.000004593088,0.00027457188,0.12855272],"genre_scores_gemma":[0.87597644,0.0000035839153,0.12263671,0.00007367404,0.000011449112,0.0000029102916,9.009364e-7,0.0000013864891,0.0012929547],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918044,0.000012223096,0.00012850921,0.00021479794,0.0002881614,0.00017585461],"domain_scores_gemma":[0.99934787,0.00005607721,0.000041482093,0.00039945933,0.00009751172,0.000057628804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048188635,0.000046204073,0.0000530742,0.00011915501,0.00040074976,0.00013155393,0.0011272138,0.000013437689,0.00024097733],"category_scores_gemma":[0.000057258567,0.00004286349,0.000018514553,0.0011248945,0.0004597236,0.0010657943,0.00006226549,0.00004900199,0.00019517283],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005037099,0.0001390016,0.0056662005,0.000021122141,0.000007561551,0.0000032285034,0.005013621,0.011810257,0.010261399,0.3331373,0.0025298437,0.6314054],"study_design_scores_gemma":[0.0009038144,0.0005871155,0.10271316,0.00027156755,0.000017064913,0.000078341785,0.00019411434,0.5462063,0.04083126,0.09031087,0.21675557,0.0011308233],"about_ca_topic_score_codex":0.000033004068,"about_ca_topic_score_gemma":0.0000013199982,"teacher_disagreement_score":0.6302746,"about_ca_system_score_codex":0.00001914909,"about_ca_system_score_gemma":0.00024940277,"threshold_uncertainty_score":0.30822837},"labels":[],"label_agreement":null},{"id":"W4234402454","doi":"10.32920/ryerson.14647755","title":"Efficient Lifted Planning with Regression-Based Heuristics","year":2021,"lang":"en","type":"preprint","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Heuristics; Planner; Benchmark (surveying); Computer science; Set (abstract data type); Automated planning and scheduling; Task (project management); Heuristic; Operator (biology); Artificial intelligence; Regression; Machine learning; Mathematical optimization; Operations research; Mathematics; Engineering; Programming language","score_opus":0.02248054395742178,"score_gpt":0.25953985814089664,"score_spread":0.23705931418347487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234402454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029026056,0.00085574656,0.9641872,0.00082112633,0.0007301411,0.00021964747,0.000009693384,0.00074841065,0.0034019565],"genre_scores_gemma":[0.6083052,0.0000017224512,0.39051327,0.0005917215,0.00008410806,0.00002642217,0.00010498567,0.000028952949,0.0003436129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971305,0.00018213785,0.00039621897,0.001095211,0.00068722083,0.0005087198],"domain_scores_gemma":[0.99714965,0.0005057687,0.0003295414,0.0015007263,0.00028854344,0.00022577203],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004651722,0.00047157085,0.00047590205,0.00021405489,0.00027064822,0.00072875706,0.0012820133,0.00032580705,0.000047846945],"category_scores_gemma":[0.000113130336,0.00034814767,0.00012191313,0.00041490872,0.000054065928,0.00003777519,0.0010401264,0.0011150619,0.000016004607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019983716,0.00008148991,0.0034208512,0.00020994803,0.000043364158,0.00067987136,0.00082319486,0.9904734,0.000024268378,0.00044726182,0.0021982538,0.001578112],"study_design_scores_gemma":[0.00032434464,0.00008106958,0.0005827603,0.0031458202,0.000025071979,0.000019266898,0.000059655387,0.9938964,0.0007094336,0.000095018215,0.00047680314,0.0005843581],"about_ca_topic_score_codex":0.00008765384,"about_ca_topic_score_gemma":0.0000036637823,"teacher_disagreement_score":0.5792792,"about_ca_system_score_codex":0.00008250901,"about_ca_system_score_gemma":0.0011459524,"threshold_uncertainty_score":0.99989706},"labels":[],"label_agreement":null},{"id":"W4237086958","doi":"10.1145/1013963","title":"Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming","year":2004,"lang":"en","type":"paratext","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Programming language; Declarative programming; Programming paradigm; Inductive programming","score_opus":0.06973443593257375,"score_gpt":0.31708028799358684,"score_spread":0.2473458520610131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237086958","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030519722,0.0005085128,0.07691551,0.008268914,0.0014404469,0.001262328,0.00007811922,0.00009411311,0.9083801],"genre_scores_gemma":[0.5526529,0.00034262272,0.40027806,0.00066157884,0.00023353827,0.00008194293,0.00005629586,0.00004224383,0.045650806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99853337,0.0000429216,0.00035953967,0.00040528906,0.00047915842,0.0001797374],"domain_scores_gemma":[0.9977577,0.00049822766,0.00083455,0.00029001315,0.0005714865,0.000048043603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005066722,0.00021697649,0.0002722933,0.000107161984,0.000093643655,0.00018323166,0.001615209,0.00016530899,0.00004571067],"category_scores_gemma":[0.0006184285,0.00014505703,0.00005502824,0.0002074883,0.00013584473,0.00035174,0.0006381654,0.00040553077,0.000018286017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003599853,0.00066342443,0.0017222384,0.0015290191,0.0007410111,0.000010119706,0.025614493,0.00378238,0.0022740813,0.89414835,0.03795746,0.031197425],"study_design_scores_gemma":[0.003688366,0.003915704,0.001547594,0.020130258,0.0003032847,0.00051557104,0.005983273,0.034701902,0.07029241,0.010852953,0.84504354,0.0030251667],"about_ca_topic_score_codex":0.000080699094,"about_ca_topic_score_gemma":0.000005162758,"teacher_disagreement_score":0.8832954,"about_ca_system_score_codex":0.00004819364,"about_ca_system_score_gemma":0.0003839566,"threshold_uncertainty_score":0.59152544},"labels":[],"label_agreement":null},{"id":"W4238854784","doi":"10.1007/978-3-642-44949-9","title":"Multi-disciplinary Trends in Artificial Intelligence","year":2013,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; University of Winnipeg","funders":"Indian Institute of Technology Indore; University of Hyderabad; Jawaharlal Nehru Technological University Hyderabad; Southeast University; Yeungnam University; Technische Universität Clausthal; Indian Institute of Technology Delhi; King Mongkut's Institute of Technology Ladkrabang; University of Crete; Universität Trier; Commonwealth Scientific and Industrial Research Organisation; Technische Universität Darmstadt; Purdue University; Centre National de la Recherche Scientifique; Thammasat University; Indian Institute of Science; Université du Luxembourg","keywords":"Discipline; Computer science; Artificial intelligence; Social science; Sociology","score_opus":0.0446468636590377,"score_gpt":0.2975143364681765,"score_spread":0.2528674728091388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238854784","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015378228,0.00053672673,0.994691,0.0010953378,0.0019086472,0.00026306647,0.0000046955383,0.00020804013,0.0011386741],"genre_scores_gemma":[0.08108317,0.000014942446,0.91550225,0.0008186391,0.00058858196,0.000036016943,0.000026248044,0.000044651388,0.0018854955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99502546,0.0001250156,0.0008429595,0.0019857902,0.00089091435,0.0011298467],"domain_scores_gemma":[0.9971321,0.00070294604,0.00031243166,0.0014752559,0.00015336122,0.00022389753],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014897708,0.0006249834,0.00062868174,0.0022939446,0.000300169,0.00083592575,0.004866583,0.00047614248,0.00004839235],"category_scores_gemma":[0.00009996988,0.0005818336,0.00013835196,0.0029420315,0.00059328467,0.000902059,0.0018675763,0.0015819041,0.0001616074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038108908,0.0000722482,0.00013685404,0.000031237603,0.0000037650289,0.00014689539,0.0021930907,0.12925456,0.000057260793,0.001254029,0.0001973256,0.8666489],"study_design_scores_gemma":[0.00008066523,0.00014920237,0.0004407634,0.00055323687,0.0000029283733,0.000037935362,5.431921e-7,0.918554,0.00041396453,0.07884297,0.00023551962,0.00068827916],"about_ca_topic_score_codex":0.00010044334,"about_ca_topic_score_gemma":0.0002570884,"teacher_disagreement_score":0.86596066,"about_ca_system_score_codex":0.00055996334,"about_ca_system_score_gemma":0.0010224357,"threshold_uncertainty_score":0.9996633},"labels":[],"label_agreement":null},{"id":"W4240749885","doi":"10.18260/1-2--31248","title":"WIP: Decoding a Discipline – Toward Identifying Threshold Concepts in Geomatics Engineering","year":2020,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Geomatics; Formative assessment; Computer science; Engineering education; Summative assessment; Geospatial analysis; Artificial intelligence; Engineering; Engineering management; Mathematics education; Geography; Remote sensing; Mathematics","score_opus":0.05492607633784627,"score_gpt":0.2896481022192516,"score_spread":0.2347220258814053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240749885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07342508,0.00019071746,0.92221844,0.002677013,0.00017327195,0.00009392947,9.796141e-7,0.00035336733,0.00086720183],"genre_scores_gemma":[0.8608692,0.0000048064044,0.1385089,0.00049867807,0.00006324558,0.0000056443932,0.0000025892264,0.00000986545,0.000037029105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883825,0.000015962625,0.00029656384,0.00031704118,0.00020252078,0.00032968482],"domain_scores_gemma":[0.9994457,0.00013589281,0.000055219134,0.00020466014,0.00002023087,0.00013832145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026672185,0.00014268003,0.00018600232,0.000081489394,0.00006407003,0.00022714955,0.0005926401,0.00005102979,0.000023903975],"category_scores_gemma":[0.000085716616,0.00013574373,0.00004531028,0.00047762296,0.000010714268,0.00047021324,0.00033700914,0.00018967548,0.000031445346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027178383,0.000120548604,0.12939525,0.001210484,0.00010613647,0.00075534976,0.09056794,0.58188003,0.019956602,0.14514503,0.005281546,0.025553918],"study_design_scores_gemma":[0.00024273356,0.000023216471,0.00089367456,0.00012928463,0.0000026051705,0.000005115809,0.00013022395,0.9963429,0.0013871382,0.00044153733,0.00020192403,0.000199657],"about_ca_topic_score_codex":0.00001603806,"about_ca_topic_score_gemma":0.0000064973688,"teacher_disagreement_score":0.7874442,"about_ca_system_score_codex":0.000030887208,"about_ca_system_score_gemma":0.00003556465,"threshold_uncertainty_score":0.5535469},"labels":[],"label_agreement":null},{"id":"W4241035416","doi":"10.1007/978-1-4939-7131-2_100579","title":"Knowledge Representation Language","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Representation (politics); Linguistics; Natural language processing; Philosophy; Political science","score_opus":0.03546019418481638,"score_gpt":0.29177752596423706,"score_spread":0.2563173317794207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241035416","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007877779,0.0006373247,0.14045876,0.0001245673,0.00039469547,0.00008290941,0.000003237557,0.0003392082,0.8579514],"genre_scores_gemma":[0.00076139637,0.000012753282,0.022847772,0.00018081485,0.00039241524,0.0000028289737,0.000034453526,0.000020821999,0.97574675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990255,0.000017437671,0.00018815706,0.00043661907,0.00016511166,0.00016713774],"domain_scores_gemma":[0.9989164,0.000118766504,0.00011314276,0.0006959957,0.00008601015,0.00006972491],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00018693019,0.00018532704,0.00017226367,0.00012983393,0.00008838836,0.00012463883,0.00060524937,0.00018839567,0.0013650905],"category_scores_gemma":[0.000015879054,0.00016747428,0.00008239582,0.000040395327,0.000035669334,0.00015985077,0.00022397496,0.00019556393,0.0036040575],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037037457,0.000011009781,0.000018501643,0.000046318823,0.00005197114,0.000063940955,0.00552225,0.0000065544564,0.00004613471,0.57201225,0.34916675,0.073050626],"study_design_scores_gemma":[0.00026724263,0.00016299455,0.000020693808,0.000401834,0.000029241211,0.000040413965,0.00003781727,0.011608002,0.00081211224,0.06432309,0.9214612,0.0008353133],"about_ca_topic_score_codex":0.000023357668,"about_ca_topic_score_gemma":0.000019898975,"teacher_disagreement_score":0.5722945,"about_ca_system_score_codex":0.00003041983,"about_ca_system_score_gemma":0.00007806246,"threshold_uncertainty_score":0.9995478},"labels":[],"label_agreement":null},{"id":"W4242476382","doi":"10.1007/978-3-642-24918-1","title":"Integrated Uncertainty in Knowledge Modelling and Decision Making","year":2011,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Management science; Artificial intelligence; Operations research","score_opus":0.031060322655582923,"score_gpt":0.26589674851083067,"score_spread":0.23483642585524775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242476382","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088696554,0.0020099662,0.9939511,0.0000452828,0.001011096,0.00025476588,0.000002748996,0.00013915257,0.0016989518],"genre_scores_gemma":[0.22746189,0.000043814678,0.7719078,0.00030172043,0.00014310173,0.000007907679,0.0000049469954,0.000025416437,0.000103393504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652123,0.00009170511,0.00056996243,0.0015805895,0.00047936483,0.00075711525],"domain_scores_gemma":[0.99717027,0.0014011003,0.00021943098,0.00088499463,0.00018911061,0.00013511509],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018176956,0.000502264,0.00054552895,0.0013131477,0.000245148,0.0005294351,0.0025295308,0.00039917615,0.000005898956],"category_scores_gemma":[0.0001112722,0.00044303839,0.00006562721,0.0015478961,0.00036401188,0.0005677767,0.0012336241,0.001290089,0.000015533953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000783739,0.000016338174,0.00012524276,0.000031605803,0.0000022756183,0.000046655874,0.0023453718,0.43769526,0.0000033635324,0.0007984341,0.00003153548,0.55889606],"study_design_scores_gemma":[0.00017800221,0.000074307434,0.00003871111,0.002421229,0.0000027765386,0.000032723445,3.2963666e-7,0.8252978,0.000027686701,0.17102645,0.0004749076,0.0004251244],"about_ca_topic_score_codex":0.00010663374,"about_ca_topic_score_gemma":0.00028008595,"teacher_disagreement_score":0.55847096,"about_ca_system_score_codex":0.00048714608,"about_ca_system_score_gemma":0.001362311,"threshold_uncertainty_score":0.9998021},"labels":[],"label_agreement":null},{"id":"W4246265907","doi":"10.1007/978-1-4939-7131-2_100833","title":"ORA Toolkit","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.02462468889511031,"score_gpt":0.22267232913350177,"score_spread":0.19804764023839144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246265907","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000012823912,0.0001940986,0.21107006,0.00034441077,0.0004318022,0.000061880026,0.0000036773233,0.00034147155,0.78755134],"genre_scores_gemma":[0.00013753129,0.000013419127,0.056975804,0.0009672514,0.00032980545,0.0000017362047,0.000012325383,0.000022190476,0.94153994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99883664,0.000008711157,0.00020314216,0.00046480793,0.00025488724,0.0002318342],"domain_scores_gemma":[0.9988367,0.000091458314,0.00011228286,0.00077457674,0.00008957269,0.0000954408],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00021386209,0.00024018706,0.00021320829,0.000104949904,0.00010866754,0.0001940283,0.0010111986,0.00025489368,0.0030663672],"category_scores_gemma":[0.000009563361,0.00020749177,0.000094193376,0.00002772817,0.00004558439,0.00016866432,0.00029883446,0.0002662749,0.005187725],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013987237,0.0000025607517,0.0000055918217,0.0000151156955,0.000024105897,0.000035885845,0.0001540999,0.0000039974475,0.0000020368939,0.70778435,0.27577743,0.016193425],"study_design_scores_gemma":[0.000059045797,0.00008144782,0.0000023216955,0.00012699897,0.0000073877645,0.000017033506,7.9552575e-7,0.001754544,0.000026764314,0.08242206,0.9151743,0.00032727624],"about_ca_topic_score_codex":0.00001220308,"about_ca_topic_score_gemma":0.0000052132823,"teacher_disagreement_score":0.6393969,"about_ca_system_score_codex":0.000029222536,"about_ca_system_score_gemma":0.00011742914,"threshold_uncertainty_score":0.997845},"labels":[],"label_agreement":null},{"id":"W4246408092","doi":"10.1007/978-3-540-73180-1_2","title":"Similarity","year":2008,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Similarity (geometry); Computer science; Terminology; Semantics (computer science); Artificial intelligence; Syntax; Process (computing); Task (project management); Similarity measure; Information retrieval; Natural language processing; Image (mathematics); Linguistics","score_opus":0.1664800161051149,"score_gpt":0.3571016543175864,"score_spread":0.1906216382124715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246408092","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006513448,0.017216336,0.7603983,0.001071702,0.0012937384,0.00025695033,0.000022353739,0.00022826459,0.21950585],"genre_scores_gemma":[0.09561976,0.015843483,0.6181379,0.0043153986,0.0010444341,0.00008858735,0.00017388733,0.00016178984,0.26461473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978689,0.00003660502,0.00058400753,0.0006837044,0.0005332601,0.00029351914],"domain_scores_gemma":[0.9975765,0.0013854898,0.000234901,0.00037762048,0.0003621314,0.000063379775],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033951466,0.00036502184,0.0004591159,0.0002726197,0.0002425067,0.000045628552,0.0009498589,0.00018425506,0.00003232192],"category_scores_gemma":[0.00012672163,0.00037453242,0.00012176323,0.00013222467,0.0003443374,0.00017671735,0.0005660922,0.00065127393,0.00023873175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007392154,0.000026035174,0.000082853156,0.00010906751,0.00015248453,0.00043545346,0.0034110313,0.2783995,8.327175e-8,0.6629435,0.021731142,0.03270149],"study_design_scores_gemma":[0.000076314456,0.00010985931,0.000056149245,0.00089749636,0.000010818187,0.000118590906,0.000043983626,0.10995652,0.000010669167,0.82367516,0.06429564,0.00074881356],"about_ca_topic_score_codex":0.000009925537,"about_ca_topic_score_gemma":0.000013497573,"teacher_disagreement_score":0.168443,"about_ca_system_score_codex":0.00019528078,"about_ca_system_score_gemma":0.00021418498,"threshold_uncertainty_score":0.99987066},"labels":[],"label_agreement":null},{"id":"W4248365506","doi":"10.4018/9781605661704.ch017","title":"A Cognitive Computational Knowledge Representation Theory","year":2011,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Cognitive science; Representation (politics); Computer science; Cognition; Psychology; Cognitive psychology; Political science; Neuroscience","score_opus":0.042003586247864266,"score_gpt":0.28490390588095643,"score_spread":0.24290031963309217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248365506","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010649672,0.00045463914,0.30276436,0.000016718725,0.00033937642,0.00019079473,0.00006423148,0.00023012968,0.6959291],"genre_scores_gemma":[0.6020114,0.000005818174,0.031128401,0.0014391372,0.00071692816,0.00006267564,0.00012596762,0.00010505012,0.36440462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982941,0.00009354473,0.00034643017,0.00066886126,0.00031120458,0.00028586586],"domain_scores_gemma":[0.998513,0.00037209998,0.0002865543,0.00038259552,0.00030234113,0.0001434423],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029791656,0.00035520707,0.00031823313,0.0000998209,0.00018770686,0.00014136943,0.00061738695,0.0002947606,0.000057072186],"category_scores_gemma":[0.000038271475,0.0003656314,0.00017550461,0.00003442185,0.00011585387,0.00012242385,0.0002950501,0.00032559826,0.0007761226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030309318,0.000010583121,0.000023098515,0.000019392013,0.00009476156,0.00005510835,0.00078491983,0.00003031841,4.270023e-7,0.9559724,0.0019267198,0.041052014],"study_design_scores_gemma":[0.00032005564,0.000091653754,0.00007946562,0.0004317238,0.00005249051,0.000062438565,0.0000091787515,0.0011979226,0.00001529928,0.99419904,0.0031315014,0.00040921],"about_ca_topic_score_codex":0.000029373397,"about_ca_topic_score_gemma":0.00000981388,"teacher_disagreement_score":0.6020008,"about_ca_system_score_codex":0.00010592967,"about_ca_system_score_gemma":0.00038382376,"threshold_uncertainty_score":0.99987954},"labels":[],"label_agreement":null},{"id":"W4250121399","doi":"10.4018/978-1-7998-0951-7.ch025","title":"Virtual Soar-Agent Implementations","year":2019,"lang":"en","type":"book-chapter","venue":"Natural Language Processing","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Soar; Computer science; Implementation; Cognitive architecture; Architecture; Human–computer interaction; Virtual machine; Cognition; Software engineering; Artificial intelligence; Programming language; Psychology","score_opus":0.013834617754389765,"score_gpt":0.27295946375170144,"score_spread":0.25912484599731167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250121399","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031871762,0.20751761,0.2019565,0.0017774679,0.0038540277,0.0012357711,0.00016540682,0.002015187,0.5811593],"genre_scores_gemma":[0.30331102,0.000028214763,0.034676366,0.0014611172,0.0005294744,0.000010131578,0.0003710189,0.00008997875,0.65952265],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980623,0.000021787087,0.00036482298,0.00063017564,0.00051010953,0.00041080097],"domain_scores_gemma":[0.99883944,0.00011421101,0.00034426636,0.00047596695,0.00013037158,0.000095747884],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023537289,0.0003864567,0.0003230585,0.0002160595,0.0003024354,0.00044386665,0.0008768369,0.00024249156,0.00019933094],"category_scores_gemma":[0.000026294794,0.00034847608,0.00014019758,0.00008816644,0.00003709653,0.0005138884,0.00030201394,0.00085617485,0.00034402622],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008140184,0.000009563302,0.000019006047,0.0001864293,0.00005574794,0.000120020115,0.0049613286,0.00007995389,0.00022483875,0.032732233,0.0066137896,0.95498896],"study_design_scores_gemma":[0.0036999166,0.0008811735,0.00016211177,0.007764248,0.00051502546,0.00059750746,0.0018552798,0.3828876,0.0016969527,0.009859749,0.5819518,0.008128636],"about_ca_topic_score_codex":0.000022219005,"about_ca_topic_score_gemma":0.0000131149445,"teacher_disagreement_score":0.9468603,"about_ca_system_score_codex":0.00012744719,"about_ca_system_score_gemma":0.00039680622,"threshold_uncertainty_score":0.9998967},"labels":[],"label_agreement":null},{"id":"W4250312239","doi":"10.1007/978-0-387-39940-9_3370","title":"Query Answering in Analytical Domains","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Information retrieval; Question answering","score_opus":0.01682590158742708,"score_gpt":0.240436948095608,"score_spread":0.22361104650818092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250312239","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001389642,0.0041660103,0.052048214,0.00011607961,0.001245755,0.00049923605,0.0003368272,0.00019620651,0.9412527],"genre_scores_gemma":[0.032132417,0.005720956,0.0626998,0.00040257623,0.003287916,0.00008206754,0.0020547495,0.00032587565,0.8932936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970265,0.00008448875,0.0010030416,0.0007864682,0.00063986686,0.00045962675],"domain_scores_gemma":[0.997512,0.00034810512,0.0004489644,0.001421732,0.000078375226,0.00019081555],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009700781,0.00045200044,0.0008283419,0.00056582957,0.00006308035,0.00007856531,0.0011306612,0.00032380418,0.000027472164],"category_scores_gemma":[0.000073965755,0.0004513125,0.00014957604,0.00016476195,0.00006048478,0.0004505666,0.00029702106,0.0006913872,0.000087341796],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003718421,0.00012287441,0.0014944886,0.001469834,0.00016389093,0.0021300751,0.001075157,0.0023166807,0.000037639853,0.9298242,0.029786848,0.031541146],"study_design_scores_gemma":[0.00072842976,0.00022320241,0.00021192156,0.006701149,0.0000698233,0.00011794569,0.00003448648,0.033361584,0.000010729365,0.0021834825,0.95496386,0.0013933689],"about_ca_topic_score_codex":0.00032930108,"about_ca_topic_score_gemma":0.000052915624,"teacher_disagreement_score":0.9276407,"about_ca_system_score_codex":0.00011263887,"about_ca_system_score_gemma":0.00030182805,"threshold_uncertainty_score":0.9997939},"labels":[],"label_agreement":null},{"id":"W4251408801","doi":"10.1007/978-1-4614-6170-8_110075","title":"ORA Toolkit","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.018671148068775067,"score_gpt":0.20829135003687413,"score_spread":0.18962020196809906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251408801","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.5373612e-7,0.00013393335,0.4148146,0.0003954983,0.00025351156,0.000042582382,0.0000015187982,0.00025496824,0.58410317],"genre_scores_gemma":[0.00047628736,0.000012458267,0.0437845,0.0013671141,0.0002132041,0.000001968958,0.0000132413925,0.00002315482,0.95410806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988572,0.000011977526,0.00021052295,0.00044327372,0.00025349413,0.00022351062],"domain_scores_gemma":[0.99880594,0.00014481903,0.00011928339,0.0007728529,0.00005824015,0.00009883966],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025681342,0.0002435269,0.00024765247,0.00010296892,0.00009426738,0.00018098233,0.0009744788,0.00024968843,0.00064072985],"category_scores_gemma":[0.000011203179,0.00021112959,0.00010346156,0.000022030954,0.000024864185,0.00009193517,0.00024351398,0.00032597303,0.0024257002],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.4590364e-7,0.0000010607347,0.000004977262,0.0000145768345,0.000012911888,0.000015683516,0.000035392928,0.000022424363,0.0000012001552,0.88841695,0.071648456,0.039825723],"study_design_scores_gemma":[0.000064879096,0.000052644114,0.000002828987,0.00011752447,0.000007219018,0.000014236326,2.7019155e-7,0.004407197,0.000012928531,0.049377736,0.9456133,0.00032921237],"about_ca_topic_score_codex":0.000014760363,"about_ca_topic_score_gemma":0.0000038785197,"teacher_disagreement_score":0.87396485,"about_ca_system_score_codex":0.000024686786,"about_ca_system_score_gemma":0.00008298096,"threshold_uncertainty_score":0.99835104},"labels":[],"label_agreement":null},{"id":"W4253833210","doi":"10.1111/j.1467-8640.2006.00279.x","title":"INTRODUCTION TO THE SPECIAL ISSUE ON CASE‐BASED REASONING IN THE HEALTH SCIENCES","year":2006,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Cancer Institute, University of Pittsburgh; Università degli Studi di Pavia; University of Aberdeen; Victoria University; Robert Gordon University; University of Victoria","keywords":"Domain (mathematical analysis); Case-based reasoning; Computer science; Data science; Artificial intelligence; Management science; Engineering; Mathematics","score_opus":0.033234817317546884,"score_gpt":0.31821249749381164,"score_spread":0.28497768017626474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253833210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028983809,0.00009288971,0.9081397,0.08640856,0.00060614257,0.00023153595,0.00000277087,0.000047489073,0.0015724925],"genre_scores_gemma":[0.8927367,0.0000012105564,0.09366179,0.0071406746,0.006326511,0.00002334,0.000011961982,0.000005526728,0.00009233133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983411,0.00027347452,0.00027539136,0.00039713673,0.0004473421,0.0002655512],"domain_scores_gemma":[0.99868387,0.0008631767,0.00009886896,0.0002472331,0.000071409384,0.00003541968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019017522,0.00011246542,0.000092053124,0.0001554256,0.0007342069,0.00030502822,0.0008063703,0.000022919045,0.0000318188],"category_scores_gemma":[0.000112348054,0.000072833944,0.00003123485,0.001159292,0.00008658782,0.00014779597,0.000051417825,0.00020859699,0.00017148185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046015693,0.000027053737,0.00011469442,0.0000028535987,7.417327e-7,0.000026591488,0.00089205254,0.8342794,3.8857667e-7,0.09361684,0.041216534,0.029818244],"study_design_scores_gemma":[0.00004446321,0.00032369705,0.0015832706,0.00006668848,0.0000011185385,0.0002512356,0.00028382585,0.9329834,0.00008370159,0.016047096,0.048177768,0.00015375475],"about_ca_topic_score_codex":0.000509948,"about_ca_topic_score_gemma":0.00014596163,"teacher_disagreement_score":0.8898383,"about_ca_system_score_codex":0.000075833515,"about_ca_system_score_gemma":0.0001929768,"threshold_uncertainty_score":0.56469995},"labels":[],"label_agreement":null},{"id":"W4254903350","doi":"10.3233/thc-2000-83-406","title":"Scientific Papers","year":2000,"lang":"en","type":"article","venue":"Technology and Health Care","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Health Canada","funders":"Agence Universitaire de la Francophonie","keywords":"Computer science","score_opus":0.012099033181422308,"score_gpt":0.2702496824175861,"score_spread":0.2581506492361638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254903350","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6334937,0.09394834,0.011473347,0.19244643,0.0014414161,0.0008755281,0.000024437948,0.0063412245,0.05995553],"genre_scores_gemma":[0.9870961,0.00006849584,0.010568242,0.001395149,0.000012509021,0.0000071962068,0.0000046353393,0.0000033804567,0.00084430794],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99928427,0.000014905383,0.00009811363,0.00027578184,0.00006622555,0.00026069416],"domain_scores_gemma":[0.9995749,0.000011873905,0.000025918926,0.0003021377,0.00002495692,0.000060186583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018608813,0.000063221094,0.00009215915,0.00018585284,0.0006032089,0.000054579636,0.0002897845,0.00009931166,0.00004578264],"category_scores_gemma":[0.0000035144565,0.000059207403,0.000011666537,0.0004908472,0.0001189579,0.00007544811,0.000047900114,0.0001756241,0.000054395958],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001510878,0.000005262765,0.0044358666,0.00004026516,0.0000023841023,0.000007410402,0.0020108577,0.000010232436,0.000014902409,0.054710563,0.00299314,0.9357676],"study_design_scores_gemma":[0.0005499525,0.00048147372,0.008692336,0.0001706484,0.0000039567713,0.00010526157,0.00083360606,0.0014093182,0.0002656349,0.013471533,0.9736437,0.000372536],"about_ca_topic_score_codex":0.000018433593,"about_ca_topic_score_gemma":0.00002248291,"teacher_disagreement_score":0.9706506,"about_ca_system_score_codex":0.000023776234,"about_ca_system_score_gemma":0.0001232669,"threshold_uncertainty_score":0.46394563},"labels":[],"label_agreement":null},{"id":"W4255011584","doi":"10.22215/etd/2013-08584","title":"A general-purpose framework for learning by observation","year":2013,"lang":"en","type":"dissertation","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Humanities; Computer science; Mathematics education; Mathematics; Art","score_opus":0.022040551661906146,"score_gpt":0.2761130908282576,"score_spread":0.2540725391663514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255011584","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013469528,0.00067105517,0.9813487,0.00031517434,0.00092478696,0.00048557666,0.000005051744,0.0004311657,0.0023489608],"genre_scores_gemma":[0.0037471165,0.000041342213,0.80788624,0.00062147743,0.00024426533,0.00033030234,0.002675185,0.00004882711,0.18440524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854356,0.000056548186,0.0003021794,0.00051969144,0.00024127575,0.0003367381],"domain_scores_gemma":[0.99869925,0.00038125605,0.00028517836,0.00034257784,0.00020683625,0.00008487618],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025693447,0.0002598261,0.00024743332,0.00009516973,0.00029457826,0.00042722395,0.0006422442,0.00045987323,0.00007602202],"category_scores_gemma":[0.00020400003,0.00024826897,0.00010769756,0.00022445917,0.000005541998,0.00038112217,0.00002968804,0.0004952963,0.000094924486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004330308,0.00008924362,0.0012679516,0.00068792014,0.00012926653,0.0000034656346,0.0056284275,0.0022017902,0.0053570173,0.3572147,0.34054786,0.28682908],"study_design_scores_gemma":[0.0006020808,0.00054124737,0.0010134001,0.0010744574,0.00006932781,0.000003250564,0.00036187653,0.6110186,0.011977063,0.10328268,0.26812372,0.001932315],"about_ca_topic_score_codex":0.00014696915,"about_ca_topic_score_gemma":0.000007776308,"teacher_disagreement_score":0.6088168,"about_ca_system_score_codex":0.000036868285,"about_ca_system_score_gemma":0.0001077233,"threshold_uncertainty_score":0.99999696},"labels":[],"label_agreement":null},{"id":"W4285308427","doi":"10.1007/978-3-031-08011-1_22","title":"Practically Uniform Solution Sampling in Constraint Programming","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Polytechnique Montréal","funders":"","keywords":"Computer science; Probabilistic logic; Modular design; Sampling (signal processing); Hash function; Theoretical computer science; Constraint (computer-aided design); Set (abstract data type); Fraction (chemistry); Algorithm; Sample (material); Linear programming; Mathematical optimization; Programming language; Mathematics; Artificial intelligence","score_opus":0.03316662803312574,"score_gpt":0.27408729310945784,"score_spread":0.24092066507633209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285308427","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000050796483,0.0002550088,0.99208707,0.001976567,0.0010799235,0.0004455759,0.0000040642967,0.00021311943,0.0038878801],"genre_scores_gemma":[0.09728325,0.000020299272,0.90157956,0.00077603845,0.00018090729,0.000021972268,0.000014946953,0.00002928309,0.00009373253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99591476,0.00006832852,0.0006430891,0.0014302615,0.001030227,0.0009133415],"domain_scores_gemma":[0.99750257,0.0009241433,0.00036984126,0.0008947072,0.00014561498,0.00016315005],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025146315,0.00045343768,0.00045204262,0.0009716498,0.00046587817,0.00067853386,0.0023224433,0.00026765722,0.000057414858],"category_scores_gemma":[0.00021944034,0.0004636938,0.00010321536,0.00085982314,0.0004655571,0.00088723784,0.0014479888,0.001879732,0.00001528239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007086776,0.000033713768,0.00013170158,0.000043909997,0.0000067014275,0.00019573943,0.0012993395,0.087928824,0.000053496788,0.051061828,0.000005995026,0.85923165],"study_design_scores_gemma":[0.00036143625,0.00032818038,0.00008511766,0.0007578695,0.00000815748,0.00028170538,0.0000013428833,0.8904999,0.000097717675,0.09289511,0.013724181,0.00095930835],"about_ca_topic_score_codex":0.0000971535,"about_ca_topic_score_gemma":0.00014912037,"teacher_disagreement_score":0.8582724,"about_ca_system_score_codex":0.0007231736,"about_ca_system_score_gemma":0.0012188524,"threshold_uncertainty_score":0.9997815},"labels":[],"label_agreement":null},{"id":"W4293118259","doi":"10.1007/978-3-031-02426-9_12","title":"Many Infinities: Cardinal Numbers","year":2020,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on mathematics and statistics","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Plural; Class (philosophy); Order (exchange); Set (abstract data type); Focus (optics); Mathematics; Epistemology; Computer science; Philosophy; Linguistics; Physics; Economics","score_opus":0.023471933359465076,"score_gpt":0.22583071702381144,"score_spread":0.20235878366434637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293118259","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000018378906,0.00033052798,0.70842975,0.0003591831,0.00015361402,0.00015937707,0.0005001148,0.00013233785,0.28993323],"genre_scores_gemma":[0.0021864998,0.00038618324,0.9602404,0.0010573801,0.00024137387,0.000023309874,0.000047356196,0.00013151896,0.03568595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982434,0.000027917464,0.0004417096,0.0005010099,0.00050215743,0.00028382734],"domain_scores_gemma":[0.9964754,0.00242047,0.00032139086,0.0005234415,0.00007593849,0.00018338829],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022433345,0.0004899897,0.0006624672,0.00013564216,0.00023353272,0.00034084692,0.00052426,0.00026174934,0.00012662911],"category_scores_gemma":[0.000352764,0.00043511318,0.00010799551,0.00003597381,0.00010360968,0.000046454497,0.00014914665,0.00053917017,0.00012404138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056820186,0.000009723691,0.0000012177195,0.00046585742,0.00012965713,0.00011270897,0.00096384255,0.000064968,0.0000022494205,0.9632209,0.018709429,0.016313741],"study_design_scores_gemma":[0.0001254367,0.0002227283,0.0000039527804,0.001133788,0.00019716637,0.000060693837,0.0000374326,0.04773032,0.000057078065,0.85833675,0.091168106,0.0009265649],"about_ca_topic_score_codex":0.000007156431,"about_ca_topic_score_gemma":0.0000041156745,"teacher_disagreement_score":0.25424728,"about_ca_system_score_codex":0.00004264805,"about_ca_system_score_gemma":0.000118074335,"threshold_uncertainty_score":0.99981004},"labels":[],"label_agreement":null},{"id":"W4295178125","doi":"10.48550/arxiv.1301.4608","title":"Proceedings of the Eighteenth Conference on Uncertainty in Artificial\\n Intelligence (2002)","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Artificial intelligence; Operations research; Computer science; Engineering","score_opus":0.10677347144952201,"score_gpt":0.1985208972278513,"score_spread":0.09174742577832928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295178125","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8565336,0.00006482811,0.12354279,0.0007149162,0.0007747892,0.0008389431,0.000018709146,0.0001854878,0.017325958],"genre_scores_gemma":[0.9984359,0.000062786974,0.0007640906,0.00007927447,0.00002601338,0.0000019993192,0.000001982218,0.000009439776,0.00061852275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982534,0.00007062225,0.00031027274,0.0008611148,0.0001488775,0.00035571796],"domain_scores_gemma":[0.9984004,0.0001453861,0.00041508354,0.00067132426,0.00027672393,0.00009109405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038862517,0.00028283102,0.00031628055,0.00024006594,0.000116126874,0.00013068628,0.0026300326,0.00025225553,0.000056455418],"category_scores_gemma":[0.000061615996,0.00024307417,0.00013369415,0.0008094203,0.00016844975,0.0002356052,0.0012649709,0.0008530898,0.00007011501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018761533,0.0000811612,0.0026577858,0.000085151376,0.000018164395,0.000012629226,0.0005775208,0.21453115,0.000059231847,0.78028166,0.0003606428,0.0013161459],"study_design_scores_gemma":[0.00006695735,0.00006772298,0.0010781318,0.0007302486,0.000015764832,0.0000011712177,0.00017346485,0.79634964,0.0012279474,0.19986893,0.00008630014,0.00033374762],"about_ca_topic_score_codex":0.0005798502,"about_ca_topic_score_gemma":0.000048687463,"teacher_disagreement_score":0.58181846,"about_ca_system_score_codex":0.00015839121,"about_ca_system_score_gemma":0.00025372577,"threshold_uncertainty_score":0.9912277},"labels":[],"label_agreement":null},{"id":"W4297047342","doi":"10.1007/978-981-19-1983-1_5","title":"The Robot Operating System (ROS1 &amp;2): Programming Paradigms and Deployment","year":2022,"lang":"en","type":"book-chapter","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Software deployment; Robot; Software; Computer science; Systems engineering; Software engineering; Operating system; Simulation; Engineering; Artificial intelligence","score_opus":0.026615956472673875,"score_gpt":0.2307404308739631,"score_spread":0.20412447440128922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297047342","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021341475,0.010688972,0.3577456,0.0016967532,0.0013349805,0.0012978057,0.0000100010475,0.0014932308,0.6257113],"genre_scores_gemma":[0.010030776,0.00032753014,0.22673623,0.0005818719,0.00042267222,0.00031020542,0.000063999316,0.0001645584,0.76136214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979253,0.0000698684,0.0004339536,0.0006588193,0.00048446536,0.00042759272],"domain_scores_gemma":[0.9984302,0.00040548516,0.00023343258,0.00075510534,0.000044735818,0.00013101933],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00095595117,0.00035725263,0.0003046609,0.000071475915,0.0016150536,0.0010196316,0.0009221617,0.00012502351,0.00003737078],"category_scores_gemma":[0.000014638877,0.00025205687,0.00009374163,0.00005181883,0.000059358765,0.00016263803,0.0007544557,0.0005837515,0.00003644004],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021475603,0.0000040121286,0.00003926992,0.00008419228,0.000060692193,0.00003464882,0.00042017768,0.00070643285,0.0000042765155,0.9188371,0.0012847908,0.07852227],"study_design_scores_gemma":[0.00014356885,0.00010526062,0.0000034956704,0.00031698451,0.000025213318,0.00015894503,0.00005148665,0.016089873,0.00000683355,0.000735093,0.98190445,0.00045878542],"about_ca_topic_score_codex":0.00010277195,"about_ca_topic_score_gemma":0.000044056862,"teacher_disagreement_score":0.98061967,"about_ca_system_score_codex":0.00014309297,"about_ca_system_score_gemma":0.0001234716,"threshold_uncertainty_score":0.99999315},"labels":[],"label_agreement":null},{"id":"W4297336541","doi":"","title":"Resource-Constrained Planning: A Monte Carlo Random Walk Approach","year":2012,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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":"Monte Carlo method; Computer science; Random walk; Resource (disambiguation); Mathematical optimization; Statistics; Mathematics","score_opus":0.02578111460672769,"score_gpt":0.23820401966268676,"score_spread":0.21242290505595907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297336541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016842699,0.0010736631,0.80435133,0.0005852636,0.00023128823,0.0002190549,0.0000025140644,0.0006749164,0.17601925],"genre_scores_gemma":[0.8866007,8.5565057e-7,0.109955154,0.0005284394,0.00017537612,0.000019440256,0.000004611108,0.000012229298,0.0027032204],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837077,0.00013375831,0.00024716955,0.00032618054,0.00027905375,0.00064309174],"domain_scores_gemma":[0.9988344,0.0002749005,0.00008284342,0.00051483646,0.000030790026,0.00026228395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009912011,0.0001955903,0.00023271762,0.000114208815,0.00021779693,0.00015490674,0.00066884584,0.00010306713,0.000026804575],"category_scores_gemma":[0.00006220589,0.00015760004,0.00009369581,0.00028209595,0.00004656726,0.00047160554,0.00015996312,0.00024464357,0.000052816406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062631036,0.0012369914,0.18633264,0.00035765456,0.0006218352,0.00018635938,0.12397931,0.06441492,0.0014393256,0.17190465,0.3270411,0.1218589],"study_design_scores_gemma":[0.0054785996,0.00019442289,0.0035103858,0.00014596563,0.00004823925,0.00036863625,0.001290286,0.82267565,0.0010713813,0.00056673423,0.16325058,0.0013991599],"about_ca_topic_score_codex":0.000059997863,"about_ca_topic_score_gemma":3.8095854e-7,"teacher_disagreement_score":0.86975795,"about_ca_system_score_codex":0.000024615296,"about_ca_system_score_gemma":0.000049010683,"threshold_uncertainty_score":0.6426743},"labels":[],"label_agreement":null},{"id":"W4303980275","doi":"10.20868/upm.thesis.1818","title":"Análisis y diseño de sistemas cognitivos para robots autónomos","year":2009,"lang":"es","type":"dissertation","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Defense Advanced Research Projects Agency; Canadian Institute for Advanced Research; Universidad de Murcia; DePaul University; National Aeronautics and Space Administration","keywords":"Citation; Robot; Humanities; Philosophy; Computer science; Artificial intelligence; Library science","score_opus":0.023657487918603334,"score_gpt":0.28798105652352135,"score_spread":0.264323568604918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4303980275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06088184,0.0054744272,0.8408001,0.0024686544,0.002344776,0.0017093094,0.000110743495,0.0015985181,0.08461165],"genre_scores_gemma":[0.9147494,0.00029880545,0.05644271,0.0015864393,0.00049130194,0.00010354684,0.0014225086,0.00009595281,0.024809347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99557483,0.0003950702,0.0008734471,0.001313529,0.00073825085,0.0011048479],"domain_scores_gemma":[0.9970674,0.0005948911,0.0006084475,0.00090110133,0.0003623956,0.00046574505],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00080834754,0.0008330051,0.0008296756,0.00036702424,0.0006953045,0.0010933407,0.001377322,0.00072372326,0.00023149415],"category_scores_gemma":[0.0001979482,0.00081313966,0.00040432057,0.0007716598,0.000058751073,0.00056851236,0.000098551565,0.00080237794,0.0005530004],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052694033,0.0016558785,0.035784326,0.004481707,0.0011459284,0.0015723832,0.026682714,0.029936468,0.0020659445,0.024052171,0.030667316,0.8414282],"study_design_scores_gemma":[0.003013701,0.0020197378,0.23639487,0.014121263,0.0013726911,0.00025346622,0.002108898,0.7013892,0.012215928,0.007699434,0.011962716,0.0074481186],"about_ca_topic_score_codex":0.00085436547,"about_ca_topic_score_gemma":0.00019825694,"teacher_disagreement_score":0.85386753,"about_ca_system_score_codex":0.00014506474,"about_ca_system_score_gemma":0.00075630896,"threshold_uncertainty_score":0.9999436},"labels":[],"label_agreement":null},{"id":"W4306295129","doi":"10.48550/arxiv.2210.06683","title":"Augmenting Flight Training with AI to Efficiently Train Pilots","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Trainer; Formative assessment; Computer science; Focus (optics); Flight training; Aeronautics; Training (meteorology); Human–computer interaction; Multimedia; Simulation; Flight simulator; Artificial intelligence; Engineering; Mathematics education; Psychology; Programming language","score_opus":0.08459200535628124,"score_gpt":0.1913075919923399,"score_spread":0.10671558663605867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306295129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24220037,0.000040152434,0.74964845,0.00047823062,0.0005431509,0.00036607613,0.0000229617,0.00049580424,0.006204784],"genre_scores_gemma":[0.9852375,0.000003933353,0.01075704,0.0006842906,0.00007008363,0.0000042615748,0.000030948773,0.000033846067,0.0031781148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703306,0.00023651948,0.00024271104,0.0015495775,0.00023580788,0.0007023045],"domain_scores_gemma":[0.99805725,0.00018832977,0.00025106818,0.0010950486,0.000099114906,0.00030919857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075552403,0.0004192504,0.00040291526,0.00048784848,0.000628478,0.00028289584,0.0023000913,0.00014670749,0.0001097037],"category_scores_gemma":[0.00003096912,0.00046385365,0.00015554823,0.0012193688,0.000053300304,0.00027669783,0.0020562548,0.0010743454,0.00005007868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037836628,0.000082268714,0.0022906917,0.0000621681,0.00007099306,0.0008855761,0.005166286,0.96471083,0.000036802972,0.024592057,0.00050959963,0.0015548607],"study_design_scores_gemma":[0.0013856688,0.00074594264,0.0015905038,0.0007226989,0.0001544215,0.00004703314,0.0013836706,0.97284687,0.00016995674,0.0052424064,0.013735184,0.0019756537],"about_ca_topic_score_codex":0.00011464509,"about_ca_topic_score_gemma":0.000021346108,"teacher_disagreement_score":0.7430371,"about_ca_system_score_codex":0.00029393137,"about_ca_system_score_gemma":0.00045090404,"threshold_uncertainty_score":0.9997813},"labels":[],"label_agreement":null},{"id":"W430758956","doi":"10.1023/a:1008375309626","title":"Incremental Iterative Retrieval and Browsing for Efficient Conversational CBR Systems","year":2000,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; Queen's University; University of Toronto","funders":"","keywords":"Computer science; Scalability; Focus (optics); Information retrieval; Query expansion; Query optimization; Query language; Session (web analytics); Adaptation (eye); Online aggregation; Computation; Data mining; Web search query; Web query classification; Database; Algorithm; Search engine; World Wide Web","score_opus":0.020311028968978097,"score_gpt":0.2466836184192553,"score_spread":0.2263725894502772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W430758956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06804792,0.00028764954,0.9277164,0.00012160258,0.00020643779,0.00043578912,0.000011901305,0.00009947896,0.003072817],"genre_scores_gemma":[0.97862434,0.000009232501,0.02089581,0.00019931271,0.000062681145,0.000022785183,0.000010899825,0.000006927207,0.00016802011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989243,0.000025700065,0.00023155341,0.0003722675,0.00021199354,0.0002341903],"domain_scores_gemma":[0.999343,0.00029009595,0.0000654432,0.00017593027,0.00005220795,0.000073315765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040431792,0.0001278751,0.00012676402,0.000052534677,0.0002558846,0.00022398891,0.0002793519,0.000052259555,0.000041569776],"category_scores_gemma":[0.000016214699,0.00012418571,0.000025020094,0.00018002486,0.000065235785,0.00011143332,0.00005059893,0.00010046248,0.000051223808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005619961,0.00015677954,0.0005023653,0.00022480324,0.00011308314,0.0000130405015,0.01781569,0.13546917,0.010668082,0.62395513,0.0020290434,0.20849085],"study_design_scores_gemma":[0.00023856151,0.00013065537,0.00014107626,0.00008938168,0.000009124839,0.000024105164,0.00030498777,0.968062,0.024861217,0.0021303685,0.0036928342,0.00031572315],"about_ca_topic_score_codex":0.000021213182,"about_ca_topic_score_gemma":3.531551e-7,"teacher_disagreement_score":0.9105764,"about_ca_system_score_codex":0.000047998874,"about_ca_system_score_gemma":0.00004709871,"threshold_uncertainty_score":0.50641465},"labels":[],"label_agreement":null},{"id":"W4312258528","doi":"10.1609/icaps.v23i1.13543","title":"Better Time Constrained Search via Randomization and Postprocessing","year":2013,"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":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Satisficing; Computer science; Bounding overwatch; Set (abstract data type); Mathematical optimization; Beam search; Metric (unit); Heuristic; Quality (philosophy); Iterative deepening depth-first search; Ranking (information retrieval); Hypersphere; Incremental heuristic search; Search algorithm; Algorithm; Machine learning; Artificial intelligence; Mathematics","score_opus":0.018479973602937416,"score_gpt":0.2526648700279775,"score_spread":0.2341848964250401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312258528","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9832001,0.000065919114,0.0071452754,0.0048293956,0.00011902489,0.00017842127,0.0000023254524,0.0003026369,0.004156919],"genre_scores_gemma":[0.97611785,0.000004249097,0.023430316,0.0003069028,0.000029230157,0.000008122445,0.0000036821443,0.000007906197,0.00009176795],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893206,0.000011555966,0.00025964077,0.00028714977,0.00032118615,0.00018843048],"domain_scores_gemma":[0.99915767,0.000111618065,0.0001928674,0.0000627775,0.0004084181,0.000066647335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044357852,0.00014712838,0.00017208818,0.00014452987,0.00021993164,0.00059643877,0.00049863535,0.00007717706,0.00002152343],"category_scores_gemma":[0.000103827246,0.000110641835,0.000028446846,0.00014999643,0.000089818495,0.0005390051,0.00018223118,0.00022851117,0.00000849741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038468436,0.00014190715,0.09752543,0.00047922705,0.00041575136,0.000008333709,0.012703061,0.007722658,0.7641514,0.06735955,0.0014393949,0.04766858],"study_design_scores_gemma":[0.00064055127,0.000041372918,0.0025901694,0.0006574258,0.0000069644766,0.00003800583,0.00012351555,0.98321325,0.010210619,0.002337094,0.000006567252,0.00013446143],"about_ca_topic_score_codex":0.00002375169,"about_ca_topic_score_gemma":5.28072e-8,"teacher_disagreement_score":0.97549057,"about_ca_system_score_codex":0.000016056201,"about_ca_system_score_gemma":0.000044657434,"threshold_uncertainty_score":0.5751473},"labels":[],"label_agreement":null},{"id":"W4312450869","doi":"10.1609/socs.v1i1.18166","title":"Improving Local Search for Resource-Constrained Planning","year":2010,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Computer science; Planner; Heuristic; Margin (machine learning); Focus (optics); Local search (optimization); Resource (disambiguation); Feature (linguistics); Mathematical optimization; Artificial intelligence; Machine learning; Mathematics","score_opus":0.01488774470533181,"score_gpt":0.261163305095088,"score_spread":0.2462755603897562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312450869","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9100468,0.000018359133,0.031378027,0.017427295,0.009933539,0.0011425272,0.00003676797,0.00029738585,0.029719314],"genre_scores_gemma":[0.99499387,4.6384383e-7,0.0039114556,0.00014822386,0.000639988,0.00003272946,0.0000039612173,0.000020854965,0.00024848356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977074,0.000016481144,0.00034227685,0.0004625639,0.0010467593,0.00042446397],"domain_scores_gemma":[0.99825495,0.00054406904,0.00016966555,0.00021521152,0.0006940169,0.00012210158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017431917,0.00018101041,0.00018394265,0.00014554399,0.00036470353,0.0003579089,0.0028528385,0.00014749568,0.00001001328],"category_scores_gemma":[0.00024595126,0.00014666199,0.00014963254,0.000287079,0.00016664444,0.0003228045,0.0006439711,0.0007594696,0.0000059630715],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030954194,0.00015498276,0.0048491415,0.00008881344,0.00006351537,0.0000015015668,0.0012537355,0.0010329694,0.28526443,0.6986836,0.0018022934,0.006495479],"study_design_scores_gemma":[0.0027942036,0.00074310595,0.00053643616,0.0003260206,0.000017222827,0.000039202685,0.00028371735,0.236428,0.73216313,0.014766165,0.011410229,0.00049255614],"about_ca_topic_score_codex":0.00010456406,"about_ca_topic_score_gemma":7.6775177e-7,"teacher_disagreement_score":0.6839174,"about_ca_system_score_codex":0.00010048647,"about_ca_system_score_gemma":0.00015481516,"threshold_uncertainty_score":0.5980702},"labels":[],"label_agreement":null},{"id":"W4312465291","doi":"10.1609/icaps.v32i1.19862","title":"Resolving Misconceptions about the Plans of Agents via Theory of Mind","year":2022,"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":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Schwartz/Reisman Emergency Medicine Institute; Vector Institute; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; Microsoft Research","keywords":"Plan (archaeology); Set (abstract data type); Appeal; Computer science; Epistemology; Psychology; Management science; Political science; Engineering","score_opus":0.05234666380518317,"score_gpt":0.29057457838984685,"score_spread":0.2382279145846637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312465291","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98815095,0.00023969833,0.004320481,0.0013557402,0.00037016906,0.00015516489,0.000057803605,0.00009182652,0.005258163],"genre_scores_gemma":[0.9944149,0.0000060148,0.0052794972,0.000097247816,0.000019045461,0.000011595503,0.0000043348314,0.0000069952102,0.00016031464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862313,0.00004579795,0.00039880796,0.00023789307,0.0005347083,0.00015968551],"domain_scores_gemma":[0.9987029,0.00028354194,0.00059980876,0.0001349718,0.000245995,0.000032770255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001105964,0.00012725196,0.00017856313,0.0001464448,0.00035975737,0.00007797205,0.0014348878,0.00004174826,0.000047951868],"category_scores_gemma":[0.00018509748,0.0000904869,0.00007065966,0.00024480632,0.00012512929,0.00015307362,0.0004528819,0.00034034325,6.5778704e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044052448,0.00030404268,0.0769818,0.00031144283,0.00072937587,0.0000061503683,0.057971075,0.12580134,0.19156896,0.5345268,0.0016217221,0.009736767],"study_design_scores_gemma":[0.00029869255,0.00012432582,0.005760026,0.00072631775,0.000028684331,0.00003340194,0.0030778875,0.96965164,0.014641936,0.0053516286,0.00016379957,0.00014164596],"about_ca_topic_score_codex":0.000023330545,"about_ca_topic_score_gemma":2.951201e-7,"teacher_disagreement_score":0.8438503,"about_ca_system_score_codex":0.000021322698,"about_ca_system_score_gemma":0.0000789681,"threshold_uncertainty_score":0.36899486},"labels":[],"label_agreement":null},{"id":"W4312544832","doi":"10.1609/aiide.v17i1.18893","title":"Birds in Boots: Learning to Play Angry Birds with Policy-Guided Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Canadian Institute for Advanced Research","keywords":"Heuristic; Artificial neural network; Set (abstract data type); Computer science; Artificial intelligence; Limit (mathematics); Machine learning; Sampling (signal processing); Time limit; Mathematics; Engineering","score_opus":0.045516879746606564,"score_gpt":0.3035821109116784,"score_spread":0.25806523116507185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312544832","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9569182,0.000025902,0.018886477,0.007859779,0.00013321695,0.0004023805,0.000010632,0.000069743095,0.015693672],"genre_scores_gemma":[0.9981885,0.000018960221,0.00063407136,0.0005029213,0.00003521843,0.000026976762,0.0000019845202,0.00001478762,0.00057660276],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99809206,0.000030037256,0.00042520597,0.000577768,0.00045845905,0.0004164715],"domain_scores_gemma":[0.9988922,0.00016004768,0.00016416318,0.0001851502,0.0004550683,0.00014340057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029078472,0.0002460125,0.0002707296,0.00028061235,0.00014254166,0.00075460435,0.0006832177,0.000056589688,0.000019732932],"category_scores_gemma":[0.0003833128,0.00018108044,0.00006941901,0.00076411857,0.000109379784,0.00087322947,0.00054783066,0.0004300579,0.000027511054],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011327538,0.0013282767,0.04588098,0.00022426675,0.00021614223,0.00006133448,0.0649683,0.005325601,0.071119,0.38836855,0.0004052555,0.42096952],"study_design_scores_gemma":[0.00022431722,0.0020945333,0.0021726154,0.0030231585,0.00001277921,0.00007571052,0.017164554,0.056527913,0.9047375,0.012205511,0.001029748,0.0007316908],"about_ca_topic_score_codex":0.00012932073,"about_ca_topic_score_gemma":0.000020815622,"teacher_disagreement_score":0.83361846,"about_ca_system_score_codex":0.00014257997,"about_ca_system_score_gemma":0.00019363586,"threshold_uncertainty_score":0.7384246},"labels":[],"label_agreement":null},{"id":"W4312605127","doi":"10.1609/icaps.v32i1.19803","title":"LM-Cut Heuristics for Optimal Linear Numeric Planning","year":2022,"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":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Heuristic; Mathematical optimization; Simple (philosophy); Computer science; Mathematics","score_opus":0.04559055700428573,"score_gpt":0.2994431930214112,"score_spread":0.2538526360171255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312605127","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94204724,0.0002314395,0.047289763,0.003769221,0.0012587849,0.0003626966,0.00007390797,0.00084520876,0.004121751],"genre_scores_gemma":[0.9379106,0.0000029134692,0.061449386,0.00027953973,0.00007169768,0.000043351167,0.0000131600855,0.00001561252,0.00021374323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844515,0.000016651622,0.00034863263,0.0003965326,0.0005138251,0.0002792246],"domain_scores_gemma":[0.9988988,0.00022552778,0.000400175,0.00010839434,0.00029914075,0.000067952555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006942575,0.0001913296,0.00021087872,0.00018409692,0.00065698416,0.00024422252,0.0013151506,0.00005689248,0.0000121377225],"category_scores_gemma":[0.00026862917,0.00016774201,0.00007540537,0.00024597772,0.000046999798,0.00022162843,0.0005070019,0.00043002603,0.0000013359339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054581946,0.000219643,0.035749707,0.00028577048,0.00036169754,0.000020167225,0.011816255,0.6825941,0.02350934,0.23556031,0.006485975,0.0028511744],"study_design_scores_gemma":[0.00036725038,0.00018734086,0.00036806954,0.00032246573,0.000013364227,0.000049828053,0.000791256,0.9923373,0.0032143411,0.001384776,0.00076124375,0.00020275218],"about_ca_topic_score_codex":0.0000097841,"about_ca_topic_score_gemma":4.3711637e-8,"teacher_disagreement_score":0.30974317,"about_ca_system_score_codex":0.000054081684,"about_ca_system_score_gemma":0.00010538893,"threshold_uncertainty_score":0.684032},"labels":[],"label_agreement":null},{"id":"W4312891993","doi":"10.1609/icaps.v32i1.19804","title":"Biased Exploration for Satisficing Heuristic Search","year":2022,"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":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Satisficing; Incremental heuristic search; Heuristic; Mathematical optimization; Beam search; Best-first search; Node (physics); Computer science; Consistent heuristic; Null-move heuristic; Greedy algorithm; Mathematics; Search algorithm; Algorithm; Artificial intelligence; Engineering","score_opus":0.08200595162074595,"score_gpt":0.30909067228654175,"score_spread":0.2270847206657958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312891993","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9438564,0.000087472705,0.046325803,0.0059296703,0.00067888526,0.00035113876,0.000035480254,0.0005460683,0.0021890826],"genre_scores_gemma":[0.97949743,0.0000028985867,0.020110274,0.000189342,0.000035357578,0.000048010475,0.000010619025,0.0000094480165,0.00009663215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876654,0.00002014996,0.0002601103,0.00029936378,0.00046685615,0.00018699114],"domain_scores_gemma":[0.99911535,0.0002632289,0.00022375875,0.00008109557,0.00027419877,0.00004234457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085488247,0.00012093326,0.00013475942,0.00017091256,0.00056990696,0.0002637566,0.00082509854,0.000033963144,0.000009251613],"category_scores_gemma":[0.00027272562,0.00010494499,0.00004574477,0.00021723998,0.000029231936,0.00029185924,0.0002952327,0.00027220053,8.964162e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038765796,0.0001595017,0.019422239,0.0002885256,0.00019738705,0.000006516889,0.016115302,0.3052772,0.11671863,0.52777916,0.0026622375,0.010985662],"study_design_scores_gemma":[0.00030740947,0.00013238224,0.00047095714,0.00025909953,0.0000067284886,0.00001472928,0.0010404101,0.98673856,0.006991224,0.0038168717,0.000097114775,0.00012451956],"about_ca_topic_score_codex":0.000020315694,"about_ca_topic_score_gemma":1.9559516e-7,"teacher_disagreement_score":0.68146133,"about_ca_system_score_codex":0.00005161922,"about_ca_system_score_gemma":0.000085379084,"threshold_uncertainty_score":0.4383321},"labels":[],"label_agreement":null},{"id":"W4313120064","doi":"10.1609/socs.v1i1.18159","title":"Bootstrap Learning of Heuristic Functions","year":2010,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristic; Bootstrapping (finance); Null-move heuristic; Incremental heuristic search; Consistent heuristic; Computer science; Process (computing); Mathematical optimization; Algorithm; Sequence (biology); Mathematics; Artificial intelligence; Beam search; Search algorithm; Econometrics","score_opus":0.015058930339526214,"score_gpt":0.2562940177736008,"score_spread":0.24123508743407457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313120064","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9476995,0.000008526912,0.0010111972,0.0050480133,0.008328986,0.0002009918,0.000007035951,0.00009730184,0.037598465],"genre_scores_gemma":[0.99841666,0.0000026251223,0.000568069,0.000029676738,0.00026838228,0.000007921284,0.000001540136,0.000009545138,0.00069555116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984286,0.000014227056,0.000280183,0.00025114263,0.00083612103,0.00018975131],"domain_scores_gemma":[0.9986767,0.0002524731,0.00020857257,0.0001460661,0.0006541627,0.00006200328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007310787,0.000110795234,0.00013621025,0.00010566212,0.00018611999,0.0001153803,0.0017296879,0.00008071832,0.00002786957],"category_scores_gemma":[0.00032162553,0.00008900623,0.00010492277,0.0003033831,0.00009272886,0.00022258903,0.00037430826,0.0006806562,0.000013089871],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007251387,0.00018538695,0.026553242,0.00004090863,0.000051589886,4.86188e-7,0.00047753358,0.0004710871,0.27744082,0.692557,0.0013713691,0.0007780799],"study_design_scores_gemma":[0.0028753327,0.0015586548,0.01450977,0.00056861475,0.000047777456,0.000053703898,0.0002054714,0.07038131,0.8183884,0.059231773,0.031464826,0.00071434444],"about_ca_topic_score_codex":0.000094207746,"about_ca_topic_score_gemma":7.9214885e-7,"teacher_disagreement_score":0.6333252,"about_ca_system_score_codex":0.000037203434,"about_ca_system_score_gemma":0.000074370924,"threshold_uncertainty_score":0.36295685},"labels":[],"label_agreement":null},{"id":"W4313395447","doi":"10.1613/jair.1.14034","title":"The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions","year":2022,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Agencia Nacional de Investigación y Desarrollo; Natural Sciences and Engineering Research Council of Canada; Israel Academy of Sciences and Humanities","keywords":"Heuristics; Heuristic; Simple (philosophy); Class (philosophy); Operator (biology); Mathematical optimization; Mathematics; Computer science; State (computer science); Algorithm; Artificial intelligence","score_opus":0.16950680794732287,"score_gpt":0.4241227748721553,"score_spread":0.2546159669248324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313395447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054898918,0.00062853034,0.9412744,0.0023021905,0.00034877402,0.0002658211,0.000016017528,0.00002492985,0.00024043763],"genre_scores_gemma":[0.9859956,0.000020384245,0.013449918,0.0000826364,0.00022635947,0.000052896146,0.0000037289362,0.000014891657,0.0001535772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970332,0.00044407943,0.00054044614,0.0002249906,0.0011379262,0.0006193565],"domain_scores_gemma":[0.9950717,0.0034511,0.0002710809,0.0003102383,0.000737602,0.00015828745],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0053372653,0.000111499794,0.00018204474,0.00030632762,0.002997565,0.00049969176,0.0015288439,0.000029426039,0.00003105832],"category_scores_gemma":[0.000502025,0.00007844438,0.00009916589,0.0010087071,0.00020230122,0.00028914673,0.00026030777,0.0010347847,0.000012540708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094017235,0.00027906595,0.00050425983,0.000038651586,0.0001518004,0.00043932095,0.006012856,0.78218013,0.0033129507,0.07771943,0.02711996,0.10130139],"study_design_scores_gemma":[0.00015942832,0.006101454,0.00019711268,0.00012766996,0.000024746663,0.0005329016,0.016881514,0.8186551,0.00578143,0.08944797,0.061700672,0.00039004383],"about_ca_topic_score_codex":0.00003604125,"about_ca_topic_score_gemma":0.0000048532493,"teacher_disagreement_score":0.9310967,"about_ca_system_score_codex":0.00013779059,"about_ca_system_score_gemma":0.000714365,"threshold_uncertainty_score":0.9983004},"labels":[],"label_agreement":null},{"id":"W4317486278","doi":"10.1016/j.jenvman.2023.117228","title":"A case-based reasoning tool to recommend drinking water source protection actions","year":2023,"lang":"en","type":"article","venue":"Journal of Environmental Management","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Case-based reasoning; Process (computing); Government (linguistics); Structuring; Corporate governance; Knowledge base; Computer science; Citizen journalism; Knowledge management; Process management; Engineering; Business; Artificial intelligence","score_opus":0.023444984325411297,"score_gpt":0.2270769093073763,"score_spread":0.20363192498196503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317486278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36128274,0.000012241702,0.63507295,0.0024722712,0.00039846686,0.00028152406,0.0000012325753,0.00009383145,0.00038473966],"genre_scores_gemma":[0.9530133,0.000007059332,0.04548689,0.00041151384,0.00008658134,0.000023522025,0.0000024485164,0.000015512962,0.000953153],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987479,0.000075701246,0.00033067612,0.0002123433,0.0003325047,0.00030090346],"domain_scores_gemma":[0.99946517,0.00003244553,0.00015035913,0.00024763326,0.000006757913,0.000097637916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006909521,0.00013082204,0.0001289893,0.00036416654,0.00032884313,0.00015020234,0.00030703522,0.000034015353,0.000056274977],"category_scores_gemma":[0.0000071685868,0.000108230255,0.0000933405,0.00023191769,0.000011480557,0.00032461583,0.0002572899,0.00021181985,0.00016926699],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118590535,0.00033312137,0.0020040509,0.00011093741,0.00032518353,0.007869603,0.0041066697,0.33429953,0.021711238,0.00037620202,0.0077074193,0.6210375],"study_design_scores_gemma":[0.0043327548,0.0026298997,0.01647438,0.0013898734,0.0002814914,0.007653416,0.0033094161,0.30041632,0.030914662,0.0014304753,0.6292711,0.001896218],"about_ca_topic_score_codex":0.000007855882,"about_ca_topic_score_gemma":0.0000012795598,"teacher_disagreement_score":0.6215637,"about_ca_system_score_codex":0.00022011304,"about_ca_system_score_gemma":0.000006072654,"threshold_uncertainty_score":0.44135016},"labels":[],"label_agreement":null},{"id":"W4318602947","doi":"10.1109/ssci51031.2022.10022239","title":"Planning for millions of NPCs in Real-Time","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Symposium Series on Computational Intelligence (SSCI)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Safran Electronics (Canada)","funders":"","keywords":"Frame (networking); Unary operation; Computer science; Action (physics); Time complexity; Algorithm; Discrete mathematics; Mathematics","score_opus":0.03006694627490485,"score_gpt":0.2902722793417352,"score_spread":0.26020533306683036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318602947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058207665,0.00018843102,0.93137777,0.0039299736,0.0017494241,0.0008610726,0.00030153155,0.00029248843,0.0030916275],"genre_scores_gemma":[0.9153026,0.000029649116,0.08214892,0.0005443739,0.00010756375,0.00030946694,0.00020940887,0.000039737413,0.001308312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763256,0.00018609544,0.00060429744,0.000568556,0.0006147268,0.00039375844],"domain_scores_gemma":[0.9978166,0.001329972,0.0002688841,0.00034899745,0.00014847404,0.00008706383],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082677335,0.00022211704,0.00030362923,0.00044577307,0.0005162008,0.00007895905,0.0010349783,0.000055256784,0.000089663394],"category_scores_gemma":[0.000051937244,0.00025471387,0.0001232579,0.0009995139,0.00008278579,0.0003509845,0.00023252462,0.00030822,0.000021009473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010735565,0.00011459341,0.00033980783,0.0000349362,0.000020646348,0.000018773357,0.0029891701,0.95592386,0.0020194605,0.03522626,0.0023372895,0.00086785835],"study_design_scores_gemma":[0.00022122455,0.0013107039,0.00028598218,0.00010450138,0.000008811728,0.000044904784,0.00065209175,0.9592579,0.0051473877,0.02997713,0.0025556667,0.0004337212],"about_ca_topic_score_codex":0.000070268616,"about_ca_topic_score_gemma":0.0000048912,"teacher_disagreement_score":0.8570949,"about_ca_system_score_codex":0.00015399914,"about_ca_system_score_gemma":0.0002675122,"threshold_uncertainty_score":0.9999905},"labels":[],"label_agreement":null},{"id":"W4320001877","doi":"10.2139/ssrn.4339133","title":"Uncertain Search with Knowledge Transfer","year":2023,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Knowledge transfer; Computer science; Knowledge management","score_opus":0.01953243502339851,"score_gpt":0.2643025125848332,"score_spread":0.2447700775614347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320001877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109840564,0.0016735605,0.88237256,0.002893198,0.0001737784,0.00010287906,0.0000010776964,0.00034716728,0.0025951872],"genre_scores_gemma":[0.99421436,0.0004005308,0.00091444526,0.000064563515,0.00015074061,0.000004604843,0.000002856538,0.000018224064,0.004229666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968272,0.0001407118,0.0001584899,0.0002474573,0.00029745445,0.002328707],"domain_scores_gemma":[0.9994305,0.00012145483,0.000021105618,0.00022590761,0.00008672474,0.000114311115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025083136,0.00013578012,0.00013155962,0.00021651607,0.00037551174,0.00015673858,0.00074742554,0.000053782675,0.000009796745],"category_scores_gemma":[0.000011126451,0.00010263217,0.00006133208,0.00097566657,0.00003064375,0.00028288222,0.000045919347,0.001638701,0.00023256923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008142026,0.00008678493,0.004302679,0.000034643417,0.0002605409,0.00014910198,0.0059033874,0.009527243,0.0006983163,0.7821745,0.0016818709,0.19509946],"study_design_scores_gemma":[0.0076192105,0.0076629594,0.0038955805,0.000767185,0.00011652324,0.00808395,0.006069625,0.34886366,0.0037917797,0.56687284,0.043389637,0.0028670393],"about_ca_topic_score_codex":0.000029231414,"about_ca_topic_score_gemma":0.00018864385,"teacher_disagreement_score":0.8843738,"about_ca_system_score_codex":0.00029058018,"about_ca_system_score_gemma":0.0030245918,"threshold_uncertainty_score":0.71194315},"labels":[],"label_agreement":null},{"id":"W434254472","doi":"10.2991/978-94-6239-030-0_23","title":"Integrative Procedure Learning","year":2014,"lang":"en","type":"book-chapter","venue":"Atlantis thinking machines","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pyrogenesis (Canada)","funders":"","keywords":"Computer science; Artificial intelligence","score_opus":0.009041457760418307,"score_gpt":0.2229257827136813,"score_spread":0.21388432495326298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W434254472","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001339957,0.0020803576,0.3343408,0.0010963696,0.0013887498,0.00029782427,0.000006932014,0.0015262023,0.6591288],"genre_scores_gemma":[0.039208464,0.00019928749,0.030769907,0.0010110524,0.00093741214,0.000011398372,0.00022663533,0.00015176482,0.9274841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975897,0.000094654584,0.00043563914,0.0008861173,0.00056639593,0.00042747433],"domain_scores_gemma":[0.99824756,0.00041410467,0.00044824157,0.000625472,0.00015086273,0.00011375224],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006752614,0.0006666502,0.00064935966,0.0002677002,0.00060524576,0.00050397665,0.0016151858,0.00045357374,0.000058007583],"category_scores_gemma":[0.00011071679,0.000531675,0.00023236156,0.00008605582,0.00007309095,0.00022156203,0.0005042439,0.0017130867,0.00032549136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008342057,0.0000070727338,0.0016848362,0.00015088166,0.00014485285,0.00012212736,0.003956587,0.0010248463,0.000023479512,0.9355343,0.01781622,0.039526436],"study_design_scores_gemma":[0.000452737,0.00041473538,0.00022611354,0.004066181,0.0001202665,0.00037395416,0.00001487371,0.10205888,0.00008482031,0.23105495,0.65894735,0.0021851666],"about_ca_topic_score_codex":0.00012753172,"about_ca_topic_score_gemma":0.000041426563,"teacher_disagreement_score":0.7044794,"about_ca_system_score_codex":0.000050268118,"about_ca_system_score_gemma":0.00012965316,"threshold_uncertainty_score":0.9997135},"labels":[],"label_agreement":null},{"id":"W4366748161","doi":"10.1016/j.simpa.2023.100505","title":"A tool for declarative Trace Alignment via automated planning","year":2023,"lang":"en","type":"article","venue":"Software Impacts","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"TRACE (psycholinguistics); Computer science; Planner; Programming language; Readability; Domain (mathematical analysis); Automated planning and scheduling; Artificial intelligence; Software engineering","score_opus":0.03240400380117723,"score_gpt":0.3095873810216779,"score_spread":0.2771833772205006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366748161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10125023,0.00026303262,0.8919414,0.00070995546,0.00036744308,0.00041768057,0.000032747994,0.0049661393,0.000051360046],"genre_scores_gemma":[0.8616521,0.0000025478716,0.1371747,0.00055459,0.00008785727,0.00009487648,0.000052367654,0.000031644417,0.00034933406],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983745,0.00006513099,0.00024437511,0.00039198803,0.00027666742,0.00064729876],"domain_scores_gemma":[0.9984275,0.00083604717,0.00012108364,0.00036968227,0.00007730933,0.00016839424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062142767,0.00020496783,0.00020677377,0.00016168087,0.00032083833,0.00020775742,0.00047640046,0.00010405731,0.0000059325343],"category_scores_gemma":[0.00044747468,0.00018845318,0.000086281456,0.00063417485,0.000020922325,0.00032640732,0.00011499714,0.0001280842,0.0001341152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022307262,0.00022948872,0.04116967,0.00062005984,0.0005004495,0.00073876145,0.058937434,0.1707828,0.007118649,0.0023292133,0.5731766,0.14417379],"study_design_scores_gemma":[0.0017210183,0.00082894746,0.03243255,0.0006231513,0.000034177338,0.000076581375,0.00016310508,0.9348635,0.007856502,0.008561591,0.011789631,0.0010492475],"about_ca_topic_score_codex":0.000016942451,"about_ca_topic_score_gemma":0.0000012405028,"teacher_disagreement_score":0.7640807,"about_ca_system_score_codex":0.00008434846,"about_ca_system_score_gemma":0.000165728,"threshold_uncertainty_score":0.7684898},"labels":[],"label_agreement":null},{"id":"W4377200562","doi":"10.1007/978-3-031-32883-1_47","title":"An Approach to Automatic Flight Deviation Detection","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Sequence (biology); Data mining; Process (computing); Cockpit; Task (project management); Relation (database); Real-time computing; Artificial intelligence; Systems engineering","score_opus":0.021118191137649588,"score_gpt":0.24407242691018652,"score_spread":0.22295423577253692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377200562","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014063476,0.00005091625,0.9950365,0.0002890623,0.0015294966,0.00041029992,0.0000028279867,0.0008080734,0.0017322068],"genre_scores_gemma":[0.21832883,0.000004011368,0.7796957,0.001053761,0.0004655559,0.000028223563,0.000015337466,0.000052170155,0.00035642978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964253,0.00006169067,0.0004538845,0.0015267384,0.00092568016,0.0006067335],"domain_scores_gemma":[0.9977167,0.00034206116,0.00021998832,0.0013016585,0.00017504593,0.0002445411],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014309728,0.00043227948,0.00038531038,0.0012076315,0.00040215775,0.00079097523,0.0025909867,0.000311612,0.000003964194],"category_scores_gemma":[0.0000981715,0.00041007172,0.00008035175,0.0012239473,0.00012240703,0.0007170167,0.0005123203,0.00062487385,0.00016936474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018278367,0.000018998096,0.00002279934,0.00005222239,0.0000060750094,0.000016131171,0.0015433274,0.23931003,0.00025101777,0.0046471525,0.000016604721,0.7541138],"study_design_scores_gemma":[0.00008838649,0.0001744651,0.00023409,0.00026526093,0.000005706799,0.000031101397,1.9818738e-7,0.96129715,0.0010195684,0.036138363,0.00024005136,0.00050564756],"about_ca_topic_score_codex":0.000031593037,"about_ca_topic_score_gemma":0.00004237467,"teacher_disagreement_score":0.75360817,"about_ca_system_score_codex":0.0002891913,"about_ca_system_score_gemma":0.00032485972,"threshold_uncertainty_score":0.99983513},"labels":[],"label_agreement":null},{"id":"W4381744193","doi":"10.1109/cscwd57460.2023.10152836","title":"Keynote 3 : Be Ready for AI Third Wave!?","year":2023,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science","score_opus":0.08105215749407906,"score_gpt":0.307653493891589,"score_spread":0.22660133639750996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381744193","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019936545,0.000032492677,0.9571215,0.02002414,0.00050586194,0.00017789123,0.000010457326,0.001370479,0.018763553],"genre_scores_gemma":[0.3841393,0.00003427031,0.45227695,0.02485263,0.0005297437,0.0001543776,0.00016267561,0.00005839835,0.13779166],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991214,0.00002126019,0.00013067521,0.00027108364,0.00014532759,0.00031021787],"domain_scores_gemma":[0.99919575,0.00029021577,0.000030946423,0.00035949692,0.00005559125,0.000067982895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035026277,0.00008770121,0.000097533615,0.00008401404,0.00017477603,0.0001220562,0.00037811152,0.000054166318,0.000017747023],"category_scores_gemma":[0.000054810687,0.00007391796,0.000046667537,0.00034018228,0.000011737375,0.00021576144,0.00012354176,0.00009092362,0.00023914146],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009149987,0.000014471166,0.00040973607,0.000036752448,0.000017416469,0.000024665615,0.0013308524,0.00079967035,0.000399628,0.14754893,0.81717676,0.032231957],"study_design_scores_gemma":[0.00031807844,0.00013283151,0.00045260455,0.000025941134,0.0000046499003,0.0000069203998,0.00003009384,0.6478221,0.0017974845,0.018010493,0.33116022,0.00023861288],"about_ca_topic_score_codex":0.00003958013,"about_ca_topic_score_gemma":0.0000080980335,"teacher_disagreement_score":0.6470224,"about_ca_system_score_codex":0.000012644978,"about_ca_system_score_gemma":0.000057257384,"threshold_uncertainty_score":0.30737594},"labels":[],"label_agreement":null},{"id":"W4382318399","doi":"10.1609/aaai.v37i13.27071","title":"Augmenting Flight Training with AI to Efficiently Train Pilots","year":2023,"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":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta; Alberta Machine Intelligence Institute; Compute Canada; Mitacs; Canadian Institute for Advanced Research","keywords":"Trainer; Formative assessment; Focus (optics); Computer science; Aeronautics; Flight training; Training (meteorology); Simulation; Flight simulator; Human–computer interaction; Multimedia; Engineering; Psychology; Mathematics education","score_opus":0.09997352605775058,"score_gpt":0.2982907249150196,"score_spread":0.19831719885726906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382318399","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7296069,0.000020508345,0.21535294,0.028822683,0.0010162506,0.0012221175,0.000014873874,0.0014325125,0.022511166],"genre_scores_gemma":[0.9921866,0.0000026600185,0.006470574,0.00067863025,0.00006756293,0.000039423972,9.681365e-7,0.000020275353,0.0005332739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99745995,0.000023806408,0.0004959518,0.00066180277,0.0006920852,0.0006664027],"domain_scores_gemma":[0.99863863,0.000177909,0.0002691969,0.0003131862,0.00043142264,0.00016964419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011677352,0.00027498975,0.00029120452,0.00030909557,0.00043246255,0.00044094352,0.0020121618,0.000073994255,0.000021706268],"category_scores_gemma":[0.00032894895,0.00019786906,0.00008844974,0.0022201487,0.00013261003,0.00035005415,0.00035538778,0.00036902202,0.0002340496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001196133,0.00016844804,0.0008799943,0.00010641026,0.000037750906,0.000009078574,0.030225378,0.00811428,0.05925043,0.7400476,0.001721207,0.15931985],"study_design_scores_gemma":[0.00011291615,0.0012487101,0.00088905887,0.001979245,0.000030499155,0.000025057569,0.0040180087,0.46195439,0.4834633,0.044375543,0.0009994195,0.0009038886],"about_ca_topic_score_codex":0.000025145357,"about_ca_topic_score_gemma":0.000007086973,"teacher_disagreement_score":0.69567204,"about_ca_system_score_codex":0.00004149906,"about_ca_system_score_gemma":0.00015937681,"threshold_uncertainty_score":0.8068866},"labels":[],"label_agreement":null},{"id":"W4382866729","doi":"10.1609/icaps.v33i1.27221","title":"Generalizing Action Justification and Causal Links to Policies","year":2023,"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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Air Force Office of Scientific Research; Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency","keywords":"Generalization; Action (physics); Context (archaeology); Computer science; Observable; State (computer science); Causal theory of reference; Management science; Epistemology; Mathematical economics; Theoretical computer science; Artificial intelligence; Mathematics; Economics; Algorithm","score_opus":0.09405748696312577,"score_gpt":0.3372824619862425,"score_spread":0.24322497502311674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866729","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98727536,0.000032340315,0.0027223646,0.0073701227,0.00033408118,0.00009249524,0.0000048384563,0.00059502013,0.0015733702],"genre_scores_gemma":[0.9923189,0.000019486528,0.007104553,0.00028461454,0.00005856439,0.000009789221,0.0000051201914,0.0000074218588,0.00019152842],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990514,0.000009117729,0.00020544691,0.00027777778,0.00028199152,0.00017425901],"domain_scores_gemma":[0.99940854,0.00008066667,0.00016016269,0.00007163947,0.00021330714,0.00006570507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044819113,0.000118866796,0.00011313083,0.0002579313,0.00024216292,0.0003604609,0.00045204998,0.00009328557,0.0000017022741],"category_scores_gemma":[0.00019997328,0.00009756716,0.000021655054,0.00037233302,0.00003097436,0.00025701884,0.00021895516,0.00024145909,0.000005857049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009971031,0.000041776024,0.04986083,0.00024636465,0.00014345166,0.0000039543893,0.01536586,0.029394224,0.5243282,0.35611212,0.005602226,0.018801324],"study_design_scores_gemma":[0.00013658841,0.00005079217,0.01455065,0.00062386395,0.000007833841,0.000018105144,0.0006590997,0.9594859,0.022044726,0.002055835,0.0002152865,0.00015132445],"about_ca_topic_score_codex":0.00005542993,"about_ca_topic_score_gemma":0.0000010143551,"teacher_disagreement_score":0.9300917,"about_ca_system_score_codex":0.000031508564,"about_ca_system_score_gemma":0.000033499644,"threshold_uncertainty_score":0.39786732},"labels":[],"label_agreement":null},{"id":"W4382866757","doi":"10.1609/icaps.v33i1.27218","title":"Symmetry Detection and Breaking in Linear Cost-Optimal Numeric Planning","year":2023,"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":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Academy of Sciences and Humanities","keywords":"Satisficing; Pruning; Symmetry (geometry); Symmetry breaking; Heuristic; Homogeneous space; Mathematics; Symmetry group; Rotational symmetry; Mathematical optimization; Computer science; Algorithm; Artificial intelligence; Physics; Geometry","score_opus":0.03892980605732845,"score_gpt":0.29940599164730153,"score_spread":0.2604761855899731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382866757","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9934923,0.00008083081,0.0032426554,0.00082237995,0.00036991865,0.00012503022,0.000003574347,0.00055001583,0.0013132623],"genre_scores_gemma":[0.99282694,0.000013653576,0.006949222,0.00009283964,0.00003984739,0.000013160012,0.000002912444,0.0000113775395,0.00005002654],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987063,0.000015624142,0.00030470476,0.00037077285,0.000338171,0.00026442876],"domain_scores_gemma":[0.99929184,0.00018242277,0.00024437023,0.00007420747,0.00014790548,0.000059249225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007050325,0.0001704701,0.00018668547,0.0004221788,0.00020642401,0.00026696158,0.000535801,0.000100984194,0.000001843576],"category_scores_gemma":[0.00025695257,0.00014554127,0.00003230213,0.00058340596,0.000048608963,0.00037572664,0.0002786878,0.00038887485,0.0000035589342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042764694,0.00013078238,0.48824325,0.0005661306,0.00028708923,0.000086463835,0.022780037,0.19563863,0.18884578,0.0552331,0.0004348748,0.047326222],"study_design_scores_gemma":[0.00029344507,0.000052083284,0.019942991,0.0012249039,0.0000052475807,0.00004311686,0.0007000796,0.9713467,0.0055394573,0.0006555308,0.000036706453,0.00015977117],"about_ca_topic_score_codex":0.000038671416,"about_ca_topic_score_gemma":5.487205e-7,"teacher_disagreement_score":0.775708,"about_ca_system_score_codex":0.00003630363,"about_ca_system_score_gemma":0.000039046772,"threshold_uncertainty_score":0.5935001},"labels":[],"label_agreement":null},{"id":"W4385439150","doi":"10.24963/kr.2023/76","title":"Planning with Epistemic Preferences","year":2023,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Schwartz/Reisman Emergency Medicine Institute; Vector Institute; University of Toronto","funders":"Open Philanthropy Project; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; Microsoft Research","keywords":"Plan (archaeology); Task (project management); Computer science; Field (mathematics); Management science; Epistemology; Knowledge management; Artificial intelligence; Engineering; Mathematics; Philosophy; Systems engineering","score_opus":0.035285215301806644,"score_gpt":0.2547124488275293,"score_spread":0.21942723352572266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385439150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19717774,0.00017029174,0.72249717,0.0023747121,0.00024956863,0.00013592318,0.0000015558944,0.0028762892,0.074516736],"genre_scores_gemma":[0.9679095,0.0000026858272,0.0277999,0.00017009939,0.000026374968,0.000009398995,0.0000048935062,0.000005230722,0.0040718815],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926394,0.00002591249,0.0000886936,0.0002264177,0.00016374108,0.00023131227],"domain_scores_gemma":[0.99950236,0.00015388682,0.000033592176,0.00023455224,0.000021815287,0.000053778112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002266657,0.00007825531,0.000077935874,0.00008870449,0.00012488349,0.000119170196,0.00043514202,0.000028253511,0.000015351183],"category_scores_gemma":[0.000009935866,0.000053765514,0.000013900124,0.0005102104,0.000016035205,0.00022001607,0.000084837135,0.00008871382,0.00025571676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000562323,0.00006178151,0.43826163,0.0002431135,0.00015416126,0.00074130116,0.016368417,0.07404212,0.0014033121,0.20779009,0.11440706,0.14647079],"study_design_scores_gemma":[0.0014231834,0.0011451992,0.073209405,0.0012239581,0.000021355834,0.00020024095,0.0010463767,0.84217596,0.0052018473,0.043524537,0.029077874,0.0017500516],"about_ca_topic_score_codex":0.000030239386,"about_ca_topic_score_gemma":0.0000033890728,"teacher_disagreement_score":0.7707318,"about_ca_system_score_codex":0.0000060734997,"about_ca_system_score_gemma":0.000049791386,"threshold_uncertainty_score":0.3286807},"labels":[],"label_agreement":null},{"id":"W4386227854","doi":"10.2196/50280","title":"Concerns on Generalizability","year":2023,"lang":"en","type":"article","venue":"JMIR mhealth and uhealth","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Generalizability theory; Psychology; Computer science; Medicine; Developmental psychology","score_opus":0.10785882072716282,"score_gpt":0.3929241729586538,"score_spread":0.285065352231491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386227854","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9521702,0.00060644816,0.011861781,0.028913287,0.00095228344,0.0005342476,0.000029020173,0.0014204136,0.0035123115],"genre_scores_gemma":[0.9909855,0.00021679925,0.0022512074,0.00584682,0.00019335796,0.000035526202,0.000017976794,0.000010553791,0.0004422714],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9983945,0.00015704962,0.00024128928,0.0004382311,0.00021467498,0.0005542904],"domain_scores_gemma":[0.9988641,0.00020991778,0.000089433386,0.00041222133,0.000030167646,0.0003941235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089600263,0.00012712396,0.00017754686,0.000114997405,0.00039321528,0.00006530664,0.00027341407,0.00007270497,0.000008728703],"category_scores_gemma":[0.00002948999,0.00011153454,0.000027981097,0.00048774693,0.000037249392,0.00011698398,0.00008368848,0.0002222221,0.00013503233],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011734216,0.00019706416,0.08995111,0.002170988,0.000018352905,0.00007601146,0.010486719,0.00088418525,0.00003995264,0.22545657,0.40352848,0.2670732],"study_design_scores_gemma":[0.0023024231,0.0022950622,0.5237172,0.0002550989,0.000017084067,0.000036118105,0.00018017324,0.24636954,0.00012442423,0.021037377,0.20265114,0.0010143495],"about_ca_topic_score_codex":0.00017857099,"about_ca_topic_score_gemma":0.000011463837,"teacher_disagreement_score":0.4337661,"about_ca_system_score_codex":0.0000550607,"about_ca_system_score_gemma":0.00027223397,"threshold_uncertainty_score":0.45482463},"labels":[],"label_agreement":null},{"id":"W4387171855","doi":"10.3233/faia230409","title":"Extracting and Exploiting Bounds of Numeric Variables for Optimal Linear Numeric Planning","year":2023,"lang":"en","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristic; Variable (mathematics); State variable; Function (biology); Mathematical optimization; Polynomial; Constant (computer programming); Mathematics; Exploit; Time complexity; State (computer science); Linear programming; Computer science; Algorithm; Applied mathematics","score_opus":0.07186557574386285,"score_gpt":0.30061782534048914,"score_spread":0.2287522495966263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387171855","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007386563,0.0013337363,0.994215,0.00011675581,0.00022928196,0.0004477385,0.00003207258,0.000098485434,0.0034530705],"genre_scores_gemma":[0.027654167,0.0008847241,0.95832825,0.0000923197,0.00058977125,0.000536448,0.00012250492,0.00011034436,0.011681448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841326,0.000014626481,0.00059142377,0.00055264356,0.00014324475,0.00028479946],"domain_scores_gemma":[0.9987204,0.0004822229,0.000360715,0.0002813321,0.00008022067,0.000075113014],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049181166,0.0002311509,0.00036798196,0.000302588,0.00031467262,0.00012355024,0.00035795194,0.00018881212,0.000003192376],"category_scores_gemma":[0.00005893123,0.00026255086,0.000059226848,0.00021163012,0.00013561429,0.0002009418,0.000130296,0.0003096153,0.0000046708947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022147451,0.000029697285,0.00040788596,0.00025949656,0.00006090687,0.0000055905243,0.0021999814,0.0146723855,0.000109366265,0.4329231,0.0005600985,0.5487493],"study_design_scores_gemma":[0.00005057405,0.00012030009,0.000012196083,0.0008239591,0.00005555885,0.000010593117,0.0015196815,0.6020075,0.00080532295,0.36708286,0.026874464,0.00063697575],"about_ca_topic_score_codex":0.000026020442,"about_ca_topic_score_gemma":0.0000019917377,"teacher_disagreement_score":0.5873351,"about_ca_system_score_codex":0.000025635645,"about_ca_system_score_gemma":0.00008080052,"threshold_uncertainty_score":0.99998266},"labels":[],"label_agreement":null},{"id":"W4387218579","doi":"10.4204/eptcs.391.14","title":"ORTAC+ : A User Friendly Domain Specific Language for Multi-Agent Mission Planning","year":2023,"lang":"en","type":"article","venue":"Electronic Proceedings in Theoretical Computer Science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Safran Electronics (Canada)","funders":"","keywords":"Computer science; USable; Planner; Domain (mathematical analysis); Plan (archaeology); Modeling language; Semantics (computer science); Robot; Agile software development; Software engineering; Human–computer interaction; Field (mathematics); Drone; Natural language; Programming language; Artificial intelligence; Operations research; Engineering; World Wide Web","score_opus":0.01776820336026865,"score_gpt":0.2921193739152016,"score_spread":0.27435117055493297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387218579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18488233,0.00021554569,0.81245726,0.0007931207,0.00034166014,0.00040167448,0.0000016875309,0.0005166342,0.00039007663],"genre_scores_gemma":[0.7615028,0.000008799923,0.23803167,0.00021058744,0.0001338545,0.000038199312,0.0000033102108,0.000020229518,0.000050517392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959072,0.000033458997,0.0004128202,0.001209107,0.0006680038,0.0017694187],"domain_scores_gemma":[0.9988235,0.00028529792,0.00012208274,0.00036102225,0.0001467985,0.00026128654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0037590729,0.00029514142,0.0002862921,0.00058745255,0.0006006316,0.0005914079,0.002426673,0.000110664354,0.000010324308],"category_scores_gemma":[0.00012864998,0.000259406,0.0000894927,0.0029353765,0.0005139738,0.00073471497,0.00072149956,0.0005228178,0.000046256875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024046762,0.000051815772,0.00058286503,0.00003146237,0.00000475207,0.000027538033,0.0047249957,0.0003910678,0.005055877,0.98113155,0.0011265702,0.0068474677],"study_design_scores_gemma":[0.0011128953,0.00059400353,0.0009981906,0.000298484,0.000003984311,0.000052879062,0.00025017117,0.9091805,0.009029926,0.068096,0.0097631775,0.0006197788],"about_ca_topic_score_codex":0.0000026024802,"about_ca_topic_score_gemma":4.819601e-7,"teacher_disagreement_score":0.9130355,"about_ca_system_score_codex":0.0002787644,"about_ca_system_score_gemma":0.00028258492,"threshold_uncertainty_score":0.9999858},"labels":[],"label_agreement":null},{"id":"W4387271805","doi":"10.2139/ssrn.4562699","title":"Comments on 'Canadian Guardrails for Generative AI – Code of Practice'","year":2023,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Generative grammar; Code (set theory); Code of practice; Computer science; Artificial intelligence; Programming language; Engineering; Engineering ethics; Set (abstract data type)","score_opus":0.01901172638986167,"score_gpt":0.30149284016028927,"score_spread":0.2824811137704276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387271805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077924714,0.00073555706,0.9131369,0.07454922,0.0007365996,0.00038884435,0.000042418,0.000119639946,0.0024983347],"genre_scores_gemma":[0.9828182,0.0004307041,0.009521224,0.0052665872,0.00026094745,0.000019636935,0.00002245564,0.000025988395,0.0016342987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976276,0.00013031329,0.00022755803,0.00019365239,0.00023785922,0.0015829979],"domain_scores_gemma":[0.99895203,0.00035152602,0.00018350307,0.00020792829,0.00017276971,0.00013225125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025665972,0.00011454345,0.00014562962,0.0002535236,0.0003808652,0.00010910234,0.0005601115,0.00005884604,0.000004079664],"category_scores_gemma":[0.00022466973,0.00010488509,0.000078411984,0.00035667373,0.000018619841,0.00034444054,0.00003162652,0.0008618316,0.00003866801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000845568,0.00007266241,0.00048571214,0.00001410025,0.00037881793,0.00002696624,0.0025799442,0.006574655,0.00045092675,0.87458676,0.039789863,0.07495503],"study_design_scores_gemma":[0.00276026,0.0043285117,0.00032806088,0.0002080427,0.000072637326,0.0004528868,0.0016589249,0.09052303,0.0033499287,0.6572653,0.23833144,0.0007209965],"about_ca_topic_score_codex":0.0008770225,"about_ca_topic_score_gemma":0.005047402,"teacher_disagreement_score":0.9750257,"about_ca_system_score_codex":0.00048020738,"about_ca_system_score_gemma":0.0033717763,"threshold_uncertainty_score":0.59813863},"labels":[],"label_agreement":null},{"id":"W4387323330","doi":"10.48550/arxiv.2310.00229","title":"Consciousness-Inspired Spatio-Temporal Abstractions for Better Generalization in Reinforcement Learning","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University; Microsoft Research","keywords":"Abstraction; Generalization; Computer science; Artificial intelligence; Mathematics; Epistemology","score_opus":0.08887406027623773,"score_gpt":0.21789536170806487,"score_spread":0.12902130143182713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387323330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12527777,0.000013223615,0.87264836,0.0003780817,0.00061518716,0.0003987505,0.000009242133,0.00038764847,0.00027171828],"genre_scores_gemma":[0.9917252,0.000028148703,0.004669444,0.00011036261,0.0000823038,0.000008944898,0.00042610161,0.000023476825,0.0029260148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984017,0.000100620535,0.000294529,0.00076966325,0.00008990088,0.00034356906],"domain_scores_gemma":[0.99877524,0.00018416393,0.0003279719,0.00049301895,0.00013496901,0.00008465933],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042458632,0.00023531336,0.00024655517,0.00043295545,0.0002758694,0.00015091349,0.0006634406,0.0002478749,0.000018274628],"category_scores_gemma":[0.000049913364,0.00029989486,0.000111318106,0.000428687,0.00003740028,0.00033207543,0.0004726812,0.00048760796,0.000059064056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015568387,0.000015994541,0.03609327,0.00007847338,0.000029393566,0.0000568818,0.0003213892,0.95197433,0.000012121117,0.010485123,0.0007085475,0.00020887781],"study_design_scores_gemma":[0.0004876723,0.000052612326,0.0023496565,0.00014831586,0.000024502753,9.572442e-7,0.00004230123,0.98505247,0.000053309483,0.009653274,0.0017879182,0.00034700977],"about_ca_topic_score_codex":0.0009391927,"about_ca_topic_score_gemma":0.00050904,"teacher_disagreement_score":0.86797893,"about_ca_system_score_codex":0.00023050554,"about_ca_system_score_gemma":0.00022054696,"threshold_uncertainty_score":0.99994534},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.022300990622760038,"score_gpt":0.26218646418745395,"score_spread":0.23988547356469392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387937021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003280757,0.00020492026,0.9909833,0.0012017677,0.0002533904,0.000169761,0.00002444411,0.0011361422,0.0027454987],"genre_scores_gemma":[0.8311322,0.000011723115,0.15523875,0.0005896582,0.00023516259,0.00008759343,0.00016348211,0.0000492853,0.012492198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987287,0.000018104565,0.00019210283,0.0003795117,0.00014236821,0.00053920265],"domain_scores_gemma":[0.99908644,0.00017475778,0.00007272201,0.0005178881,0.000045381832,0.0001028208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038075217,0.00015130293,0.00016838274,0.000056307315,0.00021590995,0.00012551674,0.00066484016,0.00010330167,0.000010567279],"category_scores_gemma":[0.000037319227,0.0001559605,0.00008742537,0.0003336757,0.000013296947,0.00025453133,0.00020695163,0.00013107444,0.00013713803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003697316,0.00003754207,0.000071183764,0.0000913484,0.000026507887,0.000047987458,0.0033206993,0.95628726,0.001381868,0.020926144,0.011392138,0.006413648],"study_design_scores_gemma":[0.00030547578,0.00002352561,0.00003511244,0.000027187618,0.0000064459064,0.000008241261,0.000084936095,0.9894836,0.0016680519,0.005987175,0.002150505,0.00021975298],"about_ca_topic_score_codex":0.000013646044,"about_ca_topic_score_gemma":0.000002791169,"teacher_disagreement_score":0.83574456,"about_ca_system_score_codex":0.000041498777,"about_ca_system_score_gemma":0.00011643048,"threshold_uncertainty_score":0.6359885},"labels":[],"label_agreement":null},{"id":"W4389545343","doi":"10.1109/icee59167.2023.10334703","title":"A Modified Dempster Shafer Approach to Classification in Surgical Skill Assessment","year":2023,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Artificial intelligence; Machine learning; Computer science; Support vector machine; Dempster–Shafer theory; Expert system; Classifier (UML); Probabilistic logic","score_opus":0.06434791269281578,"score_gpt":0.32107640678882665,"score_spread":0.25672849409601084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389545343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058104455,0.000007662686,0.8252988,0.0029923928,0.00012668676,0.00024593226,0.0000012566214,0.000452747,0.11277007],"genre_scores_gemma":[0.93384445,0.0000016182827,0.06348675,0.00033442775,0.000028259246,0.00006856457,0.000016715387,0.000006575208,0.0022126534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987243,0.00010472321,0.00021168035,0.0004089561,0.0002491273,0.00030124374],"domain_scores_gemma":[0.9993247,0.00014951265,0.00002813612,0.00036929635,0.000028011262,0.00010037805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084272906,0.00010021548,0.00012344625,0.00022602105,0.00006367491,0.00013089216,0.00047222947,0.00006842281,0.000009512691],"category_scores_gemma":[0.000014616852,0.00008424367,0.00003302449,0.0009553492,0.000008381215,0.00019044805,0.00016989282,0.00014900141,0.00019718327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033062985,0.0004969437,0.04206748,0.00007616933,0.00003119318,0.00011637525,0.0073627336,0.12919785,0.00049521413,0.72255313,0.028299691,0.06927015],"study_design_scores_gemma":[0.00024877035,0.000027189722,0.06480497,0.000016384807,0.0000010663247,0.0000050771373,0.000056993955,0.93073726,0.000028340593,0.000985922,0.0029371497,0.00015087365],"about_ca_topic_score_codex":0.000051124494,"about_ca_topic_score_gemma":0.000005301716,"teacher_disagreement_score":0.87574,"about_ca_system_score_codex":0.000054530476,"about_ca_system_score_gemma":0.00006635322,"threshold_uncertainty_score":0.34353572},"labels":[],"label_agreement":null},{"id":"W4389742382","doi":"10.1007/s10489-023-05087-1","title":"Temporally extended goal recognition in fully observable non-deterministic domain models","year":2023,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Domain (mathematical analysis); Linear temporal logic; Task (project management); Set (abstract data type); Artificial intelligence; Observable; Plan (archaeology); State (computer science); Machine learning; Theoretical computer science; Algorithm; Mathematics","score_opus":0.050642338118787836,"score_gpt":0.2628539234140657,"score_spread":0.2122115852952779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389742382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055208966,0.000037930662,0.9284117,0.00026471168,0.00027688826,0.00040610044,0.000008714831,0.00050748757,0.01487749],"genre_scores_gemma":[0.92481977,0.000026394788,0.07433189,0.0003184907,0.000048347778,0.00014354927,0.000043157484,0.000020905625,0.0002475288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978891,0.0000511206,0.0004768803,0.00066598796,0.00032566139,0.0005912364],"domain_scores_gemma":[0.9988357,0.0003016104,0.00012812545,0.00055868505,0.000057210458,0.00011868782],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00093113875,0.00023075646,0.0002455639,0.00025778313,0.00015999972,0.00017217302,0.0009958948,0.00012905517,0.000023719285],"category_scores_gemma":[0.000032977754,0.00024150396,0.000053902444,0.0012698174,0.000054084827,0.00040188516,0.0002479028,0.00030835567,0.0011420563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002146251,0.00034745643,0.0007294324,0.00035348325,0.000053854063,0.0008793907,0.015106009,0.13958086,0.016370824,0.14710318,0.0056831804,0.6735777],"study_design_scores_gemma":[0.00015425494,0.000107438216,0.00053531176,0.00014235392,0.0000037026036,0.000012464199,0.0002651832,0.53732157,0.0035765346,0.45714992,0.00030845555,0.0004228387],"about_ca_topic_score_codex":0.00010492454,"about_ca_topic_score_gemma":0.00002457745,"teacher_disagreement_score":0.8696108,"about_ca_system_score_codex":0.0000617187,"about_ca_system_score_gemma":0.00014733733,"threshold_uncertainty_score":0.9996357},"labels":[],"label_agreement":null},{"id":"W4391021066","doi":"10.1109/smarttechcon57526.2023.10391752","title":"Development and Application of Mechanical Design Engineering Database Based on Simulated Annealing Algorithm","year":2023,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Horizon College and Seminary","funders":"","keywords":"Computer science; Simulated annealing; Relational database; Data modeling; Engineering design process; Database design; Adaptability; Data redundancy; Data management; Data mining; Database; Algorithm; Engineering","score_opus":0.02689438894097681,"score_gpt":0.24475160932676912,"score_spread":0.2178572203857923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391021066","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031068858,0.000008545147,0.9962987,0.00008701077,0.00003430185,0.00011510232,0.0000020546054,0.00032925964,0.000018170867],"genre_scores_gemma":[0.24962604,8.4613913e-7,0.7502618,0.000059909184,0.000007183385,0.0000067991323,0.000022714552,0.000005896068,0.000008793838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923646,0.000024388566,0.00017205658,0.0002426459,0.00016558787,0.0001588734],"domain_scores_gemma":[0.9992813,0.00036346854,0.00004036061,0.00022324808,0.000029737486,0.00006189048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006530651,0.00008629326,0.000094068324,0.00013519017,0.000065158434,0.000027930724,0.00018762007,0.000038731625,0.0000017110847],"category_scores_gemma":[0.000036947044,0.00008059164,0.0000114693885,0.00042167466,0.000004676969,0.00008619431,0.00007336628,0.00007096784,0.000012121767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056033564,0.000017166627,0.000033587345,0.000036534613,0.000008554989,0.00000864796,0.00018117436,0.87281626,0.0051888525,0.002167709,0.00008343112,0.11945249],"study_design_scores_gemma":[0.00016002673,0.000028605615,0.00006884955,0.00004695842,0.0000017304976,6.862727e-7,0.000004438214,0.96342164,0.035877295,0.00004115055,0.00025367615,0.000094916555],"about_ca_topic_score_codex":0.00001604108,"about_ca_topic_score_gemma":3.400397e-7,"teacher_disagreement_score":0.24651916,"about_ca_system_score_codex":0.00001458028,"about_ca_system_score_gemma":0.000045021723,"threshold_uncertainty_score":0.32864317},"labels":[],"label_agreement":null},{"id":"W4391400188","doi":"10.1007/s10472-023-09908-4","title":"A knowledge compilation perspective on queries and transformations for belief tracking","year":2024,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Minnow Environmental (Canada)","funders":"Agence Nationale de la Recherche","keywords":"Succinctness; Nondeterministic algorithm; Computer science; Theoretical computer science; Action (physics); State (computer science); Belief revision; Perspective (graphical); Artificial intelligence; Algorithm","score_opus":0.17474759199431658,"score_gpt":0.39334058518358,"score_spread":0.21859299318926342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391400188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011113158,0.001627234,0.98302656,0.0028038172,0.000078360885,0.00017322425,0.00002327257,0.000056923105,0.001097447],"genre_scores_gemma":[0.9709734,0.0001560605,0.028739052,0.000053446103,0.000032538763,0.000012293646,0.0000022846643,0.000005939665,0.000025020217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939233,0.000012611367,0.0002466121,0.00015799985,0.00007670907,0.00011375005],"domain_scores_gemma":[0.9990831,0.0006034267,0.000047019952,0.00009169733,0.00013910882,0.000035664743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004183515,0.00008510685,0.0001219719,0.00010338454,0.0001507877,0.00019601588,0.000099531266,0.000033848297,0.000002492636],"category_scores_gemma":[0.00007769713,0.00007377803,0.000039756538,0.00014321902,0.000060834413,0.00025599948,0.000018391298,0.000067396366,0.000003918598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031694442,0.000047581085,0.0000015221947,0.00020947936,0.00001201676,3.9875937e-7,0.02908831,0.00017552849,0.00023567452,0.8813165,0.000067952,0.088841856],"study_design_scores_gemma":[0.000008090021,0.00016985893,0.000007472687,0.00039760093,0.000006425747,0.0000033468925,0.001869312,0.49240768,0.0229942,0.48163915,0.00041144912,0.00008543627],"about_ca_topic_score_codex":0.000008781077,"about_ca_topic_score_gemma":0.000011194644,"teacher_disagreement_score":0.9598602,"about_ca_system_score_codex":0.0000047932476,"about_ca_system_score_gemma":0.00002795017,"threshold_uncertainty_score":0.30085808},"labels":[],"label_agreement":null},{"id":"W4391637579","doi":"10.32920/25190978","title":"Heuristic Planning for Continuous Systems in Hybrid Temporal Situation Calculus","year":2024,"lang":"en","type":"preprint","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"","keywords":"Planner; Heuristic; Scalability; Domain (mathematical analysis); Computer science; Linear programming; Discretization; Set (abstract data type); Transition system; Mathematical optimization; State (computer science); Hybrid system; Polynomial; Time complexity; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Programming language; Machine learning","score_opus":0.030447363827121373,"score_gpt":0.2853578512730612,"score_spread":0.2549104874459398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391637579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010441096,0.0037739698,0.97821546,0.00051098556,0.003382139,0.000935157,0.000052497824,0.0006197697,0.0020689268],"genre_scores_gemma":[0.9752691,0.000003101076,0.022459675,0.000089529574,0.00026274973,0.00024099607,0.00017925593,0.000029840883,0.0014657526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977486,0.00010654735,0.0005904635,0.00085448904,0.0002794552,0.00042043187],"domain_scores_gemma":[0.99864864,0.00040358212,0.000208202,0.0005475379,0.00010197545,0.000090065245],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011019374,0.0003136046,0.00047527943,0.0003355927,0.000087363165,0.0007973159,0.0007596544,0.00020046388,0.0000026833413],"category_scores_gemma":[0.00011442085,0.0002955792,0.0001217852,0.0001717445,0.000017627372,0.000097618,0.0008245696,0.0006988769,0.000042642056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007638245,0.00014891743,0.006704862,0.007830948,0.00024387932,0.0015022021,0.007976984,0.77938193,0.0001138009,0.086557455,0.08674571,0.02271694],"study_design_scores_gemma":[0.00022274085,0.00006353463,0.000079900725,0.0016836217,0.000019328287,0.000029959245,0.000059699254,0.98265505,0.000050540362,0.0128545305,0.0018903344,0.00039077562],"about_ca_topic_score_codex":0.0013390244,"about_ca_topic_score_gemma":0.000019412162,"teacher_disagreement_score":0.964828,"about_ca_system_score_codex":0.00015313191,"about_ca_system_score_gemma":0.00033716118,"threshold_uncertainty_score":0.99994963},"labels":[],"label_agreement":null},{"id":"W4391658256","doi":"10.32920/25190978.v1","title":"Heuristic Planning for Continuous Systems in Hybrid Temporal Situation Calculus","year":2024,"lang":"en","type":"preprint","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"","keywords":"Heuristic; Planner; Scalability; Domain (mathematical analysis); Computer science; Linear programming; Discretization; Set (abstract data type); Hybrid system; Transition system; Mathematical optimization; State (computer science); Time complexity; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Programming language; Machine learning","score_opus":0.030447363827121373,"score_gpt":0.2853578512730612,"score_spread":0.2549104874459398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391658256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010441096,0.0037739698,0.97821546,0.00051098556,0.003382139,0.000935157,0.000052497824,0.0006197697,0.0020689268],"genre_scores_gemma":[0.9752691,0.000003101076,0.022459675,0.000089529574,0.00026274973,0.00024099607,0.00017925593,0.000029840883,0.0014657526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977486,0.00010654735,0.0005904635,0.00085448904,0.0002794552,0.00042043187],"domain_scores_gemma":[0.99864864,0.00040358212,0.000208202,0.0005475379,0.00010197545,0.000090065245],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011019374,0.0003136046,0.00047527943,0.0003355927,0.000087363165,0.0007973159,0.0007596544,0.00020046388,0.0000026833413],"category_scores_gemma":[0.00011442085,0.0002955792,0.0001217852,0.0001717445,0.000017627372,0.000097618,0.0008245696,0.0006988769,0.000042642056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007638245,0.00014891743,0.006704862,0.007830948,0.00024387932,0.0015022021,0.007976984,0.77938193,0.0001138009,0.086557455,0.08674571,0.02271694],"study_design_scores_gemma":[0.00022274085,0.00006353463,0.000079900725,0.0016836217,0.000019328287,0.000029959245,0.000059699254,0.98265505,0.000050540362,0.0128545305,0.0018903344,0.00039077562],"about_ca_topic_score_codex":0.0013390244,"about_ca_topic_score_gemma":0.000019412162,"teacher_disagreement_score":0.964828,"about_ca_system_score_codex":0.00015313191,"about_ca_system_score_gemma":0.00033716118,"threshold_uncertainty_score":0.99994963},"labels":[],"label_agreement":null},{"id":"W4392659163","doi":"10.5194/egusphere-egu24-16855","title":"Improving process understanding using multi-criteria model comparison for different catchments","year":2024,"lang":"en","type":"preprint","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Process (computing); Computer science; Process management; Environmental resource management; Business; Environmental science; Programming language","score_opus":0.2263910519668734,"score_gpt":0.3969314836353519,"score_spread":0.17054043166847851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392659163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025225488,0.00041479128,0.97066915,0.00024959628,0.0016981004,0.000852469,0.000057296307,0.00065724965,0.00017586653],"genre_scores_gemma":[0.69844735,0.0000014981928,0.3010101,0.00007122903,0.00008451053,0.000077045435,0.00004130338,0.000042307096,0.00022462416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706966,0.00005050342,0.00062291254,0.0012436052,0.00036816762,0.0006451542],"domain_scores_gemma":[0.9986155,0.00012903394,0.00031004325,0.0006759085,0.00010424233,0.0001652638],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00044342133,0.00054204924,0.0005955416,0.00027829732,0.00034753463,0.0012989332,0.0012074694,0.0003251073,0.0000039357524],"category_scores_gemma":[0.000028593868,0.00048070503,0.00020815864,0.00014862354,0.000031001964,0.0001952143,0.0020706244,0.0007968517,0.000004233298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005422134,0.00038137785,0.0017187428,0.01117383,0.00037871802,0.000019781959,0.016838707,0.9333334,0.0038238901,0.026189964,0.0013615515,0.0047258227],"study_design_scores_gemma":[0.00032318747,0.000033711076,0.0000038841854,0.0009968095,0.00007437006,0.0000029731887,0.00021108762,0.9474257,0.0012795856,0.049076837,0.0000041171884,0.000567728],"about_ca_topic_score_codex":0.0001743341,"about_ca_topic_score_gemma":0.000024674038,"teacher_disagreement_score":0.6732219,"about_ca_system_score_codex":0.0006582367,"about_ca_system_score_gemma":0.00042016452,"threshold_uncertainty_score":0.99976444},"labels":[],"label_agreement":null},{"id":"W4393988223","doi":"10.1002/aaai.12169","title":"The 2023 International Planning Competition","year":2024,"lang":"en","type":"article","venue":"AI Magazine","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council; European Research Council; Natural Sciences and Engineering Research Council of Canada; Vetenskapsrådet; University of Edinburgh","keywords":"Competition (biology); Business; Biology; Ecology","score_opus":0.012893691884000007,"score_gpt":0.27399845271392986,"score_spread":0.26110476082992984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393988223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011319581,0.0024989708,0.8980573,0.045891777,0.0038873556,0.00007437711,0.000007865477,0.0005602849,0.047890123],"genre_scores_gemma":[0.9731548,0.00005730288,0.00930899,0.0020001708,0.0006756233,0.000018117362,0.00004891052,0.000015330214,0.014720779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99935246,0.00002714659,0.00011341672,0.00018039146,0.00017675008,0.00014985079],"domain_scores_gemma":[0.99948686,0.00024449528,0.000019550753,0.00018227976,0.000035672216,0.000031142743],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003255419,0.000067482295,0.000044843426,0.000055168573,0.000167581,0.0005623933,0.00047733219,0.000024763296,0.00004279362],"category_scores_gemma":[0.00002536757,0.00004809053,0.000031821462,0.00019120744,0.000021994269,0.00028539557,0.00011437969,0.00017501251,0.00087474653],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000078305975,0.000013508109,0.0012463368,0.00002518496,0.00005867537,0.00019546783,0.0007158253,0.0025894395,0.00094785634,0.5317281,0.3755443,0.086927496],"study_design_scores_gemma":[0.00006130783,0.000025152267,0.0014686807,0.00012319646,0.0000025608513,0.000034282482,0.0000060431926,0.2723988,0.000075705546,0.0068777874,0.71884274,0.00008374228],"about_ca_topic_score_codex":0.000005367625,"about_ca_topic_score_gemma":0.000002595556,"teacher_disagreement_score":0.97202283,"about_ca_system_score_codex":0.000022512082,"about_ca_system_score_gemma":0.000036578633,"threshold_uncertainty_score":0.9999032},"labels":[],"label_agreement":null},{"id":"W4396608908","doi":"10.1287/mnsc.2020.03565","title":"Learning to Optimize Contextually Constrained Problems for Real-Time Decision Generation","year":2024,"lang":"en","type":"article","venue":"Management Science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Ottawa; York University; University of Toronto","funders":"","keywords":"Computer science; Context (archaeology); Artificial intelligence; Cognitive psychology; Psychology","score_opus":0.020803957145570026,"score_gpt":0.2712913299325325,"score_spread":0.2504873727869625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396608908","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006272586,0.00004709798,0.9799308,0.0011913112,0.000497392,0.0006799586,0.0000019879963,0.00048145905,0.010897415],"genre_scores_gemma":[0.3761274,0.000016395115,0.6182867,0.0003062747,0.00007203861,0.000109375476,0.0000072483435,0.000011545708,0.0050630122],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980142,0.00003079774,0.0002465012,0.00078509474,0.0004929057,0.0004304892],"domain_scores_gemma":[0.9991805,0.00020912114,0.000045793968,0.00033756814,0.00009182536,0.00013517127],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0024044085,0.00014016406,0.00012024343,0.0003859809,0.00055645534,0.0013746701,0.00095787394,0.000028201706,0.000022069955],"category_scores_gemma":[0.00010965687,0.0001266513,0.00004622696,0.0011716955,0.00008492938,0.00074318185,0.00034306402,0.00008513456,0.0001824775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013316229,0.000028685072,0.000036086672,0.00011453419,0.000024167317,0.00003604652,0.0029503333,0.37557942,0.02926057,0.12778516,0.018195607,0.44597608],"study_design_scores_gemma":[0.00017654998,0.00020901873,0.00005531834,0.00020124977,0.000007548987,0.000004023198,0.000049697326,0.9842236,0.00053350837,0.0012437049,0.013103164,0.00019260685],"about_ca_topic_score_codex":0.000010832621,"about_ca_topic_score_gemma":0.0000016943901,"teacher_disagreement_score":0.6086442,"about_ca_system_score_codex":0.00008815291,"about_ca_system_score_gemma":0.00008692228,"threshold_uncertainty_score":0.999662},"labels":[],"label_agreement":null},{"id":"W4398431629","doi":"10.7910/dvn/bsungb/9h0q9s","title":"third pilot - cognitive abilities test - data.tab","year":2018,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Test (biology); Computer science; Cognition; Psychology; Biology; Neuroscience; Ecology","score_opus":0.04368191948941372,"score_gpt":0.2708479359243129,"score_spread":0.22716601643489917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398431629","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000049232667,0.000009534492,0.006616984,0.000023399256,0.0015513697,0.00035890803,0.99064565,0.0003150097,0.00047423004],"genre_scores_gemma":[0.000026842272,0.00014755048,0.006845048,0.0010157938,0.0010393873,0.000028689503,0.99041057,0.000028176615,0.00045797403],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959453,0.00024750392,0.0005714722,0.0017312638,0.00073929195,0.00076521],"domain_scores_gemma":[0.9910621,0.0020056453,0.00043061312,0.0059764953,0.00024881127,0.0002763358],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0013376622,0.0006229637,0.00058323564,0.0002705028,0.00047234714,0.0008449099,0.0068634856,0.00030338595,0.0031648185],"category_scores_gemma":[0.002250198,0.000602322,0.0000795068,0.0003795253,0.0003822052,0.0020362446,0.005154169,0.0008595662,0.095188044],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028245802,0.00015947116,0.000037603313,0.00018362471,0.000075768,0.00015321223,0.000090900976,0.0000014471603,0.0000019053116,0.000046648187,0.9989277,0.0002934843],"study_design_scores_gemma":[0.00048499554,0.00050243567,0.000029609977,0.00060915016,0.00012810322,0.000051257433,0.000051538813,0.0012880266,0.000012955275,0.00016614397,0.99593854,0.0007372493],"about_ca_topic_score_codex":0.0013927334,"about_ca_topic_score_gemma":0.00026535869,"teacher_disagreement_score":0.09202322,"about_ca_system_score_codex":0.000077228986,"about_ca_system_score_gemma":0.0006461846,"threshold_uncertainty_score":0.9996428},"labels":[],"label_agreement":null},{"id":"W4398451061","doi":"10.7910/dvn/bsungb/gbzgzj","title":"third pilot - cognitive abilities test - data.tab","year":2018,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Test (biology); Cognition; Computer science; Psychology; Biology; Neuroscience; Ecology","score_opus":0.04368191948941372,"score_gpt":0.2708479359243129,"score_spread":0.22716601643489917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398451061","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000049232667,0.000009534492,0.006616984,0.000023399256,0.0015513697,0.00035890803,0.99064565,0.0003150097,0.00047423004],"genre_scores_gemma":[0.000026842272,0.00014755048,0.006845048,0.0010157938,0.0010393873,0.000028689503,0.99041057,0.000028176615,0.00045797403],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959453,0.00024750392,0.0005714722,0.0017312638,0.00073929195,0.00076521],"domain_scores_gemma":[0.9910621,0.0020056453,0.00043061312,0.0059764953,0.00024881127,0.0002763358],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0013376622,0.0006229637,0.00058323564,0.0002705028,0.00047234714,0.0008449099,0.0068634856,0.00030338595,0.0031648185],"category_scores_gemma":[0.002250198,0.000602322,0.0000795068,0.0003795253,0.0003822052,0.0020362446,0.005154169,0.0008595662,0.095188044],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028245802,0.00015947116,0.000037603313,0.00018362471,0.000075768,0.00015321223,0.000090900976,0.0000014471603,0.0000019053116,0.000046648187,0.9989277,0.0002934843],"study_design_scores_gemma":[0.00048499554,0.00050243567,0.000029609977,0.00060915016,0.00012810322,0.000051257433,0.000051538813,0.0012880266,0.000012955275,0.00016614397,0.99593854,0.0007372493],"about_ca_topic_score_codex":0.0013927334,"about_ca_topic_score_gemma":0.00026535869,"teacher_disagreement_score":0.09202322,"about_ca_system_score_codex":0.000077228986,"about_ca_system_score_gemma":0.0006461846,"threshold_uncertainty_score":0.9996428},"labels":[],"label_agreement":null},{"id":"W4398488223","doi":"10.7910/dvn/bsungb/ob3h7m","title":"third pilot - cognitive abilities test - Qualtrics questionnaire PDF version.pdf","year":2018,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Test (biology); Psychology; Cognition; Cognitive psychology; Clinical psychology; Psychiatry; Biology","score_opus":0.018369040384980436,"score_gpt":0.24778088493005343,"score_spread":0.229411844545073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398488223","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020899315,0.000011791892,0.0079777,0.00003221761,0.001899277,0.00037865705,0.98844075,0.00029143307,0.0009472733],"genre_scores_gemma":[0.000094239665,0.00020524504,0.003330053,0.0010143279,0.0006079119,0.000039862,0.99221784,0.000024592911,0.0024659347],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962269,0.00033957855,0.0006028915,0.0012397583,0.0008664524,0.00072442513],"domain_scores_gemma":[0.994963,0.0016355691,0.0004996652,0.0021180224,0.00045032724,0.0003334537],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011259284,0.00063346414,0.0005591329,0.0004175108,0.0006929261,0.00061746535,0.0025719646,0.00040878518,0.014283302],"category_scores_gemma":[0.0028147667,0.00063817255,0.00014446856,0.0005866992,0.00036848418,0.0012803284,0.0013857445,0.0009264724,0.47126478],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004556446,0.000199335,0.00014471855,0.0002682144,0.000056916484,0.00015032543,0.00012911644,0.00000690931,0.0000021887295,0.00006289981,0.9987771,0.00015673517],"study_design_scores_gemma":[0.00063483353,0.00088616804,0.00009232502,0.0012567089,0.0001255422,0.00004890387,0.0000881608,0.000677664,0.000027151153,0.0002454287,0.99515104,0.0007660937],"about_ca_topic_score_codex":0.0013128106,"about_ca_topic_score_gemma":0.00014733282,"teacher_disagreement_score":0.45698148,"about_ca_system_score_codex":0.00020911197,"about_ca_system_score_gemma":0.00074758776,"threshold_uncertainty_score":0.99960697},"labels":[],"label_agreement":null},{"id":"W4398722366","doi":"10.7910/dvn/bsungb/22lbes","title":"third pilot - cognitive intelligence test - data.tab","year":2018,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Test (biology); Computer science; Cognition; Psychology; Geology; Neuroscience","score_opus":0.05564113560527996,"score_gpt":0.28724651830879877,"score_spread":0.23160538270351883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398722366","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.6322234e-7,0.00000904774,0.08891656,0.000017680615,0.0014722534,0.00032029112,0.9086859,0.0002554599,0.00032192474],"genre_scores_gemma":[0.000028516455,0.0002854885,0.013769715,0.0011213609,0.00088019756,0.000021261752,0.9836184,0.00002745728,0.0002476198],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.995799,0.00021668331,0.0006130405,0.0018488594,0.0007460429,0.00077638094],"domain_scores_gemma":[0.9915202,0.0015763998,0.00049871876,0.005835295,0.00025182997,0.0003175202],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0013243671,0.00063273625,0.0005461488,0.000297223,0.00043725452,0.0008064778,0.008820865,0.00030996246,0.002889083],"category_scores_gemma":[0.002052409,0.00061804545,0.00007305491,0.0005643169,0.00030801326,0.0018802963,0.006017812,0.0010063148,0.15726964],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026585387,0.00016656028,0.000015717997,0.00011339006,0.00006838449,0.0003312963,0.000055634664,0.0000035697067,0.0000025966015,0.000046899007,0.9978985,0.0012708462],"study_design_scores_gemma":[0.00021402653,0.00047249437,0.00001067804,0.00071876857,0.0001211466,0.00008963189,0.000026339134,0.0046802266,0.000034627083,0.0001608616,0.99271584,0.0007553866],"about_ca_topic_score_codex":0.00094299996,"about_ca_topic_score_gemma":0.00020822758,"teacher_disagreement_score":0.15438056,"about_ca_system_score_codex":0.00006783172,"about_ca_system_score_gemma":0.00057020655,"threshold_uncertainty_score":0.9996271},"labels":[],"label_agreement":null},{"id":"W4399049510","doi":"10.1007/978-3-031-60599-4_19","title":"An Improved Neuro-Symbolic Architecture to Fine-Tune Generative AI Systems","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Architecture; Generative grammar; Artificial intelligence; Programming language","score_opus":0.012939693142665845,"score_gpt":0.24888185622129066,"score_spread":0.2359421630786248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399049510","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010326037,0.0011090072,0.9873195,0.004452859,0.004535825,0.0007401226,0.000031441377,0.00053515006,0.0011727868],"genre_scores_gemma":[0.26218328,0.000018897648,0.7117626,0.017761348,0.0042997217,0.0001054319,0.000053368105,0.00024071634,0.0035745916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99459463,0.000088562,0.00065345294,0.0026732956,0.00095964124,0.0010303971],"domain_scores_gemma":[0.9964313,0.0005293716,0.00021177644,0.0020436633,0.00028497772,0.00049894745],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009595929,0.0008741848,0.00075303717,0.0013460721,0.0003979118,0.0022743922,0.0043123406,0.000422265,0.00000960683],"category_scores_gemma":[0.00008348162,0.0007492044,0.00015818053,0.0011331644,0.00029514066,0.0005113708,0.0012259157,0.001879171,0.000113222646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011756524,0.000026004807,0.00001886574,0.00014241469,0.000027017337,0.00033476844,0.0038645105,0.70999056,0.0025953022,0.021718733,0.00028698478,0.26098308],"study_design_scores_gemma":[0.00014297645,0.0005988265,0.000016953269,0.00075914577,0.000014333881,0.0001731061,2.5933346e-7,0.9393709,0.0010044329,0.05023872,0.006707029,0.0009733232],"about_ca_topic_score_codex":0.000104905725,"about_ca_topic_score_gemma":0.00013071585,"teacher_disagreement_score":0.27555692,"about_ca_system_score_codex":0.00024176794,"about_ca_system_score_gemma":0.0007394239,"threshold_uncertainty_score":0.9994959},"labels":[],"label_agreement":null},{"id":"W4399765807","doi":"10.32920/26052505.v1","title":"Action Schema Networks for Numerical Planning","year":2024,"lang":"en","type":"preprint","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Schema (genetic algorithms); Computer science; Action (physics); Computer network; Information retrieval; Physics","score_opus":0.0642682084180113,"score_gpt":0.3307863732966312,"score_spread":0.2665181648786199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399765807","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003194172,0.0014135608,0.98851264,0.0014223894,0.0030993188,0.00027791222,0.0000046440655,0.00102493,0.0039252155],"genre_scores_gemma":[0.4558808,0.000014124785,0.53846145,0.00067797914,0.0013762626,0.00021524963,0.0000987181,0.00005280913,0.0032225954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983632,0.000038639602,0.00027249657,0.0007606782,0.0001859355,0.0003790668],"domain_scores_gemma":[0.9988786,0.0003070714,0.00011318617,0.00053718867,0.000060625967,0.00010332193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004440229,0.0002611629,0.0002668069,0.00012511996,0.00014379085,0.0005882823,0.00074800046,0.0003735559,0.000014298647],"category_scores_gemma":[0.00003534388,0.0002358313,0.00018230657,0.00018116742,0.000012788318,0.00009539137,0.0013162983,0.0010242098,0.000045917142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025456742,0.000033650518,0.00030762362,0.00071130967,0.00016702953,0.000044418266,0.0007577297,0.73306024,0.00003133801,0.04265166,0.13051017,0.091699354],"study_design_scores_gemma":[0.000072044015,0.000041065705,0.00002390442,0.00042339368,0.000020061514,0.000011151714,0.000011305629,0.96710294,0.00014298908,0.019884339,0.011966834,0.00029996966],"about_ca_topic_score_codex":0.000033899945,"about_ca_topic_score_gemma":6.7602747e-7,"teacher_disagreement_score":0.45556137,"about_ca_system_score_codex":0.00006923621,"about_ca_system_score_gemma":0.00016510519,"threshold_uncertainty_score":0.96169215},"labels":[],"label_agreement":null},{"id":"W4399765924","doi":"10.32920/26052505","title":"Action Schema Networks for Numerical Planning","year":2024,"lang":"en","type":"preprint","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Schema (genetic algorithms); Computer science; Action (physics); Information retrieval; Physics","score_opus":0.0642682084180113,"score_gpt":0.3307863732966312,"score_spread":0.2665181648786199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399765924","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003194172,0.0014135608,0.98851264,0.0014223894,0.0030993188,0.00027791222,0.0000046440655,0.00102493,0.0039252155],"genre_scores_gemma":[0.4558808,0.000014124785,0.53846145,0.00067797914,0.0013762626,0.00021524963,0.0000987181,0.00005280913,0.0032225954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983632,0.000038639602,0.00027249657,0.0007606782,0.0001859355,0.0003790668],"domain_scores_gemma":[0.9988786,0.0003070714,0.00011318617,0.00053718867,0.000060625967,0.00010332193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004440229,0.0002611629,0.0002668069,0.00012511996,0.00014379085,0.0005882823,0.00074800046,0.0003735559,0.000014298647],"category_scores_gemma":[0.00003534388,0.0002358313,0.00018230657,0.00018116742,0.000012788318,0.00009539137,0.0013162983,0.0010242098,0.000045917142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025456742,0.000033650518,0.00030762362,0.00071130967,0.00016702953,0.000044418266,0.0007577297,0.73306024,0.00003133801,0.04265166,0.13051017,0.091699354],"study_design_scores_gemma":[0.000072044015,0.000041065705,0.00002390442,0.00042339368,0.000020061514,0.000011151714,0.000011305629,0.96710294,0.00014298908,0.019884339,0.011966834,0.00029996966],"about_ca_topic_score_codex":0.000033899945,"about_ca_topic_score_gemma":6.7602747e-7,"teacher_disagreement_score":0.45556137,"about_ca_system_score_codex":0.00006923621,"about_ca_system_score_gemma":0.00016510519,"threshold_uncertainty_score":0.96169215},"labels":[],"label_agreement":null},{"id":"W4399801064","doi":"10.1109/ichms59971.2024.10555872","title":"Modernization of NORAD Centres: Command and Control Operators Training Issues and Possible Solutions","year":2024,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Training (meteorology); Modernization theory; Command and control; Aerospace; Computer science; Control (management); Selection (genetic algorithm); Engineering management; Process management; Operations research; Engineering; Artificial intelligence; Telecommunications; Political science","score_opus":0.025744604603512074,"score_gpt":0.25343717929891524,"score_spread":0.22769257469540316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399801064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0375313,0.0066674864,0.95241046,0.002141929,0.00009290153,0.00008745771,0.000009798976,0.0001567739,0.00090191845],"genre_scores_gemma":[0.986996,0.000083702434,0.012528785,0.000094804025,0.000019420342,0.0000020285963,0.000003032784,0.000004443602,0.00026776604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994384,0.00003852886,0.00012382331,0.00017924314,0.00008225098,0.00013774884],"domain_scores_gemma":[0.9996666,0.00012916212,0.000018397197,0.00010079132,0.00003274917,0.00005229995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021044345,0.000070570735,0.000105889114,0.00007543106,0.000146066,0.00024020391,0.00009472833,0.000033515684,0.000007649328],"category_scores_gemma":[0.000016681051,0.00005892253,0.000012351162,0.00014505284,0.000039043312,0.00033816166,0.000049190356,0.00006198118,0.0000017217861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026533819,0.00009492547,0.05544659,0.00070483435,0.0002651897,0.000046011475,0.08887978,0.026766557,0.009166538,0.6362322,0.007994166,0.17437671],"study_design_scores_gemma":[0.00022219685,0.000050884046,0.00072125474,0.00012930734,0.000009567132,0.00001072295,0.00019135907,0.99521863,0.00038242264,0.002046598,0.00092516025,0.00009191286],"about_ca_topic_score_codex":0.00013361874,"about_ca_topic_score_gemma":0.000020346633,"teacher_disagreement_score":0.96845204,"about_ca_system_score_codex":0.0000058256805,"about_ca_system_score_gemma":0.000045736913,"threshold_uncertainty_score":0.24027911},"labels":[],"label_agreement":null},{"id":"W4399909891","doi":"10.1109/icnc59896.2024.10556056","title":"Accelerating Autonomous Cyber Operations: A Symbolic Logic Planner Guided Reinforcement Learning Approach","year":2024,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Queen's University","funders":"","keywords":"Planner; Reinforcement learning; Computer science; Logic programming; Artificial intelligence; Human–computer interaction","score_opus":0.05025189694048924,"score_gpt":0.28046854896941575,"score_spread":0.23021665202892652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399909891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024059766,0.00054783846,0.8994119,0.0009381668,0.00026798923,0.00020677812,4.6599857e-7,0.0012258103,0.09499505],"genre_scores_gemma":[0.7843896,0.000009489363,0.19721507,0.0007761969,0.0001583959,0.000075259195,0.000040095536,0.000018424103,0.017317457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983275,0.000092288254,0.00038142304,0.00053843774,0.0002560095,0.00040432168],"domain_scores_gemma":[0.99934536,0.000119453136,0.00003362531,0.00034536576,0.000058029607,0.0000981733],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00065381755,0.00020743343,0.00017347533,0.00017311821,0.00045678392,0.0013732654,0.0005357036,0.000089785484,0.00016155257],"category_scores_gemma":[0.000058705114,0.00016551184,0.00007128821,0.00043790523,0.00001947682,0.00069906766,0.00023521441,0.00039154757,0.00022545188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.289177e-7,0.000012352554,0.000072579736,0.000041999203,0.00002955016,0.000024286712,0.0027693722,0.7975724,0.00026269557,0.18799964,0.004746708,0.006467639],"study_design_scores_gemma":[0.00010660737,0.00006293059,0.000017499002,0.0000775087,0.0000072441517,0.000064177635,0.00008536495,0.9885752,0.00028292256,0.00040744935,0.010062503,0.00025057633],"about_ca_topic_score_codex":0.00019040999,"about_ca_topic_score_gemma":0.0000038253315,"teacher_disagreement_score":0.7819836,"about_ca_system_score_codex":0.000080016456,"about_ca_system_score_gemma":0.0001790762,"threshold_uncertainty_score":0.9996634},"labels":[],"label_agreement":null},{"id":"W4400767383","doi":"10.1016/j.artint.2024.104181","title":"Planning with mental models – Balancing explanations and explicability","year":2024,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Office of Naval Research; Air Force Office of Scientific Research; Defense Advanced Research Projects Agency; National Sleep Foundation; National Aeronautics and Space Administration; Natural Sciences and Engineering Research Council of Canada; International Business Machines Corporation; National Science Foundation","keywords":"Mental model; Computer science; Psychology; Cognitive science; Artificial intelligence","score_opus":0.06438478467350495,"score_gpt":0.29834073968319663,"score_spread":0.23395595500969169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400767383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048960768,0.000690083,0.947384,0.0011229845,0.00020846327,0.00011270167,0.0000050267427,0.0003254347,0.0011905117],"genre_scores_gemma":[0.97412384,0.000009457092,0.025649099,0.000101258964,0.000048238628,0.000018643883,0.0000045224583,0.000008207552,0.000036755573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988871,0.000037006437,0.00020481805,0.00044365553,0.00018870564,0.00023869703],"domain_scores_gemma":[0.99933755,0.00026691344,0.00002728427,0.0002458366,0.000034865545,0.000087575354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003652059,0.00012378072,0.00010129512,0.00009440503,0.00024368898,0.00041801232,0.00026392512,0.000039539533,0.000011386297],"category_scores_gemma":[0.000019362786,0.00010429471,0.00002302257,0.00034550112,0.000061688064,0.00075068313,0.000093166505,0.00017166747,0.000030266192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020733272,0.000045916444,0.0010395827,0.00007209628,0.00003672951,0.00010199731,0.024391333,0.049073294,0.0014490815,0.7039213,0.0004275615,0.21942036],"study_design_scores_gemma":[0.000007781899,0.00006690688,0.000046119138,0.00015679967,0.0000046881196,0.000034948804,0.00045627993,0.91575587,0.0054599657,0.077473015,0.00037730095,0.00016032807],"about_ca_topic_score_codex":0.00007339355,"about_ca_topic_score_gemma":0.000018820932,"teacher_disagreement_score":0.92516303,"about_ca_system_score_codex":0.00003311976,"about_ca_system_score_gemma":0.00006286878,"threshold_uncertainty_score":0.4253015},"labels":[],"label_agreement":null},{"id":"W4401285343","doi":"10.58940/2329-258x.2026","title":"Computational Cognitive Modeling of Pilot Performance in Pre-flight and Take-off Procedures","year":2024,"lang":"en","type":"article","venue":"The Journal of Aviation/Aerospace Education and Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Workload; Flight simulator; Aviation; Flight training; Computer science; Cognitive architecture; Computational model; Cognition; Simulation; Work (physics); Cognitive model; General aviation; Cockpit; Aeronautics; Engineering; Aerospace engineering; Psychology","score_opus":0.044725928397642604,"score_gpt":0.35918501348359044,"score_spread":0.31445908508594783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401285343","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94220555,0.0081942985,0.04302016,0.0060198377,0.00016584281,0.00015995282,0.0000013165392,0.000008884341,0.00022417812],"genre_scores_gemma":[0.9958439,0.00092785695,0.002842768,0.000038841292,0.000079007026,0.0000042281804,0.0000016739466,0.0000048851107,0.00025686005],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884063,0.0002086554,0.0002620302,0.00011101773,0.000441318,0.00013634922],"domain_scores_gemma":[0.9984504,0.0007367302,0.00009639841,0.000068631096,0.0005884323,0.00005938196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026458718,0.000064258,0.000097914846,0.00033891737,0.00018477124,0.00015362316,0.0001929405,0.000029122786,0.000004061021],"category_scores_gemma":[0.0002115115,0.000043767952,0.000013717574,0.00051907625,0.00007980816,0.00046125066,0.00005686238,0.0003887896,0.0000017186884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087506016,0.001312417,0.10150319,0.0027445897,0.00024861575,0.0000107986625,0.35610688,0.3402633,0.0025549561,0.051513895,0.007014222,0.13585207],"study_design_scores_gemma":[0.00035652108,0.00052557985,0.05322679,0.0017522101,0.000012474592,0.00012963127,0.0021160187,0.93473357,0.00035417345,0.0065755975,0.00011429288,0.000103115],"about_ca_topic_score_codex":0.000041177493,"about_ca_topic_score_gemma":0.000010299779,"teacher_disagreement_score":0.59447026,"about_ca_system_score_codex":0.000037730468,"about_ca_system_score_gemma":0.0011664692,"threshold_uncertainty_score":0.20692661},"labels":[],"label_agreement":null},{"id":"W4401417184","doi":"10.1109/icra57147.2024.10610267","title":"Closing the Perception-Action Loop for Semantically Safe Navigation in Semi-Static Environments","year":2024,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Closing (real estate); Perception; Computer science; Action (physics); Loop (graph theory); Human–computer interaction; Psychology; Physics; Mathematics","score_opus":0.03026703717666563,"score_gpt":0.2974863082786628,"score_spread":0.26721927110199717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401417184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07379437,0.00006270275,0.9218659,0.0033064312,0.00026236768,0.0001947047,0.0000014913638,0.000084877094,0.00042716673],"genre_scores_gemma":[0.96509534,0.000011567567,0.033300873,0.0002912136,0.00005694156,0.000028487526,0.000017904365,0.000008010182,0.0011896581],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922913,0.000054442833,0.0001691442,0.00023743148,0.00014243693,0.00016742796],"domain_scores_gemma":[0.999462,0.000316306,0.00002296357,0.00016477486,0.000008037984,0.000025938058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047251713,0.000078958336,0.000062274434,0.00005237991,0.00013269423,0.00022822496,0.0001803393,0.00004118974,0.000023512011],"category_scores_gemma":[0.00001893441,0.00005686654,0.00003532117,0.00017036265,0.000019645848,0.00036389884,0.00003529452,0.00012792816,0.00008736852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049073657,0.00019497606,0.008422381,0.00090433436,0.000099476776,0.000059785303,0.02248272,0.056624822,0.08076239,0.07624766,0.013099421,0.741053],"study_design_scores_gemma":[0.00009418524,0.000043225482,0.002128857,0.00018409452,0.00000678569,0.000010154304,0.00014802082,0.9881828,0.0004721816,0.0052515143,0.003379431,0.00009878694],"about_ca_topic_score_codex":0.000035787267,"about_ca_topic_score_gemma":0.0000050654617,"teacher_disagreement_score":0.93155795,"about_ca_system_score_codex":0.000074217554,"about_ca_system_score_gemma":0.000035507896,"threshold_uncertainty_score":0.23189501},"labels":[],"label_agreement":null},{"id":"W4401895333","doi":"10.1145/3680246","title":"DELETE THIS: Improving Performance with Rust, Stemming a Flood of AI Papers","year":2024,"lang":"en","type":"article","venue":"Communications of the ACM","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Rust (programming language); Flood myth; Programming language; History; Archaeology","score_opus":0.01993808675817178,"score_gpt":0.24510432209143518,"score_spread":0.2251662353332634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401895333","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65358204,0.04458305,0.07426339,0.1796571,0.0010564886,0.0015836953,0.000054947748,0.0013083203,0.043911],"genre_scores_gemma":[0.78930545,0.000051705207,0.21037756,0.00008807516,0.0000062926606,0.00001040287,0.0000013065115,0.000006442831,0.0001527961],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999306,0.00008576769,0.00020047161,0.00013205678,0.00014914433,0.00012655323],"domain_scores_gemma":[0.9873474,0.00035618895,0.00010552839,0.012093932,0.00007549416,0.000021444353],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00044123802,0.00007810077,0.00010567451,0.00006587618,0.00026153214,0.000058850837,0.01504068,0.000030725198,0.0000028679258],"category_scores_gemma":[0.0003435404,0.00005241053,0.000051247986,0.00044925025,0.00011646791,0.00026774794,0.00611987,0.00028133695,0.000004834883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006288182,0.0003723431,0.046311703,0.0032787335,0.00077523413,0.0000052616438,0.04740026,0.015608754,0.06330795,0.13226436,0.013931238,0.6766813],"study_design_scores_gemma":[0.0006324411,0.00047252962,0.0056874976,0.006141046,0.00020995509,0.000076524644,0.00061028573,0.9025996,0.03581136,0.0068042814,0.040274136,0.00068039127],"about_ca_topic_score_codex":0.00007107515,"about_ca_topic_score_gemma":0.0000116256,"teacher_disagreement_score":0.8869908,"about_ca_system_score_codex":0.000020149731,"about_ca_system_score_gemma":0.00016548696,"threshold_uncertainty_score":0.99028844},"labels":[],"label_agreement":null},{"id":"W4403359648","doi":"10.1007/978-3-031-73180-8_6","title":"Planning with Non-deterministic Actions in Jason","year":2024,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science","score_opus":0.0483776318052908,"score_gpt":0.3072988658458596,"score_spread":0.25892123404056877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403359648","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021078247,0.0005864562,0.46777412,0.0012642021,0.00038070223,0.00038331974,0.000012153216,0.0001816823,0.5292066],"genre_scores_gemma":[0.68040186,0.00094721204,0.31075844,0.0013489159,0.00008700201,0.00008829567,0.00012379329,0.00003764665,0.0062068473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861896,0.000014964345,0.00049909885,0.00030040936,0.00032215175,0.0002444033],"domain_scores_gemma":[0.99796516,0.00025656197,0.00019230903,0.0013771523,0.0001252292,0.00008358615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075234304,0.00021114784,0.00021521593,0.0013706639,0.00038489042,0.00089631,0.0021618202,0.00010923425,0.0000033448086],"category_scores_gemma":[0.000015361078,0.00019493744,0.00002574582,0.0006138191,0.00042115472,0.00416964,0.00122629,0.0007019399,0.000067269015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006525677,0.000021697366,0.00039331158,0.00014742423,0.000011546338,0.000014897635,0.012213129,0.010397986,0.0000028388802,0.8146449,0.00038069295,0.16176508],"study_design_scores_gemma":[0.00021593989,0.000096784104,0.0011782395,0.0017206758,0.000006482255,0.00008292077,0.00004117998,0.91578454,0.0000028609566,0.008346972,0.07216209,0.00036133308],"about_ca_topic_score_codex":0.000019280149,"about_ca_topic_score_gemma":0.000013271864,"teacher_disagreement_score":0.90538657,"about_ca_system_score_codex":0.00014625699,"about_ca_system_score_gemma":0.000328897,"threshold_uncertainty_score":0.8643138},"labels":[],"label_agreement":null},{"id":"W4403411684","doi":"10.1016/j.orl.2024.107194","title":"Structured pruning of neural networks for constraints learning","year":2024,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pruning; Artificial neural network; Computer science; Artificial intelligence; Machine learning; Biology; Botany","score_opus":0.04766301081933947,"score_gpt":0.3484694934558907,"score_spread":0.3008064826365512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403411684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051780503,0.00034573762,0.9406917,0.006391283,0.00024484374,0.00027898647,0.000005598934,0.00011271652,0.00014863242],"genre_scores_gemma":[0.9610503,0.00000532019,0.038421545,0.00016780508,0.000114021896,0.00004279389,0.000024676201,0.000010859529,0.00016269268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986346,0.00024019035,0.00018330326,0.00028844803,0.000285307,0.0003681939],"domain_scores_gemma":[0.9989382,0.000623468,0.000011181088,0.00021089545,0.0001498773,0.00006637195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012121996,0.000081293,0.000098642144,0.00024601555,0.0004908443,0.0005942407,0.00041850744,0.000045499604,0.000023761833],"category_scores_gemma":[0.00018262076,0.00007403911,0.000050445316,0.00055954146,0.00015462976,0.00037653378,0.00009953258,0.0005338255,0.000004269478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035560793,0.0000042061747,0.00015666938,0.0000413771,0.000022585557,0.000013501513,0.0011128829,0.9292481,0.014773823,0.015780002,0.003107511,0.035735805],"study_design_scores_gemma":[0.000095352945,0.000066631954,0.00006130319,0.000096678355,0.0000022372276,0.000009077974,0.000057229765,0.9974975,0.0007084408,0.00008257693,0.0012452552,0.000077744706],"about_ca_topic_score_codex":0.000036681464,"about_ca_topic_score_gemma":0.000010573537,"teacher_disagreement_score":0.9092698,"about_ca_system_score_codex":0.000036273486,"about_ca_system_score_gemma":0.00011729087,"threshold_uncertainty_score":0.5730277},"labels":[],"label_agreement":null},{"id":"W4403674689","doi":"10.1109/tnnls.2024.3477968","title":"M<sup>2</sup>D-VAE: Self-Supervised Probabilistic Temporal–Spatial Latent Representation Learning for Unsupervised Industrial Operational Applications Under Missing Value Interference","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks and Learning Systems","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Probabilistic logic; Interference (communication); Unsupervised learning; Computer science; Representation (politics); Artificial intelligence; Value (mathematics); Missing data; Feature learning; Machine learning; Pattern recognition (psychology)","score_opus":0.03751993977024259,"score_gpt":0.26248503591493233,"score_spread":0.22496509614468974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403674689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010790848,0.00052840204,0.9851234,0.0007934188,0.0008541288,0.0011279109,0.0000068596883,0.0007447702,0.0000302437],"genre_scores_gemma":[0.9956634,0.000026529418,0.0027033642,0.000072414725,0.0005198715,0.00047548357,0.00006119852,0.00004258063,0.0004351628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972173,0.0006648931,0.0005690266,0.0008364772,0.00030253734,0.00040978988],"domain_scores_gemma":[0.99807817,0.001238688,0.00011438942,0.00026483854,0.00013472198,0.00016917243],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000748124,0.00031520092,0.00031434104,0.00021038721,0.0012942486,0.0013480964,0.0002946503,0.00023607067,0.000010281284],"category_scores_gemma":[0.00002478,0.00029359944,0.00013563599,0.0005477707,0.00004955597,0.00051893963,0.0000088463485,0.0012340699,0.0000064345113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039293805,0.000043769327,0.0002592236,0.00012172902,0.000071699105,0.000004145347,0.0009970387,0.9538012,0.000056603287,0.0006610957,0.000075192824,0.043868966],"study_design_scores_gemma":[0.0005712571,0.0003484049,0.000026238038,0.00041062816,0.00006451939,0.000047511054,0.00019271935,0.9968268,0.000019921017,0.00006684856,0.0011039271,0.0003211788],"about_ca_topic_score_codex":0.00034140318,"about_ca_topic_score_gemma":0.0000058018377,"teacher_disagreement_score":0.9848725,"about_ca_system_score_codex":0.00010066167,"about_ca_system_score_gemma":0.00013340713,"threshold_uncertainty_score":0.9999516},"labels":[],"label_agreement":null},{"id":"W4404735027","doi":"10.2139/ssrn.5035177","title":"Continuous Learning of Event-Based Systems by Using Pre-Conceptual Schemas","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Event (particle physics); Computer science; Conceptual model; Physics; Database","score_opus":0.011797456018823432,"score_gpt":0.25487213840547546,"score_spread":0.24307468238665203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404735027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12861821,0.04777746,0.8216024,0.00017490481,0.0012669787,0.00024047018,0.000011410912,0.00018205584,0.00012610678],"genre_scores_gemma":[0.99455297,0.00027060177,0.0033404136,0.000023903132,0.00034297974,0.0000107526685,0.000021913695,0.000058064747,0.0013784061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99496055,0.0005082723,0.0008830175,0.00067844626,0.0007056894,0.0022640105],"domain_scores_gemma":[0.99789435,0.00020355979,0.0010227518,0.0004931335,0.00023899657,0.00014723564],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0038656476,0.0004540544,0.0006857304,0.00030612055,0.00026935927,0.0004264831,0.0013048933,0.00040814336,0.000006302821],"category_scores_gemma":[0.00010939498,0.0004354851,0.00034231975,0.0003079437,0.00009428107,0.00015524503,0.00064339954,0.009147663,0.00001265188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006825372,0.00013912933,0.0021351858,0.0008170848,0.0011792171,0.00005059926,0.0024708782,0.8570244,0.010248351,0.113778554,0.0008913671,0.011197018],"study_design_scores_gemma":[0.0007242672,0.00068632426,0.000007178869,0.003229009,0.00020048066,0.0005665009,0.0010063417,0.96952397,0.001470512,0.019854639,0.0018685777,0.0008622063],"about_ca_topic_score_codex":0.00047090097,"about_ca_topic_score_gemma":0.000011207357,"teacher_disagreement_score":0.8659347,"about_ca_system_score_codex":0.0010940612,"about_ca_system_score_gemma":0.008868711,"threshold_uncertainty_score":0.9998097},"labels":[],"label_agreement":null},{"id":"W4405888468","doi":"10.1007/978-3-031-77138-5_7","title":"Exploring and Learning Structure: Active Inference Approach in Navigational Agents","year":2024,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Douglas College","funders":"","keywords":"Inference; Computer science; Artificial intelligence; Thesaurus; Information retrieval; Machine learning","score_opus":0.11845452231403128,"score_gpt":0.30698584432763737,"score_spread":0.1885313220136061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405888468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010033533,0.0020360246,0.66815144,0.0017346558,0.0009516314,0.0011236238,0.000058658035,0.00043358354,0.31547686],"genre_scores_gemma":[0.8218529,0.0017880952,0.1752391,0.00031577976,0.000036659374,0.000045437802,0.00014111762,0.000012267945,0.0005686237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859685,0.000041101575,0.0004646152,0.00032912943,0.00036117874,0.00020711872],"domain_scores_gemma":[0.99855953,0.000337609,0.00018481653,0.0006978813,0.00014189274,0.00007825816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083309785,0.0001988729,0.00019277807,0.00095957075,0.0004250968,0.00075566146,0.0014581151,0.00009226898,0.0000028181282],"category_scores_gemma":[0.000046023164,0.00020212996,0.000020375099,0.0005114042,0.0003940724,0.0074054785,0.001955308,0.00088720024,0.000011314047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020539642,0.0000069252887,0.00038347073,0.000083459,0.0000063411053,9.551798e-7,0.015140235,0.008300818,0.0000024580893,0.69816977,0.00001557553,0.27788794],"study_design_scores_gemma":[0.00015686017,0.000030342413,0.0045555807,0.0005717247,0.0000032901007,0.000021788675,0.00008130445,0.96504796,0.0000047788794,0.016924057,0.012313673,0.00028865325],"about_ca_topic_score_codex":0.000023653509,"about_ca_topic_score_gemma":0.000004956708,"teacher_disagreement_score":0.9567471,"about_ca_system_score_codex":0.00012749895,"about_ca_system_score_gemma":0.00020300054,"threshold_uncertainty_score":0.824262},"labels":[],"label_agreement":null},{"id":"W4406441851","doi":"10.1016/s0029-7437(05)71328-8","title":"10.1016/s0029-7437(05)71328-8","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.007972595572692845,"score_gpt":0.18003560682775802,"score_spread":0.17206301125506518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406441851","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008308823,0.00010648504,0.0013151037,0.0008558376,0.0000010288412,0.000110955814,0.000005466533,0.00049701263,0.997025],"genre_scores_gemma":[0.00015548075,1.4835287e-7,0.008668403,0.00017408725,0.000105022256,0.000010941229,0.0000069796774,0.000014254946,0.9908647],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987636,0.00006211823,0.00018417095,0.00036976355,0.00022819624,0.00039210834],"domain_scores_gemma":[0.99906015,0.000110106455,0.000035449397,0.00056146167,0.000039486426,0.00019331266],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00029422028,0.00015802789,0.00015765807,0.00008663414,0.00016403073,0.00016414317,0.00082592986,0.00006684687,0.972438],"category_scores_gemma":[0.000025646317,0.00015409218,0.000057481084,0.00036916806,0.000019207284,0.00025065016,0.00010549136,0.00015508226,0.9909092],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008366473,0.000016026024,2.2744157e-7,0.000003262002,0.0000058218334,0.000010036444,0.000058419806,0.0007007742,0.000011879172,0.000010061808,0.64425755,0.3549176],"study_design_scores_gemma":[0.00013587523,0.00014268461,0.000015150424,0.00003959607,0.0000043753894,0.000018621298,3.097326e-7,0.015704125,0.00008850378,0.000060913168,0.9835737,0.00021615702],"about_ca_topic_score_codex":0.00003265306,"about_ca_topic_score_gemma":1.06406965e-7,"teacher_disagreement_score":0.35470143,"about_ca_system_score_codex":0.000028585486,"about_ca_system_score_gemma":0.000052387968,"threshold_uncertainty_score":0.6283697},"labels":[],"label_agreement":null},{"id":"W4408861207","doi":"10.1109/aiim64537.2024.10934367","title":"Advancing Abstract Reasoning in Artificial General Intelligence with a Hybrid Multi-Component Architecture","year":2024,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Component (thermodynamics); Computer science; Architecture; Artificial intelligence; Cognitive science; Psychology","score_opus":0.01509954723632113,"score_gpt":0.26037268081303677,"score_spread":0.24527313357671565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408861207","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14069253,0.00038605442,0.8569638,0.0005832785,0.00023011054,0.000113686314,0.0000018250508,0.0003720663,0.000656653],"genre_scores_gemma":[0.7003917,0.0000037906834,0.2992675,0.00011675264,0.00006988886,0.000009331961,0.0000038302055,0.00001184127,0.00012535349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984566,0.000040913674,0.00027417566,0.0005462589,0.00023154599,0.00045050384],"domain_scores_gemma":[0.9993604,0.00018154782,0.000039467977,0.00029487064,0.000021049325,0.00010268753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048379833,0.00019111887,0.00015948241,0.00022871676,0.000097599936,0.00034583375,0.00043015138,0.00003784702,0.000026372578],"category_scores_gemma":[0.000026988067,0.00014614097,0.00004643789,0.00041293466,0.000028430995,0.00031446433,0.00009994627,0.00047041572,0.00004536496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039789604,0.000106551524,0.0016402914,0.0001306947,0.000032799668,0.0018271133,0.0038875663,0.49870962,0.007187079,0.023297923,0.000260834,0.46287972],"study_design_scores_gemma":[0.00006647351,0.000074896976,0.0008514872,0.00060113746,0.0000034998766,0.00016263103,0.000050526007,0.98257786,0.012728458,0.001607384,0.00097561127,0.00030005668],"about_ca_topic_score_codex":0.00039921896,"about_ca_topic_score_gemma":0.00025809612,"teacher_disagreement_score":0.5596992,"about_ca_system_score_codex":0.00006832126,"about_ca_system_score_gemma":0.00013693636,"threshold_uncertainty_score":0.5959456},"labels":[],"label_agreement":null},{"id":"W4409365358","doi":"10.1609/aaai.v39i14.33628","title":"Situation Calculus Temporally Lifted Abstractions for Generalized Planning","year":2025,"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":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Calculus (dental); Computer science","score_opus":0.08656763443536475,"score_gpt":0.3345368105981227,"score_spread":0.24796917616275793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409365358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09034839,0.00007146493,0.88399696,0.011018337,0.000983776,0.00085845595,0.000012635584,0.00025667172,0.012453326],"genre_scores_gemma":[0.98007154,0.0000058850137,0.018627472,0.00036509146,0.00005298116,0.00006707121,0.0000028170566,0.000008081104,0.0007990742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984707,0.000016000751,0.00052450766,0.00042068856,0.0002690239,0.0002990643],"domain_scores_gemma":[0.9984451,0.00022405777,0.00035776972,0.00023797492,0.000677879,0.000057204506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005986776,0.00018714968,0.00022092128,0.0001915963,0.0004283081,0.0002949189,0.0012011403,0.00010979609,0.000015988924],"category_scores_gemma":[0.00044904626,0.0001520377,0.00012367961,0.0005769013,0.00009509574,0.00035391384,0.00015376389,0.00024455466,0.000018879411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008878165,0.00008148269,0.00042825314,0.00007742316,0.00002934389,3.0294078e-7,0.0011666421,0.0021153914,0.033639673,0.9329414,0.0015888355,0.027842466],"study_design_scores_gemma":[0.00008300801,0.00015172668,0.00045623502,0.00054950075,0.000034427634,0.0000020633026,0.00035183894,0.43393856,0.33711872,0.22630507,0.0007443224,0.0002645402],"about_ca_topic_score_codex":0.000064140266,"about_ca_topic_score_gemma":0.000007029066,"teacher_disagreement_score":0.8897231,"about_ca_system_score_codex":0.000049553288,"about_ca_system_score_gemma":0.0002107961,"threshold_uncertainty_score":0.6199918},"labels":[],"label_agreement":null},{"id":"W4409589849","doi":"10.1007/978-3-031-85870-3_7","title":"Towards Topologically Diverse Probabilistic Planning Benchmarks: Synthetic Domain Generation for Markov Decision Processes","year":2025,"lang":"en","type":"book-chapter","venue":"Studies in classification, data analysis, and knowledge organization","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Probabilistic logic; Markov chain; Computer science; Domain (mathematical analysis); Markov decision process; Artificial intelligence; Markov model; Markov process; Machine learning; Mathematics; Statistics","score_opus":0.11060220816994146,"score_gpt":0.35399534880204786,"score_spread":0.2433931406321064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409589849","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000098490025,0.010170141,0.9794088,0.0004410132,0.00045053405,0.0006767258,0.00030379355,0.000110614536,0.008339868],"genre_scores_gemma":[0.24024011,0.042176906,0.59388036,0.00043437714,0.001974361,0.00045064732,0.068740144,0.00020479763,0.051898316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972109,0.00009896674,0.00078463915,0.0014053478,0.0002581533,0.00024195183],"domain_scores_gemma":[0.99579024,0.0009783756,0.00046028013,0.0011972768,0.0015110133,0.000062823725],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012164547,0.00038833704,0.0006629812,0.0007479044,0.00066508655,0.00024209537,0.0010064372,0.00030471283,0.000029289919],"category_scores_gemma":[0.003524355,0.00034971215,0.000052791955,0.0014325167,0.00020289469,0.0004121254,0.0008540456,0.00019817571,0.0000040457453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000807936,0.00035991851,0.018231498,0.0044167675,0.003990427,0.000018687999,0.012738406,0.0011290851,0.00007273601,0.7323567,0.0848663,0.14173867],"study_design_scores_gemma":[0.0024831758,0.00049552263,0.009719544,0.0065203784,0.009417342,0.000021565238,0.0024001936,0.5272398,0.000089984096,0.2825201,0.15470457,0.0043878523],"about_ca_topic_score_codex":0.000011353106,"about_ca_topic_score_gemma":0.00059206213,"teacher_disagreement_score":0.5261107,"about_ca_system_score_codex":0.00021450831,"about_ca_system_score_gemma":0.00056690664,"threshold_uncertainty_score":0.9998955},"labels":[],"label_agreement":null},{"id":"W4411341739","doi":"10.33423/jabe.v27i3.7691","title":"Towards an Effective Prompting With AI Systems: The Jujitsu Framework","year":2025,"lang":"en","type":"article","venue":"Journal of Applied Business and Economics","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Psychology; Computer science; Cognitive science","score_opus":0.006170089169321137,"score_gpt":0.2156687057469833,"score_spread":0.20949861657766217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411341739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3629052,0.00039583343,0.63186115,0.0018584718,0.00045507078,0.00021764952,0.0000011351749,0.00002289176,0.0022825869],"genre_scores_gemma":[0.9810816,0.00004372828,0.017928157,0.0007384609,0.00018160505,0.000009738955,4.1986573e-7,0.0000068288755,0.000009433861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993461,0.000022194045,0.0002676575,0.00015709824,0.00005667885,0.00015026593],"domain_scores_gemma":[0.9991443,0.00016681726,0.0003033719,0.0001992797,0.00013835933,0.00004782719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006867963,0.00011554283,0.00024285985,0.00008958101,0.00022045094,0.0005076631,0.00038918227,0.00006657082,5.321821e-7],"category_scores_gemma":[0.000014613575,0.00007046715,0.000021606058,0.0002112383,0.00003922647,0.00035669634,0.00007736838,0.00028538745,7.679392e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003612636,0.00008746611,0.0029319932,0.00034306897,0.00028578783,0.000019350886,0.003068229,0.2753948,0.00005823143,0.49578923,0.00040604174,0.22125454],"study_design_scores_gemma":[0.0045904336,0.0010636932,0.094690666,0.00431934,0.00037330488,0.0006949767,0.0034251055,0.6787481,0.0010719057,0.1744546,0.034931064,0.0016368426],"about_ca_topic_score_codex":0.000017711984,"about_ca_topic_score_gemma":0.0000022702352,"teacher_disagreement_score":0.6181764,"about_ca_system_score_codex":0.000039589264,"about_ca_system_score_gemma":0.00016366302,"threshold_uncertainty_score":0.48954076},"labels":[],"label_agreement":null},{"id":"W4411991134","doi":"10.18280/isi.300519","title":"Optimizing NLP Processes with Human Insight and Machine Intelligence","year":2025,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Artificial intelligence; Computer science; Natural language processing; Machine learning","score_opus":0.014651844228472665,"score_gpt":0.234321387773095,"score_spread":0.21966954354462234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411991134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00975883,0.00072020927,0.9735678,0.000120203506,0.00006915723,0.00015732816,0.0000023917444,0.00024454342,0.015359533],"genre_scores_gemma":[0.94297713,0.00003478263,0.056562576,0.00028611918,0.000009739396,0.000024294963,0.000020101588,0.000003857573,0.00008141387],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916357,0.000028814475,0.00031510828,0.00014649126,0.00014529636,0.00020073024],"domain_scores_gemma":[0.9992629,0.00011574744,0.0001562398,0.00021742754,0.0001998532,0.000047783036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025862743,0.00014372577,0.0001392935,0.00026083886,0.00046796957,0.0005865069,0.00032412802,0.00005681756,0.0000035113494],"category_scores_gemma":[0.00011688713,0.000118630975,0.000013465626,0.0006901576,0.00008360907,0.003134484,0.00012810642,0.00012887309,0.000007513107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083557636,0.000067206456,0.021255845,0.00611489,0.00014940606,0.000019646037,0.099891834,0.025742931,0.0002557463,0.20641713,0.00054024614,0.6394616],"study_design_scores_gemma":[0.0028325487,0.0019017478,0.017752873,0.01592461,0.00016255719,0.00047880327,0.0056631602,0.73457533,0.07922957,0.09742276,0.04040586,0.003650158],"about_ca_topic_score_codex":0.000075540374,"about_ca_topic_score_gemma":0.000024493382,"teacher_disagreement_score":0.9332183,"about_ca_system_score_codex":0.00006040604,"about_ca_system_score_gemma":0.00016279684,"threshold_uncertainty_score":0.56556994},"labels":[],"label_agreement":null},{"id":"W4412819571","doi":"10.1007/978-3-031-89033-8_12","title":"Introduction to MPI","year":2025,"lang":"en","type":"book-chapter","venue":"CMS/CAIMS books in mathematics","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science","score_opus":0.01795384980449603,"score_gpt":0.2405035847163053,"score_spread":0.2225497349118093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412819571","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000824546,0.00031242945,0.33627477,0.0024522531,0.0010774131,0.0004703531,0.000010754446,0.00030490523,0.6590889],"genre_scores_gemma":[0.00006310194,0.000024973382,0.21122976,0.00047984355,0.00057606807,0.000027591632,0.00001551522,0.00004313603,0.78754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978025,0.000024206234,0.0006770314,0.00071282097,0.00040671352,0.0003767525],"domain_scores_gemma":[0.99783474,0.00028860857,0.00025752588,0.0013872695,0.00011555443,0.00011629202],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007158378,0.00042958793,0.0005677673,0.00055151473,0.00011626542,0.00021038714,0.001177031,0.0003558908,0.00009869714],"category_scores_gemma":[0.00015414038,0.00043995446,0.00012727964,0.0001229428,0.000044848613,0.00014302021,0.00047576462,0.0006752558,0.0005085898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031448817,0.000022953553,0.0000032182222,0.00037010774,0.000030302486,0.000033383836,0.0015104455,0.00032347074,0.000019067853,0.84315294,0.14236757,0.012163406],"study_design_scores_gemma":[0.00015710891,0.0000801557,0.0000019294537,0.0016859928,0.000030164349,0.00002445696,0.000017382945,0.010283103,0.00014647603,0.4542315,0.53273803,0.0006036856],"about_ca_topic_score_codex":0.000005945529,"about_ca_topic_score_gemma":0.000010204885,"teacher_disagreement_score":0.39037046,"about_ca_system_score_codex":0.00018981921,"about_ca_system_score_gemma":0.00020036366,"threshold_uncertainty_score":0.9998052},"labels":[],"label_agreement":null},{"id":"W4413883207","doi":"10.1016/j.artint.2025.104407","title":"Abstracting situation calculus action theories","year":2025,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; York University; UK Research and Innovation","keywords":"Situation calculus; Action (physics); Calculus (dental); Computer science; Cognitive science; Mathematics; Artificial intelligence; Psychology; Medicine","score_opus":0.05888960173923377,"score_gpt":0.3409720854442167,"score_spread":0.2820824837049829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413883207","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01759631,0.000082415805,0.9732741,0.0016672721,0.00089683186,0.00008241987,6.172414e-7,0.00022752336,0.0061724843],"genre_scores_gemma":[0.9898904,0.000007025509,0.009435349,0.00025721904,0.00007103924,0.000008463342,0.0000026048867,0.0000034668096,0.00032445203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990287,0.000060579627,0.00026856764,0.0002813602,0.00014629329,0.0002145134],"domain_scores_gemma":[0.99912536,0.0003720405,0.00008630777,0.00028384026,0.00009706816,0.00003537942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052212935,0.000098519755,0.000089232235,0.00011133357,0.00034189882,0.00024885288,0.00037889846,0.00006430368,0.0000238032],"category_scores_gemma":[0.00025385237,0.00009753888,0.000041085823,0.00049618457,0.00004120176,0.00046972974,0.000078865305,0.00017736181,0.00017300683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006516392,0.000017682241,0.00012483909,0.00000852182,0.000006166903,0.0000030017782,0.0008188078,0.003859821,0.0024748184,0.5718586,0.0000935323,0.42072773],"study_design_scores_gemma":[0.000012503045,0.00003659232,0.00036507877,0.00007831251,0.000007998549,0.0000035469923,0.000627225,0.29282477,0.2756923,0.42895952,0.0012097622,0.00018235158],"about_ca_topic_score_codex":0.00018245218,"about_ca_topic_score_gemma":0.00007349178,"teacher_disagreement_score":0.9722941,"about_ca_system_score_codex":0.00004337826,"about_ca_system_score_gemma":0.00008506732,"threshold_uncertainty_score":0.39775202},"labels":[],"label_agreement":null},{"id":"W4414603437","doi":"10.1109/lra.2025.3615522","title":"AORRTC: Almost-Surely Asymptotically Optimal Planning With RRT-Connect","year":2025,"lang":"en","type":"article","venue":"IEEE Robotics and Automation Letters","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Satisficing; Asymptotically optimal algorithm; Convergence (economics); Probabilistic logic; Motion planning; Selection (genetic algorithm); Stability theory","score_opus":0.008647812944369643,"score_gpt":0.23274600963690012,"score_spread":0.22409819669253048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414603437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07995319,0.000082852996,0.90508527,0.013693104,0.00030568644,0.000114560855,0.0000014485104,0.0002957754,0.0004681245],"genre_scores_gemma":[0.7673452,0.000002604291,0.22774611,0.0047256383,0.000048904585,0.000007443377,0.0000066006446,0.000010810231,0.000106702784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882716,0.00006287296,0.00023750105,0.00035691744,0.00021431698,0.00030123978],"domain_scores_gemma":[0.9992287,0.00026970237,0.00009879372,0.00026790856,0.00005550731,0.00007936287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002924677,0.0001804516,0.00018514902,0.00016104497,0.00027321393,0.00037229728,0.0003020578,0.00007185078,0.0000023062573],"category_scores_gemma":[0.00002774397,0.00015760034,0.000033745782,0.00028373883,0.000053858384,0.00033753723,0.000053946205,0.00020023939,0.000009424702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012413465,0.000022120978,0.0039039808,0.00006297796,0.00006351382,0.00005135585,0.0007024407,0.9678552,0.0018351701,0.016683266,0.004235899,0.0045716283],"study_design_scores_gemma":[0.00051080517,0.0001002895,0.006716248,0.0003618499,0.00002870155,0.000031524985,0.000020351765,0.9902535,0.00077280094,0.00028723184,0.00061308726,0.0003035818],"about_ca_topic_score_codex":0.000009884928,"about_ca_topic_score_gemma":6.9595876e-7,"teacher_disagreement_score":0.687392,"about_ca_system_score_codex":0.000028763878,"about_ca_system_score_gemma":0.000076625314,"threshold_uncertainty_score":0.6426756},"labels":[],"label_agreement":null},{"id":"W4414625998","doi":"10.1038/s41467-025-63804-5","title":"A brain-inspired agentic architecture to improve planning with LLMs","year":2025,"lang":"en","type":"article","venue":"Nature Communications","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Planner; Cognitive architecture; Modular design; Task (project management); Component (thermodynamics); Benchmark (surveying); Architecture; Variety (cybernetics)","score_opus":0.013410993769578381,"score_gpt":0.2915572217764578,"score_spread":0.27814622800687944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414625998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006195772,0.0054395106,0.8462835,0.120483175,0.00038419355,0.0006185254,0.000016367056,0.00070742896,0.019871514],"genre_scores_gemma":[0.7740108,0.000004391051,0.21732806,0.007669335,0.000019417435,0.00006065514,0.000022583437,0.000009204951,0.0008756103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989147,0.00013176004,0.00017933956,0.0003314491,0.0001707828,0.00027194453],"domain_scores_gemma":[0.9963459,0.00066648674,0.00007368177,0.0026983372,0.00011965965,0.00009597074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028987523,0.00015858146,0.00015391194,0.00025709267,0.00056117115,0.00020374605,0.0030194272,0.00017154928,0.00000214272],"category_scores_gemma":[0.0002064588,0.00013490547,0.000048006805,0.0011345322,0.00005386096,0.0001307506,0.00078074296,0.0011323158,0.0000159432],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001433727,0.000519006,0.019999383,0.00021895107,0.00056846236,0.00008305937,0.023202116,0.02171682,0.012363654,0.53403795,0.19595625,0.19119099],"study_design_scores_gemma":[0.0014583475,0.00040502104,0.01871806,0.00142879,0.000082939514,0.0000530048,0.00024149392,0.057185702,0.0023327242,0.008945904,0.9080725,0.0010755359],"about_ca_topic_score_codex":0.000025076388,"about_ca_topic_score_gemma":0.00009734719,"teacher_disagreement_score":0.767815,"about_ca_system_score_codex":0.000048869522,"about_ca_system_score_gemma":0.00018590043,"threshold_uncertainty_score":0.5610897},"labels":[],"label_agreement":null},{"id":"W4415452645","doi":"10.32370/ia_2025_03_3","title":"Extending the Entropic Potential of Events for Uncertainty Quantification and Decision-Making in Artificial Intelligence","year":2025,"lang":"","type":"article","venue":"Intellectual Archive","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Interpretability; Counterfactual thinking; Uncertainty quantification; Entropy (arrow of time); Bayesian probability; Uncertainty analysis; Bridging (networking); Anomaly detection","score_opus":0.02773244162948347,"score_gpt":0.312364683516739,"score_spread":0.28463224188725555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415452645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10954508,0.0011055393,0.8869286,0.00060772843,0.0009736557,0.00070996076,0.000032800384,0.000019054098,0.00007757979],"genre_scores_gemma":[0.9723609,0.00019997389,0.02719281,0.000094739335,0.00007069463,0.000040058472,0.000007476402,0.000010676953,0.000022684191],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708545,0.0003370167,0.0010361216,0.0007370578,0.00029940953,0.0005049635],"domain_scores_gemma":[0.98679775,0.012196299,0.00031637622,0.00048214194,0.0001526744,0.000054787735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012878518,0.0002763424,0.0003740303,0.0005628688,0.000527768,0.00018384214,0.0010165494,0.00010364776,0.000031354124],"category_scores_gemma":[0.003205681,0.00022940148,0.00015327575,0.00089165533,0.00031920403,0.00016592254,0.00049484416,0.00045416752,0.000008602609],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066098204,0.00011330945,0.00028095124,0.000112016336,0.000057392015,0.000003757813,0.014833634,0.05117154,0.0010380468,0.07918134,0.0001418181,0.8524052],"study_design_scores_gemma":[0.000093905204,0.0001777498,0.0007768975,0.0013945792,0.000028280709,0.0000052896635,0.0007520471,0.66415006,0.0009770093,0.33138546,0.00011386101,0.00014482444],"about_ca_topic_score_codex":0.00012221708,"about_ca_topic_score_gemma":0.00014475027,"teacher_disagreement_score":0.8628158,"about_ca_system_score_codex":0.000077218945,"about_ca_system_score_gemma":0.00033934537,"threshold_uncertainty_score":0.93547213},"labels":[],"label_agreement":null},{"id":"W4415819765","doi":"10.3390/computers14110478","title":"Constrained Object Hierarchies as a Unified Theoretical Model for Intelligence and Intelligent Systems","year":2025,"lang":"en","type":"article","venue":"Computers","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University","funders":"Athabasca University","keywords":"Connectionism; Intelligent decision support system; Artificial general intelligence; Modular design; Object (grammar); Constraint (computer-aided design); Intelligent agent; Scalability; Operationalization","score_opus":0.023385328070156985,"score_gpt":0.27209430058061784,"score_spread":0.24870897251046087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415819765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015471219,0.0005107447,0.99385595,0.0011560748,0.000613532,0.00037054112,0.0000047759054,0.00020922079,0.0017320112],"genre_scores_gemma":[0.8927898,0.000022629214,0.10634754,0.0004631971,0.000026309739,0.00003108011,0.000004277545,0.0000066799153,0.00030850325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877,0.00008177855,0.00028039856,0.0004361998,0.00012283548,0.00030879374],"domain_scores_gemma":[0.99838704,0.0010246721,0.000056534536,0.00034539172,0.000081414815,0.00010492432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045499983,0.00017716944,0.00022975751,0.00018503188,0.00020251918,0.0003293785,0.000633753,0.00007366012,0.0000011353633],"category_scores_gemma":[0.00008740454,0.00016032785,0.00006166175,0.00024818847,0.00027895885,0.000116446136,0.0002618805,0.00015248546,0.000004294221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019897385,0.000015335656,0.000031681036,0.00008989494,0.000030888932,0.0000047571016,0.0012870374,0.07129432,0.000018488743,0.89713705,0.00070089905,0.02936973],"study_design_scores_gemma":[0.00012107787,0.00009343811,0.0000055628593,0.00019075359,0.0000088130555,0.000014655712,0.0000817739,0.8713694,0.00028417632,0.12723565,0.0004468087,0.00014785548],"about_ca_topic_score_codex":0.000013839163,"about_ca_topic_score_gemma":7.371626e-7,"teacher_disagreement_score":0.8912427,"about_ca_system_score_codex":0.000031584997,"about_ca_system_score_gemma":0.0001918033,"threshold_uncertainty_score":0.653798},"labels":[],"label_agreement":null},{"id":"W4416184268","doi":"10.1109/acsos-c66519.2025.00038","title":"Think Before You Act: Popperian Expectations for Adaptive Agents","year":2025,"lang":"","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Meaning (existential); Reinforcement learning; Internal model; Mechanism (biology); Event (particle physics); Autonomous agent; Causal model; Value (mathematics)","score_opus":0.029685259666826815,"score_gpt":0.29218086026098117,"score_spread":0.26249560059415433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416184268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032329874,0.00068039086,0.9383105,0.009689416,0.0024229416,0.0009961135,0.0000734059,0.0002895624,0.044304654],"genre_scores_gemma":[0.81513405,0.000007194165,0.13800935,0.0016665026,0.00015817473,0.00007530498,0.000034954417,0.000019468598,0.044894967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974405,0.00011233119,0.00054530037,0.0008793231,0.00028551326,0.00073700695],"domain_scores_gemma":[0.9982035,0.00035423544,0.0001863967,0.0007652409,0.00029661963,0.00019400778],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040142614,0.0003716114,0.00034855603,0.00029808452,0.0012650936,0.0005685982,0.0011658738,0.00022825993,0.00019823041],"category_scores_gemma":[0.0001594239,0.0003581475,0.0002537004,0.0008443907,0.00008979073,0.00061476976,0.00032815707,0.0002931586,0.000107118576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001516769,0.00035520847,0.002421804,0.00021473053,0.000514785,0.000024306708,0.11620863,0.0019494052,0.00006486753,0.6060842,0.07616481,0.19584553],"study_design_scores_gemma":[0.0013505134,0.0007958559,0.0021076996,0.0005861877,0.00011988036,0.0000050740473,0.006925433,0.9357403,0.00060423394,0.040552747,0.010592941,0.0006191275],"about_ca_topic_score_codex":0.00013342153,"about_ca_topic_score_gemma":0.00009911685,"teacher_disagreement_score":0.9337909,"about_ca_system_score_codex":0.00013348332,"about_ca_system_score_gemma":0.00069756724,"threshold_uncertainty_score":0.99988705},"labels":[],"label_agreement":null},{"id":"W4417138045","doi":"10.1055/a-2668-0824","title":"Core GRADE for evidence syntheses","year":2025,"lang":"de","type":"article","venue":"physioscience","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Certainty; Context (archaeology); Strengths and weaknesses; Core (optical fiber); Quality (philosophy); Clinical Practice; Systematic error","score_opus":0.16211547396387285,"score_gpt":0.35627460223388113,"score_spread":0.19415912827000828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417138045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005931613,0.020777892,0.9536935,0.009505124,0.0075185206,0.0010214138,0.000057645706,0.00036241914,0.0011318704],"genre_scores_gemma":[0.96696824,0.00032034927,0.02775114,0.0019720686,0.0002949234,0.000090227666,0.0000021225496,0.0000136183235,0.0025872975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968047,0.000107176296,0.0004108115,0.0012303293,0.0005455649,0.0009014035],"domain_scores_gemma":[0.9932974,0.0049840244,0.00022526004,0.0010746204,0.00024062798,0.00017806083],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011210659,0.00034289685,0.00036933908,0.0002215507,0.0011144371,0.00067353074,0.0028842732,0.000107850865,0.000014646998],"category_scores_gemma":[0.0032494564,0.000323022,0.00019196405,0.0018275416,0.00042797567,0.0010458442,0.0005833653,0.00027592792,0.00014957813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022766729,0.0009956176,0.0073234816,0.0038702495,0.00021462596,0.000057835772,0.008666324,0.01294493,0.14401136,0.41729674,0.16003847,0.24435268],"study_design_scores_gemma":[0.00026105478,0.00045434825,0.0029440792,0.0128953615,0.00013517162,0.00000367914,0.00012158534,0.8838258,0.018548422,0.033908978,0.04591086,0.0009906851],"about_ca_topic_score_codex":0.00011998479,"about_ca_topic_score_gemma":0.000004472329,"teacher_disagreement_score":0.9610366,"about_ca_system_score_codex":0.00010033728,"about_ca_system_score_gemma":0.0008240287,"threshold_uncertainty_score":0.99992216},"labels":[],"label_agreement":null},{"id":"W4417322882","doi":"10.48550/arxiv.2510.21074","title":"Revisiting Replanning from Scratch: Real-Time Incremental Planning with Fast Almost-Surely Asymptotically Optimal Planners","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Oxford","keywords":"Motion planning; Plan (archaeology); Position (finance); Asymptotically optimal algorithm; Reuse; Robot; Obstacle","score_opus":0.030989999562899634,"score_gpt":0.26838089773271334,"score_spread":0.2373908981698137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417322882","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.867385,0.0013775212,0.10763986,0.0021216844,0.0015052356,0.0013113782,0.00056452677,0.0012888485,0.01680592],"genre_scores_gemma":[0.8194761,0.00016944943,0.17090112,0.0020973189,0.0019680127,0.00013400664,0.0017792877,0.00023567496,0.0032389816],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98558867,0.0012971956,0.0029107316,0.005277655,0.0020427047,0.0028830194],"domain_scores_gemma":[0.98960406,0.002887962,0.0023466123,0.0034205639,0.00070045097,0.0010403771],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0036341506,0.0024554855,0.002615118,0.00075449445,0.002261996,0.0018617115,0.0045562526,0.0014668377,0.00033212398],"category_scores_gemma":[0.00058872026,0.002515078,0.00059202506,0.001468045,0.0005112074,0.0013190551,0.0048664724,0.005005416,0.0004766468],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011795638,0.0001782977,0.82590276,0.0006383631,0.0016288137,0.0025288227,0.013430325,0.14369495,0.003643296,0.00016025268,0.003077043,0.0039375033],"study_design_scores_gemma":[0.0061738035,0.0023103124,0.21691526,0.08000342,0.001983154,0.0002627046,0.0040706396,0.6707514,0.0046154447,0.00049035775,0.0026396008,0.009783924],"about_ca_topic_score_codex":0.0025388391,"about_ca_topic_score_gemma":0.000008860373,"teacher_disagreement_score":0.6089875,"about_ca_system_score_codex":0.0006573952,"about_ca_system_score_gemma":0.0023096495,"threshold_uncertainty_score":0.9998295},"labels":[],"label_agreement":null},{"id":"W4500300","doi":"10.1007/978-3-540-45224-9_18","title":"Two Expert Diagnosis Systems for SMEs: From Database-Only Technologies to the Unavoidable Addition of AI Techniques","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science; Expert system; Data science; Knowledge management; Software engineering; Artificial intelligence","score_opus":0.0232848189160649,"score_gpt":0.2703984939580699,"score_spread":0.24711367504200502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4500300","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018035802,0.0035629077,0.9888946,0.0042395475,0.0011473193,0.0011960776,0.00025728598,0.00043247573,0.00025177884],"genre_scores_gemma":[0.0252579,0.0002417738,0.9698522,0.0035983382,0.0003647359,0.00046186429,0.00007489609,0.000046098416,0.00010218424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683297,0.000060477974,0.00056494365,0.0012894858,0.00069243263,0.00055969425],"domain_scores_gemma":[0.99552,0.0018922241,0.00035482156,0.0018188466,0.0003366253,0.00007749045],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011769045,0.00046442897,0.0005496215,0.00062082073,0.00037893525,0.00049912283,0.0037878468,0.00029866231,0.000006663504],"category_scores_gemma":[0.00030683354,0.00034552815,0.00011550362,0.000665476,0.00037371012,0.00051449717,0.0008833089,0.00063982216,0.0000072613434],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023399916,0.000078105964,0.0002687589,0.00019489451,0.000056826004,0.000035592537,0.0019262107,0.039869502,0.0006921597,0.047038615,0.015343511,0.8944724],"study_design_scores_gemma":[0.00062795734,0.0012470548,0.0000143942925,0.009359255,0.00004862698,0.00008539628,0.00001214106,0.43742716,0.106275894,0.22644857,0.21611483,0.0023387265],"about_ca_topic_score_codex":0.00040857866,"about_ca_topic_score_gemma":0.00011606123,"teacher_disagreement_score":0.8921337,"about_ca_system_score_codex":0.00019713108,"about_ca_system_score_gemma":0.00043084455,"threshold_uncertainty_score":0.9998997},"labels":[],"label_agreement":null},{"id":"W47652742","doi":"10.1007/978-1-4471-0269-4_6","title":"Learning with C4.5 in a Situation Calculus Domain","year":2001,"lang":"en","type":"book-chapter","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Calculus (dental); Domain (mathematical analysis); Computer science; Mathematics; Mathematical analysis; Medicine","score_opus":0.012201545273983053,"score_gpt":0.20782548048926597,"score_spread":0.19562393521528293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W47652742","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006358435,0.00009265458,0.44542006,0.00030208737,0.000041292446,0.00009742454,3.8087214e-7,0.00015449646,0.553828],"genre_scores_gemma":[0.02722483,0.000043386364,0.062542565,0.00039812748,0.00013050153,0.000013164622,0.00004711765,0.000052761217,0.90954757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99869,0.00003432896,0.0002320865,0.00046399562,0.00031239187,0.00026720043],"domain_scores_gemma":[0.99930614,0.0001052036,0.00014935157,0.00031897763,0.00004977505,0.0000705556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037049147,0.00024538633,0.00024310242,0.00024365322,0.00010267282,0.00012322012,0.0003769084,0.00021056799,0.00014508344],"category_scores_gemma":[0.000009540701,0.00020563026,0.00004523276,0.00009657428,0.000033816526,0.00019098965,0.00009734798,0.0006014745,0.00016070982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002451754,0.000016077995,0.00050844665,0.000041082225,0.00003663918,0.0006255404,0.0027393992,0.010730982,0.00001463336,0.92079383,0.0011170452,0.06335177],"study_design_scores_gemma":[0.002261127,0.0014446151,0.00029456348,0.0028735392,0.000043501856,0.00038570823,0.00014342461,0.21331184,0.000056669007,0.10769191,0.6687096,0.0027835567],"about_ca_topic_score_codex":0.00014739111,"about_ca_topic_score_gemma":0.00019385508,"teacher_disagreement_score":0.81310195,"about_ca_system_score_codex":0.00009028513,"about_ca_system_score_gemma":0.00012756036,"threshold_uncertainty_score":0.83853585},"labels":[],"label_agreement":null},{"id":"W49698117","doi":"10.1609/icaps.v24i1.13680","title":"Improved Features for Runtime Prediction of Domain-Independent Planners","year":2014,"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":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Benchmark (surveying); Planner; Computer science; Set (abstract data type); Domain (mathematical analysis); Variation (astronomy); Range (aeronautics); Machine learning; Artificial intelligence; Point (geometry); Mathematics; Engineering; Programming language","score_opus":0.0215283963574559,"score_gpt":0.25794355658467766,"score_spread":0.23641516022722175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W49698117","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95030034,0.000068772875,0.040397737,0.0020851712,0.000745869,0.00031295998,0.00004838685,0.00042541363,0.005615376],"genre_scores_gemma":[0.9640785,0.0000026635146,0.035659447,0.00008716229,0.00005344693,0.000013525164,0.000008163969,0.0000082155075,0.000088906556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988884,0.000010815155,0.00030810147,0.00029049814,0.0003257472,0.00017648534],"domain_scores_gemma":[0.9989239,0.0001590983,0.00040515556,0.000093971445,0.00036888904,0.0000490062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069893803,0.00014654784,0.00018964068,0.0001457052,0.00015442554,0.00015599592,0.00077048526,0.00009935224,0.000002072061],"category_scores_gemma":[0.00023197896,0.00011209001,0.0000648552,0.00011020472,0.00004905281,0.00021648458,0.00013428633,0.00019392972,3.9957754e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004699982,0.00013321934,0.027455809,0.00044009968,0.00035339562,8.0157827e-7,0.006360917,0.0103855245,0.4669665,0.48111004,0.002049211,0.004274461],"study_design_scores_gemma":[0.00056661014,0.00020034498,0.004041516,0.00076942315,0.000013369788,0.000014131443,0.00029417258,0.9533028,0.035105858,0.005472682,0.00009680945,0.00012229325],"about_ca_topic_score_codex":0.000015364385,"about_ca_topic_score_gemma":2.9729964e-7,"teacher_disagreement_score":0.9429173,"about_ca_system_score_codex":0.000022039749,"about_ca_system_score_gemma":0.00004597827,"threshold_uncertainty_score":0.4570898},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Plan (archaeology); Computer science; Imperfect; Look-ahead; Face (sociological concept); Mathematical optimization; Algorithm; Mathematics","score_opus":0.022556337760980778,"score_gpt":0.2568103548043802,"score_spread":0.2342540170433994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W52011011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40911514,0.0000588418,0.58094233,0.00009175217,0.0002786946,0.00003311283,2.0936139e-7,0.00031740582,0.009162526],"genre_scores_gemma":[0.8909743,0.000002282797,0.1084649,0.000024925368,0.00012370001,0.0000011164927,6.133841e-7,0.0000035126125,0.00040464374],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991438,0.000018090168,0.00015283731,0.00022201799,0.00016829341,0.00029497454],"domain_scores_gemma":[0.9995066,0.00007501983,0.00004094172,0.00026261905,0.00002752798,0.00008732294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006212752,0.000080757,0.000068883324,0.000066540844,0.00019204443,0.000092973874,0.00032272114,0.000047091275,0.000008998694],"category_scores_gemma":[0.000016179705,0.000076015975,0.000028153803,0.0001779794,0.000009967003,0.00033105293,0.00009820864,0.00011935842,0.00004007692],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008198391,0.00014684713,0.7957825,0.00014208157,0.00005822943,0.00041577395,0.005514931,0.007371777,0.04597368,0.044619985,0.00078059494,0.099111624],"study_design_scores_gemma":[0.0006559837,0.00009741691,0.5867454,0.00018968852,0.000006585553,0.00008856676,0.00022739793,0.021856237,0.38674474,0.0014530775,0.0012757431,0.00065918965],"about_ca_topic_score_codex":0.00007419972,"about_ca_topic_score_gemma":0.0000020809052,"teacher_disagreement_score":0.48185918,"about_ca_system_score_codex":0.00004296086,"about_ca_system_score_gemma":0.000016363576,"threshold_uncertainty_score":0.30998415},"labels":[],"label_agreement":null},{"id":"W562895362","doi":"","title":"Uncertainty in artificial intelligence : proceedings of the Twentieth Conference (2004) : July 7-11, 2004, Banff, Canada","year":2004,"lang":"en","type":"book","venue":"AUAI Press eBooks","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Library science; History; Environmental ethics; Computer science; Philosophy","score_opus":0.034070085266701314,"score_gpt":0.22845788052135144,"score_spread":0.1943877952546501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W562895362","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046207078,0.0016549241,0.028539082,0.0008030447,0.003253676,0.0021511037,0.00021072726,0.00028860202,0.96263677],"genre_scores_gemma":[0.13557465,0.000016748856,0.0023282508,0.0005840967,0.00028027754,0.00011378828,0.000024440622,0.000083726474,0.86099404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967952,0.000051615087,0.00083490595,0.00081017474,0.0008509459,0.0006571662],"domain_scores_gemma":[0.9979129,0.00019076359,0.0006828911,0.00067360344,0.00039514524,0.00014469669],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000531392,0.000489895,0.0005612033,0.00013053206,0.000182213,0.00021966099,0.0028177327,0.0003550919,0.000011775721],"category_scores_gemma":[0.00008295186,0.00040975283,0.00013269421,0.00010430487,0.00024315811,0.00014853365,0.00056046224,0.0009758581,0.0000026715045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008356961,0.00010201452,0.00013766438,0.0014676837,0.00015924756,0.00011452097,0.010977593,0.03376777,0.000119768,0.77012616,0.13543251,0.047511484],"study_design_scores_gemma":[0.0004026843,0.00017541622,0.00006674323,0.0069276504,0.00010961623,0.00004184518,0.00007982192,0.020469252,0.00909425,0.173328,0.7873579,0.00194678],"about_ca_topic_score_codex":0.16661243,"about_ca_topic_score_gemma":0.17335872,"teacher_disagreement_score":0.65192544,"about_ca_system_score_codex":0.00078796246,"about_ca_system_score_gemma":0.009969973,"threshold_uncertainty_score":0.99983543},"labels":[],"label_agreement":null},{"id":"W568611532","doi":"","title":"Proceedings of the IASTED International Conference on Computational Intelligence, July 4-6, 2005, Calgary, AB, Canada","year":2005,"lang":"en","type":"book","venue":"ACTA Press eBooks","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Regional science; Political science; Library science; Operations research; Geography; Computer science; Engineering","score_opus":0.03218132765628658,"score_gpt":0.23530699146076897,"score_spread":0.20312566380448238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W568611532","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032448046,0.000057256264,0.004637512,0.0006234448,0.0008818982,0.00037903906,0.0001157359,0.00008039949,0.99319226],"genre_scores_gemma":[0.053484444,0.000017612992,0.0064017093,0.0010869796,0.00036896844,0.000038957893,0.00006591203,0.000046184832,0.93848926],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976467,0.000026076408,0.00050462945,0.0005128737,0.0009850101,0.00032472005],"domain_scores_gemma":[0.99826825,0.0002598637,0.0005866949,0.00033174144,0.00044175048,0.0001116735],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021108524,0.0003375209,0.00030571187,0.000104801285,0.0001440133,0.00017758292,0.0025955942,0.00020306352,0.00003373334],"category_scores_gemma":[0.00004079017,0.00027401955,0.000096836186,0.000027649747,0.00011786478,0.00012289523,0.00046785292,0.0007117343,0.0000048073016],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032250446,0.0000356959,0.000013562583,0.00011931391,0.00018915204,0.00001106615,0.0010102954,0.0026967486,0.000030613424,0.40358284,0.576264,0.016014436],"study_design_scores_gemma":[0.00021171117,0.000069623,0.00008271724,0.0016097872,0.00003691385,0.000036887985,0.000011650708,0.11733454,0.00097224326,0.0069257794,0.87208474,0.0006234081],"about_ca_topic_score_codex":0.010445673,"about_ca_topic_score_gemma":0.005999412,"teacher_disagreement_score":0.39665705,"about_ca_system_score_codex":0.00027214453,"about_ca_system_score_gemma":0.0023416346,"threshold_uncertainty_score":0.9999712},"labels":[],"label_agreement":null},{"id":"W579342806","doi":"","title":"Uncertainty in artificial intelligence : proceedings of the Twenty-fifth Conference (2009) : June 18-21, 2009, Montreal, Quebec","year":2009,"lang":"en","type":"book","venue":"AUAI Press eBooks","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Library science; History; Operations research; Computer science; Engineering","score_opus":0.040575819578517566,"score_gpt":0.251231851612682,"score_spread":0.21065603203416444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W579342806","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078164623,0.001615822,0.013371375,0.00059271615,0.0011480455,0.0020361764,0.00011039891,0.00042865184,0.97991514],"genre_scores_gemma":[0.03590555,0.00007094316,0.0022088694,0.0004497917,0.0003063668,0.00009113742,0.000024871832,0.000064180014,0.9608783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99635726,0.00008912686,0.0010387396,0.0010000485,0.0007696584,0.0007451378],"domain_scores_gemma":[0.99740666,0.0002614596,0.00089466834,0.0008586611,0.00041928593,0.00015924757],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007417794,0.0006121783,0.0007524105,0.00024305546,0.00019603029,0.00036553855,0.003092327,0.0005236247,0.000020946867],"category_scores_gemma":[0.00009628975,0.000497771,0.00021757766,0.00013028472,0.00029451674,0.0002429692,0.00059172325,0.0012047226,0.000012300476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001567408,0.00021212467,0.000060816867,0.0005957319,0.00012809175,0.00006991463,0.015573888,0.0047896635,0.00023218335,0.43607554,0.15947434,0.38263094],"study_design_scores_gemma":[0.0006835921,0.0005913298,0.00056382455,0.009423705,0.00023093648,0.0000572818,0.00017423826,0.0866356,0.0070521417,0.39020792,0.50117165,0.003207752],"about_ca_topic_score_codex":0.009955993,"about_ca_topic_score_gemma":0.0061867624,"teacher_disagreement_score":0.3794232,"about_ca_system_score_codex":0.00020236317,"about_ca_system_score_gemma":0.0011221307,"threshold_uncertainty_score":0.9997474},"labels":[],"label_agreement":null},{"id":"W585078164","doi":"","title":"Uncertainty in artificial intelligence : proceedings of the Twenty-third Conference (2007) : July 19-22, 2007, Vancouver, British Columbia","year":2007,"lang":"en","type":"book","venue":"AUAI Press eBooks","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Library science; History; Geography; Operations research; Computer science; Engineering","score_opus":0.030888333744369657,"score_gpt":0.24107054182972182,"score_spread":0.21018220808535215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W585078164","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003752137,0.0006806961,0.015887592,0.000024265531,0.0033277813,0.0014042511,0.0001191637,0.00028244764,0.9778986],"genre_scores_gemma":[0.010210532,0.000057814203,0.003719407,0.00055046164,0.00043227436,0.00009137491,0.000014988122,0.00007100357,0.98485214],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9958139,0.00007452657,0.0011804282,0.0010862823,0.00096892426,0.00087592815],"domain_scores_gemma":[0.99713665,0.00038289747,0.00093608303,0.00072538026,0.0005994529,0.00021951104],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00137732,0.0004410454,0.00072310667,0.00013680004,0.00029683203,0.00087719876,0.0030948834,0.00065402716,0.00007227625],"category_scores_gemma":[0.00018033908,0.0005448057,0.00022341893,0.00013163625,0.0004769176,0.00023995186,0.00087959,0.0015327154,0.000013775817],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004256477,0.00009778682,0.00025337248,0.0005885473,0.000071919094,0.000096812,0.0019593874,0.0005518831,0.000022296734,0.021922491,0.8876552,0.08673774],"study_design_scores_gemma":[0.00037105108,0.0002558269,0.00016354563,0.0055868533,0.0000868384,0.00006565492,0.000078388504,0.010182568,0.0005402155,0.12082885,0.86031264,0.001527587],"about_ca_topic_score_codex":0.017815921,"about_ca_topic_score_gemma":0.023600824,"teacher_disagreement_score":0.09890636,"about_ca_system_score_codex":0.00026351033,"about_ca_system_score_gemma":0.0012397446,"threshold_uncertainty_score":0.99970037},"labels":[],"label_agreement":null},{"id":"W609074870","doi":"","title":"Generating Fast Domain-Specific Planners by Automatically Configuring a Generic Parameterised Planner","year":2011,"lang":"en","type":"article","venue":"University of Huddersfield Repository (University of Huddersfield)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Planner; Benchmark (surveying); Computer science; Domain (mathematical analysis); Set (abstract data type); Preprocessor; Heuristic; Range (aeronautics); Heuristics; Work (physics); State (computer science); Mathematical optimization; Artificial intelligence; Algorithm; Engineering; Mathematics; Programming language","score_opus":0.016003373164810857,"score_gpt":0.15692575242027923,"score_spread":0.14092237925546838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W609074870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07360324,0.0005640645,0.7026516,0.00034060018,0.00047619367,0.00029053842,0.000018706574,0.00031953084,0.22173552],"genre_scores_gemma":[0.8498656,0.00005948468,0.14877093,0.00007108031,0.000030142503,1.0392511e-7,0.00001111884,0.000013875435,0.0011776269],"study_design_codex":"not_applicable","study_design_gemma":"qualitative","domain_scores_codex":[0.99797386,0.00021070537,0.00030271735,0.00063452875,0.0004076529,0.00047051854],"domain_scores_gemma":[0.99818486,0.00021487994,0.00047662802,0.00072350714,0.0001634372,0.00023667782],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002517337,0.0002966617,0.00049485744,0.00023810164,0.0007111396,0.000043577635,0.0014895119,0.00034232548,0.0033216886],"category_scores_gemma":[0.000008681587,0.0003860574,0.0002714101,0.00031803257,0.00035325656,0.0005980479,0.0003182711,0.00039479605,0.000014238436],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040860404,0.0004046796,0.001994597,0.00025069556,0.000559396,0.0013224822,0.062683836,0.0012364762,0.03876736,0.004636176,0.8823325,0.0054032155],"study_design_scores_gemma":[0.003890399,0.0012595577,0.00022281417,0.00047467515,0.00020787667,0.00017989724,0.94107324,0.030982876,0.015825836,0.0005374677,0.0036961564,0.0016491963],"about_ca_topic_score_codex":0.0008274642,"about_ca_topic_score_gemma":0.000024677287,"teacher_disagreement_score":0.8786363,"about_ca_system_score_codex":0.0000031509078,"about_ca_system_score_gemma":0.00012567519,"threshold_uncertainty_score":0.99985915},"labels":[],"label_agreement":null},{"id":"W611929297","doi":"","title":"Uncertainty in artificial intelligence : proceedings of the Eighteenth Conference (2002) : August 1-4, 2002, University of Alberta, Edmonton","year":2002,"lang":"en","type":"book","venue":"Morgan Kaufmann Pub. eBooks","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Operations research; Field (mathematics); Artificial intelligence; Computer science; Engineering ethics; Management science; Engineering; Library science; Mathematics","score_opus":0.022142778018479685,"score_gpt":0.1926465542474874,"score_spread":0.1705037762290077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W611929297","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030612214,0.0003454181,0.006413636,0.00044302116,0.00047363742,0.0009953944,0.000062195155,0.00011796082,0.98808753],"genre_scores_gemma":[0.16601448,0.000037321588,0.0013776782,0.000081706494,0.000107476444,0.000004508648,0.000009548985,0.000045897796,0.8323214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970987,0.000069926034,0.0007383091,0.00083914655,0.00066434493,0.00058960565],"domain_scores_gemma":[0.99748534,0.00023406597,0.000930272,0.00074032793,0.00046064734,0.0001493655],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005099655,0.0004949393,0.0007185097,0.00032781123,0.0002095476,0.00010417053,0.0029606624,0.00050044304,0.0005018364],"category_scores_gemma":[0.00007044892,0.00045611776,0.00022052051,0.00030456347,0.000463453,0.0002228691,0.0006957476,0.0009558993,0.00006839791],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002512443,0.000571171,0.001530458,0.0021724314,0.00039396316,0.00013133396,0.03967299,0.0019307671,0.0012992405,0.5727974,0.27396718,0.105281785],"study_design_scores_gemma":[0.0019662487,0.001838513,0.0026931716,0.014915276,0.00067180226,0.00013434725,0.0025919417,0.15672047,0.027150512,0.12335449,0.66094685,0.0070163496],"about_ca_topic_score_codex":0.0017657841,"about_ca_topic_score_gemma":0.0013674591,"teacher_disagreement_score":0.44944295,"about_ca_system_score_codex":0.0002729276,"about_ca_system_score_gemma":0.00080184784,"threshold_uncertainty_score":0.99978906},"labels":[],"label_agreement":null},{"id":"W63576855","doi":"","title":"Improving pain & symptom management for advanced cancer patients with a clinical decision support system.","year":2008,"lang":"en","type":"article","venue":"PubMed","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Psychosocial; Decision support system; Clinical decision support system; Palliative care; Health care; Informatics; Health informatics; Medicine; MEDLINE; Cancer pain; Nursing; Cancer; Computer science; Psychiatry; Artificial intelligence; Public health","score_opus":0.017912227192600477,"score_gpt":0.245060544378599,"score_spread":0.22714831718599854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W63576855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10826822,0.00008330542,0.8885452,0.000097534095,0.00067703845,0.0016299121,0.000011861696,0.00026766042,0.00041922345],"genre_scores_gemma":[0.90112823,0.000010295444,0.095500894,0.00034830763,0.00007288157,0.0025671853,0.000012378514,0.00001820731,0.0003416258],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9981648,0.000087267224,0.00039302927,0.00051529845,0.00033544042,0.0005041685],"domain_scores_gemma":[0.99866194,0.00044245014,0.00020634806,0.0004013002,0.00011697593,0.00017096345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014814193,0.00015253079,0.00022107142,0.00008188741,0.0002406992,0.000061685314,0.0005035774,0.000058291083,0.0000013994307],"category_scores_gemma":[0.00009193133,0.00012019638,0.00007287152,0.00020574816,0.00002750421,0.00028645602,0.00012817341,0.00010071132,0.0000042496044],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106548156,0.00006357086,0.11146395,0.0001010437,0.000035680052,0.000019059375,0.00008638254,0.00033653126,1.5791959e-7,0.00027834458,0.0018853092,0.8856234],"study_design_scores_gemma":[0.007799027,0.0006757593,0.90384156,0.00039321277,0.00007286136,0.000011440204,0.000055314842,0.06751731,0.000048225393,0.0001192079,0.018599313,0.00086680293],"about_ca_topic_score_codex":0.000019636385,"about_ca_topic_score_gemma":0.0000055567407,"teacher_disagreement_score":0.8847566,"about_ca_system_score_codex":0.00010737545,"about_ca_system_score_gemma":0.000055500233,"threshold_uncertainty_score":0.4901466},"labels":[],"label_agreement":null},{"id":"W653675975","doi":"","title":"Proceedings of the third IASTED International Conference on Computational Intelligence, July 2-4, 2007, Banff, Alberta, Canada","year":2007,"lang":"en","type":"book","venue":"ACTA Press eBooks","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Geography; Political science; Library science; Regional science; Computer science","score_opus":0.031201489987923964,"score_gpt":0.24220335449660987,"score_spread":0.2110018645086859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W653675975","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047410977,0.000030217843,0.004818759,0.0002952097,0.0013219159,0.0003464359,0.000062342224,0.000052943706,0.99302477],"genre_scores_gemma":[0.06487516,0.0000069181096,0.0034421335,0.0012312349,0.00028158262,0.000022526128,0.0000628999,0.000039714425,0.93003786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973935,0.000025203979,0.0005729217,0.00055502047,0.0011068649,0.00034647784],"domain_scores_gemma":[0.9976834,0.0005403475,0.0006759831,0.00036418714,0.0006205397,0.000115509625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002971756,0.00036955817,0.0003328267,0.00013260104,0.0001550998,0.00018265122,0.0027198202,0.00025504292,0.000030431647],"category_scores_gemma":[0.000063661726,0.00029937935,0.00010968462,0.000042054584,0.00014315237,0.00012631055,0.00046974176,0.00080292,0.0000072318867],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047564088,0.000030741165,0.000032793218,0.00013811195,0.00020199134,0.000012418102,0.0015932455,0.0014923759,0.000018103461,0.49775413,0.49332565,0.0053529004],"study_design_scores_gemma":[0.00036077382,0.00014655548,0.00015363225,0.002251735,0.00005870268,0.000054019467,0.000032653927,0.060047325,0.002095588,0.02223679,0.91160005,0.0009621682],"about_ca_topic_score_codex":0.046114914,"about_ca_topic_score_gemma":0.012420843,"teacher_disagreement_score":0.47551733,"about_ca_system_score_codex":0.00022251655,"about_ca_system_score_gemma":0.0019313269,"threshold_uncertainty_score":0.9999458},"labels":[],"label_agreement":null},{"id":"W6889940330","doi":"10.3389/fmed.2023.1200592.s002","title":"Table_2_Relationship between 25-hydroxy vitamin D and knee osteoarthritis: a systematic review and meta-analysis of randomized controlled trials.DOC","year":2023,"lang":"en","type":"dataset","venue":"Figshare","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"WOMAC; Vitamin D and neurology; Osteoarthritis; Placebo; Visual analogue scale; Randomized controlled trial; Knee Joint; Vitamin","score_opus":0.09697341831074219,"score_gpt":0.3160580851966516,"score_spread":0.21908466688590938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6889940330","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.6887284e-8,0.22288786,0.00009050347,0.00013281788,0.000020253186,0.0045337253,0.7722551,0.00006650577,0.000013113359],"genre_scores_gemma":[0.000027935712,0.0008347125,0.00024043271,0.00017597112,0.000031495223,0.004713982,0.9935953,0.000018692499,0.00036147187],"study_design_codex":"not_applicable","study_design_gemma":"meta_analysis","domain_scores_codex":[0.98994994,0.005265285,0.0031639084,0.0006988411,0.00061799714,0.00030401227],"domain_scores_gemma":[0.96078753,0.034077886,0.0035845265,0.0011233838,0.00026929955,0.00015739418],"candidate_categories":["metaresearch","metaepi_narrow","metaepi_broad","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.009821228,0.0005529067,0.022774648,0.0008903995,0.00016477256,0.00036755684,0.0007340538,0.00035881973,0.003594835],"category_scores_gemma":[0.044864085,0.00036349005,0.003034225,0.0013487043,0.000024907498,0.00022172295,0.00036781665,0.00044401924,0.00028438738],"study_design_candidate":"meta_analysis","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085889435,0.0000058420974,2.4029754e-7,0.108288266,0.10531825,0.000013851474,0.000027392543,0.000021189948,2.7647582e-8,0.0000069067314,0.7862243,0.000007813782],"study_design_scores_gemma":[0.027145486,0.00006725204,0.0000020166417,0.051006105,0.9149128,0.000006531031,0.0000041329918,0.0014663363,3.2671718e-7,0.000059805363,0.004869373,0.0004598068],"about_ca_topic_score_codex":0.000058146565,"about_ca_topic_score_gemma":0.000020086296,"teacher_disagreement_score":0.8095946,"about_ca_system_score_codex":0.000018791436,"about_ca_system_score_gemma":0.0001239235,"threshold_uncertainty_score":0.9998817},"labels":[],"label_agreement":null},{"id":"W6892006078","doi":"10.48660/09110033","title":"Hydrodynamic long-time tails from AdS/CFT","year":2009,"lang":"en","type":"other","venue":"PIRSA","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Measure (data warehouse); Work (physics); Limit (mathematics); Stability (learning theory); Limiting","score_opus":0.006621743508973447,"score_gpt":0.21132934996721675,"score_spread":0.2047076064582433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6892006078","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002732526,0.0051236013,0.15332913,0.0007088153,0.0009140774,0.00030131315,0.00009989836,0.0019798253,0.8372701],"genre_scores_gemma":[0.0034577057,0.00006488364,0.040788133,0.00098829,0.0009911095,0.000011877532,0.0002985703,0.00028611746,0.9531133],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982327,0.000083807405,0.00022487188,0.0007008974,0.00032684175,0.00043086545],"domain_scores_gemma":[0.9984712,0.00011412159,0.00022964615,0.0010326158,0.000017875873,0.00013452313],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00016439376,0.00035742807,0.000401095,0.00021656518,0.00007289324,0.00018217454,0.0013734365,0.0003558546,0.0016963547],"category_scores_gemma":[0.000020655038,0.0003473933,0.00011712177,0.00022215312,0.000030576255,0.00011016941,0.00016083028,0.00036247296,0.0048087267],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030768308,0.000047462556,0.0004118435,0.000029263543,0.000080162754,0.00019050667,0.00028236225,0.0001679973,0.00004094993,0.00031845886,0.94710314,0.05132476],"study_design_scores_gemma":[0.0005095544,0.00013708962,0.000793444,0.0012034382,0.00006094238,0.00001845985,0.0000025070044,0.0759209,0.00004774234,0.0030387312,0.91697484,0.0012923422],"about_ca_topic_score_codex":0.00059829967,"about_ca_topic_score_gemma":0.000090243135,"teacher_disagreement_score":0.11584323,"about_ca_system_score_codex":0.00004986683,"about_ca_system_score_gemma":0.00010271931,"threshold_uncertainty_score":0.9998978},"labels":[],"label_agreement":null},{"id":"W6901916812","doi":"10.6084/m9.figshare.12276935","title":"Additional file 1 of Improving KT tools and products: development and evaluation of a framework for creating optimized, Knowledge-activated Tools (KaT)","year":2020,"lang":"en","type":"article","venue":"Open MIND","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Calgary; University Health Network; University of Toronto","funders":"","keywords":"Development (topology); Key (lock); Process (computing); Field (mathematics)","score_opus":0.12858086652005235,"score_gpt":0.32129059415942324,"score_spread":0.1927097276393709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6901916812","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20339718,0.0013005091,0.6157402,0.0020435099,0.0002818924,0.010033239,0.14915586,0.00005690276,0.01799075],"genre_scores_gemma":[0.020271327,4.5088765e-7,0.9769392,0.000020839045,0.00003329858,0.00020864065,0.0024566548,0.0000061654146,0.0000633998],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999015,0.00006951322,0.00027694297,0.0003406993,0.00017475423,0.00012309055],"domain_scores_gemma":[0.99701774,0.0022187016,0.00025645687,0.00012899756,0.00032245475,0.000055661392],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006077253,0.000096280135,0.00019153516,0.000033123873,0.00012458494,0.00020426078,0.00025465817,0.000054390348,0.011504154],"category_scores_gemma":[0.0042860666,0.00009274121,0.000014437428,0.00019458238,0.000027683971,0.0005439746,0.00025334282,0.00008096726,0.0000041386747],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059927814,0.00003432026,0.000011705941,0.00010640244,0.000037180358,4.2256704e-7,0.0065512676,0.00036112862,0.0015843777,0.00007234557,0.017197194,0.9739837],"study_design_scores_gemma":[0.0030614869,0.0007589022,0.0014850422,0.0040944465,0.000103237486,0.000013682504,0.0013239753,0.684334,0.16535972,0.00085795525,0.13776527,0.0008423191],"about_ca_topic_score_codex":0.0000030665067,"about_ca_topic_score_gemma":8.096317e-7,"teacher_disagreement_score":0.97314143,"about_ca_system_score_codex":0.000021164145,"about_ca_system_score_gemma":0.00058495475,"threshold_uncertainty_score":0.9893995},"labels":[],"label_agreement":null},{"id":"W6910341637","doi":"10.48336/n0vc-pj94","title":"Designing a cased based reasoning decision support system for ice management operations using expert knowledge","year":2021,"lang":"en","type":"article","venue":"Memorial University Research Repository (Memorial University)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Decision support system; Knowledge base; Expert system; Bridge (graph theory); Context (archaeology); Evidential reasoning approach; Knowledge-based systems","score_opus":0.054317265352317234,"score_gpt":0.2957722962523207,"score_spread":0.24145503090000348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910341637","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02327341,0.000063443775,0.94947934,0.000097553326,0.006340165,0.00087479135,0.000024543391,0.0003979649,0.019448763],"genre_scores_gemma":[0.4126097,0.000023148232,0.56977195,0.000027970227,0.0030081195,0.000003590095,0.00006809406,0.00006200485,0.014425427],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99519193,0.0014855862,0.00031632037,0.001213343,0.0008841021,0.0009087237],"domain_scores_gemma":[0.9955647,0.0013522917,0.00012242259,0.0009973778,0.0014942343,0.00046894766],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001831038,0.00031521372,0.00042389793,0.0011363736,0.0041119275,0.00061124854,0.0017094369,0.00027279457,0.000015035278],"category_scores_gemma":[0.00023826137,0.00040274864,0.00027857078,0.0025807938,0.00014510717,0.0012218865,0.0010002675,0.00050690596,0.000020458569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.015044288,0.002837674,0.001157556,0.0026768234,0.0021782294,0.12726413,0.02039308,0.1951173,0.30553526,0.26437274,0.042054053,0.0213689],"study_design_scores_gemma":[0.01566248,0.0009748793,0.000047078473,0.0018923647,0.0003496149,0.0003588049,0.01848675,0.6467713,0.11278169,0.000101356854,0.20081507,0.0017585949],"about_ca_topic_score_codex":0.00062093476,"about_ca_topic_score_gemma":0.0001149805,"teacher_disagreement_score":0.45165405,"about_ca_system_score_codex":0.0021335247,"about_ca_system_score_gemma":0.002501808,"threshold_uncertainty_score":0.99984246},"labels":[],"label_agreement":null},{"id":"W69139661","doi":"","title":"Approximate solution techniques for factored first-order MDPs","year":2007,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Probabilistic logic; Computer science; Logarithm; Inference; Theoretical computer science; Mathematical optimization; Exploit; Domain (mathematical analysis); Formalism (music); Algorithm; Mathematics; Artificial intelligence","score_opus":0.022667344774837183,"score_gpt":0.26571894705550597,"score_spread":0.2430516022806688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W69139661","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004987403,0.000046930792,0.99163663,0.00079596706,0.00013891363,0.0002552053,0.000002181563,0.0007825708,0.005842877],"genre_scores_gemma":[0.25671497,0.0000025541854,0.7421307,0.00030378884,0.00006169167,0.00002265176,0.0000091090005,0.00000823849,0.0007463061],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990795,0.0000106061225,0.00017671804,0.00025733854,0.0001273006,0.00034848525],"domain_scores_gemma":[0.9993289,0.00018179441,0.00006042242,0.00027085675,0.000094400166,0.00006363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007039091,0.00010678999,0.000097812896,0.00008855792,0.0002196333,0.000090614725,0.00036247497,0.0000847249,0.00001156611],"category_scores_gemma":[0.000044653058,0.000091056005,0.000044801127,0.00020651039,0.00001781236,0.000276983,0.000074980366,0.00007701329,0.000011037452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012598716,0.0003071163,0.009312958,0.0003827542,0.0000860105,0.000024113926,0.004847909,0.00036489146,0.013675493,0.26469436,0.10081506,0.60536337],"study_design_scores_gemma":[0.0007076815,0.00048413282,0.0015438711,0.00012823098,0.000014360098,0.000024582747,0.00006633079,0.660689,0.1337477,0.021628203,0.18005627,0.0009096598],"about_ca_topic_score_codex":0.00006857222,"about_ca_topic_score_gemma":0.000033709774,"teacher_disagreement_score":0.6603241,"about_ca_system_score_codex":0.00003304,"about_ca_system_score_gemma":0.000028841012,"threshold_uncertainty_score":0.3713156},"labels":[],"label_agreement":null},{"id":"W6929490342","doi":"10.5061/dryad.ht76hdrh4","title":"Honeybee optomotor behaviour is impaired by chronic exposure to insecticides","year":2022,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Imidacloprid; Neonicotinoid; Acute exposure; Fight-or-flight response; Escape response; Insect","score_opus":0.022885796175546556,"score_gpt":0.24567818980991987,"score_spread":0.2227923936343733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929490342","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038749893,0.00052578846,0.0076406584,0.0014827235,0.0004011239,0.0007829678,0.98678195,0.0012142967,0.00078296993],"genre_scores_gemma":[0.0030700774,0.00010873244,0.00058002863,0.0007998618,0.00021784804,5.349048e-7,0.9933295,0.0010607666,0.00083263294],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964145,0.00061905105,0.00041042248,0.0010191625,0.00084692193,0.00068994984],"domain_scores_gemma":[0.99749756,0.00005651386,0.00024096941,0.0014877453,0.00032808815,0.00038911751],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010032187,0.00035530704,0.0003132717,0.000477206,0.0031948453,0.001895466,0.0048368634,0.00017466674,0.07145144],"category_scores_gemma":[0.00034340058,0.00040457823,0.00010429493,0.0011002063,0.000067896864,0.00035456597,0.0048833513,0.00093531836,0.0055268253],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018638051,0.00010453214,0.0000014093508,0.00007964146,0.000042340467,0.00004867151,0.0006412587,0.00006563313,0.00027237582,0.000030586747,0.9861795,0.0125154285],"study_design_scores_gemma":[0.00031482236,0.0012426252,0.00003872966,0.00006440086,0.000023125729,0.00010946566,0.000040153252,0.00013387528,0.00017795719,0.00002048122,0.9973877,0.00044668306],"about_ca_topic_score_codex":0.00026011103,"about_ca_topic_score_gemma":0.0000013765373,"teacher_disagreement_score":0.065924615,"about_ca_system_score_codex":0.0005777445,"about_ca_system_score_gemma":0.000036437403,"threshold_uncertainty_score":0.9998406},"labels":[],"label_agreement":null},{"id":"W6930993004","doi":"10.5281/zenodo.4260303","title":"Ver Capone (2020) Pelicula Completa En Castellano wgd","year":2020,"lang":"es","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Paraphernalia; Volunteer work; Subject (documents); Feature (linguistics); Object (grammar)","score_opus":0.04259956382513012,"score_gpt":0.2422730506453608,"score_spread":0.1996734868202307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930993004","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09478214,0.004244381,0.38307723,0.09449073,0.0017583334,0.0034431494,0.0026993705,0.009588893,0.40591577],"genre_scores_gemma":[0.991117,0.00017717874,0.0024432791,0.0015831214,0.0007720417,2.880822e-8,0.00145968,0.001473628,0.0009740419],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.996199,0.0010152353,0.00044178794,0.0009346013,0.00070046465,0.0007088884],"domain_scores_gemma":[0.9978546,0.00011264953,0.00020011232,0.00074198225,0.00052640296,0.0005642606],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00088052655,0.00031721673,0.00032520943,0.00014901342,0.0024882397,0.0028142042,0.00274222,0.00013841236,0.010911836],"category_scores_gemma":[0.000670773,0.00034883933,0.000110317866,0.0010700446,0.00017339972,0.0004029229,0.0030548784,0.00069512054,0.035007656],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013919517,0.00018078895,0.000060465292,0.00053176173,0.00017411294,0.0004957004,0.016438942,0.0027455918,0.0058390116,0.012651403,0.84372157,0.11702145],"study_design_scores_gemma":[0.00057000626,0.00047420932,0.00059519784,0.00011159631,0.000028476568,0.00024358855,0.00020529352,0.05501524,0.00027048192,0.000040815892,0.9420489,0.0003961773],"about_ca_topic_score_codex":0.000049047307,"about_ca_topic_score_gemma":1.5462689e-7,"teacher_disagreement_score":0.8963349,"about_ca_system_score_codex":0.00012893789,"about_ca_system_score_gemma":0.000017147599,"threshold_uncertainty_score":0.99989635},"labels":[],"label_agreement":null},{"id":"W6931274045","doi":"10.5281/zenodo.6190287","title":"clEsperanto/napari_pyclesperanto_assistant: 0.15.4","year":2022,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Innovation Cluster (Canada)","funders":"","keywords":"Process (computing); Product (mathematics); Work (physics); Identification (biology)","score_opus":0.026271666826630173,"score_gpt":0.2313865595770358,"score_spread":0.20511489275040562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931274045","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015434345,0.00085276144,0.037093896,0.0007607512,0.00031825164,0.0003957643,0.00037220426,0.004011884,0.956179],"genre_scores_gemma":[0.012368753,0.0006124476,0.016409729,0.001648029,0.0013006104,4.573265e-7,0.009729931,0.029412678,0.92851734],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969656,0.0005932918,0.0003006297,0.000874138,0.0006937732,0.0005725675],"domain_scores_gemma":[0.9981481,0.000038367394,0.00023952422,0.0012077304,0.00014368449,0.00022258762],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008253902,0.00030887188,0.00029876386,0.0005870463,0.002639642,0.0015447949,0.0037370299,0.00016107562,0.13205308],"category_scores_gemma":[0.00016319002,0.00034022346,0.00010589446,0.0008269884,0.000110428075,0.00019923782,0.0027325081,0.00070376246,0.011089809],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011708157,0.000064568936,0.0000014099713,0.00007062827,0.000054145577,0.00006113599,0.0006960636,0.000033460346,0.00010353493,0.008598821,0.92511445,0.06519009],"study_design_scores_gemma":[0.00035998935,0.00014579663,0.000022424594,0.00008006081,0.000012705773,0.00012333522,0.00006580054,0.001041303,0.000014758071,0.00013570965,0.9976016,0.00039649344],"about_ca_topic_score_codex":0.00006718524,"about_ca_topic_score_gemma":0.000001146912,"teacher_disagreement_score":0.12096326,"about_ca_system_score_codex":0.00020464839,"about_ca_system_score_gemma":0.00001267132,"threshold_uncertainty_score":0.999905},"labels":[],"label_agreement":null},{"id":"W6957694968","doi":"10.60692/2djpy-z0t56","title":"Influenza Vaccine Effectiveness in Mainland China: A Systematic Review and Meta-Analysis","year":2021,"lang":"en","type":"article","venue":"Greater South Information System","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Influenza vaccine; Vaccination; Mainland China; Live attenuated influenza vaccine; Influenza season; Human mortality from H5N1; Influenza A virus; Public health","score_opus":0.03830132580711238,"score_gpt":0.2459120433960607,"score_spread":0.20761071758894833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6957694968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04555238,0.013158375,0.93647695,0.0005250518,0.00014558794,0.0025922563,0.00009832215,0.00045489566,0.0009962014],"genre_scores_gemma":[0.9978811,0.0000023937705,0.0011901398,0.00067074335,0.0000040105288,0.00019902497,0.0000096121075,0.000004422444,0.000038523707],"study_design_codex":"systematic_review","study_design_gemma":"meta_analysis","domain_scores_codex":[0.99779457,0.00064769684,0.0008551455,0.0002394926,0.00025487854,0.00020819757],"domain_scores_gemma":[0.99867654,0.00006360514,0.00037813516,0.0006479341,0.00015731559,0.000076447664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002003294,0.0002035393,0.0014117651,0.0003551612,0.00009583021,0.00032354187,0.00026593212,0.000067986,0.000009829537],"category_scores_gemma":[0.000081687984,0.00014309712,0.00024698442,0.0013539032,0.000005248854,0.0008852025,0.00013030301,0.00011138737,0.00006773174],"study_design_candidate":"systematic_review","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017862012,0.000007114777,0.11964052,0.7895702,0.033663925,0.00008753091,0.0502673,0.004579728,4.9944714e-7,0.0021061376,0.000040064257,0.000019075249],"study_design_scores_gemma":[0.0053816927,0.00019856318,0.2850587,0.04675533,0.50747865,0.0012075745,0.0038907032,0.14671539,0.00035594314,0.00005981516,0.00007428262,0.0028233577],"about_ca_topic_score_codex":0.000014055527,"about_ca_topic_score_gemma":7.220782e-7,"teacher_disagreement_score":0.95232874,"about_ca_system_score_codex":0.000057227662,"about_ca_system_score_gemma":0.00003849528,"threshold_uncertainty_score":0.5835331},"labels":[],"label_agreement":null},{"id":"W6976884163","doi":"10.6068/dp14ba85ddb4870","title":"Trend 2007 - 2011. Statistics Canada. CANSIM: Business, Consumer and Property Services - Information and Culture | Country: Canada | Table: Software development and computer services, sales by type of client based on the North American Industry Classification System (NAICS) | Variable: Sales to businesses, Computer systems design and related services | Units: %, 2007-2011. Data-Planet™ Statistical Ready Reference by Conquest Systems, Inc. Dataset-ID: 075-001-011.","year":2015,"lang":"en","type":"other","venue":"Data Planet","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Economic statistics; Census; Official statistics; The Internet; Publication; Publishing; Information system; Software; Personal computer; Service (business)","score_opus":0.021425826859769837,"score_gpt":0.21255587529865264,"score_spread":0.1911300484388828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6976884163","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011529315,0.0023647412,0.0026518835,0.000014129081,0.00050112867,0.0008323114,0.99349934,0.00008757484,0.000037367416],"genre_scores_gemma":[0.00007594808,0.00031216512,0.0071021803,0.00052693445,0.00006534741,0.00001675454,0.9917336,0.000056713907,0.000110371024],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99686813,0.00038373916,0.0007933975,0.0008107783,0.0007240814,0.00041986845],"domain_scores_gemma":[0.9965556,0.0005343183,0.0010171619,0.001179346,0.00036060472,0.00035292204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062107615,0.0005839837,0.0006964629,0.00010943547,0.00026671225,0.00058204227,0.0011755822,0.00034175318,0.000028074175],"category_scores_gemma":[0.000008619855,0.00040390875,1.4350671e-7,0.0003557154,0.00014830031,0.00050239405,0.0005555167,0.0004926444,0.000011364656],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055687473,0.000022032877,0.0006255533,0.0042966497,0.00014114038,0.000026985674,0.00003598654,0.00088759646,2.593293e-7,0.00005212174,0.9934458,0.00041020187],"study_design_scores_gemma":[0.00029861977,0.00006154185,0.00018551247,0.0003977549,0.00010617717,0.00007330908,0.00019960906,0.19364843,1.1850824e-8,2.2233325e-8,0.80458903,0.00043996758],"about_ca_topic_score_codex":0.9880052,"about_ca_topic_score_gemma":0.88459843,"teacher_disagreement_score":0.19276084,"about_ca_system_score_codex":0.00011700218,"about_ca_system_score_gemma":0.004088661,"threshold_uncertainty_score":0.9998413},"labels":[],"label_agreement":null},{"id":"W6991555842","doi":"","title":"I conflitti internazionali marittimi e le loro risoluzioni","year":2021,"lang":"it","type":"article","venue":"Electronic Theses and Dissertations Repository (University of Pisa)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Christian ministry; Digital rights","score_opus":0.008136224658273981,"score_gpt":0.20008150852431736,"score_spread":0.19194528386604337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6991555842","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84949803,0.012339322,0.11462114,0.0042503416,0.00053155393,0.00022357747,0.00002807305,0.00014068384,0.018367285],"genre_scores_gemma":[0.97004265,0.00026442952,0.0021012386,0.000043525888,0.00003466292,4.5994906e-7,0.000032004165,0.000011425138,0.027469585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841243,0.00022275168,0.00022318943,0.0005167328,0.0002086199,0.0004162747],"domain_scores_gemma":[0.99856645,0.0003473653,0.00023815536,0.00042167195,0.00026988838,0.00015648427],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001929045,0.0001959396,0.00028656446,0.00008324879,0.0010222063,0.00017501658,0.0004627321,0.00013090481,0.00009853823],"category_scores_gemma":[0.000040146486,0.00025253737,0.00016081578,0.00033059606,0.00018213944,0.00048627032,0.00017688115,0.00031975113,0.00001281434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004646307,0.0011320157,0.022112153,0.00045032523,0.0012352504,0.0006577536,0.044715773,0.001998527,0.02246489,0.88419944,0.002841828,0.017727429],"study_design_scores_gemma":[0.010476327,0.004195855,0.19261293,0.0042709457,0.0020274194,0.0025703202,0.19042154,0.31799376,0.07060862,0.041611783,0.15760878,0.0056017423],"about_ca_topic_score_codex":0.0024119194,"about_ca_topic_score_gemma":0.00055936334,"teacher_disagreement_score":0.84258765,"about_ca_system_score_codex":0.00007809029,"about_ca_system_score_gemma":0.0011473529,"threshold_uncertainty_score":0.99999267},"labels":[],"label_agreement":null},{"id":"W6997101637","doi":"","title":"Towards the Visualization and Understanding of Diagnoses in a Physical System 1","year":2008,"lang":"en","type":"article","venue":"NPARC","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Visualization; Medical diagnosis; Knowledge base; Domain (mathematical analysis); Heuristics; Domain knowledge; Knowledge-based systems; Schematic; Hypermedia","score_opus":0.05771064946284848,"score_gpt":0.265873416733688,"score_spread":0.2081627672708395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6997101637","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55476844,0.00006956817,0.4402692,0.0002916121,0.000054572167,0.00007674799,9.115349e-7,0.00005033848,0.0044186115],"genre_scores_gemma":[0.9986834,0.000008781992,0.0012534441,0.000023375509,0.000017438737,0.0000036217125,4.1565772e-7,0.0000022145366,0.0000073150322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995713,0.000057074052,0.00007879613,0.00009593916,0.00011524272,0.000081596816],"domain_scores_gemma":[0.9996573,0.0001741267,0.000037102942,0.00010361795,0.000011784749,0.000016116264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015721517,0.000041457602,0.00007647807,0.00003747106,0.00008282573,0.000017947585,0.00013265983,0.000016067826,7.8658843e-7],"category_scores_gemma":[0.000025133662,0.000028968147,0.000011324374,0.0001911212,0.000038800645,0.000095019204,0.000046569035,0.000043157077,7.574291e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051687975,0.000036463225,0.018794835,0.0000872754,0.0000071426243,0.000022889606,0.019933878,0.00039065303,0.00095291657,0.95692873,0.00046477065,0.002375291],"study_design_scores_gemma":[0.0005067555,0.00015961527,0.016192675,0.00043382644,0.0000071161257,0.000062731895,0.0014631633,0.950822,0.004160728,0.025886599,0.0001126382,0.00019214748],"about_ca_topic_score_codex":0.000026714406,"about_ca_topic_score_gemma":0.0000024949804,"teacher_disagreement_score":0.95043135,"about_ca_system_score_codex":0.000030509613,"about_ca_system_score_gemma":0.000030459409,"threshold_uncertainty_score":0.11812867},"labels":[],"label_agreement":null},{"id":"W7006660154","doi":"","title":"The Web-Integration of a Decision Support System Tools for Medical Diagnosis","year":2002,"lang":"en","type":"article","venue":"NPARC","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Medical diagnosis; Decision support system; Focus (optics); Clinical decision support system; Quality (philosophy); Intelligent decision support system; Expert system","score_opus":0.032112499072461026,"score_gpt":0.263958807467553,"score_spread":0.231846308395092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7006660154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008734582,0.00013553117,0.9801739,0.0035270767,0.00045388468,0.00024044921,0.000008818126,0.000107340486,0.006618427],"genre_scores_gemma":[0.94802326,0.0000487608,0.051522337,0.000107260574,0.000057931225,0.000087019675,0.0000026019068,0.000004595878,0.0001462603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897945,0.000049411527,0.0002539936,0.00016028751,0.00039099128,0.00016589127],"domain_scores_gemma":[0.997001,0.0024626446,0.00008733582,0.000297566,0.00008450525,0.0000669787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009256752,0.0000665488,0.00010882461,0.000033550845,0.00017418693,0.00012243,0.0005643316,0.00006524654,0.00008050894],"category_scores_gemma":[0.00071754557,0.00004206037,0.000062849795,0.00013699249,0.00002561449,0.00018219207,0.000055312164,0.000080719066,0.000027034765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008846567,0.000025389725,0.00028034492,0.000027223554,0.00000856342,0.0000080825685,0.0004885348,0.000020236766,0.0002795738,0.042077754,0.06904801,0.88772744],"study_design_scores_gemma":[0.0004303577,0.00023599016,0.00012481572,0.0003574042,0.0000086283735,0.00002859198,0.00008770656,0.95506483,0.002725706,0.002904529,0.037918378,0.00011306795],"about_ca_topic_score_codex":0.0000040218247,"about_ca_topic_score_gemma":0.000007685954,"teacher_disagreement_score":0.95504457,"about_ca_system_score_codex":0.000023866547,"about_ca_system_score_gemma":0.00004796261,"threshold_uncertainty_score":0.1715172},"labels":[],"label_agreement":null},{"id":"W7007898819","doi":"","title":"Advances in artifical intelligence","year":2002,"lang":"en","type":"article","venue":"NPARC","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"","score_opus":0.029930889161412125,"score_gpt":0.25160948424255725,"score_spread":0.22167859508114512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7007898819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038667114,0.0010338195,0.879081,0.002384903,0.00024957355,0.00006185399,5.361571e-7,0.00015995579,0.113161646],"genre_scores_gemma":[0.94658214,0.000104035236,0.052809548,0.00019156795,0.000026129674,0.000005416285,2.9760372e-7,0.0000027638775,0.00027810855],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930316,0.00003569292,0.00013201192,0.0002056472,0.00012448577,0.00019901787],"domain_scores_gemma":[0.9995744,0.00011708882,0.000024976338,0.00022173372,0.000013099889,0.000048699658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017069513,0.00006086634,0.000071638504,0.00005827647,0.000044655455,0.000051840667,0.0003987944,0.00003056665,0.00022254272],"category_scores_gemma":[0.000043666943,0.0000561298,0.000018509621,0.00027457328,0.000024019484,0.0003308105,0.000052847143,0.00013465392,0.00030618178],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017497046,0.000044431858,0.0026186728,0.000009562394,8.28326e-7,0.000041632677,0.0010401764,0.0013726847,0.00046193865,0.06371028,0.0015253202,0.9291727],"study_design_scores_gemma":[0.000078386256,0.000072858966,0.00035571225,0.00007574291,8.5656745e-7,0.000015508243,0.000028015627,0.86232543,0.0031613552,0.09219382,0.04147431,0.00021798127],"about_ca_topic_score_codex":0.0000021200926,"about_ca_topic_score_gemma":0.000004201324,"teacher_disagreement_score":0.9427154,"about_ca_system_score_codex":0.000013412827,"about_ca_system_score_gemma":0.0000065653417,"threshold_uncertainty_score":0.39354494},"labels":[],"label_agreement":null},{"id":"W7017368115","doi":"","title":"Applications of intelligence agents to engineering design and manufacturing","year":2002,"lang":"en","type":"article","venue":"NPARC","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Engineering design process; Production engineering; Computer-integrated manufacturing; Expert system; Product design","score_opus":0.02916879336110081,"score_gpt":0.23128691768664658,"score_spread":0.20211812432554577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7017368115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033067241,0.00005208196,0.99538916,0.0002061078,0.000023526123,0.00011343004,4.929308e-7,0.000056168476,0.00085232983],"genre_scores_gemma":[0.62971246,0.0000065877844,0.37014174,0.000044902983,0.00000820249,0.000014355408,1.2183952e-7,0.0000025867328,0.00006902707],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999558,0.000010655548,0.000095066585,0.00014244961,0.00007943222,0.00011440391],"domain_scores_gemma":[0.9996218,0.00009717973,0.000023082626,0.00018412549,0.000011453955,0.00006233529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000118494754,0.00005334469,0.000059267648,0.00006679618,0.000041193678,0.000028987735,0.0002525794,0.000018543626,0.000030987594],"category_scores_gemma":[0.0000104703595,0.000054557277,0.0000103746725,0.0001042918,0.0000063710186,0.00007681396,0.00007347988,0.000050839,0.00002562239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021428305,0.000037775793,0.00028754628,0.000085552005,0.00001740184,0.000006659052,0.0034866007,0.103752695,0.010149837,0.011462624,0.0019181554,0.868793],"study_design_scores_gemma":[0.000040758907,0.000049156337,0.00029720852,0.000059310147,0.000003145781,0.000008266543,0.000009499446,0.88701344,0.10313647,0.0027228768,0.006514509,0.00014533845],"about_ca_topic_score_codex":0.0000023627545,"about_ca_topic_score_gemma":7.250675e-8,"teacher_disagreement_score":0.8686477,"about_ca_system_score_codex":0.000007710569,"about_ca_system_score_gemma":0.0000030956612,"threshold_uncertainty_score":0.22247812},"labels":[],"label_agreement":null},{"id":"W7018162705","doi":"","title":"Configurability in a Diagnostic Expert System for Paper Machine Dryer Sections","year":2007,"lang":"en","type":"article","venue":"NPARC","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Troubleshooting; Expert system; Focus (optics); Paper machine","score_opus":0.015302467716207769,"score_gpt":0.2566223448611035,"score_spread":0.24131987714489575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7018162705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047785137,0.00025113166,0.9340411,0.0014420962,0.00064769987,0.00044788784,0.0000114226505,0.000292693,0.015080845],"genre_scores_gemma":[0.9741738,0.0000021228097,0.025257425,0.00030694646,0.000075218806,0.00006684327,0.0000048191264,0.0000069622574,0.00010586355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998976,0.00005194612,0.0002573303,0.0002853938,0.00012483724,0.00030449417],"domain_scores_gemma":[0.99750626,0.001987245,0.000048640537,0.00032792572,0.000050635812,0.00007930485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001039348,0.000099152654,0.00013299256,0.00007780434,0.00013035022,0.000052352563,0.00027786064,0.000064401174,0.000029963374],"category_scores_gemma":[0.0003704837,0.00008968197,0.000050065297,0.00021868042,0.000020398871,0.00016302739,0.000037736576,0.00012927,0.00001705311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031727392,0.0011876933,0.17879589,0.0012777401,0.00015017208,0.00042453496,0.029891934,0.0051502413,0.08056989,0.33315855,0.031829834,0.33724624],"study_design_scores_gemma":[0.00910972,0.0015019836,0.15239233,0.0021976444,0.00005754557,0.0003727234,0.0017664557,0.4660488,0.08596263,0.052871883,0.22441572,0.0033025679],"about_ca_topic_score_codex":0.0001556175,"about_ca_topic_score_gemma":0.00015556242,"teacher_disagreement_score":0.9263887,"about_ca_system_score_codex":0.00009396948,"about_ca_system_score_gemma":0.000045539906,"threshold_uncertainty_score":0.36571243},"labels":[],"label_agreement":null},{"id":"W7023638313","doi":"","title":"Pacing Changes: Elevating the when+where in living systems | York U | 2025-03-04","year":2025,"lang":"en","type":"other","venue":"Internet Archive (Internet Archive)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Living systems; Systems thinking; Assisted living","score_opus":0.017293990957351558,"score_gpt":0.23374531308681798,"score_spread":0.2164513221294664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023638313","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000073070725,0.0042770132,0.29676077,0.00054044096,0.0020709606,0.00094362686,0.0001588676,0.00064792135,0.6945273],"genre_scores_gemma":[0.02531401,0.00017578027,0.011237768,0.0006298871,0.000908375,0.0002443851,0.00010471161,0.00035176345,0.96103334],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9940478,0.0012784821,0.0009847411,0.0016930635,0.00068320724,0.0013126623],"domain_scores_gemma":[0.9941743,0.0030997554,0.00086441357,0.0015890703,0.00004579732,0.00022663696],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011600035,0.0010418121,0.001055649,0.0012529327,0.000121875666,0.0009446971,0.004578567,0.0003084015,0.00086482003],"category_scores_gemma":[0.000296639,0.0008505237,0.00031580334,0.0004468661,0.00023719396,0.00015819668,0.0025008994,0.0020793637,0.00066190935],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023640774,0.000059539318,0.0021849272,0.00069068663,0.0002824541,0.00015554644,0.01752042,0.0002655545,0.000053103937,0.018809626,0.9578348,0.0021196946],"study_design_scores_gemma":[0.00044702832,0.00023355335,0.0001876378,0.035626285,0.00005711906,0.00006662995,0.0005861912,0.12357292,0.00004680585,0.001698367,0.8362745,0.0012029608],"about_ca_topic_score_codex":0.07326771,"about_ca_topic_score_gemma":0.046578135,"teacher_disagreement_score":0.285523,"about_ca_system_score_codex":0.00014109141,"about_ca_system_score_gemma":0.00032303843,"threshold_uncertainty_score":0.99939454},"labels":[],"label_agreement":null},{"id":"W7028553668","doi":"","title":"Foundations of intelligent systems 17th international symposium, ISMIS 2008, Toronto, Canada, May 20 - 23, 2008 ; proceedings","year":2008,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Intelligent decision support system; Expert system; Intelligent control; Government (linguistics)","score_opus":0.019051564083410324,"score_gpt":0.23416399216363643,"score_spread":0.2151124280802261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7028553668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017784663,0.0022327427,0.65139306,0.010730025,0.006304735,0.0009474129,0.00014867769,0.00056663156,0.30989203],"genre_scores_gemma":[0.96543777,0.00019052062,0.014558191,0.00033416227,0.0001898787,0.000027792294,0.00005845808,0.000015277756,0.01918797],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983404,0.000019539037,0.00043936804,0.0003424865,0.0005681998,0.00028995445],"domain_scores_gemma":[0.9989293,0.00009454415,0.00019827632,0.00023870995,0.00039628323,0.00014284646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023139038,0.00016672898,0.00019536685,0.00005373314,0.00022054093,0.000104022816,0.00089018216,0.00006162925,0.0001275573],"category_scores_gemma":[0.000032862135,0.00015450564,0.000052657684,0.00018840845,0.000045629207,0.00060229166,0.0001397487,0.00011195779,0.000025007414],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014778326,0.00013953332,0.023270844,0.000092889786,0.00016141906,0.00003607762,0.0034050294,0.0067944773,0.0006182147,0.038492512,0.92507833,0.0018958852],"study_design_scores_gemma":[0.00055649894,0.00021469685,0.0029404545,0.00030747056,0.000022921768,0.00040656285,0.00065969414,0.41410857,0.0045814067,0.00013113808,0.57525283,0.0008177529],"about_ca_topic_score_codex":0.49032733,"about_ca_topic_score_gemma":0.10587704,"teacher_disagreement_score":0.9476531,"about_ca_system_score_codex":0.00036571713,"about_ca_system_score_gemma":0.00066457386,"threshold_uncertainty_score":0.91043836},"labels":[],"label_agreement":null},{"id":"W7029116256","doi":"","title":"Implicit: A recommender system that uses implicit knowledge to produce suggestions","year":2005,"lang":"en","type":"article","venue":"Institutional Research Information System (Università degli Studi di Trento)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Provincia Autonoma di Trento; Science Foundation Ireland","keywords":"Recommender system; Implicit knowledge; Knowledge-based systems; Matching (statistics); Feature (linguistics)","score_opus":0.10330694716739773,"score_gpt":0.34030117247824704,"score_spread":0.2369942253108493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7029116256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052320756,0.00050490967,0.77829754,0.008783084,0.0012987463,0.0023857013,0.000254027,0.0015962211,0.15455902],"genre_scores_gemma":[0.9934245,0.0000067860738,0.0053997845,0.000105997045,0.00019516662,0.00012367855,0.00006884117,0.000009708922,0.0006655444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963219,0.00036457033,0.0005388324,0.00050982146,0.0013984196,0.00086641795],"domain_scores_gemma":[0.99683106,0.0003960538,0.00019848395,0.00075738213,0.001335999,0.00048102232],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002240038,0.00029220898,0.00033049108,0.0016003562,0.0025651397,0.00061378983,0.001437777,0.00014385168,0.000017977314],"category_scores_gemma":[0.00017107485,0.0002883257,0.00012640472,0.002329796,0.00011201887,0.004796758,0.0008945635,0.0004775517,0.002299199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009168455,0.00016001708,0.004203417,0.00070013717,0.00020383856,0.000033455195,0.016309869,0.016036907,0.0000582482,0.86578023,0.04678975,0.049632452],"study_design_scores_gemma":[0.003416389,0.00052973797,0.040254254,0.003005037,0.00006073686,0.00062504277,0.02995913,0.15845807,0.00048460707,0.0000709488,0.76161844,0.0015175858],"about_ca_topic_score_codex":0.0003417998,"about_ca_topic_score_gemma":0.00010978079,"teacher_disagreement_score":0.94110376,"about_ca_system_score_codex":0.0025527743,"about_ca_system_score_gemma":0.00091256114,"threshold_uncertainty_score":0.9999569},"labels":[],"label_agreement":null},{"id":"W7032242768","doi":"","title":"Sider, Roy Y.","year":2009,"lang":"en","type":"article","venue":"ePlace - Preserving, Learning, and Creative Exchange (Asbury Theological Seminary)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nucleofection; Gestational period; TSG101; Dysgeusia; Diafiltration; Liquation; Emperipolesis; Durvalumab; Triacetin","score_opus":0.013781841835804071,"score_gpt":0.2607267156621794,"score_spread":0.24694487382637534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7032242768","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010748898,0.009483895,0.07047819,0.0027369529,0.0001436895,0.00034991192,0.0000054702414,0.0008055499,0.90524745],"genre_scores_gemma":[0.044182863,0.0008772758,0.010374602,0.0010739159,0.00025241254,0.000043217726,0.000025406078,0.000023587625,0.9431467],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99647933,0.0008523349,0.00035854007,0.0010300821,0.00042002337,0.00085967546],"domain_scores_gemma":[0.99784064,0.00082946534,0.00028190142,0.0005574438,0.00012501306,0.00036554094],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011823107,0.0004885875,0.0005208819,0.00016131713,0.00076734467,0.00016090977,0.0011381918,0.00033035924,0.07166311],"category_scores_gemma":[0.00076426927,0.0003935545,0.00013537236,0.00045291416,0.00020126994,0.00066512777,0.00074507087,0.0009070248,0.00007889244],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007176483,0.00011983944,0.004978964,0.000031697542,0.000027379143,0.00015771798,0.0033563706,0.00014244822,0.00044689592,0.005610278,0.9825046,0.0025520138],"study_design_scores_gemma":[0.00057803263,0.0024590592,0.009928027,0.00017659292,0.000025270516,0.00008302062,0.00039170356,0.013175574,0.0006116203,0.010917344,0.96102566,0.000628074],"about_ca_topic_score_codex":0.00011549413,"about_ca_topic_score_gemma":0.0000060758985,"teacher_disagreement_score":0.07158422,"about_ca_system_score_codex":0.000049228893,"about_ca_system_score_gemma":0.000038856197,"threshold_uncertainty_score":0.99985164},"labels":[],"label_agreement":null},{"id":"W7034312925","doi":"","title":"Smith, Larratt Wm. (1820-ca. 1900)","year":2014,"lang":"en","type":"article","venue":"eYLS (Yale Law School)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Work (physics); Government (linguistics); Legislation","score_opus":0.012331741343965934,"score_gpt":0.22914033791399965,"score_spread":0.2168085965700337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034312925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043043178,0.0020304658,0.7684814,0.005867753,0.0028925554,0.00043128955,0.000021954247,0.001767176,0.17546429],"genre_scores_gemma":[0.9309515,0.000013849786,0.056396138,0.004978925,0.00062630733,0.000027995287,0.00001513981,0.000036331137,0.006953818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978082,0.00021729487,0.00032331093,0.00062516547,0.0004067634,0.0006192535],"domain_scores_gemma":[0.9980713,0.0002526904,0.00012605885,0.0010923493,0.000092210495,0.0003653919],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00090453227,0.00026222362,0.00027757924,0.00007902178,0.0004518409,0.00046426262,0.001291981,0.00015218639,0.0002275028],"category_scores_gemma":[0.00014856453,0.00024746737,0.0001110219,0.00035272422,0.00007273724,0.0006529066,0.00026443455,0.00048046972,0.0029728524],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033284156,0.00019484948,0.022155017,0.00018385374,0.0001074854,0.00011687351,0.0012567854,0.003992743,0.0020404626,0.7287232,0.20150873,0.039686676],"study_design_scores_gemma":[0.0007695672,0.00021846248,0.002034934,0.0001954428,0.000014297303,0.00004091201,0.000020730036,0.03635976,0.001990243,0.013666269,0.9439844,0.00070497114],"about_ca_topic_score_codex":0.00045849997,"about_ca_topic_score_gemma":0.00008803713,"teacher_disagreement_score":0.88790834,"about_ca_system_score_codex":0.0000461024,"about_ca_system_score_gemma":0.000111726054,"threshold_uncertainty_score":0.99999774},"labels":[],"label_agreement":null},{"id":"W7094319756","doi":"","title":"Metis : an integrated reference architecture for addressing uncertainty in decision-support systems:","year":2015,"lang":"en","type":"article","venue":"TNO Repository","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Metis; Domain (mathematical analysis); Architecture; Probabilistic logic; Visualization; Reference architecture; Information visualization; Information system; Raw data","score_opus":0.06582008179124979,"score_gpt":0.30335050337204167,"score_spread":0.23753042158079188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7094319756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068097994,0.0007789668,0.9248609,0.00012201953,0.0013779207,0.00044256228,0.000012681978,0.00037728445,0.0039296835],"genre_scores_gemma":[0.9002552,0.0000013770411,0.09890911,0.00010432472,0.00012502757,0.0000655649,0.00003274937,0.000016889551,0.000489747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816835,0.00024147714,0.00040295016,0.00051391684,0.00032814618,0.0003451854],"domain_scores_gemma":[0.99836123,0.00037405273,0.00016226328,0.0006452212,0.00022990792,0.00022732603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010762833,0.00018481503,0.00026269772,0.00018519227,0.00015607671,0.00030862688,0.000783466,0.00014463227,0.0000016164826],"category_scores_gemma":[0.00017567426,0.00015271895,0.00004228707,0.0003192296,0.00003698661,0.0003533485,0.0001022145,0.0003015262,0.000007166153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006135974,0.00033059032,0.009905841,0.00031832766,0.00008650386,0.0008278859,0.020681111,0.47447824,0.0038291914,0.007379974,0.030059123,0.4514896],"study_design_scores_gemma":[0.002250846,0.0014795533,0.0018839994,0.0019079132,0.000035026722,0.00062464376,0.0013651961,0.88182724,0.0019526518,0.004756364,0.100717805,0.0011987636],"about_ca_topic_score_codex":0.00086799345,"about_ca_topic_score_gemma":0.00007577047,"teacher_disagreement_score":0.8321572,"about_ca_system_score_codex":0.0001626147,"about_ca_system_score_gemma":0.0005142688,"threshold_uncertainty_score":0.62276983},"labels":[],"label_agreement":null},{"id":"W7097195469","doi":"","title":"TRANSFORMING BONE MARROW TRANSPLANTATION DATA INTO A CASE-BASED REASONING SYSTEM FOR DECISION SUPPORT ABSTRACT","year":2008,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Decision support system; Clinical decision support system; Leverage (statistics); Bone marrow transplant; Bone marrow transplantation; Bone marrow; Ontology; Electronic medical record; Case-based reasoning","score_opus":0.04206268596665734,"score_gpt":0.27989059129964045,"score_spread":0.2378279053329831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097195469","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04768761,0.00011955469,0.9502546,0.00015129952,0.0002503375,0.00037236803,0.000047475827,0.00039454174,0.0007221922],"genre_scores_gemma":[0.64290464,0.000006828517,0.35674304,0.000072508985,0.000036104335,0.000020883079,0.0001637575,0.000012764892,0.000039455987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982139,0.000033798133,0.00046770988,0.0006117639,0.00032184322,0.00035099976],"domain_scores_gemma":[0.99808365,0.0007885131,0.00011968704,0.0007839507,0.00008283958,0.00014136163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096042955,0.00019829044,0.00023561854,0.00016555197,0.0006302027,0.000118444885,0.00072838226,0.00010924533,0.000014323866],"category_scores_gemma":[0.000052752814,0.00018030264,0.0000785727,0.00025240763,0.000024329656,0.001029346,0.00003331639,0.00013988471,0.000017493567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001744432,0.0005314701,0.004752248,0.006517167,0.00024178498,0.055906318,0.03459378,0.039623305,0.022272509,0.01861546,0.027367711,0.7878338],"study_design_scores_gemma":[0.0018241565,0.00025969459,0.00014062358,0.00085166784,0.00005235095,0.010322395,0.00028778476,0.97095305,0.011385832,0.000118903765,0.0032285189,0.0005750266],"about_ca_topic_score_codex":0.00037429828,"about_ca_topic_score_gemma":0.00015396505,"teacher_disagreement_score":0.9313297,"about_ca_system_score_codex":0.000064327985,"about_ca_system_score_gemma":0.00026124046,"threshold_uncertainty_score":0.7352528},"labels":[],"label_agreement":null},{"id":"W7099228945","doi":"","title":"Automated System for the Planning of a Hydroelectric Network","year":2010,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Hydroelectricity; Process (computing); Work (physics); Expert system; Production (economics); Decision support system; Perspective (graphical); Automation","score_opus":0.012044888945472131,"score_gpt":0.24268214197641338,"score_spread":0.23063725303094126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099228945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013180019,0.0002355952,0.9817562,0.00028940692,0.0006797661,0.00022476746,0.0000010379706,0.0010219491,0.0026112546],"genre_scores_gemma":[0.93424433,2.9691145e-7,0.065402694,0.000077310535,0.00010635438,0.000019623305,0.0000011994648,0.0000056248623,0.0001425723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992769,0.000025286223,0.00017454395,0.00015537922,0.00011342609,0.000254508],"domain_scores_gemma":[0.9986414,0.00081983634,0.000102221886,0.0003477105,0.00005359906,0.00003528066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067038334,0.00007752308,0.00011290549,0.000039525137,0.0002186195,0.000065405206,0.00063375337,0.00005400375,0.0000027638346],"category_scores_gemma":[0.00003662632,0.000048441274,0.00004766758,0.0003782313,0.000015563905,0.00008593143,0.000055074306,0.00013873768,0.0000052639916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062948806,0.0000625375,0.017337475,0.00042760928,0.00023899459,0.000020277257,0.0028893652,0.29852438,0.01266354,0.49631315,0.12847874,0.042980976],"study_design_scores_gemma":[0.00012719346,0.000052003514,0.00043153003,0.00004161905,0.0000071755167,0.000016662945,0.000015813095,0.99593717,0.0010945987,0.0002410379,0.0019648075,0.00007037986],"about_ca_topic_score_codex":0.000037780057,"about_ca_topic_score_gemma":0.0000029634375,"teacher_disagreement_score":0.9210643,"about_ca_system_score_codex":0.0000068116233,"about_ca_system_score_gemma":0.000056501194,"threshold_uncertainty_score":0.19753778},"labels":[],"label_agreement":null},{"id":"W7111566765","doi":"","title":"Sophisticated Learning: A novel algorithm for active learning during model-based planning","year":2025,"lang":"en","type":"article","venue":"PubMed Central","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"National Institute of General Medical Sciences; Laureate Institute for Brain Research, University of Tulsa","keywords":"Active learning (machine learning); Pattern recognition (psychology); Optimization algorithm; Instance-based learning","score_opus":0.019678118236482193,"score_gpt":0.24311446280376275,"score_spread":0.22343634456728056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7111566765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012144738,0.0001298847,0.9847042,0.0007019685,0.0004741239,0.00045317187,0.00001181336,0.0006090162,0.0007711094],"genre_scores_gemma":[0.8424874,0.0000018398,0.15542848,0.00018871961,0.00013473566,0.00027617026,0.000050380087,0.000025958263,0.001406302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969954,0.00007363652,0.00030350307,0.0006451238,0.00023882877,0.0017434916],"domain_scores_gemma":[0.9987987,0.00038049117,0.0001627903,0.00026377893,0.00009803255,0.00029617903],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005370152,0.0002687807,0.0002786145,0.00026062308,0.00070869015,0.00023798972,0.00062813365,0.00014258348,0.0000025795698],"category_scores_gemma":[0.0004248824,0.00028971155,0.00013180145,0.0004875817,0.00004884157,0.00030244462,0.00013795387,0.00064005103,0.0000027741366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008507612,0.00009365027,0.0044881236,0.00009189433,0.000086628424,0.000014976374,0.0010483564,0.90450656,0.0005804773,0.0032180604,0.00017095018,0.08561521],"study_design_scores_gemma":[0.0014702356,0.000038236136,0.006975701,0.00011009121,0.000029078024,0.0000034884004,0.000045822668,0.9849408,0.0038652986,0.00045746812,0.0017582591,0.00030550038],"about_ca_topic_score_codex":0.00001050919,"about_ca_topic_score_gemma":5.8547516e-7,"teacher_disagreement_score":0.83034265,"about_ca_system_score_codex":0.0003317607,"about_ca_system_score_gemma":0.00041378915,"threshold_uncertainty_score":0.9999555},"labels":[],"label_agreement":null},{"id":"W7115813499","doi":"","title":"Knowledge Engineering Tools and Techniques for AI Planning","year":2020,"lang":"en","type":"article","venue":"Huddersfield Research Portal (University of Huddersfield)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Domain (mathematical analysis); Domain engineering; Domain knowledge; Expert system; Knowledge representation and reasoning; Legal expert system; Subject-matter expert; Knowledge engineering; Automated planning and scheduling","score_opus":0.12277282846238341,"score_gpt":0.32543968768194137,"score_spread":0.20266685921955796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7115813499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003564099,0.00081695575,0.8082664,0.010304069,0.00008394743,0.00046874347,0.000013482499,0.00028649726,0.17940347],"genre_scores_gemma":[0.94874746,0.00004600877,0.050587855,0.00029872314,0.000087827975,0.0000025353945,0.000008859682,0.000012383099,0.00020833708],"study_design_codex":"not_applicable","study_design_gemma":"qualitative","domain_scores_codex":[0.99859864,0.00006699105,0.00015494233,0.000442036,0.0002797136,0.00045770968],"domain_scores_gemma":[0.99845654,0.000751193,0.00006430702,0.00026386196,0.00021451988,0.00024956153],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006094084,0.00014626597,0.0002471954,0.00023041027,0.00035771012,0.00011011833,0.0007383792,0.0001971072,0.0025676847],"category_scores_gemma":[0.00026201038,0.00017462015,0.00009922908,0.00039509614,0.00010984104,0.00064387737,0.0003951487,0.0005802319,0.000005554972],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004272132,0.000025730415,0.00024040359,0.00024999958,0.00004720908,0.00009408879,0.0075206175,0.00008317117,0.0018713588,0.010087386,0.96473616,0.015001133],"study_design_scores_gemma":[0.0016843576,0.0021390938,0.00003417924,0.0006545976,0.000045567114,0.0000433579,0.79473376,0.17541872,0.012482887,0.0022732264,0.0094949305,0.0009953375],"about_ca_topic_score_codex":0.000049306833,"about_ca_topic_score_gemma":0.000007698523,"teacher_disagreement_score":0.95524126,"about_ca_system_score_codex":1.671663e-7,"about_ca_system_score_gemma":0.00014006956,"threshold_uncertainty_score":0.9983441},"labels":[],"label_agreement":null},{"id":"W7117668024","doi":"10.1109/ms.2025.3624446","title":"AIware in the Foundation Model Era","year":2025,"lang":"","type":"article","venue":"IEEE Software","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; York University","funders":"","keywords":"Foundation (evidence); Software; Software development; Interface (matter); Social software engineering; Center (category theory)","score_opus":0.02332575948266387,"score_gpt":0.2783019592389995,"score_spread":0.2549761997563356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117668024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015314348,0.0009687066,0.9753768,0.004993126,0.0016063837,0.00038931757,0.000014817802,0.00017598167,0.0011605407],"genre_scores_gemma":[0.95763993,0.000041643412,0.036017496,0.004307303,0.00011315339,0.000050759434,0.0000192796,0.0000146254,0.0017957803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748534,0.0003147893,0.0004994751,0.00067903666,0.00044481343,0.0005765529],"domain_scores_gemma":[0.99792874,0.00068816694,0.00014833613,0.0010167488,0.00015841682,0.000059618236],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011683865,0.00030389766,0.00026354822,0.0002714338,0.0010073404,0.00053916516,0.0017147679,0.00021734562,0.000025294004],"category_scores_gemma":[0.0002462287,0.0002587035,0.00012351976,0.0013769127,0.00008521016,0.0005931062,0.00023137068,0.0008186501,0.00010347894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039967937,0.00019528627,0.016838312,0.00034844235,0.000046304005,0.000067236004,0.028147679,0.53124523,0.000026666356,0.0077823,0.020127751,0.39513484],"study_design_scores_gemma":[0.00051216676,0.000057795,0.0028913582,0.00080449827,0.000028615197,0.0000069515345,0.00012932981,0.9643171,0.00008643784,0.026782455,0.004033495,0.00034982045],"about_ca_topic_score_codex":0.00015428798,"about_ca_topic_score_gemma":0.000070590926,"teacher_disagreement_score":0.9423256,"about_ca_system_score_codex":0.00013594687,"about_ca_system_score_gemma":0.000875383,"threshold_uncertainty_score":0.9999865},"labels":[],"label_agreement":null},{"id":"W7124144430","doi":"10.65109/cnvj1841","title":"Stratified tree search: a novel suboptimal heuristic search algorithm","year":2013,"lang":"","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Alberta","funders":"","keywords":"Beam search; Incremental heuristic search; Heuristics; Heuristic; Benchmark (surveying); Partition (number theory); Null-move heuristic; Search algorithm; Consistent heuristic","score_opus":0.05923169961973687,"score_gpt":0.27304921769202245,"score_spread":0.21381751807228558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124144430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011976095,0.00041836512,0.9615363,0.0036596758,0.00069604325,0.0009336267,0.00004405607,0.0003544566,0.020381363],"genre_scores_gemma":[0.56280553,0.000025247375,0.4214828,0.00048457773,0.00035241997,0.00003926262,0.0000245681,0.00004755523,0.014738008],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99341035,0.00039509014,0.00095297815,0.0015915397,0.0015125729,0.0021374633],"domain_scores_gemma":[0.99567145,0.0009560294,0.00014521528,0.0015083287,0.00071327324,0.0010056795],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0017656067,0.00068764965,0.00061962684,0.00040165827,0.00087932096,0.00270765,0.0023312238,0.00036799326,0.0032895012],"category_scores_gemma":[0.00009295031,0.0006450977,0.00024880347,0.001312914,0.00036181213,0.0014189429,0.00089094345,0.0014317987,0.003988767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003324001,0.0008327306,0.0009952937,0.0002459,0.00021181258,0.00017353406,0.0064143753,0.009801586,0.0039191074,0.0120546,0.012972896,0.95234495],"study_design_scores_gemma":[0.0010430283,0.0007770082,0.0035755946,0.00016937453,0.00002475414,0.000092042224,0.00035609724,0.9906434,0.0017112273,0.00039785204,0.00038492278,0.0008247021],"about_ca_topic_score_codex":0.0046985247,"about_ca_topic_score_gemma":0.00003992441,"teacher_disagreement_score":0.9808418,"about_ca_system_score_codex":0.00013446114,"about_ca_system_score_gemma":0.0011785624,"threshold_uncertainty_score":0.99960005},"labels":[],"label_agreement":null},{"id":"W7124150245","doi":"10.65109/qdhn7183","title":"Horde: a scalable real-time architecture for learning knowledge from unsupervised sensorimotor interaction","year":2011,"lang":"","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Alberta","funders":"","keywords":"Function (biology); Scalability; Architecture; Reinforcement learning; Unsupervised learning; Modular design; Robot; Robot learning; Knowledge base","score_opus":0.03680411874919918,"score_gpt":0.25780516802890835,"score_spread":0.22100104927970918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124150245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08094847,0.000753398,0.84617466,0.00041909,0.0021829307,0.0011277513,0.00005510816,0.00092947035,0.06740912],"genre_scores_gemma":[0.5535154,0.00013128,0.41750762,0.00020055771,0.0010839512,0.000105412204,0.00013172845,0.00013198404,0.027192084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99585134,0.00057476223,0.0007771414,0.0014223586,0.00030181697,0.0010725898],"domain_scores_gemma":[0.9965485,0.0013944155,0.00036341694,0.00087451295,0.00040023736,0.00041894798],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00091509474,0.00064428494,0.0006570825,0.0003266269,0.0008758529,0.0004850616,0.001041234,0.0004262799,0.0022031595],"category_scores_gemma":[0.00025224686,0.00062106014,0.00034995133,0.000616723,0.00009885922,0.00072067743,0.00038196958,0.000966714,0.0011963698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021241587,0.0013436596,0.0069075185,0.0006844542,0.0008757621,0.000076115364,0.12415683,0.0072066295,0.042404905,0.0025773293,0.02305715,0.7885855],"study_design_scores_gemma":[0.0016232415,0.0014562941,0.0009116112,0.00079648895,0.00014590664,0.000023234692,0.00043358293,0.942829,0.010867222,0.0021816767,0.03760149,0.0011302418],"about_ca_topic_score_codex":0.0026917916,"about_ca_topic_score_gemma":0.00007024415,"teacher_disagreement_score":0.9356224,"about_ca_system_score_codex":0.00013877828,"about_ca_system_score_gemma":0.00034682927,"threshold_uncertainty_score":0.9996241},"labels":[],"label_agreement":null},{"id":"W7124164380","doi":"10.65109/cehc2496","title":"On Ability to Autonomously Execute Agent Programs with Sensing","year":2004,"lang":"","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Process (computing); Field (mathematics); Software; Action (physics); Troubleshooting; Automation","score_opus":0.020369989590717907,"score_gpt":0.24010234744034736,"score_spread":0.21973235784962947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124164380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24745183,0.000042525164,0.73868734,0.005514414,0.0005058589,0.0009206878,0.0000023356365,0.00049244234,0.006382595],"genre_scores_gemma":[0.72452265,0.0000012136085,0.27255642,0.0021441448,0.00007538926,0.000008243235,0.0000037769587,0.000025267318,0.00066291366],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959728,0.00014560332,0.00055393577,0.0014860305,0.0007070169,0.0011346071],"domain_scores_gemma":[0.997374,0.00014619254,0.00017442986,0.001410842,0.00021165417,0.0006829094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009773502,0.0005443528,0.0004264339,0.00016434873,0.00060756266,0.0009582176,0.0007490505,0.00015993114,0.000042706448],"category_scores_gemma":[0.000050851035,0.0004435641,0.00012991267,0.0010002621,0.00013181295,0.00036075845,0.00029355774,0.0005052925,0.0005128809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023719367,0.0007361176,0.0008680816,0.00015017566,0.00008729221,0.0005401076,0.018182876,0.28930384,0.00024958924,0.022243453,0.00053714943,0.6668641],"study_design_scores_gemma":[0.012211937,0.05625427,0.008502585,0.012959852,0.00040629684,0.0012932249,0.0016539643,0.8066168,0.024348248,0.038992617,0.025590397,0.011169838],"about_ca_topic_score_codex":0.0009272677,"about_ca_topic_score_gemma":0.00018167435,"teacher_disagreement_score":0.6556943,"about_ca_system_score_codex":0.00049624423,"about_ca_system_score_gemma":0.0007956196,"threshold_uncertainty_score":0.99980164},"labels":[],"label_agreement":null},{"id":"W7124167240","doi":"10.65109/ucpw5917","title":"On learning in agent-centered search","year":2010,"lang":"","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristic; Measure (data warehouse); Unification; Convergence (economics); Process (computing); Heuristics; Active learning (machine learning)","score_opus":0.033448501276898406,"score_gpt":0.27773945175472664,"score_spread":0.24429095047782823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124167240","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8300798,0.000105675834,0.1123148,0.0034055135,0.0025702887,0.00031888386,0.0000020273396,0.0002766774,0.05092635],"genre_scores_gemma":[0.98187655,0.000013748715,0.007937916,0.00059867307,0.00011740803,0.000004619636,0.000004482386,0.000019899306,0.009426695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699473,0.00033618568,0.00042680945,0.0008069444,0.0005263533,0.0009089643],"domain_scores_gemma":[0.9983753,0.00054441066,0.00008876325,0.0006524216,0.0000748975,0.00026422399],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0017359037,0.00028174056,0.0002567466,0.0003726398,0.00035204116,0.00053669774,0.0010736961,0.00023079904,0.0012355607],"category_scores_gemma":[0.00021162686,0.00027588438,0.0000948101,0.0006896106,0.00007736385,0.00033109434,0.0003820084,0.002714931,0.0013064351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018437453,0.0008761276,0.16239062,0.00016812125,0.00005443616,0.0006207157,0.016803749,0.051544543,0.010815645,0.09109597,0.0052827653,0.6601629],"study_design_scores_gemma":[0.0011424432,0.0006133701,0.010217404,0.00031733658,0.000004175135,0.000021111451,0.000117483774,0.97720563,0.0024138128,0.00072960876,0.0066842614,0.00053335587],"about_ca_topic_score_codex":0.00039826456,"about_ca_topic_score_gemma":0.0001598916,"teacher_disagreement_score":0.9256611,"about_ca_system_score_codex":0.00004829646,"about_ca_system_score_gemma":0.00025750636,"threshold_uncertainty_score":0.99996936},"labels":[],"label_agreement":null},{"id":"W7127292565","doi":"10.1109/icrae67496.2025.00016","title":"Unified Modelling of Intelligent Robotic Systems: Applications of COH/GISMOL in Automation Engineering","year":2025,"lang":"","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University","funders":"","keywords":"Robotics; Automation; Python (programming language); Intelligent decision support system; Model-driven architecture; Robot; Constraint (computer-aided design); Reinforcement learning","score_opus":0.024663492374009607,"score_gpt":0.24065045704091906,"score_spread":0.21598696466690945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7127292565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027798798,0.0020707794,0.99286276,0.0001221506,0.00032958196,0.00073390105,0.00000340878,0.00008987579,0.0010076609],"genre_scores_gemma":[0.9374298,0.00006606769,0.062071662,0.000012543045,0.000012437549,0.000055095363,0.000006584964,0.000008708348,0.0003371021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771476,0.000095799354,0.0012440337,0.00039203538,0.00026103316,0.00029231203],"domain_scores_gemma":[0.99828047,0.00047275904,0.00034241154,0.00061215373,0.00023455358,0.00005767455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008826246,0.0002083107,0.000462823,0.0007604561,0.000061005212,0.000073038,0.00064592384,0.00015709162,0.0000074857344],"category_scores_gemma":[0.000035212768,0.00023008564,0.000079608086,0.0018071227,0.00003684086,0.0002146331,0.00015255374,0.0002356741,0.0000049582945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039261113,0.00007323759,0.00043403314,0.00131769,0.000034427892,6.548849e-7,0.00094655115,0.8555393,0.00024448472,0.13767785,0.000012438123,0.0037154134],"study_design_scores_gemma":[0.00016574572,0.000038073304,0.00011495911,0.0021237265,0.000029282342,0.000001231451,0.00016821013,0.99369335,0.0028461018,0.00059011363,0.000063793515,0.00016541989],"about_ca_topic_score_codex":0.00089230674,"about_ca_topic_score_gemma":0.0000056251947,"teacher_disagreement_score":0.93464994,"about_ca_system_score_codex":0.00012316086,"about_ca_system_score_gemma":0.0003016865,"threshold_uncertainty_score":0.938262},"labels":[],"label_agreement":null},{"id":"W7128088185","doi":"10.1109/isse65546.2025.11369994","title":"A Systems Engineering Approach to High-Level Task Execution: A Case Study in Robotic Lawn Mowing Using LIMO and Gazebo","year":2025,"lang":"","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Queen's University","funders":"","keywords":"Interoperability; Task (project management); Context (archaeology); Robot; Software deployment; Plan (archaeology); System integration","score_opus":0.04976820733036529,"score_gpt":0.26589851478441784,"score_spread":0.21613030745405254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128088185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35601252,0.0011605542,0.6404509,0.0000843782,0.000851016,0.0010912545,0.0000031423035,0.00012009263,0.00022614881],"genre_scores_gemma":[0.9150677,0.0000034538114,0.08430839,0.000099583915,0.00009016552,0.00007144888,0.0000014557077,0.000025396477,0.0003324539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961094,0.0003385298,0.00094836595,0.0013107302,0.00038770636,0.0009052171],"domain_scores_gemma":[0.9982774,0.0003939829,0.00011970901,0.00078541617,0.000122021636,0.00030146234],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018281311,0.0005476533,0.0007727784,0.0009517005,0.0005324282,0.0013016433,0.00056021084,0.00020143739,0.0000018257905],"category_scores_gemma":[0.00011163393,0.0005812823,0.00006671697,0.0024087315,0.000032075626,0.0006036981,0.00079964084,0.00058036076,0.000004231495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014288887,0.00034115775,0.006941026,0.00059240346,0.00010214654,0.0019193132,0.011045825,0.97335625,0.0001951484,0.0040071136,0.000040013547,0.0014452927],"study_design_scores_gemma":[0.0010766792,0.0002095361,0.0011524097,0.0015410483,0.0000891114,0.001351381,0.00492383,0.9890181,0.000019453382,0.00001477027,0.000018781018,0.00058491254],"about_ca_topic_score_codex":0.012653001,"about_ca_topic_score_gemma":0.00010966427,"teacher_disagreement_score":0.55905515,"about_ca_system_score_codex":0.0003437536,"about_ca_system_score_gemma":0.00031340632,"threshold_uncertainty_score":0.9997351},"labels":[],"label_agreement":null},{"id":"W7128867818","doi":"","title":"Multi-Agentic Retriever (MAR): Redefining Information Retriever in the Era of AI agents","year":2025,"lang":"es","type":"dissertation","venue":"Digital Library of the University of Innsbruck (University of Innsbruck)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Flexibility (engineering); Key (lock); Component (thermodynamics); Labrador Retriever; Isolation (microbiology); Plan (archaeology); Conjunction (astronomy)","score_opus":0.010901991269358249,"score_gpt":0.1867431558238747,"score_spread":0.17584116455451645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128867818","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97348577,0.0003363264,0.0070676426,0.0019254284,0.00063060597,0.0009855855,0.0018659233,0.00008333192,0.013619376],"genre_scores_gemma":[0.9879887,0.0001976491,0.0065876707,0.00017897587,0.000011811895,7.922765e-8,0.00094942277,0.000017637745,0.004068046],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9968014,0.00037677193,0.0008407013,0.00052310736,0.0010206411,0.00043738147],"domain_scores_gemma":[0.9954106,0.0005362775,0.0022932028,0.001185251,0.0004750032,0.00009963138],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054382836,0.00048674896,0.0009667595,0.0009306195,0.0005174002,0.00012834683,0.00473972,0.00056761975,0.00012811218],"category_scores_gemma":[0.00023023986,0.00050244294,0.0006823816,0.0031709305,0.00064186234,0.0065310854,0.0013621999,0.0011947515,0.000017163651],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007776425,0.0027766526,0.5309782,0.01474729,0.0026621416,0.00027008707,0.2577317,0.011018463,0.00079364784,0.027002674,0.08107221,0.06317049],"study_design_scores_gemma":[0.010755439,0.0013832006,0.7684014,0.024613518,0.0010237314,0.000024817373,0.0946585,0.05407091,0.0041668382,0.002446425,0.035864502,0.002590704],"about_ca_topic_score_codex":0.0011727252,"about_ca_topic_score_gemma":0.000054098346,"teacher_disagreement_score":0.2374232,"about_ca_system_score_codex":0.00009981709,"about_ca_system_score_gemma":0.0010707609,"threshold_uncertainty_score":0.99974275},"labels":[],"label_agreement":null},{"id":"W7131388878","doi":"10.1109/aicare66005.2025.11402806","title":"VOX: real-time AI Translator","year":2025,"lang":"","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Machine translation; Bridge (graph theory); Process (computing); Complement (music); Translation (biology); Speech processing; Key (lock)","score_opus":0.008280805568979524,"score_gpt":0.2545367077805154,"score_spread":0.24625590221153587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7131388878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023915914,0.0011235148,0.7348448,0.02176734,0.0013817492,0.0002977287,0.000011573363,0.0005487279,0.23763296],"genre_scores_gemma":[0.6640907,0.00023612611,0.07883957,0.009343471,0.0002630249,0.000021811724,0.000013447059,0.000038043952,0.2471538],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971623,0.00020705827,0.000600789,0.0008995188,0.0003520732,0.0007782563],"domain_scores_gemma":[0.9981413,0.00037601514,0.00009369829,0.0010171176,0.00014830781,0.00022357963],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008302517,0.00037406184,0.00042426426,0.00027256622,0.00049659814,0.0006064376,0.0013315482,0.00027248714,0.0012917058],"category_scores_gemma":[0.000035325003,0.0003651462,0.00021229843,0.0012264465,0.000100134326,0.00053098454,0.00020417178,0.00047084517,0.0013101834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010128223,0.00033695283,0.0041089496,0.0004591419,0.0003412986,0.00013560425,0.0066987965,0.0025170476,0.0052525806,0.20477252,0.34756255,0.42771327],"study_design_scores_gemma":[0.0009897638,0.00024688157,0.0011869126,0.0007719233,0.00009025524,0.0000113601245,0.00002318325,0.8998181,0.004634936,0.008401596,0.08304249,0.00078257656],"about_ca_topic_score_codex":0.0005117287,"about_ca_topic_score_gemma":0.000013876964,"teacher_disagreement_score":0.8973011,"about_ca_system_score_codex":0.00005897682,"about_ca_system_score_gemma":0.0008408446,"threshold_uncertainty_score":0.9998801},"labels":[],"label_agreement":null},{"id":"W7131453612","doi":"10.1109/icamac67779.2025.11398733","title":"CodeSync: Multi-Agent System for Programming Assistance and Deterministic Thinking","year":2025,"lang":"","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Algoma University","funders":"","keywords":"Python (programming language); Benchmark (surveying); Cognitive architecture; Facilitator; Software; Commonsense reasoning; Automated reasoning; Architecture; Model-based reasoning","score_opus":0.028268957902844935,"score_gpt":0.28642041069489493,"score_spread":0.25815145279205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7131453612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015721654,0.0038428206,0.9894713,0.00060621725,0.0018613699,0.0012532799,0.00001636293,0.00043364413,0.00094282185],"genre_scores_gemma":[0.5768596,0.000012281261,0.4202097,0.00023780118,0.000048655667,0.00011471787,0.0000035333985,0.000015481304,0.002498208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966882,0.00017375188,0.00078866817,0.0011506261,0.00031575636,0.00088303036],"domain_scores_gemma":[0.9975325,0.0010443222,0.00030999864,0.0006792251,0.00023073012,0.00020323778],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017001266,0.00044470385,0.00053887884,0.00020626922,0.0015357113,0.0017411278,0.0009066811,0.00022394628,0.0000032134164],"category_scores_gemma":[0.00020122122,0.00042991174,0.00014704003,0.0005065705,0.00013022672,0.00033502452,0.0004421852,0.00029897102,0.000008211035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093005205,0.00019506032,0.008283711,0.007910924,0.0002492663,0.000106543506,0.004699755,0.0008871466,0.00014346646,0.1315826,0.00071337086,0.84513515],"study_design_scores_gemma":[0.0012931882,0.00023271533,0.00068706914,0.0045224344,0.00014849761,0.000031901214,0.0006180367,0.973233,0.00037712374,0.0003190564,0.017969852,0.00056711776],"about_ca_topic_score_codex":0.00006005706,"about_ca_topic_score_gemma":0.00004634788,"teacher_disagreement_score":0.9723459,"about_ca_system_score_codex":0.00020385958,"about_ca_system_score_gemma":0.00038890544,"threshold_uncertainty_score":0.9998153},"labels":[],"label_agreement":null},{"id":"W7131998979","doi":"","title":"Enhancing the planning capabilities of large language models by building external world models","year":2025,"lang":"en","type":"article","venue":"NPARC","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Benchmark (surveying); Core (optical fiber); Baseline (sea); Plan (archaeology); Automated planning and scheduling; Language model","score_opus":0.012965203472718675,"score_gpt":0.2652528341959908,"score_spread":0.25228763072327215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7131998979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08871708,0.001505327,0.8925305,0.00044847606,0.00015290035,0.000094274445,0.000011576986,0.00010981557,0.01643005],"genre_scores_gemma":[0.9393046,0.0000036248916,0.05835461,0.0004075732,0.000031612115,0.000014291644,0.0000018826873,0.000007806668,0.001873994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986451,0.00012880542,0.000305918,0.00029200385,0.0002561742,0.0003719456],"domain_scores_gemma":[0.99880916,0.0005096236,0.00010656234,0.00048166965,0.000049779715,0.00004318684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010377112,0.00014220059,0.00019535504,0.00013693767,0.00024412676,0.00011350536,0.000859425,0.00004584912,0.000017905002],"category_scores_gemma":[0.00003509808,0.00011168672,0.00006955772,0.0003589264,0.000042789354,0.0004404095,0.00026404293,0.00026018135,0.0000014892067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018400862,0.00006584368,0.00075758575,0.00021265696,0.00006275508,0.000016784295,0.032086827,0.13962975,0.16843389,0.64228684,0.0074602906,0.008968364],"study_design_scores_gemma":[0.00019257529,0.000016290682,0.000019018858,0.00053232606,0.0000090736985,0.00000237142,0.0005579301,0.7852533,0.059402384,0.1536062,0.00026676347,0.00014178177],"about_ca_topic_score_codex":0.000106558764,"about_ca_topic_score_gemma":0.000015760768,"teacher_disagreement_score":0.85058755,"about_ca_system_score_codex":0.00003767561,"about_ca_system_score_gemma":0.00008730866,"threshold_uncertainty_score":0.45544523},"labels":[],"label_agreement":null},{"id":"W7132919007","doi":"","title":"Generalization in Planning","year":2022,"lang":"","type":"dissertation","venue":"TSpace","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Generalization; Leverage (statistics); Automated planning and scheduling; Action (physics); Automation; State (computer science)","score_opus":0.032395165505725555,"score_gpt":0.35631301114296743,"score_spread":0.32391784563724185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132919007","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6828454,0.020933436,0.2271155,0.0020609293,0.010777258,0.0015834635,0.000019720193,0.0006846044,0.05397966],"genre_scores_gemma":[0.9054573,0.000244646,0.017628854,0.00084504567,0.00043695877,0.00022847489,0.0028177828,0.00015716955,0.07218373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964638,0.00045974326,0.0006225635,0.001031405,0.0007223296,0.0007002085],"domain_scores_gemma":[0.99832964,0.00023340672,0.0005551984,0.0006534614,0.00009208445,0.00013621736],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009690776,0.0004856647,0.00047619958,0.00068314833,0.00063256867,0.00035499476,0.0011216361,0.00031812303,0.0012299373],"category_scores_gemma":[0.00009140195,0.0006137125,0.00011908284,0.0015932373,0.000021249984,0.00035088745,0.00021902188,0.0011249464,0.00006825891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013158463,0.00015196294,0.018239949,0.00046654482,0.000055473258,0.00044880033,0.33934662,0.61212236,0.0010815065,0.006866864,0.006260611,0.014827719],"study_design_scores_gemma":[0.0011351393,0.00039636513,0.01049737,0.0015283418,0.000056882935,0.000033203254,0.01647282,0.9219911,0.0010422738,0.0008578082,0.044142082,0.0018465768],"about_ca_topic_score_codex":0.0015626858,"about_ca_topic_score_gemma":0.00010726137,"teacher_disagreement_score":0.3228738,"about_ca_system_score_codex":0.00028711694,"about_ca_system_score_gemma":0.0005765635,"threshold_uncertainty_score":0.9996831},"labels":[],"label_agreement":null},{"id":"W7132963019","doi":"","title":"Probabilistic planning with constraint satisfaction techniques","year":2003,"lang":"","type":"dissertation","venue":"TSpace","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bank of Canada","funders":"","keywords":"Probabilistic logic; Reachability; Constraint (computer-aided design); Abstraction; Probabilistic relevance model; Constraint satisfaction problem; Constraint satisfaction; Probabilistic CTL","score_opus":0.023949940081326976,"score_gpt":0.31422422569165415,"score_spread":0.2902742856103272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132963019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1670928,0.001978868,0.7677887,0.00064027385,0.0017643112,0.002662568,0.00001728039,0.0014219285,0.056633268],"genre_scores_gemma":[0.8122699,0.000054900982,0.17560932,0.00028016305,0.00018739408,0.0002533182,0.00024925626,0.00013791618,0.010957833],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959932,0.0003487737,0.0006475652,0.0013630125,0.0007729974,0.0008744831],"domain_scores_gemma":[0.99706876,0.0004066267,0.000914642,0.00089542114,0.0004345731,0.0002799978],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008545299,0.0008623425,0.00071326114,0.00036754695,0.0007725607,0.000667805,0.0005841952,0.0006245045,0.00019335213],"category_scores_gemma":[0.00017500354,0.0008158677,0.00013107111,0.0007774311,0.00019688717,0.0004123657,0.000049784972,0.001333966,0.0000634265],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016990817,0.00073126674,0.049286287,0.008837584,0.0014451847,0.002005714,0.24170992,0.048180953,0.008840836,0.114686325,0.010378036,0.5121988],"study_design_scores_gemma":[0.011223502,0.027813014,0.070370056,0.12994522,0.004515847,0.007298066,0.13305892,0.3104299,0.16353913,0.032114536,0.071417116,0.038274705],"about_ca_topic_score_codex":0.0006478307,"about_ca_topic_score_gemma":0.00010634847,"teacher_disagreement_score":0.64517707,"about_ca_system_score_codex":0.0002713834,"about_ca_system_score_gemma":0.001228218,"threshold_uncertainty_score":0.9994292},"labels":[],"label_agreement":null},{"id":"W7133334912","doi":"10.1109/cins67018.2025.11412089","title":"Knowledge Assistant for Joint Utility: A Multi-Agent LLM-Driven Conversational System for Automated Task Execution","year":2025,"lang":"","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Task (project management); Workflow; Joint (building); Code (set theory); Software; Natural language; Terminal (telecommunication); Architecture; System integration; Natural language understanding","score_opus":0.058694839365292455,"score_gpt":0.3075966371326188,"score_spread":0.24890179776732635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133334912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00066120154,0.0010102578,0.987319,0.0011477915,0.0038435904,0.0030768053,0.00047257514,0.0013829353,0.0010858546],"genre_scores_gemma":[0.8294483,0.0000045218762,0.1657854,0.00020701613,0.000099178986,0.0005216379,0.00015815263,0.000022298338,0.003753521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959723,0.0003059952,0.0012459,0.0012837775,0.00032819062,0.00086385006],"domain_scores_gemma":[0.99621385,0.0012101696,0.00044724406,0.0007309746,0.0011582212,0.00023955603],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019363366,0.0005047989,0.000677138,0.0004017274,0.0011395339,0.0005404124,0.0007198054,0.00035816582,0.000031396972],"category_scores_gemma":[0.00031048225,0.00049819495,0.00046472272,0.0007082064,0.00012301709,0.00037556654,0.00031263594,0.00021890845,0.00005800761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021257047,0.0061355513,0.003569445,0.037084486,0.004076763,0.000050283415,0.026182275,0.12385229,0.009061887,0.33737153,0.29355597,0.1569338],"study_design_scores_gemma":[0.0031458118,0.00034025658,0.0009927083,0.0015954659,0.00018698476,0.00000473764,0.00047944125,0.9656588,0.0014269662,0.00013365851,0.025551915,0.00048329736],"about_ca_topic_score_codex":0.000080524245,"about_ca_topic_score_gemma":0.00003472462,"teacher_disagreement_score":0.8418065,"about_ca_system_score_codex":0.0008414749,"about_ca_system_score_gemma":0.0017895406,"threshold_uncertainty_score":0.999747},"labels":[],"label_agreement":null},{"id":"W7154011472","doi":"10.1145/3772318.3809042","title":"10.1145/3772318.3809042","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Sensemaking; Debriefing; Context (archaeology)","score_opus":0.005834325215430187,"score_gpt":0.16967938095005278,"score_spread":0.1638450557346226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7154011472","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002623866,0.000102432474,0.0011853433,0.00093777775,0.000006821597,0.00009638087,0.0000038736957,0.0004088895,0.9969961],"genre_scores_gemma":[0.00051071635,1.9090386e-7,0.008055631,0.00025595276,0.00008077429,0.000008319382,0.0000052907685,0.000010838675,0.9910723],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989855,0.00004799026,0.00014640673,0.00030584197,0.00019122144,0.0003229874],"domain_scores_gemma":[0.99921715,0.00008411437,0.000025701109,0.00048143495,0.00003128929,0.00016032491],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00023443886,0.00012560503,0.00012564201,0.00007071126,0.0001345482,0.00013622492,0.0007058421,0.000052190207,0.908263],"category_scores_gemma":[0.000018619045,0.00012264874,0.00004461702,0.00032332062,0.0000143746,0.00020979097,0.00008359166,0.000110899105,0.965225],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009353913,0.000016035285,7.9401144e-7,0.0000032064152,0.00000598859,0.000013086329,0.000066231674,0.0011126159,0.00002491488,0.000026322263,0.18062171,0.81809974],"study_design_scores_gemma":[0.000109112436,0.00011329754,0.000027351694,0.000028777358,0.000003117189,0.000011996232,2.0421183e-7,0.015705848,0.00008286301,0.000053636883,0.98368776,0.00017606078],"about_ca_topic_score_codex":0.000024675579,"about_ca_topic_score_gemma":6.512893e-8,"teacher_disagreement_score":0.81792367,"about_ca_system_score_codex":0.000021021826,"about_ca_system_score_gemma":0.00004319315,"threshold_uncertainty_score":0.50014704},"labels":[],"label_agreement":null},{"id":"W77804182","doi":"","title":"World Models, Action Selection, Embodied Concept Formation, and Conditioning.","year":2004,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Creatures; Computer science; Action selection; Embodied cognition; Selection (genetic algorithm); Matching (statistics); Artificial intelligence; Computational model; Action (physics); Conditioning; Cognitive science; Human–computer interaction; Machine learning; Mathematics; Psychology","score_opus":0.028310187302274137,"score_gpt":0.2502047301586161,"score_spread":0.22189454285634197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W77804182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040836846,0.00007909793,0.9831214,0.0012918178,0.000114896866,0.00008068933,0.000001497256,0.0003546665,0.010872278],"genre_scores_gemma":[0.93892884,0.000006028169,0.059535723,0.00061030325,0.000042068892,0.000008961904,0.000017157352,0.0000042724905,0.00084663153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935836,0.000023621731,0.0001492356,0.00018706216,0.0001222317,0.00015947317],"domain_scores_gemma":[0.9996341,0.00003882053,0.00006470237,0.00011229159,0.00008678425,0.000063301806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012473438,0.000085511885,0.00007671031,0.000116122676,0.00033139126,0.00018503373,0.00012180774,0.000035393474,0.00002522406],"category_scores_gemma":[0.000008514928,0.000081467166,0.000017495458,0.00030020296,0.000024018696,0.0015419461,0.000032055326,0.00010378212,0.000024558703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059527524,0.000029730107,0.00049283344,0.000020024727,0.000016853215,0.0000023053153,0.0033667188,0.16873862,0.00024363205,0.8068151,0.010776615,0.009491627],"study_design_scores_gemma":[0.0014684926,0.00014622197,0.000786284,0.0000946039,0.000012955985,0.00012998786,0.00029222027,0.72509265,0.009903267,0.25502813,0.006574227,0.00047099285],"about_ca_topic_score_codex":0.00010308762,"about_ca_topic_score_gemma":0.00009860508,"teacher_disagreement_score":0.93484515,"about_ca_system_score_codex":0.00005571875,"about_ca_system_score_gemma":0.00005335726,"threshold_uncertainty_score":0.33221346},"labels":[],"label_agreement":null},{"id":"W7981553","doi":"10.1111/j.1651-2227.1994.tb13146.x","title":"A Formal Definition of Object-Action Complexes and Examples at Different Levels of the Processing Hierarchy","year":2009,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Affordance; Object (grammar); Relation (database); Action (physics); Hierarchy; Function (biology); Space (punctuation); Process (computing); Measure (data warehouse); Reliability (semiconductor); Artificial intelligence; Theoretical computer science; Human–computer interaction; Data mining; Programming language","score_opus":0.055011814957135474,"score_gpt":0.26419229963346835,"score_spread":0.20918048467633288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7981553","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52517396,0.000036900565,0.47411227,0.00013346439,0.000058707385,0.00006498749,0.0000031035206,0.000018624964,0.00039798283],"genre_scores_gemma":[0.9700426,0.000010172358,0.029689677,0.00024401522,0.0000087761455,9.5220764e-7,0.0000013952805,6.412931e-7,0.000001759276],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99918324,0.000021971731,0.0002611974,0.00010586455,0.0002844017,0.00014330904],"domain_scores_gemma":[0.99940956,0.000052955966,0.00022004472,0.00014512762,0.00012964844,0.0000426958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003493587,0.00007257008,0.00010110427,0.00014367697,0.00040367732,0.00015970388,0.00029252056,0.000020943753,0.0000010513995],"category_scores_gemma":[0.000017248347,0.000048774775,0.000018026472,0.0003625506,0.00020843296,0.0045418134,0.00021049962,0.000055496814,3.9982405e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016271037,0.000025402958,0.006252214,0.00019025098,0.000003108653,1.0451755e-7,0.015597103,0.00057389366,0.011763743,0.0762169,0.000057856425,0.88930315],"study_design_scores_gemma":[0.0002572734,0.00016957652,0.6940444,0.00014144384,0.0000026489174,0.000029774772,0.000053319498,0.28872088,0.013118614,0.0031950504,0.00016500872,0.00010200477],"about_ca_topic_score_codex":0.0000048397824,"about_ca_topic_score_gemma":6.542829e-7,"teacher_disagreement_score":0.88920116,"about_ca_system_score_codex":0.000018185543,"about_ca_system_score_gemma":0.000047044363,"threshold_uncertainty_score":0.3292705},"labels":[],"label_agreement":null},{"id":"W85676387","doi":"10.1609/icaps.v19i1.13392","title":"Exploiting N-Gram Analysis to Predict Operator Sequences","year":2009,"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":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"n-gram; Gram; Computer science; Operator (biology); Planner; Set (abstract data type); Sequence (biology); Core (optical fiber); Artificial intelligence; Word (group theory); Data mining; Mathematics; Language model; Programming language","score_opus":0.03421742483727147,"score_gpt":0.2935455780116302,"score_spread":0.25932815317435876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W85676387","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.979518,0.00006627733,0.008600261,0.0054133795,0.00019505448,0.00012525143,0.000007648252,0.0005587175,0.005515435],"genre_scores_gemma":[0.9651989,0.0000056697027,0.034026515,0.0006432915,0.00004475923,0.000007050591,0.0000027013004,0.000004983198,0.00006617058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985056,0.000013112282,0.00033685256,0.00040699675,0.00049420487,0.00024321215],"domain_scores_gemma":[0.9990863,0.00008193374,0.00023725367,0.000114061266,0.000369975,0.00011043939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000583644,0.00017857166,0.00023141144,0.00034891668,0.00024680383,0.00056747417,0.0012036213,0.00007159189,0.0000067863593],"category_scores_gemma":[0.00027907616,0.00013614268,0.00007923365,0.0007249009,0.000030673473,0.00039951457,0.00015891949,0.00024183837,0.0000034665786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022452418,0.00023844893,0.20397143,0.00010519893,0.001562007,0.000026170379,0.01868263,0.19255823,0.21915236,0.33844844,0.0015504328,0.023480127],"study_design_scores_gemma":[0.0001490597,0.00014311785,0.009315525,0.0007000761,0.00004306228,0.00001185314,0.00045848306,0.97396874,0.0133559145,0.0016257972,0.000031097585,0.00019728475],"about_ca_topic_score_codex":0.00002091109,"about_ca_topic_score_gemma":4.2961787e-7,"teacher_disagreement_score":0.7814105,"about_ca_system_score_codex":0.000033502645,"about_ca_system_score_gemma":0.00006204472,"threshold_uncertainty_score":0.55517375},"labels":[],"label_agreement":null},{"id":"W90402225","doi":"10.1007/978-3-642-30353-1_2","title":"Macro Learning in Planning as Parameter Configuration","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Macro; Computer science; Domain (mathematical analysis); Set (abstract data type); Task (project management); Planner; Scheme (mathematics); Artificial intelligence; Theoretical computer science; Mathematical optimization; Machine learning; Algorithm; Programming language; Mathematics","score_opus":0.02225879861836087,"score_gpt":0.2604515108487879,"score_spread":0.23819271223042707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W90402225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063075026,0.0013283648,0.9896267,0.00048091076,0.0010979115,0.00027041035,0.0000010257153,0.00022175652,0.0063421694],"genre_scores_gemma":[0.80161893,0.000027899474,0.19550857,0.0015177648,0.0004554574,0.000013213359,0.000017208411,0.00004577055,0.00079515565],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99637485,0.00009189866,0.00057809276,0.0012328244,0.0008003845,0.0009219769],"domain_scores_gemma":[0.9973817,0.0011982296,0.00035042077,0.00076511136,0.00011797121,0.00018656354],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015970946,0.00051592954,0.0005023413,0.0009773222,0.00030035785,0.00064661074,0.0018890868,0.00042316515,0.000048854403],"category_scores_gemma":[0.00022850672,0.00050393434,0.0000944912,0.00055916654,0.0002806116,0.0009143024,0.00059812295,0.0017348989,0.00013867168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011415091,0.000020194404,0.0026550142,0.0000482775,0.00000937359,0.00021183425,0.0046000225,0.25071365,0.00020070068,0.010914514,0.00002473116,0.7305903],"study_design_scores_gemma":[0.00048368046,0.00031762192,0.0010210105,0.001527027,0.000010573451,0.00018304463,0.0000010359507,0.886407,0.0019791187,0.100438096,0.0062454804,0.0013862974],"about_ca_topic_score_codex":0.000066804714,"about_ca_topic_score_gemma":0.000019099787,"teacher_disagreement_score":0.8009882,"about_ca_system_score_codex":0.0002641525,"about_ca_system_score_gemma":0.00045908298,"threshold_uncertainty_score":0.99974126},"labels":[],"label_agreement":null},{"id":"W90570093","doi":"10.5555/2349508.2349561","title":"Multi-understanding: a basis for switchable understanding for agents","year":2009,"lang":"en","type":"article","venue":"Summer Computer Simulation Conference","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Cognition; Feature (linguistics); Cognitive science; Management science; Engineering; Psychology","score_opus":0.3132119342003629,"score_gpt":0.35347144902462185,"score_spread":0.040259514824258935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W90570093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036215296,0.000036715748,0.9959733,0.001649224,0.00065297814,0.0007965438,0.00001982025,0.00031165927,0.00019763787],"genre_scores_gemma":[0.6773489,0.0000016497154,0.32156298,0.0008081359,0.00010778657,0.000020612724,0.000025789504,0.000011968487,0.000112170776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802184,0.000059867154,0.00041620192,0.0006854313,0.00025996316,0.00055672234],"domain_scores_gemma":[0.99799055,0.00097025826,0.0002142225,0.00044648745,0.00022049721,0.00015800599],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049329957,0.00028108404,0.00029874218,0.000221209,0.0005734195,0.0005801806,0.0006547393,0.00013109755,0.0000136898425],"category_scores_gemma":[0.000062566025,0.00029179073,0.0001539866,0.0003026439,0.000027780186,0.00069426023,0.00007959517,0.00012812737,0.000008239598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014125224,0.00023739476,0.001975543,0.00015028735,0.000119752774,0.000006755824,0.005002711,0.54208857,0.00025622913,0.41307056,0.0061586658,0.030792274],"study_design_scores_gemma":[0.0013193801,0.0002846944,0.00033545875,0.00013554496,0.000016724109,0.0000012899712,0.00007760627,0.9593732,0.00008442343,0.035689067,0.002317824,0.00036482018],"about_ca_topic_score_codex":0.000009487003,"about_ca_topic_score_gemma":0.000008010969,"teacher_disagreement_score":0.67698675,"about_ca_system_score_codex":0.0002794812,"about_ca_system_score_gemma":0.00014050776,"threshold_uncertainty_score":0.99995345},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.10440194197137592,"score_gpt":0.24416489930106636,"score_spread":0.13976295732969043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W92128319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03478708,0.00014005322,0.96116096,0.00008902874,0.0002660012,0.0002243963,0.000005837562,0.00024112515,0.003085532],"genre_scores_gemma":[0.6598579,0.0000026604796,0.3386531,0.00031736575,0.000036173336,0.00004229894,0.000006945972,0.000013507965,0.0010700146],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882376,0.000046589026,0.00017502933,0.00038809647,0.00016263819,0.0004038999],"domain_scores_gemma":[0.99901813,0.00035700863,0.00008849844,0.0004186042,0.000006858336,0.00011089629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031272875,0.00016880308,0.00016359691,0.0000694408,0.00021750545,0.00007587407,0.0006678712,0.00008304767,0.000046021996],"category_scores_gemma":[0.00003684244,0.00014599427,0.00007653919,0.00009276134,0.000022991315,0.0002686396,0.000117306925,0.00009156905,0.000053661774],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027953042,0.00026466628,0.9075016,0.000062664876,0.00020660428,0.000084102016,0.017050242,0.0032602297,0.0025338018,0.017731862,0.018500332,0.032524407],"study_design_scores_gemma":[0.0076002697,0.0008292522,0.19516462,0.00095495756,0.00014303374,0.00007803818,0.00086071965,0.31773797,0.2750452,0.013132428,0.18410154,0.0043520094],"about_ca_topic_score_codex":0.00004500944,"about_ca_topic_score_gemma":0.0000020427947,"teacher_disagreement_score":0.71233696,"about_ca_system_score_codex":0.000021977557,"about_ca_system_score_gemma":0.000017263883,"threshold_uncertainty_score":0.59534734},"labels":[],"label_agreement":null},{"id":"W92970644","doi":"10.82308/16074","title":"Enhancing a theorem prover by delayed clause-construction and attribute sequences","year":2005,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Redundancy (engineering); Inference; Computer science; Algorithm; Resolution (logic); Gas meter prover; Pruning; Automated theorem proving; Search algorithm; Mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.010408045547062232,"score_gpt":0.21362469642929127,"score_spread":0.20321665088222904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W92970644","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98889756,0.0006628471,0.0029828916,0.00043400633,0.00047212886,0.00041332614,0.00024840797,0.00075519714,0.005133657],"genre_scores_gemma":[0.9350713,0.0000633489,0.063636556,0.0007051792,0.0000513486,0.000032419277,0.000021998303,0.00003458968,0.00038328883],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99700654,0.00031827815,0.0005453371,0.0009322486,0.00048554747,0.00071205717],"domain_scores_gemma":[0.9983136,0.00035201255,0.00028819803,0.00058510504,0.00015482017,0.00030625355],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013849221,0.00039629266,0.0003368304,0.00016714224,0.0012395845,0.00029150408,0.0007374763,0.0002589162,0.00003756422],"category_scores_gemma":[0.00023762435,0.00038227704,0.000098417804,0.0005228942,0.00012911913,0.0023681556,0.0003092082,0.00072032824,0.00010804878],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054199878,0.000085117455,0.0007319708,0.00007220192,0.00012767385,0.00004004954,0.00006662797,0.00029005262,0.188294,0.24562514,0.0000656502,0.5645473],"study_design_scores_gemma":[0.002106215,0.0006398355,0.0003504607,0.00057005114,0.00010568181,0.00076105155,0.0001688487,0.009330537,0.76881325,0.06257971,0.15236628,0.002208066],"about_ca_topic_score_codex":0.000146592,"about_ca_topic_score_gemma":0.00011742898,"teacher_disagreement_score":0.58051926,"about_ca_system_score_codex":0.00027004431,"about_ca_system_score_gemma":0.000049063874,"threshold_uncertainty_score":0.9998629},"labels":[],"label_agreement":null},{"id":"W941090075","doi":"10.1609/socs.v6i1.18356","title":"The Spurious Path Problem in Abstraction","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spurious relationship; Abstraction; Computer science; Path (computing); Heuristic; State (computer science); Semaphore; Algorithm; Artificial intelligence; Programming language; Machine learning","score_opus":0.010806567439150198,"score_gpt":0.24468284029385778,"score_spread":0.23387627285470758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W941090075","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8304629,0.0001580817,0.00025462825,0.071597286,0.011410374,0.00063076755,0.000008228554,0.00014002685,0.08533772],"genre_scores_gemma":[0.9983911,0.000039127037,0.0006181739,0.00010272679,0.00021294464,0.000020460637,0.0000013661156,0.000008876187,0.0006052406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981921,0.000027457909,0.00030445092,0.00029967347,0.000927597,0.00024872972],"domain_scores_gemma":[0.99875623,0.0003118506,0.00015473396,0.0001662927,0.0005663285,0.000044589942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010424725,0.000110421526,0.000108863715,0.000052336083,0.0002504796,0.00038178984,0.0016232291,0.000068886424,0.0000056136428],"category_scores_gemma":[0.00016782798,0.000075575794,0.000079629855,0.0003981427,0.000047834747,0.00028279744,0.00045653584,0.0004372664,0.000012223954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011892121,0.0002973662,0.012992877,0.00004081322,0.000048844813,0.000008207521,0.0009896695,0.0006652612,0.04313082,0.9343005,0.003052312,0.004354409],"study_design_scores_gemma":[0.0036032845,0.00061389006,0.022278713,0.0011678834,0.00001815279,0.00012528825,0.00044685343,0.032485407,0.5772693,0.30003658,0.06121606,0.00073857507],"about_ca_topic_score_codex":0.00013224031,"about_ca_topic_score_gemma":0.0000056765634,"teacher_disagreement_score":0.63426393,"about_ca_system_score_codex":0.0001872669,"about_ca_system_score_gemma":0.00014177112,"threshold_uncertainty_score":0.3681608},"labels":[],"label_agreement":null},{"id":"W96218255","doi":"","title":"Multiple pattern databases","year":2004,"lang":"en","type":"article","venue":"International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Database; Heuristic; Database theory; Spatiotemporal database; Table (database); Data mining; Database index; Database design; Information retrieval; Database testing; View; Artificial intelligence; Search engine indexing","score_opus":0.06923126931246268,"score_gpt":0.31966380106829917,"score_spread":0.25043253175583646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W96218255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34681815,0.00015069116,0.6435297,0.0027410479,0.00071010867,0.00009169312,0.000037187747,0.0016826882,0.0042387214],"genre_scores_gemma":[0.9534979,0.000010486435,0.04575404,0.00053323456,0.00006529952,0.000007903098,0.000076896984,0.000009698584,0.00004456373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987291,0.000038166992,0.00023476455,0.0004287689,0.00031115345,0.0002580183],"domain_scores_gemma":[0.99927783,0.00017060956,0.00011462346,0.00021857709,0.0001067983,0.000111590416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025576234,0.00018360747,0.0001456451,0.00018432774,0.00021195308,0.00036810138,0.0005285708,0.000060677063,0.000019304876],"category_scores_gemma":[0.00013611195,0.00017403581,0.000031904037,0.00011684735,0.0000341787,0.00040831394,0.0001407481,0.00027159558,0.000060942442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013655845,0.0003874721,0.11259546,0.00011077141,0.0003622887,0.0011660197,0.00880451,0.44167772,0.013683334,0.35399377,0.0008899357,0.06619215],"study_design_scores_gemma":[0.0007251328,0.00006708072,0.0036240276,0.0006915828,0.0000040612604,0.000060854396,0.00012899759,0.99116623,0.0017140502,0.0012773392,0.00027595364,0.00026471567],"about_ca_topic_score_codex":0.00014628713,"about_ca_topic_score_gemma":0.000004918665,"teacher_disagreement_score":0.60667974,"about_ca_system_score_codex":0.000038435082,"about_ca_system_score_gemma":0.000093409486,"threshold_uncertainty_score":0.7096974},"labels":[],"label_agreement":null}]}