{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044977535,0.010148079,0.020514272,0.0062276907,0.00075002667,0.00008154031,0.00040947023,0.00019191079,0.95717925],"genre_scores_gemma":[0.47764137,0.0154868085,0.03285985,0.0043319664,0.0012730573,0.00036681184,0.0016331756,0.0003668325,0.46604013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983626,0.0006322481,0.0000787602,0.0004206669,0.0003392,0.00016655844],"domain_scores_gemma":[0.9992481,0.0002510344,0.00006455119,0.00022356886,0.00012584998,0.000086828906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010939847,0.0005887064,0.0003968615,0.0015605747,0.0029605788,0.00628386,0.0008798619,0.0018787233,0.04104184],"category_scores_gemma":[0.0027084977,0.00034803676,0.0004071271,0.002241078,0.012339563,0.009656417,0.0035100104,0.0019743866,0.008703765],"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.000005334103,0.0000036836373,0.00013224696,0.00003006817,0.0000036549884,0.00002293593,0.001335428,0.000085112464,0.00006197138,0.9753235,0.010361945,0.012634128],"study_design_scores_gemma":[0.000004250037,0.0000061264996,0.00029946567,0.000073405456,0.000004616298,0.00011970245,0.0009262816,0.00013003258,0.000070269445,0.50030404,0.49805608,0.000005683843],"about_ca_topic_score_codex":0.0053354534,"about_ca_topic_score_gemma":0.003860746,"teacher_disagreement_score":0.04104184,"about_ca_system_score_codex":0.0030243895,"about_ca_system_score_gemma":0.0015441497,"threshold_uncertainty_score":0.13729864},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013214838,0.00016887211,0.98050034,0.00023901268,0.00001968756,0.00010448185,0.000081554506,0.0013714759,0.004299683],"genre_scores_gemma":[0.18987636,0.0002869865,0.807428,0.000103867686,0.000020973554,0.00027304003,0.00026425603,0.00011639919,0.0016300733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986405,0.00070156425,0.000083841616,0.00018260966,0.000287387,0.000104111474],"domain_scores_gemma":[0.9982424,0.0012272957,0.00011199865,0.000274191,0.00009831137,0.000045887682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013898205,0.0008225643,0.00048774574,0.0007269505,0.0005701782,0.0013296816,0.0011783055,0.0009392452,0.0026813757],"category_scores_gemma":[0.0036608237,0.0005998462,0.0009960273,0.0008054889,0.001876289,0.001984997,0.0016985274,0.001256618,0.00046996013],"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.00030428194,0.00014448505,0.00076043326,0.00034474072,0.00012468654,0.00046771453,0.00054390973,0.6217943,0.0072379624,0.20486985,0.004005442,0.1594023],"study_design_scores_gemma":[0.00009217973,0.000056855046,0.00010658521,0.00004244028,0.000041396073,0.00009888395,0.000090070665,0.8928712,0.004343444,0.096379764,0.005856485,0.000020634248],"about_ca_topic_score_codex":0.0036963439,"about_ca_topic_score_gemma":0.0055018174,"teacher_disagreement_score":0.0036963439,"about_ca_system_score_codex":0.0012711345,"about_ca_system_score_gemma":0.0017821556,"threshold_uncertainty_score":0.009222746},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008564669,0.00032008605,0.95722276,0.00050414697,0.00008683288,0.00019103188,0.00015898477,0.0018107565,0.031140745],"genre_scores_gemma":[0.3406239,0.0007292545,0.63723445,0.0003582545,0.000082355786,0.00042118234,0.0005525838,0.00057574676,0.019422298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789524,0.0007729509,0.00012560675,0.00048172404,0.0004971203,0.00022727749],"domain_scores_gemma":[0.99611276,0.0024207765,0.00021909598,0.00078939303,0.0003163472,0.00014162165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021349755,0.000994784,0.0005261264,0.0005113715,0.0013920028,0.0022295765,0.0014522887,0.0010502832,0.014214371],"category_scores_gemma":[0.009068165,0.000609598,0.0012845424,0.000654681,0.0030499857,0.0039018958,0.0031083908,0.0018224317,0.0018440034],"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.00024053061,0.000094487616,0.00078241195,0.0004284656,0.00009699067,0.00030198705,0.001221392,0.07915681,0.0034286422,0.7964796,0.006287631,0.11148103],"study_design_scores_gemma":[0.00006477032,0.0001154744,0.00014624183,0.00010187402,0.00006884476,0.00018617252,0.00026098682,0.108158536,0.007199164,0.8116021,0.07205733,0.000038550374],"about_ca_topic_score_codex":0.0027324765,"about_ca_topic_score_gemma":0.003510878,"teacher_disagreement_score":0.014214371,"about_ca_system_score_codex":0.0010247392,"about_ca_system_score_gemma":0.0022356862,"threshold_uncertainty_score":0.04755181},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050532077,0.0039876243,0.71234566,0.0025304975,0.0013207918,0.0003748265,0.0017752649,0.0030290438,0.2241042],"genre_scores_gemma":[0.50676924,0.00254518,0.36742815,0.0013288194,0.00046119615,0.000401861,0.003571539,0.0013346057,0.11615948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980488,0.0005305682,0.00023636597,0.00044145336,0.0004753044,0.00026742043],"domain_scores_gemma":[0.9973085,0.0011199893,0.00023020392,0.00055123173,0.0005591595,0.00023101324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012442542,0.00066731416,0.0006228571,0.0018263637,0.00225231,0.0045898203,0.0017263654,0.0012866479,0.01916389],"category_scores_gemma":[0.005262727,0.00063432223,0.0011502162,0.0019754404,0.0054999474,0.00760316,0.0029313834,0.0028043801,0.0051490483],"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.00003784569,0.000023805394,0.00031109367,0.0000741177,0.0000092449545,0.00017752954,0.00042163767,0.00077853404,0.00054533896,0.97074115,0.0047593247,0.022120384],"study_design_scores_gemma":[0.000006721913,0.000014686012,0.00018977791,0.000049606155,0.000013851643,0.00026331827,0.00029774342,0.0035795628,0.0008773221,0.9350089,0.05968492,0.000013663918],"about_ca_topic_score_codex":0.0059812316,"about_ca_topic_score_gemma":0.008030919,"teacher_disagreement_score":0.01916389,"about_ca_system_score_codex":0.0014638549,"about_ca_system_score_gemma":0.0012099255,"threshold_uncertainty_score":0.064109564},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1191842,0.0005210681,0.8657904,0.00082985533,0.000051021598,0.00036722203,0.0014053485,0.005179495,0.0066713253],"genre_scores_gemma":[0.47800902,0.00050172606,0.51330054,0.00022789607,0.00005271826,0.000573512,0.0039907866,0.0004505095,0.0028932965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993673,0.0001762939,0.000042794672,0.00020653268,0.00015018496,0.00005689277],"domain_scores_gemma":[0.996874,0.0023505848,0.00014802045,0.00030128856,0.00023139865,0.00009463213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009866515,0.0013705551,0.00089573726,0.0015309826,0.00061533845,0.0010407789,0.0012140856,0.0008030667,0.0049247304],"category_scores_gemma":[0.0063553597,0.00073358056,0.0011359665,0.0011643543,0.0010595239,0.0020703478,0.0014275414,0.0015698919,0.0006938084],"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.00022962298,0.00017330729,0.0039010341,0.00046371162,0.00007789841,0.00019698912,0.00030156842,0.54809225,0.0041324496,0.03004297,0.007543167,0.40484506],"study_design_scores_gemma":[0.000045270608,0.000081732105,0.00037513446,0.000035893547,0.000021993157,0.000027272097,0.00008728277,0.9440149,0.002626597,0.049934488,0.00273808,0.000011335757],"about_ca_topic_score_codex":0.006074179,"about_ca_topic_score_gemma":0.018869136,"teacher_disagreement_score":0.006074179,"about_ca_system_score_codex":0.0011772992,"about_ca_system_score_gemma":0.0020682928,"threshold_uncertainty_score":0.016474903},"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":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004892016,0.088156655,0.14418049,0.10676019,0.13917553,0.0027779338,0.003933787,0.0020436486,0.50807977],"genre_scores_gemma":[0.03819158,0.10255222,0.14662005,0.012279309,0.032774176,0.0016426002,0.018724872,0.0025900926,0.644625],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9773401,0.0052645076,0.001591608,0.0018398907,0.0126549285,0.0013088316],"domain_scores_gemma":[0.95084465,0.013286258,0.00096537935,0.0046569374,0.025283027,0.0049637365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03425181,0.0019764802,0.0015573701,0.008984651,0.0030319775,0.017367288,0.0046417424,0.004261728,0.121514745],"category_scores_gemma":[0.037832174,0.0010390359,0.0025892486,0.005890664,0.003294221,0.012343817,0.0073117292,0.007988463,0.041772697],"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.00013995865,0.000264612,0.0004449039,0.00026169897,0.000037066115,0.00019400503,0.00025054096,0.0007817669,0.0009225179,0.0394348,0.7303296,0.22693856],"study_design_scores_gemma":[0.000024197021,0.000052176427,0.0004159772,0.00038192625,0.00002012039,0.00018712504,0.00018522632,0.0008222901,0.0010728429,0.013323984,0.9834784,0.000035705198],"about_ca_topic_score_codex":0.009419688,"about_ca_topic_score_gemma":0.009420475,"teacher_disagreement_score":0.121514745,"about_ca_system_score_codex":0.007001949,"about_ca_system_score_gemma":0.01035582,"threshold_uncertainty_score":0.4065073},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025667034,0.000063764805,0.98992294,0.00049066456,0.000048784732,0.00014520176,0.00012192525,0.0008372659,0.005802692],"genre_scores_gemma":[0.06457144,0.00046770656,0.9306874,0.00037258177,0.00006606147,0.00031054107,0.0004610394,0.00034242886,0.0027207695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985361,0.00053388096,0.00011750714,0.0002473638,0.00042551995,0.00013966035],"domain_scores_gemma":[0.99700457,0.0018459118,0.0001732229,0.00069485756,0.00022425754,0.000057235346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017317036,0.0012195488,0.00053803256,0.00094463886,0.00060047454,0.0019265587,0.0015871766,0.0010596955,0.006393626],"category_scores_gemma":[0.00719822,0.00063542556,0.0020420183,0.001991356,0.0027150847,0.0042161364,0.0022712713,0.0037122546,0.0012598723],"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.000060346625,0.000081107275,0.0003096536,0.00037737546,0.000051758776,0.00029911048,0.00036728202,0.328874,0.003995354,0.5076809,0.0053328006,0.15257047],"study_design_scores_gemma":[0.000042630392,0.00004465271,0.000095106065,0.00006652264,0.00004686191,0.00013106663,0.00010861609,0.41006422,0.0050820904,0.553939,0.030356303,0.000022959044],"about_ca_topic_score_codex":0.012406701,"about_ca_topic_score_gemma":0.016453462,"teacher_disagreement_score":0.012406701,"about_ca_system_score_codex":0.0013779649,"about_ca_system_score_gemma":0.0032562546,"threshold_uncertainty_score":0.024668992},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010156002,0.00015872689,0.97087896,0.00033756622,0.000027111628,0.00015889955,0.00033541236,0.011925784,0.0060216007],"genre_scores_gemma":[0.15178278,0.00036308297,0.8421617,0.00026950377,0.000019361605,0.00028701292,0.0009944901,0.0017531745,0.002368871],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983657,0.00049935986,0.0001329352,0.00029959236,0.00051637116,0.0001859938],"domain_scores_gemma":[0.99658775,0.0018357454,0.00020434613,0.0010825126,0.00021609903,0.00007358263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019481352,0.0009842573,0.00054403825,0.0009927101,0.00071864726,0.0024935745,0.0030491378,0.0012174022,0.005697184],"category_scores_gemma":[0.006206428,0.0011129413,0.0015404797,0.001102847,0.0029016593,0.0031122868,0.003149434,0.0031622716,0.00137089],"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.0004378509,0.00043885,0.0016446043,0.0016643655,0.00010790336,0.00053569,0.0017114296,0.34131238,0.026776247,0.18411876,0.013488885,0.42776302],"study_design_scores_gemma":[0.0001715423,0.000132953,0.00041500654,0.00018008091,0.000101376696,0.00025391873,0.00028444073,0.82430637,0.047187887,0.070703834,0.056180175,0.00008243596],"about_ca_topic_score_codex":0.0053430456,"about_ca_topic_score_gemma":0.009783816,"teacher_disagreement_score":0.005697184,"about_ca_system_score_codex":0.0018241387,"about_ca_system_score_gemma":0.0029873105,"threshold_uncertainty_score":0.019059002},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057650696,0.0014046362,0.908104,0.002378875,0.00012659702,0.000424975,0.001622452,0.0011190851,0.02716877],"genre_scores_gemma":[0.48821893,0.0012000274,0.49337694,0.0004750516,0.00014582001,0.001002524,0.0026194965,0.0003175995,0.012643575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751943,0.0012092144,0.00015901715,0.0004043898,0.00044292453,0.00026497032],"domain_scores_gemma":[0.99551433,0.003700144,0.00022763826,0.00018249152,0.0002422268,0.00013316447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018610248,0.001166564,0.0009610302,0.0008642582,0.0009330293,0.0020591384,0.0014020944,0.0015148952,0.007746434],"category_scores_gemma":[0.006719017,0.00070092885,0.0014892274,0.0021907517,0.0019850829,0.0022443186,0.0023721433,0.0019701836,0.000500051],"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.00024296419,0.0001474849,0.0007763548,0.0005474254,0.00013057294,0.00058852066,0.0006092862,0.6986155,0.0015382764,0.24146351,0.0048052487,0.050534803],"study_design_scores_gemma":[0.00010076049,0.000055991502,0.00020206896,0.000050851828,0.0000332699,0.00009195641,0.00027635676,0.6675162,0.0008229633,0.3223014,0.00852639,0.0000218918],"about_ca_topic_score_codex":0.010265206,"about_ca_topic_score_gemma":0.014482996,"teacher_disagreement_score":0.010265206,"about_ca_system_score_codex":0.0022267576,"about_ca_system_score_gemma":0.00204417,"threshold_uncertainty_score":0.025914371},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028230757,0.0012861505,0.9528341,0.0007298267,0.00020993306,0.00018214513,0.0007771069,0.004490729,0.011259075],"genre_scores_gemma":[0.2698196,0.0006833739,0.71875995,0.0005069316,0.000071403745,0.00029401187,0.001500733,0.0007785303,0.0075854184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99502474,0.0011688625,0.0006757648,0.0009823294,0.0016695053,0.00047877786],"domain_scores_gemma":[0.9890205,0.003616489,0.0006273764,0.005537575,0.0009206475,0.00027735223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035172093,0.0006234614,0.0012845815,0.0022469684,0.0016006473,0.005067876,0.0038861448,0.0019804093,0.00907429],"category_scores_gemma":[0.017367102,0.0016483904,0.0013416378,0.0042668,0.0025038132,0.012357405,0.0065206825,0.002561436,0.0030030152],"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.0006752257,0.0002140125,0.0034763194,0.0005488742,0.00008178623,0.0007046603,0.0006619213,0.030783106,0.007126013,0.41533047,0.015808316,0.52458936],"study_design_scores_gemma":[0.00015599924,0.00021481134,0.00045902046,0.00018778934,0.00010975979,0.0014698197,0.0004843506,0.24793787,0.026043741,0.6537391,0.06908078,0.00011704636],"about_ca_topic_score_codex":0.00252023,"about_ca_topic_score_gemma":0.0025472727,"teacher_disagreement_score":0.00907429,"about_ca_system_score_codex":0.001415504,"about_ca_system_score_gemma":0.0018363975,"threshold_uncertainty_score":0.030356586},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059850016,0.00041184694,0.99006397,0.0001518307,0.00001989385,0.00004910542,0.000041381485,0.0004247842,0.0028521982],"genre_scores_gemma":[0.3374224,0.00065967365,0.6578289,0.00018971223,0.00006113701,0.0004594663,0.00018546962,0.00025748467,0.0029357844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985958,0.000767994,0.000044046512,0.00018288329,0.0003502525,0.00005904826],"domain_scores_gemma":[0.9968003,0.002587891,0.00014819905,0.00020540463,0.00018151704,0.00007662005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002381691,0.0005847265,0.0009746784,0.0012203128,0.00057687564,0.00086322933,0.0015873822,0.0011926147,0.003551392],"category_scores_gemma":[0.008632434,0.00073489954,0.0008403727,0.001647842,0.0013204457,0.0014503932,0.0010270111,0.0013025859,0.00063242915],"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.000035830286,0.00002546106,0.00025621543,0.000048301168,0.00002509043,0.000033648048,0.000049371112,0.93920195,0.0003327764,0.033859838,0.00071175565,0.0254197],"study_design_scores_gemma":[0.000007713273,0.000014139268,0.00002796013,0.000005417693,0.000004700169,0.000009317053,0.0000030092842,0.9875995,0.0000944881,0.011770651,0.00045882782,0.000004309236],"about_ca_topic_score_codex":0.0073188036,"about_ca_topic_score_gemma":0.01094548,"teacher_disagreement_score":0.0073188036,"about_ca_system_score_codex":0.0013413918,"about_ca_system_score_gemma":0.0014023228,"threshold_uncertainty_score":0.014552414},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026231773,0.0007534036,0.9653505,0.0003312525,0.000036284593,0.00012307939,0.00004066329,0.0023027903,0.0048303623],"genre_scores_gemma":[0.47476435,0.0004216861,0.52191085,0.0002595371,0.00004066696,0.00027746175,0.000121936035,0.0003594627,0.0018440199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788374,0.001205792,0.00008823844,0.00022540815,0.00041399262,0.0001828003],"domain_scores_gemma":[0.9962663,0.0027685147,0.00021293218,0.0004078564,0.00022010868,0.00012437967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029481861,0.0010747208,0.0012080236,0.0011208182,0.00070821174,0.0011625455,0.0016043963,0.0012349085,0.0024102586],"category_scores_gemma":[0.009413754,0.0007924043,0.0009224899,0.0011943431,0.0020640474,0.0023929998,0.002653409,0.0018201283,0.00054767],"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.00029626352,0.00013749416,0.0013396598,0.0002272142,0.00007281578,0.00013874579,0.0003728842,0.7947907,0.0031741606,0.032075536,0.0022702406,0.16510434],"study_design_scores_gemma":[0.000058349102,0.00015508325,0.00013070881,0.000032573007,0.000029755203,0.00005666246,0.00004757898,0.9693653,0.0019436742,0.026372496,0.0017854434,0.000022456616],"about_ca_topic_score_codex":0.005099509,"about_ca_topic_score_gemma":0.009135818,"teacher_disagreement_score":0.005099509,"about_ca_system_score_codex":0.0012032911,"about_ca_system_score_gemma":0.002391823,"threshold_uncertainty_score":0.015591681},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041040037,0.00051868364,0.94698167,0.00056225766,0.000037075133,0.00009685024,0.000109483204,0.0009942788,0.00965964],"genre_scores_gemma":[0.6976564,0.00051525934,0.29643112,0.00018418537,0.000037829293,0.0002389729,0.00027066062,0.00013637397,0.004529193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983675,0.00057696406,0.00011747016,0.00032110803,0.00045642222,0.0001605763],"domain_scores_gemma":[0.9977871,0.0014803373,0.00019218746,0.00026796295,0.00020388287,0.000068416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018436929,0.000519677,0.00048377962,0.00077337865,0.00061598007,0.0018357297,0.0011295477,0.00082999567,0.0026026815],"category_scores_gemma":[0.0056492593,0.00044047125,0.0010439806,0.000744952,0.003595001,0.003609273,0.0014360127,0.0015903572,0.0002446045],"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.00039326784,0.00008372437,0.000989419,0.0003124161,0.00007059953,0.0006378402,0.0017555977,0.36445716,0.008119946,0.5471893,0.0011168158,0.07487392],"study_design_scores_gemma":[0.0000544179,0.000066381974,0.00021151142,0.000055719593,0.000035596928,0.00010145439,0.00019175536,0.67028755,0.005733004,0.31843224,0.004805664,0.00002468833],"about_ca_topic_score_codex":0.008611866,"about_ca_topic_score_gemma":0.008255248,"teacher_disagreement_score":0.008611866,"about_ca_system_score_codex":0.0017129701,"about_ca_system_score_gemma":0.0015386064,"threshold_uncertainty_score":0.01712346},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033331502,0.00004784531,0.9937663,0.00019073221,0.000014956223,0.0000570036,0.000061862724,0.00088667515,0.0016414158],"genre_scores_gemma":[0.0977156,0.00014972096,0.8995146,0.00011905952,0.0000248725,0.00017812867,0.00037394903,0.0002189324,0.00170517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973231,0.0009079988,0.00018894844,0.0004283658,0.00094439584,0.00020726312],"domain_scores_gemma":[0.99584526,0.0026218777,0.0002661088,0.0006733186,0.00044442862,0.00014889972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002486688,0.0008788192,0.00087144173,0.0009636594,0.0008550973,0.0016316957,0.0021264146,0.0011323208,0.005536758],"category_scores_gemma":[0.011038264,0.00066905137,0.0014643228,0.0021472925,0.0017844584,0.004105176,0.003306017,0.0026623101,0.0009966614],"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.00015833313,0.000121750745,0.0006624162,0.00023283466,0.000060083155,0.0001514205,0.0002701938,0.38070783,0.002132691,0.3782834,0.006791081,0.23042794],"study_design_scores_gemma":[0.00003136535,0.000028500523,0.000047864003,0.000017763843,0.000012879412,0.00006544573,0.000033684595,0.75621265,0.002142463,0.23581451,0.0055792807,0.000013590481],"about_ca_topic_score_codex":0.005467185,"about_ca_topic_score_gemma":0.0068565332,"teacher_disagreement_score":0.005536758,"about_ca_system_score_codex":0.0012401065,"about_ca_system_score_gemma":0.0025839193,"threshold_uncertainty_score":0.018522322},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99691427,0.0021022162,0.00004946735,0.00006379203,0.00000893844,0.000023547991,0.00024000678,0.0000069365456,0.00059080106],"genre_scores_gemma":[0.9987192,0.0009482032,0.00007704589,0.000030146955,0.000019692143,0.000013394979,0.00012341757,0.000001217792,0.00006774906],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9995266,0.00006307734,0.000059128386,0.000053908785,0.00016722277,0.00013008661],"domain_scores_gemma":[0.9981938,0.00025451434,0.0012293018,0.00003406615,0.00009978109,0.000188485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047228165,0.00030143082,0.0003049678,0.0013735567,0.00044900287,0.0004799016,0.00034869136,0.0004524806,0.0012361889],"category_scores_gemma":[0.002993553,0.00025318968,0.00018279417,0.0012034423,0.0006650574,0.0004656552,0.0002868035,0.00027126554,0.00018047744],"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.00008586027,0.000012992431,0.98860884,0.00008671485,0.000014767351,0.006051156,0.00016986008,0.000018780893,0.0003546161,0.00001614321,0.00017145701,0.004408847],"study_design_scores_gemma":[0.0000072617645,0.00015442798,0.9689837,0.00003455946,0.000018031034,0.029627435,0.00043886466,0.00002691255,0.00018606691,0.000009476529,0.00050988875,0.0000034169198],"about_ca_topic_score_codex":0.0046127546,"about_ca_topic_score_gemma":0.008675596,"teacher_disagreement_score":0.0046127546,"about_ca_system_score_codex":0.00054263393,"about_ca_system_score_gemma":0.00055934855,"threshold_uncertainty_score":0.009171784},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012187155,0.00025536297,0.9830514,0.0005150417,0.00004240237,0.00014826158,0.00043373115,0.0006817952,0.0026848817],"genre_scores_gemma":[0.10138262,0.0005855807,0.8946131,0.0001960295,0.000035162007,0.00029776184,0.001210928,0.0001929675,0.0014858518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975961,0.0009296298,0.00024871313,0.000490768,0.00062535953,0.000109383334],"domain_scores_gemma":[0.9878663,0.008249799,0.00095787045,0.0019095463,0.000870157,0.00014630574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003247119,0.00063600176,0.00063342263,0.0023240114,0.00055266666,0.0041344883,0.001385185,0.0011376803,0.0030522486],"category_scores_gemma":[0.026596813,0.0006486131,0.0012891778,0.0018494609,0.0018663877,0.006416132,0.0021162098,0.0018759309,0.001004859],"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.00012015211,0.00014493483,0.0015960336,0.00067840354,0.0001343104,0.0006430179,0.0025141984,0.1499351,0.008003505,0.44774002,0.0050073722,0.383483],"study_design_scores_gemma":[0.00002948627,0.000073433854,0.00045267507,0.00022250455,0.000045463814,0.00018394223,0.0005175974,0.18168995,0.0066621914,0.79257506,0.017513573,0.000034146655],"about_ca_topic_score_codex":0.0015089486,"about_ca_topic_score_gemma":0.0020130035,"teacher_disagreement_score":0.0041344883,"about_ca_system_score_codex":0.000993688,"about_ca_system_score_gemma":0.0011890285,"threshold_uncertainty_score":0.017172575},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13112044,0.00031351033,0.8623172,0.00038139196,0.000018803947,0.0002026361,0.0001681249,0.0013155419,0.004162267],"genre_scores_gemma":[0.5115259,0.00024689216,0.48647633,0.000075808995,0.000012147984,0.0001991158,0.00033274942,0.00017914589,0.00095191214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999119,0.0003446741,0.000056910594,0.00016859833,0.0002036671,0.000107170585],"domain_scores_gemma":[0.9962651,0.0029090913,0.00024197639,0.00027433434,0.00020491802,0.000104700615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017703049,0.0006435546,0.0005633464,0.0007782676,0.00059387455,0.0008106831,0.0009950195,0.00097544945,0.0015664248],"category_scores_gemma":[0.0068006646,0.0006181649,0.0006118891,0.00065592106,0.0016402394,0.0015342092,0.0013619025,0.001093758,0.00024441778],"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.000097319295,0.000066526125,0.001443326,0.000104572886,0.000030375757,0.00016979116,0.00023691784,0.9203601,0.001905681,0.015056055,0.00090594625,0.05962342],"study_design_scores_gemma":[0.000020590318,0.000039284743,0.0002591164,0.000014705558,0.000011467957,0.00003677913,0.0001201273,0.97124666,0.0016406815,0.025689768,0.0009119593,0.000008887683],"about_ca_topic_score_codex":0.005342952,"about_ca_topic_score_gemma":0.008252118,"teacher_disagreement_score":0.005342952,"about_ca_system_score_codex":0.001014442,"about_ca_system_score_gemma":0.0017173144,"threshold_uncertainty_score":0.0106236935},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028889738,0.00048876216,0.9640725,0.0003279661,0.00008988371,0.00020449546,0.00009462499,0.0013613879,0.0044706506],"genre_scores_gemma":[0.29635975,0.00029063533,0.6997255,0.00019487728,0.00004074621,0.00032393998,0.00017153371,0.00020858011,0.002684461],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865,0.0006180953,0.00011278325,0.00015239649,0.00030829065,0.00015847936],"domain_scores_gemma":[0.99661404,0.0021953636,0.0002445602,0.0004150867,0.00034898278,0.0001820918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026805075,0.0006132313,0.0008144078,0.0011726292,0.0010124983,0.0018279117,0.0019102413,0.0010428752,0.0040865694],"category_scores_gemma":[0.008442393,0.00067600486,0.0012895494,0.0013715494,0.0011551584,0.0030507834,0.0020960593,0.0016325659,0.00056450145],"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.0007364764,0.00028244033,0.003587438,0.00030707405,0.00012453049,0.00018200338,0.00066568644,0.548221,0.004819663,0.13564633,0.005539573,0.29988772],"study_design_scores_gemma":[0.000074107564,0.00012969792,0.00020185274,0.000027061582,0.000033293807,0.00005591644,0.00006292199,0.9465514,0.0019028723,0.04707531,0.0038581244,0.000027447717],"about_ca_topic_score_codex":0.006545516,"about_ca_topic_score_gemma":0.009817217,"teacher_disagreement_score":0.006545516,"about_ca_system_score_codex":0.0020353824,"about_ca_system_score_gemma":0.0037296042,"threshold_uncertainty_score":0.014767766},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047514136,0.00009941971,0.9899154,0.00020075521,0.000033705935,0.000100337464,0.00017889953,0.0027420982,0.0019780262],"genre_scores_gemma":[0.29783344,0.00045705988,0.69421583,0.00049046945,0.00009375823,0.0004271096,0.0010505603,0.001280113,0.0041515846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933072,0.0018766894,0.00053057115,0.001074713,0.0022891446,0.0009217113],"domain_scores_gemma":[0.975048,0.019876577,0.0009366303,0.0027472079,0.0011732469,0.00021828551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062498595,0.0031566445,0.002933342,0.0030795713,0.0020015666,0.006080184,0.00963955,0.0034580429,0.008621431],"category_scores_gemma":[0.021640608,0.004065042,0.009286363,0.0022337397,0.0060445387,0.011324276,0.0050724195,0.0065132855,0.0013974879],"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.00065022096,0.00043358025,0.0017935756,0.00089956477,0.0005908938,0.0006928705,0.0006642524,0.60939366,0.008236823,0.28067428,0.004279398,0.09169082],"study_design_scores_gemma":[0.00010445514,0.00005993459,0.000119967364,0.000083115294,0.00028795644,0.00010694528,0.00006612653,0.7951518,0.01008443,0.19210082,0.001781808,0.000052584594],"about_ca_topic_score_codex":0.01683345,"about_ca_topic_score_gemma":0.019558623,"teacher_disagreement_score":0.01683345,"about_ca_system_score_codex":0.0023063822,"about_ca_system_score_gemma":0.0047199233,"threshold_uncertainty_score":0.03347093},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004570371,0.22806844,0.035636153,0.034380745,0.043178055,0.00040590198,0.009285162,0.0029248686,0.64155024],"genre_scores_gemma":[0.01030464,0.074533656,0.012697325,0.0011983536,0.0017780362,0.00011491721,0.004635565,0.0008564729,0.8938811],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99903286,0.000083326115,0.0000360622,0.000095197174,0.00063467684,0.00011795147],"domain_scores_gemma":[0.99669814,0.0003114674,0.00005133038,0.00022255132,0.0022582328,0.00045828125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019845134,0.0014904999,0.0018058514,0.0021305406,0.001929425,0.0058350572,0.001739973,0.0011313721,0.10960603],"category_scores_gemma":[0.0027867416,0.0006561014,0.00068686105,0.004261386,0.001766923,0.0024134733,0.0016074842,0.0028350549,0.033262648],"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.000030046207,0.000024887002,0.00019669214,0.00016091696,0.000011747202,0.000021185231,0.000084506486,0.00031294982,0.00022436978,0.005782029,0.9037547,0.089395866],"study_design_scores_gemma":[0.000007918316,0.0000065985973,0.00066460395,0.00012452743,0.000012355933,0.00003456086,0.000082418905,0.0006181562,0.0002034987,0.0019155962,0.99631834,0.000011374876],"about_ca_topic_score_codex":0.46940237,"about_ca_topic_score_gemma":0.6729854,"teacher_disagreement_score":0.5305976,"about_ca_system_score_codex":0.009391627,"about_ca_system_score_gemma":0.020870004,"threshold_uncertainty_score":0.9333403},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123035416,0.016308814,0.6812763,0.055906694,0.0022652547,0.00063794496,0.0019610361,0.0029037418,0.11570476],"genre_scores_gemma":[0.47164223,0.0071808454,0.44438303,0.0037476073,0.001568669,0.00022699095,0.002234086,0.0006421822,0.06837439],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99811375,0.000519226,0.00025358738,0.00025157098,0.0007578031,0.00010410639],"domain_scores_gemma":[0.9924508,0.005090412,0.000168846,0.0007259646,0.0012965561,0.00026743292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038091305,0.00025901597,0.0005991291,0.0009126329,0.0018939449,0.007863504,0.0017466946,0.0032623443,0.014628573],"category_scores_gemma":[0.012322141,0.0007287331,0.0006476105,0.0014960897,0.00069818244,0.00624538,0.0013963492,0.0019262552,0.001881782],"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.0008500153,0.00035836588,0.0060375016,0.0009936236,0.00009226622,0.0045753634,0.0025640156,0.026621781,0.011909315,0.35267448,0.10525936,0.48806396],"study_design_scores_gemma":[0.00024554582,0.00038647852,0.004977864,0.0005190081,0.000247812,0.006819641,0.002381233,0.20637798,0.012260203,0.22796415,0.5376896,0.00013034909],"about_ca_topic_score_codex":0.0055316933,"about_ca_topic_score_gemma":0.0057273703,"teacher_disagreement_score":0.014628573,"about_ca_system_score_codex":0.0012433728,"about_ca_system_score_gemma":0.0013046651,"threshold_uncertainty_score":0.04893738},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009008159,0.00015159849,0.98039114,0.0005585103,0.00007423961,0.00024604797,0.0005568398,0.0020874932,0.006925877],"genre_scores_gemma":[0.28718534,0.00051785994,0.70507556,0.00024497317,0.00012179858,0.00068417384,0.0015413598,0.00033745018,0.0042915135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998553,0.0003395793,0.00016556453,0.0003206618,0.0003518746,0.00026930397],"domain_scores_gemma":[0.99763036,0.0015477341,0.00014935154,0.00031018278,0.00026216812,0.00010025439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027549684,0.0010768976,0.00082322216,0.0015314529,0.001081056,0.0027592108,0.0017010901,0.0011124972,0.0108340075],"category_scores_gemma":[0.00726318,0.00096430915,0.0025268353,0.0010941499,0.0033870926,0.0038515748,0.0032207952,0.0021603978,0.0014780711],"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.00029661457,0.00013896757,0.0011449042,0.00066293165,0.00012180457,0.00080713286,0.0009797481,0.36819375,0.002503723,0.4938719,0.0052006147,0.12607801],"study_design_scores_gemma":[0.00010177916,0.000055325443,0.0002078464,0.00016615934,0.00009817903,0.00006171245,0.00022195498,0.41955993,0.0039124982,0.563113,0.01246076,0.0000408847],"about_ca_topic_score_codex":0.015709642,"about_ca_topic_score_gemma":0.025664799,"teacher_disagreement_score":0.015709642,"about_ca_system_score_codex":0.0022187415,"about_ca_system_score_gemma":0.0033036955,"threshold_uncertainty_score":0.03624338},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13047941,0.00015916182,0.83912253,0.0018354942,0.00003583907,0.00014416613,0.000057315254,0.00075136026,0.027414676],"genre_scores_gemma":[0.6305987,0.00016833484,0.3605878,0.0002724117,0.000017578286,0.00029164925,0.00009443521,0.00008852858,0.007880596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930584,0.00034981765,0.000027255062,0.00014839145,0.000110018635,0.000058642705],"domain_scores_gemma":[0.99942076,0.00020732029,0.00006495928,0.00011598358,0.00009307197,0.00009795882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011623711,0.00038066052,0.00018856859,0.000396968,0.0006786388,0.0016581978,0.001086938,0.0008148316,0.0025087725],"category_scores_gemma":[0.0017630551,0.00045643837,0.0005901462,0.00030596147,0.0022494905,0.001808239,0.0012928643,0.0010251675,0.0003564974],"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.000099245066,0.00014662491,0.0017878121,0.00010744016,0.000077336226,0.00023048952,0.0014863162,0.13639279,0.013922879,0.81634754,0.0007806184,0.028620884],"study_design_scores_gemma":[0.000101557256,0.00017979638,0.00093355944,0.00003167487,0.000075862416,0.00011530795,0.00037242827,0.4550661,0.0035691676,0.52766067,0.011853217,0.000040695624],"about_ca_topic_score_codex":0.0023989643,"about_ca_topic_score_gemma":0.0041103256,"teacher_disagreement_score":0.0025087725,"about_ca_system_score_codex":0.00093857374,"about_ca_system_score_gemma":0.001382889,"threshold_uncertainty_score":0.008392632},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036379233,0.00049724674,0.95618826,0.000234496,0.000028596543,0.00021922917,0.000105373256,0.0018793246,0.0044683106],"genre_scores_gemma":[0.29273716,0.00031308387,0.7046966,0.00014016568,0.00002222651,0.0003208363,0.00032727548,0.00024998435,0.0011926814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770063,0.00087235647,0.00017916132,0.0003043951,0.0006838688,0.00025964406],"domain_scores_gemma":[0.99525297,0.00246965,0.00035728255,0.0014739403,0.0003043673,0.00014192973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029407428,0.0016059467,0.0021260404,0.0014937766,0.0009131561,0.0022209203,0.0027538785,0.0014678185,0.0025619783],"category_scores_gemma":[0.010470549,0.00092030043,0.0015371828,0.0021944197,0.0016286201,0.0038133853,0.003303069,0.0019909458,0.0007237356],"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.00047650412,0.0003125628,0.0022695146,0.0003984526,0.00016368883,0.00026997752,0.00044799506,0.54491013,0.008592351,0.06430178,0.004366121,0.37349087],"study_design_scores_gemma":[0.00006844138,0.000119147255,0.00019979267,0.00003211622,0.00005008382,0.00006286648,0.00006691878,0.94390696,0.002785941,0.05023553,0.0024510014,0.000021268579],"about_ca_topic_score_codex":0.004439928,"about_ca_topic_score_gemma":0.0049004387,"teacher_disagreement_score":0.004439928,"about_ca_system_score_codex":0.0011700082,"about_ca_system_score_gemma":0.0032330332,"threshold_uncertainty_score":0.015552342},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08510539,0.0022667872,0.7746378,0.01348443,0.00019539686,0.0006635037,0.0002618714,0.0008647252,0.1225201],"genre_scores_gemma":[0.5646958,0.00069276267,0.42555204,0.00026953113,0.000029395713,0.00021886399,0.0001814834,0.00011431189,0.008245801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99500054,0.0028789216,0.00029329033,0.00032324737,0.0012259184,0.0002781002],"domain_scores_gemma":[0.9799943,0.016480763,0.0005984714,0.0015036345,0.0009610096,0.00046179097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073607825,0.0005540792,0.0004715466,0.0007427014,0.0020147602,0.008090209,0.0044163945,0.004156457,0.01116212],"category_scores_gemma":[0.023500921,0.000659663,0.00095197675,0.0010439657,0.003636629,0.0072547505,0.0026623416,0.0025613045,0.0013345483],"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.00037542934,0.00058046414,0.0029502895,0.0007713981,0.0000659307,0.0064123706,0.010254598,0.069076695,0.006222003,0.6766216,0.008560625,0.21810861],"study_design_scores_gemma":[0.00012061946,0.00025825808,0.0013804969,0.00056546443,0.000081997496,0.006337859,0.011076125,0.1877053,0.008330975,0.677995,0.10603153,0.00011637656],"about_ca_topic_score_codex":0.0040912605,"about_ca_topic_score_gemma":0.006324324,"teacher_disagreement_score":0.01116212,"about_ca_system_score_codex":0.0020723743,"about_ca_system_score_gemma":0.0029489205,"threshold_uncertainty_score":0.038928032},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045519476,0.26717925,0.03000594,0.041192286,0.045159943,0.00034252083,0.008234027,0.002294112,0.60104],"genre_scores_gemma":[0.016008323,0.11102137,0.013454735,0.0014032751,0.0021425772,0.00012303128,0.0046780943,0.00081234035,0.8503563],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99885976,0.000086843604,0.00004407719,0.00010504039,0.00076046283,0.00014381684],"domain_scores_gemma":[0.9967534,0.0002901164,0.00006070931,0.0001842712,0.0021678398,0.0005436478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022807894,0.0013235713,0.0016884787,0.0023244007,0.0022334505,0.0064058234,0.0016830524,0.0011464014,0.0893955],"category_scores_gemma":[0.00304516,0.0006209817,0.00061847694,0.004308148,0.0019955984,0.0026596133,0.0018068856,0.0029476718,0.022794478],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000032874268,0.000023841003,0.00019223189,0.00019032638,0.000010440045,0.00002180271,0.00012955931,0.00032068745,0.00021228028,0.00861501,0.8968906,0.0933603],"study_design_scores_gemma":[0.000006598845,0.0000060767475,0.00065716216,0.00014807365,0.000011741689,0.00002543566,0.0001247137,0.0005127733,0.0001938851,0.0022892521,0.9960128,0.0000115506045],"about_ca_topic_score_codex":0.4830882,"about_ca_topic_score_gemma":0.6792114,"teacher_disagreement_score":0.989848,"about_ca_system_score_codex":0.010152009,"about_ca_system_score_gemma":0.026919635,"threshold_uncertainty_score":0.96055263},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12123667,0.00032589832,0.8510024,0.00071959273,0.000085542866,0.0004906155,0.0013928486,0.018193768,0.006552679],"genre_scores_gemma":[0.47573584,0.00016214194,0.5124396,0.00013409197,0.000049233426,0.0002289566,0.0030218943,0.00042165094,0.007806601],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833894,0.0003451249,0.0002589975,0.00027876327,0.00065002835,0.00012816687],"domain_scores_gemma":[0.9953629,0.0021983164,0.00024070842,0.0009411434,0.0009350108,0.00032189282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002285758,0.00042665502,0.00068593345,0.0022046273,0.0009817956,0.0021095804,0.0018080747,0.001270329,0.006472918],"category_scores_gemma":[0.009939088,0.00060678547,0.0005256557,0.0015326403,0.00023947716,0.003154084,0.0008821187,0.00089800055,0.003580095],"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.0018488797,0.0010362768,0.01636866,0.0001478711,0.00012545421,0.0006681482,0.00083825266,0.033330258,0.03287924,0.009317508,0.016246103,0.8871933],"study_design_scores_gemma":[0.000058119153,0.00020149685,0.0052386317,0.000030840925,0.00010071725,0.00049507985,0.00017352977,0.9537757,0.021755839,0.008596395,0.009505483,0.000068180554],"about_ca_topic_score_codex":0.0076000695,"about_ca_topic_score_gemma":0.0113254255,"teacher_disagreement_score":0.0076000695,"about_ca_system_score_codex":0.00096568326,"about_ca_system_score_gemma":0.00083802413,"threshold_uncertainty_score":0.02165407},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28100353,0.00033305914,0.7101628,0.0005300115,0.000065425746,0.00009860788,0.00046834414,0.0032123178,0.004125905],"genre_scores_gemma":[0.8575052,0.000114811,0.14072776,0.00006109429,0.000020574782,0.00013682808,0.00047378626,0.00015486623,0.0008051494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990625,0.00030020144,0.00004926586,0.00021554405,0.00026260657,0.00010988281],"domain_scores_gemma":[0.9838213,0.01252178,0.00079362444,0.0012142413,0.0014014243,0.00024775256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016979261,0.00066347787,0.00066058815,0.0013826356,0.0004394268,0.0011698651,0.0009799061,0.0010246206,0.002821169],"category_scores_gemma":[0.023361092,0.0005566847,0.0004258326,0.0010565243,0.00067425927,0.002547354,0.0007877462,0.0016276621,0.00057042064],"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.00015787901,0.0000668252,0.0065714456,0.000045923425,0.000021278714,0.000024929968,0.000027694034,0.9341526,0.00088219316,0.003964726,0.0010514598,0.053033017],"study_design_scores_gemma":[0.0000036668412,0.000010621695,0.0003606276,0.0000030114754,0.0000027610854,0.000004048972,0.000003323214,0.997282,0.00044834393,0.0018073594,0.00007143161,0.000002640006],"about_ca_topic_score_codex":0.007867999,"about_ca_topic_score_gemma":0.007975116,"teacher_disagreement_score":0.007867999,"about_ca_system_score_codex":0.001199581,"about_ca_system_score_gemma":0.0020058737,"threshold_uncertainty_score":0.015644372},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17083561,0.00018533863,0.79828274,0.0006941015,0.00016490713,0.00036193398,0.00028812417,0.0016250608,0.027562236],"genre_scores_gemma":[0.69493127,0.00011878098,0.29545927,0.00011111907,0.000026056066,0.00028668193,0.00026213712,0.000095082156,0.008709542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997309,0.000050458133,0.000016300275,0.000076813,0.00008785263,0.000037685837],"domain_scores_gemma":[0.99967766,0.00009195594,0.00002158913,0.0000358529,0.00007517789,0.00009773445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033912313,0.00057691167,0.00082684244,0.0003180323,0.0012707048,0.000832449,0.0015346213,0.0011486423,0.0052945972],"category_scores_gemma":[0.0008198399,0.00043375927,0.00044474486,0.0004865802,0.00070173695,0.0005878872,0.0016569793,0.00067742367,0.0005485459],"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.00050744903,0.00022060065,0.0007734353,0.0001167107,0.00007578073,0.00089607196,0.00023189918,0.90188265,0.0141388,0.016615704,0.003737905,0.060802985],"study_design_scores_gemma":[0.00005938588,0.00009499715,0.00012704145,0.0000044159265,0.000012595169,0.000045052973,0.000036818852,0.99250644,0.0013232484,0.0038603717,0.0019190904,0.000010610404],"about_ca_topic_score_codex":0.014380186,"about_ca_topic_score_gemma":0.01043004,"teacher_disagreement_score":0.014380186,"about_ca_system_score_codex":0.0005313362,"about_ca_system_score_gemma":0.0013161597,"threshold_uncertainty_score":0.028592944},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053095575,0.0039133946,0.8966359,0.0055717095,0.0005185626,0.0002694805,0.0005956706,0.0017568254,0.03764289],"genre_scores_gemma":[0.85456586,0.002067018,0.13697156,0.00035760843,0.00030929074,0.0002177927,0.00055184984,0.000052622465,0.0049064457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815565,0.0008295045,0.00017576509,0.00031180002,0.00039832428,0.0001289132],"domain_scores_gemma":[0.996487,0.0025682766,0.00023782617,0.0001611152,0.00038763366,0.00015819827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026752304,0.00076765404,0.0008250653,0.0012105255,0.00085740915,0.004361121,0.0011337266,0.0013422742,0.0045619],"category_scores_gemma":[0.0072582304,0.00026965496,0.00039921748,0.001468073,0.00097152987,0.0023286995,0.0018530056,0.0012436641,0.0007872614],"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.0003269386,0.00024972434,0.0020791802,0.0004518035,0.000107701824,0.00070444663,0.0004773175,0.4944479,0.0022646154,0.17941445,0.009688461,0.3097875],"study_design_scores_gemma":[0.000057858968,0.00007623827,0.00036943305,0.0000860918,0.000022364216,0.00008379534,0.00019115096,0.85790694,0.0009371621,0.12530227,0.014942717,0.000024000192],"about_ca_topic_score_codex":0.0050728456,"about_ca_topic_score_gemma":0.002458633,"teacher_disagreement_score":0.0050728456,"about_ca_system_score_codex":0.0011181094,"about_ca_system_score_gemma":0.001423319,"threshold_uncertainty_score":0.015261054},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010572825,0.0010974089,0.97325855,0.0005252075,0.000086993154,0.00020433287,0.0005286079,0.0016484511,0.012077642],"genre_scores_gemma":[0.17610708,0.0008422498,0.8176608,0.0003021615,0.000095966345,0.00038039387,0.00095023273,0.00039407783,0.0032669832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985191,0.00068393134,0.0000815311,0.00017676996,0.0003906799,0.00014800366],"domain_scores_gemma":[0.9977962,0.0015970065,0.00015198822,0.00025007053,0.0001512544,0.000053397984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017140957,0.0011485897,0.0008640552,0.0014750874,0.0006359069,0.0021026025,0.0014891834,0.0008419609,0.00597491],"category_scores_gemma":[0.0050332183,0.0007913562,0.0010914042,0.0022684918,0.0012799638,0.0019479407,0.0013480817,0.0021873158,0.00090508035],"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.00020955715,0.000074552205,0.0003145026,0.00031018924,0.00005419998,0.000088616216,0.00012989147,0.6653908,0.0015793346,0.20796327,0.009004406,0.11488068],"study_design_scores_gemma":[0.00006829778,0.000052636144,0.00012808423,0.000090306065,0.000025263264,0.0000360435,0.000048019403,0.79562855,0.0020218901,0.1934494,0.008432323,0.000019124074],"about_ca_topic_score_codex":0.0050233873,"about_ca_topic_score_gemma":0.009838878,"teacher_disagreement_score":0.00597491,"about_ca_system_score_codex":0.0031229714,"about_ca_system_score_gemma":0.0022846947,"threshold_uncertainty_score":0.022658825},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024401322,0.00069487427,0.9632505,0.00034163333,0.00007620009,0.00010720674,0.00016033126,0.0034249912,0.007542958],"genre_scores_gemma":[0.2793384,0.000267963,0.71713334,0.00013213365,0.000021506918,0.00013539694,0.00032198045,0.00034698774,0.0023023046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999086,0.00030170844,0.00007038845,0.00019786276,0.00023405247,0.00010992901],"domain_scores_gemma":[0.99815553,0.0010413935,0.00016447621,0.0003839165,0.0001659182,0.00008885366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013637403,0.0010701244,0.0009269808,0.0012077097,0.0010327386,0.0015153484,0.001882865,0.0010391789,0.005329437],"category_scores_gemma":[0.0058669513,0.0008983253,0.00064793834,0.0014811716,0.0010297196,0.0033517675,0.0025030691,0.001250194,0.0011320922],"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.0009812712,0.000275995,0.0015965775,0.00034953063,0.00013033637,0.00019273456,0.00034245203,0.437361,0.008814006,0.079912186,0.007587215,0.46245673],"study_design_scores_gemma":[0.00011253392,0.00015412296,0.00015840794,0.00005496183,0.000058586353,0.00010017788,0.00007332484,0.8889832,0.008441039,0.09484697,0.0069720475,0.00004470616],"about_ca_topic_score_codex":0.0051560537,"about_ca_topic_score_gemma":0.005691331,"teacher_disagreement_score":0.005329437,"about_ca_system_score_codex":0.00094073097,"about_ca_system_score_gemma":0.0023196794,"threshold_uncertainty_score":0.017828703},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004303913,0.0001526518,0.94557786,0.00021592493,0.000102413265,0.00015537841,0.0024242562,0.034111153,0.012956441],"genre_scores_gemma":[0.11872265,0.00087257917,0.8321547,0.00019079096,0.000059130267,0.000893349,0.013157007,0.011395849,0.022553977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994578,0.00011765913,0.00007693247,0.000099664016,0.00020479532,0.000043182863],"domain_scores_gemma":[0.99916816,0.00031452614,0.000049391223,0.00023980203,0.00014098106,0.00008704631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010796259,0.0014882273,0.00097264774,0.0013863167,0.0010325438,0.0046025063,0.002801333,0.0013017098,0.031920634],"category_scores_gemma":[0.003404937,0.001201707,0.0021004674,0.0010702881,0.0012595879,0.0056637283,0.004153316,0.0019529688,0.008243927],"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.0005660472,0.00015734282,0.0022384122,0.0013550184,0.00021257045,0.0006178306,0.0035758212,0.12722397,0.013152081,0.55205464,0.069970556,0.22887576],"study_design_scores_gemma":[0.00012064048,0.000072639144,0.00037088947,0.0002703074,0.00015415678,0.00031526037,0.0003711069,0.38535643,0.007332044,0.14326818,0.46227244,0.00009595749],"about_ca_topic_score_codex":0.0061063473,"about_ca_topic_score_gemma":0.00756772,"teacher_disagreement_score":0.031920634,"about_ca_system_score_codex":0.0009416564,"about_ca_system_score_gemma":0.0016197676,"threshold_uncertainty_score":0.10678518},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8480439,0.0024868336,0.13265012,0.0014834141,0.00036127528,0.00006174417,0.00037500038,0.0018248394,0.012712901],"genre_scores_gemma":[0.99535793,0.00014127107,0.0037295101,0.00003807354,0.000012636271,0.000011062747,0.00007664487,0.00005198133,0.00058088586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738246,0.0007301665,0.000112750145,0.00029280662,0.00066249917,0.00081932533],"domain_scores_gemma":[0.96521187,0.028512603,0.001652234,0.0018020658,0.0016064892,0.0012147912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049698344,0.0009644892,0.0014463045,0.00064828026,0.0009914322,0.003017608,0.0014118408,0.0014774842,0.004442517],"category_scores_gemma":[0.034483366,0.00060502585,0.0003564072,0.0008833825,0.0016148277,0.0032049213,0.0017510676,0.0021621634,0.00041415737],"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.0034610485,0.00018161882,0.0016117188,0.000103174745,0.00004273125,0.00007721015,0.00013922408,0.95825684,0.002924083,0.0094586685,0.0018132599,0.02193049],"study_design_scores_gemma":[0.00003886721,0.00013631624,0.0003229796,0.000010971398,0.000011846157,0.0000141075325,0.000065922,0.9916643,0.0014606945,0.0061409976,0.00012161586,0.000011385353],"about_ca_topic_score_codex":0.010979805,"about_ca_topic_score_gemma":0.0047306903,"teacher_disagreement_score":0.010979805,"about_ca_system_score_codex":0.0018434637,"about_ca_system_score_gemma":0.0031539013,"threshold_uncertainty_score":0.026283324},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32939702,0.00039369924,0.5549168,0.0054036193,0.000481185,0.00011529061,0.00012127941,0.0064185965,0.10275254],"genre_scores_gemma":[0.93728817,0.00009809924,0.055547785,0.00029860417,0.0000249547,0.0000252031,0.00006265814,0.00013034865,0.0065242513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997904,0.00006154444,0.000012435015,0.00006537291,0.00003310086,0.000037186317],"domain_scores_gemma":[0.9994498,0.00024059863,0.000037360627,0.00008450632,0.00008181718,0.00010581258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038898224,0.00031225747,0.00012967979,0.00016087544,0.00044290294,0.0018769313,0.0006922062,0.0012560824,0.0037903807],"category_scores_gemma":[0.0026908438,0.0002654666,0.00024784295,0.00012312178,0.000751268,0.0022259462,0.001196326,0.000912196,0.00078794337],"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.0007098761,0.0004277499,0.014823329,0.00030234913,0.0001884394,0.0019943023,0.011288092,0.043700982,0.14349233,0.17342077,0.018306814,0.59134495],"study_design_scores_gemma":[0.000221791,0.0007426904,0.014732248,0.00015638376,0.0004240173,0.0029425395,0.004118951,0.3996987,0.16168082,0.3163774,0.0986727,0.00023181843],"about_ca_topic_score_codex":0.0013125282,"about_ca_topic_score_gemma":0.0011551122,"teacher_disagreement_score":0.0037903807,"about_ca_system_score_codex":0.0002557854,"about_ca_system_score_gemma":0.0005857847,"threshold_uncertainty_score":0.012680054},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017034655,0.010653826,0.8614241,0.02245054,0.00056237075,0.000083084036,0.00023481071,0.0013881249,0.08616848],"genre_scores_gemma":[0.3673694,0.01165287,0.5909361,0.0028783584,0.0011496355,0.00043843227,0.00041040924,0.0006110754,0.02455359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902415,0.0002958094,0.00007134284,0.00021524944,0.00032040948,0.00007312913],"domain_scores_gemma":[0.9966293,0.0015470742,0.0001222102,0.0013061389,0.0002990348,0.000096181575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019983866,0.0007249004,0.00076833426,0.00069000205,0.0008006522,0.0046022856,0.0025249177,0.0024042435,0.004219451],"category_scores_gemma":[0.0063203843,0.0010886888,0.0007285172,0.0009913174,0.008566462,0.017405143,0.0020746803,0.008232457,0.0014127528],"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.0000072103935,0.000011399131,0.00006397184,0.0000568422,0.000012145159,0.000020237232,0.0002097006,0.006878186,0.0004812027,0.97675294,0.0019845744,0.013521598],"study_design_scores_gemma":[0.00000536218,0.0000053142344,0.00004127624,0.000021891894,0.000005054038,0.000019332156,0.000037031485,0.010232964,0.00031330012,0.9772385,0.01207412,0.0000059131994],"about_ca_topic_score_codex":0.001055197,"about_ca_topic_score_gemma":0.0012134098,"teacher_disagreement_score":0.0046022856,"about_ca_system_score_codex":0.0013044283,"about_ca_system_score_gemma":0.0013668303,"threshold_uncertainty_score":0.014115453},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0818733,0.0006663354,0.6790577,0.0045675677,0.0006178843,0.00070753956,0.0005636647,0.0041973838,0.22774865],"genre_scores_gemma":[0.6065547,0.00042946462,0.31125033,0.0002294109,0.00007322804,0.00042630866,0.0006920227,0.00020242989,0.080142066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987566,0.000021116783,0.000004460422,0.000036891004,0.0000289247,0.000032973618],"domain_scores_gemma":[0.9998454,0.000037448524,0.000011960344,0.000017048531,0.000030595624,0.000057538567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001942737,0.0004660142,0.00021623829,0.00044279214,0.0017786219,0.0010516058,0.000745707,0.00083984033,0.022271313],"category_scores_gemma":[0.0008133697,0.00038887677,0.0005616704,0.00031984452,0.0004548771,0.001034971,0.0010151733,0.00088918867,0.002633448],"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.0009075572,0.00039806226,0.0041639516,0.0004396154,0.00009645858,0.0017249269,0.0013356318,0.29390827,0.020040402,0.19238259,0.08848148,0.39612097],"study_design_scores_gemma":[0.00017573444,0.00047428388,0.002083875,0.00014136962,0.00008345072,0.00040925658,0.0022016007,0.7353175,0.010860843,0.12272518,0.1254237,0.00010318911],"about_ca_topic_score_codex":0.012042007,"about_ca_topic_score_gemma":0.0258053,"teacher_disagreement_score":0.022271313,"about_ca_system_score_codex":0.0007225743,"about_ca_system_score_gemma":0.0016798866,"threshold_uncertainty_score":0.07450491},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60242915,0.0016264647,0.3385859,0.0013930483,0.0004237306,0.0037082308,0.0036537147,0.004207099,0.04397266],"genre_scores_gemma":[0.80520755,0.00058904587,0.18439043,0.00039628634,0.00007376396,0.0030168425,0.0014213073,0.0004455522,0.004459195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958438,0.0016950932,0.00025845593,0.00069963123,0.0010406793,0.00046241237],"domain_scores_gemma":[0.9244442,0.06461833,0.0016169978,0.006223514,0.0023698502,0.0007270746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003346924,0.0010389943,0.000806578,0.0008003532,0.0006919295,0.0010514515,0.00216401,0.0012147571,0.014080511],"category_scores_gemma":[0.03620075,0.00061978726,0.00094847573,0.0010082211,0.0017658881,0.0019276079,0.0014058395,0.0032502227,0.0010155516],"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.0058264085,0.009210439,0.005014862,0.0032263978,0.00035997113,0.00035914307,0.0008739567,0.6637575,0.035575815,0.07109742,0.014563999,0.190134],"study_design_scores_gemma":[0.0016039615,0.0045219725,0.0037706762,0.00016400975,0.00023126743,0.00021580767,0.0003033825,0.8451861,0.060730718,0.06909548,0.014030459,0.00014625971],"about_ca_topic_score_codex":0.002634503,"about_ca_topic_score_gemma":0.0021337527,"teacher_disagreement_score":0.014080511,"about_ca_system_score_codex":0.0014576494,"about_ca_system_score_gemma":0.0017623596,"threshold_uncertainty_score":0.04710406},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12434324,0.002399423,0.38487118,0.004594392,0.001069149,0.0009912682,0.005058364,0.0036587338,0.47301415],"genre_scores_gemma":[0.53953993,0.0035255183,0.3552813,0.00022386285,0.00039558008,0.0005900853,0.007731829,0.0017994707,0.090912536],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99822766,0.0008199219,0.00016373294,0.00021284026,0.00050475687,0.00007103324],"domain_scores_gemma":[0.9746562,0.021107433,0.00062859576,0.0017909999,0.0015044905,0.0003122795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029289953,0.0005804786,0.00026490403,0.006356983,0.001503968,0.0042109466,0.001549754,0.0010224753,0.036185183],"category_scores_gemma":[0.026708564,0.00037229576,0.00028852062,0.004790111,0.0014624824,0.0062743574,0.0020321182,0.0009275122,0.0058247265],"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.00023132782,0.0001876164,0.0039716368,0.0008332903,0.000014569481,0.00477889,0.04340236,0.004976368,0.004398965,0.10526069,0.054425877,0.7775184],"study_design_scores_gemma":[0.000054838805,0.0000793476,0.003732547,0.0015407295,0.000039502338,0.006236966,0.031655096,0.022530891,0.010934436,0.14048764,0.78261805,0.00008993095],"about_ca_topic_score_codex":0.0005892742,"about_ca_topic_score_gemma":0.0024838087,"teacher_disagreement_score":0.036185183,"about_ca_system_score_codex":0.0012229257,"about_ca_system_score_gemma":0.00088167086,"threshold_uncertainty_score":0.12105149},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001803044,0.0003019012,0.96380776,0.0003861493,0.00013687236,0.00023239072,0.001396399,0.020457568,0.011477859],"genre_scores_gemma":[0.023064109,0.00037750643,0.9627132,0.00027346582,0.00004046111,0.00037063204,0.002682549,0.0019102928,0.008567832],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986179,0.00022879698,0.00020946232,0.0001795259,0.00067675905,0.000087475],"domain_scores_gemma":[0.9981781,0.00082508393,0.00014050545,0.00030964147,0.00045054543,0.00009616279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019030373,0.0008593512,0.0008607682,0.0015362559,0.0012753346,0.0024408207,0.0028223067,0.0012113197,0.015752813],"category_scores_gemma":[0.0060508247,0.0009997855,0.0019276434,0.0011866812,0.001050615,0.0024626767,0.0024028723,0.0020503434,0.0055964524],"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.0003896036,0.00028617796,0.0018469391,0.0034093026,0.00036422533,0.0014463987,0.0020679578,0.0950519,0.015696835,0.2653735,0.14393508,0.47013217],"study_design_scores_gemma":[0.00013118605,0.00005499038,0.0009521929,0.0005633975,0.00010835589,0.001069158,0.00029472756,0.29987022,0.015933203,0.23969813,0.44116426,0.00016008329],"about_ca_topic_score_codex":0.0079963,"about_ca_topic_score_gemma":0.014154616,"teacher_disagreement_score":0.015752813,"about_ca_system_score_codex":0.0009510367,"about_ca_system_score_gemma":0.0021123216,"threshold_uncertainty_score":0.052698433},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007161474,0.2012696,0.18931371,0.08954763,0.17069016,0.0005151238,0.0039847917,0.0022517564,0.33526576],"genre_scores_gemma":[0.12676342,0.12157616,0.10383189,0.008906978,0.06558706,0.0008804866,0.009184659,0.0017936456,0.56147575],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9954808,0.0015096882,0.00028334354,0.00046184123,0.0019293119,0.00033493148],"domain_scores_gemma":[0.99199194,0.0025896365,0.0002769514,0.0010420925,0.0030085752,0.00109087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008308487,0.0015717355,0.002433649,0.0025758494,0.0018323514,0.010488487,0.002388176,0.0025705488,0.06169564],"category_scores_gemma":[0.015769575,0.0005494329,0.0011290509,0.0026602522,0.0027328467,0.006197623,0.0047923233,0.0059444103,0.017390804],"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.00027542474,0.00012759978,0.0007811746,0.00034527786,0.00011703932,0.00013519406,0.00028910078,0.0015713604,0.00035402257,0.04892639,0.72031623,0.2267612],"study_design_scores_gemma":[0.000039230494,0.000045112825,0.0010096519,0.00041988786,0.0000765661,0.0001571027,0.00024225915,0.0042356513,0.00058474677,0.055665106,0.9374799,0.000044868262],"about_ca_topic_score_codex":0.008131421,"about_ca_topic_score_gemma":0.010652204,"teacher_disagreement_score":0.06169564,"about_ca_system_score_codex":0.003857752,"about_ca_system_score_gemma":0.0040120934,"threshold_uncertainty_score":0.20639247},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010472474,0.003962674,0.0029280912,0.005085,0.0010345647,0.000027406712,0.00037573435,0.0011769587,0.98436224],"genre_scores_gemma":[0.0028747392,0.0011475502,0.00092306477,0.00025967736,0.000070136855,0.000013513271,0.00019071248,0.00020022916,0.9943204],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994293,0.000116439514,0.000015070441,0.00009810148,0.0002474191,0.00009362623],"domain_scores_gemma":[0.9992378,0.00015735227,0.000031493062,0.00011664158,0.00024772252,0.0002089782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008938079,0.00073584385,0.00043344696,0.0018583144,0.0022550249,0.0035951822,0.00077569846,0.0013433165,0.2985966],"category_scores_gemma":[0.0018589683,0.00055985764,0.00020442053,0.0030096178,0.0006413803,0.002982853,0.0014493163,0.0016552126,0.118296735],"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.000018824256,0.000016138105,0.00006497333,0.000030615683,8.509451e-7,0.000018341134,0.00008683156,0.000086047105,0.000089981244,0.045628,0.839409,0.11455041],"study_design_scores_gemma":[0.0000048939414,0.000005224529,0.00010598082,0.000025338988,0.0000011468584,0.000023125114,0.000054388278,0.00011231767,0.00008443076,0.0037092734,0.99587137,0.0000025169372],"about_ca_topic_score_codex":0.0133155035,"about_ca_topic_score_gemma":0.027151031,"teacher_disagreement_score":0.2985966,"about_ca_system_score_codex":0.0026298787,"about_ca_system_score_gemma":0.0028005233,"threshold_uncertainty_score":0.9989051},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05037287,0.012822701,0.49865532,0.012922635,0.0029611622,0.0026416625,0.10232617,0.03279384,0.28450367],"genre_scores_gemma":[0.32244304,0.009291708,0.37864107,0.0027746109,0.001029012,0.0036931187,0.19768839,0.0061698747,0.07826915],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965282,0.0013831919,0.00030451705,0.0004529014,0.0010734918,0.00025778793],"domain_scores_gemma":[0.9785846,0.014044893,0.0005056995,0.0028683266,0.0032408363,0.00075572275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059639714,0.0013980963,0.00089360017,0.0028219363,0.0012423464,0.0035112514,0.0028871489,0.0011793869,0.059298523],"category_scores_gemma":[0.030691538,0.001266808,0.0013157185,0.005428138,0.001065866,0.0045471215,0.0022572253,0.003187611,0.014619304],"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.00078838965,0.0010868717,0.0082923155,0.001362636,0.0002800635,0.0002637056,0.0006451992,0.034723457,0.0014666541,0.09700085,0.5378533,0.3162365],"study_design_scores_gemma":[0.0005469814,0.0004556848,0.010770215,0.00053894357,0.00026824055,0.0006582096,0.00047091176,0.1588733,0.0056426185,0.12508394,0.6965811,0.0001098124],"about_ca_topic_score_codex":0.01534697,"about_ca_topic_score_gemma":0.016920576,"teacher_disagreement_score":0.059298523,"about_ca_system_score_codex":0.0024982875,"about_ca_system_score_gemma":0.0031254098,"threshold_uncertainty_score":0.19837332},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053449266,0.00065695704,0.94244564,0.00027081705,0.000023770308,0.0000622859,0.00006023758,0.0006141726,0.002416802],"genre_scores_gemma":[0.7175075,0.0007073586,0.27939638,0.000113232636,0.000034414363,0.00017811089,0.00017392822,0.00013117002,0.001757961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839586,0.00086036924,0.000065487126,0.00022634045,0.0003255981,0.00012634246],"domain_scores_gemma":[0.98812485,0.008507265,0.0007897236,0.0018183071,0.00051902793,0.00024082072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025261405,0.00060456677,0.0009087593,0.0011404792,0.000608115,0.001433952,0.0013404059,0.0010504203,0.002016126],"category_scores_gemma":[0.013946987,0.0006140378,0.0009819224,0.0015814962,0.002899691,0.0040706326,0.0016858291,0.001960537,0.00029945155],"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.00014718897,0.0000594166,0.0007875434,0.000143975,0.000042789725,0.00007252827,0.00023574625,0.82927996,0.0013930383,0.120023035,0.0005408597,0.047273893],"study_design_scores_gemma":[0.000029440565,0.00006262549,0.0002541703,0.000016916745,0.000018956809,0.000038072336,0.000032059328,0.83681434,0.00080803747,0.1605801,0.0013305943,0.000014703439],"about_ca_topic_score_codex":0.0039176657,"about_ca_topic_score_gemma":0.0028690663,"teacher_disagreement_score":0.0039176657,"about_ca_system_score_codex":0.0016650535,"about_ca_system_score_gemma":0.0014214781,"threshold_uncertainty_score":0.013359606},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05597319,0.00027677894,0.9313916,0.0004117765,0.000048545073,0.0002572022,0.00039136436,0.0010782585,0.010171366],"genre_scores_gemma":[0.33131444,0.00031840205,0.6636029,0.00020293912,0.000031773576,0.00032137983,0.00077479845,0.00027078038,0.0031626683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999199,0.00032288692,0.00003899422,0.00011354152,0.00022724108,0.00009841787],"domain_scores_gemma":[0.9987979,0.00083100406,0.00012774329,0.00013175029,0.000075296346,0.00003627652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011641136,0.0009359845,0.0004485148,0.00046420374,0.0003622772,0.0007996019,0.0008204146,0.0005944116,0.002563164],"category_scores_gemma":[0.003305599,0.0005526214,0.00089164695,0.0007733038,0.00082010316,0.0016043633,0.0013711205,0.0016331482,0.00035145084],"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.00021505432,0.00013421124,0.0005339132,0.00026403312,0.00005072729,0.00022905688,0.00021882205,0.8303056,0.007221732,0.061441246,0.0029812818,0.09640435],"study_design_scores_gemma":[0.000078709396,0.00016015225,0.00021656782,0.000048946684,0.00003513907,0.000088039786,0.00014974114,0.8891972,0.009013674,0.09411996,0.0068704644,0.000021486067],"about_ca_topic_score_codex":0.0022754755,"about_ca_topic_score_gemma":0.004856212,"teacher_disagreement_score":0.002563164,"about_ca_system_score_codex":0.00076337956,"about_ca_system_score_gemma":0.0013000347,"threshold_uncertainty_score":0.008574665},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076215053,0.00017758211,0.9190596,0.00011651252,0.00004226421,0.00033615518,0.0013582766,0.06536228,0.005925815],"genre_scores_gemma":[0.05719328,0.00030785945,0.9264279,0.000057435886,0.00002256296,0.00048716852,0.0061894725,0.0042365533,0.0050778897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992423,0.0002587004,0.000046059016,0.00015351892,0.00025460025,0.000044871136],"domain_scores_gemma":[0.99764353,0.0013939519,0.00014285266,0.0003398711,0.00037652676,0.00010323772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097635324,0.0013113943,0.0006156942,0.0016075898,0.00037094188,0.001328424,0.001863832,0.0008443579,0.023093427],"category_scores_gemma":[0.005358361,0.0008172476,0.0007734132,0.00092229433,0.0003284286,0.0013448367,0.0012988453,0.00086041354,0.0064471643],"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.0002390892,0.0002119506,0.0009102287,0.00079654536,0.00005246786,0.00033865412,0.0004928399,0.03839398,0.01480361,0.010367787,0.061203383,0.8721895],"study_design_scores_gemma":[0.00032513685,0.00037374662,0.0014959004,0.00020803738,0.00007237922,0.0009754687,0.0003312252,0.7441496,0.06035532,0.023419507,0.16819596,0.00009773623],"about_ca_topic_score_codex":0.0014320387,"about_ca_topic_score_gemma":0.0019886098,"teacher_disagreement_score":0.023093427,"about_ca_system_score_codex":0.00045275176,"about_ca_system_score_gemma":0.0011222012,"threshold_uncertainty_score":0.07725525},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017808868,0.0022593897,0.9245361,0.00563916,0.00033745935,0.00018857601,0.00017619088,0.0011970507,0.047857206],"genre_scores_gemma":[0.27995148,0.0026342608,0.6928338,0.0013088293,0.00028046308,0.0001500193,0.00042806717,0.00010912763,0.02230406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991773,0.00021471959,0.0000623372,0.000120568715,0.0003491812,0.00007590936],"domain_scores_gemma":[0.9986553,0.0009518725,0.00004212733,0.00011028191,0.00019240551,0.000048001617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012053312,0.0006118935,0.00053579075,0.0022839024,0.0006904237,0.0028803907,0.0018052033,0.0022406185,0.0063130064],"category_scores_gemma":[0.0030734786,0.00048100925,0.00091336225,0.0015987074,0.0014855673,0.0028270185,0.0018120428,0.0019330574,0.0017752014],"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.00034459002,0.0005489586,0.0029269236,0.00067436544,0.00012599785,0.0023762623,0.0011069684,0.045333862,0.01151604,0.3795287,0.011265235,0.5442521],"study_design_scores_gemma":[0.00010115929,0.00027102808,0.0014878928,0.0004523642,0.00034134102,0.0021286441,0.00075425435,0.48422432,0.021536507,0.39805162,0.09057058,0.000080292135],"about_ca_topic_score_codex":0.0022722818,"about_ca_topic_score_gemma":0.0030191906,"teacher_disagreement_score":0.0063130064,"about_ca_system_score_codex":0.0010179306,"about_ca_system_score_gemma":0.0016226092,"threshold_uncertainty_score":0.021119058},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026334603,0.00035850663,0.99497294,0.0004948786,0.0000382836,0.000057309033,0.0000460708,0.00021671604,0.0011818433],"genre_scores_gemma":[0.3978496,0.00066932174,0.59837085,0.0002756151,0.00017919949,0.000355798,0.00019383994,0.000097948454,0.0020078495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947127,0.0022756138,0.0003151007,0.0007467014,0.0016101232,0.0003398815],"domain_scores_gemma":[0.9810426,0.015551099,0.0006681135,0.0012342986,0.0012024081,0.00030145008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00804404,0.0010995718,0.0014188774,0.0022643006,0.0014778867,0.0028751665,0.0024879908,0.0017355218,0.0035177425],"category_scores_gemma":[0.025004866,0.00097208726,0.0020189034,0.0018702504,0.0041999,0.005080459,0.0034044855,0.002999602,0.0004671145],"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.00023726573,0.000092266906,0.00093716505,0.0004060863,0.00016511332,0.00045409604,0.0006333313,0.37353173,0.0018544211,0.5348425,0.0029175626,0.08392841],"study_design_scores_gemma":[0.000067211666,0.000022317043,0.000119865974,0.000030528023,0.000037652346,0.00006856966,0.000066506844,0.5847906,0.001228526,0.41100663,0.0025390612,0.00002257929],"about_ca_topic_score_codex":0.008650903,"about_ca_topic_score_gemma":0.0054423613,"teacher_disagreement_score":0.008650903,"about_ca_system_score_codex":0.0036270237,"about_ca_system_score_gemma":0.002229063,"threshold_uncertainty_score":0.042541444},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015809252,0.00012857966,0.99005216,0.000493907,0.000039465165,0.00008335483,0.0003396124,0.00015949436,0.007122398],"genre_scores_gemma":[0.28570354,0.0005143352,0.6964257,0.00040822325,0.00012902453,0.0008277916,0.0012379369,0.00014121816,0.014612349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997465,0.0011791094,0.00014045168,0.00033777268,0.0007019732,0.00017559022],"domain_scores_gemma":[0.99409664,0.004243839,0.0002689954,0.00044758813,0.0007793055,0.0001636854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041424907,0.001008985,0.00095182844,0.0014324643,0.0007580746,0.0029030018,0.0031690865,0.0015966067,0.01724593],"category_scores_gemma":[0.01282154,0.0006809183,0.0017321208,0.001529053,0.001827587,0.0038627507,0.0015835771,0.002270755,0.0019201484],"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.00006220368,0.000053440574,0.00019187786,0.00012408537,0.000038650487,0.00011479874,0.00018030638,0.12963909,0.00046363097,0.8416882,0.0028811367,0.024562603],"study_design_scores_gemma":[0.000028096125,0.000013542817,0.000038966115,0.000023517005,0.000020716194,0.000029803417,0.000039816623,0.36493096,0.00029145402,0.6302734,0.004298107,0.000011573516],"about_ca_topic_score_codex":0.0063495054,"about_ca_topic_score_gemma":0.003959636,"teacher_disagreement_score":0.01724593,"about_ca_system_score_codex":0.0029760357,"about_ca_system_score_gemma":0.002211906,"threshold_uncertainty_score":0.057693362},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0124676665,0.0023651929,0.9634134,0.00083465094,0.00008857114,0.00007269264,0.00015071547,0.00041657628,0.02019059],"genre_scores_gemma":[0.4489651,0.0066892793,0.52518684,0.00020589227,0.00017034332,0.00032599573,0.000576343,0.0002850988,0.017595053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877113,0.0003731108,0.00007513824,0.00024428655,0.00045003218,0.00008627336],"domain_scores_gemma":[0.997449,0.0019859239,0.00013748577,0.00023012217,0.00011403678,0.00008342251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001441899,0.0010471042,0.00090856367,0.0006416176,0.00057273,0.0021870232,0.0014731586,0.0009119731,0.0034099794],"category_scores_gemma":[0.0038695121,0.0007829275,0.0011196913,0.0015708549,0.0019464663,0.0038321358,0.0021687122,0.002411178,0.00055034534],"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.00007224011,0.00003780679,0.0006255161,0.00023296551,0.000057601592,0.00027829182,0.00032399676,0.57516026,0.0016674808,0.30910042,0.0032012851,0.10924211],"study_design_scores_gemma":[0.00002209001,0.00002667905,0.00026228957,0.00008058827,0.00002894749,0.00014572805,0.00008606577,0.6274492,0.0014058128,0.35515648,0.01531208,0.00002406799],"about_ca_topic_score_codex":0.0062352107,"about_ca_topic_score_gemma":0.0052240766,"teacher_disagreement_score":0.0062352107,"about_ca_system_score_codex":0.0018990799,"about_ca_system_score_gemma":0.002231939,"threshold_uncertainty_score":0.013778865},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039200024,0.00008615271,0.98963916,0.00037986116,0.000020830512,0.00037930842,0.0003008967,0.0032005967,0.0020731066],"genre_scores_gemma":[0.04722852,0.000067834444,0.95093334,0.00006749019,0.00000894548,0.00023428464,0.00041709427,0.00008547643,0.0009569799],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988104,0.0005716815,0.00010009958,0.00016310035,0.00030122275,0.00005343269],"domain_scores_gemma":[0.9974744,0.0016472262,0.00013853498,0.0002839681,0.0003885515,0.00006725115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021320072,0.0007851899,0.00049484585,0.001523898,0.00075258897,0.0016299698,0.001427076,0.0010256828,0.008800122],"category_scores_gemma":[0.0074255783,0.00042085437,0.00092001643,0.001110204,0.0005503532,0.0012935823,0.0015536685,0.0010675326,0.0010982304],"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.0003646121,0.0002753511,0.002287808,0.0011066125,0.00019122474,0.0008913803,0.0024387792,0.13254035,0.018521719,0.08487408,0.01743372,0.73907447],"study_design_scores_gemma":[0.00014383976,0.00010633443,0.0009480527,0.00015850857,0.000100901205,0.00039274018,0.0004102002,0.86763906,0.011773389,0.05665257,0.06160171,0.0000726516],"about_ca_topic_score_codex":0.0036956223,"about_ca_topic_score_gemma":0.005903721,"teacher_disagreement_score":0.008800122,"about_ca_system_score_codex":0.0007784227,"about_ca_system_score_gemma":0.00157133,"threshold_uncertainty_score":0.02943933},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011178528,0.0054691536,0.7656687,0.0016229141,0.0007188385,0.00034744348,0.014256194,0.014907502,0.18583077],"genre_scores_gemma":[0.13339649,0.008008982,0.54648983,0.0010258578,0.00036536317,0.00048208813,0.05364828,0.003139972,0.25344318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931765,0.000074120464,0.00008923377,0.00018382538,0.00029549416,0.000039729635],"domain_scores_gemma":[0.999087,0.00014383474,0.000028497714,0.0005372931,0.00016298704,0.000040443436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005564958,0.00072782603,0.0009721984,0.0016361418,0.0006956062,0.003691648,0.0016912612,0.0006103293,0.047419816],"category_scores_gemma":[0.0023530426,0.0006984643,0.0007926785,0.0038040064,0.00046880307,0.0053261495,0.0017231093,0.0009999222,0.023072883],"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.00013724987,0.00007132922,0.0004824414,0.00038445205,0.00004927316,0.00012483927,0.00013381666,0.0021924572,0.0031438852,0.16794837,0.0951968,0.73013514],"study_design_scores_gemma":[0.000036857386,0.000059974253,0.00044771584,0.00014601172,0.00007082441,0.0010842057,0.00014184085,0.01378457,0.009620814,0.28904706,0.68553144,0.000028724851],"about_ca_topic_score_codex":0.0010852339,"about_ca_topic_score_gemma":0.0014310163,"teacher_disagreement_score":0.047419816,"about_ca_system_score_codex":0.00051067007,"about_ca_system_score_gemma":0.00085177337,"threshold_uncertainty_score":0.15863508},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9501998,0.0015842038,0.030978648,0.0003893983,0.00048275047,0.00062515645,0.001497143,0.0032165032,0.011026268],"genre_scores_gemma":[0.9358093,0.00061524723,0.054370336,0.00019363934,0.00006583763,0.0006214811,0.002571313,0.00077310466,0.0049796714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784696,0.0009417805,0.0002959442,0.00042835914,0.00031639548,0.00017055369],"domain_scores_gemma":[0.92419386,0.0672711,0.0011669853,0.0042142123,0.0024008676,0.00075300934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029824406,0.001763322,0.0014445405,0.0008748036,0.0006359093,0.0015871358,0.0038751608,0.0024754463,0.009647606],"category_scores_gemma":[0.04466337,0.001228872,0.0005869477,0.0013494093,0.0010414629,0.0031850063,0.0012760315,0.0022108825,0.0019864417],"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.04166374,0.027625702,0.0060559288,0.005476539,0.00097077206,0.001144562,0.0042925524,0.3651699,0.04937829,0.0056884736,0.016267708,0.47626582],"study_design_scores_gemma":[0.00868026,0.012325917,0.005341061,0.00036752256,0.0009777771,0.0005320337,0.0013516145,0.8802572,0.07009092,0.009762816,0.010024887,0.00028803287],"about_ca_topic_score_codex":0.0069008507,"about_ca_topic_score_gemma":0.0036902505,"teacher_disagreement_score":0.009647606,"about_ca_system_score_codex":0.0010014762,"about_ca_system_score_gemma":0.0009916447,"threshold_uncertainty_score":0.032274485},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075254203,0.17666624,0.20585304,0.08647727,0.20083636,0.0005392656,0.0040144147,0.002329223,0.31575882],"genre_scores_gemma":[0.124851644,0.11968565,0.11034503,0.010087477,0.08485486,0.00093923305,0.010776918,0.002114334,0.5363448],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99567467,0.0014304408,0.00027958222,0.0004666245,0.0018420304,0.00030674782],"domain_scores_gemma":[0.9918893,0.0024258934,0.0003333349,0.00121352,0.00292907,0.0012088967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008340474,0.0015202906,0.0021949396,0.0026956866,0.0015843131,0.011216968,0.0020663952,0.0024514836,0.062700205],"category_scores_gemma":[0.01580318,0.0005461742,0.0011199942,0.0026617276,0.0025210585,0.00626215,0.005145034,0.005809474,0.017075455],"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.00028821095,0.00013751947,0.00080744666,0.0003762875,0.00013657165,0.0001398005,0.00025422793,0.0018148312,0.0004951345,0.05798489,0.68129694,0.25626817],"study_design_scores_gemma":[0.000037189227,0.000047528833,0.0008408943,0.00040975233,0.0000643535,0.00013493172,0.00017279833,0.004821478,0.00054695935,0.0587817,0.93410486,0.00003743911],"about_ca_topic_score_codex":0.004675618,"about_ca_topic_score_gemma":0.0052591083,"teacher_disagreement_score":0.062700205,"about_ca_system_score_codex":0.0031843614,"about_ca_system_score_gemma":0.0038755971,"threshold_uncertainty_score":0.2097531},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025869329,0.00044685623,0.96310633,0.0014122096,0.00004387483,0.0007005046,0.00023713215,0.0019443196,0.0062394403],"genre_scores_gemma":[0.29160616,0.00056254753,0.7050476,0.00025981152,0.000053334497,0.00050145603,0.00072394626,0.00016598927,0.0010791497],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98966026,0.005025379,0.001312814,0.0014272438,0.0021330724,0.00044128543],"domain_scores_gemma":[0.9648963,0.027548356,0.0019812302,0.0033971907,0.0016771579,0.0004997918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0141221685,0.0015526658,0.0013280716,0.00929793,0.0024222904,0.0057026157,0.005154002,0.0032892693,0.005719764],"category_scores_gemma":[0.07267948,0.0018048278,0.0019494346,0.0045592464,0.0045199487,0.014332731,0.005920772,0.0024369864,0.00092177565],"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.00040356518,0.00071256113,0.0084834695,0.0008134666,0.00027233743,0.0024884304,0.0077882796,0.3836435,0.0031964907,0.15968578,0.004832462,0.4276797],"study_design_scores_gemma":[0.00013767369,0.000063039784,0.0009987317,0.00025859376,0.00015299142,0.00046084865,0.0011732469,0.7870234,0.0046272674,0.19102032,0.013965217,0.00011866754],"about_ca_topic_score_codex":0.017064758,"about_ca_topic_score_gemma":0.01849599,"teacher_disagreement_score":0.017064758,"about_ca_system_score_codex":0.0038660034,"about_ca_system_score_gemma":0.0030654636,"threshold_uncertainty_score":0.07468611},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026609395,0.00101347,0.9883819,0.0001987198,0.00006914403,0.000034647554,0.000058672824,0.00048646095,0.0070959465],"genre_scores_gemma":[0.15448195,0.001822609,0.8365712,0.00015584641,0.00011741488,0.00023623105,0.0003332126,0.00031487082,0.0059667025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986576,0.0005905268,0.00009429677,0.00015900574,0.00038057796,0.00011800807],"domain_scores_gemma":[0.9980888,0.0012355901,0.00006117297,0.0004804533,0.00008753251,0.000046484045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014925835,0.0012323222,0.0015334169,0.0012894523,0.0007638737,0.0023464598,0.0020465965,0.0011050949,0.00800861],"category_scores_gemma":[0.0053255227,0.001328865,0.0024530385,0.0021460617,0.002800947,0.0055065393,0.0035704768,0.0037778101,0.0012038064],"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.00016146156,0.00004901478,0.00023737388,0.0004950936,0.00011947057,0.00014909204,0.00047544323,0.13520825,0.0016352928,0.67009264,0.004905598,0.18647134],"study_design_scores_gemma":[0.0000350238,0.000034122673,0.00007890989,0.00007258748,0.00006493384,0.00007076028,0.00005392412,0.19930317,0.0011365323,0.7844718,0.014652918,0.000025304746],"about_ca_topic_score_codex":0.0028606607,"about_ca_topic_score_gemma":0.003264621,"teacher_disagreement_score":0.00800861,"about_ca_system_score_codex":0.0011882348,"about_ca_system_score_gemma":0.000994866,"threshold_uncertainty_score":0.026791453},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06628146,0.0004555131,0.9311448,0.00017166382,0.000051356918,0.00020882791,0.00014521812,0.0005018783,0.0010393405],"genre_scores_gemma":[0.4358828,0.00021824897,0.5618601,0.00017720144,0.00007123767,0.0004342067,0.0004981608,0.00011214957,0.0007458226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963387,0.0019420297,0.00022024858,0.0005171818,0.00076267193,0.00021926295],"domain_scores_gemma":[0.9626257,0.027394367,0.0029420587,0.0031354616,0.0030970813,0.0008053234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008581035,0.0008774997,0.0013408229,0.0027392884,0.00067520514,0.0018226668,0.0021518325,0.0014515871,0.0013321331],"category_scores_gemma":[0.04210436,0.0009281956,0.0014873828,0.0021683099,0.0014066463,0.0037060063,0.00129666,0.0020817262,0.00032166185],"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.00042051863,0.00019898514,0.021312414,0.00017976348,0.00015849342,0.00005274604,0.00023572093,0.82698274,0.0015477395,0.041274413,0.0014542461,0.10618209],"study_design_scores_gemma":[0.000013653786,0.000044027864,0.00053381466,0.000012161417,0.000010632443,0.000011914553,0.000015686346,0.98543537,0.000508205,0.013116418,0.00028705696,0.000011114622],"about_ca_topic_score_codex":0.0056502745,"about_ca_topic_score_gemma":0.0066252486,"teacher_disagreement_score":0.008581035,"about_ca_system_score_codex":0.0023486586,"about_ca_system_score_gemma":0.002506505,"threshold_uncertainty_score":0.045381367},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13970958,0.00020971229,0.85419947,0.00021801327,0.000036046964,0.00015144648,0.00015194673,0.0035459965,0.0017777923],"genre_scores_gemma":[0.6779828,0.00009889608,0.32001996,0.00007897778,0.000036073656,0.00006996095,0.00044496002,0.00016378814,0.0011045663],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998703,0.00027172163,0.00015261548,0.00028522874,0.0004604823,0.00012686726],"domain_scores_gemma":[0.9861622,0.0072375573,0.0011531893,0.002885208,0.0022111323,0.00035075276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024678772,0.0005116655,0.0007439889,0.0017441531,0.00060554186,0.0015023879,0.0024562436,0.0008708037,0.0025511964],"category_scores_gemma":[0.019137396,0.000681114,0.0005774166,0.0011558374,0.00072111253,0.0037872922,0.0018056475,0.001452221,0.0004921887],"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.00034830175,0.00049104396,0.0070716427,0.00008935409,0.00007671735,0.00020133797,0.00042066636,0.07728655,0.0060348944,0.0049353526,0.0021805556,0.90086365],"study_design_scores_gemma":[0.000041603624,0.00009960784,0.0013470207,0.000035657555,0.0000649037,0.000111768255,0.00009150062,0.9725471,0.008544688,0.016179757,0.00091836625,0.000018056175],"about_ca_topic_score_codex":0.0039199293,"about_ca_topic_score_gemma":0.005524733,"teacher_disagreement_score":0.0039199293,"about_ca_system_score_codex":0.0006775816,"about_ca_system_score_gemma":0.000960713,"threshold_uncertainty_score":0.01305151},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012318288,0.015878296,0.8044581,0.010552107,0.0006019308,0.0008719829,0.0017756977,0.0024631172,0.1510806],"genre_scores_gemma":[0.19376744,0.022356303,0.74997133,0.0016409765,0.0007109986,0.0022025744,0.0023841958,0.00066668366,0.026299428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983341,0.00045783207,0.00033645495,0.0002750748,0.00045522198,0.00014138829],"domain_scores_gemma":[0.9967962,0.0017491045,0.00027411774,0.00046334523,0.00054906984,0.00016812794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019775643,0.0014622451,0.00060261076,0.0032304511,0.0019546917,0.0052028433,0.0017146914,0.0018856819,0.022922048],"category_scores_gemma":[0.0079843225,0.0008961717,0.0015508027,0.0040034866,0.0027222396,0.010092254,0.0020491818,0.002992927,0.005019118],"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.00009972327,0.000118871154,0.0030467124,0.0021763823,0.000058864905,0.00041000516,0.0033846274,0.00263759,0.0030248496,0.6397153,0.020454776,0.32487231],"study_design_scores_gemma":[0.000021025595,0.0001159387,0.0039040786,0.00072482915,0.00006627468,0.0013597191,0.0012586246,0.010734682,0.0021072526,0.8230293,0.15660658,0.00007171403],"about_ca_topic_score_codex":0.004394043,"about_ca_topic_score_gemma":0.004082166,"teacher_disagreement_score":0.022922048,"about_ca_system_score_codex":0.0022663376,"about_ca_system_score_gemma":0.0017032219,"threshold_uncertainty_score":0.07668185},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036659148,0.0020363939,0.7009662,0.00079609704,0.00041953844,0.0007527767,0.004268984,0.15444873,0.09965212],"genre_scores_gemma":[0.21909541,0.001721652,0.6531437,0.00086989155,0.00021455043,0.0007856638,0.008338547,0.0030696392,0.11276089],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997795,0.000028055807,0.000011840577,0.00004869181,0.00009902088,0.000032870266],"domain_scores_gemma":[0.99983644,0.000031146465,0.000008929674,0.000023989342,0.000053300344,0.000046132973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002865911,0.00061927,0.00041713403,0.0006468358,0.0004209918,0.0009637961,0.001683477,0.0007297846,0.03102224],"category_scores_gemma":[0.000449529,0.00029959664,0.00023418046,0.000522604,0.00019336393,0.0011299358,0.0010879624,0.0006602187,0.009470528],"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.00093093526,0.00037317825,0.0016774319,0.00042658835,0.000048600166,0.00012935053,0.00023990929,0.013213913,0.027012961,0.007777885,0.10840957,0.83975977],"study_design_scores_gemma":[0.0004994652,0.0010128404,0.0043927426,0.00016293327,0.00014571784,0.0008134754,0.00022542203,0.24467435,0.05839892,0.011258048,0.67826396,0.0001521799],"about_ca_topic_score_codex":0.0037865941,"about_ca_topic_score_gemma":0.0044472585,"teacher_disagreement_score":0.03102224,"about_ca_system_score_codex":0.00051262084,"about_ca_system_score_gemma":0.0008486172,"threshold_uncertainty_score":0.10377979},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005624422,0.0003241931,0.9794496,0.0013613666,0.00006913669,0.00017686588,0.00019355425,0.001300693,0.011500062],"genre_scores_gemma":[0.0766876,0.00069338287,0.91839015,0.00040182658,0.000090183166,0.00029531372,0.00036151166,0.0002862344,0.0027937738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996935,0.0012980187,0.00023601374,0.000489794,0.000772983,0.00026815676],"domain_scores_gemma":[0.99671304,0.0019414052,0.00020610186,0.000742619,0.0002480469,0.00014875927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004153052,0.0009590453,0.00060327194,0.0017411247,0.0011742858,0.002921735,0.0033741198,0.0014372962,0.004769116],"category_scores_gemma":[0.0057981987,0.0010259374,0.0029393157,0.00208985,0.004745184,0.007987451,0.0047850856,0.004665032,0.0010653203],"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.00009905682,0.00008297324,0.000504402,0.00040091207,0.000040649582,0.0002896349,0.0008492329,0.05474275,0.0027205322,0.8096435,0.0039116805,0.12671459],"study_design_scores_gemma":[0.000071514376,0.00008838405,0.00012711037,0.0001222356,0.000054843218,0.00021384301,0.00019326109,0.2048312,0.0036761893,0.73768955,0.05290132,0.000030478626],"about_ca_topic_score_codex":0.006215814,"about_ca_topic_score_gemma":0.00921071,"teacher_disagreement_score":0.006215814,"about_ca_system_score_codex":0.0019036343,"about_ca_system_score_gemma":0.0039486033,"threshold_uncertainty_score":0.021963716},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009221348,0.037585516,0.06864807,0.012203348,0.0016908812,0.00006122556,0.0004500274,0.00035019705,0.8780887],"genre_scores_gemma":[0.36750692,0.051504694,0.11769734,0.012703446,0.004684257,0.00076021464,0.0021630132,0.0010729284,0.44190723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981013,0.0010049009,0.00009477701,0.0003316407,0.00035485282,0.00011251024],"domain_scores_gemma":[0.99856514,0.0009137913,0.000056134846,0.00024238866,0.00017773999,0.00004476224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023510274,0.0011785008,0.0006505607,0.00219142,0.0030538812,0.006966718,0.0018053941,0.0021417476,0.03175718],"category_scores_gemma":[0.004444964,0.0006683191,0.00071205944,0.002030272,0.013711199,0.010740057,0.0026203478,0.0047438126,0.008687017],"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.000003849911,0.00000259178,0.000017668244,0.000046167203,0.0000034188602,0.000017647228,0.00036286245,0.000089309375,0.000020122809,0.9814828,0.010610749,0.0073428657],"study_design_scores_gemma":[0.000003752228,0.0000025955403,0.000039898037,0.00010823393,0.0000036781446,0.00004219156,0.00016637586,0.00020679289,0.00004969906,0.83248305,0.16688965,0.0000041481203],"about_ca_topic_score_codex":0.0051318877,"about_ca_topic_score_gemma":0.0040468974,"teacher_disagreement_score":0.03175718,"about_ca_system_score_codex":0.0049494253,"about_ca_system_score_gemma":0.002138945,"threshold_uncertainty_score":0.106238365},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039799567,0.00050825684,0.98485106,0.0010083113,0.00005618783,0.000031030726,0.000099481156,0.0001650528,0.009300659],"genre_scores_gemma":[0.41638497,0.004199276,0.54737616,0.0015023971,0.00089306844,0.000604549,0.0006002263,0.00067613035,0.027763251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786323,0.0009545278,0.0000985072,0.0004494782,0.0004529693,0.00018124814],"domain_scores_gemma":[0.9913982,0.0057206587,0.0005512951,0.0010916727,0.0007933026,0.00044485604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037531897,0.0013817884,0.0013227855,0.0024911454,0.0012274389,0.0029636107,0.0027529383,0.002418522,0.009393827],"category_scores_gemma":[0.014418821,0.0011540448,0.0021192813,0.002903855,0.005336342,0.008616012,0.0034293972,0.005496232,0.0015874321],"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.000010750059,0.00001997524,0.00012206108,0.000035534373,0.000011981287,0.000024254392,0.00006736618,0.044184588,0.000099368954,0.9461278,0.0012687885,0.008027682],"study_design_scores_gemma":[0.0000045504034,0.000008327832,0.000032273325,0.000016568158,0.0000056016625,0.000009466451,0.000014059711,0.08754774,0.000055789216,0.9107676,0.0015310056,0.0000070206866],"about_ca_topic_score_codex":0.007093493,"about_ca_topic_score_gemma":0.007086732,"teacher_disagreement_score":0.009393827,"about_ca_system_score_codex":0.0028654416,"about_ca_system_score_gemma":0.0028271005,"threshold_uncertainty_score":0.031425536},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020496706,0.00042072323,0.9528285,0.0007049192,0.00011276314,0.0003383583,0.00039341897,0.0032744466,0.0214301],"genre_scores_gemma":[0.30989057,0.0006563263,0.6797035,0.0003210659,0.00007239373,0.00029834476,0.0012136406,0.00027034257,0.0075738328],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616724,0.0012959767,0.00034804313,0.0005709323,0.0013736208,0.0002441735],"domain_scores_gemma":[0.9890749,0.007985289,0.00029330113,0.0017456991,0.0006603396,0.00024040762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040318193,0.0009820912,0.001005515,0.0022109773,0.00090839533,0.0059257695,0.005149202,0.002085483,0.014085351],"category_scores_gemma":[0.015779555,0.0012595113,0.0014475053,0.0020669037,0.0014239752,0.007647687,0.004664352,0.0022442236,0.002812815],"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.0013270491,0.0012361102,0.0033527773,0.0010237272,0.00029337496,0.0013442287,0.0029221976,0.046853784,0.017075792,0.2498747,0.013767521,0.6609287],"study_design_scores_gemma":[0.00026987548,0.00014684963,0.0005537335,0.00028101937,0.00036237095,0.0008725976,0.00090064335,0.4513246,0.049620856,0.45070705,0.04486032,0.00010008948],"about_ca_topic_score_codex":0.0019334789,"about_ca_topic_score_gemma":0.0023213408,"teacher_disagreement_score":0.014085351,"about_ca_system_score_codex":0.00075214956,"about_ca_system_score_gemma":0.0010659137,"threshold_uncertainty_score":0.047120214},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010639884,0.0003420534,0.9845213,0.00021377839,0.00005148444,0.000093178285,0.00013315235,0.00071587024,0.0032893042],"genre_scores_gemma":[0.16464178,0.00032470585,0.8305668,0.00031520228,0.000044434393,0.00032340418,0.0005148455,0.00022766936,0.0030410565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990878,0.0003382599,0.00006220752,0.00013747586,0.0002606605,0.000113562244],"domain_scores_gemma":[0.9987882,0.000549641,0.00011784097,0.00022764991,0.0002445961,0.00007209728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015607219,0.0007513453,0.0013333998,0.0011371304,0.0007102973,0.001078265,0.001906514,0.0014563396,0.003981708],"category_scores_gemma":[0.004434727,0.00059583905,0.0009930932,0.0019319281,0.0009969543,0.0017445101,0.0015027692,0.0009933742,0.0013125332],"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.00038420776,0.00013104077,0.0028398563,0.00025603277,0.00014750165,0.00017562405,0.0003088872,0.59326375,0.0072668497,0.07762874,0.01513498,0.30246255],"study_design_scores_gemma":[0.000055660024,0.00007013196,0.0001476925,0.000021277465,0.000032441538,0.00007531412,0.000030460953,0.9716341,0.0011229452,0.022858994,0.0039368537,0.000014002707],"about_ca_topic_score_codex":0.0046903384,"about_ca_topic_score_gemma":0.006682053,"teacher_disagreement_score":0.0046903384,"about_ca_system_score_codex":0.0009888606,"about_ca_system_score_gemma":0.0029066037,"threshold_uncertainty_score":0.013320148},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008485925,0.00020355248,0.9892714,0.000089500034,0.000024313427,0.00003487939,0.00011534623,0.0005077948,0.0012672046],"genre_scores_gemma":[0.38407195,0.00040134435,0.61334354,0.00006153918,0.000037437334,0.0001170097,0.0003038551,0.00010862915,0.0015546555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926776,0.00024406164,0.000069420654,0.000118679316,0.0002485805,0.00005147253],"domain_scores_gemma":[0.9967855,0.0021517826,0.00019364862,0.00041880828,0.00034204344,0.000108061424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020255877,0.00048050535,0.00071298226,0.0018117178,0.00043684716,0.0020814994,0.0019752588,0.000849274,0.0031102365],"category_scores_gemma":[0.007862336,0.00059524504,0.0008412216,0.002186087,0.0011485202,0.003807781,0.0010962088,0.0010380113,0.00041624877],"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.00024161742,0.00017478263,0.0025733178,0.00013647076,0.0001181466,0.00027056655,0.00047192164,0.54478604,0.003627567,0.1454716,0.0024474813,0.29968047],"study_design_scores_gemma":[0.000016048452,0.00001642162,0.00032436408,0.000013134728,0.000022980257,0.00007726314,0.000035828456,0.93493783,0.0011080251,0.062179107,0.0012518367,0.000017199489],"about_ca_topic_score_codex":0.014377301,"about_ca_topic_score_gemma":0.010327319,"teacher_disagreement_score":0.014377301,"about_ca_system_score_codex":0.001266647,"about_ca_system_score_gemma":0.00077902415,"threshold_uncertainty_score":0.028587222},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031713168,0.003180908,0.9905969,0.0005398007,0.00009867479,0.000027727643,0.00009485969,0.0001269559,0.0021628626],"genre_scores_gemma":[0.3820437,0.007940295,0.60261416,0.00043844176,0.0016829967,0.0005327304,0.00040302132,0.00026281265,0.0040818467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925012,0.0026652776,0.00060493086,0.0014798125,0.0025584272,0.00019038498],"domain_scores_gemma":[0.96943015,0.020026961,0.0048800115,0.0026469538,0.0022838416,0.0007321679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008833513,0.0020687752,0.0017069825,0.008017547,0.00085281616,0.0041758004,0.002083879,0.0021217049,0.0020495357],"category_scores_gemma":[0.03320321,0.0007550749,0.0015968592,0.0041951584,0.0074425195,0.00881061,0.004153888,0.004204266,0.00053528004],"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.00009406012,0.000108341446,0.008571993,0.00058809586,0.00035398832,0.00013531797,0.00075541553,0.16420433,0.0030623525,0.5684588,0.0039189626,0.24974835],"study_design_scores_gemma":[0.000009804168,0.00009771951,0.002063355,0.00020305722,0.000054007334,0.00015605528,0.00012406326,0.41059497,0.0011939807,0.5781712,0.0072262813,0.00010547936],"about_ca_topic_score_codex":0.0015825394,"about_ca_topic_score_gemma":0.0007899262,"teacher_disagreement_score":0.008833513,"about_ca_system_score_codex":0.0019634427,"about_ca_system_score_gemma":0.0011291347,"threshold_uncertainty_score":0.04671663},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070466874,0.0000896198,0.9872491,0.00011939118,0.000017115317,0.000055176733,0.000099766956,0.0003431356,0.0049800747],"genre_scores_gemma":[0.35655978,0.00032410724,0.63675976,0.000092559654,0.00003341666,0.00024169603,0.00042091656,0.00014523705,0.0054225107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995741,0.00013127878,0.000021474578,0.00008679266,0.00014156876,0.000044849327],"domain_scores_gemma":[0.99970895,0.00013138467,0.000029039822,0.000036822992,0.00006813509,0.00002558638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007685774,0.0005414194,0.00032445844,0.0006265252,0.00044730093,0.0006962977,0.00075278373,0.00037780736,0.0032529691],"category_scores_gemma":[0.001345039,0.0002217817,0.00049779395,0.0010092494,0.00041407841,0.0008821208,0.0005569686,0.0005560552,0.0005168407],"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.000050073955,0.000041806168,0.00045173924,0.00007459503,0.00002788939,0.000046403682,0.00008556213,0.8937349,0.002372824,0.017207352,0.0017071741,0.08419968],"study_design_scores_gemma":[0.000009977434,0.00002260647,0.000108805245,0.00000527148,0.000012727605,0.000013183584,0.000017292183,0.98626584,0.0008724353,0.009947427,0.0027183574,0.0000061818564],"about_ca_topic_score_codex":0.01501058,"about_ca_topic_score_gemma":0.022563059,"teacher_disagreement_score":0.01501058,"about_ca_system_score_codex":0.0010660721,"about_ca_system_score_gemma":0.0017664378,"threshold_uncertainty_score":0.02984643},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061933594,0.18215573,0.16498196,0.08563344,0.1750506,0.00043182983,0.0031839572,0.001988759,0.38038033],"genre_scores_gemma":[0.10562468,0.112864785,0.08799724,0.008429186,0.082608126,0.0007203198,0.006921137,0.0018872065,0.59294724],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99553114,0.0014310996,0.00027208505,0.0004728589,0.0019770884,0.00031578855],"domain_scores_gemma":[0.9921503,0.0022582565,0.00028566553,0.0010250094,0.0031111708,0.0011695687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074377307,0.0014021712,0.002219528,0.002623137,0.0017708872,0.011206702,0.002073945,0.0024462882,0.06278197],"category_scores_gemma":[0.014185104,0.0005030015,0.0011191762,0.002696407,0.0025725842,0.0058182743,0.004858436,0.005494038,0.017170286],"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.00023553918,0.00012541642,0.0006905276,0.0003260518,0.00010677699,0.0001458066,0.00029567388,0.0013064393,0.00041146198,0.056396037,0.705249,0.23471126],"study_design_scores_gemma":[0.000024431198,0.000034342305,0.00064082886,0.00031009672,0.00004675482,0.00011652295,0.00016381391,0.0025594279,0.0004090459,0.041313905,0.95435077,0.00002998733],"about_ca_topic_score_codex":0.0059201936,"about_ca_topic_score_gemma":0.0074461205,"teacher_disagreement_score":0.06278197,"about_ca_system_score_codex":0.0034116535,"about_ca_system_score_gemma":0.0039894767,"threshold_uncertainty_score":0.21002656},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033739896,0.00033413555,0.9748906,0.0013807793,0.00015056317,0.00014673648,0.00028256886,0.00082760403,0.018613033],"genre_scores_gemma":[0.23457333,0.0010738113,0.74925923,0.00086539367,0.00032241203,0.00072496437,0.0006701631,0.00037991846,0.012130847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972771,0.00064745406,0.00035146787,0.000454544,0.0009818815,0.00028767943],"domain_scores_gemma":[0.99816483,0.0007170752,0.00017507111,0.00037013067,0.00035703453,0.00021585764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032008702,0.00093855854,0.00066854816,0.0014985872,0.0018539185,0.0055863396,0.0025725584,0.0016375007,0.005920901],"category_scores_gemma":[0.0040160245,0.0009600752,0.0020878161,0.0015909472,0.005141633,0.008141441,0.0040602684,0.0047072535,0.0011474836],"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.000011431642,0.000013304283,0.000028390617,0.000034761466,0.0000047764142,0.00013330427,0.00038640486,0.0028399257,0.00059462606,0.99136025,0.0006580997,0.003934733],"study_design_scores_gemma":[0.000059692688,0.00003202777,0.00005966594,0.000052421026,0.000025695945,0.00027625376,0.00024857707,0.034881335,0.0017522637,0.89660656,0.065966964,0.00003837421],"about_ca_topic_score_codex":0.005056267,"about_ca_topic_score_gemma":0.004366319,"teacher_disagreement_score":0.005920901,"about_ca_system_score_codex":0.0031424998,"about_ca_system_score_gemma":0.0027391126,"threshold_uncertainty_score":0.022800565},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039530545,0.00020372786,0.98266876,0.00008898455,0.000029594252,0.00010505239,0.00012631476,0.0107400725,0.0020843863],"genre_scores_gemma":[0.04082382,0.00020388115,0.955131,0.00006731935,0.000016062713,0.000086418746,0.00053298706,0.0010815058,0.00205707],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987099,0.00030420913,0.00009317667,0.000306681,0.000470092,0.00011588418],"domain_scores_gemma":[0.9977696,0.00082703476,0.0001139182,0.00075833034,0.0004573459,0.00007380181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014026826,0.0010791817,0.0013246761,0.0014968365,0.00081126735,0.0040894016,0.0030377773,0.0018003098,0.010526557],"category_scores_gemma":[0.004734353,0.0015045732,0.0017560992,0.0011504496,0.0015369648,0.0030922338,0.0036164238,0.002348871,0.004364485],"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.0002685982,0.00017360953,0.0009790028,0.0005646124,0.00010770853,0.0004672207,0.0009838088,0.04047441,0.044219818,0.05510763,0.017417537,0.839236],"study_design_scores_gemma":[0.000106774976,0.00009805859,0.0007259369,0.00015933583,0.00010184469,0.00047631626,0.00040710747,0.74183327,0.084363624,0.0943874,0.07728017,0.00006025116],"about_ca_topic_score_codex":0.002237639,"about_ca_topic_score_gemma":0.0039339624,"teacher_disagreement_score":0.010526557,"about_ca_system_score_codex":0.0008298102,"about_ca_system_score_gemma":0.001289464,"threshold_uncertainty_score":0.0352149},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03543668,0.00049890555,0.95709246,0.00038010333,0.00013975287,0.00023812134,0.0001279825,0.004007674,0.002078336],"genre_scores_gemma":[0.6845491,0.00059538515,0.31226256,0.00015299639,0.000115454255,0.00026425297,0.00023583525,0.00015575203,0.0016686848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984188,0.0007300927,0.00017555946,0.00018058899,0.00040722796,0.000087767956],"domain_scores_gemma":[0.99498135,0.0032121267,0.00042607688,0.0006075835,0.00059347943,0.00017935144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029886572,0.00065729144,0.0006310759,0.00096202694,0.0006494373,0.0021014793,0.0011898545,0.0010657705,0.0020722216],"category_scores_gemma":[0.007069611,0.00029028123,0.00040375316,0.00075565587,0.00089725177,0.003242212,0.000982569,0.0011519069,0.000468983],"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.0018172323,0.00060140033,0.0053397915,0.00067173445,0.00017278209,0.00083973864,0.0012263008,0.46411127,0.026312483,0.10317642,0.004668989,0.3910619],"study_design_scores_gemma":[0.00015008233,0.00020968214,0.00043326328,0.00004650207,0.00006183503,0.0001305787,0.00008229364,0.92210066,0.024532015,0.04210722,0.010102406,0.000043412172],"about_ca_topic_score_codex":0.0017455494,"about_ca_topic_score_gemma":0.0014704347,"teacher_disagreement_score":0.0029886572,"about_ca_system_score_codex":0.00088111573,"about_ca_system_score_gemma":0.00060452963,"threshold_uncertainty_score":0.015805662},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23837563,0.000515064,0.74804246,0.00070683047,0.000053448297,0.00011944656,0.000082330815,0.0017140269,0.0103908],"genre_scores_gemma":[0.8891218,0.00020031523,0.10761359,0.0002279451,0.000015982445,0.00016324014,0.00016805805,0.00029290063,0.0021961546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780446,0.000790024,0.00010017038,0.00041757963,0.00051737495,0.00037037337],"domain_scores_gemma":[0.9769966,0.014521029,0.0021555156,0.0041095796,0.0012500092,0.00096717756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002955818,0.00079123554,0.0011621868,0.0006535278,0.0010316308,0.0017881247,0.0023708742,0.0015562122,0.0035708805],"category_scores_gemma":[0.031109318,0.0006537588,0.0007090482,0.00071376434,0.0021593024,0.0041542333,0.0019681999,0.0026906212,0.0008257378],"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.00073368533,0.0005091404,0.004606102,0.0003651768,0.00016619275,0.0005468774,0.0010752871,0.77266926,0.013415861,0.09150646,0.0031637254,0.11124229],"study_design_scores_gemma":[0.000036175174,0.0001774165,0.00040697266,0.000022289725,0.000022943957,0.00012842653,0.00017497217,0.9347313,0.0041091335,0.05892939,0.001243989,0.000016905522],"about_ca_topic_score_codex":0.0030874733,"about_ca_topic_score_gemma":0.0029084077,"teacher_disagreement_score":0.0035708805,"about_ca_system_score_codex":0.0011445519,"about_ca_system_score_gemma":0.0019138486,"threshold_uncertainty_score":0.015632093},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003529592,0.00007822684,0.9881203,0.000050205555,0.000017000437,0.000052983552,0.0001556056,0.0036966954,0.0042993575],"genre_scores_gemma":[0.20072486,0.0010135948,0.7830651,0.00014000626,0.00003393882,0.0011714232,0.0016234252,0.0018504512,0.010377254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995184,0.00011871882,0.00004316988,0.000063835156,0.00021100152,0.000044943416],"domain_scores_gemma":[0.99951005,0.0002352138,0.00005284687,0.000069868125,0.000103887396,0.0000280993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000407563,0.0009509319,0.0006265625,0.0006249999,0.0003402329,0.000688199,0.0015267695,0.0007957739,0.012864219],"category_scores_gemma":[0.0012666532,0.00052394345,0.00092395593,0.00052217505,0.00042690992,0.0008489479,0.00074213615,0.00094703014,0.0028720119],"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.00012334647,0.00006773535,0.0005120259,0.0003603896,0.00006628879,0.00027865937,0.0001717247,0.8625151,0.040023673,0.0349643,0.004494886,0.05642185],"study_design_scores_gemma":[0.000072178096,0.00009552866,0.0003221646,0.00004211095,0.000031006457,0.00024337422,0.00002425314,0.9421246,0.01833162,0.0145303365,0.024145681,0.000037033788],"about_ca_topic_score_codex":0.0013094473,"about_ca_topic_score_gemma":0.00073839125,"teacher_disagreement_score":0.012864219,"about_ca_system_score_codex":0.00025332102,"about_ca_system_score_gemma":0.00033785586,"threshold_uncertainty_score":0.04303515},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007944752,0.00020248338,0.9847835,0.00024635563,0.000032933487,0.000122976,0.000094133895,0.00068314624,0.005889746],"genre_scores_gemma":[0.2155594,0.00052693486,0.77851623,0.00012815012,0.000034682544,0.00043807237,0.0004350371,0.00012375486,0.0042377394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984617,0.00052717084,0.00013113455,0.00024080931,0.00052066275,0.00011846987],"domain_scores_gemma":[0.99783164,0.0014040023,0.00016024572,0.00028883398,0.00020854428,0.000106828025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00181086,0.00095004,0.00065476994,0.00059411203,0.00088391,0.0014964945,0.0013250503,0.0008691508,0.0032384035],"category_scores_gemma":[0.004596287,0.00072232855,0.0013980723,0.00083185034,0.0027890257,0.0023002634,0.0024255337,0.0015046778,0.00055858213],"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.00013908118,0.000084868436,0.0005241311,0.0003004492,0.00008618677,0.00067129644,0.000617283,0.5553519,0.003473209,0.36944056,0.0023519024,0.06695913],"study_design_scores_gemma":[0.00007879989,0.000066311426,0.00010509001,0.000036647758,0.00004436118,0.0001301682,0.000098126984,0.67243636,0.0035417485,0.31155723,0.011874442,0.000030671028],"about_ca_topic_score_codex":0.0060364967,"about_ca_topic_score_gemma":0.010082398,"teacher_disagreement_score":0.0060364967,"about_ca_system_score_codex":0.0011543493,"about_ca_system_score_gemma":0.0024340032,"threshold_uncertainty_score":0.0120027065},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001291044,0.0022359807,0.69795126,0.0007630684,0.0005179652,0.0004038643,0.012677797,0.10703351,0.1771255],"genre_scores_gemma":[0.03984641,0.0053597842,0.7007412,0.0011963608,0.00043239866,0.002085016,0.05200729,0.014412148,0.18391949],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99933535,0.00008091998,0.00006520863,0.00014561653,0.00028549787,0.00008741046],"domain_scores_gemma":[0.99910384,0.00017857313,0.000085565756,0.0002506647,0.00028048255,0.00010091777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094408554,0.0014450792,0.0009293358,0.001674157,0.0006288991,0.002050565,0.0025757672,0.001351682,0.13310756],"category_scores_gemma":[0.00180949,0.0007295263,0.0008426885,0.0009232941,0.0007732854,0.0023657773,0.002574163,0.001950694,0.12386715],"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.00018638399,0.00007905968,0.0004914045,0.0016699659,0.0000681751,0.00023448392,0.00016522159,0.015269123,0.011093812,0.19582808,0.3120774,0.46283686],"study_design_scores_gemma":[0.00006380435,0.000051977055,0.00035384088,0.0002038346,0.000021036629,0.00034268727,0.0000335149,0.026949152,0.0049981484,0.070392236,0.89654964,0.00004003798],"about_ca_topic_score_codex":0.0013113911,"about_ca_topic_score_gemma":0.0015105625,"teacher_disagreement_score":0.13310756,"about_ca_system_score_codex":0.00068610243,"about_ca_system_score_gemma":0.0015692405,"threshold_uncertainty_score":0.44528913},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0967378,0.0006877679,0.8961238,0.0006586428,0.00002074747,0.00007270109,0.000042520693,0.0007872532,0.0048687495],"genre_scores_gemma":[0.9084244,0.00044285032,0.0882659,0.00007814491,0.000018362025,0.00013179982,0.00006427002,0.000038763348,0.0025354486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945515,0.00021804366,0.00004571084,0.00009455487,0.0001305335,0.000055911525],"domain_scores_gemma":[0.9987754,0.0008371092,0.00012100531,0.0000915736,0.00013803804,0.000036876176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008275581,0.00044590287,0.0003791705,0.0003555057,0.0002942106,0.00082475913,0.0007308957,0.0008880185,0.0015045217],"category_scores_gemma":[0.00435984,0.00031963145,0.00023453419,0.00031332416,0.0011605717,0.0013254565,0.0008067491,0.0008529657,0.00015384232],"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.000096344666,0.00008901863,0.00087367103,0.000115878516,0.000040121162,0.00011048287,0.0004983258,0.82395715,0.0032519256,0.0395708,0.0008635782,0.13053267],"study_design_scores_gemma":[0.000019020097,0.00005289289,0.00027555664,0.000015049894,0.000009066917,0.0000207257,0.00006047071,0.9572362,0.0022149484,0.039124295,0.00096269965,0.000009077239],"about_ca_topic_score_codex":0.0059182746,"about_ca_topic_score_gemma":0.0043375874,"teacher_disagreement_score":0.0059182746,"about_ca_system_score_codex":0.0007892306,"about_ca_system_score_gemma":0.00079478644,"threshold_uncertainty_score":0.011767626},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90601057,0.00040750936,0.074194275,0.0009491997,0.00007565251,0.0004015582,0.0007683159,0.008508923,0.008684049],"genre_scores_gemma":[0.930857,0.00010272524,0.06364756,0.000118399854,0.000021433996,0.00007180397,0.00040846725,0.000104942184,0.0046677575],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995733,0.00012805747,0.000036546113,0.00010673818,0.000105525636,0.00004977343],"domain_scores_gemma":[0.9979716,0.0010138114,0.00007649647,0.00021821138,0.00043834237,0.00028142324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011349228,0.0005204448,0.0006754266,0.0009487813,0.00083665975,0.00078534253,0.0011037035,0.0020572718,0.0061210203],"category_scores_gemma":[0.0033522854,0.00025466894,0.00030728543,0.0010347718,0.00019624119,0.0011489005,0.0008244932,0.000527759,0.0020615081],"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.0051107486,0.004409223,0.05149484,0.0009659547,0.00026093665,0.0049070646,0.0026907297,0.062665634,0.059185658,0.0019690532,0.023396568,0.7829437],"study_design_scores_gemma":[0.0011808663,0.0028485404,0.030576799,0.00009687345,0.00050698774,0.0025968442,0.0019541183,0.8886279,0.046998076,0.0026359179,0.02175748,0.00021963606],"about_ca_topic_score_codex":0.012394169,"about_ca_topic_score_gemma":0.012434038,"teacher_disagreement_score":0.012394169,"about_ca_system_score_codex":0.00065555825,"about_ca_system_score_gemma":0.0006537878,"threshold_uncertainty_score":0.024644017},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002808693,0.000025028414,0.9847484,0.0002779848,0.0000516956,0.00020192353,0.000980032,0.007095305,0.0038109184],"genre_scores_gemma":[0.10999183,0.00023521465,0.8805054,0.00038591816,0.00002153236,0.00053007633,0.00300427,0.0013866685,0.0039391345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981111,0.00045078614,0.0002472123,0.00027821955,0.0007335619,0.00017908655],"domain_scores_gemma":[0.9969158,0.0013327046,0.00022040053,0.00069917075,0.00075874623,0.000073018025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017934965,0.0008533579,0.00043131766,0.00084434025,0.00048627998,0.002104976,0.0017281529,0.000651087,0.004176237],"category_scores_gemma":[0.006166487,0.00074700324,0.0010399414,0.0008656803,0.0010069223,0.0017371798,0.0018611886,0.0024729948,0.0013724595],"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.0003316666,0.00024251298,0.0015252656,0.0011643982,0.00010118237,0.0013946305,0.0010572787,0.30666643,0.02046548,0.42104584,0.027399825,0.21860543],"study_design_scores_gemma":[0.000115492956,0.00009745992,0.0002708922,0.0001469821,0.0000599361,0.00044997115,0.00023602077,0.71029836,0.059289288,0.1086021,0.12037102,0.00006243297],"about_ca_topic_score_codex":0.015184213,"about_ca_topic_score_gemma":0.013693955,"teacher_disagreement_score":0.015184213,"about_ca_system_score_codex":0.0017311531,"about_ca_system_score_gemma":0.0048028417,"threshold_uncertainty_score":0.03019166},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027585165,0.00015213671,0.98813707,0.00025625163,0.000033533972,0.0001557371,0.000029250861,0.00080316,0.0076743457],"genre_scores_gemma":[0.10928181,0.00022092099,0.88351774,0.0001827457,0.00003037674,0.0005943825,0.000164111,0.00013979671,0.0058681723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997479,0.0010282602,0.00015434762,0.00037973223,0.00087014015,0.00008850777],"domain_scores_gemma":[0.9985575,0.0007250491,0.00010789259,0.00025259441,0.00029630522,0.00006076725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018395818,0.0007301637,0.00052189117,0.00074432325,0.00087888906,0.0018233384,0.0025305613,0.001336413,0.005276554],"category_scores_gemma":[0.004174066,0.00039365047,0.0010803048,0.0004436143,0.001632984,0.0026006857,0.0015267484,0.0014203564,0.001302869],"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.00024264358,0.00043536408,0.00090055284,0.0007637384,0.00015431362,0.00069237256,0.005251571,0.0608338,0.032106865,0.5244312,0.008040238,0.36614734],"study_design_scores_gemma":[0.000091408205,0.00023749202,0.0007060159,0.00016442574,0.00010833958,0.0007020171,0.0008813949,0.63131404,0.016354276,0.25467432,0.09466804,0.00009819443],"about_ca_topic_score_codex":0.0035317221,"about_ca_topic_score_gemma":0.0033037723,"teacher_disagreement_score":0.005276554,"about_ca_system_score_codex":0.0014916387,"about_ca_system_score_gemma":0.0012205645,"threshold_uncertainty_score":0.017651856},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012375024,0.0016830385,0.9640075,0.0004852775,0.00013434351,0.00012532131,0.00017455718,0.0006452906,0.020369671],"genre_scores_gemma":[0.49888438,0.0010299612,0.48112074,0.00015764649,0.0001698122,0.00047219856,0.0005900397,0.0003851891,0.01719013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973954,0.0012681728,0.00015702605,0.00023473136,0.00074254937,0.0002021048],"domain_scores_gemma":[0.995513,0.0032524988,0.0001369244,0.00046093416,0.0005103847,0.00012612203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033496958,0.0011355917,0.0017464958,0.0011700997,0.0010739834,0.0022734888,0.0018387581,0.0010608915,0.009289378],"category_scores_gemma":[0.010149145,0.00072179624,0.0011058484,0.001319986,0.0025130995,0.0035608876,0.002080327,0.0021836886,0.00073839445],"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.000336955,0.00006743211,0.00046288606,0.0005139922,0.00007700129,0.00013509548,0.0002624993,0.38929945,0.0008397102,0.43377435,0.0056115882,0.16861893],"study_design_scores_gemma":[0.000022671547,0.00005345987,0.00014696748,0.00007007826,0.000031437597,0.00003532868,0.000047184647,0.7842858,0.000851366,0.21064442,0.003796466,0.000014786829],"about_ca_topic_score_codex":0.009739157,"about_ca_topic_score_gemma":0.011378888,"teacher_disagreement_score":0.009739157,"about_ca_system_score_codex":0.002733898,"about_ca_system_score_gemma":0.001876574,"threshold_uncertainty_score":0.031076074},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055077476,0.07019323,0.48841667,0.0024423343,0.0013560096,0.00032916784,0.0009683176,0.0042468864,0.42653966],"genre_scores_gemma":[0.08692522,0.08548544,0.47486618,0.0011651287,0.00069430104,0.00046041555,0.0028531433,0.0010869073,0.34646332],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977976,0.00002848453,0.000010032959,0.00004976947,0.00011321339,0.000018782075],"domain_scores_gemma":[0.99977535,0.0001303592,0.0000136478075,0.000026608584,0.000040484887,0.000013475781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020446772,0.0011707046,0.00046102234,0.0008521135,0.0005291036,0.0015891221,0.0010001485,0.0008121653,0.021179136],"category_scores_gemma":[0.0006350947,0.0005899483,0.0005518963,0.0018102721,0.0008047171,0.0015903142,0.0009786647,0.0012365899,0.007909427],"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.000044790195,0.00009146607,0.00020370893,0.0008983466,0.000022080521,0.0001016452,0.00026719127,0.04175931,0.0023744786,0.07049734,0.106331736,0.77740794],"study_design_scores_gemma":[0.000028252294,0.00007282115,0.0008332206,0.00063605385,0.000018271645,0.0003984218,0.00022088723,0.0546626,0.0020021521,0.13222818,0.8088644,0.000034780656],"about_ca_topic_score_codex":0.0040463437,"about_ca_topic_score_gemma":0.0059416667,"teacher_disagreement_score":0.021179136,"about_ca_system_score_codex":0.0010127992,"about_ca_system_score_gemma":0.001108331,"threshold_uncertainty_score":0.07085127},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02715502,0.0001054624,0.95718527,0.00012982679,0.000028579412,0.00024000717,0.00032004024,0.008949144,0.005886685],"genre_scores_gemma":[0.29458913,0.00011242429,0.7007672,0.00012180021,0.000016479778,0.0006396416,0.0009689589,0.0010592646,0.0017250843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992612,0.00027666468,0.000037466212,0.00018969587,0.00015797996,0.00007692276],"domain_scores_gemma":[0.9986743,0.0007868383,0.00008702213,0.0002968779,0.000118078264,0.000036925474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012270059,0.00092790375,0.0008677085,0.00083117525,0.0004808703,0.0009429052,0.0016368796,0.0010658919,0.0065080826],"category_scores_gemma":[0.005320844,0.0006769381,0.00072549994,0.00092513184,0.0015778743,0.0013186535,0.002152659,0.0013365536,0.0015573974],"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.00019935671,0.000094051946,0.0010191124,0.0002670277,0.000034709832,0.00024155494,0.0002750511,0.7734136,0.008325135,0.025890248,0.0071721235,0.18306805],"study_design_scores_gemma":[0.000057641984,0.000053478823,0.00014524067,0.00002151185,0.000011902892,0.000056525092,0.0000805753,0.96767867,0.0059634913,0.02157427,0.004339916,0.00001670471],"about_ca_topic_score_codex":0.0016642055,"about_ca_topic_score_gemma":0.0035533921,"teacher_disagreement_score":0.0065080826,"about_ca_system_score_codex":0.00066885434,"about_ca_system_score_gemma":0.0011929998,"threshold_uncertainty_score":0.021771729},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044473175,0.00045971936,0.8299351,0.0015776155,0.00060104753,0.0007455807,0.023060264,0.06296937,0.03617817],"genre_scores_gemma":[0.222855,0.00056929054,0.7097478,0.00017856128,0.00023826792,0.00047934678,0.040099114,0.009644309,0.016188301],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732375,0.00056361273,0.0002648565,0.00041877214,0.0013222065,0.00010672387],"domain_scores_gemma":[0.9664343,0.026160698,0.001010853,0.0046696593,0.0013910608,0.00033350196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024973596,0.001411078,0.00081886776,0.0037246551,0.0007569492,0.0033666159,0.0026048126,0.0018369954,0.033686522],"category_scores_gemma":[0.03310822,0.0011804985,0.0012248154,0.0025435272,0.00089169585,0.0055026365,0.0024314309,0.0018481242,0.008248146],"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.00094086793,0.00044346074,0.0073853442,0.0017632882,0.00011845863,0.005838662,0.0035085166,0.076751895,0.010660733,0.08754079,0.22243296,0.5826151],"study_design_scores_gemma":[0.000239007,0.00011442271,0.0011616317,0.00045559395,0.00010525342,0.002557435,0.0007385273,0.46526507,0.04177814,0.12304146,0.36442393,0.000119635944],"about_ca_topic_score_codex":0.0013341386,"about_ca_topic_score_gemma":0.004040623,"teacher_disagreement_score":0.033686522,"about_ca_system_score_codex":0.0008231347,"about_ca_system_score_gemma":0.0009917945,"threshold_uncertainty_score":0.112692654},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034457073,0.00030570375,0.9618443,0.00019038247,0.000020764632,0.00019157217,0.000038024897,0.0005123022,0.0024398502],"genre_scores_gemma":[0.5193409,0.00042391763,0.47888473,0.000081514954,0.000021998578,0.00024570402,0.00013878822,0.00004926764,0.0008133159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981749,0.0007900607,0.00012684856,0.00020088904,0.00060476543,0.00010262454],"domain_scores_gemma":[0.9979048,0.0014975694,0.00015818163,0.00012302047,0.0002749578,0.00004154406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024463919,0.0011618016,0.0011746701,0.0032610125,0.0005906637,0.0014980286,0.0018596028,0.0015483695,0.0015515278],"category_scores_gemma":[0.006842815,0.00070087746,0.0009442196,0.0018552674,0.0007780048,0.0015646248,0.00081114017,0.0007346394,0.00023288325],"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.00006293923,0.00014674812,0.0010808087,0.00008778859,0.0000591212,0.00022860487,0.000080969854,0.9009906,0.0020945799,0.0077031115,0.0005069466,0.0869578],"study_design_scores_gemma":[0.000014477987,0.000018670178,0.0001776012,0.000011941874,0.00001773596,0.000025829304,0.0000179523,0.9947242,0.00080325984,0.003799625,0.00037722534,0.000011361063],"about_ca_topic_score_codex":0.0122948205,"about_ca_topic_score_gemma":0.008473922,"teacher_disagreement_score":0.0122948205,"about_ca_system_score_codex":0.0015835764,"about_ca_system_score_gemma":0.0016455703,"threshold_uncertainty_score":0.024446547},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015883782,0.00009682468,0.9959793,0.00022177049,0.00002611158,0.00002521767,0.000011765753,0.0003187045,0.0017319674],"genre_scores_gemma":[0.3006602,0.00052882556,0.6930461,0.00032347738,0.0002287417,0.00026564466,0.00009232979,0.00012779662,0.0047268434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983058,0.00060775835,0.00012417942,0.0003110607,0.00057148194,0.0000797356],"domain_scores_gemma":[0.9982431,0.0011801046,0.000096943186,0.00012096746,0.00026377162,0.000095013755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013607797,0.0006538613,0.00082264695,0.0011043862,0.001031477,0.0017588843,0.0015949726,0.0013442207,0.004855864],"category_scores_gemma":[0.006206663,0.00050105894,0.0011268858,0.0007762038,0.001302036,0.0039247023,0.0018001298,0.0010170058,0.0011426634],"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.0003147165,0.0002123328,0.0018947471,0.00032908554,0.00016929866,0.0012489099,0.0012323037,0.17317346,0.018205991,0.48109522,0.009638076,0.312486],"study_design_scores_gemma":[0.000031995867,0.000077117365,0.00034882408,0.000014239507,0.000044967237,0.00034191005,0.000059599297,0.881688,0.0021914267,0.10950446,0.0056502065,0.000047286783],"about_ca_topic_score_codex":0.002401379,"about_ca_topic_score_gemma":0.0021383548,"teacher_disagreement_score":0.004855864,"about_ca_system_score_codex":0.0008091619,"about_ca_system_score_gemma":0.0010204196,"threshold_uncertainty_score":0.01624453},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15385537,0.00089860696,0.82219243,0.00047991244,0.00008097449,0.00028844495,0.00039576337,0.0105864415,0.0112221],"genre_scores_gemma":[0.48071343,0.00027624785,0.51590586,0.00012515718,0.000020836726,0.0001354222,0.0008177463,0.00036611938,0.0016390379],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845374,0.0006228842,0.000093573384,0.00023769116,0.00040540658,0.00018671437],"domain_scores_gemma":[0.99592364,0.002774665,0.00025727038,0.0006417413,0.00028049428,0.00012212765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021995625,0.0011258916,0.00075759174,0.0009463536,0.00056491967,0.0010491442,0.001765862,0.000753158,0.0032779162],"category_scores_gemma":[0.008250393,0.00063857983,0.00077854324,0.0008227034,0.0007335718,0.0019717417,0.0013674769,0.0014940746,0.0006788798],"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.00085536914,0.0002869258,0.0020077794,0.0003189357,0.000099254794,0.00022253794,0.00029346137,0.7165137,0.013933584,0.010280957,0.005414045,0.24977344],"study_design_scores_gemma":[0.00010752743,0.0001730804,0.00036056837,0.000021679385,0.00003689058,0.000061460814,0.000058651127,0.98290956,0.00836414,0.0060419906,0.0018413363,0.000023113838],"about_ca_topic_score_codex":0.005602723,"about_ca_topic_score_gemma":0.008511561,"teacher_disagreement_score":0.005602723,"about_ca_system_score_codex":0.000868883,"about_ca_system_score_gemma":0.001884703,"threshold_uncertainty_score":0.011632502},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066269883,0.00019762806,0.9879921,0.00014048626,0.000026690375,0.00011472093,0.00031421863,0.0008639274,0.0037232467],"genre_scores_gemma":[0.09370922,0.0005777285,0.9022719,0.00005325419,0.00001768854,0.00019557195,0.00083264813,0.00015597293,0.0021859857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926275,0.00023662302,0.00007047688,0.00017130692,0.00019819071,0.000060528913],"domain_scores_gemma":[0.9985411,0.0009983685,0.000110331355,0.000207341,0.00010055715,0.000042297743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012382464,0.001819432,0.0014531099,0.0023281856,0.0012325223,0.0028454915,0.00261618,0.0014474688,0.008657353],"category_scores_gemma":[0.0044539664,0.0022320237,0.003572338,0.002277867,0.0010535341,0.0053758235,0.002297949,0.0018766839,0.0013052095],"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.00003739422,0.000058654074,0.0003074778,0.00019149136,0.000098828925,0.00013819938,0.00009962448,0.9076859,0.0009524207,0.030137163,0.0012810637,0.05901182],"study_design_scores_gemma":[0.000020445637,0.000011998835,0.000044605833,0.000035080204,0.00006146518,0.000041113435,0.000044140048,0.93836725,0.0014134377,0.056397725,0.003545799,0.00001693765],"about_ca_topic_score_codex":0.013069401,"about_ca_topic_score_gemma":0.025883298,"teacher_disagreement_score":0.013069401,"about_ca_system_score_codex":0.0014397674,"about_ca_system_score_gemma":0.0014838299,"threshold_uncertainty_score":0.028961778},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002633248,0.00016539698,0.9861709,0.00078785425,0.00003900691,0.00007211808,0.00014406617,0.00018980823,0.009797676],"genre_scores_gemma":[0.15420026,0.0005486979,0.8383046,0.000267576,0.00012495811,0.00068637484,0.00052413944,0.0001571635,0.005186292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811125,0.000885092,0.00011121892,0.00034497166,0.0003755173,0.00017189623],"domain_scores_gemma":[0.9976519,0.0015531831,0.00013446064,0.00035636456,0.0001631274,0.0001408829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018003474,0.001065429,0.0008157989,0.0014388573,0.0018308242,0.0039141094,0.003104197,0.0019263999,0.010997974],"category_scores_gemma":[0.005908497,0.0007232264,0.002616221,0.0023271812,0.0045596077,0.0052033123,0.0030527245,0.002986609,0.0013811081],"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.000008912207,0.000021261141,0.00009990641,0.00005442245,0.000010961993,0.0000849226,0.000108233,0.07015837,0.00016864346,0.9190033,0.0012147749,0.009066344],"study_design_scores_gemma":[0.000012816739,0.000015669468,0.000041773736,0.000022566746,0.000010250125,0.000051963267,0.00006661624,0.18554725,0.00018918436,0.8039876,0.010043568,0.000010770228],"about_ca_topic_score_codex":0.0064771245,"about_ca_topic_score_gemma":0.008275463,"teacher_disagreement_score":0.010997974,"about_ca_system_score_codex":0.0023530067,"about_ca_system_score_gemma":0.002362908,"threshold_uncertainty_score":0.03679192},"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":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00893387,0.05978677,0.37857547,0.07734499,0.0030989314,0.002056706,0.0037214123,0.0010962592,0.4653856],"genre_scores_gemma":[0.34740114,0.045877725,0.5376251,0.013697793,0.0045613935,0.0029760778,0.0062474734,0.000244556,0.04136875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99098456,0.0044891066,0.0010897517,0.0009455475,0.00215864,0.00033231906],"domain_scores_gemma":[0.98231584,0.012698206,0.001527607,0.001420402,0.0014821911,0.00055575935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008593286,0.00084132014,0.00077857217,0.007409464,0.0015200255,0.00772715,0.0037075153,0.003761368,0.031133927],"category_scores_gemma":[0.023367545,0.00047329746,0.0012531953,0.0056943507,0.0063966042,0.005833713,0.004506741,0.0031519816,0.0034724672],"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.000034340268,0.00006579014,0.0014374526,0.0009568115,0.000043075055,0.0018218257,0.0006912981,0.0027292292,0.00014981342,0.8461127,0.046355873,0.09960173],"study_design_scores_gemma":[0.000041912033,0.000022700675,0.0007814671,0.0016981533,0.000033321758,0.0058241407,0.0004915527,0.0056174463,0.0002908961,0.6198749,0.36528662,0.000036885336],"about_ca_topic_score_codex":0.001647071,"about_ca_topic_score_gemma":0.0015103366,"teacher_disagreement_score":0.031133927,"about_ca_system_score_codex":0.0044053174,"about_ca_system_score_gemma":0.0038541823,"threshold_uncertainty_score":0.104153335},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037503816,0.00008127151,0.9583325,0.000097675846,0.000007366139,0.000088558074,0.00008679553,0.002910496,0.00089157064],"genre_scores_gemma":[0.5728857,0.00012217875,0.42551795,0.00004627456,0.000014583185,0.00018165768,0.00024971314,0.00024610816,0.0007358631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707687,0.0010174324,0.00016950123,0.0006016873,0.0009466335,0.00018792575],"domain_scores_gemma":[0.9898431,0.006538558,0.0015336938,0.0013209949,0.000624779,0.0001388209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002236763,0.00087090087,0.00067193614,0.00085076835,0.00038131807,0.0010251264,0.0011300134,0.00057866063,0.0012251415],"category_scores_gemma":[0.015417087,0.0005638768,0.0007011199,0.0006344168,0.0013507259,0.0020254818,0.0012615169,0.0013356139,0.00031338452],"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.0003187084,0.00010160967,0.003561762,0.00018287615,0.000070087975,0.00015843826,0.00026188378,0.79391474,0.024318282,0.02178086,0.00086013414,0.1544706],"study_design_scores_gemma":[0.000014246512,0.00006396857,0.00033963003,0.000009985138,0.000014409718,0.000036586483,0.000021549291,0.9786516,0.012043343,0.007944998,0.0008481064,0.000011623684],"about_ca_topic_score_codex":0.0035472906,"about_ca_topic_score_gemma":0.003140354,"teacher_disagreement_score":0.0035472906,"about_ca_system_score_codex":0.0009020241,"about_ca_system_score_gemma":0.0014492307,"threshold_uncertainty_score":0.011829317},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03203443,0.00014184984,0.9626186,0.00019800871,0.000034147073,0.00016280236,0.00014778592,0.0019569597,0.0027054234],"genre_scores_gemma":[0.3686346,0.00024036376,0.62847286,0.0000896488,0.000027987557,0.00029851726,0.0003249065,0.0002664974,0.0016446289],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988171,0.0003821236,0.00009012369,0.0001694569,0.00041789503,0.00012329157],"domain_scores_gemma":[0.9984022,0.00086158334,0.00017806333,0.00034407523,0.00013474822,0.00007933293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018573622,0.00067608996,0.00053465436,0.00049243105,0.00050377095,0.0009376429,0.00112962,0.00050851144,0.0013338501],"category_scores_gemma":[0.0036160785,0.00047279266,0.0008879136,0.00063289196,0.000977606,0.0014905533,0.0012231452,0.001261345,0.00021701325],"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.00022944053,0.00013335257,0.0009497963,0.00017519605,0.000080417245,0.00050085556,0.00047467198,0.78551704,0.015500666,0.06455894,0.002199921,0.12967978],"study_design_scores_gemma":[0.000044790326,0.000075413656,0.00020549567,0.000022161172,0.000026455671,0.000056302266,0.00006196299,0.9524493,0.0070864777,0.034256555,0.00569358,0.000021590678],"about_ca_topic_score_codex":0.005875618,"about_ca_topic_score_gemma":0.008688425,"teacher_disagreement_score":0.005875618,"about_ca_system_score_codex":0.00068174134,"about_ca_system_score_gemma":0.0018425313,"threshold_uncertainty_score":0.011682808},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20005718,0.0005411798,0.78439796,0.000818903,0.00007693164,0.00020591293,0.00028051253,0.002047897,0.011573604],"genre_scores_gemma":[0.51487494,0.00018047438,0.4822732,0.00027436682,0.000021128526,0.00030312155,0.0004014615,0.00023319364,0.0014381688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99606776,0.0020643657,0.00024441237,0.00045283593,0.0008568728,0.00031376226],"domain_scores_gemma":[0.9771961,0.016502226,0.0011830021,0.0031014748,0.001575989,0.00044128226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044807442,0.00094412686,0.0013595077,0.0013284733,0.0014763796,0.0020993184,0.0019868256,0.0014040713,0.0032097017],"category_scores_gemma":[0.030775053,0.00095511385,0.0009958863,0.0018279742,0.0013339637,0.0034223706,0.0025696126,0.0024968085,0.00055587076],"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.0014367173,0.0005374087,0.007904833,0.00047087646,0.00028386016,0.00032528405,0.00070032105,0.6220181,0.0065871566,0.1320282,0.0069718543,0.22073542],"study_design_scores_gemma":[0.00008185704,0.00012219447,0.00028733935,0.000027266233,0.000040618936,0.00007561757,0.000095055395,0.93900335,0.002054174,0.05652335,0.0016731035,0.000016024238],"about_ca_topic_score_codex":0.003519177,"about_ca_topic_score_gemma":0.0036329872,"teacher_disagreement_score":0.0044807442,"about_ca_system_score_codex":0.0013400153,"about_ca_system_score_gemma":0.0028236357,"threshold_uncertainty_score":0.02369678},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20684834,0.00042610127,0.71020484,0.0008178648,0.00034293786,0.00039617968,0.00048055063,0.04358409,0.036899053],"genre_scores_gemma":[0.85825884,0.000113546696,0.12748823,0.00038815182,0.000055092445,0.00018088422,0.00041080915,0.00020800238,0.012896442],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999871,0.000029434046,0.000010499056,0.00004164593,0.000028792929,0.000018549168],"domain_scores_gemma":[0.9997013,0.00008944204,0.000016645121,0.000045811663,0.000068021924,0.00007865872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001942113,0.0002696205,0.0002736348,0.0002801549,0.00024098177,0.0007540222,0.0006352727,0.0005072624,0.007154143],"category_scores_gemma":[0.0010038213,0.00012203069,0.00021689369,0.00018401131,0.00017578898,0.0006246128,0.0011338249,0.0005380984,0.0012716644],"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.001303751,0.0012222293,0.0034096052,0.00042176788,0.00015520057,0.0006010891,0.0009917186,0.008128406,0.12123929,0.021153057,0.024117501,0.8172564],"study_design_scores_gemma":[0.001306657,0.0028714137,0.01591249,0.00015319808,0.0009073514,0.0029149996,0.0006361403,0.5302419,0.26494995,0.053709254,0.12614025,0.00025648778],"about_ca_topic_score_codex":0.0007164143,"about_ca_topic_score_gemma":0.00057314034,"teacher_disagreement_score":0.007154143,"about_ca_system_score_codex":0.00023090618,"about_ca_system_score_gemma":0.0006117807,"threshold_uncertainty_score":0.023932993},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042139273,0.0012075383,0.9458886,0.00076260424,0.0001408507,0.00020574295,0.00028568722,0.0008042973,0.046490707],"genre_scores_gemma":[0.16307077,0.0014339354,0.7886616,0.0005713625,0.00015591078,0.00031906873,0.0018718182,0.0003618558,0.04355362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773765,0.0008231115,0.00027029213,0.00035518964,0.00066969625,0.0001440045],"domain_scores_gemma":[0.9988599,0.0006226288,0.000055089564,0.00028442466,0.00013482182,0.000043170206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022979763,0.00078001845,0.000623634,0.0017554399,0.0007398845,0.003897841,0.002536607,0.0019010603,0.027977835],"category_scores_gemma":[0.0052123414,0.00068131555,0.0017627137,0.0020381052,0.0017058281,0.0077719493,0.0019586354,0.0014337867,0.0060349004],"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.00012381907,0.00018738928,0.00055091165,0.0003445525,0.000099967634,0.00023579183,0.00028736488,0.02731547,0.0017307643,0.52457064,0.014991682,0.42956153],"study_design_scores_gemma":[0.000042297474,0.00005383619,0.00037617589,0.0001794764,0.00005995297,0.00025277302,0.00011800719,0.1627915,0.004268599,0.7749619,0.056867003,0.000028500277],"about_ca_topic_score_codex":0.005660703,"about_ca_topic_score_gemma":0.0031112377,"teacher_disagreement_score":0.027977835,"about_ca_system_score_codex":0.0010330447,"about_ca_system_score_gemma":0.0010456408,"threshold_uncertainty_score":0.09359515},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029957904,0.000047189034,0.9687016,0.000064779146,0.0000068561985,0.000024867777,0.00007790604,0.00044850388,0.0006703117],"genre_scores_gemma":[0.32894468,0.00011401292,0.6691235,0.000037784816,0.000013910495,0.00015511332,0.00035145288,0.00009428163,0.0011653453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998235,0.000029329423,0.000010676016,0.000053753258,0.00006216338,0.000020464988],"domain_scores_gemma":[0.9996848,0.00016214231,0.00005831787,0.00003221737,0.000041691343,0.000020904508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035182998,0.0007844802,0.00051038095,0.00069560687,0.0004226271,0.0003900078,0.00073376024,0.0007990508,0.0018562892],"category_scores_gemma":[0.0017351791,0.00035021498,0.00046168067,0.0005089959,0.0008079696,0.0007238284,0.0005884231,0.0005690552,0.00027909383],"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.000047282512,0.000016445409,0.00037316827,0.000040596635,0.000013899813,0.000052699786,0.00004271269,0.957341,0.0040180767,0.008397455,0.00034084765,0.029315704],"study_design_scores_gemma":[0.000012983531,0.00003922953,0.000121277284,0.0000043485647,0.000004271383,0.000016611288,0.000013104794,0.98800695,0.0017443356,0.00951655,0.00051422603,0.0000060034863],"about_ca_topic_score_codex":0.0045295497,"about_ca_topic_score_gemma":0.004165827,"teacher_disagreement_score":0.0045295497,"about_ca_system_score_codex":0.00065837544,"about_ca_system_score_gemma":0.0008642001,"threshold_uncertainty_score":0.009006321},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018658713,0.00021761082,0.9747114,0.00020775187,0.000018998435,0.00011624563,0.00011009296,0.0015345587,0.0044246786],"genre_scores_gemma":[0.23329708,0.00032333817,0.7641761,0.00009309369,0.000018728757,0.00026595918,0.0003289996,0.000121867626,0.0013748242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900776,0.0005000571,0.00006255911,0.0001297889,0.0002168553,0.000083058876],"domain_scores_gemma":[0.99840444,0.001139433,0.00010058674,0.00022549545,0.00008883227,0.00004125777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011372891,0.00082129857,0.0004795625,0.0006232549,0.00050240185,0.0012784798,0.001102369,0.0007580099,0.0027665512],"category_scores_gemma":[0.0034166232,0.0005264347,0.0009337261,0.0007439531,0.0016078447,0.0018835453,0.0012174144,0.0011283847,0.0003833835],"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.0002580513,0.00013848208,0.0008618621,0.00034891933,0.00010713698,0.00030422708,0.00042131823,0.7110876,0.0057052677,0.14826478,0.0027794822,0.12972285],"study_design_scores_gemma":[0.000070931725,0.000056750796,0.00012118757,0.00003705538,0.000033233304,0.00007233535,0.000072245246,0.9187535,0.00432825,0.07265157,0.0037856821,0.000017252463],"about_ca_topic_score_codex":0.0041324315,"about_ca_topic_score_gemma":0.0065735066,"teacher_disagreement_score":0.0041324315,"about_ca_system_score_codex":0.0011894782,"about_ca_system_score_gemma":0.0016989901,"threshold_uncertainty_score":0.009255052},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010809558,0.0003879796,0.9964765,0.00009072812,0.00005369515,0.00004129891,0.000013548929,0.00014562221,0.0017097367],"genre_scores_gemma":[0.07930437,0.00083762064,0.9126616,0.000117542855,0.00013777005,0.0002500596,0.000105498264,0.0001416078,0.006443908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947923,0.0001744175,0.000041203984,0.000072504874,0.0001978559,0.000034720437],"domain_scores_gemma":[0.9995592,0.00027031108,0.000019409703,0.00003467679,0.000102287944,0.000014143757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010976248,0.0008510663,0.0011648213,0.0008237228,0.0006248882,0.001229061,0.0021761525,0.0018947526,0.003352139],"category_scores_gemma":[0.002495047,0.0009105574,0.0008383264,0.0013498457,0.00068769814,0.001344183,0.0011096748,0.0016626425,0.00095464394],"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.00007050943,0.000079752856,0.00019706012,0.00014507456,0.0000729265,0.000098301934,0.00014113369,0.71722263,0.002831138,0.03723704,0.004814669,0.23708981],"study_design_scores_gemma":[0.000008606768,0.000012567698,0.000045195953,0.000007057562,0.000010280431,0.000014378766,0.00000658799,0.99350315,0.00038038904,0.004885217,0.0011208167,0.000005691792],"about_ca_topic_score_codex":0.009699472,"about_ca_topic_score_gemma":0.007230305,"teacher_disagreement_score":0.009699472,"about_ca_system_score_codex":0.0007191731,"about_ca_system_score_gemma":0.00077564776,"threshold_uncertainty_score":0.019286036},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077157053,0.0005647732,0.9830495,0.0003282896,0.000068563335,0.00015229963,0.00017028842,0.0003600649,0.0075905435],"genre_scores_gemma":[0.69338757,0.0011620502,0.29356718,0.00057901413,0.00028075042,0.0007837591,0.00080216373,0.0007186478,0.008718697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99175996,0.0049838405,0.00027749018,0.0006211716,0.0018471692,0.0005103518],"domain_scores_gemma":[0.9472428,0.047520466,0.0011174309,0.001690203,0.0020246394,0.00040443963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010273662,0.0023621137,0.0023797997,0.0037251187,0.0009414442,0.0028341073,0.0027627912,0.0017715945,0.009656554],"category_scores_gemma":[0.053811885,0.0017276685,0.0030043584,0.0025968428,0.0030959358,0.004348534,0.004150465,0.004015292,0.0006753983],"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.0001775764,0.000062695275,0.00034470335,0.000254969,0.0001303319,0.00008992836,0.00007378283,0.8491608,0.00091070245,0.11728808,0.0019227137,0.029583793],"study_design_scores_gemma":[0.000008190523,0.000017891898,0.00006272688,0.0000224698,0.000017224693,0.000015471585,0.000007447776,0.8990305,0.00032405966,0.10014538,0.0003387021,0.0000100299385],"about_ca_topic_score_codex":0.0036487803,"about_ca_topic_score_gemma":0.0016735411,"teacher_disagreement_score":0.010273662,"about_ca_system_score_codex":0.0027315838,"about_ca_system_score_gemma":0.0017533563,"threshold_uncertainty_score":0.05433297},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004126412,0.0011522595,0.959212,0.00134876,0.00011378197,0.00024704883,0.0004408391,0.00057303515,0.032785896],"genre_scores_gemma":[0.16546868,0.0031768754,0.81678885,0.0006207525,0.00014857964,0.00080982357,0.0011062318,0.00021155197,0.011668718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964592,0.0017716845,0.0002827664,0.00046365926,0.0008261491,0.00019663111],"domain_scores_gemma":[0.9968117,0.0018470918,0.00022199797,0.0006220128,0.0003704132,0.00012678979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002911039,0.0011137282,0.0006810163,0.0010355494,0.0010114001,0.003089799,0.0016555561,0.0012035484,0.008652251],"category_scores_gemma":[0.009156181,0.0006251489,0.0014753501,0.0019265999,0.0022239129,0.0054512057,0.0032902982,0.0025123726,0.001915683],"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.00009795104,0.00005498151,0.00037199387,0.0004183513,0.00005935939,0.00022789137,0.00095135125,0.03187246,0.0012193988,0.81409293,0.007828214,0.14280507],"study_design_scores_gemma":[0.0000624902,0.000081799815,0.00019462922,0.00023076053,0.00006176529,0.00033958833,0.0004533258,0.08311073,0.0022677989,0.8134381,0.099704884,0.000054085092],"about_ca_topic_score_codex":0.0027353053,"about_ca_topic_score_gemma":0.004140886,"teacher_disagreement_score":0.008652251,"about_ca_system_score_codex":0.0012619867,"about_ca_system_score_gemma":0.0020468098,"threshold_uncertainty_score":0.028944612},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044799405,0.0003526,0.9906219,0.00016708813,0.00002456956,0.000043783057,0.000038631046,0.00047792273,0.003793521],"genre_scores_gemma":[0.24924672,0.0012868623,0.73729455,0.00014685227,0.00003909547,0.00024135078,0.0002804365,0.00018864495,0.011275464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907815,0.0002491779,0.00009973663,0.00018742397,0.00030742236,0.00007814127],"domain_scores_gemma":[0.99910694,0.00036572287,0.0001553767,0.00018375157,0.00015136803,0.0000368038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013949057,0.0007453412,0.00072219013,0.0011220553,0.0005490808,0.0023753876,0.0015249882,0.000929338,0.0029640207],"category_scores_gemma":[0.0029869739,0.0004893426,0.001234916,0.00085063657,0.0021752745,0.004412239,0.0016710463,0.0007300802,0.0006578724],"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.00021652869,0.00008844079,0.0011154113,0.0014875683,0.00012419013,0.00082680635,0.004091371,0.15392028,0.052783873,0.48200735,0.004585956,0.2987523],"study_design_scores_gemma":[0.00004176529,0.00013080468,0.00080524205,0.00027452808,0.00012919756,0.0005308833,0.0014442827,0.5665786,0.035966285,0.34401727,0.04997365,0.0001075011],"about_ca_topic_score_codex":0.0032285554,"about_ca_topic_score_gemma":0.003556659,"teacher_disagreement_score":0.0032285554,"about_ca_system_score_codex":0.0011887086,"about_ca_system_score_gemma":0.00090181746,"threshold_uncertainty_score":0.00991565},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034138795,0.000089285204,0.95464575,0.00083653646,0.000065880246,0.00034997964,0.00031673285,0.0017443796,0.007812655],"genre_scores_gemma":[0.29235366,0.00018943494,0.7029324,0.0003306417,0.00003117881,0.0004892924,0.00091969915,0.00021063497,0.0025430361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97357213,0.013606199,0.0016690677,0.0019847907,0.008344144,0.00082362816],"domain_scores_gemma":[0.9159152,0.051549178,0.0030381544,0.018270697,0.010582763,0.0006438987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017556466,0.00089037226,0.0006743441,0.0018635943,0.0008745751,0.004627712,0.0038681559,0.0029840914,0.006113161],"category_scores_gemma":[0.09151403,0.0010268008,0.0017390944,0.0009135907,0.003152386,0.008416415,0.0026582314,0.002273454,0.001038864],"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.00023481382,0.00036417786,0.0040428145,0.0005645045,0.00020931893,0.0005880743,0.002286494,0.31479725,0.009014496,0.5539539,0.0051439516,0.108800285],"study_design_scores_gemma":[0.00014949421,0.0003161562,0.0008980738,0.0003018942,0.00012361894,0.00021750099,0.0006916443,0.7778029,0.017593212,0.17728443,0.024547944,0.00007315133],"about_ca_topic_score_codex":0.0074775545,"about_ca_topic_score_gemma":0.008049337,"teacher_disagreement_score":0.017556466,"about_ca_system_score_codex":0.0028842937,"about_ca_system_score_gemma":0.0043640994,"threshold_uncertainty_score":0.0928486},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01305656,0.00032413725,0.9734595,0.000996983,0.000045100536,0.000065419255,0.00016138896,0.00014066466,0.011750277],"genre_scores_gemma":[0.5071675,0.0007824796,0.4851179,0.00054221664,0.00019391958,0.00039891998,0.0003252535,0.00013575946,0.005335986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950707,0.002587497,0.00047136564,0.0006042985,0.00089562923,0.0003705003],"domain_scores_gemma":[0.9863821,0.008031988,0.0010662093,0.0026018939,0.0011843963,0.00073333393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070385695,0.0007370998,0.00055473123,0.0015249867,0.001128761,0.0026735666,0.00136663,0.0011781731,0.004528292],"category_scores_gemma":[0.0174878,0.00073326955,0.0013143583,0.0020947563,0.0033370294,0.007541354,0.002475027,0.0035863721,0.0005858344],"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.00003381035,0.00002196283,0.00048716046,0.000095895295,0.00003095714,0.00006549914,0.0004022746,0.013858153,0.00091391697,0.96690214,0.00046958867,0.016718714],"study_design_scores_gemma":[0.000014140899,0.000029681287,0.00020336609,0.00003443602,0.000033122702,0.00006971017,0.00015066819,0.037478555,0.0013449492,0.9534479,0.0071733603,0.000020160354],"about_ca_topic_score_codex":0.0019830132,"about_ca_topic_score_gemma":0.003604048,"teacher_disagreement_score":0.0070385695,"about_ca_system_score_codex":0.001612146,"about_ca_system_score_gemma":0.0012450598,"threshold_uncertainty_score":0.037223935},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006987801,0.000110104396,0.98824114,0.0003894939,0.000020044883,0.00008845702,0.00007078,0.00018827744,0.0039038844],"genre_scores_gemma":[0.21632604,0.0004688478,0.77766263,0.000332152,0.00007347399,0.00052424555,0.00027437176,0.00015778099,0.0041804514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960603,0.002008302,0.00024994733,0.00047758705,0.0009563641,0.00024753957],"domain_scores_gemma":[0.99505025,0.00346264,0.00032574576,0.0006289732,0.00034799022,0.00018440986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045827306,0.0009610746,0.0006619788,0.00092486397,0.0010604868,0.0018266046,0.0014572706,0.0010274515,0.004186335],"category_scores_gemma":[0.011288452,0.00065366447,0.0013661959,0.0015964973,0.0040361853,0.0052166553,0.0032086326,0.0021028304,0.00053927937],"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.00014642517,0.000059278587,0.00048577946,0.00027777767,0.00004088988,0.00022849257,0.0008400532,0.22686747,0.0022433326,0.719845,0.0012176483,0.047747824],"study_design_scores_gemma":[0.00004031927,0.000066053864,0.00012750042,0.00005964949,0.00002081131,0.00009407614,0.00014988774,0.37379816,0.0023088872,0.6157838,0.0075229127,0.000027816386],"about_ca_topic_score_codex":0.0053366153,"about_ca_topic_score_gemma":0.0068990244,"teacher_disagreement_score":0.0053366153,"about_ca_system_score_codex":0.0019998194,"about_ca_system_score_gemma":0.002192173,"threshold_uncertainty_score":0.024236083},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013471172,0.00046683746,0.957561,0.00093568,0.00019425062,0.0007082735,0.001686032,0.009386129,0.015590528],"genre_scores_gemma":[0.24660657,0.00052682334,0.7430241,0.00019903475,0.00008711686,0.0008218896,0.0022574037,0.0001387278,0.0063382974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987024,0.00032606945,0.00017508274,0.00025322588,0.00047355815,0.0000695096],"domain_scores_gemma":[0.99886763,0.00056654005,0.000086905675,0.00016410532,0.00023822299,0.00007659035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020665359,0.0008376082,0.00076268846,0.0025812455,0.0012605307,0.0030146586,0.0025061439,0.0018008789,0.016084127],"category_scores_gemma":[0.007094605,0.0004229018,0.0007464411,0.0018608299,0.00078491686,0.0027539872,0.0016401479,0.0009409138,0.0032483912],"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.0006319948,0.0006115079,0.003956965,0.0005804363,0.00018906957,0.002155292,0.0007661372,0.26297832,0.0078860205,0.13987972,0.04009968,0.5402649],"study_design_scores_gemma":[0.00013936342,0.0000728766,0.00047217036,0.00010798366,0.000078709316,0.00039556818,0.00008085612,0.9203879,0.0036043625,0.038915515,0.03568342,0.00006121557],"about_ca_topic_score_codex":0.009135257,"about_ca_topic_score_gemma":0.00860789,"teacher_disagreement_score":0.016084127,"about_ca_system_score_codex":0.001499625,"about_ca_system_score_gemma":0.0015906722,"threshold_uncertainty_score":0.05380678},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004338627,0.00082748424,0.96598303,0.0008794338,0.000056898654,0.00018028167,0.0013940518,0.005778416,0.020561878],"genre_scores_gemma":[0.09317212,0.002926821,0.87264156,0.00027740843,0.00005143809,0.0006547957,0.006366205,0.0015181468,0.022391513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915993,0.0003544133,0.00007213705,0.000091417205,0.00027503466,0.000047028745],"domain_scores_gemma":[0.99812144,0.0012917622,0.000046199315,0.00034227784,0.0001413389,0.000056929457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014166106,0.00071034743,0.0006950556,0.0011533211,0.0005600506,0.0037871678,0.001973239,0.0010554136,0.010575058],"category_scores_gemma":[0.004958381,0.00093692663,0.0007781086,0.0019775596,0.00073923543,0.004965137,0.0021432696,0.0013474623,0.0037082338],"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.00012067828,0.00020617728,0.00084890245,0.0010507328,0.00009173499,0.00043168067,0.0014381628,0.091976196,0.0032880697,0.23007274,0.07958152,0.5908933],"study_design_scores_gemma":[0.000050719627,0.000026158743,0.00051934744,0.00032450643,0.000047042297,0.0003018845,0.00048636916,0.36565906,0.00768397,0.41592678,0.20892955,0.000044474786],"about_ca_topic_score_codex":0.00827416,"about_ca_topic_score_gemma":0.011156454,"teacher_disagreement_score":0.010575058,"about_ca_system_score_codex":0.0011309528,"about_ca_system_score_gemma":0.0017061188,"threshold_uncertainty_score":0.035377085},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066109546,0.0005426744,0.9168556,0.0003604094,0.000040622013,0.00022037805,0.0002359176,0.0030596273,0.012575339],"genre_scores_gemma":[0.52297413,0.00026462914,0.47309422,0.00013005103,0.000015582857,0.00022782043,0.00033283903,0.00035612818,0.0026046112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986733,0.00054000964,0.000055664314,0.00019214585,0.00036098642,0.00017785591],"domain_scores_gemma":[0.9926461,0.0056066983,0.00026756927,0.0010232856,0.00029322458,0.00016316501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015358413,0.0009603382,0.0006563625,0.0008643841,0.00050969014,0.00083473587,0.0011835254,0.00054775487,0.008096131],"category_scores_gemma":[0.00874994,0.0005644048,0.001322441,0.0006983485,0.0013239168,0.0018252583,0.0022357681,0.0017173691,0.0006676717],"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.0007900433,0.00028141722,0.0030307502,0.0008487378,0.00012272829,0.00028855196,0.00056036405,0.5006799,0.016874941,0.06957031,0.0061613456,0.4007908],"study_design_scores_gemma":[0.0001425319,0.00036360213,0.0017400683,0.00007706683,0.00014602888,0.00017697253,0.00014845729,0.8530831,0.015792003,0.12015062,0.008142977,0.00003658658],"about_ca_topic_score_codex":0.0033194388,"about_ca_topic_score_gemma":0.007349809,"teacher_disagreement_score":0.008096131,"about_ca_system_score_codex":0.0010263729,"about_ca_system_score_gemma":0.0014978083,"threshold_uncertainty_score":0.027084231},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08676454,0.0011249082,0.90664804,0.00075160596,0.00007407505,0.00022556512,0.00032770008,0.0008832562,0.0032003399],"genre_scores_gemma":[0.5797074,0.0005122118,0.41730937,0.0002191988,0.00009545141,0.0002757133,0.0009061655,0.00005025084,0.0009242557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961779,0.0015328368,0.000367865,0.0006443143,0.0010678283,0.0002091906],"domain_scores_gemma":[0.982419,0.012437891,0.0010824881,0.0017686584,0.0018624774,0.00042941587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008395516,0.0007739135,0.0014208549,0.0042348476,0.0008543211,0.0022032002,0.0020381527,0.0012003862,0.0018849344],"category_scores_gemma":[0.021508759,0.00045837407,0.0013050042,0.0034703494,0.00087068387,0.0027998697,0.0023597155,0.0014734897,0.0004407812],"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.00019341473,0.00033591426,0.016406957,0.0002127483,0.00042372601,0.0003748241,0.00048756337,0.5304404,0.0020268387,0.017177716,0.003582752,0.42833716],"study_design_scores_gemma":[0.000015464633,0.00003229642,0.0013353305,0.000032990618,0.00005706507,0.00007029962,0.00006457304,0.9721262,0.0009510477,0.02386036,0.0014386169,0.000015661199],"about_ca_topic_score_codex":0.004370361,"about_ca_topic_score_gemma":0.004685128,"teacher_disagreement_score":0.008395516,"about_ca_system_score_codex":0.0013282025,"about_ca_system_score_gemma":0.001117329,"threshold_uncertainty_score":0.044400275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008049483,0.06998641,0.834288,0.013919797,0.0022618175,0.000093499,0.00029147902,0.0017577562,0.06935173],"genre_scores_gemma":[0.3241965,0.07533087,0.5646942,0.003083177,0.0031554177,0.00023635975,0.00047404383,0.000617131,0.028212301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995221,0.0001415618,0.000023015478,0.000069489004,0.00021423724,0.000029655284],"domain_scores_gemma":[0.99835205,0.0010168419,0.00008916898,0.00013141974,0.00027569872,0.00013478257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006728737,0.0006408463,0.00073070626,0.0016664712,0.0005208664,0.0073375627,0.0008262273,0.0010698049,0.008295708],"category_scores_gemma":[0.0036788583,0.00024202044,0.00038330824,0.0022521226,0.0024970649,0.0055028824,0.0015123255,0.0018081263,0.0010420424],"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.00005152316,0.000026248283,0.00039761857,0.0009022117,0.00004175,0.00007239563,0.0003078207,0.004271396,0.004173579,0.6567278,0.019712167,0.31331548],"study_design_scores_gemma":[0.000020340241,0.00002907177,0.00050970627,0.0002658106,0.000024456427,0.00014622825,0.00031754165,0.03485409,0.0020154084,0.7957007,0.16607894,0.0000377314],"about_ca_topic_score_codex":0.0033030203,"about_ca_topic_score_gemma":0.0030004294,"teacher_disagreement_score":0.008295708,"about_ca_system_score_codex":0.0010630895,"about_ca_system_score_gemma":0.0012206604,"threshold_uncertainty_score":0.027751923},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017993828,0.000734119,0.9583516,0.0009678486,0.00011644758,0.000053442378,0.00008987883,0.00007513848,0.021617636],"genre_scores_gemma":[0.63655835,0.0014259099,0.345405,0.0004120814,0.0002110257,0.0003785307,0.00029794834,0.00016260416,0.015148536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829966,0.0010614025,0.00006025355,0.00016130455,0.0002761566,0.00014125751],"domain_scores_gemma":[0.99631137,0.0029553426,0.00015031932,0.00020861195,0.00024253773,0.00013180338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036513556,0.00067796686,0.0015781027,0.0012331182,0.0008950215,0.0032555382,0.0015120353,0.0015621746,0.0060977847],"category_scores_gemma":[0.011614111,0.0007537452,0.0012158765,0.0019382898,0.0031295652,0.0047764415,0.0028329755,0.003328027,0.00051222346],"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.00011302509,0.000056836154,0.00020835595,0.00005815353,0.000025909514,0.000030545296,0.00006948819,0.1049346,0.00019134446,0.8732088,0.0011773031,0.01992571],"study_design_scores_gemma":[0.000027356102,0.000028167253,0.000043289314,0.000017505816,0.000010209855,0.00002198766,0.000017517206,0.25486988,0.00018454288,0.7433998,0.0013712617,0.0000085120355],"about_ca_topic_score_codex":0.0019774542,"about_ca_topic_score_gemma":0.0012283238,"teacher_disagreement_score":0.0060977847,"about_ca_system_score_codex":0.0016742861,"about_ca_system_score_gemma":0.0021059327,"threshold_uncertainty_score":0.020399153},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47538498,0.00048972626,0.44514677,0.0009229618,0.00045026073,0.0008834732,0.004437342,0.037590824,0.03469381],"genre_scores_gemma":[0.85466945,0.0002093893,0.123794824,0.00025986257,0.00003528141,0.00016063286,0.0015323537,0.00028522604,0.019053036],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999,0.000019243203,0.000009540914,0.00003462571,0.000027123475,0.000009481276],"domain_scores_gemma":[0.9995123,0.00021459218,0.000020049582,0.00004459233,0.00017107344,0.00003736019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029383134,0.00044200398,0.00038796678,0.000374244,0.0004113196,0.00044708693,0.0005267514,0.00080936326,0.009960244],"category_scores_gemma":[0.0010191688,0.0001759409,0.0001629465,0.00017349848,0.00011184596,0.0003112324,0.0002093876,0.0003074202,0.001641658],"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.003244272,0.00062384125,0.0077150613,0.00074173254,0.000119220924,0.005416645,0.0009252173,0.18469319,0.15609218,0.0021006828,0.05329761,0.5850304],"study_design_scores_gemma":[0.0003563932,0.0006128013,0.012796045,0.00010586216,0.00018070794,0.0007023603,0.0004704016,0.91262996,0.04747587,0.001397148,0.02316619,0.00010624781],"about_ca_topic_score_codex":0.011862988,"about_ca_topic_score_gemma":0.012580891,"teacher_disagreement_score":0.011862988,"about_ca_system_score_codex":0.000376187,"about_ca_system_score_gemma":0.0005290476,"threshold_uncertainty_score":0.033320308},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047736485,0.0008259834,0.93201834,0.00037626695,0.0002384854,0.0001361708,0.00012765569,0.0043274,0.014213186],"genre_scores_gemma":[0.41578558,0.00058886973,0.5712556,0.00031872102,0.000055241027,0.00026848345,0.0003777582,0.0007807522,0.010568932],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995802,0.00016284139,0.00002190812,0.00007042763,0.00013335393,0.000031205287],"domain_scores_gemma":[0.99925107,0.00035539118,0.00005490057,0.00013681709,0.00015590827,0.00004582292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007273812,0.0009956692,0.0010126512,0.0006323143,0.0005023836,0.0009889591,0.0013070517,0.0010572391,0.0054518105],"category_scores_gemma":[0.0025502706,0.00036311068,0.0005219019,0.0006611103,0.00055671437,0.0019467998,0.0017195916,0.0011208043,0.0014242635],"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.0012369985,0.0006907841,0.0013368614,0.00074647705,0.00021020311,0.00021674292,0.00041234598,0.3912526,0.033336356,0.03201251,0.009668402,0.5288797],"study_design_scores_gemma":[0.00012172276,0.00012560237,0.00025131338,0.000026008207,0.000055767556,0.00009741602,0.00006214513,0.9631472,0.01092804,0.017867519,0.007298107,0.00001912806],"about_ca_topic_score_codex":0.00094976614,"about_ca_topic_score_gemma":0.0019090571,"teacher_disagreement_score":0.0054518105,"about_ca_system_score_codex":0.00030075482,"about_ca_system_score_gemma":0.0006676335,"threshold_uncertainty_score":0.018238068},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10198515,0.003190272,0.743889,0.008488756,0.00023732972,0.00025762068,0.0011963025,0.0015995115,0.13915616],"genre_scores_gemma":[0.843007,0.0012046891,0.14678505,0.0011810386,0.00018346233,0.0003782168,0.0008670466,0.00029890353,0.006094507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99330693,0.0020201893,0.00041661962,0.0009599693,0.0025957813,0.00070053316],"domain_scores_gemma":[0.98221385,0.0129853785,0.0005734048,0.0017851696,0.0017770173,0.00066523475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046434524,0.0007332496,0.0009446393,0.0034979496,0.0027674616,0.0038857665,0.0012973604,0.002765779,0.010180012],"category_scores_gemma":[0.01969714,0.00082800456,0.0014681121,0.0021720727,0.005822915,0.0070534884,0.0038524875,0.0042334385,0.0008306389],"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.000059168276,0.000029066721,0.00041273038,0.00009232541,0.00001845371,0.00015678354,0.0003946279,0.0035429623,0.00059864623,0.9758114,0.0015139236,0.017369749],"study_design_scores_gemma":[0.000025700014,0.000015946456,0.0002328998,0.00007312174,0.00001208263,0.00011127511,0.00014910933,0.014019338,0.00039114658,0.9786993,0.0062561934,0.000013819169],"about_ca_topic_score_codex":0.0011886876,"about_ca_topic_score_gemma":0.001263699,"teacher_disagreement_score":0.010180012,"about_ca_system_score_codex":0.002153452,"about_ca_system_score_gemma":0.0014136053,"threshold_uncertainty_score":0.03405559},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014582182,0.9473595,0.00026551666,0.035787303,0.0041387337,0.0000031932757,0.000021955844,0.0000122413685,0.010953379],"genre_scores_gemma":[0.05636757,0.9024279,0.0013713114,0.018255312,0.010889894,0.000033048094,0.00007204661,0.000028041835,0.010554868],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978656,0.0007105432,0.00016684445,0.00021751238,0.0007274134,0.00031209193],"domain_scores_gemma":[0.9966832,0.0014359361,0.00035075046,0.00013433852,0.0005243975,0.000871402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003317275,0.00062873546,0.00092832244,0.0032244085,0.0032062498,0.009610337,0.00063102244,0.004157118,0.005401915],"category_scores_gemma":[0.0045832917,0.00036824087,0.00049801794,0.0070654675,0.008235857,0.013533919,0.0042151874,0.0049227066,0.0012901998],"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.00021926314,0.0001749731,0.0037715067,0.0029473188,0.00009503828,0.00038997308,0.007603592,0.00061406835,0.0007560568,0.27955106,0.18551941,0.5183578],"study_design_scores_gemma":[0.000011084368,0.000052371266,0.0036798762,0.0019383063,0.000017115839,0.00032518306,0.004339282,0.00021436227,0.000051638697,0.07715175,0.9121891,0.000029851264],"about_ca_topic_score_codex":0.004679037,"about_ca_topic_score_gemma":0.0094379615,"teacher_disagreement_score":0.009610337,"about_ca_system_score_codex":0.0044674953,"about_ca_system_score_gemma":0.0050106337,"threshold_uncertainty_score":0.03241414},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021380575,0.0004520445,0.95913786,0.0009574848,0.000076545366,0.00016398438,0.00013413941,0.0010625363,0.01663485],"genre_scores_gemma":[0.6393475,0.00086398696,0.35084337,0.00033925654,0.00008901908,0.00030002682,0.00040692015,0.00011429644,0.0076955887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906546,0.00016213894,0.00007722534,0.00019207671,0.00039887565,0.000104269675],"domain_scores_gemma":[0.99877375,0.00060240016,0.000104468425,0.00013026687,0.00032424086,0.00006487786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097149843,0.0005025268,0.00061962067,0.0007357856,0.000983574,0.0025681234,0.0011433668,0.0010833029,0.0032117546],"category_scores_gemma":[0.0036769817,0.0003822245,0.000522023,0.00044675378,0.0008810116,0.0018591637,0.0010564373,0.000963539,0.00085380115],"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.00023260045,0.00026677907,0.001550609,0.00050618703,0.00008775177,0.0014966513,0.00071804976,0.43283308,0.017473735,0.1389503,0.0041782544,0.40170604],"study_design_scores_gemma":[0.000051546143,0.00010831169,0.0005692727,0.0000799846,0.000074518306,0.00028695236,0.00014254026,0.8791934,0.009528128,0.08313946,0.026786821,0.0000390079],"about_ca_topic_score_codex":0.006806429,"about_ca_topic_score_gemma":0.0037336778,"teacher_disagreement_score":0.006806429,"about_ca_system_score_codex":0.0011940553,"about_ca_system_score_gemma":0.0020981221,"threshold_uncertainty_score":0.013533652},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1244371,0.0035964798,0.78218627,0.032190427,0.0007280434,0.00034708055,0.001255591,0.0010948713,0.054164164],"genre_scores_gemma":[0.8178386,0.0031881959,0.16085368,0.0040462394,0.0015325386,0.000677239,0.0016946322,0.00045294085,0.009715996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98930174,0.0048713107,0.00071544584,0.0014008089,0.002557157,0.0011535358],"domain_scores_gemma":[0.8401388,0.1450468,0.0040549734,0.004930226,0.0039125765,0.0019166599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013842205,0.0014940795,0.002259814,0.0025241289,0.0037489294,0.005633299,0.004581667,0.0041693496,0.0058973106],"category_scores_gemma":[0.079807945,0.0015946621,0.0041800938,0.0025311462,0.011111618,0.01428337,0.0060135094,0.013425438,0.0004412819],"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.00022489602,0.00018637815,0.0011335871,0.0002856448,0.00010717648,0.00019689792,0.00047884975,0.095460616,0.0003835755,0.87910455,0.0057669817,0.01667092],"study_design_scores_gemma":[0.00004919009,0.000017071286,0.000109830435,0.000029215795,0.000022608425,0.00002804724,0.000050402243,0.09281543,0.00017143913,0.90591687,0.0007764639,0.000013445475],"about_ca_topic_score_codex":0.011667309,"about_ca_topic_score_gemma":0.0093697775,"teacher_disagreement_score":0.013842205,"about_ca_system_score_codex":0.004525976,"about_ca_system_score_gemma":0.005724023,"threshold_uncertainty_score":0.07320547},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039370577,0.00025119813,0.94915414,0.00025830124,0.00006986126,0.0002962492,0.0005456633,0.040037006,0.005450429],"genre_scores_gemma":[0.040453322,0.00047748035,0.9457364,0.00029027922,0.00003621623,0.00072035874,0.003039247,0.003761766,0.0054849475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998606,0.00044489163,0.00016202511,0.00025084702,0.00043979826,0.0000964745],"domain_scores_gemma":[0.9983553,0.0006935585,0.00013654854,0.00036345876,0.00031707276,0.0001340104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003781509,0.0010652392,0.00088046776,0.00138292,0.0005079197,0.003058567,0.002673194,0.0015940442,0.017600358],"category_scores_gemma":[0.0053835236,0.0010004638,0.0011919298,0.0007968932,0.0007187308,0.002724638,0.0028960744,0.0023115373,0.00555157],"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.00080269016,0.0006993243,0.0020682106,0.0017827118,0.0002953849,0.0009955995,0.0018770122,0.1577557,0.029163484,0.07855768,0.053491812,0.6725104],"study_design_scores_gemma":[0.00033714794,0.00040465043,0.0008770351,0.00066528784,0.00015376987,0.00068133505,0.00019958425,0.6397417,0.020062422,0.044454634,0.29228538,0.00013709326],"about_ca_topic_score_codex":0.0014645786,"about_ca_topic_score_gemma":0.0014810686,"teacher_disagreement_score":0.017600358,"about_ca_system_score_codex":0.00091810396,"about_ca_system_score_gemma":0.0018259108,"threshold_uncertainty_score":0.058879077},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0090493355,0.0006323795,0.9290668,0.00066972454,0.00024255771,0.0007365783,0.0014419173,0.040750522,0.017410202],"genre_scores_gemma":[0.08987054,0.00069240574,0.89500254,0.00045060043,0.0001264048,0.000522193,0.00261786,0.0013321515,0.009385427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985422,0.00034654987,0.00017363837,0.00025107988,0.0006247784,0.00006166417],"domain_scores_gemma":[0.99641657,0.0016885432,0.00027139962,0.0009108873,0.00042641078,0.00028613483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029995064,0.0009170312,0.0012361318,0.0029796753,0.0008518391,0.0047417665,0.0052657705,0.0020062574,0.014066636],"category_scores_gemma":[0.008110265,0.0012675951,0.0009784764,0.0015194505,0.00092023384,0.005488611,0.0032077986,0.0017887233,0.0048326124],"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.0013440738,0.0016422658,0.0033897655,0.001400177,0.00045974157,0.0010926081,0.0012723785,0.023502672,0.014124413,0.10885958,0.068047605,0.77486473],"study_design_scores_gemma":[0.00077647704,0.00027157378,0.0011746848,0.0003418582,0.00073800463,0.0018759966,0.00026223136,0.5116697,0.028955393,0.1361356,0.31755865,0.00023984523],"about_ca_topic_score_codex":0.002520579,"about_ca_topic_score_gemma":0.0035258585,"teacher_disagreement_score":0.014066636,"about_ca_system_score_codex":0.0005850206,"about_ca_system_score_gemma":0.0015176444,"threshold_uncertainty_score":0.04705757},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050853234,0.0016337348,0.870225,0.0067424127,0.0003437535,0.000090527654,0.0007880048,0.0010703403,0.06825293],"genre_scores_gemma":[0.781511,0.00082158577,0.1892677,0.000944384,0.00047752983,0.000081166065,0.0012823832,0.00028720775,0.025326943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979634,0.0007971134,0.00011590959,0.00033409748,0.00056445797,0.00022499402],"domain_scores_gemma":[0.9948155,0.0038077298,0.00020205666,0.00041261505,0.00056045933,0.00020158051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024529404,0.0006194533,0.00079765555,0.0022364447,0.0019629633,0.0044289418,0.0015776827,0.0018387889,0.019049803],"category_scores_gemma":[0.013871538,0.00064440747,0.0018333426,0.001428086,0.0027465143,0.0101013,0.002779866,0.0029924691,0.001280654],"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.00019296384,0.000037372196,0.0005846965,0.00011347903,0.00006409401,0.0002615573,0.00030806786,0.04376269,0.0009289191,0.91254663,0.005864456,0.035335083],"study_design_scores_gemma":[0.000008707899,0.000012305065,0.00012873327,0.000025130023,0.000024920027,0.000044197277,0.00006920026,0.10011254,0.00092415005,0.8931163,0.0055205757,0.000013247756],"about_ca_topic_score_codex":0.0103774965,"about_ca_topic_score_gemma":0.007062812,"teacher_disagreement_score":0.019049803,"about_ca_system_score_codex":0.0030646406,"about_ca_system_score_gemma":0.00093901297,"threshold_uncertainty_score":0.063727915},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028284546,0.040318415,0.0063579422,0.03905714,0.8732931,0.00009833793,0.0007855946,0.00021063558,0.039596036],"genre_scores_gemma":[0.0042369827,0.029114831,0.002651862,0.008485481,0.82181823,0.00011177491,0.0016444123,0.00044131425,0.13149512],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983657,0.00029989477,0.00018801833,0.00030558518,0.0007280368,0.00011275953],"domain_scores_gemma":[0.9892397,0.0038195073,0.00042067285,0.000757629,0.0046582515,0.0011042929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030178318,0.002028196,0.0020672006,0.0049829814,0.0023522747,0.0067026475,0.002094502,0.0034281602,0.09559934],"category_scores_gemma":[0.0128350975,0.0007117732,0.0015978013,0.004276474,0.0013039515,0.0068816165,0.0023270715,0.0069558034,0.04337209],"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.000022313032,0.00001810853,0.000043006992,0.00021321572,0.00000919182,0.00003369807,0.000019186833,0.00014253489,0.0000851818,0.0029216558,0.9700979,0.026394038],"study_design_scores_gemma":[0.000012104048,0.000032716733,0.0004258974,0.0003330382,0.000018016584,0.00010631393,0.000037357797,0.00046626054,0.00011727189,0.010710067,0.98772347,0.000017522729],"about_ca_topic_score_codex":0.0020161776,"about_ca_topic_score_gemma":0.0027561267,"teacher_disagreement_score":0.09559934,"about_ca_system_score_codex":0.0025231373,"about_ca_system_score_gemma":0.002083858,"threshold_uncertainty_score":0.31981164},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037258904,0.0007048296,0.9514312,0.00059729186,0.00006647711,0.00032708983,0.00015495799,0.0009696548,0.008489654],"genre_scores_gemma":[0.6928889,0.0007324701,0.29955187,0.0001697784,0.000087086264,0.00037866415,0.0006133113,0.000084789004,0.0054931226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859375,0.00046648266,0.00011791212,0.0001608242,0.0005300727,0.00013088962],"domain_scores_gemma":[0.9974611,0.0016261796,0.00011763615,0.00022173788,0.00047205164,0.00010137543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016481072,0.00052893773,0.0008086821,0.0016947776,0.0006221706,0.0019193242,0.0027574548,0.0013133697,0.006236606],"category_scores_gemma":[0.011088348,0.000479846,0.00055481266,0.0010251654,0.0009304734,0.0024450843,0.0015410461,0.0013678625,0.0010225786],"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.00032026673,0.00060748734,0.0019288711,0.00018040629,0.00008414784,0.0003177315,0.00018172053,0.5715643,0.0023802167,0.03010277,0.0037027246,0.3886294],"study_design_scores_gemma":[0.000030269823,0.000029891671,0.00013981642,0.000015093306,0.000013868371,0.00004901044,0.000020529458,0.98223823,0.0009925722,0.0154505335,0.0010120274,0.000008216378],"about_ca_topic_score_codex":0.006955323,"about_ca_topic_score_gemma":0.004538451,"teacher_disagreement_score":0.006955323,"about_ca_system_score_codex":0.0011698612,"about_ca_system_score_gemma":0.0011291336,"threshold_uncertainty_score":0.020863533},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3362307,0.00062909577,0.52153206,0.0030738756,0.00007374888,0.00028548707,0.00022595712,0.0007180289,0.13723107],"genre_scores_gemma":[0.9340355,0.00019202262,0.06283987,0.000120224984,0.000019933887,0.00013036019,0.00009240713,0.00006678012,0.0025029727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769384,0.0012179767,0.00012115771,0.00022683712,0.00052704103,0.00021313563],"domain_scores_gemma":[0.99151057,0.005492193,0.0005870296,0.001192494,0.00062794785,0.0005896628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021755283,0.00049704005,0.00042993922,0.0011795779,0.000975845,0.010149925,0.0018001051,0.0019772435,0.0059572617],"category_scores_gemma":[0.013777943,0.000635501,0.00076877594,0.0009549709,0.003576404,0.007415614,0.0025355371,0.0015864272,0.0006841811],"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.0003098303,0.00030710053,0.009132255,0.00030383113,0.00014031857,0.0002488168,0.010320407,0.023018753,0.009520983,0.8988118,0.0010232931,0.04686258],"study_design_scores_gemma":[0.00008270539,0.00018791168,0.011105811,0.00013213926,0.00016597038,0.00019720488,0.0037307385,0.18188,0.009673487,0.7838325,0.008897941,0.00011367946],"about_ca_topic_score_codex":0.0014514579,"about_ca_topic_score_gemma":0.0008160181,"teacher_disagreement_score":0.010149925,"about_ca_system_score_codex":0.0008597059,"about_ca_system_score_gemma":0.0010744869,"threshold_uncertainty_score":0.019929051},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001934721,0.0026004876,0.0013866404,0.20051165,0.7707321,0.000056928173,0.0009758415,0.00040187183,0.023141066],"genre_scores_gemma":[0.008548862,0.0076895384,0.005598952,0.35648614,0.2286691,0.00034701085,0.0026907206,0.0014980452,0.3884717],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.990524,0.0018376659,0.0016753392,0.0011150596,0.004047265,0.00080065837],"domain_scores_gemma":[0.97486645,0.0071871784,0.0011785362,0.0013182778,0.014712519,0.0007370652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006367425,0.0025614323,0.0027893863,0.0059056696,0.009865219,0.008632944,0.0066583226,0.020279355,0.048925918],"category_scores_gemma":[0.062029283,0.0017807116,0.002533402,0.00403077,0.0057114745,0.0059306617,0.0038676013,0.01884632,0.02974302],"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.000012853152,0.0000039496385,0.00001600046,0.000040442254,0.0000042726633,0.000055692697,0.000024697509,0.0000237677,0.00001324739,0.002386555,0.99566877,0.0017497166],"study_design_scores_gemma":[0.000032004627,0.000021493204,0.0003705738,0.00032318663,0.00003905398,0.00012230125,0.00014270403,0.00023976888,0.00017064423,0.0067044105,0.99177754,0.000056400204],"about_ca_topic_score_codex":0.06098112,"about_ca_topic_score_gemma":0.074428156,"teacher_disagreement_score":0.06098112,"about_ca_system_score_codex":0.01076724,"about_ca_system_score_gemma":0.012320418,"threshold_uncertainty_score":0.16367352},"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":"editorial","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011888964,0.0043470217,0.011999299,0.28725442,0.64125216,0.00019646541,0.0017157465,0.0020249719,0.050021004],"genre_scores_gemma":[0.03253618,0.008292116,0.022181617,0.29816878,0.108988725,0.00067708455,0.0023237434,0.0032065306,0.5236253],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.95987964,0.007128958,0.00503223,0.004535495,0.021874707,0.0015490014],"domain_scores_gemma":[0.8164238,0.046302803,0.011435195,0.027778331,0.09435841,0.003701461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02076681,0.0017421939,0.0015249896,0.0063567813,0.0041379924,0.0095515605,0.0029320817,0.007756608,0.058906727],"category_scores_gemma":[0.27360752,0.0008365067,0.0015222426,0.004822391,0.0037278186,0.0052737137,0.005527962,0.012810657,0.05482708],"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.0000496778,0.000013076162,0.0002293484,0.0001452918,0.000024428018,0.00024274294,0.0003149057,0.00013928644,0.00011253694,0.010686849,0.9394963,0.048545446],"study_design_scores_gemma":[0.000015427746,0.000015632872,0.00021312747,0.00044743958,0.000025236182,0.0003887165,0.00032681838,0.0003364027,0.00038395007,0.008932668,0.9888898,0.000024724077],"about_ca_topic_score_codex":0.007568891,"about_ca_topic_score_gemma":0.009066975,"teacher_disagreement_score":0.058906727,"about_ca_system_score_codex":0.006122543,"about_ca_system_score_gemma":0.009442429,"threshold_uncertainty_score":0.19706267},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052053764,0.00042323765,0.941952,0.00032996666,0.000085327905,0.000064771695,0.00004892321,0.0004186023,0.0046233884],"genre_scores_gemma":[0.7905092,0.00033649078,0.20769106,0.0000534034,0.000043086096,0.0000903558,0.000047299796,0.000050167706,0.0011789142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995245,0.00018979743,0.000023762754,0.00008609514,0.00013507322,0.000040868497],"domain_scores_gemma":[0.99858344,0.0009596566,0.00011007549,0.00009256229,0.0001757623,0.000078509634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017067052,0.0006033633,0.0009546862,0.00049556384,0.0008860387,0.0010417259,0.0007788055,0.0010448885,0.0013315456],"category_scores_gemma":[0.0036160322,0.00031446706,0.0005577578,0.0011992599,0.0008496605,0.0010640459,0.001219249,0.00094975857,0.00012546677],"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.0002652973,0.00009021081,0.000632533,0.00006744592,0.000051385814,0.00019900667,0.00020955245,0.912668,0.0035988782,0.01691558,0.0009652397,0.064336896],"study_design_scores_gemma":[0.00001847588,0.000028114351,0.00010493455,0.000002618933,0.000010085784,0.000018783196,0.00002890523,0.99356973,0.0007339752,0.0050699483,0.00040959934,0.000004901572],"about_ca_topic_score_codex":0.008792925,"about_ca_topic_score_gemma":0.0045476854,"teacher_disagreement_score":0.008792925,"about_ca_system_score_codex":0.00075132964,"about_ca_system_score_gemma":0.0012263667,"threshold_uncertainty_score":0.017483532},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000674483,0.01804425,0.0007056257,0.04336345,0.93489945,0.000011481709,0.000072528586,0.00004034172,0.0027954758],"genre_scores_gemma":[0.0011766691,0.007794201,0.000247756,0.009066003,0.976756,0.000012049797,0.000025405898,0.000025114845,0.004896749],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976948,0.0004579357,0.00029672618,0.00030863413,0.0010901783,0.00015168522],"domain_scores_gemma":[0.9771985,0.013701704,0.0009090175,0.0005285617,0.006230697,0.0014316184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040583196,0.002070821,0.0023727189,0.0035167832,0.0015783154,0.0044370247,0.0020684474,0.0064298995,0.019144727],"category_scores_gemma":[0.01898045,0.00063986494,0.0015188045,0.0014352616,0.0020252177,0.0041223373,0.0010867293,0.009676054,0.006132753],"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.000063424275,0.000015394531,0.000036457957,0.0005104193,0.000029158688,0.00012747353,0.000016359161,0.00007892436,0.00007041831,0.0022157643,0.98167163,0.015164494],"study_design_scores_gemma":[0.000054309003,0.00003303782,0.0002121388,0.00037144573,0.000064651496,0.00021391784,0.000022137963,0.00036489445,0.00012251569,0.004829546,0.9936946,0.00001675315],"about_ca_topic_score_codex":0.0004564917,"about_ca_topic_score_gemma":0.0010362546,"teacher_disagreement_score":0.019144727,"about_ca_system_score_codex":0.0011070584,"about_ca_system_score_gemma":0.0007203038,"threshold_uncertainty_score":0.06404543},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017057417,0.00034593092,0.9776055,0.00014521503,0.000065346205,0.00005889558,0.000039054812,0.00049878296,0.004183835],"genre_scores_gemma":[0.52589434,0.00044206483,0.46326917,0.0001994416,0.0000852366,0.00041297343,0.00029978057,0.00014268945,0.009254256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998005,0.00004756346,0.0000142041945,0.000040774423,0.0000696873,0.000027284264],"domain_scores_gemma":[0.9997688,0.00009814248,0.000026651329,0.000027057555,0.00006730756,0.000011945043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004573412,0.00072888174,0.0010318913,0.0006056908,0.0003600123,0.000812381,0.0010812022,0.0009934765,0.0022097162],"category_scores_gemma":[0.0010845156,0.0003197058,0.0005262761,0.00061599916,0.00035640836,0.00072733266,0.00068612007,0.0006311298,0.00064279546],"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.00008697862,0.00007325033,0.00052492257,0.000060138,0.000057136655,0.00008255699,0.000063366286,0.87894046,0.0022877397,0.006264265,0.0019334476,0.1096257],"study_design_scores_gemma":[0.000012653438,0.000018952138,0.000049054466,0.0000019023512,0.0000051406114,0.000008937531,0.0000032257603,0.9986187,0.00021846162,0.0006358721,0.00042415675,0.000002806692],"about_ca_topic_score_codex":0.007923581,"about_ca_topic_score_gemma":0.004882891,"teacher_disagreement_score":0.007923581,"about_ca_system_score_codex":0.00042659504,"about_ca_system_score_gemma":0.0007789877,"threshold_uncertainty_score":0.015754879},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017584102,0.0013288159,0.9628859,0.0023781373,0.00020393818,0.0015284807,0.00080296287,0.0076177362,0.0056699924],"genre_scores_gemma":[0.10371373,0.00086442096,0.89251983,0.00022524946,0.0000704482,0.0005949444,0.0010010427,0.000089223286,0.0009211257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995025,0.0022499587,0.0010589353,0.00047362715,0.0010348165,0.00015771779],"domain_scores_gemma":[0.9850214,0.010673666,0.00089138956,0.0013523438,0.0015117968,0.0005493719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008881176,0.0012332122,0.00093502627,0.0034878866,0.0014732989,0.0050376933,0.003506638,0.0019398329,0.006803503],"category_scores_gemma":[0.026749475,0.0009146158,0.00126709,0.0024982078,0.0009457816,0.0035825965,0.0024549959,0.001799442,0.0017673714],"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.00076682237,0.00081145245,0.0071781264,0.0014774159,0.0003411981,0.0028369187,0.0019721896,0.15515639,0.007191125,0.05052632,0.02788888,0.7438532],"study_design_scores_gemma":[0.0006976393,0.00030553603,0.002127412,0.00062829495,0.0002461051,0.0016136342,0.0007656897,0.8321855,0.0076313345,0.09303647,0.060552374,0.00021002539],"about_ca_topic_score_codex":0.008536716,"about_ca_topic_score_gemma":0.010560703,"teacher_disagreement_score":0.008881176,"about_ca_system_score_codex":0.00189409,"about_ca_system_score_gemma":0.0023583847,"threshold_uncertainty_score":0.046968758},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017692975,0.00022961432,0.9478361,0.00025427432,0.000066576365,0.00079244404,0.001788216,0.03998344,0.007280164],"genre_scores_gemma":[0.014238036,0.000276486,0.978218,0.000105970474,0.000022960032,0.0006338166,0.0032595245,0.00091955904,0.0023255637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769294,0.0007273243,0.00039582798,0.00036158116,0.0007266351,0.00009571157],"domain_scores_gemma":[0.9962669,0.0022234835,0.00024912358,0.00071692286,0.0003631836,0.00018030909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050897007,0.0016418049,0.0010848944,0.003978062,0.0011656765,0.0051293788,0.0051009557,0.0021962663,0.029002897],"category_scores_gemma":[0.011754434,0.001649641,0.0020406789,0.0023456337,0.0012800419,0.0052153887,0.0037193312,0.001890331,0.007824676],"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.00067474955,0.00060442905,0.0021955352,0.001864827,0.00024466377,0.0020092747,0.0020035899,0.05292104,0.010794856,0.15407616,0.14525555,0.6273553],"study_design_scores_gemma":[0.0008330717,0.00021913735,0.0009520645,0.00080349215,0.00025875488,0.002044205,0.00045789898,0.40565547,0.013474035,0.14016007,0.43488193,0.0002599242],"about_ca_topic_score_codex":0.0036976982,"about_ca_topic_score_gemma":0.006857069,"teacher_disagreement_score":0.029002897,"about_ca_system_score_codex":0.0016044833,"about_ca_system_score_gemma":0.0024262897,"threshold_uncertainty_score":0.09702438},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94979817,0.00035174665,0.03991143,0.00016696966,0.000109459615,0.000413663,0.00095324946,0.001234385,0.0070609585],"genre_scores_gemma":[0.9570645,0.00034008754,0.03644709,0.000064184685,0.00001905648,0.00032541846,0.00075557537,0.00018771856,0.0047964267],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99830616,0.00088193966,0.00015771839,0.00024624515,0.00027182512,0.000136206],"domain_scores_gemma":[0.9928705,0.0032123413,0.00024018402,0.002090402,0.0014209332,0.00016574918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002752258,0.0012288374,0.001130858,0.00085109874,0.0006192458,0.0008848812,0.0013952326,0.0016668848,0.007580118],"category_scores_gemma":[0.012243893,0.00029402552,0.00060082064,0.0005004983,0.00070406066,0.0023037526,0.0013481292,0.00053010543,0.0018778973],"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.008839178,0.008684024,0.051380612,0.0024330653,0.00042944722,0.0020816848,0.02210469,0.027149096,0.22136119,0.0019933332,0.0073098894,0.6462338],"study_design_scores_gemma":[0.0016673895,0.04827087,0.1737453,0.0013803378,0.0025446315,0.007119896,0.03604671,0.18998297,0.43074456,0.012777039,0.09422211,0.0014981909],"about_ca_topic_score_codex":0.003580915,"about_ca_topic_score_gemma":0.0041056494,"teacher_disagreement_score":0.007580118,"about_ca_system_score_codex":0.00045278025,"about_ca_system_score_gemma":0.00078669976,"threshold_uncertainty_score":0.02535808},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010173024,0.00024252001,0.98483765,0.00027486068,0.000016314872,0.00034990686,0.000059295475,0.00015871666,0.0038877656],"genre_scores_gemma":[0.12258058,0.00015310086,0.8759331,0.000038830236,0.000016209095,0.00031425912,0.00019689724,0.000014294821,0.0007526096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929975,0.0037331684,0.00072568085,0.000473817,0.0018617236,0.00020817522],"domain_scores_gemma":[0.9953998,0.0030149575,0.00035925282,0.00046658,0.00060666486,0.0001526647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066556837,0.0007826903,0.00086763327,0.0062624793,0.0014390629,0.004311176,0.0032561712,0.0018510275,0.0033254705],"category_scores_gemma":[0.017153475,0.00066182704,0.0017755985,0.003742315,0.0026593818,0.004425795,0.0026901017,0.0010964882,0.00043392528],"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.00020037808,0.00047245948,0.0023665144,0.0004910429,0.00018368506,0.0014084316,0.0029062354,0.1801749,0.0031611412,0.5793363,0.0029667926,0.22633219],"study_design_scores_gemma":[0.00011227499,0.000119435885,0.0008673113,0.00018897513,0.00013740458,0.00067472114,0.0009837045,0.63579226,0.0027459294,0.3426606,0.015640602,0.0000767459],"about_ca_topic_score_codex":0.005950138,"about_ca_topic_score_gemma":0.006649665,"teacher_disagreement_score":0.0066556837,"about_ca_system_score_codex":0.0026371113,"about_ca_system_score_gemma":0.0018636439,"threshold_uncertainty_score":0.035198987},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008721512,0.00023309012,0.9936941,0.00069089653,0.000030750485,0.00012929634,0.00005742334,0.0002523331,0.004039873],"genre_scores_gemma":[0.04324681,0.00034906017,0.954122,0.00010488456,0.000043917466,0.00030880605,0.00018861244,0.00004061353,0.0015953456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967283,0.0013602606,0.00040837837,0.00049502903,0.00081634516,0.0001917568],"domain_scores_gemma":[0.99571145,0.0024732738,0.00048930483,0.0006833012,0.00037011498,0.00027263592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059607835,0.0016829267,0.00089875166,0.0026237795,0.0017853607,0.004623398,0.005732108,0.0032488296,0.005472222],"category_scores_gemma":[0.00832821,0.0012008814,0.0027039524,0.001602864,0.0051111802,0.0049673473,0.004125032,0.002996062,0.0009830802],"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.00003270063,0.00015394014,0.0008035621,0.0002502439,0.00008897892,0.0009793934,0.00090635853,0.09616224,0.0012534267,0.8405049,0.0034307214,0.055433508],"study_design_scores_gemma":[0.00008581887,0.00006603082,0.00023869699,0.00022213005,0.00008964319,0.0006462248,0.00026806025,0.35799736,0.0019387495,0.5937,0.044673473,0.00007379017],"about_ca_topic_score_codex":0.011217746,"about_ca_topic_score_gemma":0.011205329,"teacher_disagreement_score":0.011217746,"about_ca_system_score_codex":0.0021366775,"about_ca_system_score_gemma":0.0026941844,"threshold_uncertainty_score":0.031524003},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018337133,0.00023559292,0.99212134,0.00049132976,0.000057115638,0.00005185684,0.000074751166,0.000822166,0.0043122317],"genre_scores_gemma":[0.26126602,0.0006595237,0.7302147,0.00043770403,0.00013852572,0.00036732957,0.00035611802,0.0003597061,0.0062003573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99444133,0.0026605572,0.0002462557,0.00046333857,0.0018218465,0.0003666565],"domain_scores_gemma":[0.980931,0.014731696,0.00043290024,0.0024654695,0.0012578776,0.00018104319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004587242,0.0014282084,0.0014281594,0.002688194,0.0012886702,0.003166432,0.0041560624,0.0016375827,0.0069820844],"category_scores_gemma":[0.01818573,0.0014327692,0.0028026148,0.0016187755,0.0043853754,0.004249447,0.0023217471,0.00566764,0.0008925969],"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.0001686963,0.0001560205,0.00030892238,0.00031514437,0.00015217275,0.00012399492,0.0002847365,0.17779867,0.001970015,0.7540193,0.0036262674,0.061076052],"study_design_scores_gemma":[0.00006873999,0.000033135915,0.00007407911,0.00007679734,0.00007468625,0.000031743955,0.000034476212,0.48433754,0.0030661689,0.5068058,0.005372671,0.00002424252],"about_ca_topic_score_codex":0.014369499,"about_ca_topic_score_gemma":0.011234773,"teacher_disagreement_score":0.014369499,"about_ca_system_score_codex":0.003063006,"about_ca_system_score_gemma":0.004932801,"threshold_uncertainty_score":0.028571725},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12629806,0.007249478,0.82776886,0.0041068443,0.00031529344,0.00018939431,0.002080057,0.0052662063,0.0267258],"genre_scores_gemma":[0.68404573,0.0043321275,0.29844397,0.000782901,0.00027563146,0.00048814065,0.002588038,0.0005996777,0.008443783],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969254,0.00062256365,0.0002653075,0.0004506164,0.0015668772,0.00016930926],"domain_scores_gemma":[0.975466,0.014074982,0.0008447538,0.007674561,0.0017381442,0.00020150686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020565328,0.0006095126,0.0010580553,0.002147557,0.00077489973,0.0038676911,0.002442371,0.001084136,0.0069111986],"category_scores_gemma":[0.024964146,0.0007195868,0.00063302286,0.0049573574,0.0017269852,0.011178316,0.0027044308,0.0016691118,0.002071489],"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.0010016685,0.0000909104,0.0021966312,0.0004983638,0.00007834664,0.00040234072,0.00066595915,0.05977098,0.008989574,0.27851585,0.010331137,0.6374582],"study_design_scores_gemma":[0.00019505613,0.00022969369,0.0010558164,0.00022241668,0.00009545535,0.00076818716,0.00038164415,0.35529166,0.024227872,0.5784407,0.039016835,0.00007459353],"about_ca_topic_score_codex":0.0025606735,"about_ca_topic_score_gemma":0.001658245,"teacher_disagreement_score":0.0069111986,"about_ca_system_score_codex":0.0013011086,"about_ca_system_score_gemma":0.0013666957,"threshold_uncertainty_score":0.023120224},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039487176,0.005359821,0.88647103,0.0038891041,0.0003860707,0.00021552431,0.00046922982,0.0030388206,0.060683344],"genre_scores_gemma":[0.6707413,0.0033676059,0.31154045,0.00044262587,0.00017936806,0.00019381793,0.00083356514,0.000088858265,0.012612395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968517,0.00009100994,0.0000285938,0.000046167315,0.000110690504,0.000038380633],"domain_scores_gemma":[0.9996575,0.00015849588,0.000044392575,0.000038483882,0.00006427448,0.000036779016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004503583,0.00044865717,0.00031949862,0.00039421523,0.0006160464,0.0019552733,0.00079768524,0.000750928,0.004166711],"category_scores_gemma":[0.0011443087,0.00016413647,0.00025568786,0.00048305737,0.00051685254,0.0010865455,0.00085874065,0.00080939714,0.00082099973],"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.00032790913,0.00018948644,0.0014776337,0.00068733975,0.000088676534,0.00053528143,0.00048339184,0.17393705,0.026803328,0.22440585,0.026319586,0.54474455],"study_design_scores_gemma":[0.00009281066,0.00018152357,0.0014113585,0.00016961929,0.000077245655,0.00022888591,0.00023312012,0.67311543,0.010618949,0.17382628,0.13999839,0.000046416015],"about_ca_topic_score_codex":0.003567177,"about_ca_topic_score_gemma":0.0039262683,"teacher_disagreement_score":0.004166711,"about_ca_system_score_codex":0.0007825535,"about_ca_system_score_gemma":0.0012264537,"threshold_uncertainty_score":0.013939083},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015907908,0.0004574841,0.99167633,0.0008385841,0.000037651844,0.000042772106,0.000038742706,0.0001089727,0.005208623],"genre_scores_gemma":[0.13046707,0.0017354616,0.8643488,0.00038781183,0.000120264136,0.00019299556,0.00017182971,0.00007671564,0.0024989955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99678373,0.0012831163,0.00022736363,0.00052342034,0.0010090774,0.00017328151],"domain_scores_gemma":[0.99437016,0.0038258403,0.00033753694,0.0008165587,0.0004946658,0.00015529359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004172703,0.0011078565,0.0009807523,0.0021361783,0.0012080686,0.0029965618,0.0032085427,0.0016800362,0.0036163277],"category_scores_gemma":[0.009679217,0.00087995414,0.0024384395,0.0024271104,0.0058531202,0.009503695,0.004576824,0.0041063866,0.0006406805],"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.00007135346,0.00007033061,0.0003867343,0.0004576904,0.00012954854,0.000270779,0.0012066916,0.09546372,0.0012838644,0.7655986,0.0017381671,0.13332254],"study_design_scores_gemma":[0.00002048558,0.000036791465,0.00011252111,0.0000876572,0.000049835704,0.000108168504,0.00014364754,0.15772842,0.0013319922,0.8281666,0.0121780075,0.000035791498],"about_ca_topic_score_codex":0.0063901613,"about_ca_topic_score_gemma":0.008030346,"teacher_disagreement_score":0.0063901613,"about_ca_system_score_codex":0.0019816887,"about_ca_system_score_gemma":0.0032849996,"threshold_uncertainty_score":0.022067606},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00892009,0.18055855,0.48642328,0.1289074,0.0020725909,0.00017105139,0.00050807296,0.000362044,0.19207682],"genre_scores_gemma":[0.49664864,0.14533332,0.30646464,0.015894337,0.013637793,0.0008126538,0.0010679434,0.00036902772,0.019771619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9907122,0.0054991497,0.00045468734,0.00085344265,0.002119612,0.00036094876],"domain_scores_gemma":[0.96072555,0.033497933,0.0008185096,0.0017142232,0.002831838,0.00041193533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018336413,0.0018707418,0.0021320477,0.0074066096,0.002626073,0.00713762,0.005480109,0.006469445,0.008425485],"category_scores_gemma":[0.023935273,0.0011488638,0.0023399063,0.007124275,0.02722118,0.022744365,0.0034737727,0.009738109,0.0017630729],"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.000005180527,0.000013933395,0.00007935456,0.00011889626,0.000011036538,0.000033936463,0.00021253034,0.00096074666,0.000012120654,0.9861211,0.0025868595,0.009844081],"study_design_scores_gemma":[0.0000035537573,0.0000032333885,0.000029258419,0.00006757079,0.0000028507463,0.000028112067,0.000102530124,0.0012260048,0.000017989267,0.99149466,0.0070200088,0.000004227672],"about_ca_topic_score_codex":0.005424967,"about_ca_topic_score_gemma":0.0019257062,"teacher_disagreement_score":0.018336413,"about_ca_system_score_codex":0.006701041,"about_ca_system_score_gemma":0.0026052573,"threshold_uncertainty_score":0.09697342},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02324038,0.00066699577,0.9530455,0.00078532944,0.0001685251,0.00017671488,0.00006174049,0.002044572,0.019810276],"genre_scores_gemma":[0.44308713,0.0011696146,0.510992,0.00033985957,0.00013094471,0.00036281484,0.00031936858,0.00039059782,0.04320762],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987538,0.00025472027,0.00006531385,0.00024718727,0.00057803176,0.00010089973],"domain_scores_gemma":[0.99860793,0.0006902007,0.00006244219,0.00021724615,0.00031837754,0.0001038264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014801874,0.0009404733,0.000597897,0.0006946331,0.0011239392,0.00395208,0.0012723713,0.0021222583,0.00978461],"category_scores_gemma":[0.0035984362,0.0007131314,0.0009220207,0.00052836,0.0015217091,0.0024485106,0.0015547298,0.0028232466,0.002119499],"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.0009046437,0.0003556318,0.0015635754,0.0010687127,0.00020309817,0.002142458,0.002594255,0.24983084,0.09974752,0.31376657,0.008225536,0.31959713],"study_design_scores_gemma":[0.00034650444,0.00043433052,0.0012355238,0.00031273795,0.00013338975,0.0010162899,0.0005622818,0.7090469,0.06648486,0.06840154,0.15194812,0.00007748412],"about_ca_topic_score_codex":0.009166604,"about_ca_topic_score_gemma":0.009506569,"teacher_disagreement_score":0.00978461,"about_ca_system_score_codex":0.0013770794,"about_ca_system_score_gemma":0.0019405338,"threshold_uncertainty_score":0.032732785},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0098979,0.0003348416,0.95532036,0.00024713558,0.00012022702,0.00036108497,0.0009340008,0.023159115,0.009625316],"genre_scores_gemma":[0.16956805,0.0003575563,0.8158639,0.00037162568,0.000057717723,0.00064370356,0.0026516411,0.00037186427,0.010113975],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922836,0.00014652935,0.00010387654,0.00021719628,0.00026662275,0.000037442016],"domain_scores_gemma":[0.9979784,0.001035926,0.000073666764,0.0002713301,0.00056055473,0.00008012421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013505819,0.0006394876,0.00063936994,0.00086193735,0.00038098852,0.0011490171,0.0019140409,0.0012030837,0.012107957],"category_scores_gemma":[0.004535826,0.00029885434,0.00038941635,0.00052345876,0.00029760727,0.0010261603,0.0005452959,0.0009846903,0.0054699383],"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.0004343322,0.00037327668,0.0013516053,0.00045669393,0.000087259374,0.00065805024,0.00019438408,0.06513054,0.030354924,0.006059309,0.025870921,0.8690287],"study_design_scores_gemma":[0.00022668864,0.00026189754,0.0019841925,0.00022386934,0.00012443366,0.00060591084,0.00011296712,0.87341046,0.039274324,0.012809995,0.070854574,0.000110740315],"about_ca_topic_score_codex":0.0047504674,"about_ca_topic_score_gemma":0.0039386163,"teacher_disagreement_score":0.012107957,"about_ca_system_score_codex":0.00051298767,"about_ca_system_score_gemma":0.0010150176,"threshold_uncertainty_score":0.04050517},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026744189,0.0002634322,0.9580976,0.00033711363,0.0000529467,0.00062042865,0.0004975353,0.010520444,0.0028662868],"genre_scores_gemma":[0.19860229,0.00021608837,0.797316,0.0001521786,0.000024563376,0.00047034258,0.00090609945,0.0002358722,0.0020765434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992119,0.00019928861,0.00011648416,0.00019920252,0.0002344828,0.000038591435],"domain_scores_gemma":[0.998083,0.0011777501,0.00015742138,0.0002326453,0.0002765415,0.00007272552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019187151,0.0008173963,0.00062788633,0.0011030897,0.00062298233,0.0014967354,0.0026346305,0.0014070724,0.0069233244],"category_scores_gemma":[0.0057230084,0.00058779476,0.0010779733,0.0006763696,0.00045004327,0.0011815239,0.0010189668,0.00096001936,0.0012095857],"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.00037797148,0.00074048265,0.003868597,0.00056032307,0.00018019597,0.0011424929,0.0007793402,0.508716,0.016007824,0.0075343326,0.008615383,0.45147705],"study_design_scores_gemma":[0.00006215559,0.000044264085,0.0005227219,0.00004289142,0.000048101756,0.00014694243,0.000036043155,0.9870821,0.0037358068,0.0028045832,0.0054528923,0.000021505914],"about_ca_topic_score_codex":0.008307446,"about_ca_topic_score_gemma":0.008151231,"teacher_disagreement_score":0.008307446,"about_ca_system_score_codex":0.0010782706,"about_ca_system_score_gemma":0.0011905726,"threshold_uncertainty_score":0.023160815},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013650393,0.00027757615,0.98882186,0.0020597032,0.000084212435,0.00006396001,0.000075066986,0.00026800175,0.006984623],"genre_scores_gemma":[0.10595775,0.0006323901,0.88679105,0.0009262922,0.000366294,0.0004137597,0.00037926578,0.00025049763,0.004282684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99398535,0.0029956114,0.00052222545,0.00073978765,0.0014021021,0.00035491947],"domain_scores_gemma":[0.9926305,0.0040197023,0.00032673514,0.0016922158,0.0010363949,0.00029453804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008062209,0.0014831927,0.0015823856,0.0026712639,0.0021379937,0.0074892673,0.0066063744,0.0044975365,0.010578561],"category_scores_gemma":[0.021029992,0.0020574655,0.0038171692,0.0023562473,0.011774091,0.016623465,0.008022582,0.00985119,0.002272494],"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.000008979781,0.000012331867,0.000065267115,0.000054930766,0.0000113720835,0.00002965051,0.00017056313,0.0047181854,0.00012552284,0.98733217,0.0011730258,0.006298054],"study_design_scores_gemma":[0.000014990565,0.000010464522,0.000032959953,0.000032488657,0.000015622785,0.00003276268,0.000066415174,0.03703096,0.00021492632,0.9550789,0.0074577047,0.000011693451],"about_ca_topic_score_codex":0.005801762,"about_ca_topic_score_gemma":0.0050530126,"teacher_disagreement_score":0.010578561,"about_ca_system_score_codex":0.003404395,"about_ca_system_score_gemma":0.0026826474,"threshold_uncertainty_score":0.042637587},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14110984,0.0024704034,0.84411854,0.000471,0.00006506023,0.0001466955,0.00027549145,0.0023765112,0.0089663975],"genre_scores_gemma":[0.7369323,0.001182313,0.2599539,0.00008676792,0.000038095124,0.00009269487,0.00043562942,0.000120250224,0.0011580259],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959487,0.00010026087,0.000027827662,0.00011222251,0.000110785266,0.00005393828],"domain_scores_gemma":[0.9994584,0.00024786586,0.000059786387,0.00010193262,0.00009742344,0.00003452777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000599817,0.0008575186,0.0008957056,0.0009872636,0.000501673,0.00097091036,0.0007919231,0.00072219054,0.0016141813],"category_scores_gemma":[0.0024144675,0.00041752172,0.0005968289,0.0007534878,0.00052991067,0.0018578344,0.001841637,0.00057838217,0.0003159639],"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.00031436462,0.00024298992,0.005569292,0.00041029076,0.00014837662,0.00031287828,0.0005169325,0.56956017,0.024619443,0.012559246,0.0037667672,0.3819793],"study_design_scores_gemma":[0.00004422753,0.00016346492,0.0029106115,0.000056849636,0.00016305404,0.00015364429,0.00031180118,0.96800107,0.0115562165,0.009530267,0.0070694075,0.000039454226],"about_ca_topic_score_codex":0.0072639296,"about_ca_topic_score_gemma":0.01161092,"teacher_disagreement_score":0.0072639296,"about_ca_system_score_codex":0.00041564155,"about_ca_system_score_gemma":0.0009278079,"threshold_uncertainty_score":0.014443278},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030928947,0.0010037782,0.9402142,0.0034314855,0.00012059514,0.00070359535,0.0012787727,0.008284128,0.014034515],"genre_scores_gemma":[0.3616873,0.0008835073,0.63070506,0.0004200305,0.00008289052,0.0006102084,0.0019657663,0.00021674995,0.0034285388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968901,0.0011798253,0.0003365383,0.00050975697,0.00080902904,0.00027468844],"domain_scores_gemma":[0.99247825,0.0053284243,0.00047492265,0.00061899965,0.00082072744,0.00027865864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044368287,0.0013565691,0.0010695944,0.0020944763,0.0017745729,0.003999518,0.002667335,0.0015819661,0.0070131836],"category_scores_gemma":[0.013081333,0.00068583246,0.0011954797,0.0016685772,0.0015737143,0.0041465038,0.002289099,0.0017080813,0.0012360952],"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.0007023974,0.00059636193,0.0034055987,0.00094095006,0.00017126565,0.0007205734,0.0007290805,0.4427691,0.004269861,0.091829225,0.023068028,0.4307976],"study_design_scores_gemma":[0.00012579712,0.00009012565,0.00036847984,0.00008751121,0.000070414666,0.00012705804,0.00027404702,0.88948685,0.005397331,0.08535549,0.018574614,0.000042233798],"about_ca_topic_score_codex":0.011294201,"about_ca_topic_score_gemma":0.015356405,"teacher_disagreement_score":0.011294201,"about_ca_system_score_codex":0.0018440955,"about_ca_system_score_gemma":0.0033092867,"threshold_uncertainty_score":0.0234645},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016481126,0.0017922085,0.31768292,0.012713868,0.0007235823,0.00021830693,0.0010331349,0.0016711626,0.6476836],"genre_scores_gemma":[0.4546702,0.0028196468,0.42011765,0.0028556534,0.0001355574,0.0006864623,0.0011640892,0.0010046931,0.11654598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854195,0.0010072669,0.000041319134,0.000069270405,0.00026204533,0.00007819785],"domain_scores_gemma":[0.998958,0.00070238725,0.00004278779,0.00011671651,0.00008801692,0.00009207624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015991292,0.0007368238,0.0003412599,0.0010949632,0.0025149994,0.004009204,0.00092948496,0.00280913,0.017285574],"category_scores_gemma":[0.0025123549,0.00030300548,0.0010263029,0.0018840565,0.004254294,0.0044528544,0.0029498937,0.002589165,0.0036991304],"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.0000380609,0.000036435915,0.00025754757,0.000101107646,0.000008494656,0.0007703457,0.0032460457,0.0039447714,0.0003194386,0.96504766,0.012553458,0.013676637],"study_design_scores_gemma":[0.00006524445,0.000048408303,0.0005227043,0.00017539407,0.000021129796,0.0007383655,0.0038425892,0.028661497,0.00080952805,0.5309661,0.4341023,0.000046735167],"about_ca_topic_score_codex":0.012671551,"about_ca_topic_score_gemma":0.01712415,"teacher_disagreement_score":0.017285574,"about_ca_system_score_codex":0.0019499998,"about_ca_system_score_gemma":0.0019436819,"threshold_uncertainty_score":0.057826042},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008107848,0.00025266374,0.98662263,0.00017416723,0.000013907842,0.00010564018,0.00013182312,0.0010782962,0.003513016],"genre_scores_gemma":[0.13713029,0.00042891616,0.8593399,0.00010012094,0.00001732744,0.00021253899,0.0005646792,0.00015014189,0.0020560406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984439,0.000564851,0.00015223547,0.00024658584,0.0004585029,0.00013397424],"domain_scores_gemma":[0.9981178,0.0010348562,0.00016123978,0.00043369073,0.0001606553,0.000091782334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017651806,0.00057459145,0.0003859151,0.00075275183,0.00044311475,0.0011753349,0.0008883923,0.0005436639,0.0030087824],"category_scores_gemma":[0.004542391,0.0006006122,0.0009542415,0.0010263763,0.0014557136,0.0024667012,0.0016246206,0.0017499054,0.0005179321],"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.0002085472,0.0001441362,0.0015057249,0.0006540181,0.00009240322,0.00032185754,0.0019811955,0.2862554,0.016762925,0.3952066,0.006157528,0.2907097],"study_design_scores_gemma":[0.00006659239,0.00010230098,0.00095647125,0.00012391162,0.00007131598,0.00018494166,0.00022417393,0.69211805,0.0075940485,0.2685131,0.0300016,0.000043534426],"about_ca_topic_score_codex":0.00713409,"about_ca_topic_score_gemma":0.00925393,"teacher_disagreement_score":0.00713409,"about_ca_system_score_codex":0.0009968384,"about_ca_system_score_gemma":0.0014872334,"threshold_uncertainty_score":0.014185131},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045328677,0.015619281,0.20686631,0.5010326,0.0020124468,0.00014243797,0.00014159596,0.000554401,0.22830229],"genre_scores_gemma":[0.87952334,0.010274944,0.060291946,0.026579047,0.0016277807,0.00022615213,0.00010822756,0.00024384924,0.02112476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99725807,0.0011559686,0.00010051657,0.0003354971,0.0008917934,0.0002580683],"domain_scores_gemma":[0.9871116,0.008136851,0.000596735,0.0011986698,0.0022721856,0.00068402773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053396686,0.00032464505,0.00047086077,0.0006810874,0.0013480873,0.0032571012,0.0007992237,0.0026813312,0.004721924],"category_scores_gemma":[0.015069549,0.00029094255,0.00045349746,0.00043926784,0.010835162,0.0072257654,0.0027265134,0.0039761732,0.0015261321],"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.000017077853,0.000020476624,0.00062693795,0.00015214505,0.000013607889,0.00014445138,0.00036313583,0.002577312,0.0006868203,0.9729153,0.007007107,0.015475646],"study_design_scores_gemma":[0.000018084533,0.000023000512,0.00035467127,0.00006987382,0.000005417175,0.00017086035,0.00030381343,0.0027134381,0.00047149247,0.9357396,0.060117573,0.000012086505],"about_ca_topic_score_codex":0.0013943425,"about_ca_topic_score_gemma":0.0009748891,"teacher_disagreement_score":0.0053396686,"about_ca_system_score_codex":0.0017604422,"about_ca_system_score_gemma":0.0020491974,"threshold_uncertainty_score":0.02823919},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38199878,0.00040494083,0.6095233,0.0010694986,0.00006319581,0.00020557013,0.0008097639,0.0016107733,0.004314182],"genre_scores_gemma":[0.93009937,0.00018347788,0.06781835,0.00007873477,0.000018598612,0.000083296145,0.00038795607,0.00005591508,0.0012743106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994276,0.00020584905,0.00003513098,0.00013327802,0.000122064375,0.00007598959],"domain_scores_gemma":[0.9950506,0.0037712427,0.00029601797,0.00033957112,0.0003540625,0.00018846181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013377907,0.00060771813,0.0008940124,0.00048973854,0.0004142022,0.00109733,0.0012770164,0.0011443312,0.0032176203],"category_scores_gemma":[0.007679366,0.000329239,0.00094786193,0.00046860604,0.00088420184,0.002333812,0.0009543761,0.0012445778,0.0002806243],"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.0007893261,0.00022455945,0.0039934283,0.0000849689,0.00007006543,0.00016913626,0.00015702826,0.9258478,0.00089394697,0.023913778,0.00085731625,0.042998556],"study_design_scores_gemma":[0.000017401042,0.00003133562,0.00011322744,0.000001951131,0.000009745529,0.000010827059,0.000012772866,0.9914642,0.00018398112,0.008060789,0.000088123365,0.000005582479],"about_ca_topic_score_codex":0.025332784,"about_ca_topic_score_gemma":0.014277336,"teacher_disagreement_score":0.025332784,"about_ca_system_score_codex":0.0016325068,"about_ca_system_score_gemma":0.0016866816,"threshold_uncertainty_score":0.050370634},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037731044,0.00073303864,0.9391132,0.00080902386,0.00008523569,0.0009729256,0.00073266967,0.009272339,0.010550433],"genre_scores_gemma":[0.29416248,0.0004364312,0.69934905,0.00014074495,0.00006935009,0.00032908435,0.0016821229,0.00029726452,0.0035334835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733305,0.0010002194,0.00025222547,0.00030861993,0.00093486405,0.00017107281],"domain_scores_gemma":[0.99382544,0.0035887917,0.0003518675,0.0012397128,0.00079374685,0.00020043855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028861582,0.00074347574,0.00093129696,0.0048017087,0.0011398548,0.0038917493,0.003078863,0.0016383865,0.010927017],"category_scores_gemma":[0.014174605,0.0007107296,0.000739463,0.0021167144,0.00087234844,0.0029174252,0.0020560944,0.0012703551,0.0022251594],"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.0004560993,0.0005626739,0.0024260487,0.0002213051,0.00005413755,0.0005571851,0.00046751788,0.042817164,0.009275902,0.01532349,0.011815169,0.9160233],"study_design_scores_gemma":[0.00017682608,0.00013256894,0.0016527596,0.0000849714,0.00009537023,0.0007588167,0.00029089846,0.9065351,0.024431644,0.04444402,0.021339033,0.000058032565],"about_ca_topic_score_codex":0.0045566848,"about_ca_topic_score_gemma":0.0047222087,"teacher_disagreement_score":0.010927017,"about_ca_system_score_codex":0.0012126208,"about_ca_system_score_gemma":0.0019584582,"threshold_uncertainty_score":0.036554515},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010816536,0.00055231655,0.9653099,0.0012436352,0.00010528281,0.0010304269,0.0014251843,0.009265273,0.01025139],"genre_scores_gemma":[0.104523264,0.00044419995,0.8899333,0.0002550286,0.000046453548,0.0003343281,0.0019108393,0.00016324801,0.0023893614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997445,0.00083944504,0.00031379572,0.00040949986,0.00082906213,0.00016328815],"domain_scores_gemma":[0.9956969,0.0026780842,0.00029465274,0.0006214748,0.000540928,0.00016802229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034833797,0.0013160902,0.0011046655,0.0041948813,0.0014143558,0.0034820028,0.004357288,0.0020990316,0.01289106],"category_scores_gemma":[0.012995617,0.0008939059,0.0023648199,0.0020217705,0.00093883445,0.0027410786,0.002420041,0.0017220253,0.0024856806],"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.0005399553,0.0013376749,0.009472992,0.0014525345,0.0005441575,0.003577186,0.0015804989,0.2669702,0.008155836,0.08255429,0.04068123,0.5831335],"study_design_scores_gemma":[0.0001366597,0.0000726513,0.0007472012,0.00018551151,0.00013715259,0.0005884702,0.00033919653,0.9392324,0.0033507103,0.028605813,0.026545784,0.000058445978],"about_ca_topic_score_codex":0.022989903,"about_ca_topic_score_gemma":0.034474302,"teacher_disagreement_score":0.022989903,"about_ca_system_score_codex":0.0017243811,"about_ca_system_score_gemma":0.0021736627,"threshold_uncertainty_score":0.045712173},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1330133,0.00057925476,0.84273005,0.00031412605,0.00020370554,0.00020477136,0.00020122729,0.007443473,0.015310172],"genre_scores_gemma":[0.92089325,0.00021039223,0.074976996,0.000109421766,0.000080073005,0.000082377825,0.00009518849,0.00005563447,0.0034968145],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995864,0.00010869731,0.000021423743,0.00009995976,0.00014972831,0.000033758155],"domain_scores_gemma":[0.9995796,0.0001734098,0.00003909645,0.00005226332,0.00013386863,0.000021876036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044391805,0.00043976223,0.00041263542,0.0007428865,0.00038720178,0.000454687,0.00088679546,0.0004942891,0.002856178],"category_scores_gemma":[0.00090508256,0.00016938797,0.00020212904,0.00039886902,0.00021262141,0.0005150815,0.00049953215,0.00028301237,0.00056049944],"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.0009299518,0.00031715105,0.013320608,0.0005055137,0.00007925592,0.0009681609,0.00073113386,0.025307266,0.36077905,0.0042973766,0.007615433,0.58514905],"study_design_scores_gemma":[0.00016487992,0.0012829286,0.016608944,0.00008631138,0.0003259645,0.0017981925,0.00042348076,0.59354573,0.3477343,0.0054754033,0.03245285,0.00010101212],"about_ca_topic_score_codex":0.0006040777,"about_ca_topic_score_gemma":0.0004933611,"teacher_disagreement_score":0.002856178,"about_ca_system_score_codex":0.0002336978,"about_ca_system_score_gemma":0.00029294298,"threshold_uncertainty_score":0.009554803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029914383,0.00072439614,0.95277363,0.0007240725,0.000110800574,0.00017394146,0.0000996853,0.00037576052,0.015103186],"genre_scores_gemma":[0.7024884,0.0007673714,0.28228572,0.00023845737,0.00016626525,0.00040457924,0.0001906344,0.00018628337,0.013272273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681526,0.0015124432,0.00021084992,0.00049492385,0.00055261893,0.0004138735],"domain_scores_gemma":[0.9869708,0.010522938,0.00044940447,0.0012197536,0.00043706805,0.00039995112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051241643,0.0013173028,0.003357815,0.0012669162,0.0011268486,0.0033813189,0.003918265,0.004407225,0.006159305],"category_scores_gemma":[0.018883843,0.0010559276,0.001590969,0.0019297457,0.0038945875,0.010483451,0.0055707805,0.002803536,0.0007222693],"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.00025458276,0.00018262303,0.00051532494,0.00026539646,0.000107746,0.00014330397,0.00041617226,0.42238393,0.0006437929,0.52466667,0.0014309238,0.048989482],"study_design_scores_gemma":[0.000037965,0.00003610939,0.000058519396,0.000012364754,0.000017359445,0.000024000923,0.0000403376,0.69904697,0.00022781869,0.29978466,0.0006996288,0.000014214193],"about_ca_topic_score_codex":0.00452014,"about_ca_topic_score_gemma":0.0038050131,"teacher_disagreement_score":0.006159305,"about_ca_system_score_codex":0.0014888012,"about_ca_system_score_gemma":0.0032773067,"threshold_uncertainty_score":0.02709949},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033529112,0.00027524025,0.9891326,0.00018797342,0.00004097793,0.00008752269,0.000051608407,0.00019410111,0.006677026],"genre_scores_gemma":[0.11614689,0.00063816993,0.87651324,0.00009127367,0.0000702456,0.00044142874,0.0002402153,0.00017778706,0.005680753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991904,0.00024407418,0.00004999294,0.00014477932,0.00027271244,0.00009794222],"domain_scores_gemma":[0.99722433,0.002129149,0.000116975105,0.00020604697,0.00025432996,0.000069221955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017246479,0.0014062157,0.0010979897,0.0012836539,0.0009449805,0.0012267148,0.0021625957,0.0017439978,0.012174356],"category_scores_gemma":[0.00826875,0.0010422638,0.0013958631,0.0014297639,0.0011800027,0.002018518,0.0024576997,0.0030567788,0.001194226],"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.000071137336,0.00008189052,0.00022678744,0.0004149194,0.000050143,0.00008597215,0.0002712065,0.7070394,0.0010043784,0.15539841,0.0034589234,0.13189682],"study_design_scores_gemma":[0.00005042539,0.000045389366,0.00006130595,0.000060342085,0.000020717327,0.000048943137,0.0000691923,0.8682916,0.0007991291,0.12480727,0.005736222,0.00000938261],"about_ca_topic_score_codex":0.0036441337,"about_ca_topic_score_gemma":0.006527022,"teacher_disagreement_score":0.012174356,"about_ca_system_score_codex":0.0011900046,"about_ca_system_score_gemma":0.0019044599,"threshold_uncertainty_score":0.040727317},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006022924,0.0042526317,0.98215693,0.0018966009,0.000110492794,0.00029824124,0.00037778137,0.0017664505,0.0031178992],"genre_scores_gemma":[0.26029098,0.002749718,0.73088104,0.0017035872,0.00037258165,0.00046585503,0.0009387762,0.00021193965,0.0023854652],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.990999,0.003149035,0.00079027965,0.001226977,0.003443064,0.00039163412],"domain_scores_gemma":[0.98457956,0.011446515,0.00042873106,0.0008417125,0.002472993,0.00023040391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007691675,0.0017654813,0.003169359,0.0048946873,0.0009450034,0.0034362974,0.0051890584,0.0021204513,0.004294041],"category_scores_gemma":[0.01921076,0.00070954155,0.001947554,0.0038305796,0.0016722319,0.0031424998,0.0017633145,0.0018251844,0.001224098],"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.0007215083,0.0006063475,0.0065599135,0.0014166203,0.0006293581,0.0010243065,0.00058254256,0.09210942,0.0120947445,0.04076152,0.016539423,0.82695436],"study_design_scores_gemma":[0.0003193426,0.000575658,0.00435176,0.00022566372,0.000893905,0.0017389427,0.00033439926,0.87023133,0.013534978,0.09204789,0.015602676,0.00014344676],"about_ca_topic_score_codex":0.010073059,"about_ca_topic_score_gemma":0.0086335605,"teacher_disagreement_score":0.010073059,"about_ca_system_score_codex":0.0017543739,"about_ca_system_score_gemma":0.0028311885,"threshold_uncertainty_score":0.040677965},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01696798,0.00010557504,0.976854,0.00061666773,0.000050942403,0.00053371146,0.00006403695,0.0014196592,0.0033874123],"genre_scores_gemma":[0.265291,0.00010505005,0.7315557,0.000261664,0.000056034703,0.0004229135,0.00023133714,0.00018222479,0.0018940484],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99308676,0.0019380442,0.0006042701,0.0011186841,0.0028846925,0.0003675507],"domain_scores_gemma":[0.97290605,0.015081471,0.0019643372,0.006409445,0.0029566283,0.00068204984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00929909,0.0007167147,0.0008278894,0.002203737,0.0013530576,0.0024634488,0.002327068,0.0018834063,0.004701361],"category_scores_gemma":[0.045911327,0.00089016097,0.0006552225,0.0018373802,0.0015608066,0.004354922,0.0023906322,0.0028489842,0.001479561],"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.00089110516,0.0009291052,0.0057283817,0.00026007474,0.0000976505,0.0005096408,0.0010131715,0.18296027,0.029638354,0.14673959,0.009759366,0.6214733],"study_design_scores_gemma":[0.00011952146,0.00034565653,0.001792115,0.00010787108,0.000073131916,0.0008352609,0.00022335746,0.86591107,0.035091333,0.06856344,0.026862858,0.00007442618],"about_ca_topic_score_codex":0.0012468054,"about_ca_topic_score_gemma":0.0011752923,"teacher_disagreement_score":0.00929909,"about_ca_system_score_codex":0.0014116081,"about_ca_system_score_gemma":0.0021585329,"threshold_uncertainty_score":0.04917884},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5030714,0.0033251587,0.4363013,0.0015043311,0.00016773859,0.0006767296,0.0006835528,0.0072375014,0.047032315],"genre_scores_gemma":[0.8605182,0.00055300276,0.13562861,0.00019740837,0.000033540495,0.0002236015,0.00041474833,0.00027520352,0.0021556923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969897,0.0012247268,0.00014803988,0.00031476843,0.0009854921,0.00033711994],"domain_scores_gemma":[0.9846713,0.011225175,0.0005986528,0.0024209097,0.0007459228,0.00033803534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033628724,0.0011540635,0.0010876004,0.0014864383,0.00053812534,0.0010299481,0.0026749263,0.0014739906,0.0029651823],"category_scores_gemma":[0.018498627,0.00059592683,0.0007664556,0.0015474904,0.0015335572,0.0042504114,0.002342789,0.0015212985,0.00042680552],"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.0016085646,0.00046854845,0.0018247253,0.0004356511,0.00013366231,0.00009234523,0.0003720906,0.7436613,0.003927126,0.015242367,0.0021279638,0.23010571],"study_design_scores_gemma":[0.0003612052,0.0011842232,0.002261213,0.000097641874,0.00015082984,0.00015593028,0.00023584253,0.96339643,0.007841714,0.016402518,0.007857966,0.00005455698],"about_ca_topic_score_codex":0.007814169,"about_ca_topic_score_gemma":0.011635176,"teacher_disagreement_score":0.007814169,"about_ca_system_score_codex":0.0020271596,"about_ca_system_score_gemma":0.0023995931,"threshold_uncertainty_score":0.017784834},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034193858,0.0002931934,0.9913071,0.000275461,0.000034911758,0.000074731346,0.00009851771,0.0015825169,0.0029142173],"genre_scores_gemma":[0.24239536,0.000504438,0.75065243,0.00038467534,0.00013555352,0.00051249756,0.0009001297,0.00049839495,0.0040164315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99292034,0.0023168495,0.0005418051,0.0009858675,0.0027888792,0.00044628707],"domain_scores_gemma":[0.97296923,0.022149626,0.0011531556,0.001634371,0.0018693212,0.00022429106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042441655,0.0014619916,0.0010119231,0.0033206916,0.0007598313,0.0032664712,0.0021478627,0.001764401,0.007238353],"category_scores_gemma":[0.03194222,0.00065711106,0.0018286747,0.0018604888,0.0034037787,0.0032786357,0.0015390173,0.002215498,0.0014254324],"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.00056035473,0.00017919707,0.0023136677,0.0009889386,0.00018521267,0.0009357714,0.00048627667,0.1844616,0.009636815,0.48574626,0.008328271,0.30617765],"study_design_scores_gemma":[0.00006598678,0.00013243205,0.00042244635,0.00017488252,0.000069864436,0.0004381649,0.000079726524,0.53859115,0.018887386,0.43113595,0.009957939,0.000044083205],"about_ca_topic_score_codex":0.0018222859,"about_ca_topic_score_gemma":0.0015510286,"teacher_disagreement_score":0.007238353,"about_ca_system_score_codex":0.002141773,"about_ca_system_score_gemma":0.0020505092,"threshold_uncertainty_score":0.024214745},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014650954,0.00016402054,0.95806944,0.00019364423,0.00007346318,0.00064894685,0.00032955263,0.010943894,0.014926041],"genre_scores_gemma":[0.15278505,0.00032701695,0.8320857,0.0002155049,0.00004916872,0.00072819594,0.0016993651,0.0011139411,0.010995965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954202,0.0013339674,0.00050064607,0.0009987063,0.001488283,0.0002582716],"domain_scores_gemma":[0.98625225,0.0048740413,0.00052390195,0.005336634,0.0027273619,0.0002858309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057263114,0.00079590466,0.0006674954,0.0024417844,0.00064281875,0.0027715876,0.002958056,0.00072366936,0.009383216],"category_scores_gemma":[0.019321874,0.00066557573,0.00085303263,0.0010508281,0.0008703492,0.0027737143,0.0029645464,0.0014850653,0.0022170858],"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.00022961858,0.00041105616,0.002489062,0.00046633056,0.00014586205,0.0004059537,0.0013580865,0.078091994,0.020128999,0.050220225,0.0118500795,0.83420277],"study_design_scores_gemma":[0.00014192576,0.00021915403,0.0032285862,0.0005239913,0.00023016425,0.000787081,0.00077393866,0.6485071,0.058887012,0.082818605,0.20370437,0.00017814216],"about_ca_topic_score_codex":0.0038707312,"about_ca_topic_score_gemma":0.004359525,"teacher_disagreement_score":0.009383216,"about_ca_system_score_codex":0.0013657635,"about_ca_system_score_gemma":0.0016493441,"threshold_uncertainty_score":0.03138995},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016885733,0.0006912109,0.9697435,0.0005694771,0.00009401388,0.0005615557,0.00022257445,0.0052627656,0.005969142],"genre_scores_gemma":[0.10285099,0.00024570734,0.89200723,0.00020320999,0.00005996911,0.00053396175,0.0005829459,0.0005069602,0.0030089896],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965823,0.00094720133,0.0001543148,0.0005298707,0.0014656612,0.00032063967],"domain_scores_gemma":[0.9941421,0.0037300931,0.00052146276,0.000743248,0.000701087,0.0001619411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026625253,0.0017633833,0.001462876,0.0027863518,0.0010134672,0.0010257722,0.0029096124,0.0017544607,0.0050588963],"category_scores_gemma":[0.008801645,0.00073873193,0.0015056052,0.001881755,0.0021228006,0.0021832294,0.0023123468,0.00308878,0.0009732442],"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.0007667701,0.0007540172,0.0021524902,0.00040459057,0.00011924898,0.00011252055,0.00036741555,0.25543275,0.00573889,0.02716993,0.011022483,0.69595885],"study_design_scores_gemma":[0.00035721215,0.00051158544,0.0014663056,0.00005620741,0.00011018855,0.00019573407,0.00013144835,0.95117205,0.0109062325,0.021224486,0.013810911,0.000057673224],"about_ca_topic_score_codex":0.013156897,"about_ca_topic_score_gemma":0.019745529,"teacher_disagreement_score":0.013156897,"about_ca_system_score_codex":0.0018263167,"about_ca_system_score_gemma":0.0038607419,"threshold_uncertainty_score":0.026160598},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57545,0.0015776134,0.08215483,0.0051214756,0.00038452004,0.0006413268,0.00039872283,0.001252118,0.33301947],"genre_scores_gemma":[0.9273981,0.0010472903,0.031991743,0.0007915059,0.000050993927,0.00026565138,0.00030564945,0.00047127323,0.037677847],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99818784,0.0009539532,0.000029868335,0.00017343213,0.0002852647,0.00036966297],"domain_scores_gemma":[0.9981304,0.0010407427,0.00010227663,0.0001620136,0.00023968435,0.00032493312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041119987,0.00039008106,0.00026370506,0.0008892154,0.002645919,0.0037010182,0.0010083675,0.0009771739,0.014432848],"category_scores_gemma":[0.005863234,0.0002578783,0.0005645908,0.0008739716,0.0010228655,0.0031837153,0.0026980566,0.0011122428,0.0019599611],"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.0011885794,0.0016609936,0.024117617,0.000631231,0.00006224801,0.0017604822,0.18975472,0.0017921854,0.02274939,0.059817985,0.05047522,0.64598936],"study_design_scores_gemma":[0.00016256775,0.0014525326,0.044770114,0.0005495135,0.00010987377,0.0014936926,0.21319763,0.0065976093,0.01169235,0.022489758,0.69727826,0.00020615857],"about_ca_topic_score_codex":0.0057550822,"about_ca_topic_score_gemma":0.013994418,"teacher_disagreement_score":0.014432848,"about_ca_system_score_codex":0.001149837,"about_ca_system_score_gemma":0.0010362777,"threshold_uncertainty_score":0.048282683},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024324033,0.006516189,0.73567986,0.0049036946,0.0005706443,0.0001360665,0.0003202087,0.0006607965,0.22688852],"genre_scores_gemma":[0.5824669,0.0031719678,0.3451312,0.0013395982,0.00033475683,0.00029719362,0.0006117443,0.0003612901,0.066285335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999044,0.00042195705,0.000028403263,0.00014866045,0.00024480483,0.000112186346],"domain_scores_gemma":[0.99774253,0.0014463358,0.0000804857,0.00047023763,0.00018042467,0.00007991436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001309398,0.00053641596,0.0009463969,0.0012309895,0.001008922,0.0015701521,0.0017998241,0.0012886126,0.0233623],"category_scores_gemma":[0.011050175,0.0005390913,0.0007453479,0.0025265035,0.0020691415,0.003058237,0.001697113,0.0021781174,0.0016255884],"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.000050940253,0.00004140264,0.00022962158,0.00012577366,0.00002902657,0.000039021877,0.00015258025,0.0370057,0.00017422503,0.86931825,0.011380935,0.08145248],"study_design_scores_gemma":[0.000043226763,0.000029172304,0.00033836352,0.000074711876,0.000028664977,0.00006514522,0.00009681749,0.14660081,0.00032909485,0.83583623,0.016544629,0.000013052187],"about_ca_topic_score_codex":0.005287269,"about_ca_topic_score_gemma":0.0079688635,"teacher_disagreement_score":0.0233623,"about_ca_system_score_codex":0.0017510451,"about_ca_system_score_gemma":0.001804334,"threshold_uncertainty_score":0.07815468},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011550621,0.00010923315,0.98553133,0.00011066853,0.0000065061495,0.0000412632,0.000041680138,0.00017833448,0.0024303233],"genre_scores_gemma":[0.4676425,0.00039785414,0.5279866,0.00012538322,0.000046469147,0.00029868342,0.00030400913,0.00024533196,0.0029532225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843854,0.0004995645,0.000108388755,0.00033994767,0.0004796816,0.00013386166],"domain_scores_gemma":[0.99325013,0.004247626,0.0005709287,0.0010854655,0.0006784392,0.0001674038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027064634,0.00069830456,0.00063624425,0.001445172,0.0009179705,0.0017232955,0.0014536233,0.0007075702,0.0028891482],"category_scores_gemma":[0.010068829,0.00087681843,0.0013492838,0.0010653082,0.00335951,0.0045454083,0.0021759528,0.0016846892,0.00039428475],"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.000095132,0.000039550112,0.001498667,0.00019090754,0.000050344057,0.00036482612,0.00054508593,0.38012624,0.009480588,0.55509925,0.0008493648,0.05166001],"study_design_scores_gemma":[0.0000059934196,0.000031712352,0.00038339852,0.000022155984,0.000014086209,0.000069520545,0.00006454591,0.76844877,0.0028112864,0.22567263,0.0024590907,0.000016825321],"about_ca_topic_score_codex":0.0041436376,"about_ca_topic_score_gemma":0.0028043801,"teacher_disagreement_score":0.0041436376,"about_ca_system_score_codex":0.0016723091,"about_ca_system_score_gemma":0.0009709792,"threshold_uncertainty_score":0.01431334},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05189172,0.022279065,0.74901336,0.049961645,0.001096883,0.00021008476,0.0002841837,0.0006116498,0.12465142],"genre_scores_gemma":[0.82027656,0.0042690453,0.16863331,0.001932793,0.00040109231,0.00040343718,0.00018603563,0.00023894169,0.003658818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9699378,0.019590164,0.0017215608,0.0027552105,0.00495883,0.0010364893],"domain_scores_gemma":[0.8567068,0.11011339,0.003849348,0.021414798,0.00648459,0.0014310739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023780974,0.0009934144,0.002092264,0.00613253,0.002860859,0.009223944,0.005190752,0.007046659,0.00831839],"category_scores_gemma":[0.13076214,0.0017080497,0.0009162723,0.0061898706,0.03273864,0.019370884,0.00511777,0.007331328,0.00085037324],"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.000020073152,0.000027482834,0.00045071266,0.00012599136,0.000024054172,0.000036045803,0.0006698786,0.00454045,0.000023990897,0.97890764,0.0013007552,0.013872829],"study_design_scores_gemma":[0.000010921735,0.0000062366466,0.000057243975,0.00006451532,0.000007680429,0.000017812441,0.00016277366,0.003923152,0.00006162356,0.9921625,0.0035205262,0.0000049281857],"about_ca_topic_score_codex":0.005009243,"about_ca_topic_score_gemma":0.0029934777,"teacher_disagreement_score":0.023780974,"about_ca_system_score_codex":0.0061256867,"about_ca_system_score_gemma":0.007378237,"threshold_uncertainty_score":0.12576729},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019163262,0.0015270588,0.85665804,0.00078899757,0.00074775954,0.00042605968,0.0006396274,0.047938142,0.07211109],"genre_scores_gemma":[0.5305662,0.0013448169,0.36677942,0.0012324507,0.0008131538,0.0009199577,0.0031200699,0.0011561717,0.094067685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993606,0.000110130066,0.00004578928,0.00014171275,0.00026682593,0.00007493513],"domain_scores_gemma":[0.9993293,0.00016137362,0.000049549795,0.00020485355,0.00017713626,0.00007778301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061460456,0.0006553634,0.00063995883,0.0009580527,0.0005782656,0.0015683529,0.0015477585,0.0010200042,0.021367572],"category_scores_gemma":[0.0011826961,0.00017659774,0.00037201034,0.00051591144,0.00036623012,0.0017930238,0.0010783544,0.00097477867,0.009320424],"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.00080839917,0.00063946337,0.001666012,0.0004680313,0.00007943672,0.0008344575,0.0005143336,0.012526553,0.047760922,0.0475611,0.069420844,0.81772053],"study_design_scores_gemma":[0.00037362968,0.00073549396,0.0030000482,0.00018891865,0.00023859633,0.0014331148,0.00021143313,0.3011998,0.0584856,0.030192723,0.6037709,0.00016979387],"about_ca_topic_score_codex":0.0009261885,"about_ca_topic_score_gemma":0.0006310203,"teacher_disagreement_score":0.021367572,"about_ca_system_score_codex":0.0004384527,"about_ca_system_score_gemma":0.00060094433,"threshold_uncertainty_score":0.071481705},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009653802,0.00012151312,0.98333794,0.00017321364,0.000024304709,0.00013107526,0.000043077776,0.0010129894,0.0055021103],"genre_scores_gemma":[0.53561777,0.0003236242,0.45727423,0.00022976699,0.00006203835,0.00049707515,0.00022290251,0.00020996293,0.0055626766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715304,0.0012484224,0.00012271812,0.0004285295,0.0008819625,0.0001652837],"domain_scores_gemma":[0.9938922,0.0040227454,0.00022912366,0.0009295869,0.0007952778,0.00013115522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003947917,0.0009686563,0.00094573706,0.0016890486,0.00075682363,0.0014588375,0.0024429613,0.0014260433,0.0077608335],"category_scores_gemma":[0.013933805,0.0005470857,0.00095896685,0.001335118,0.0012813502,0.00479893,0.003022722,0.0017328383,0.0015183844],"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.00038474283,0.0004278715,0.0014288033,0.00032086586,0.0002592958,0.00012961235,0.00063026877,0.26140812,0.008742632,0.041854218,0.0034992015,0.6809144],"study_design_scores_gemma":[0.00005986296,0.000082746104,0.00042317444,0.00004741877,0.000060972023,0.000065842345,0.00007274439,0.9382357,0.009302269,0.047851928,0.0037724702,0.000024817036],"about_ca_topic_score_codex":0.0043112906,"about_ca_topic_score_gemma":0.0026434613,"teacher_disagreement_score":0.0077608335,"about_ca_system_score_codex":0.0011279505,"about_ca_system_score_gemma":0.0012642684,"threshold_uncertainty_score":0.025962532},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021381482,0.00023437958,0.9671637,0.0007299847,0.000042442458,0.00013582104,0.00023872165,0.00025827825,0.009815068],"genre_scores_gemma":[0.762665,0.00079488446,0.21995525,0.000120353725,0.00007510592,0.0007265676,0.00053829903,0.000072927316,0.015051628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870455,0.00037632702,0.0000982456,0.00025338755,0.0004474521,0.00012003509],"domain_scores_gemma":[0.9986841,0.0007509849,0.00020470939,0.00005050033,0.00026153753,0.000048153208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018214303,0.0010602135,0.0010620797,0.0021884951,0.0006916605,0.0023730486,0.003731424,0.002661315,0.0057377005],"category_scores_gemma":[0.0040744157,0.00072789326,0.0014766002,0.002249054,0.0007944926,0.0025859245,0.0010411548,0.0013829542,0.00070281513],"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.000014491427,0.00002762691,0.0002656681,0.000022395028,0.0000147201945,0.000113929775,0.000037286994,0.9753728,0.00015749756,0.01787473,0.00030885177,0.005789955],"study_design_scores_gemma":[0.000004375151,0.0000058429587,0.00006159973,0.000003609777,0.0000067880223,0.000026198813,0.000008360726,0.9960175,0.000051438074,0.003514888,0.00029462483,0.0000047182803],"about_ca_topic_score_codex":0.02548652,"about_ca_topic_score_gemma":0.014686312,"teacher_disagreement_score":0.02548652,"about_ca_system_score_codex":0.002886818,"about_ca_system_score_gemma":0.0017045733,"threshold_uncertainty_score":0.050676346},"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002040433,0.0097047845,0.0003714879,0.53748137,0.4340567,0.000040417744,0.00034994623,0.00016542836,0.017625812],"genre_scores_gemma":[0.006040086,0.011904135,0.0005602602,0.25487438,0.19696353,0.000084595995,0.00052662,0.00029025527,0.5287561],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986986,0.00018773518,0.000107996995,0.0003176679,0.0005306676,0.00015734433],"domain_scores_gemma":[0.9961825,0.00070440513,0.00023934894,0.00011916443,0.0019020688,0.0008525412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021040377,0.000988032,0.0009156469,0.00069510826,0.0026315516,0.0039396877,0.0015178077,0.004757737,0.04726808],"category_scores_gemma":[0.012162079,0.00031722378,0.0006039209,0.00040707493,0.0011561953,0.002718435,0.0021421146,0.00917006,0.038026325],"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.000011099594,0.0000026146413,0.000020348025,0.000010843828,0.0000014276533,0.000035931287,0.000018977356,0.0000051358743,0.000018032768,0.00035525902,0.99676454,0.0027557383],"study_design_scores_gemma":[0.000005780717,0.000006992374,0.000077089026,0.000052338433,0.0000032305763,0.00008081927,0.000058271533,0.000015085792,0.00006881509,0.00031959277,0.9993069,0.0000051159495],"about_ca_topic_score_codex":0.004595534,"about_ca_topic_score_gemma":0.011098349,"teacher_disagreement_score":0.04726808,"about_ca_system_score_codex":0.0027735743,"about_ca_system_score_gemma":0.0028112344,"threshold_uncertainty_score":0.15812755},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070423116,0.00009043809,0.98433256,0.00006923213,0.000016268341,0.000070942086,0.000100368336,0.006918478,0.0013595152],"genre_scores_gemma":[0.1639762,0.00021757054,0.83217454,0.00009201532,0.000014907021,0.00019777461,0.00071515265,0.0013164664,0.0012953262],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990546,0.00026663768,0.00007493411,0.00017952718,0.0003271958,0.00009715941],"domain_scores_gemma":[0.9983191,0.0008870219,0.00010732432,0.00045462555,0.00017365969,0.000058290763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011943813,0.0011114172,0.00072869594,0.00095153425,0.000623069,0.0011508453,0.0013342528,0.00059416756,0.0033449125],"category_scores_gemma":[0.0030047514,0.00063287927,0.00138918,0.000863812,0.0013348598,0.0018349234,0.002163286,0.0012630076,0.0008183199],"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.0004085951,0.00016574693,0.004885922,0.0008481569,0.0001829865,0.0007288415,0.0012690775,0.26272848,0.043044392,0.11026959,0.015953513,0.5595147],"study_design_scores_gemma":[0.000056405253,0.00009465527,0.0005860971,0.00005671357,0.00009294299,0.00017423935,0.00013159918,0.86521107,0.03487038,0.06961744,0.02905919,0.00004935044],"about_ca_topic_score_codex":0.0042574564,"about_ca_topic_score_gemma":0.0076097753,"teacher_disagreement_score":0.0042574564,"about_ca_system_score_codex":0.000692611,"about_ca_system_score_gemma":0.0017556137,"threshold_uncertainty_score":0.011189878},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024469018,0.00048583705,0.9689029,0.00023287298,0.000031071704,0.00036023624,0.00014394868,0.00071762764,0.0046565933],"genre_scores_gemma":[0.2400192,0.00046874685,0.75569856,0.000107756256,0.00009650093,0.00031621376,0.000341584,0.00012669731,0.0028246604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980804,0.00080550165,0.00021991305,0.0002232765,0.0005960918,0.000074888536],"domain_scores_gemma":[0.99093807,0.0072176605,0.00033208838,0.000610668,0.0006914771,0.00020995688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052380613,0.00053510995,0.0012670157,0.004158212,0.00076890155,0.0020496314,0.0017074781,0.0010918727,0.0045655565],"category_scores_gemma":[0.019508637,0.00044142565,0.0010098803,0.0046960446,0.0009933463,0.0032556697,0.00220424,0.00088903535,0.00077276793],"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.000497033,0.0002757797,0.0030818938,0.00036244027,0.00012688484,0.0003861318,0.0004404716,0.09091631,0.0046616765,0.050894435,0.0037675644,0.8445893],"study_design_scores_gemma":[0.00010023581,0.0001703107,0.0016295369,0.000074625525,0.00014431383,0.00050953723,0.00013710832,0.9016361,0.0044338405,0.08494988,0.0061731325,0.000041326224],"about_ca_topic_score_codex":0.002759119,"about_ca_topic_score_gemma":0.0026764008,"teacher_disagreement_score":0.0052380613,"about_ca_system_score_codex":0.0011908398,"about_ca_system_score_gemma":0.0010104905,"threshold_uncertainty_score":0.027701795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03404011,0.00023564133,0.9576942,0.0022317907,0.000091869115,0.0001872772,0.00020472055,0.0014765302,0.0038379543],"genre_scores_gemma":[0.2512559,0.0003321287,0.7455759,0.00050674734,0.0001229209,0.00014743899,0.0006672567,0.00021194313,0.0011797763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99508804,0.0020996484,0.0004060686,0.0010263219,0.0011819666,0.00019802485],"domain_scores_gemma":[0.9733137,0.02044781,0.001053071,0.0029946761,0.0017892868,0.00040151732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007455077,0.0011309282,0.0009253809,0.0028392666,0.0016056753,0.0051791603,0.0035686654,0.0023207136,0.005938862],"category_scores_gemma":[0.062369205,0.0012388893,0.0020275475,0.001469655,0.0029119817,0.006447406,0.0043858895,0.0041627996,0.0011344089],"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.0006574871,0.00024535644,0.009193898,0.001319163,0.00076913304,0.0021294,0.0052515403,0.09398367,0.009012189,0.44934326,0.0089103095,0.4191847],"study_design_scores_gemma":[0.00011000008,0.000081271035,0.00096870394,0.00023796143,0.0002613809,0.00030295365,0.0011191054,0.20968159,0.008753365,0.7650766,0.013339976,0.00006703592],"about_ca_topic_score_codex":0.0022144113,"about_ca_topic_score_gemma":0.00404901,"teacher_disagreement_score":0.007455077,"about_ca_system_score_codex":0.0014065492,"about_ca_system_score_gemma":0.0025930356,"threshold_uncertainty_score":0.039426684},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057843877,0.0016604704,0.9704213,0.002068859,0.00010915859,0.00018124201,0.00007425761,0.00033357245,0.019366683],"genre_scores_gemma":[0.1121979,0.0011116946,0.8817135,0.00025750746,0.000091945134,0.00031892667,0.0002135213,0.0000369397,0.0040581427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968804,0.0017563616,0.00028443005,0.00022889694,0.00072148885,0.00012844951],"domain_scores_gemma":[0.9958947,0.0030560342,0.00025591385,0.00039653992,0.000247518,0.00014928034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004052638,0.00095504784,0.00065611105,0.0024397818,0.0010663312,0.0037948505,0.002334366,0.0017345737,0.0047039967],"category_scores_gemma":[0.009365557,0.0005931872,0.0012670731,0.0017363846,0.003444521,0.0038724726,0.0020016036,0.0018340347,0.000686194],"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.000036521375,0.00011186906,0.00046244127,0.00018458329,0.000053326225,0.0004272627,0.00047440256,0.07370846,0.0006846136,0.8502278,0.00454318,0.06908546],"study_design_scores_gemma":[0.00005896792,0.00003626933,0.00019578073,0.00011687157,0.000038310493,0.00023391696,0.00020948653,0.33654183,0.0011895619,0.6283488,0.03300104,0.000029057968],"about_ca_topic_score_codex":0.005149129,"about_ca_topic_score_gemma":0.005646632,"teacher_disagreement_score":0.005149129,"about_ca_system_score_codex":0.001985014,"about_ca_system_score_gemma":0.001661042,"threshold_uncertainty_score":0.021432638},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011264446,0.009239867,0.36163953,0.047672756,0.00918022,0.00038243292,0.0008368379,0.0062569156,0.553527],"genre_scores_gemma":[0.06558762,0.0051956824,0.23602355,0.00900096,0.0023097296,0.00025921097,0.00065360626,0.000933938,0.68003565],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949956,0.00010232135,0.000032797507,0.0001196632,0.00021462933,0.00003108405],"domain_scores_gemma":[0.9986332,0.0003529542,0.000056999183,0.00014987282,0.0004120275,0.00039492975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079869037,0.0006073479,0.00044955235,0.0009950821,0.0011192242,0.0019511656,0.0007748872,0.001021711,0.070696905],"category_scores_gemma":[0.0034284764,0.0002628784,0.00042731338,0.0004761558,0.0007219497,0.0025294747,0.0013952724,0.0023497539,0.01990455],"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.00013187662,0.00036357858,0.001690101,0.0003817263,0.000019843685,0.0004259141,0.00070546573,0.001667289,0.009311991,0.14058197,0.45171326,0.39300698],"study_design_scores_gemma":[0.000019661606,0.00009348486,0.000632447,0.00009952113,0.000012300751,0.00059262203,0.0001239806,0.005621357,0.0020209837,0.030201156,0.96056944,0.000013048033],"about_ca_topic_score_codex":0.0004511044,"about_ca_topic_score_gemma":0.0014643185,"teacher_disagreement_score":0.070696905,"about_ca_system_score_codex":0.00094965944,"about_ca_system_score_gemma":0.0015213796,"threshold_uncertainty_score":0.23650473},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041737454,0.00012566989,0.9824477,0.00013619577,0.0000776094,0.000101589154,0.000033936132,0.0036720694,0.009231512],"genre_scores_gemma":[0.45694244,0.00027321398,0.5182316,0.0003380686,0.000116097224,0.0005592488,0.00027434292,0.00026043248,0.023004584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955994,0.000039347146,0.000025317891,0.000078386045,0.00025228725,0.000044826793],"domain_scores_gemma":[0.9996525,0.00007836931,0.000036485697,0.000056845813,0.00012974838,0.000046079855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033368383,0.00045835157,0.0003981491,0.0004171332,0.0006171424,0.0011076065,0.0014586041,0.00084731984,0.0058819833],"category_scores_gemma":[0.00091682805,0.00021541906,0.00032552553,0.0002082096,0.000653705,0.0010812156,0.0007410781,0.0009806635,0.0013715253],"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.0005017529,0.00027919616,0.0010593433,0.00037741425,0.00006505272,0.00052533625,0.00072830904,0.092923276,0.16049221,0.17551014,0.020658303,0.54687977],"study_design_scores_gemma":[0.000101848396,0.0003396054,0.00094807614,0.000037033853,0.00005993585,0.00041749037,0.00005770464,0.8524163,0.043203335,0.028659962,0.07369886,0.000059831],"about_ca_topic_score_codex":0.0013805828,"about_ca_topic_score_gemma":0.002127196,"teacher_disagreement_score":0.0058819833,"about_ca_system_score_codex":0.0005168321,"about_ca_system_score_gemma":0.0008076448,"threshold_uncertainty_score":0.019677222},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045064837,0.0003215946,0.9836822,0.0002709555,0.00004977343,0.000105328756,0.00012431253,0.004587872,0.0063514137],"genre_scores_gemma":[0.15615325,0.0005428361,0.8370118,0.00020298352,0.00011417867,0.00028993335,0.0005202571,0.0008765961,0.0042880527],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983662,0.00050179474,0.00010015434,0.0002711411,0.0005921628,0.00016851613],"domain_scores_gemma":[0.9972535,0.0012370993,0.000114966315,0.0009827239,0.00033431384,0.00007743777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001530283,0.0006988748,0.0008165311,0.0016073174,0.0007124732,0.0027098272,0.002703159,0.00075515517,0.0059313336],"category_scores_gemma":[0.0053598303,0.0010147933,0.0021062903,0.0010298413,0.0012627316,0.00400948,0.002665017,0.002073696,0.0012835725],"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.00035408183,0.00026463025,0.0009917788,0.0006007674,0.00024785072,0.000639688,0.0010092048,0.1326935,0.012432197,0.29800954,0.011794221,0.5409626],"study_design_scores_gemma":[0.00011299454,0.00010061546,0.00046609782,0.0001499033,0.00030139173,0.0005149048,0.0002038779,0.57749027,0.021949125,0.35714445,0.04149115,0.000075258315],"about_ca_topic_score_codex":0.0019780698,"about_ca_topic_score_gemma":0.003251635,"teacher_disagreement_score":0.0059313336,"about_ca_system_score_codex":0.0010688163,"about_ca_system_score_gemma":0.0013522942,"threshold_uncertainty_score":0.019842327},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05525865,0.00018876632,0.94069976,0.00036997095,0.000014878835,0.00016917725,0.00022636693,0.0005941202,0.0024782787],"genre_scores_gemma":[0.7347317,0.00028105275,0.2621022,0.00010893955,0.000028057406,0.00046268746,0.000551353,0.00010927367,0.0016247443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980286,0.00075324613,0.00009853987,0.00039839666,0.00050914084,0.00021212875],"domain_scores_gemma":[0.992386,0.006231478,0.00049960695,0.00028083843,0.00040414822,0.00019803255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031096793,0.00079335325,0.0009315871,0.0013614058,0.00072688505,0.001320487,0.0016747613,0.0010923903,0.002237031],"category_scores_gemma":[0.012122487,0.00108613,0.0013273206,0.0010372689,0.0013699522,0.0030528854,0.0015773636,0.0015909047,0.00025849542],"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.00016988735,0.000059397677,0.0014213577,0.00005883447,0.00006209206,0.00018015284,0.00022788964,0.94138896,0.0009853666,0.02993507,0.00048142526,0.02502944],"study_design_scores_gemma":[0.000021004564,0.00002041558,0.00017551168,0.000009870777,0.000017353184,0.00002131626,0.000023894492,0.97667515,0.0004725473,0.022142256,0.00040949593,0.000011180853],"about_ca_topic_score_codex":0.016949845,"about_ca_topic_score_gemma":0.024731006,"teacher_disagreement_score":0.016949845,"about_ca_system_score_codex":0.0020393364,"about_ca_system_score_gemma":0.002949156,"threshold_uncertainty_score":0.033702374},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002784722,0.0060973642,0.60449207,0.0056256414,0.00069676427,0.0001793965,0.0008074864,0.00054290146,0.37877366],"genre_scores_gemma":[0.3974665,0.017994145,0.3901218,0.0041831234,0.002130079,0.0011288576,0.0026212218,0.0006690148,0.1836852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984236,0.00043913122,0.00010357059,0.00033925485,0.00053830113,0.00015618646],"domain_scores_gemma":[0.9985397,0.0006885278,0.00009366679,0.0002559227,0.00034701615,0.00007517916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014252138,0.0011342505,0.001161009,0.0018417852,0.0019576168,0.004009181,0.0025552353,0.002569081,0.025134522],"category_scores_gemma":[0.0035807753,0.0004759437,0.0017102959,0.0016908355,0.0048283488,0.0050753155,0.0019495608,0.0033558256,0.0077460273],"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.0000015995745,0.0000035866392,0.000022920334,0.00002521749,0.0000025781465,0.000020672149,0.000040825405,0.0019828405,0.000033357126,0.9935634,0.0017022009,0.0026007462],"study_design_scores_gemma":[0.0000045472684,0.0000040776035,0.000023356548,0.000030206023,0.0000032475061,0.00004550976,0.000022333697,0.0059091426,0.00008936265,0.95309865,0.040763684,0.0000058792853],"about_ca_topic_score_codex":0.0057516587,"about_ca_topic_score_gemma":0.0020800112,"teacher_disagreement_score":0.025134522,"about_ca_system_score_codex":0.0035931345,"about_ca_system_score_gemma":0.0022332422,"threshold_uncertainty_score":0.08408338},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14992979,0.0022298996,0.8279144,0.0012534565,0.0001902784,0.0003440918,0.00040689658,0.004080821,0.013650265],"genre_scores_gemma":[0.5846107,0.0006363362,0.4086879,0.0003258018,0.000095719304,0.00018814405,0.0006719704,0.0003876632,0.004395853],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734515,0.0008284603,0.00023663968,0.00054280926,0.0008441595,0.00020286567],"domain_scores_gemma":[0.9850417,0.010170378,0.0005637798,0.0026890247,0.0012087888,0.00032636354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032443549,0.0012737542,0.002671617,0.0020224517,0.00089295796,0.002834409,0.002774126,0.0016562524,0.009840671],"category_scores_gemma":[0.024055935,0.001211405,0.0011526714,0.003396698,0.00073963706,0.007949651,0.0023466998,0.0021463556,0.0015884133],"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.0011128366,0.00063456036,0.007666105,0.00040744498,0.00028664953,0.00022934524,0.00023211332,0.19443916,0.0057152607,0.020838466,0.010222335,0.75821567],"study_design_scores_gemma":[0.000088959125,0.00018474486,0.0011913298,0.000043663847,0.00015830692,0.00024885495,0.0001340948,0.93878794,0.0039960113,0.05175637,0.003389665,0.000020074789],"about_ca_topic_score_codex":0.0044749565,"about_ca_topic_score_gemma":0.008082915,"teacher_disagreement_score":0.009840671,"about_ca_system_score_codex":0.0011579605,"about_ca_system_score_gemma":0.0023629125,"threshold_uncertainty_score":0.0329203},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002235829,0.00061997084,0.9627611,0.0010278606,0.0001361076,0.00006123417,0.000115723175,0.00029762587,0.03274458],"genre_scores_gemma":[0.44327444,0.0032198208,0.51404434,0.0014210086,0.00035532226,0.00085050584,0.000541871,0.00036317157,0.03592949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998874,0.00033334046,0.00006748818,0.00011972799,0.00048929674,0.00011611497],"domain_scores_gemma":[0.99849904,0.0007424921,0.00017120081,0.00017388737,0.00030882104,0.00010471795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016493913,0.0006309238,0.00057674886,0.0014155592,0.0010628889,0.0027828962,0.0017420249,0.0013475862,0.010471774],"category_scores_gemma":[0.0031105943,0.00045436897,0.0011247848,0.0009133745,0.0075586285,0.004639833,0.0022761878,0.0020467192,0.0016029136],"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.000003611037,0.000005573949,0.000029320381,0.000054492884,0.0000041842573,0.000058556237,0.00020702832,0.0044526216,0.0006406023,0.9904289,0.00069083745,0.003424244],"study_design_scores_gemma":[0.000010039731,0.000017187302,0.00007416192,0.0000680382,0.000008188277,0.00014106356,0.00016897047,0.025318906,0.0010122441,0.94756925,0.025592463,0.000019490928],"about_ca_topic_score_codex":0.0019684911,"about_ca_topic_score_gemma":0.0013337617,"teacher_disagreement_score":0.010471774,"about_ca_system_score_codex":0.002128906,"about_ca_system_score_gemma":0.0019640024,"threshold_uncertainty_score":0.035031557},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012022334,0.00024283779,0.9827643,0.00044008362,0.000016360416,0.000046808633,0.00004879411,0.0004616235,0.0039568716],"genre_scores_gemma":[0.4577604,0.00083698286,0.5367366,0.00036628806,0.00007477733,0.00026151378,0.00020277996,0.00034771452,0.003412948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983633,0.00058740523,0.00012330314,0.00024926884,0.00051870174,0.00015808266],"domain_scores_gemma":[0.99524873,0.0028652935,0.00028049058,0.0011501133,0.00029401048,0.00016138586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031829118,0.0005775922,0.0006498673,0.00065385044,0.0007963725,0.002352456,0.002103349,0.0010973848,0.002359937],"category_scores_gemma":[0.008748312,0.0008653743,0.0011919207,0.001022152,0.0038270005,0.0064686327,0.0022390778,0.0028779758,0.00041958847],"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.00021496826,0.00013496638,0.0018188033,0.00034564378,0.00007317059,0.00025254508,0.001492095,0.21881351,0.005003959,0.6112321,0.002028989,0.15858932],"study_design_scores_gemma":[0.000042483218,0.00007644093,0.00053019286,0.000087142645,0.000058854668,0.00014584018,0.00024872532,0.47163063,0.00702055,0.50930405,0.010811388,0.00004373779],"about_ca_topic_score_codex":0.0030028082,"about_ca_topic_score_gemma":0.0047181654,"teacher_disagreement_score":0.0031829118,"about_ca_system_score_codex":0.00088756974,"about_ca_system_score_gemma":0.0015135717,"threshold_uncertainty_score":0.016833067},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050173175,0.00007543882,0.9465254,0.000108289,0.000009147281,0.000059615923,0.000018429937,0.00073479593,0.0022957271],"genre_scores_gemma":[0.4817133,0.000061945444,0.5165933,0.00005314344,0.0000070357137,0.00016958447,0.00006755854,0.00010782448,0.0012263093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994173,0.0002831259,0.000024228326,0.0000661891,0.000139868,0.00006930502],"domain_scores_gemma":[0.99812657,0.001062004,0.00014932326,0.00034266076,0.00022672545,0.00009278308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018111591,0.0004994446,0.00070817966,0.00076744304,0.00053139974,0.0009433482,0.0014340059,0.0010087144,0.0018046665],"category_scores_gemma":[0.0057554753,0.0005788802,0.0004798588,0.00065680995,0.0010000236,0.0014907675,0.0019149885,0.0011857281,0.00037514218],"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.0002675428,0.00016011081,0.0021260025,0.00011052668,0.00003521054,0.000103126586,0.00039379258,0.80243266,0.0044160713,0.039578274,0.0008343608,0.14954224],"study_design_scores_gemma":[0.000011459896,0.000016263257,0.000050042454,0.0000042089223,0.0000034963543,0.000008151735,0.000022091825,0.9939812,0.0009688216,0.0046874043,0.0002441792,0.0000026789792],"about_ca_topic_score_codex":0.004164144,"about_ca_topic_score_gemma":0.0044013956,"teacher_disagreement_score":0.004164144,"about_ca_system_score_codex":0.0005522912,"about_ca_system_score_gemma":0.00145346,"threshold_uncertainty_score":0.009578466},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00589176,0.0006739695,0.98612636,0.00051337114,0.000045370736,0.00003950492,0.00016755017,0.0004500171,0.006092152],"genre_scores_gemma":[0.47872087,0.0019941223,0.51115304,0.00021615368,0.0001402728,0.0003620145,0.0007644361,0.00023509155,0.006414046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998792,0.00050726417,0.00008345727,0.00016203921,0.00034014395,0.00011506311],"domain_scores_gemma":[0.9983151,0.0010766143,0.00017704527,0.00018785681,0.00016845866,0.00007486109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001208936,0.00079471373,0.00053302967,0.0006631956,0.0008236039,0.0024521449,0.001379417,0.0011002823,0.0033508837],"category_scores_gemma":[0.005972347,0.00053354865,0.0008093602,0.0010489363,0.0018616855,0.003939389,0.0023634837,0.001705694,0.0006644207],"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.00013815927,0.00003088406,0.0003479645,0.00019785554,0.000030018275,0.00030323272,0.00079506275,0.5094676,0.0017943427,0.40293893,0.003680806,0.0802752],"study_design_scores_gemma":[0.0000189736,0.000034555756,0.00011528816,0.00007377837,0.000025495372,0.000099244244,0.000155802,0.5848419,0.0016492124,0.39746153,0.015491845,0.00003231528],"about_ca_topic_score_codex":0.0058024554,"about_ca_topic_score_gemma":0.005236996,"teacher_disagreement_score":0.0058024554,"about_ca_system_score_codex":0.0015157185,"about_ca_system_score_gemma":0.0011623806,"threshold_uncertainty_score":0.011537373},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023166044,0.00013672176,0.97410417,0.00019863041,0.000027641387,0.00004091456,0.000039073206,0.00029015442,0.0019966997],"genre_scores_gemma":[0.7896798,0.00025742137,0.20746277,0.000088218294,0.000033144388,0.00012768939,0.000120274046,0.000034430548,0.002196209],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940646,0.00015914683,0.00006315734,0.00010614393,0.00020677412,0.000058328438],"domain_scores_gemma":[0.9992151,0.00029742758,0.00009981491,0.00017638074,0.00017908232,0.000032226562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011951858,0.0003472594,0.0004009303,0.00033654427,0.00045982964,0.0017834498,0.0009997683,0.00065848965,0.0011530272],"category_scores_gemma":[0.0020349254,0.00027977023,0.00047041482,0.00032846432,0.0008728211,0.0024157164,0.0014957507,0.0007129404,0.0002537818],"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.00036054855,0.00007573966,0.0017615383,0.00022068179,0.000106303574,0.00036999583,0.00035153102,0.6629117,0.042917922,0.15813823,0.002267338,0.13051845],"study_design_scores_gemma":[0.00002359143,0.000086447646,0.00027739067,0.000021401438,0.000030349685,0.000060218706,0.000052299758,0.9481055,0.014112947,0.03256863,0.0046359794,0.000025264526],"about_ca_topic_score_codex":0.0014514702,"about_ca_topic_score_gemma":0.0013782523,"teacher_disagreement_score":0.0017834498,"about_ca_system_score_codex":0.0007182874,"about_ca_system_score_gemma":0.00082812685,"threshold_uncertainty_score":0.006320834},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023262024,0.0002209034,0.9526161,0.00013020753,0.0000542484,0.00040204107,0.0008098254,0.01742057,0.005084176],"genre_scores_gemma":[0.2589386,0.0002992555,0.73327553,0.0001230142,0.000022625612,0.00085329753,0.002386318,0.002563071,0.0015382973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910873,0.00025680073,0.000067987494,0.00024061358,0.00022251355,0.00010329207],"domain_scores_gemma":[0.9986319,0.00070012524,0.00010472609,0.00037823533,0.00013627279,0.00004862711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011623456,0.0013504602,0.0009816632,0.0011141914,0.0004426455,0.001073405,0.0019359575,0.0010671578,0.007045878],"category_scores_gemma":[0.0053012664,0.0010419814,0.0012005223,0.0011485104,0.0014206675,0.0014198769,0.002046237,0.0016268549,0.0017109106],"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.00026070993,0.00012248057,0.0011491438,0.00055697147,0.00007680905,0.00035649847,0.00024120651,0.74427015,0.022130707,0.0220621,0.008311872,0.20046134],"study_design_scores_gemma":[0.00006424351,0.000050156486,0.00019749235,0.000028164766,0.00001912677,0.00007069043,0.000055020282,0.9740139,0.009570078,0.011604873,0.004308357,0.000017850058],"about_ca_topic_score_codex":0.001671569,"about_ca_topic_score_gemma":0.003938663,"teacher_disagreement_score":0.007045878,"about_ca_system_score_codex":0.0010784417,"about_ca_system_score_gemma":0.0017832529,"threshold_uncertainty_score":0.023570776},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009773679,0.059911184,0.78566355,0.016963754,0.0012985428,0.00044633538,0.0001932471,0.0011691288,0.12458058],"genre_scores_gemma":[0.20240639,0.057343025,0.7263092,0.0021305361,0.0011602152,0.00032080672,0.0003172439,0.0001437863,0.009868853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729425,0.0012908744,0.00022850659,0.00022285672,0.0008613589,0.00010221814],"domain_scores_gemma":[0.99375325,0.0049743317,0.00020448325,0.0004781337,0.00039416944,0.00019563988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041335225,0.0010448442,0.00070928066,0.004428996,0.0014884114,0.0043801796,0.0027705706,0.0041039204,0.008615498],"category_scores_gemma":[0.012770495,0.0007761558,0.0013535216,0.0046103667,0.0037669593,0.0044447784,0.0029590619,0.00279276,0.0019392486],"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.0000697082,0.00020120629,0.0010346329,0.0006330181,0.000086917215,0.0016727352,0.0008733879,0.048788987,0.0016883388,0.5831214,0.011830058,0.34999967],"study_design_scores_gemma":[0.000055758275,0.000039175404,0.0004777906,0.00050718064,0.000046222416,0.0013255813,0.00028462577,0.06386673,0.001659454,0.825877,0.10579828,0.0000621502],"about_ca_topic_score_codex":0.0024356074,"about_ca_topic_score_gemma":0.0018365601,"teacher_disagreement_score":0.008615498,"about_ca_system_score_codex":0.0018093807,"about_ca_system_score_gemma":0.001121263,"threshold_uncertainty_score":0.028821707},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095872484,0.001100399,0.772645,0.0018255656,0.0011433002,0.008965907,0.0010523257,0.014540821,0.10285419],"genre_scores_gemma":[0.15825899,0.0008221114,0.77381104,0.0006161785,0.0005262669,0.009395699,0.001627118,0.0011980886,0.053744458],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99836296,0.0008223393,0.00008771403,0.00027684812,0.0002916613,0.00015845845],"domain_scores_gemma":[0.99088424,0.0059080515,0.00031927373,0.00092990586,0.0007160509,0.0012424465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035607931,0.0021504466,0.0007203268,0.0017159454,0.0013662232,0.0015723956,0.0031241905,0.0013283872,0.059285995],"category_scores_gemma":[0.011621754,0.0005815327,0.0008565468,0.0010056985,0.0008071343,0.001973284,0.003375292,0.0018712655,0.01213568],"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.0011596212,0.00629603,0.00125124,0.0020442244,0.00006086744,0.00071302924,0.0111508565,0.007939119,0.0353179,0.010787069,0.12665209,0.79662794],"study_design_scores_gemma":[0.0016580246,0.0064460095,0.014291691,0.0012245678,0.00015244636,0.0021841016,0.0064437757,0.060114916,0.04212763,0.08928121,0.77571756,0.00035806707],"about_ca_topic_score_codex":0.00039045903,"about_ca_topic_score_gemma":0.0021039566,"teacher_disagreement_score":0.059285995,"about_ca_system_score_codex":0.0008790557,"about_ca_system_score_gemma":0.00127068,"threshold_uncertainty_score":0.19833142},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012851369,0.00029278814,0.9843833,0.00065909064,0.000062391955,0.00015785353,0.00024155263,0.00053010404,0.00082162954],"genre_scores_gemma":[0.20500176,0.0004952838,0.79238164,0.00024283737,0.00011768746,0.00036123648,0.00082330575,0.000074257405,0.0005018729],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9863815,0.008167358,0.0016234515,0.0013788214,0.0021233596,0.00032556095],"domain_scores_gemma":[0.9451156,0.04081394,0.003972262,0.0057841395,0.003910642,0.00040332405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021421377,0.0013482036,0.0021503782,0.004111483,0.0009865214,0.003696513,0.0039740833,0.0018836689,0.001955436],"category_scores_gemma":[0.07712965,0.0011399693,0.0016104715,0.0048787845,0.0010663312,0.004213351,0.0027385158,0.0031294224,0.0004582869],"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.0004754928,0.00059456524,0.019413827,0.00048243726,0.00094516505,0.0012108292,0.00092022755,0.5280325,0.001094884,0.027877638,0.0046966104,0.4142558],"study_design_scores_gemma":[0.0000747772,0.0000766951,0.0014013033,0.00014633084,0.0001696448,0.0002998734,0.00014770219,0.9069901,0.0016661437,0.08631482,0.0026460139,0.00006661042],"about_ca_topic_score_codex":0.0041908477,"about_ca_topic_score_gemma":0.0053313025,"teacher_disagreement_score":0.021421377,"about_ca_system_score_codex":0.0013817364,"about_ca_system_score_gemma":0.0021133942,"threshold_uncertainty_score":0.1132884},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0297163,0.00015447599,0.9637259,0.000096450356,0.000013788832,0.00007864124,0.00012943069,0.0030362885,0.0030485534],"genre_scores_gemma":[0.14706092,0.00008913714,0.84985864,0.00002776158,0.000006247747,0.00009578517,0.00037975993,0.00018722947,0.002294584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975866,0.000033699962,0.000014928134,0.000050920182,0.0000936469,0.000048122154],"domain_scores_gemma":[0.9997036,0.00010401319,0.000025489288,0.00007061422,0.000071025876,0.000025189878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026914867,0.0004442137,0.0004088949,0.00058047747,0.000660259,0.00056638505,0.0011105039,0.00037463094,0.0039861985],"category_scores_gemma":[0.0009674947,0.00028266938,0.0003048739,0.00085221056,0.00033317902,0.00088363624,0.00075134897,0.00046382178,0.0007088553],"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.0004164154,0.00015377057,0.0017813984,0.0002724922,0.000048615293,0.00016749377,0.0003297266,0.2670835,0.03183241,0.02149468,0.0071171084,0.66930246],"study_design_scores_gemma":[0.00010806592,0.000091551374,0.0005463397,0.000015110841,0.000022875667,0.00013739793,0.00008493945,0.96065253,0.012007318,0.014512018,0.011803927,0.000017941486],"about_ca_topic_score_codex":0.010621559,"about_ca_topic_score_gemma":0.013442026,"teacher_disagreement_score":0.010621559,"about_ca_system_score_codex":0.00062707183,"about_ca_system_score_gemma":0.0015051909,"threshold_uncertainty_score":0.021119475},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028312213,0.07408855,0.88290375,0.0013693974,0.00029513793,0.00018508315,0.0002455934,0.0018844231,0.0361968],"genre_scores_gemma":[0.11756845,0.29698595,0.55247706,0.0014606168,0.0011796155,0.0010254596,0.0012847165,0.0006473179,0.027370796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99962914,0.000094123156,0.00003067434,0.00005462574,0.00016574579,0.000025663416],"domain_scores_gemma":[0.99958354,0.0002272891,0.000025120882,0.000053362583,0.00009208813,0.000018527924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065161684,0.0015451177,0.000878982,0.0022764066,0.0005019375,0.002629287,0.0021098736,0.001961291,0.006395189],"category_scores_gemma":[0.0011772178,0.000864336,0.0015249932,0.0020935605,0.0011449913,0.0037636326,0.0009665811,0.0020054528,0.0028544609],"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.00007658909,0.00021858333,0.0008884583,0.002708942,0.00011771002,0.00038683476,0.0003082084,0.20896038,0.0061852373,0.42592496,0.015794879,0.33842924],"study_design_scores_gemma":[0.000035112953,0.00015834159,0.000579028,0.0009966086,0.00009205759,0.00076089974,0.00014318225,0.34540433,0.0036653727,0.23197648,0.41609722,0.00009139905],"about_ca_topic_score_codex":0.0035965198,"about_ca_topic_score_gemma":0.0022419814,"teacher_disagreement_score":0.006395189,"about_ca_system_score_codex":0.0017680228,"about_ca_system_score_gemma":0.0011172657,"threshold_uncertainty_score":0.021394074},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005604351,0.000112237896,0.9888284,0.0000956246,0.000013292561,0.000110402376,0.00010564317,0.0016772903,0.0034527734],"genre_scores_gemma":[0.21123023,0.00028419113,0.78377616,0.000086109365,0.000018825123,0.00032342016,0.0005968798,0.00029623098,0.003388028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795234,0.0006936905,0.00016247407,0.00037836528,0.0006492112,0.00016387788],"domain_scores_gemma":[0.99793893,0.0011917282,0.00010036998,0.00054191233,0.00016403859,0.00006290657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022288468,0.0007071061,0.00073523016,0.0010771772,0.0008449942,0.0019771522,0.00258841,0.0009844365,0.007755904],"category_scores_gemma":[0.006702622,0.00076242647,0.0013840563,0.0010588166,0.0030193713,0.0045385524,0.0028717292,0.0014340379,0.0010157384],"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.00020772639,0.000075594115,0.00085668307,0.00034520688,0.0001021521,0.00033274022,0.00085907936,0.3631234,0.007006595,0.38066402,0.0037992373,0.24262755],"study_design_scores_gemma":[0.00006463038,0.000059169473,0.00017998122,0.00006494158,0.00005167857,0.00011247406,0.00008304009,0.69355416,0.009797499,0.281543,0.014449005,0.000040487917],"about_ca_topic_score_codex":0.004952996,"about_ca_topic_score_gemma":0.0073855147,"teacher_disagreement_score":0.007755904,"about_ca_system_score_codex":0.0012678136,"about_ca_system_score_gemma":0.0015438176,"threshold_uncertainty_score":0.02594608},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051938806,0.00007978189,0.9942483,0.00026630962,0.000026340655,0.00021306418,0.0006306928,0.0007427003,0.0032734645],"genre_scores_gemma":[0.018293971,0.0003066307,0.97504926,0.00016905277,0.000034453773,0.00073942804,0.0025890097,0.0003784164,0.0024397057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954526,0.0016729244,0.0005162593,0.0005416523,0.0016285446,0.00018810655],"domain_scores_gemma":[0.9874336,0.007100008,0.00066145277,0.0026684513,0.0019563632,0.00018017578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005757481,0.00197644,0.000764,0.0070432993,0.0014887551,0.004966049,0.002764514,0.0015993499,0.012623736],"category_scores_gemma":[0.02162649,0.0015754286,0.0039144815,0.0038750137,0.003287597,0.0067604496,0.004130801,0.002926945,0.0050682197],"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.000053296822,0.000106878615,0.00065028714,0.001241974,0.000097596894,0.0007152974,0.0017416341,0.043659974,0.004006752,0.7626647,0.01290799,0.17215365],"study_design_scores_gemma":[0.000044880042,0.00005023001,0.00025954706,0.00049288926,0.000059936152,0.000416005,0.0007665702,0.1297638,0.00812618,0.7242655,0.13565996,0.00009454997],"about_ca_topic_score_codex":0.005266297,"about_ca_topic_score_gemma":0.006477459,"teacher_disagreement_score":0.012623736,"about_ca_system_score_codex":0.0022492025,"about_ca_system_score_gemma":0.0039770533,"threshold_uncertainty_score":0.042230546},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005066996,0.43214148,0.25720215,0.04758063,0.0055685844,0.00014067849,0.00024444424,0.00063082186,0.2514241],"genre_scores_gemma":[0.34418714,0.34626612,0.22277221,0.015509854,0.015518613,0.00093840214,0.0005848592,0.00043714375,0.053785637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964282,0.0014690756,0.00023244438,0.00044690995,0.0012611481,0.00016222188],"domain_scores_gemma":[0.9937337,0.0049570864,0.00019213332,0.00052722933,0.00041149944,0.00017825133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028288055,0.0013499227,0.0013868482,0.0032310085,0.0012385289,0.006192168,0.0013263816,0.0030548063,0.004710603],"category_scores_gemma":[0.0064698406,0.00045994952,0.00083195104,0.0040353113,0.01003496,0.007154106,0.0027744703,0.006054959,0.0014294548],"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.000006086071,0.000010994282,0.00012978066,0.00029175848,0.000023441004,0.000053346925,0.00024066486,0.0021451255,0.00013013315,0.95931584,0.007819669,0.029833285],"study_design_scores_gemma":[0.000005940048,0.000013196607,0.000102274236,0.00019307295,0.0000055831497,0.00006933241,0.000080644044,0.0021553312,0.00008190557,0.911142,0.08614129,0.000009605763],"about_ca_topic_score_codex":0.0014673384,"about_ca_topic_score_gemma":0.0010263151,"teacher_disagreement_score":0.006192168,"about_ca_system_score_codex":0.0023712171,"about_ca_system_score_gemma":0.002431298,"threshold_uncertainty_score":0.017204523},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00999792,0.00009596982,0.9817012,0.00015519786,0.000025440071,0.00015333989,0.00025189132,0.00078288367,0.0068363044],"genre_scores_gemma":[0.2080846,0.00024252028,0.78505695,0.00015409177,0.000021658538,0.0003700106,0.00068712473,0.00032463402,0.005058528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984498,0.0005891395,0.00011632496,0.00025259415,0.0004609512,0.00013120542],"domain_scores_gemma":[0.99741155,0.0016397043,0.00016721651,0.0003986572,0.00026704586,0.00011590782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019840214,0.00077555096,0.00047655086,0.00060078537,0.00060757395,0.0012353108,0.0011738171,0.00059322454,0.0058052232],"category_scores_gemma":[0.0063594286,0.00051644305,0.00088519655,0.0008698294,0.0011281483,0.002808689,0.0021352048,0.0012342528,0.00082164933],"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.00037059406,0.00010704189,0.0015928058,0.00053827325,0.00007466744,0.00044094375,0.0009016363,0.5884002,0.006108747,0.20921831,0.0064456095,0.18580115],"study_design_scores_gemma":[0.00005410072,0.00008700506,0.00025380077,0.000054172182,0.000032585165,0.00012046601,0.0001884451,0.8232763,0.005055944,0.15143587,0.019413482,0.000027923077],"about_ca_topic_score_codex":0.005244742,"about_ca_topic_score_gemma":0.011472133,"teacher_disagreement_score":0.0058052232,"about_ca_system_score_codex":0.0011259227,"about_ca_system_score_gemma":0.0018287698,"threshold_uncertainty_score":0.019420385},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039166942,0.00025145552,0.9463187,0.001588506,0.00016627727,0.00071844895,0.00025994107,0.003335339,0.00819447],"genre_scores_gemma":[0.30863586,0.00014748148,0.68600976,0.00034633421,0.00009995394,0.00025330367,0.00053759135,0.00029295112,0.0036767724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753976,0.00042155845,0.00019366693,0.0005578456,0.0011023749,0.00018476778],"domain_scores_gemma":[0.99313825,0.002913005,0.0005795899,0.0015775423,0.0013947504,0.0003967672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003965657,0.00060013926,0.0010023372,0.0030557532,0.002029735,0.0021604963,0.004665501,0.0023994104,0.007072965],"category_scores_gemma":[0.015989674,0.00083160785,0.00063262595,0.0023614676,0.0010106541,0.0051329834,0.0023039598,0.0016532345,0.0016026496],"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.0007554689,0.001065231,0.0050939834,0.00014475927,0.00014054654,0.00050699856,0.00068368384,0.10672405,0.009010713,0.02967946,0.026310518,0.8198846],"study_design_scores_gemma":[0.00019051839,0.00018452948,0.0034207862,0.00007400911,0.00019460573,0.000947792,0.0003796615,0.9029439,0.011843401,0.062069308,0.017637437,0.00011405106],"about_ca_topic_score_codex":0.0060984176,"about_ca_topic_score_gemma":0.009265767,"teacher_disagreement_score":0.007072965,"about_ca_system_score_codex":0.0013975105,"about_ca_system_score_gemma":0.0019034831,"threshold_uncertainty_score":0.023661375},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046839514,0.0059456555,0.95138854,0.0107264025,0.0004016383,0.00009655083,0.00021103266,0.00043383116,0.02611227],"genre_scores_gemma":[0.48602095,0.0063743447,0.49067104,0.0030866454,0.0007565445,0.00042606107,0.00039913223,0.00024835364,0.012016935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995974,0.001759585,0.00031008682,0.00086873403,0.0008693639,0.00021826738],"domain_scores_gemma":[0.9883194,0.009474357,0.00053221534,0.0010523252,0.00045571377,0.00016598066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032675301,0.0010638842,0.00069024635,0.0013819062,0.0012094917,0.0038694348,0.0017659377,0.0029405346,0.0058179568],"category_scores_gemma":[0.012133341,0.00065838237,0.0011981564,0.0017016011,0.011799536,0.009560275,0.0026908887,0.0049468027,0.00081802823],"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.000026983316,0.000008346367,0.00019562873,0.00013082476,0.000010046205,0.000120770645,0.00035621223,0.011458863,0.00028449213,0.961449,0.0010958357,0.024862945],"study_design_scores_gemma":[0.000016869952,0.000024547131,0.00008299287,0.00009186596,0.000014394119,0.00019282219,0.0001314246,0.037871122,0.0007469198,0.94169354,0.019115973,0.000017458407],"about_ca_topic_score_codex":0.0052171377,"about_ca_topic_score_gemma":0.0039821565,"teacher_disagreement_score":0.0058179568,"about_ca_system_score_codex":0.0033470849,"about_ca_system_score_gemma":0.0024884488,"threshold_uncertainty_score":0.0242849},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015370088,0.00036235424,0.90618646,0.0014862885,0.00022996553,0.0005467914,0.0010427053,0.060421813,0.014353615],"genre_scores_gemma":[0.23701745,0.00038726075,0.7451657,0.0012451363,0.0003009359,0.000771573,0.0033227329,0.0016718796,0.010117372],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972704,0.0005002331,0.00037846874,0.0006976188,0.00096206367,0.00019114718],"domain_scores_gemma":[0.994241,0.002613264,0.00040742182,0.0012388328,0.00094489136,0.0005546752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043551847,0.0008300308,0.0012189599,0.0033340347,0.001781288,0.00419633,0.004783347,0.0028251612,0.015161982],"category_scores_gemma":[0.012949378,0.00064561446,0.000881865,0.0020522508,0.001121279,0.0062391064,0.0045571327,0.0022389765,0.008381544],"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.001962583,0.0012778665,0.005040049,0.00084468425,0.00035069452,0.003553433,0.0036514155,0.025646016,0.037309922,0.0818848,0.06679297,0.7716856],"study_design_scores_gemma":[0.00053674367,0.00046101565,0.002490134,0.00039375978,0.00038548996,0.0017987478,0.00067667593,0.5215747,0.04836993,0.1527055,0.27016443,0.00044285707],"about_ca_topic_score_codex":0.002995243,"about_ca_topic_score_gemma":0.0022884803,"teacher_disagreement_score":0.015161982,"about_ca_system_score_codex":0.0011272567,"about_ca_system_score_gemma":0.002398841,"threshold_uncertainty_score":0.050721884},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077821757,0.00023089313,0.9855924,0.00027983455,0.00003197437,0.00009580952,0.000097429736,0.00032095035,0.0055684927],"genre_scores_gemma":[0.32033676,0.00066255056,0.6739384,0.000134517,0.0000437077,0.0003502244,0.0002984238,0.00012097258,0.004114474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997491,0.0010445572,0.0001601229,0.00038452735,0.0007447887,0.0001749783],"domain_scores_gemma":[0.99510384,0.003737218,0.00035509557,0.0003795446,0.00026705125,0.00015730335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028528462,0.0008560957,0.00061892776,0.0005622145,0.00057309744,0.0017473432,0.0013383368,0.00087509747,0.0033503359],"category_scores_gemma":[0.008090721,0.0005173255,0.0011229102,0.00075384113,0.0020940017,0.0026659477,0.0017032624,0.0018466057,0.00043415016],"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.00013145298,0.00007196478,0.00049296767,0.00022960179,0.000051519863,0.00014949453,0.00025629008,0.39067957,0.001979043,0.545961,0.0015701841,0.058426823],"study_design_scores_gemma":[0.000053274583,0.00006680785,0.00014303457,0.00004036877,0.00002300312,0.000062522886,0.000036473382,0.7106074,0.0023098825,0.27842423,0.008210194,0.000022863693],"about_ca_topic_score_codex":0.003037399,"about_ca_topic_score_gemma":0.004189306,"teacher_disagreement_score":0.0033503359,"about_ca_system_score_codex":0.0015865527,"about_ca_system_score_gemma":0.003620665,"threshold_uncertainty_score":0.015087426},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008206327,0.004563843,0.055100366,0.006292712,0.0034250375,0.0007216119,0.018862525,0.03605328,0.8667743],"genre_scores_gemma":[0.08465374,0.0071931286,0.09192005,0.005501998,0.00090138277,0.0010784594,0.046389457,0.012219471,0.75014234],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862707,0.00018722343,0.00009003671,0.00027800284,0.0006405017,0.00017731167],"domain_scores_gemma":[0.99804235,0.0002829454,0.00017171577,0.00043451734,0.00065289496,0.0004154965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00122024,0.0014283975,0.00069599587,0.0022543815,0.001733939,0.0039760126,0.0021845927,0.0020285307,0.23365156],"category_scores_gemma":[0.003978871,0.0006265491,0.0009694997,0.002052834,0.0008573621,0.0028266017,0.0045649325,0.0019604715,0.1596304],"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.0005432585,0.0001261724,0.0017523267,0.000952574,0.000047569643,0.0005765049,0.0004937119,0.0024169784,0.0072949966,0.051239952,0.58861023,0.3459458],"study_design_scores_gemma":[0.000022039088,0.000032497413,0.00035476513,0.00007056612,0.0000103236525,0.00018353503,0.000059287402,0.0006642955,0.00084445195,0.0033339693,0.9944106,0.000013629822],"about_ca_topic_score_codex":0.004368666,"about_ca_topic_score_gemma":0.0064611756,"teacher_disagreement_score":0.23365156,"about_ca_system_score_codex":0.001228686,"about_ca_system_score_gemma":0.0027792978,"threshold_uncertainty_score":0},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0783125,0.0027824626,0.66980374,0.048832893,0.002836944,0.00013100106,0.001093514,0.0014785384,0.19472846],"genre_scores_gemma":[0.8401068,0.0016455173,0.11595083,0.00448491,0.0019764851,0.0002396674,0.00071493693,0.0008068704,0.034074046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99721175,0.0006370211,0.00022616495,0.00091545196,0.0005775145,0.0004320336],"domain_scores_gemma":[0.9823612,0.01217516,0.0004718927,0.0029939697,0.0015354617,0.0004622474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043437863,0.0005051459,0.0016456061,0.0008814714,0.003058535,0.0048286105,0.0029354556,0.004129285,0.01562572],"category_scores_gemma":[0.03662938,0.00079122087,0.0023513227,0.0018101697,0.006846212,0.02005292,0.0048260265,0.009403106,0.0016980327],"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.00013989459,0.00001996619,0.00046018555,0.000100161385,0.00002216189,0.00025666316,0.00055316824,0.007845752,0.00040723511,0.97115695,0.0070593017,0.011978612],"study_design_scores_gemma":[0.000017675055,0.000012789008,0.00018534511,0.000029006818,0.000015496911,0.000118741744,0.00027857715,0.014437426,0.00038022766,0.9782235,0.0062842183,0.000016902204],"about_ca_topic_score_codex":0.006763758,"about_ca_topic_score_gemma":0.0036496904,"teacher_disagreement_score":0.01562572,"about_ca_system_score_codex":0.0022584994,"about_ca_system_score_gemma":0.001279079,"threshold_uncertainty_score":0.052273214},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013648657,0.0006778848,0.9858743,0.0011407675,0.00010368462,0.00004440539,0.00003275154,0.00019995628,0.010561309],"genre_scores_gemma":[0.13855933,0.0020595824,0.8500046,0.00057847175,0.000357784,0.00036136285,0.00013799882,0.00011031422,0.007830511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991178,0.00030101245,0.000048385038,0.00012999075,0.0003312846,0.00007159655],"domain_scores_gemma":[0.9993137,0.00022538095,0.000057108944,0.00011501699,0.00018068777,0.000108095875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022025534,0.0010541797,0.00081927446,0.000821389,0.0008197516,0.0029611208,0.002641246,0.0018081865,0.0020057925],"category_scores_gemma":[0.001278545,0.00052226067,0.0011454925,0.000635497,0.0030581423,0.0031400062,0.002148065,0.00358117,0.0008584326],"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.0000054992047,0.000017584118,0.000075843906,0.00005175989,0.000015029923,0.000050119103,0.00011592166,0.03387804,0.0004360717,0.9563508,0.00079228776,0.008210954],"study_design_scores_gemma":[0.000026891235,0.000042281048,0.0000818603,0.00007794495,0.00003029923,0.00005290936,0.00009346395,0.3316076,0.0008189219,0.5972607,0.0698852,0.000021853122],"about_ca_topic_score_codex":0.0037907243,"about_ca_topic_score_gemma":0.0031751492,"teacher_disagreement_score":0.0037907243,"about_ca_system_score_codex":0.0011969074,"about_ca_system_score_gemma":0.0026306417,"threshold_uncertainty_score":0.011648357},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016130378,0.00046635707,0.9534672,0.0027003333,0.00010122296,0.00021217455,0.00043844216,0.002658574,0.023825472],"genre_scores_gemma":[0.3490986,0.0009917704,0.6215837,0.0013123302,0.000111771784,0.00056440465,0.0013163725,0.0005169217,0.024504105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991359,0.00032285115,0.000052746844,0.00016574952,0.00025011803,0.00007266281],"domain_scores_gemma":[0.9988986,0.0005571331,0.00014273192,0.00015281053,0.0002029756,0.000045608074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084206724,0.00064853084,0.0003408447,0.00066937314,0.0009516123,0.002714886,0.0013176932,0.0011869412,0.005891069],"category_scores_gemma":[0.0036655036,0.00041216487,0.00077888835,0.00050591666,0.0026227466,0.0035002122,0.0013914667,0.0013142575,0.0014756275],"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.00014291056,0.00011224543,0.0011687131,0.0006855407,0.000055521436,0.00088600535,0.0035665534,0.025410807,0.016418565,0.8291739,0.010341343,0.11203781],"study_design_scores_gemma":[0.000093140734,0.000196978,0.00067846844,0.00019099741,0.000090892936,0.00090568763,0.00149004,0.17188081,0.020089855,0.5441854,0.26011047,0.00008727653],"about_ca_topic_score_codex":0.005232655,"about_ca_topic_score_gemma":0.0066068373,"teacher_disagreement_score":0.005891069,"about_ca_system_score_codex":0.0012284693,"about_ca_system_score_gemma":0.001627925,"threshold_uncertainty_score":0.01970756},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034266967,0.0010764587,0.87835646,0.0008787421,0.000086813474,0.0006948241,0.0012537489,0.0053710975,0.078014895],"genre_scores_gemma":[0.31629533,0.0017035304,0.6607177,0.00019514289,0.000056160166,0.0013531102,0.0012243518,0.0002817586,0.018172756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940836,0.00030198484,0.00003612819,0.00009629462,0.00013086204,0.000026415191],"domain_scores_gemma":[0.9965848,0.0025290893,0.00013506632,0.00038634482,0.0002929868,0.000071689756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010702346,0.00045654151,0.00035118056,0.0015180846,0.00061631453,0.0010676206,0.00061719446,0.0007088691,0.016527548],"category_scores_gemma":[0.0056289546,0.00019659685,0.000351889,0.0027693124,0.000520516,0.0013696984,0.0012011445,0.000537748,0.0021555144],"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.00027982309,0.0002954749,0.010056133,0.0011344146,0.00008195664,0.0007169547,0.0029132122,0.121467486,0.013189957,0.32474053,0.03055931,0.49456483],"study_design_scores_gemma":[0.00014929495,0.0002934094,0.0065358006,0.0003512692,0.00008516636,0.0007099484,0.00153277,0.3552839,0.011310189,0.23597443,0.3877138,0.000060064245],"about_ca_topic_score_codex":0.0018866254,"about_ca_topic_score_gemma":0.0029793412,"teacher_disagreement_score":0.016527548,"about_ca_system_score_codex":0.000618066,"about_ca_system_score_gemma":0.0007381787,"threshold_uncertainty_score":0.055290222},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017629337,0.0007589486,0.9370582,0.00037987967,0.00018137976,0.0002189164,0.00029683238,0.021024851,0.022451673],"genre_scores_gemma":[0.305439,0.00075591466,0.6670524,0.00048939424,0.00015329703,0.00057402765,0.0013962009,0.00037591625,0.023763856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964905,0.000050458675,0.000028847051,0.000077798104,0.00015057038,0.000043278214],"domain_scores_gemma":[0.9997328,0.00008126839,0.000023067274,0.00006516374,0.000057244484,0.000040486408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048297262,0.00058240327,0.00057052256,0.0006638605,0.0004961336,0.0018186355,0.0015317658,0.0010538945,0.010077283],"category_scores_gemma":[0.00083866995,0.00032970324,0.00042306105,0.00060525833,0.00046570157,0.001964007,0.000936841,0.00077565556,0.003568966],"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.000664469,0.00034540036,0.0020027726,0.0006387275,0.0001863224,0.0009576072,0.0006758929,0.03774061,0.07961526,0.08884049,0.030826911,0.75750554],"study_design_scores_gemma":[0.00023502429,0.0006550336,0.0013090912,0.00011297503,0.00026741088,0.0010932048,0.00019050844,0.6473156,0.0403522,0.057102207,0.25123397,0.00013268796],"about_ca_topic_score_codex":0.0012854357,"about_ca_topic_score_gemma":0.0013644001,"teacher_disagreement_score":0.010077283,"about_ca_system_score_codex":0.00042519232,"about_ca_system_score_gemma":0.0006977106,"threshold_uncertainty_score":0.03371179},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16197361,0.0006612354,0.82576954,0.0038864522,0.00010622612,0.00047581535,0.00030129956,0.00071859156,0.006107178],"genre_scores_gemma":[0.37737367,0.00031245244,0.6206981,0.00028898782,0.000053409927,0.00008977321,0.0002149868,0.000039126517,0.00092955516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963812,0.0015863309,0.00037216168,0.00054568157,0.00090191985,0.0002128006],"domain_scores_gemma":[0.9916291,0.0047991825,0.0009997204,0.00042030957,0.0018180809,0.00033358388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070949136,0.0006532998,0.0008256123,0.002543244,0.0013242264,0.0025924302,0.001278573,0.0008548912,0.001714391],"category_scores_gemma":[0.01274514,0.00042733844,0.0010937387,0.0013886893,0.00079315226,0.0021735923,0.0009806985,0.0010112036,0.00031613448],"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.0014522519,0.00089500385,0.033651892,0.0010122454,0.00039843444,0.0014834498,0.004846713,0.16356063,0.024355784,0.039462272,0.008507358,0.720374],"study_design_scores_gemma":[0.00026764392,0.0005623623,0.009569236,0.0003500159,0.00028146032,0.00095255306,0.0021615564,0.893956,0.013878334,0.06912821,0.0086790435,0.0002136124],"about_ca_topic_score_codex":0.011963792,"about_ca_topic_score_gemma":0.013247558,"teacher_disagreement_score":0.011963792,"about_ca_system_score_codex":0.0016619888,"about_ca_system_score_gemma":0.004790757,"threshold_uncertainty_score":0.03752196},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014426175,0.6179527,0.08997888,0.081087105,0.0036221202,0.00011962393,0.0003413083,0.0018691785,0.19060291],"genre_scores_gemma":[0.09719343,0.6101444,0.17754339,0.015565121,0.006593811,0.00035720057,0.0013035758,0.0005240698,0.09077502],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982419,0.0005195449,0.00015392365,0.0002230968,0.00072910753,0.00013251432],"domain_scores_gemma":[0.9918996,0.0046174456,0.00037121048,0.00049100193,0.0019726453,0.00064815005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005747554,0.00055073417,0.00046851626,0.0018173403,0.0005762057,0.0046183583,0.001868832,0.002921774,0.020049142],"category_scores_gemma":[0.0045263343,0.00044892114,0.0005244821,0.0038860803,0.0028392002,0.010508103,0.0011346185,0.0029982305,0.0069169146],"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.00014900675,0.00023451333,0.0016914307,0.0015166096,0.00002906243,0.000080981896,0.00033134123,0.0019220089,0.00258391,0.16684967,0.041066624,0.7835447],"study_design_scores_gemma":[0.00004369232,0.00021360638,0.002843733,0.0010789523,0.00003389679,0.00058913964,0.000703367,0.008144965,0.0013965012,0.104351945,0.880557,0.000043088257],"about_ca_topic_score_codex":0.0013422563,"about_ca_topic_score_gemma":0.0017764186,"teacher_disagreement_score":0.020049142,"about_ca_system_score_codex":0.001894208,"about_ca_system_score_gemma":0.0020397312,"threshold_uncertainty_score":0.06707108},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040119667,0.0016814411,0.8199612,0.0012546277,0.00040671884,0.00011954006,0.00038332338,0.0024100007,0.1336634],"genre_scores_gemma":[0.5608668,0.0014583828,0.40344295,0.0001886834,0.00005269734,0.00022792167,0.000816737,0.000723492,0.032222334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995734,0.00016874338,0.000042529366,0.00007726726,0.00008024614,0.000057826142],"domain_scores_gemma":[0.9997665,0.00009409812,0.000017405406,0.000070119575,0.000028399149,0.000023519708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048543775,0.0006625819,0.0006840605,0.0006014778,0.0014298529,0.002454466,0.0007341607,0.00055161415,0.012169401],"category_scores_gemma":[0.0010448049,0.00057757075,0.001101967,0.0011273453,0.0014259089,0.0036738878,0.00290216,0.0016415376,0.0018246477],"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.00027379225,0.00003881397,0.00064272044,0.00034961736,0.000035972138,0.0004515667,0.0023840207,0.047498845,0.00272204,0.81866723,0.0053007933,0.12163461],"study_design_scores_gemma":[0.0000479204,0.000057311165,0.0003611605,0.00014041377,0.000065042586,0.0003043574,0.0009380444,0.09100497,0.0034274645,0.77233595,0.13126363,0.0000537212],"about_ca_topic_score_codex":0.0035700866,"about_ca_topic_score_gemma":0.005887211,"teacher_disagreement_score":0.012169401,"about_ca_system_score_codex":0.0008060756,"about_ca_system_score_gemma":0.001072505,"threshold_uncertainty_score":0.040710688},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03538428,0.0007957616,0.9517356,0.00041665946,0.00006667123,0.0001514788,0.00012917531,0.0018064806,0.009513857],"genre_scores_gemma":[0.30266827,0.00020770665,0.6925244,0.0004091619,0.000040744337,0.00025947293,0.00045783055,0.00034491895,0.0030875136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794465,0.0007608599,0.00010192336,0.0003776792,0.0006072839,0.00020749655],"domain_scores_gemma":[0.9962483,0.0021934994,0.00020717467,0.0009337894,0.00028537284,0.00013192568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025864793,0.00082050223,0.0016395288,0.0008344778,0.0006176264,0.001253403,0.0014152412,0.0013744204,0.0057986383],"category_scores_gemma":[0.010460983,0.0006402639,0.00092722283,0.0011787253,0.0010263798,0.0025618186,0.002092501,0.0018676985,0.0009144529],"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.00045215024,0.0002525139,0.0016853625,0.00034079174,0.00009914763,0.00008961642,0.00032521287,0.59888047,0.0053702057,0.12043119,0.011544219,0.2605291],"study_design_scores_gemma":[0.000070108836,0.00006921576,0.00023100474,0.00002092669,0.000016100123,0.000034800152,0.000036797323,0.9439478,0.0010972448,0.05171361,0.0027527402,0.000009647999],"about_ca_topic_score_codex":0.0050214217,"about_ca_topic_score_gemma":0.008235572,"teacher_disagreement_score":0.0057986383,"about_ca_system_score_codex":0.0016040036,"about_ca_system_score_gemma":0.002567326,"threshold_uncertainty_score":0.019398391},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008000733,0.00006501623,0.99661297,0.00010997988,0.000029861594,0.00004037712,0.000016442613,0.0002931597,0.0020322555],"genre_scores_gemma":[0.06714992,0.00018573634,0.9276264,0.00015203342,0.00003288192,0.00030519886,0.000061256,0.00008416301,0.004402324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991021,0.00018508275,0.00005474209,0.00022785616,0.00036700946,0.00006328435],"domain_scores_gemma":[0.9992409,0.0003001992,0.00008138371,0.00019742142,0.0001293095,0.00005085354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009770362,0.0006140531,0.0005340521,0.00062453846,0.00054703356,0.0015412772,0.00202965,0.001207356,0.0036347243],"category_scores_gemma":[0.002060848,0.00052062,0.0010028172,0.0004426527,0.002207271,0.002896865,0.0014675027,0.0016114088,0.0010085929],"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.000047362526,0.000081067505,0.00035923452,0.00031750623,0.00005745012,0.00020098162,0.00040773003,0.050154403,0.021948827,0.81952435,0.0030418397,0.103859246],"study_design_scores_gemma":[0.000070202266,0.0002211583,0.00019352447,0.00011515845,0.000066955414,0.0006667266,0.00010197454,0.54598147,0.03353765,0.30355182,0.115418956,0.00007446429],"about_ca_topic_score_codex":0.0007354232,"about_ca_topic_score_gemma":0.0010446724,"teacher_disagreement_score":0.0036347243,"about_ca_system_score_codex":0.0008033032,"about_ca_system_score_gemma":0.0010817137,"threshold_uncertainty_score":0.0121593475},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036244376,0.00009961188,0.98644614,0.000080387996,0.00002687248,0.00008705139,0.00017245908,0.0065217637,0.0029411903],"genre_scores_gemma":[0.086127214,0.00020179307,0.90780574,0.00017631012,0.000020221216,0.00011802273,0.0003414832,0.0003702824,0.004839017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992422,0.00011351254,0.00007531065,0.0001389797,0.0003874757,0.000042592015],"domain_scores_gemma":[0.99906474,0.00047325107,0.00008494361,0.00017374962,0.00016446675,0.000038892613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013370559,0.0005521799,0.000628406,0.0010456294,0.00043769018,0.00166356,0.0020930564,0.0008265297,0.006499852],"category_scores_gemma":[0.0038494237,0.00062920694,0.001305764,0.0004918946,0.0010145139,0.0030728094,0.0012710225,0.0012613271,0.002884726],"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.0004432307,0.00013510157,0.001581082,0.001125949,0.00029679944,0.00052441075,0.00081039534,0.13764405,0.057772104,0.38763452,0.008952111,0.40308025],"study_design_scores_gemma":[0.000086219356,0.000106418884,0.0005526679,0.000092855174,0.00014123296,0.000363976,0.000087176464,0.72409755,0.04453543,0.18142824,0.048419863,0.00008835351],"about_ca_topic_score_codex":0.0014861821,"about_ca_topic_score_gemma":0.0022145167,"teacher_disagreement_score":0.006499852,"about_ca_system_score_codex":0.00059869385,"about_ca_system_score_gemma":0.0009991731,"threshold_uncertainty_score":0.021744192},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075114176,0.003947719,0.8339663,0.002390162,0.0007491993,0.0010392044,0.03338121,0.018238233,0.03117372],"genre_scores_gemma":[0.2953318,0.0025888085,0.62672067,0.00076541415,0.00020911754,0.0011989706,0.05889077,0.00088728947,0.0134072015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819094,0.00026422134,0.00024114292,0.00031809954,0.0008204862,0.00016510453],"domain_scores_gemma":[0.9944019,0.0012333967,0.00033097857,0.002886095,0.0010103353,0.00013738862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084590854,0.00076155947,0.0011381898,0.002548054,0.0007847829,0.0027188163,0.0032007743,0.0010785933,0.017150631],"category_scores_gemma":[0.008260282,0.0005725381,0.0007058225,0.0070051155,0.00057119894,0.0055996347,0.0023070376,0.0012136729,0.0042056097],"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.0014590456,0.0003539084,0.0019829427,0.0007867489,0.00011465195,0.0006620953,0.00034995106,0.042849027,0.016838921,0.0620344,0.075070016,0.7974983],"study_design_scores_gemma":[0.0006640779,0.00068026414,0.0027124225,0.00038326802,0.00015071314,0.0031703552,0.0010465516,0.42641464,0.062939145,0.25634468,0.2453478,0.00014597604],"about_ca_topic_score_codex":0.0023605565,"about_ca_topic_score_gemma":0.0031120009,"teacher_disagreement_score":0.017150631,"about_ca_system_score_codex":0.0009098246,"about_ca_system_score_gemma":0.0015142607,"threshold_uncertainty_score":0.057374597},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076392503,0.000515807,0.9840681,0.00073403306,0.0000836151,0.00006736691,0.00026440463,0.00062736747,0.0060000573],"genre_scores_gemma":[0.38414818,0.0011595405,0.6089097,0.00044986967,0.00016316725,0.0002835902,0.0008239993,0.00017892309,0.0038830612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798006,0.00069271156,0.00025990757,0.0003239826,0.0005327127,0.00021056751],"domain_scores_gemma":[0.9951527,0.0032845547,0.00043188574,0.0006263027,0.00034392747,0.00016058933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033522025,0.00077853433,0.0005698305,0.0016184518,0.00092000765,0.0044014626,0.0023032727,0.0012424836,0.0033126338],"category_scores_gemma":[0.009535952,0.00079599686,0.0018458703,0.001718055,0.0037634736,0.007370499,0.0020639875,0.002840082,0.0004894392],"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.00027547922,0.00010834297,0.00050837983,0.00031842585,0.00011810275,0.00026016167,0.0006232668,0.14352208,0.0033122767,0.77571297,0.0024821921,0.07275834],"study_design_scores_gemma":[0.00006386872,0.000033231365,0.000079648824,0.00008438345,0.00008725948,0.0000652163,0.000100375204,0.28760973,0.0038677964,0.7011411,0.006831765,0.000035575562],"about_ca_topic_score_codex":0.009025682,"about_ca_topic_score_gemma":0.012225833,"teacher_disagreement_score":0.009025682,"about_ca_system_score_codex":0.0022731598,"about_ca_system_score_gemma":0.0020906068,"threshold_uncertainty_score":0.017946303},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006299213,0.29933217,0.36318055,0.13201481,0.0054544113,0.00022744514,0.00024684146,0.0012666129,0.19197801],"genre_scores_gemma":[0.118991025,0.32608184,0.45311272,0.027274068,0.009324474,0.00064668595,0.0009750828,0.00024749505,0.0633466],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981269,0.00087494176,0.00008049444,0.00018195613,0.00060348504,0.0001321146],"domain_scores_gemma":[0.99254096,0.0053761583,0.00020809518,0.00029023766,0.0011520748,0.00043238894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077317692,0.0011285621,0.0005854389,0.0016810722,0.0007162945,0.0033800527,0.001779162,0.0051045795,0.013013593],"category_scores_gemma":[0.006118131,0.0004161524,0.0006584342,0.0015699242,0.0023222796,0.0066588214,0.0012161047,0.003950235,0.005061079],"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.00014955217,0.00030483428,0.0007763339,0.00095630327,0.00007670512,0.00024930606,0.0004411659,0.010105804,0.0014918004,0.42335224,0.08205092,0.48004508],"study_design_scores_gemma":[0.00006292531,0.0003082303,0.0006204887,0.0007814266,0.000032104643,0.00030825086,0.00037563333,0.011071914,0.00078159384,0.29718313,0.6884242,0.000050107472],"about_ca_topic_score_codex":0.0016229377,"about_ca_topic_score_gemma":0.0013033795,"teacher_disagreement_score":0.013013593,"about_ca_system_score_codex":0.0010437295,"about_ca_system_score_gemma":0.0016458741,"threshold_uncertainty_score":0.043534815},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023462109,0.017917551,0.55892634,0.0044913725,0.0005676983,0.00022673026,0.0012722182,0.0019721035,0.4122798],"genre_scores_gemma":[0.13058044,0.026508927,0.5442395,0.002489477,0.00078386324,0.0007770681,0.010501785,0.0010365786,0.28308228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988423,0.00028923657,0.00011792717,0.00029301914,0.00037381906,0.00008383033],"domain_scores_gemma":[0.99896777,0.00038637774,0.000035746558,0.0003687359,0.00018799864,0.00005336746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012377595,0.0011195953,0.0009927838,0.0018821447,0.00100555,0.009707235,0.0027909041,0.0016523446,0.035664026],"category_scores_gemma":[0.003549047,0.00074212305,0.0012431081,0.0026796383,0.0028519644,0.008759835,0.002819273,0.0021275918,0.016786173],"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.000029901468,0.000059745216,0.00020052004,0.00045997434,0.000043043005,0.00011150418,0.0008010898,0.002497418,0.0008213951,0.6555632,0.05120515,0.2882071],"study_design_scores_gemma":[0.000008038481,0.0000094167035,0.00014888254,0.00023581262,0.000023252309,0.00013892924,0.00019223243,0.004463747,0.00067705446,0.73529863,0.2587914,0.00001266948],"about_ca_topic_score_codex":0.00463536,"about_ca_topic_score_gemma":0.0033135219,"teacher_disagreement_score":0.035664026,"about_ca_system_score_codex":0.0016882538,"about_ca_system_score_gemma":0.002307347,"threshold_uncertainty_score":0.119308054},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27040395,0.00076917314,0.7100768,0.0011413593,0.000062561456,0.00024771906,0.00035423783,0.014137003,0.0028071948],"genre_scores_gemma":[0.8664924,0.00016062826,0.13211831,0.00010303391,0.00003498382,0.00006625163,0.00037686925,0.00011420214,0.00053326075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99671197,0.00088025717,0.00024193928,0.0005358604,0.0013343311,0.0002956572],"domain_scores_gemma":[0.9865759,0.009021353,0.001540892,0.0009245735,0.0016789149,0.0002584381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019519746,0.0010836981,0.0006511069,0.002364335,0.0007999079,0.0018459749,0.002154617,0.0013916112,0.00095080835],"category_scores_gemma":[0.017976535,0.0005365719,0.00046899685,0.00096434454,0.0013165765,0.0024759208,0.0011023297,0.0013556321,0.00033305804],"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.0007946771,0.0006330944,0.036627732,0.00056175434,0.00016078835,0.0010343157,0.0010505035,0.49740186,0.05917457,0.017204564,0.006542159,0.37881398],"study_design_scores_gemma":[0.000017860635,0.000055266883,0.001982652,0.000012375441,0.00001690342,0.0001375209,0.0001068924,0.9743235,0.013915073,0.008791565,0.0006250455,0.000015438309],"about_ca_topic_score_codex":0.0058736466,"about_ca_topic_score_gemma":0.0038051323,"teacher_disagreement_score":0.0058736466,"about_ca_system_score_codex":0.0015375386,"about_ca_system_score_gemma":0.0016215143,"threshold_uncertainty_score":0.011678934},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010092285,0.00034473327,0.9663653,0.0006055565,0.00007688071,0.0006051974,0.0016250684,0.00794698,0.012337922],"genre_scores_gemma":[0.11197148,0.0005121854,0.8778394,0.00012923105,0.000038695365,0.00058494153,0.003594282,0.00012685762,0.005202891],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869436,0.00035491263,0.00023528354,0.00023193865,0.00042008195,0.00006338981],"domain_scores_gemma":[0.99835855,0.0009094939,0.00014472957,0.00022783646,0.00028810924,0.000071194816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002352258,0.00095629523,0.00076022564,0.002420034,0.0011803309,0.0026734613,0.0025572195,0.0018935737,0.010356558],"category_scores_gemma":[0.0065765902,0.0005474464,0.0012736977,0.0017792315,0.0006912575,0.0036533321,0.0013893428,0.0012369716,0.0022609774],"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.00045831755,0.00054932764,0.003551605,0.0006789034,0.00016885952,0.0034894852,0.0011885092,0.3962123,0.010149407,0.20727548,0.038212825,0.33806494],"study_design_scores_gemma":[0.00014573029,0.000066554574,0.0005087268,0.00011979721,0.00012390128,0.0007708838,0.00012497384,0.89474475,0.004090026,0.042068563,0.05718069,0.000055292094],"about_ca_topic_score_codex":0.011165984,"about_ca_topic_score_gemma":0.011627534,"teacher_disagreement_score":0.011165984,"about_ca_system_score_codex":0.0018540969,"about_ca_system_score_gemma":0.0021639904,"threshold_uncertainty_score":0.034646094},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13188116,0.0045759412,0.8451707,0.002544991,0.00010320797,0.00008815925,0.00012802296,0.000536059,0.014971814],"genre_scores_gemma":[0.94434744,0.0007661664,0.05310599,0.00012743795,0.00009129171,0.000058988866,0.00008224514,0.0000606396,0.00135977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9886657,0.004893897,0.00093636627,0.001870653,0.003022846,0.0006105493],"domain_scores_gemma":[0.9505138,0.03685108,0.004624462,0.004036252,0.0029743607,0.0010000794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012793879,0.00066061557,0.001378148,0.002386755,0.0020372022,0.003736819,0.0020166864,0.0015707097,0.0017671603],"category_scores_gemma":[0.070664674,0.0011328236,0.0014166259,0.0021764548,0.0071918983,0.010187933,0.0045081684,0.00335175,0.00021421144],"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.00043934892,0.00006634296,0.0034915188,0.00056856405,0.00015409938,0.0009136258,0.003575702,0.13184799,0.0031311326,0.7764909,0.00087035145,0.07845036],"study_design_scores_gemma":[0.0000146507155,0.000040532632,0.0005263643,0.0000452,0.000040848157,0.00017738623,0.000120784636,0.15836203,0.0012114225,0.8377112,0.0017201096,0.000029449275],"about_ca_topic_score_codex":0.0041143093,"about_ca_topic_score_gemma":0.0023175043,"teacher_disagreement_score":0.012793879,"about_ca_system_score_codex":0.0030836686,"about_ca_system_score_gemma":0.0013986536,"threshold_uncertainty_score":0.067661345},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033235787,0.00052060955,0.9729503,0.00022074206,0.000047930007,0.000057096393,0.00018065909,0.0005574326,0.022141697],"genre_scores_gemma":[0.24545078,0.0015173536,0.73393995,0.00019472532,0.000094371855,0.00033796922,0.0007585961,0.0003511148,0.017355196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991073,0.0003494337,0.000049107217,0.00015892176,0.0002513744,0.00008378399],"domain_scores_gemma":[0.99948406,0.00032185152,0.000032244217,0.000089598536,0.000045929602,0.000026292828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010291194,0.0010209384,0.0011249176,0.0007283266,0.0005664048,0.0017495262,0.0016856029,0.0007802121,0.012813358],"category_scores_gemma":[0.0024615184,0.0009080275,0.0010807888,0.0021949648,0.00083953195,0.002869578,0.001830209,0.0022543513,0.002264319],"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.0001931739,0.00010619374,0.0001257226,0.000411393,0.000072354254,0.0000635922,0.000104602004,0.25852308,0.0020358332,0.48717535,0.012407529,0.23878114],"study_design_scores_gemma":[0.000045412606,0.00004328547,0.00006612639,0.00003765222,0.000023398397,0.000048953858,0.000018617968,0.3773231,0.0015884045,0.6127684,0.008018107,0.000018568124],"about_ca_topic_score_codex":0.0012739064,"about_ca_topic_score_gemma":0.0023774959,"teacher_disagreement_score":0.012813358,"about_ca_system_score_codex":0.0010433338,"about_ca_system_score_gemma":0.0010918264,"threshold_uncertainty_score":0.04286498},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15060888,0.00022962638,0.82609636,0.00043888995,0.00008389725,0.00043231578,0.00063738105,0.0075632134,0.013909425],"genre_scores_gemma":[0.5156292,0.00028862874,0.47697884,0.00008600398,0.000025786801,0.0002992551,0.0006528654,0.00039571789,0.0056436495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987006,0.000045997982,0.0000064331234,0.000030166817,0.000035308392,0.000012046691],"domain_scores_gemma":[0.99946815,0.0003467143,0.00003210124,0.00005725925,0.000052096126,0.000043819364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023130963,0.0006690469,0.00020484316,0.00016157214,0.0003724818,0.00035449245,0.0007257105,0.00075130386,0.008455344],"category_scores_gemma":[0.0010634308,0.00032236765,0.0003874667,0.000098820565,0.00032791862,0.00036339776,0.0005824996,0.00056432746,0.00060394587],"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.0011349771,0.00041799396,0.002028183,0.0006999367,0.00008471678,0.002771032,0.0022137072,0.45611545,0.23026139,0.009599878,0.012825763,0.28184703],"study_design_scores_gemma":[0.00015170824,0.0005323153,0.001852735,0.000062012645,0.000031274896,0.00060473813,0.0002705137,0.8954007,0.07289342,0.0032037634,0.024953077,0.000043809716],"about_ca_topic_score_codex":0.00288487,"about_ca_topic_score_gemma":0.005498607,"teacher_disagreement_score":0.008455344,"about_ca_system_score_codex":0.00032526522,"about_ca_system_score_gemma":0.00034214256,"threshold_uncertainty_score":0.02828592},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040282357,0.00018096047,0.9573217,0.0001615584,0.000015699577,0.00010726442,0.000117000345,0.00044077166,0.0013726318],"genre_scores_gemma":[0.66542965,0.00014497216,0.3334729,0.00006073476,0.000020024187,0.00009402496,0.00019480992,0.000011604338,0.0005713188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991177,0.00019602837,0.00009139765,0.00014933987,0.00037162096,0.00007401968],"domain_scores_gemma":[0.9981754,0.0011354155,0.00022400908,0.00015033149,0.0002692381,0.000045528268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012038316,0.00039952146,0.0004555069,0.0010732766,0.0005347642,0.0009557305,0.001064195,0.00063965825,0.0011488841],"category_scores_gemma":[0.0050902027,0.00023643342,0.0008012371,0.0006716116,0.0009644304,0.0009115609,0.0005036204,0.0006583365,0.00015574486],"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.00013344105,0.00010348616,0.0020489893,0.00013914102,0.000060467115,0.00043304724,0.00045345587,0.86112094,0.0060239052,0.030112598,0.00075733114,0.09861319],"study_design_scores_gemma":[0.000014579576,0.000018687013,0.00027047136,0.000009572122,0.000014493805,0.00002687319,0.000029316456,0.985327,0.0013751766,0.012548877,0.00035769818,0.000007202424],"about_ca_topic_score_codex":0.022888517,"about_ca_topic_score_gemma":0.017077472,"teacher_disagreement_score":0.022888517,"about_ca_system_score_codex":0.0013304917,"about_ca_system_score_gemma":0.0014973097,"threshold_uncertainty_score":0.04551059},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018969076,0.0006531412,0.8880701,0.001394773,0.00026788632,0.00012290209,0.00032624797,0.0007716116,0.106496386],"genre_scores_gemma":[0.23211837,0.0038436851,0.5966716,0.0017823676,0.0005957393,0.0009223902,0.0015993345,0.0006182238,0.16184832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922824,0.00018512979,0.00004532679,0.00019405708,0.00025151463,0.000095691335],"domain_scores_gemma":[0.9993412,0.00027694873,0.00004735676,0.000112108355,0.00016352821,0.000058805177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008071413,0.00070334447,0.00033393202,0.00046650312,0.00087420404,0.0024183863,0.001439437,0.00085302454,0.020947454],"category_scores_gemma":[0.0021874,0.00027544738,0.0005913501,0.0007077347,0.0013523941,0.0024446237,0.0014912566,0.0015576554,0.003398766],"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.000016896816,0.000015625656,0.00009125407,0.000073608186,0.0000086774035,0.00006260232,0.00007437443,0.011828384,0.00047958162,0.93905556,0.008879377,0.039414007],"study_design_scores_gemma":[0.00002168338,0.000020390797,0.00006241922,0.000072894014,0.000012554478,0.00014795011,0.000048998736,0.083425194,0.0014969246,0.73326945,0.18140692,0.000014551313],"about_ca_topic_score_codex":0.002234845,"about_ca_topic_score_gemma":0.0026633497,"teacher_disagreement_score":0.020947454,"about_ca_system_score_codex":0.0010404345,"about_ca_system_score_gemma":0.0012003165,"threshold_uncertainty_score":0.07007623},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068244957,0.005899634,0.80180806,0.0014517986,0.00047954798,0.0002570566,0.0010906801,0.014697417,0.1674913],"genre_scores_gemma":[0.07505208,0.0039082994,0.8353807,0.0004886317,0.00014529652,0.0004362183,0.0023853774,0.002400763,0.07980275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993728,0.00011002024,0.000041201205,0.0001389173,0.00028479306,0.00005220469],"domain_scores_gemma":[0.9996171,0.00015882477,0.000022505874,0.000105207386,0.000066805995,0.000029424158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065902615,0.0011157421,0.0004826107,0.0006119967,0.0005617649,0.0015587615,0.0016196773,0.000895198,0.02494912],"category_scores_gemma":[0.0015617983,0.0008639284,0.0008509353,0.0011343532,0.00062951405,0.0022061751,0.0014039102,0.0017403051,0.006726643],"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.00014688175,0.00008886206,0.00029524998,0.00047211055,0.000050737453,0.00011712266,0.000108240005,0.09140046,0.0044119274,0.14449033,0.082303286,0.6761148],"study_design_scores_gemma":[0.00015995021,0.00014428486,0.0003253411,0.00017361298,0.000044508415,0.00047372616,0.000050629867,0.24708055,0.012561003,0.22973585,0.5091954,0.00005519414],"about_ca_topic_score_codex":0.002809632,"about_ca_topic_score_gemma":0.0045049293,"teacher_disagreement_score":0.02494912,"about_ca_system_score_codex":0.0012617084,"about_ca_system_score_gemma":0.0019825243,"threshold_uncertainty_score":0.08346319},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049159455,0.00050698203,0.9949012,0.000576545,0.00004560304,0.00022220348,0.00014417377,0.000192024,0.0029197263],"genre_scores_gemma":[0.022104362,0.0006969313,0.9750564,0.00013197052,0.00004722516,0.00072997354,0.00022060577,0.000054917466,0.00095754245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97794956,0.013879515,0.0019884084,0.0010167793,0.0048492593,0.000316396],"domain_scores_gemma":[0.9468093,0.042391874,0.0027669435,0.0040439665,0.003643732,0.0003441504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026489435,0.0017682768,0.0011126715,0.0047405832,0.0016786491,0.0068627186,0.0033085067,0.0019930473,0.0071794167],"category_scores_gemma":[0.046534304,0.0012210831,0.0028215447,0.004132445,0.007823302,0.006881786,0.0037831296,0.0042370902,0.0019623057],"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.000049135226,0.00007493185,0.0003808672,0.001710536,0.00010323656,0.00035168466,0.0024705564,0.042764585,0.002014036,0.8656148,0.004522297,0.0799433],"study_design_scores_gemma":[0.00003304619,0.000032655556,0.00016833488,0.0005706928,0.000033802193,0.00016807244,0.0006413517,0.06358071,0.0017541115,0.8987688,0.034198545,0.00004992321],"about_ca_topic_score_codex":0.0038714574,"about_ca_topic_score_gemma":0.004081709,"teacher_disagreement_score":0.026489435,"about_ca_system_score_codex":0.0038195746,"about_ca_system_score_gemma":0.0046209525,"threshold_uncertainty_score":0.14009118},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026897639,0.000081513426,0.95130885,0.00053547235,0.000039626088,0.00086461817,0.00027815887,0.013691571,0.0063025113],"genre_scores_gemma":[0.15902594,0.00015184344,0.8348258,0.00020515129,0.000014845428,0.0008148335,0.0008549148,0.00063897396,0.0034676576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988403,0.00036820184,0.00011749464,0.00022578113,0.00036447935,0.000083754814],"domain_scores_gemma":[0.99677724,0.0018340942,0.00010428037,0.0004540966,0.0006234552,0.0002067599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025268472,0.0006438356,0.0006039439,0.0004712179,0.0006876503,0.0029494269,0.0045442563,0.0023347593,0.008562033],"category_scores_gemma":[0.008403512,0.00069478934,0.000813465,0.0003705683,0.0008195579,0.003373812,0.0013183829,0.0018606491,0.0019737864],"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.0016034408,0.002836202,0.0048091947,0.0027109375,0.00033084172,0.0044011255,0.009288389,0.2595667,0.13080993,0.09242443,0.02787207,0.46334672],"study_design_scores_gemma":[0.00035481626,0.000686296,0.00083252514,0.00028782606,0.00015055134,0.0009077225,0.00069101545,0.87442946,0.044595893,0.015520278,0.06145012,0.000093590956],"about_ca_topic_score_codex":0.004938489,"about_ca_topic_score_gemma":0.0034359596,"teacher_disagreement_score":0.008562033,"about_ca_system_score_codex":0.0010155917,"about_ca_system_score_gemma":0.0014184559,"threshold_uncertainty_score":0.028642833},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054745737,0.00009988683,0.99296653,0.00082135247,0.00003157285,0.00023896428,0.00003118036,0.00016196727,0.005101122],"genre_scores_gemma":[0.01864775,0.00018482906,0.9783992,0.0001971428,0.000027960847,0.00066868454,0.00007235477,0.000039875682,0.0017622809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9918937,0.003924823,0.0006304712,0.0010756418,0.0021657345,0.0003095315],"domain_scores_gemma":[0.9915216,0.0056910035,0.00048782333,0.0012710659,0.00073466694,0.0002937736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012896413,0.0017667606,0.0013089604,0.0036833894,0.0021736315,0.008219666,0.008925414,0.0041111982,0.008625124],"category_scores_gemma":[0.012187109,0.0014862799,0.0033142224,0.0019349055,0.010522054,0.007767552,0.0040782234,0.00544343,0.002041547],"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.00002247749,0.00008880411,0.00016424908,0.00021599031,0.000046389723,0.00038968623,0.0013265711,0.011302834,0.0011766972,0.9612039,0.0017666837,0.0222957],"study_design_scores_gemma":[0.00011263725,0.00007339098,0.00009933057,0.00025769894,0.000054840486,0.0005426263,0.00039428388,0.08898344,0.0015793684,0.85522556,0.052616805,0.000060077153],"about_ca_topic_score_codex":0.0046351356,"about_ca_topic_score_gemma":0.0059964885,"teacher_disagreement_score":0.012896413,"about_ca_system_score_codex":0.0030401107,"about_ca_system_score_gemma":0.004335553,"threshold_uncertainty_score":0.06820357},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028798321,0.00056516594,0.96278775,0.00067040493,0.00004122072,0.00020351076,0.00013456283,0.00062957994,0.006169481],"genre_scores_gemma":[0.6099049,0.0007701898,0.38118652,0.00025026384,0.0000656582,0.0003778844,0.00032752578,0.000079877565,0.0070371777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994006,0.00018067764,0.000055077035,0.00012847321,0.00019053648,0.000044695866],"domain_scores_gemma":[0.99841344,0.00088541064,0.00014687388,0.00025955366,0.00021625699,0.000078429905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015372722,0.00045852503,0.000703073,0.0012863091,0.0004598101,0.0016614927,0.0023902932,0.0010469476,0.004883568],"category_scores_gemma":[0.0057970057,0.00032367773,0.0006749549,0.0014747946,0.0010583255,0.0037024724,0.0012572902,0.00091276114,0.0006275899],"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.00033013764,0.00023743979,0.0026062967,0.00022774644,0.00012062058,0.00033833474,0.00043189919,0.45481881,0.0029222143,0.17817202,0.0036007238,0.3561938],"study_design_scores_gemma":[0.000018465624,0.00004385851,0.0002456555,0.000014109183,0.000027466192,0.00010372931,0.000027090988,0.9533547,0.0009820318,0.0434605,0.0017088264,0.000013582339],"about_ca_topic_score_codex":0.007117175,"about_ca_topic_score_gemma":0.0053246487,"teacher_disagreement_score":0.007117175,"about_ca_system_score_codex":0.0017297495,"about_ca_system_score_gemma":0.0010301503,"threshold_uncertainty_score":0.016337156},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019224094,0.23627867,0.47260955,0.1267189,0.016794847,0.0003110934,0.00024595318,0.0003717847,0.14474668],"genre_scores_gemma":[0.16857919,0.25156492,0.45266938,0.048588462,0.03878921,0.0013512346,0.0006371417,0.00029763218,0.0375229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930831,0.003969507,0.0005309563,0.000547875,0.0015879232,0.0002806487],"domain_scores_gemma":[0.9909127,0.0073184767,0.00037192172,0.000440175,0.0007989387,0.00015777667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009692448,0.0010523355,0.0013392996,0.0041029034,0.0011340821,0.0067718737,0.0045215585,0.0064519495,0.006847626],"category_scores_gemma":[0.01677608,0.0006314589,0.0014558752,0.003289721,0.01146309,0.008829335,0.0024975152,0.006063356,0.0022404694],"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.000013706918,0.000018537537,0.00008831535,0.0004906084,0.000027933753,0.00043384466,0.0005363132,0.002631899,0.00008133175,0.9211264,0.028090749,0.046460286],"study_design_scores_gemma":[0.000011964893,0.000011418255,0.00009266501,0.0007859508,0.000012631083,0.00050203037,0.00021531807,0.0026840516,0.00012931848,0.79380655,0.20172872,0.000019304658],"about_ca_topic_score_codex":0.0039843945,"about_ca_topic_score_gemma":0.003067443,"teacher_disagreement_score":0.009692448,"about_ca_system_score_codex":0.0044987383,"about_ca_system_score_gemma":0.002051254,"threshold_uncertainty_score":0.05125916},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015570146,0.000089983965,0.97929925,0.0004353287,0.000027507416,0.00011125989,0.0003542373,0.0011750687,0.0029372796],"genre_scores_gemma":[0.37902308,0.0002845796,0.61376154,0.00034596046,0.00004148045,0.0005759136,0.0012758084,0.00031099215,0.0043806303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975788,0.00073546416,0.00023223172,0.0004851458,0.00068620953,0.00028219784],"domain_scores_gemma":[0.9919253,0.0037303732,0.0005990763,0.002985679,0.0006025669,0.00015699092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002495665,0.00079078623,0.00067530555,0.00059019885,0.00068371865,0.001991515,0.0020049212,0.0009059897,0.004617819],"category_scores_gemma":[0.012119296,0.00069681683,0.002228464,0.00085868867,0.0022592065,0.004760723,0.0039276783,0.0034003737,0.00077301136],"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.00034472742,0.00015165158,0.0023609202,0.00065267505,0.00010895847,0.0005974732,0.0012758938,0.20686212,0.020428088,0.6498141,0.0058079828,0.11159537],"study_design_scores_gemma":[0.000050899496,0.00014197525,0.00035384766,0.00007199094,0.00007239729,0.00021104096,0.00014363388,0.29629564,0.01816293,0.66826683,0.016198652,0.000030179308],"about_ca_topic_score_codex":0.0019347693,"about_ca_topic_score_gemma":0.002212882,"teacher_disagreement_score":0.004617819,"about_ca_system_score_codex":0.0009327289,"about_ca_system_score_gemma":0.0015550805,"threshold_uncertainty_score":0.015448093},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027892653,0.0005443013,0.9141035,0.0012112275,0.00019198775,0.00037624902,0.0023787573,0.037136022,0.016165294],"genre_scores_gemma":[0.15384942,0.00052512425,0.82588404,0.0007167457,0.00013208177,0.00027373587,0.004618551,0.00030860218,0.013691708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962306,0.000046827077,0.00004033745,0.00011665606,0.00014585542,0.000027120437],"domain_scores_gemma":[0.9995097,0.00015140031,0.000047502264,0.000076593766,0.00014829183,0.00006638976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066210306,0.00042713276,0.00048642157,0.0007026065,0.00039335163,0.0010933909,0.0014416305,0.00086493534,0.007458214],"category_scores_gemma":[0.001564505,0.00024405171,0.00025296502,0.0006018161,0.00017157596,0.0023282387,0.00086514227,0.0008455221,0.002889558],"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.00049070665,0.00044635523,0.0034755915,0.00067336595,0.00008186669,0.0007824102,0.0004847414,0.011496272,0.049434524,0.012554102,0.06211867,0.8579614],"study_design_scores_gemma":[0.00028656947,0.00039723597,0.0047940644,0.00017625533,0.00017476658,0.002654513,0.00035991386,0.52184504,0.07432236,0.015129588,0.37974095,0.00011867619],"about_ca_topic_score_codex":0.0012835915,"about_ca_topic_score_gemma":0.0021683502,"teacher_disagreement_score":0.007458214,"about_ca_system_score_codex":0.0003925779,"about_ca_system_score_gemma":0.0008751258,"threshold_uncertainty_score":0.024950206},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008753002,0.00009606001,0.9857201,0.00014338092,0.000022299728,0.00006136008,0.00004185264,0.0006510003,0.0045109303],"genre_scores_gemma":[0.24582586,0.0002691956,0.7467241,0.0001232714,0.00002894158,0.00028193567,0.00016089003,0.00013014542,0.006455597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997764,0.00007193114,0.000017436696,0.000047387595,0.00006267237,0.000024128502],"domain_scores_gemma":[0.99953306,0.00026550802,0.000026986241,0.00003724133,0.00012387264,0.0000134104475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007011911,0.0004366814,0.00041504228,0.0004864863,0.0003567954,0.0007667614,0.0008482824,0.0008062484,0.0043235896],"category_scores_gemma":[0.0018546926,0.00044342427,0.00046585832,0.00046827452,0.00047211198,0.0013853743,0.0005655909,0.0010534353,0.00066496263],"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.000039912553,0.00003092046,0.0003484216,0.000059635997,0.000024174944,0.000024947762,0.00006777781,0.9069087,0.0020390006,0.018288251,0.00084942114,0.07131884],"study_design_scores_gemma":[0.000004300865,0.0000083694695,0.00004383332,0.0000042754773,0.0000037503903,0.0000042437673,0.00000704905,0.99410456,0.0007473174,0.004326476,0.00074274314,0.0000030874946],"about_ca_topic_score_codex":0.010237077,"about_ca_topic_score_gemma":0.012526234,"teacher_disagreement_score":0.010237077,"about_ca_system_score_codex":0.0009351755,"about_ca_system_score_gemma":0.0012384658,"threshold_uncertainty_score":0.020354986},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005010501,0.13470355,0.6163734,0.029725265,0.003692645,0.00011499237,0.00032514386,0.0013856931,0.20866881],"genre_scores_gemma":[0.33848262,0.17064714,0.3671751,0.007526567,0.0085720625,0.0007747286,0.0011077231,0.00067844265,0.10503554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983486,0.00076737785,0.00013950182,0.00018971611,0.00046957945,0.000085240135],"domain_scores_gemma":[0.9974865,0.0015474621,0.00009277718,0.00032377476,0.00044347375,0.0001059957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019391516,0.0010017735,0.0008695319,0.0017831968,0.00070502557,0.004020425,0.0010895411,0.0018530056,0.010711106],"category_scores_gemma":[0.0037321937,0.00032801277,0.0006333964,0.002470749,0.0042108106,0.0038740842,0.0016601313,0.0032115132,0.0025788832],"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.000009561605,0.000020132182,0.00015458885,0.00041809303,0.000023540768,0.00006500707,0.00028846425,0.0031468016,0.00056753546,0.91457945,0.011638682,0.06908805],"study_design_scores_gemma":[0.000010540129,0.000043611693,0.00017740544,0.00023972688,0.000009151329,0.00014450579,0.00019218138,0.0069843056,0.0003015924,0.73593664,0.25594926,0.000011056194],"about_ca_topic_score_codex":0.0019377283,"about_ca_topic_score_gemma":0.0012413048,"teacher_disagreement_score":0.010711106,"about_ca_system_score_codex":0.0015031685,"about_ca_system_score_gemma":0.0018221847,"threshold_uncertainty_score":0.035832226},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060523376,0.0007247113,0.9160752,0.00072889955,0.00016612212,0.00046439283,0.00040479147,0.002286022,0.018626438],"genre_scores_gemma":[0.24899246,0.00032668948,0.7410996,0.0005447757,0.00006862775,0.00047772855,0.00074862957,0.00026056453,0.0074808616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938,0.0001811577,0.00004587286,0.0001362263,0.00015681272,0.00009995799],"domain_scores_gemma":[0.99842095,0.00090606563,0.000112275695,0.0002484454,0.00024359382,0.00006868836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000822834,0.0008333661,0.00070871913,0.0008462842,0.0006544658,0.00080904056,0.0016373814,0.00091098086,0.0064831227],"category_scores_gemma":[0.0034676278,0.00039251315,0.0010469726,0.0012252143,0.00072983676,0.0019140127,0.001950395,0.0013827822,0.0009120587],"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.0003639775,0.0004379787,0.0025624398,0.0005518775,0.00011881432,0.00046117534,0.00031315317,0.2500034,0.017282778,0.051832974,0.015595059,0.6604764],"study_design_scores_gemma":[0.00010875547,0.00034758152,0.00065989426,0.00006143635,0.000070612674,0.00052454096,0.000120631186,0.91548306,0.008858732,0.052674845,0.021061955,0.000027948838],"about_ca_topic_score_codex":0.002276213,"about_ca_topic_score_gemma":0.003620641,"teacher_disagreement_score":0.0064831227,"about_ca_system_score_codex":0.00052218477,"about_ca_system_score_gemma":0.0016725123,"threshold_uncertainty_score":0.021688163},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004500531,0.000288166,0.96439713,0.00047760032,0.00012516101,0.0005757618,0.0006636274,0.015973043,0.012999088],"genre_scores_gemma":[0.06015072,0.00039308443,0.9293242,0.00022896465,0.000055044242,0.00076330174,0.0014079928,0.00025390115,0.0074228067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918693,0.00022924786,0.00012228405,0.00012367974,0.00029614553,0.000041729632],"domain_scores_gemma":[0.99870515,0.00065198715,0.00007505779,0.00019782412,0.000283543,0.00008642675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015650451,0.00074084615,0.00063061144,0.0016207364,0.0006198008,0.0016316226,0.0019894522,0.0017058412,0.017679865],"category_scores_gemma":[0.0059053306,0.0004622893,0.00051123084,0.0008552652,0.00036874128,0.0018629133,0.0011316561,0.001062315,0.0050844564],"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.00034329738,0.00049111294,0.001083433,0.0005023486,0.00010175265,0.0022216232,0.00050134835,0.0737634,0.01774482,0.049916957,0.08098174,0.77234817],"study_design_scores_gemma":[0.00038347798,0.00015882627,0.00085127767,0.00026265258,0.00012473909,0.0020115613,0.000142299,0.7606672,0.009599456,0.042258225,0.18341541,0.00012486477],"about_ca_topic_score_codex":0.0032415295,"about_ca_topic_score_gemma":0.0029913792,"teacher_disagreement_score":0.017679865,"about_ca_system_score_codex":0.0005869872,"about_ca_system_score_gemma":0.00096531387,"threshold_uncertainty_score":0.059145033},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0099231815,0.0005412515,0.9694658,0.00058546383,0.00013908955,0.0005249926,0.00049678143,0.008964523,0.0093589425],"genre_scores_gemma":[0.0744589,0.00026759098,0.9144616,0.00031298015,0.00008748349,0.00059260946,0.0014002651,0.0009425304,0.007476041],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973672,0.0006478047,0.000155922,0.0005563782,0.0009784629,0.00029431336],"domain_scores_gemma":[0.9964457,0.0017874333,0.00028325434,0.0008984934,0.0004844462,0.00010061915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002071762,0.0016535644,0.001361824,0.001852599,0.00084463274,0.0013771246,0.0032656344,0.0018111961,0.014394663],"category_scores_gemma":[0.00683668,0.0008208671,0.0020794144,0.0018730306,0.0016994091,0.0025651713,0.0026802705,0.0032034593,0.0027329894],"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.00062070985,0.0005695329,0.0014308534,0.00042463353,0.00010620779,0.00014892383,0.00028388953,0.18704352,0.004144203,0.032822628,0.0220947,0.75031024],"study_design_scores_gemma":[0.00031899379,0.0003193202,0.0008967586,0.00006863708,0.00010374568,0.00020435003,0.00007682173,0.92738706,0.005767551,0.03564635,0.02915209,0.000058355723],"about_ca_topic_score_codex":0.014098674,"about_ca_topic_score_gemma":0.017244918,"teacher_disagreement_score":0.014394663,"about_ca_system_score_codex":0.0016754662,"about_ca_system_score_gemma":0.0036767058,"threshold_uncertainty_score":0.04815495},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07411919,0.0005727779,0.8434717,0.0011262246,0.00023919008,0.00047327892,0.001869849,0.052772194,0.025355618],"genre_scores_gemma":[0.21962051,0.0002715105,0.77057034,0.00017326903,0.00003973969,0.00021849496,0.0020658476,0.0005964389,0.006443868],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983802,0.00042418018,0.00015538307,0.00038650236,0.00055957626,0.00009407416],"domain_scores_gemma":[0.9968766,0.0010676554,0.00028023066,0.0010090173,0.0006040203,0.00016244479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022882016,0.00079795165,0.0009269698,0.0016663673,0.0006769177,0.0021497665,0.0015344189,0.00068562396,0.004242093],"category_scores_gemma":[0.0069058486,0.00055986753,0.0006966813,0.001007107,0.0005308646,0.002110258,0.0028404181,0.00095358933,0.0015901604],"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.00084833935,0.00034107087,0.010148671,0.0004036837,0.00017649465,0.0013648834,0.0013893439,0.14733584,0.016985677,0.028473526,0.049102277,0.74343014],"study_design_scores_gemma":[0.00017358953,0.0001019916,0.0016216674,0.000054807773,0.000072556446,0.00032952646,0.00030588306,0.86969495,0.020135181,0.01115199,0.09629759,0.00006026395],"about_ca_topic_score_codex":0.00798325,"about_ca_topic_score_gemma":0.011996975,"teacher_disagreement_score":0.00798325,"about_ca_system_score_codex":0.0011004522,"about_ca_system_score_gemma":0.001844797,"threshold_uncertainty_score":0.015873551},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03842744,0.00087908783,0.9569362,0.00034591142,0.000049472106,0.00006051786,0.00011279376,0.0005586474,0.0026298957],"genre_scores_gemma":[0.6685583,0.0007887159,0.3261651,0.00021327144,0.000110169334,0.00046728845,0.0005562619,0.00021109817,0.0029298577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992518,0.00032418326,0.000053412678,0.00014258793,0.00014572353,0.00008234879],"domain_scores_gemma":[0.9891099,0.009537555,0.00034668721,0.00045587384,0.0003639434,0.00018604123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025434932,0.0011225583,0.0017425201,0.0016389786,0.00077985047,0.0017578271,0.0015750298,0.0018578167,0.003207684],"category_scores_gemma":[0.016218606,0.0012018763,0.00076252426,0.001459449,0.0017419485,0.0038874554,0.0017594896,0.002433722,0.0004201134],"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.00009795415,0.000069266745,0.00067410246,0.00013318016,0.000062757535,0.000059301026,0.00007414198,0.90868133,0.00029854637,0.028806705,0.0013245281,0.059718084],"study_design_scores_gemma":[0.000012945335,0.000010357304,0.00004522612,0.000008478422,0.0000062493905,0.000005677093,0.000008980467,0.9749067,0.00010840784,0.024700822,0.0001829474,0.0000031968054],"about_ca_topic_score_codex":0.0060477545,"about_ca_topic_score_gemma":0.0077219713,"teacher_disagreement_score":0.0060477545,"about_ca_system_score_codex":0.0019525404,"about_ca_system_score_gemma":0.0016887995,"threshold_uncertainty_score":0.014166772},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9739489,0.000060189046,0.01908057,0.00013303023,0.0000050878384,0.00008252554,0.000076761266,0.0005318749,0.0060810787],"genre_scores_gemma":[0.97256035,0.000051854684,0.026180685,0.000015520072,0.0000013856773,0.00003225616,0.0001626146,0.000028936085,0.0009665127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998104,0.00006942034,0.000008511761,0.000033514432,0.0000489199,0.000029397534],"domain_scores_gemma":[0.99947685,0.00023654869,0.000044067427,0.00008614697,0.0000832724,0.000073154864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048794132,0.00019839557,0.00022062653,0.00021971863,0.0004478035,0.00040409935,0.00042260217,0.00022510019,0.0008096741],"category_scores_gemma":[0.0014099549,0.00011703669,0.000118338794,0.00021186515,0.0004537178,0.0005398878,0.00040202125,0.00040973342,0.00012192786],"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.001765349,0.0013414866,0.053508602,0.00036733883,0.0000989303,0.0010115363,0.005498807,0.52355677,0.14432317,0.014497198,0.004542243,0.24948853],"study_design_scores_gemma":[0.00030024326,0.0008561466,0.03657315,0.000027335123,0.000062655396,0.00018389155,0.0027833208,0.89656824,0.04360714,0.005897184,0.013094971,0.000045800512],"about_ca_topic_score_codex":0.018686978,"about_ca_topic_score_gemma":0.029427487,"teacher_disagreement_score":0.018686978,"about_ca_system_score_codex":0.0006997185,"about_ca_system_score_gemma":0.00086598477,"threshold_uncertainty_score":0.037156403},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67068046,0.00085542165,0.24779214,0.00083793723,0.000997879,0.01578657,0.008234512,0.0027292345,0.052085835],"genre_scores_gemma":[0.80902666,0.000764121,0.10727928,0.0011018631,0.00029942763,0.04597746,0.010246443,0.0013357375,0.023968963],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940969,0.001470989,0.0007915746,0.001274794,0.0017084514,0.0006572047],"domain_scores_gemma":[0.9748111,0.011347317,0.0017784466,0.0068909614,0.004265682,0.00090653123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004234701,0.0014350058,0.00081768894,0.00091153046,0.0011938438,0.0012993693,0.0021558437,0.0015189159,0.023616666],"category_scores_gemma":[0.02975445,0.0006376034,0.00070616324,0.00079341826,0.0017310855,0.0015760927,0.0020348236,0.0024158577,0.00509504],"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.026747093,0.036464836,0.012847198,0.0055177324,0.00048891274,0.0005632575,0.0041564815,0.037385777,0.44355473,0.045640096,0.026466334,0.36016768],"study_design_scores_gemma":[0.005845208,0.10871873,0.07704149,0.0008059867,0.0011340119,0.0013568326,0.0028176229,0.09922865,0.41162872,0.112645335,0.1778793,0.0008981288],"about_ca_topic_score_codex":0.0010129624,"about_ca_topic_score_gemma":0.00095017353,"teacher_disagreement_score":0.023616666,"about_ca_system_score_codex":0.0010599191,"about_ca_system_score_gemma":0.0014441733,"threshold_uncertainty_score":0.07900566},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03971592,0.00054082146,0.91313004,0.00041041165,0.00009114315,0.00036319424,0.0009935062,0.036037542,0.008717348],"genre_scores_gemma":[0.1455543,0.00021285497,0.84937024,0.00018412949,0.000028200302,0.00024166876,0.001247275,0.00096967444,0.0021917173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919254,0.00021649656,0.000060573453,0.0001987749,0.00026544943,0.00006610496],"domain_scores_gemma":[0.9977308,0.0014995519,0.00013853333,0.00034168444,0.00021600178,0.0000734682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015043555,0.0012723488,0.0006737557,0.001064122,0.00045909602,0.0010169656,0.0016375553,0.00097150484,0.0069410405],"category_scores_gemma":[0.0062549203,0.00045538667,0.0007004981,0.000782357,0.0008984653,0.0021040235,0.0017757196,0.001109788,0.0012556363],"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.00040749324,0.0002420496,0.0023102118,0.00046870322,0.000055669287,0.00014728351,0.000268393,0.19084297,0.010279919,0.012257819,0.01977813,0.7629414],"study_design_scores_gemma":[0.00010022509,0.00017212097,0.0005459768,0.000039993174,0.000032250085,0.00009628777,0.000060346036,0.9649232,0.009903042,0.011757882,0.012338089,0.000030676933],"about_ca_topic_score_codex":0.009403066,"about_ca_topic_score_gemma":0.01429329,"teacher_disagreement_score":0.009403066,"about_ca_system_score_codex":0.0008221842,"about_ca_system_score_gemma":0.002589931,"threshold_uncertainty_score":0.023220122},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002384649,0.0012433942,0.94724035,0.0018444465,0.0003222598,0.00034377983,0.0009308307,0.0011841552,0.04450616],"genre_scores_gemma":[0.09308872,0.0031698628,0.85996133,0.0015384399,0.00037982402,0.0012097057,0.0042714947,0.00036487106,0.036015727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98935705,0.004204087,0.0015889362,0.0010000349,0.0031916278,0.00065833447],"domain_scores_gemma":[0.98996514,0.0043123183,0.000673432,0.0016606983,0.0030676972,0.00032072206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064292722,0.0012797633,0.0008701577,0.0019477708,0.0014064246,0.006287086,0.0035894748,0.0028829074,0.01207933],"category_scores_gemma":[0.01570637,0.0010532772,0.0016921954,0.0020336427,0.00259687,0.0053265207,0.0031970262,0.003274145,0.0056351954],"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.000022568187,0.000031665637,0.00017758331,0.0003764494,0.000027122558,0.00017050518,0.0005083375,0.0061032223,0.00094883004,0.9491031,0.010105462,0.032425124],"study_design_scores_gemma":[0.0000681544,0.00006163323,0.0001497207,0.00029289047,0.000038120765,0.00043446667,0.00033229598,0.028256949,0.0032879177,0.6717025,0.29533225,0.000042923202],"about_ca_topic_score_codex":0.0026059204,"about_ca_topic_score_gemma":0.0024956532,"teacher_disagreement_score":0.01207933,"about_ca_system_score_codex":0.0021261445,"about_ca_system_score_gemma":0.0037674068,"threshold_uncertainty_score":0.040409386},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05213757,0.0004684096,0.9369516,0.0022290656,0.0000633973,0.000080131606,0.00012899938,0.0007435815,0.007197173],"genre_scores_gemma":[0.6260109,0.0005964741,0.36963147,0.00035253947,0.00007701452,0.00019706166,0.00030499103,0.00027500535,0.0025544332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99506974,0.0022783896,0.00029430236,0.000494277,0.0014173466,0.00044600602],"domain_scores_gemma":[0.96117336,0.032094136,0.0008730079,0.004625458,0.0008952931,0.00033873488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047031646,0.00063581934,0.0013473103,0.000884405,0.0015369356,0.003232761,0.0025601792,0.0018726508,0.0058048433],"category_scores_gemma":[0.042637274,0.0011053602,0.0018795351,0.0016030379,0.0042593493,0.012449477,0.0056242994,0.0052913534,0.000519896],"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.00064190576,0.00012959293,0.0022293564,0.00055779313,0.00012539442,0.0002034542,0.00095928967,0.39773822,0.0026049241,0.41638228,0.0039681694,0.1744596],"study_design_scores_gemma":[0.00003364312,0.0000383477,0.00023819885,0.000036683836,0.0000442584,0.000054916974,0.00011625902,0.60115075,0.0013489993,0.395742,0.0011782009,0.000017772283],"about_ca_topic_score_codex":0.005814466,"about_ca_topic_score_gemma":0.006729329,"teacher_disagreement_score":0.005814466,"about_ca_system_score_codex":0.0014565609,"about_ca_system_score_gemma":0.0024293119,"threshold_uncertainty_score":0.024873018},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009529309,0.0023408644,0.8125058,0.0061666826,0.00035500329,0.00012271511,0.00026404008,0.0052978056,0.16341786],"genre_scores_gemma":[0.1104156,0.0053952774,0.7655486,0.0013193117,0.00022855579,0.00024115542,0.00081281905,0.0013056124,0.11473301],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991227,0.00041656714,0.000048960435,0.000095391864,0.00027197713,0.00004435677],"domain_scores_gemma":[0.9984409,0.0010508255,0.00002796208,0.00012851326,0.00021199147,0.00013981225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002676873,0.0006346097,0.00035202625,0.00056072307,0.001123361,0.0036685087,0.0011022987,0.0012616183,0.018738462],"category_scores_gemma":[0.0033243643,0.00044339657,0.00044104937,0.00085105,0.0031572927,0.0048244945,0.0014695752,0.0027038904,0.0035440405],"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.00028010498,0.00014615657,0.0010500597,0.00035636715,0.000027858106,0.0005687273,0.009011339,0.018391587,0.0069696456,0.43141434,0.08825888,0.443525],"study_design_scores_gemma":[0.00006298973,0.000088132685,0.0004502036,0.00017466689,0.00001455601,0.00058017933,0.001060231,0.06707754,0.0060148006,0.10400779,0.8204114,0.000057466685],"about_ca_topic_score_codex":0.008810247,"about_ca_topic_score_gemma":0.013470462,"teacher_disagreement_score":0.018738462,"about_ca_system_score_codex":0.0015461097,"about_ca_system_score_gemma":0.0010284407,"threshold_uncertainty_score":0.06268638},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31102496,0.0016937479,0.65493304,0.001331505,0.00030882467,0.0001563551,0.003064667,0.011305757,0.016181266],"genre_scores_gemma":[0.7946901,0.00044449797,0.20004958,0.0001202105,0.00004837583,0.00021275769,0.0017836915,0.0005318534,0.0021189004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794775,0.00042102364,0.00008559864,0.0005165794,0.00075801596,0.0002710179],"domain_scores_gemma":[0.9883406,0.0071239853,0.0005297619,0.0019899283,0.001652691,0.00036308804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028206715,0.0012278295,0.0009634657,0.00130379,0.0007894548,0.001703123,0.0021621266,0.0014782815,0.002808884],"category_scores_gemma":[0.01830455,0.00077964616,0.00064690295,0.0010667177,0.00068665185,0.0027566315,0.0012127581,0.0029530216,0.001563854],"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.00034533744,0.00012641687,0.008285025,0.00014275649,0.000046554625,0.00006575731,0.00011485692,0.8947423,0.0064510396,0.011072942,0.0075531607,0.071054],"study_design_scores_gemma":[0.00000783765,0.000015310481,0.00055488606,0.000005848877,0.0000031141044,0.00000907289,0.000012901549,0.99317825,0.0027415163,0.0029354438,0.0005279454,0.000007830292],"about_ca_topic_score_codex":0.012533431,"about_ca_topic_score_gemma":0.010352839,"teacher_disagreement_score":0.012533431,"about_ca_system_score_codex":0.0022510889,"about_ca_system_score_gemma":0.0024111257,"threshold_uncertainty_score":0.02492094},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011545311,0.00011433685,0.9926676,0.00038575148,0.000034563094,0.00021185106,0.00018919651,0.0023227425,0.0029194306],"genre_scores_gemma":[0.023260677,0.00016456352,0.974175,0.0001224384,0.000021848215,0.00020360242,0.0005797096,0.00011063677,0.0013615442],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966276,0.0009969958,0.00046787653,0.0005190473,0.0011805737,0.00020788622],"domain_scores_gemma":[0.99626863,0.0019661132,0.00028813744,0.00076525414,0.00052558945,0.00018637787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056472905,0.0013322777,0.0007553221,0.003375855,0.0014588749,0.004014722,0.004048481,0.0020000536,0.0076190643],"category_scores_gemma":[0.01081547,0.0010399465,0.002103284,0.0018239277,0.0017442511,0.003774235,0.002262837,0.0021324027,0.0019044582],"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.00016564799,0.0007514111,0.0020053943,0.000721562,0.0002309344,0.002017364,0.0016501691,0.16001458,0.008112354,0.35470545,0.03383867,0.43578643],"study_design_scores_gemma":[0.00016826378,0.000088940484,0.00043466318,0.0002876829,0.00024318487,0.0013396858,0.0003042627,0.64689237,0.010700212,0.22095636,0.11846791,0.00011644171],"about_ca_topic_score_codex":0.010342712,"about_ca_topic_score_gemma":0.011728976,"teacher_disagreement_score":0.010342712,"about_ca_system_score_codex":0.0015363108,"about_ca_system_score_gemma":0.0024256122,"threshold_uncertainty_score":0.02986604},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028559554,0.00041536294,0.9580026,0.0005949961,0.0002778546,0.00012441508,0.00057967386,0.018897599,0.018251529],"genre_scores_gemma":[0.06740778,0.00093806186,0.9011293,0.00085915317,0.00018770811,0.0004522575,0.0024190522,0.008102749,0.018503953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991817,0.00023072341,0.00007461816,0.00019747356,0.00024157594,0.000073975505],"domain_scores_gemma":[0.9983942,0.00078920857,0.00011453392,0.00042221136,0.00021270855,0.00006714762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015234845,0.0009402416,0.00040563525,0.001216629,0.00075203914,0.0024573817,0.0010025396,0.0008445035,0.013020883],"category_scores_gemma":[0.004374683,0.00079901767,0.0014426612,0.0008403503,0.0019735761,0.0029478567,0.0023292666,0.0026438057,0.0038827902],"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.00018725097,0.00008134583,0.0009245233,0.00074431207,0.000071406306,0.00045303133,0.0008534642,0.024727575,0.0069366,0.6566938,0.049948394,0.25837833],"study_design_scores_gemma":[0.00008481935,0.00010315325,0.000557411,0.0004201693,0.0000942072,0.0006123405,0.00022650538,0.12643947,0.022865433,0.34324056,0.5052812,0.00007477554],"about_ca_topic_score_codex":0.002595375,"about_ca_topic_score_gemma":0.0033501703,"teacher_disagreement_score":0.013020883,"about_ca_system_score_codex":0.0009106185,"about_ca_system_score_gemma":0.0021608274,"threshold_uncertainty_score":0.043559134},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022466494,0.00014005168,0.95497227,0.00015639205,0.000025463456,0.00041527356,0.0008549606,0.009734354,0.011234709],"genre_scores_gemma":[0.10852739,0.00020904178,0.8739427,0.00014081686,0.000009673196,0.00027965996,0.002722816,0.0005107654,0.013657171],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992539,0.00009251762,0.00006396553,0.00022649522,0.00029833938,0.000064722306],"domain_scores_gemma":[0.9987558,0.0004215221,0.00008184697,0.0004115632,0.00022532196,0.000104052626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006722429,0.0005335944,0.0005242572,0.00076209597,0.0006727371,0.0018064041,0.001731472,0.0007831006,0.007363239],"category_scores_gemma":[0.0028806385,0.00072066835,0.00056632515,0.00068825996,0.00084257656,0.0020986241,0.0018928283,0.0010063061,0.0025683101],"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.0004146326,0.0005502152,0.0038283342,0.00074591313,0.000121669305,0.0013776792,0.001931471,0.119385585,0.054787293,0.058961056,0.023804761,0.73409134],"study_design_scores_gemma":[0.00016247653,0.00043103535,0.0031698602,0.00017594578,0.00018820881,0.0013384586,0.00056340673,0.63720435,0.06858856,0.04740971,0.24064676,0.00012114057],"about_ca_topic_score_codex":0.0055354564,"about_ca_topic_score_gemma":0.010522575,"teacher_disagreement_score":0.007363239,"about_ca_system_score_codex":0.0007873778,"about_ca_system_score_gemma":0.0024044036,"threshold_uncertainty_score":0.024632454},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005928273,0.00051338103,0.97367686,0.0024340432,0.000119772616,0.00017398567,0.0004827807,0.0006484718,0.016022433],"genre_scores_gemma":[0.23006396,0.0016510197,0.75534904,0.0009405307,0.00024410321,0.0005586233,0.0020939426,0.00027402423,0.008824752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99672216,0.0011182762,0.0002598653,0.00058637647,0.0010826968,0.00023066043],"domain_scores_gemma":[0.99590683,0.0027068953,0.00031286516,0.0005538823,0.00035147837,0.0001679627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002989757,0.0014338769,0.0011191266,0.0019450957,0.0023138158,0.005226476,0.0035584085,0.0034452376,0.009364637],"category_scores_gemma":[0.0092608705,0.0009953452,0.004569331,0.0018233949,0.0036128997,0.0087140035,0.0032648847,0.003988242,0.001654588],"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.000055147695,0.00007709151,0.00055215403,0.00028596487,0.000087366454,0.00054731197,0.00047318378,0.13362238,0.0011889159,0.8375615,0.00331421,0.0222347],"study_design_scores_gemma":[0.00004659019,0.000034273013,0.00010739473,0.00008930548,0.000055962315,0.00023420106,0.00016318807,0.22561528,0.0016932493,0.74551815,0.026411327,0.000031093972],"about_ca_topic_score_codex":0.010630517,"about_ca_topic_score_gemma":0.007486177,"teacher_disagreement_score":0.010630517,"about_ca_system_score_codex":0.0027874638,"about_ca_system_score_gemma":0.0024559374,"threshold_uncertainty_score":0.031327844},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020838527,0.000121689925,0.9594087,0.00051739503,0.000059491882,0.0002624955,0.00014222883,0.009701629,0.008947871],"genre_scores_gemma":[0.24431637,0.0001536205,0.7436202,0.00055165135,0.00004152121,0.00028296473,0.00044329435,0.00050105684,0.010089256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975924,0.00096195354,0.00010948781,0.0004539293,0.0007489791,0.00013325372],"domain_scores_gemma":[0.9953002,0.0029277413,0.00029145836,0.0008245376,0.00050561124,0.00015052965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002745591,0.00067336793,0.00054875715,0.000876575,0.00045501697,0.0011140556,0.0014913531,0.00087893225,0.01001645],"category_scores_gemma":[0.00962339,0.00033759556,0.00071379263,0.00041041244,0.0013089803,0.0023371251,0.0024418335,0.0011888931,0.0024325636],"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.00077436905,0.00042066234,0.0016847047,0.00039718428,0.000096798394,0.0006863671,0.0015846589,0.06843312,0.05266636,0.11703664,0.021090582,0.7351286],"study_design_scores_gemma":[0.0003410756,0.0004565241,0.0010544613,0.00009377085,0.00009070068,0.00090340065,0.00027479083,0.695528,0.06798357,0.14545918,0.08767817,0.00013634484],"about_ca_topic_score_codex":0.0007836355,"about_ca_topic_score_gemma":0.0010221213,"teacher_disagreement_score":0.01001645,"about_ca_system_score_codex":0.0006849422,"about_ca_system_score_gemma":0.0009338915,"threshold_uncertainty_score":0.03350836},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019390568,0.0006113236,0.94728786,0.0027242238,0.00029138778,0.0008541312,0.0016469653,0.0041431244,0.023050435],"genre_scores_gemma":[0.3187343,0.0010674705,0.66490483,0.0007623959,0.00013504579,0.0009778683,0.0042683496,0.00014672088,0.009003079],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984915,0.00026515318,0.00028222852,0.00040063693,0.00043677905,0.00012365637],"domain_scores_gemma":[0.99799263,0.0009798864,0.00018878645,0.000202678,0.00053859304,0.00009740887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017851398,0.0010740975,0.000854699,0.0037251934,0.0012270205,0.00384855,0.0030078897,0.0019340061,0.008410158],"category_scores_gemma":[0.006683202,0.0005233799,0.00232635,0.0018647921,0.0009995379,0.00420661,0.0016668387,0.0011164496,0.0015732461],"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.000464147,0.00067021564,0.011115916,0.0011834332,0.00036716033,0.0036603457,0.0013664186,0.34200475,0.005191415,0.2222815,0.028975284,0.38271946],"study_design_scores_gemma":[0.00011096316,0.000072036186,0.0007789719,0.000202544,0.00024825326,0.00091146945,0.00023395882,0.8807309,0.0031393615,0.091411754,0.022094926,0.00006478229],"about_ca_topic_score_codex":0.013476699,"about_ca_topic_score_gemma":0.0105810715,"teacher_disagreement_score":0.013476699,"about_ca_system_score_codex":0.002140516,"about_ca_system_score_gemma":0.004031369,"threshold_uncertainty_score":0.028134763},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07832286,0.00044616454,0.91240454,0.00028683763,0.000028231727,0.00016885083,0.00040272105,0.0020499968,0.0058897855],"genre_scores_gemma":[0.6861971,0.00024461007,0.31041816,0.00008777246,0.000025245461,0.00011961075,0.0007024345,0.00008064876,0.00212443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998953,0.0001955877,0.00005865141,0.0002512143,0.00040505073,0.00013643417],"domain_scores_gemma":[0.99810094,0.0009899491,0.00022673585,0.00032811152,0.00028310672,0.000071189825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060299947,0.0005053576,0.00052852696,0.001271849,0.00067732687,0.0007730489,0.0010427341,0.0005136521,0.0029140953],"category_scores_gemma":[0.0036616623,0.00034851988,0.00072430755,0.0009873441,0.0013650267,0.0013628062,0.0011841592,0.00069727283,0.0003129871],"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.00034702301,0.000120495424,0.005742447,0.0005515473,0.00009377055,0.0006340018,0.00074718456,0.5283838,0.03631032,0.19900386,0.0030952368,0.22497031],"study_design_scores_gemma":[0.000045046116,0.00008405007,0.0014162555,0.00003400467,0.000047817677,0.000117510106,0.00009325943,0.8332207,0.012471804,0.14762512,0.0048239166,0.000020571266],"about_ca_topic_score_codex":0.01133053,"about_ca_topic_score_gemma":0.016408302,"teacher_disagreement_score":0.01133053,"about_ca_system_score_codex":0.0018842616,"about_ca_system_score_gemma":0.0016350766,"threshold_uncertainty_score":0.022529185},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011647005,0.000389045,0.96196645,0.00047400553,0.00014563248,0.00019496665,0.000218057,0.015375983,0.02007111],"genre_scores_gemma":[0.053490393,0.0013896724,0.9131222,0.0005449005,0.00024204569,0.0011165506,0.002481839,0.0025932854,0.025019055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973537,0.0005044545,0.0003113867,0.00039994973,0.0011537,0.00027679544],"domain_scores_gemma":[0.9979353,0.0005230931,0.00013120098,0.00053499354,0.00066805544,0.00020731187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022191056,0.0010358025,0.00095500285,0.0015743797,0.0009379802,0.004781043,0.003337735,0.002300562,0.01255752],"category_scores_gemma":[0.005771339,0.0009559136,0.0010650707,0.0015933659,0.0017061399,0.004282651,0.0027738265,0.0028091604,0.008592291],"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.0002302018,0.00020276876,0.0008801517,0.0006518097,0.000112463014,0.00038774882,0.0008098445,0.06516437,0.008513517,0.5896439,0.05989628,0.27350697],"study_design_scores_gemma":[0.00019860215,0.00017372514,0.0004456755,0.0002484532,0.00009710374,0.00044720658,0.000103870065,0.23138958,0.0077806814,0.22010185,0.538911,0.0001023032],"about_ca_topic_score_codex":0.0029911676,"about_ca_topic_score_gemma":0.0017529107,"teacher_disagreement_score":0.01255752,"about_ca_system_score_codex":0.00095603656,"about_ca_system_score_gemma":0.0026667567,"threshold_uncertainty_score":0.042009056},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002464785,0.0050706742,0.95756626,0.003479733,0.00038070825,0.00027784618,0.00020444582,0.00041250148,0.03014307],"genre_scores_gemma":[0.22592737,0.012863042,0.737403,0.0011742364,0.0011954223,0.0016172273,0.0005247418,0.00011590115,0.019179087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710554,0.0014885509,0.00018883302,0.0004138282,0.00066085556,0.0001422829],"domain_scores_gemma":[0.9980634,0.0012012413,0.00014785417,0.00012991996,0.00034747305,0.00011018554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002461324,0.0015916881,0.0013170701,0.0025718035,0.0013608076,0.0049594394,0.0026594023,0.0027380928,0.007913283],"category_scores_gemma":[0.0035149623,0.0005088654,0.0015011737,0.00275972,0.0030499264,0.0036129085,0.002806413,0.0029297515,0.0011165177],"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.00002121817,0.000057510762,0.00071014586,0.00036658757,0.00016947693,0.0002481951,0.00060847687,0.086094506,0.00068710267,0.8741257,0.0044644666,0.032446485],"study_design_scores_gemma":[0.00003887953,0.00014480781,0.00036888648,0.00021203155,0.00008407018,0.00023592124,0.0005192361,0.25716984,0.00035717103,0.6560269,0.08478836,0.00005389674],"about_ca_topic_score_codex":0.0052693635,"about_ca_topic_score_gemma":0.004541511,"teacher_disagreement_score":0.007913283,"about_ca_system_score_codex":0.0032994887,"about_ca_system_score_gemma":0.0033496416,"threshold_uncertainty_score":0.026472569},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028931966,0.00012064787,0.9659493,0.00008166153,0.00001262979,0.00007806828,0.00006148044,0.0014641512,0.0033001213],"genre_scores_gemma":[0.45226923,0.00021266141,0.54463583,0.00004570373,0.000010529446,0.000158841,0.00025219726,0.00015174995,0.0022633243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929833,0.00017951019,0.000046323537,0.00015247361,0.00022588877,0.00009743394],"domain_scores_gemma":[0.9984676,0.0005293519,0.00012213939,0.00064723747,0.00014261047,0.00009099129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009865866,0.00078479125,0.0007928647,0.0008367905,0.0005760907,0.0008334276,0.0015247514,0.000561441,0.0018275593],"category_scores_gemma":[0.0032256963,0.000605335,0.0013013788,0.00084838626,0.0014359814,0.0020256185,0.0035466922,0.0012389914,0.00042481293],"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.0002106052,0.00009278572,0.0017579974,0.00020545734,0.00011578322,0.0002468961,0.00059521565,0.7042098,0.014691631,0.08447876,0.0013462398,0.19204888],"study_design_scores_gemma":[0.00003539828,0.00008834826,0.00033227185,0.000017304605,0.00003063875,0.00008834607,0.00006960016,0.942738,0.0043217144,0.04852608,0.0037318254,0.000020486796],"about_ca_topic_score_codex":0.009550802,"about_ca_topic_score_gemma":0.010277154,"teacher_disagreement_score":0.009550802,"about_ca_system_score_codex":0.0007022657,"about_ca_system_score_gemma":0.0015208205,"threshold_uncertainty_score":0.018990457},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02947275,0.0007525943,0.9577568,0.0006789235,0.00007484483,0.00034106692,0.00046759733,0.0029191438,0.007536307],"genre_scores_gemma":[0.28120518,0.0010122536,0.70997673,0.0004085173,0.000086256805,0.0004490902,0.002240469,0.00030251037,0.004318982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745053,0.0010496189,0.00018809372,0.0006277449,0.00054813985,0.00013586647],"domain_scores_gemma":[0.9912827,0.0065033366,0.0003890279,0.0009304723,0.00075727777,0.00013728644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023250675,0.00093667314,0.00087405613,0.00095775,0.0005026466,0.0013103923,0.0018752151,0.0011485608,0.0041819876],"category_scores_gemma":[0.018423628,0.00068819243,0.0012182229,0.00071425806,0.0010390591,0.0022954077,0.0012623264,0.002234188,0.0012339947],"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.00013878307,0.00036843587,0.0045369505,0.00057553506,0.00020091624,0.0003388096,0.0006475199,0.228762,0.006872532,0.05193386,0.0092539,0.6963707],"study_design_scores_gemma":[0.00009934603,0.00015042491,0.000769058,0.00010564927,0.00010824207,0.00018921153,0.00016933838,0.8901442,0.010858259,0.08477485,0.012589346,0.000042049673],"about_ca_topic_score_codex":0.0026959518,"about_ca_topic_score_gemma":0.00568632,"teacher_disagreement_score":0.0041819876,"about_ca_system_score_codex":0.0008833303,"about_ca_system_score_gemma":0.0016274011,"threshold_uncertainty_score":0.013990104},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023597386,0.00008375115,0.9610419,0.0005044509,0.000028022265,0.0000993487,0.0000252303,0.0011511453,0.013468839],"genre_scores_gemma":[0.40904674,0.00017597091,0.58027786,0.00017971409,0.000024597985,0.00023632753,0.00009452563,0.00013284716,0.009831465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997155,0.00009085444,0.000013581709,0.00006269497,0.000089432906,0.000027910253],"domain_scores_gemma":[0.9996499,0.00012456464,0.000038260438,0.000058304933,0.000074826974,0.000054101783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007228085,0.00037435052,0.00018128184,0.00032907078,0.0005207319,0.00087941973,0.0010936861,0.0005272753,0.0031477085],"category_scores_gemma":[0.0011097487,0.0003578748,0.00034325436,0.00025778954,0.0013176723,0.001379829,0.00086787227,0.0008324245,0.000534606],"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.00016379975,0.00022579846,0.0016109803,0.00023712587,0.00007111117,0.00037078277,0.0014632577,0.33949146,0.05900096,0.47943276,0.0025639066,0.1153681],"study_design_scores_gemma":[0.000038611273,0.000094675386,0.0004775207,0.000028800903,0.00003833638,0.000063975276,0.000105624575,0.8579859,0.009494732,0.118568145,0.013076415,0.000027285652],"about_ca_topic_score_codex":0.0036202199,"about_ca_topic_score_gemma":0.004640183,"teacher_disagreement_score":0.0036202199,"about_ca_system_score_codex":0.00076074235,"about_ca_system_score_gemma":0.0013210311,"threshold_uncertainty_score":0.010530174},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028817277,0.00013750697,0.96861625,0.00012891421,0.000014431255,0.000032290387,0.000059599854,0.00083980366,0.0013539804],"genre_scores_gemma":[0.89624465,0.000107266,0.1024285,0.000032688087,0.000010501242,0.00006234744,0.00014126957,0.000025213596,0.0009476728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974185,0.00005108382,0.000015893484,0.00005486665,0.000096721014,0.000039619266],"domain_scores_gemma":[0.999608,0.00016901077,0.000080011945,0.000046665256,0.000076750766,0.000019693922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004000636,0.00043349818,0.00062273716,0.00051985856,0.0003754987,0.000640904,0.00074009923,0.00045888883,0.0011133469],"category_scores_gemma":[0.0015629118,0.00022132944,0.00054507266,0.0003001132,0.0005124877,0.0006247435,0.00058207865,0.00054039696,0.00015891888],"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.00003948496,0.000019609877,0.0003851947,0.000034618097,0.0000137173065,0.000045720997,0.000059571004,0.9694029,0.0018462028,0.0062593226,0.00032416423,0.021569476],"study_design_scores_gemma":[0.000003940305,0.0000067380106,0.000051548755,0.000001399591,0.000002656661,0.0000039467354,0.0000041553744,0.9975726,0.00027086766,0.0019557457,0.00012514796,0.0000012588387],"about_ca_topic_score_codex":0.018011145,"about_ca_topic_score_gemma":0.016127393,"teacher_disagreement_score":0.018011145,"about_ca_system_score_codex":0.0011561888,"about_ca_system_score_gemma":0.001086778,"threshold_uncertainty_score":0.035812616},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047453362,0.00031828284,0.99551755,0.000331507,0.00004130783,0.000049653903,0.00009571323,0.0003415611,0.0028298202],"genre_scores_gemma":[0.09173772,0.0015867773,0.90155405,0.00044336735,0.00016347528,0.00046846658,0.0007374134,0.00032080675,0.0029879503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973115,0.0009152886,0.00018702511,0.00031199717,0.0011252553,0.00014893632],"domain_scores_gemma":[0.99541426,0.0024234233,0.0002841315,0.0013136779,0.0004770202,0.00008754399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003136405,0.0012366369,0.0010451927,0.0017542455,0.0009389709,0.0027224545,0.0019513004,0.0009827244,0.0075600487],"category_scores_gemma":[0.010007776,0.000689083,0.0018960075,0.0015144243,0.0028918104,0.0048153773,0.0042562396,0.0042340797,0.0019042259],"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.00003779624,0.000029431136,0.00023366105,0.00046431794,0.000045616885,0.00024081148,0.0004416951,0.04801808,0.003116601,0.8755149,0.0046784002,0.067178674],"study_design_scores_gemma":[0.000019428026,0.000028698936,0.000087071196,0.0001757116,0.00003615634,0.00016104011,0.00013596924,0.14175771,0.0032098033,0.8110823,0.043280844,0.000025219777],"about_ca_topic_score_codex":0.0022946172,"about_ca_topic_score_gemma":0.0017728346,"teacher_disagreement_score":0.0075600487,"about_ca_system_score_codex":0.0016954286,"about_ca_system_score_gemma":0.002082072,"threshold_uncertainty_score":0.025290847},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013567818,0.0005140911,0.9127922,0.0013553902,0.0001818466,0.0014415828,0.005135312,0.048649542,0.016362175],"genre_scores_gemma":[0.16462457,0.0006516983,0.8145132,0.00061145774,0.00008564139,0.0012999885,0.009528668,0.0005307899,0.008153956],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981311,0.00031944484,0.0004179909,0.00041351555,0.00060007715,0.00011785985],"domain_scores_gemma":[0.997003,0.0014544006,0.00023428148,0.00041920342,0.0006981492,0.00019102507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023431713,0.0012213332,0.0011779054,0.0028040772,0.001192685,0.0042662146,0.004026978,0.0025336733,0.019313358],"category_scores_gemma":[0.0063886116,0.0008454448,0.0016066686,0.0017185002,0.00064827624,0.002667406,0.0020573903,0.0012507264,0.00675522],"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.0012247209,0.0012347704,0.0037747812,0.0017278864,0.00032063675,0.003596673,0.0008401673,0.19361515,0.01883469,0.039278943,0.06151927,0.67403233],"study_design_scores_gemma":[0.00046904528,0.00014875668,0.00084791135,0.00021361717,0.00017070447,0.00072797755,0.00020942392,0.8891618,0.009399797,0.024926113,0.073614456,0.00011041581],"about_ca_topic_score_codex":0.010225643,"about_ca_topic_score_gemma":0.0053622224,"teacher_disagreement_score":0.019313358,"about_ca_system_score_codex":0.0017876687,"about_ca_system_score_gemma":0.0022329648,"threshold_uncertainty_score":0.06460965},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029689241,0.0021412019,0.9601682,0.003279612,0.00021078046,0.00005030448,0.00014239152,0.0004112988,0.030627398],"genre_scores_gemma":[0.5297533,0.0050231037,0.43933758,0.0022185526,0.0005603242,0.0005679356,0.00049066526,0.0004010066,0.021647535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911696,0.00034708861,0.000052787967,0.00010703748,0.00030054606,0.00007562241],"domain_scores_gemma":[0.9979899,0.0012792251,0.00016983176,0.00031836776,0.00016731632,0.000075383025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013815949,0.00059980334,0.00045208028,0.0011201506,0.00109418,0.0025294637,0.0016221954,0.0017902658,0.0068043345],"category_scores_gemma":[0.0041560484,0.0007312926,0.0015931687,0.0010000037,0.0067258524,0.0052811084,0.0019052268,0.002769743,0.0011079335],"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.0000085236225,0.000011932163,0.000079929385,0.000096669566,0.000008443235,0.000048950475,0.00014640305,0.011882483,0.00056450296,0.9771642,0.0011945143,0.008793512],"study_design_scores_gemma":[0.0000046223563,0.0000075072912,0.000049861166,0.000029171373,0.0000041936987,0.00002819454,0.000037967155,0.022630863,0.00043655277,0.9684286,0.008333986,0.000008541507],"about_ca_topic_score_codex":0.0037023122,"about_ca_topic_score_gemma":0.0027949947,"teacher_disagreement_score":0.0068043345,"about_ca_system_score_codex":0.0038121825,"about_ca_system_score_gemma":0.0014255112,"threshold_uncertainty_score":0.027659416},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026821487,0.000289467,0.9652892,0.0002450074,0.00006264326,0.00019830295,0.000038900307,0.0019682134,0.0050868536],"genre_scores_gemma":[0.44573274,0.00016127499,0.55100113,0.00027899243,0.00005052751,0.00054610264,0.000111668676,0.0005056694,0.0016118835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780923,0.0009827878,0.00016464682,0.0004767709,0.00037785145,0.0001887424],"domain_scores_gemma":[0.99344915,0.0031917316,0.00051908765,0.002155022,0.00046193434,0.00022300224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033687635,0.0014829618,0.0018468896,0.0009278676,0.00090612104,0.0017463879,0.0030161822,0.0018180626,0.0040664864],"category_scores_gemma":[0.019594638,0.0010196029,0.0009258915,0.0013054785,0.001798553,0.0038318262,0.0027736523,0.003310641,0.0012072386],"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.00048312356,0.00043971138,0.0025336253,0.00029287196,0.00019414227,0.00019213773,0.00033305385,0.73931944,0.015147383,0.03807653,0.0034674373,0.19952062],"study_design_scores_gemma":[0.00012829024,0.00017711923,0.00025429245,0.00003159092,0.00003636755,0.000079543344,0.000050385857,0.9568755,0.005095391,0.034365963,0.0028680975,0.000037463666],"about_ca_topic_score_codex":0.0017556043,"about_ca_topic_score_gemma":0.0025257706,"teacher_disagreement_score":0.0040664864,"about_ca_system_score_codex":0.00079006585,"about_ca_system_score_gemma":0.0018978664,"threshold_uncertainty_score":0.017815948},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0095477365,0.00055997336,0.98099315,0.0010893074,0.00007747042,0.00017725953,0.00006781111,0.00043835558,0.0070489305],"genre_scores_gemma":[0.33775148,0.0013580663,0.65826905,0.00021177504,0.000073872034,0.00036326345,0.00019825312,0.00006128606,0.0017130426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807227,0.0007396342,0.00017918191,0.00018662024,0.00068143365,0.00014091311],"domain_scores_gemma":[0.99696785,0.0021286237,0.00019762167,0.00029277313,0.00028485135,0.00012828449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027181623,0.00087432476,0.00088473153,0.0018078224,0.001044573,0.0030776002,0.0025219352,0.002010566,0.0028585992],"category_scores_gemma":[0.008595175,0.00084087095,0.00095366203,0.001617834,0.002055166,0.005336251,0.0021621932,0.0020141427,0.00058507576],"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.00009379699,0.00019390293,0.0015670595,0.00031602703,0.000116094314,0.0017049485,0.0010612492,0.60687786,0.0040945304,0.24976157,0.0028221267,0.1313909],"study_design_scores_gemma":[0.00004893765,0.000030519845,0.00022321678,0.00007960435,0.000053917844,0.00026255648,0.00014254135,0.8607334,0.001850239,0.12656905,0.009959997,0.00004602167],"about_ca_topic_score_codex":0.007322976,"about_ca_topic_score_gemma":0.00973575,"teacher_disagreement_score":0.007322976,"about_ca_system_score_codex":0.0020512433,"about_ca_system_score_gemma":0.0020130742,"threshold_uncertainty_score":0.014882922},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022874568,0.00047763318,0.9564356,0.00035275845,0.00006881145,0.00020183326,0.0002933021,0.0013861218,0.017909363],"genre_scores_gemma":[0.5120147,0.0004124711,0.47962755,0.0002619374,0.00003788523,0.0003336924,0.00092791044,0.0003627946,0.006021068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99739265,0.0007785815,0.00020303346,0.0006196167,0.0007648254,0.00024115398],"domain_scores_gemma":[0.99507046,0.002803465,0.0002662974,0.0012041207,0.00048320493,0.00017251381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022043157,0.0007410644,0.0011356772,0.0012860206,0.0011316582,0.0030272289,0.002139856,0.0014169134,0.011673364],"category_scores_gemma":[0.011575071,0.00048788128,0.0012462676,0.0015123945,0.0024993788,0.005598477,0.0044798553,0.001788032,0.0016123296],"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.00028172234,0.00014578039,0.0020304194,0.00037037864,0.00013036054,0.000104021725,0.00048870966,0.17283657,0.0042490796,0.6129989,0.0050040497,0.20136002],"study_design_scores_gemma":[0.00004649444,0.0001594645,0.0004750662,0.00007688502,0.00005891202,0.00011006141,0.00016065007,0.5065446,0.0067454264,0.46872002,0.01685597,0.00004641793],"about_ca_topic_score_codex":0.0023957256,"about_ca_topic_score_gemma":0.0021527123,"teacher_disagreement_score":0.011673364,"about_ca_system_score_codex":0.001796469,"about_ca_system_score_gemma":0.0022741756,"threshold_uncertainty_score":0.039051294},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065121013,0.0003739779,0.98828727,0.00047881293,0.000022939837,0.00014234916,0.000085400985,0.00060291076,0.0034942767],"genre_scores_gemma":[0.2662741,0.0007490213,0.729753,0.00024910478,0.000058053494,0.0003379507,0.00041686377,0.00025306415,0.0019088573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965006,0.001246486,0.00018472516,0.00046205497,0.0014162499,0.0001898731],"domain_scores_gemma":[0.9937844,0.0048421677,0.00030779175,0.0005887895,0.00038821605,0.00008865611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003065481,0.0011024441,0.0007908933,0.0010788697,0.0008099705,0.0018538454,0.0016654459,0.0008327505,0.0028538923],"category_scores_gemma":[0.009840842,0.00056459237,0.0009205377,0.0014452835,0.0019080581,0.0025861016,0.0019749356,0.0018593001,0.0004453521],"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.00015895761,0.0001405639,0.0008679937,0.000444178,0.00008116608,0.00018667475,0.00043207593,0.6743707,0.005051113,0.14428411,0.004205098,0.16977735],"study_design_scores_gemma":[0.000042062253,0.00006460468,0.00014642702,0.000030751457,0.000035148318,0.00006896541,0.00010332793,0.8705667,0.0032739316,0.12011545,0.005534384,0.000018138793],"about_ca_topic_score_codex":0.005668637,"about_ca_topic_score_gemma":0.0069170487,"teacher_disagreement_score":0.005668637,"about_ca_system_score_codex":0.0013993405,"about_ca_system_score_gemma":0.002342739,"threshold_uncertainty_score":0.016211987},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061962023,0.00017130293,0.93358845,0.00012839152,0.000019671366,0.00017390502,0.00019688794,0.0024757592,0.0012835964],"genre_scores_gemma":[0.52763903,0.00012470724,0.4702127,0.00009693757,0.000010430342,0.00027678645,0.0005662662,0.0002530984,0.0008200693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99662787,0.0009593999,0.0003007512,0.00059079926,0.0011847707,0.00033642587],"domain_scores_gemma":[0.9869616,0.0072613973,0.0014537926,0.0031190577,0.00092613796,0.000278037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024610783,0.0011176915,0.0011853679,0.0023592128,0.00075540063,0.0018857805,0.0014063871,0.0008821725,0.0016801042],"category_scores_gemma":[0.017234175,0.0007207432,0.0013014866,0.0014362213,0.0019351635,0.0040799007,0.0040750965,0.0019134261,0.0002562228],"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.00066514255,0.0002619408,0.021469528,0.0007681047,0.00030456233,0.00069435633,0.002019547,0.48531693,0.031747174,0.13413577,0.0023781322,0.32023883],"study_design_scores_gemma":[0.000039326067,0.0001835021,0.00195735,0.00009242504,0.00007277585,0.0001909212,0.0002907871,0.83102745,0.026420888,0.13433325,0.0053297225,0.000061639854],"about_ca_topic_score_codex":0.0036842823,"about_ca_topic_score_gemma":0.00563105,"teacher_disagreement_score":0.0036842823,"about_ca_system_score_codex":0.0011923441,"about_ca_system_score_gemma":0.0023618608,"threshold_uncertainty_score":0.013015568},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27100068,0.0026926997,0.7146829,0.002489223,0.00014495925,0.00012579358,0.000573079,0.0005606868,0.007729959],"genre_scores_gemma":[0.9731919,0.00088264025,0.023702612,0.000065634704,0.00013497879,0.00007592681,0.0004343093,0.000024221008,0.0014877308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975541,0.00082354614,0.00017268005,0.00048379513,0.000758576,0.00020736967],"domain_scores_gemma":[0.9862358,0.009632775,0.0020459068,0.00070136116,0.0011083767,0.00027578534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004895277,0.0012122408,0.0007035818,0.0024378537,0.00062376185,0.0020094162,0.00090671214,0.0012616966,0.0019797431],"category_scores_gemma":[0.022819493,0.00034714918,0.0008214191,0.0010454586,0.0017515994,0.002473731,0.0017445482,0.0019403517,0.00033644613],"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.00007838345,0.00006480096,0.041654836,0.00014829806,0.000086542335,0.00019000108,0.00036580925,0.85161406,0.00039334723,0.0604208,0.0014264508,0.043556552],"study_design_scores_gemma":[0.0000046324176,0.00005241176,0.006043031,0.000032131255,0.000011226419,0.00006189169,0.00006309525,0.90782166,0.00017737874,0.08514373,0.00056563097,0.000023120134],"about_ca_topic_score_codex":0.006030409,"about_ca_topic_score_gemma":0.002132912,"teacher_disagreement_score":0.006030409,"about_ca_system_score_codex":0.001398998,"about_ca_system_score_gemma":0.00083119824,"threshold_uncertainty_score":0.02588898},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008614788,0.0004454281,0.9864662,0.00017859935,0.000083868836,0.00013820949,0.00011225192,0.0009808894,0.002979736],"genre_scores_gemma":[0.17935069,0.00036514562,0.81727546,0.00017477806,0.000055838456,0.00040529875,0.00044204202,0.00035901723,0.0015716427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829835,0.00063835195,0.00008432191,0.00028107438,0.000514226,0.00018360147],"domain_scores_gemma":[0.9977069,0.0016013707,0.00015687465,0.00022919422,0.00017989746,0.00012566881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021498052,0.0019423919,0.0018935456,0.0012578388,0.0011377773,0.000980133,0.001971583,0.001360251,0.005096628],"category_scores_gemma":[0.0059850174,0.0009246493,0.0017031732,0.0016123895,0.0011766443,0.002351646,0.0025000302,0.00246233,0.0007146775],"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.00020371626,0.000111027235,0.00045003422,0.00022525908,0.000094142975,0.00016278893,0.000093991905,0.80221397,0.0020882443,0.03484191,0.0039182147,0.15559663],"study_design_scores_gemma":[0.000083579245,0.00013813295,0.00011426979,0.000024970068,0.000035103927,0.0000690507,0.000031760457,0.9572545,0.0019786377,0.037859853,0.00238365,0.000026453321],"about_ca_topic_score_codex":0.004667149,"about_ca_topic_score_gemma":0.0061842096,"teacher_disagreement_score":0.005096628,"about_ca_system_score_codex":0.001524094,"about_ca_system_score_gemma":0.003797043,"threshold_uncertainty_score":0.017049849},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07722038,0.00039489576,0.91319454,0.00033993836,0.00009626939,0.00034610427,0.0004691138,0.002170969,0.005767772],"genre_scores_gemma":[0.43401635,0.00030611455,0.5592005,0.00045666037,0.00010142686,0.0006449134,0.0007734114,0.00051556283,0.0039850534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793774,0.0004339724,0.0002037045,0.00042303637,0.00080535124,0.00019619762],"domain_scores_gemma":[0.99262446,0.0031070567,0.0006843042,0.0025343949,0.0008316343,0.00021818175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001965474,0.0007744159,0.0011044808,0.0017842989,0.0012073099,0.0011729883,0.0024422596,0.0008394571,0.0027216298],"category_scores_gemma":[0.007920158,0.0005775174,0.0017116846,0.0013099418,0.0021036551,0.0027804845,0.0024328714,0.002011346,0.0005020339],"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.00075452455,0.00042753495,0.004998757,0.00082206924,0.00026023638,0.00079378707,0.0012916262,0.118440725,0.05495296,0.37414435,0.009480285,0.4336331],"study_design_scores_gemma":[0.00017402404,0.0010647179,0.0027971505,0.00017674411,0.0002665107,0.0012268989,0.0002492192,0.53021884,0.04532621,0.38554186,0.032805644,0.00015214022],"about_ca_topic_score_codex":0.0015321391,"about_ca_topic_score_gemma":0.0029316004,"teacher_disagreement_score":0.0027216298,"about_ca_system_score_codex":0.00079987355,"about_ca_system_score_gemma":0.0018938035,"threshold_uncertainty_score":0.010394573},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53791237,0.00052992353,0.45889366,0.00027404,0.000040603783,0.00013809098,0.000252302,0.00045736978,0.0015016907],"genre_scores_gemma":[0.91609365,0.00012111222,0.082434244,0.000060333405,0.000027046377,0.0001405602,0.00039879335,0.000045244164,0.0006789933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878806,0.0006749033,0.000053919422,0.00017798426,0.00017858513,0.00012654334],"domain_scores_gemma":[0.98440856,0.013252741,0.00062456314,0.0007180644,0.0006704077,0.0003256465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035733164,0.0006335917,0.0015920616,0.001319651,0.00051522587,0.0011235286,0.0015442035,0.0015883589,0.0016719],"category_scores_gemma":[0.018194601,0.00091710594,0.0008787991,0.0010543213,0.0010089331,0.0017574698,0.0011691098,0.0014440296,0.00026041403],"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.00044914905,0.00018199706,0.006909958,0.00005279261,0.000056494977,0.00003981584,0.00004927983,0.96109,0.0005020454,0.0069219493,0.0005439573,0.023202533],"study_design_scores_gemma":[0.00000870586,0.000016447279,0.00015015782,0.0000020704356,0.0000033565616,0.0000023204989,0.0000041425515,0.99780124,0.00006978453,0.0019200635,0.000020142788,0.0000014879006],"about_ca_topic_score_codex":0.011167984,"about_ca_topic_score_gemma":0.012363453,"teacher_disagreement_score":0.011167984,"about_ca_system_score_codex":0.0011127451,"about_ca_system_score_gemma":0.0015163616,"threshold_uncertainty_score":0.022205949},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009084212,0.0001786215,0.98906624,0.00019887199,0.000017906008,0.000017448347,0.000040070452,0.00011681597,0.0012798422],"genre_scores_gemma":[0.78735185,0.00053275086,0.20792788,0.00010861671,0.000106702544,0.00018534635,0.0001745101,0.000094168616,0.0035181264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992785,0.00022754652,0.00004318138,0.0001646471,0.00020991515,0.00007633871],"domain_scores_gemma":[0.9980831,0.001285631,0.00020867921,0.00008251474,0.00025949551,0.0000806149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015308479,0.00065630686,0.00178391,0.00086584076,0.00090736244,0.0018552514,0.0015828137,0.0013279396,0.0020815132],"category_scores_gemma":[0.0051725525,0.0012129713,0.0013165484,0.0009225568,0.0015215642,0.0019242842,0.0013178405,0.0022486944,0.00033918553],"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.000031640284,0.000016651633,0.00021469747,0.000018658657,0.000027465057,0.000013370422,0.000023617587,0.97669524,0.00022248956,0.0131488675,0.00013617867,0.009451145],"study_design_scores_gemma":[0.00000434602,0.000007047515,0.00008197163,0.000003100911,0.000004087605,0.0000024714886,0.0000027837877,0.99455845,0.000045749566,0.0051896255,0.00009637438,0.0000040422415],"about_ca_topic_score_codex":0.03614948,"about_ca_topic_score_gemma":0.03146506,"teacher_disagreement_score":0.03614948,"about_ca_system_score_codex":0.0015945437,"about_ca_system_score_gemma":0.0027983566,"threshold_uncertainty_score":0.071878135},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14136782,0.0009808897,0.79455113,0.0018672893,0.00014560262,0.0003731175,0.00066740107,0.0018377384,0.058209006],"genre_scores_gemma":[0.66235214,0.00071783486,0.3259238,0.00017184086,0.00005398309,0.00047737398,0.0004732084,0.0003078539,0.009521956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963474,0.00018835197,0.000014868148,0.00008721329,0.00004572372,0.000029056531],"domain_scores_gemma":[0.9977738,0.0017246584,0.00012191575,0.00017493579,0.00010092183,0.00010378014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010297779,0.0009368696,0.0005089219,0.0012068173,0.0010666949,0.005250925,0.0018552939,0.0019728811,0.011663185],"category_scores_gemma":[0.006087248,0.0007418706,0.0018163067,0.00087618124,0.002213081,0.0048991763,0.0026507326,0.0018350895,0.0010534207],"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.00013280979,0.00017748846,0.006077983,0.00036312657,0.00016641026,0.00056681427,0.010555662,0.70590955,0.0019155523,0.22368842,0.0023923826,0.0480537],"study_design_scores_gemma":[0.00003275554,0.000045578687,0.0006545641,0.00006119792,0.00004238906,0.00008386938,0.00071675534,0.839555,0.0005764549,0.14945547,0.008751596,0.00002438644],"about_ca_topic_score_codex":0.014528334,"about_ca_topic_score_gemma":0.017849324,"teacher_disagreement_score":0.014528334,"about_ca_system_score_codex":0.0019006524,"about_ca_system_score_gemma":0.0015010572,"threshold_uncertainty_score":0.03901726},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035046402,0.00011765725,0.9565269,0.00033325306,0.000037965798,0.000097011485,0.00026850667,0.0030253807,0.0045469003],"genre_scores_gemma":[0.567875,0.00015743569,0.42900032,0.00009444578,0.000025379915,0.00020843488,0.0006494012,0.0003150444,0.0016744685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989213,0.00031145412,0.00007712957,0.00020214645,0.0003578823,0.0001302009],"domain_scores_gemma":[0.99518245,0.003598114,0.0002409229,0.0005990318,0.00025046428,0.00012899535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011653972,0.00073104794,0.0005055262,0.0005290706,0.0007166547,0.0012799632,0.0011567301,0.0007161286,0.0036985697],"category_scores_gemma":[0.007857949,0.0006533861,0.0012427842,0.00050967507,0.0017594292,0.0019540128,0.0023136563,0.0016370993,0.0004176367],"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.00014687749,0.00008424192,0.0012719512,0.00018928113,0.000047407233,0.000252419,0.00020239926,0.8618467,0.0026310252,0.07464995,0.0019663651,0.056711372],"study_design_scores_gemma":[0.000023597902,0.000022553468,0.00013874892,0.000013394346,0.000012305863,0.000022560482,0.00003108125,0.92349374,0.0018030329,0.07325609,0.0011740125,0.000008820289],"about_ca_topic_score_codex":0.005151303,"about_ca_topic_score_gemma":0.013405148,"teacher_disagreement_score":0.005151303,"about_ca_system_score_codex":0.0011032483,"about_ca_system_score_gemma":0.0021619957,"threshold_uncertainty_score":0.012372911},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37319908,0.0022514665,0.5830362,0.012414061,0.00011185227,0.00048330525,0.0028210406,0.00094869826,0.024734246],"genre_scores_gemma":[0.8553382,0.0014004885,0.13643615,0.0003336743,0.00017519911,0.0005416355,0.0021655175,0.0002454021,0.00336377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951864,0.0018661317,0.00034087288,0.0007343794,0.0014128007,0.000459502],"domain_scores_gemma":[0.9451975,0.048894342,0.0023262885,0.0015534281,0.0012683959,0.0007600116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003873118,0.00075672916,0.0016958453,0.00136133,0.001494813,0.005203041,0.0023141527,0.001955424,0.004918922],"category_scores_gemma":[0.04464605,0.00080406945,0.001701844,0.0022233329,0.0027353559,0.008098107,0.0032433432,0.0034945053,0.00041332733],"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.0003078293,0.00017602884,0.005158874,0.0004947956,0.00013829225,0.00033824172,0.00080119283,0.69360757,0.0011153008,0.23821725,0.004785282,0.054859277],"study_design_scores_gemma":[0.00006225641,0.00003976127,0.001012692,0.0000523259,0.000039642764,0.00013552337,0.0003062967,0.5306145,0.0006392163,0.46498746,0.0020832662,0.0000270368],"about_ca_topic_score_codex":0.0060125603,"about_ca_topic_score_gemma":0.0049905716,"teacher_disagreement_score":0.0060125603,"about_ca_system_score_codex":0.002776731,"about_ca_system_score_gemma":0.0026003083,"threshold_uncertainty_score":0.020483315},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01613091,0.0001869726,0.9721665,0.0012006912,0.0000301524,0.00019429879,0.00015046124,0.00073706405,0.009203053],"genre_scores_gemma":[0.30822977,0.00029690497,0.6879664,0.00021353002,0.000042299493,0.0002830397,0.00037969867,0.00009300321,0.0024953857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971631,0.0013577637,0.00022517836,0.00042959163,0.00061210763,0.0002122545],"domain_scores_gemma":[0.99279684,0.0056562615,0.00042387223,0.00059573655,0.00034906305,0.00017829263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003271331,0.00096339546,0.00041557042,0.0009899597,0.0011885455,0.0024090721,0.0014451197,0.0013325149,0.0030525983],"category_scores_gemma":[0.01191024,0.00061881484,0.0014782365,0.000866598,0.0041319584,0.003321885,0.003436562,0.002097554,0.00036044724],"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.00017159208,0.00014709642,0.0011979373,0.00033124894,0.00006883569,0.0005714475,0.0009420907,0.25706056,0.0020858194,0.66522545,0.0028465556,0.06935137],"study_design_scores_gemma":[0.000055689656,0.000043513126,0.00018938571,0.00005331655,0.000036471178,0.00012242795,0.00015661864,0.38950202,0.0029351553,0.6008232,0.0060605863,0.000021599515],"about_ca_topic_score_codex":0.0057325945,"about_ca_topic_score_gemma":0.008564661,"teacher_disagreement_score":0.0057325945,"about_ca_system_score_codex":0.0018007641,"about_ca_system_score_gemma":0.0033248083,"threshold_uncertainty_score":0.017300606},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043094917,0.36319563,0.020962114,0.057213567,0.039888125,0.00029697147,0.008675204,0.0018232464,0.50363564],"genre_scores_gemma":[0.016663877,0.1329749,0.011023614,0.0020609742,0.0022499165,0.00012093118,0.0049610073,0.00084317167,0.8291016],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989247,0.000096535376,0.000041339776,0.00010887707,0.0006810543,0.00014759107],"domain_scores_gemma":[0.99597955,0.00033657433,0.00007340572,0.00022674039,0.0027377382,0.00064590905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025597531,0.0016139084,0.0017384713,0.0021188296,0.0020165923,0.0052180607,0.0015932438,0.0012419204,0.10882998],"category_scores_gemma":[0.0030222952,0.00063879223,0.00058976474,0.003680577,0.002109739,0.0024027193,0.0015729662,0.0028957564,0.026834682],"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.000031941825,0.000017649694,0.00022756316,0.0001760183,0.0000110133105,0.000026422911,0.00010660982,0.0002886305,0.00025324718,0.005400436,0.91389775,0.079562634],"study_design_scores_gemma":[0.0000051400257,0.000006656783,0.0008648808,0.0001613028,0.000008711052,0.00003281797,0.000108905966,0.0003943166,0.00017557293,0.0015833816,0.996646,0.000012274774],"about_ca_topic_score_codex":0.5539172,"about_ca_topic_score_gemma":0.7547948,"teacher_disagreement_score":0.44608277,"about_ca_system_score_codex":0.012843902,"about_ca_system_score_gemma":0.02689327,"threshold_uncertainty_score":0.8974197},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010159271,0.09037224,0.024512025,0.05398399,0.44383144,0.0007372948,0.0014251156,0.0011436768,0.38297832],"genre_scores_gemma":[0.0060534175,0.07882166,0.008440132,0.009130677,0.30747068,0.00042303855,0.0032012225,0.0009644248,0.5854947],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99724835,0.00042863854,0.0002750475,0.00058740005,0.0011381813,0.00032233406],"domain_scores_gemma":[0.9818856,0.005704284,0.00063734,0.001346408,0.0060656965,0.0043607154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005907934,0.0018339115,0.0024058463,0.0061513097,0.0019003338,0.0072830524,0.0030937365,0.0043939007,0.23863752],"category_scores_gemma":[0.014109534,0.0007179918,0.0017734625,0.0064396765,0.0012606141,0.009112978,0.0050271978,0.0053378707,0.1310866],"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.0000439032,0.00007283069,0.00011396304,0.00029816132,0.000009893923,0.000061953244,0.000041773797,0.0001593652,0.00023812064,0.004019006,0.8710844,0.12385669],"study_design_scores_gemma":[0.000012053962,0.000041763604,0.00025466687,0.0002963835,0.000007316726,0.00014565451,0.000032755564,0.00018619283,0.000086507156,0.003902676,0.99502414,0.000009830953],"about_ca_topic_score_codex":0.0016914407,"about_ca_topic_score_gemma":0.004088264,"teacher_disagreement_score":0.23863752,"about_ca_system_score_codex":0.0024839279,"about_ca_system_score_gemma":0.0029542588,"threshold_uncertainty_score":0.798322},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07190149,0.0003540553,0.9151556,0.00037502477,0.00009030989,0.00024373301,0.0004846671,0.005839749,0.0055553135],"genre_scores_gemma":[0.37986702,0.00027962736,0.61428577,0.0003521057,0.000046930414,0.00021027659,0.0014357907,0.00067414076,0.002848399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990397,0.00029120423,0.0000911635,0.00025476163,0.0002439436,0.00007932797],"domain_scores_gemma":[0.9955272,0.0019355103,0.00028920377,0.0017801353,0.0003464083,0.00012156088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020245018,0.0010056577,0.0007042177,0.00079631887,0.00031715454,0.000983485,0.0021859184,0.00064922404,0.0032467071],"category_scores_gemma":[0.008412254,0.0005928811,0.0012284267,0.0007887495,0.0012959723,0.002466923,0.002463669,0.0023574436,0.00085872796],"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.00028244514,0.00031369805,0.0054501714,0.00047105938,0.000120606426,0.00029697403,0.00030987913,0.48396423,0.021377105,0.024535809,0.005896118,0.45698193],"study_design_scores_gemma":[0.00003635413,0.00017955038,0.0007932279,0.000054826494,0.00006187946,0.00020941296,0.00008932022,0.9418662,0.021615723,0.023228217,0.0118339835,0.000031331594],"about_ca_topic_score_codex":0.0015070143,"about_ca_topic_score_gemma":0.0041697966,"teacher_disagreement_score":0.0032467071,"about_ca_system_score_codex":0.00054472237,"about_ca_system_score_gemma":0.0014101691,"threshold_uncertainty_score":0.010861278},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002527297,0.0001527201,0.9854881,0.000053235635,0.000029171944,0.00010914829,0.00045315974,0.004684837,0.0065024067],"genre_scores_gemma":[0.03791428,0.00049988413,0.9542901,0.000048230435,0.000013735059,0.0002992693,0.0013269222,0.0008294435,0.004778196],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992853,0.00009693461,0.0000632053,0.00017094065,0.0003164508,0.000067239096],"domain_scores_gemma":[0.9990885,0.00044516477,0.00004891662,0.00024798943,0.00013903892,0.000030359175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072272203,0.0016236184,0.0010815313,0.0016391566,0.0009288415,0.0022635078,0.0024153362,0.0010255846,0.014607376],"category_scores_gemma":[0.0030594089,0.0012385236,0.0024173695,0.0022807047,0.0008064409,0.002214332,0.0014206243,0.001570167,0.0055960803],"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.0001419604,0.000181842,0.000634619,0.001041773,0.00010324215,0.0005566905,0.0003181195,0.20501372,0.014343028,0.104001455,0.010882862,0.66278076],"study_design_scores_gemma":[0.00007883354,0.00013058484,0.00021508457,0.00019199414,0.00020093795,0.00047568473,0.00014642644,0.7448268,0.05575775,0.12734416,0.070574075,0.00005770061],"about_ca_topic_score_codex":0.0034810894,"about_ca_topic_score_gemma":0.007239272,"teacher_disagreement_score":0.014607376,"about_ca_system_score_codex":0.00068083266,"about_ca_system_score_gemma":0.0021299305,"threshold_uncertainty_score":0.04886651},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068366274,0.013061703,0.7700001,0.066546686,0.0007387792,0.00026862288,0.000673131,0.0014565653,0.078888215],"genre_scores_gemma":[0.60882425,0.0070750364,0.36473626,0.0074112974,0.0015296483,0.00089152536,0.00059321336,0.0004449381,0.008493873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9906633,0.0045486637,0.00043385383,0.0013928344,0.0021354188,0.0008258384],"domain_scores_gemma":[0.90420634,0.080507636,0.001559102,0.009016685,0.003351244,0.0013590159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013869411,0.0011623142,0.0025349145,0.0020650977,0.0026407118,0.0051767505,0.003383378,0.003883884,0.008235506],"category_scores_gemma":[0.0691273,0.0014112432,0.0024989971,0.0035956828,0.013535701,0.02530019,0.0047587915,0.009498966,0.0015263037],"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.00037810655,0.00013470315,0.0011083026,0.0004524596,0.00007288879,0.00008717583,0.000655167,0.054467708,0.00033753001,0.8679326,0.008861742,0.06551157],"study_design_scores_gemma":[0.00007074308,0.000049446524,0.00022414539,0.00007529693,0.00001313855,0.00003799475,0.00013175182,0.06402917,0.00026677622,0.92794883,0.007130738,0.000022055452],"about_ca_topic_score_codex":0.0070295865,"about_ca_topic_score_gemma":0.0032407932,"teacher_disagreement_score":0.013869411,"about_ca_system_score_codex":0.004253686,"about_ca_system_score_gemma":0.004289336,"threshold_uncertainty_score":0.0733493},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017825821,0.00040826752,0.9757774,0.00042316783,0.000045663415,0.000101506484,0.00012722675,0.00060606864,0.004684848],"genre_scores_gemma":[0.4462222,0.00058261637,0.5474324,0.00027374644,0.00008436299,0.0004956057,0.0003427788,0.00033069632,0.004235612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989543,0.00054311496,0.000038245882,0.00012088037,0.00025532866,0.00008814511],"domain_scores_gemma":[0.9933809,0.0056120846,0.00025695417,0.0002832427,0.00030428657,0.0001624889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023645712,0.0008323594,0.0011382716,0.0012378608,0.0005719259,0.0011455155,0.0017026683,0.0016602791,0.004541897],"category_scores_gemma":[0.00867091,0.00073594024,0.000878337,0.0013438207,0.0012123008,0.0013529666,0.0008840755,0.0015979003,0.00043518108],"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.000023350754,0.000020308393,0.000191829,0.000025454656,0.000017053273,0.000021786518,0.000017493896,0.97936434,0.00018828921,0.01322503,0.00038362385,0.0065213656],"study_design_scores_gemma":[0.0000060420775,0.000004767695,0.000023146946,0.000003290225,0.0000021824953,0.0000032548467,0.0000021952412,0.9951416,0.00005360113,0.004563469,0.00019372403,0.0000026311686],"about_ca_topic_score_codex":0.0110496385,"about_ca_topic_score_gemma":0.0150992535,"teacher_disagreement_score":0.0110496385,"about_ca_system_score_codex":0.0013939044,"about_ca_system_score_gemma":0.0017614077,"threshold_uncertainty_score":0.02197063},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00567652,0.00040486612,0.77748245,0.0005280142,0.00017106463,0.0011912655,0.004393902,0.19567893,0.014472935],"genre_scores_gemma":[0.07093391,0.0008472711,0.8860594,0.0010634044,0.00013521321,0.004220514,0.010177207,0.010466913,0.016096132],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986222,0.0004185872,0.00021919509,0.000198749,0.0004595133,0.000081756996],"domain_scores_gemma":[0.9962528,0.0024121618,0.00030028584,0.00030255155,0.000524218,0.00020805014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030417051,0.0013850301,0.0012108543,0.0015719555,0.001071395,0.001911743,0.0029248637,0.0015880013,0.02668288],"category_scores_gemma":[0.007510389,0.00089988793,0.0009870116,0.0010735625,0.0010173024,0.0029664992,0.0027198896,0.0023659663,0.00890666],"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.001480407,0.0006348925,0.0047890507,0.0025527843,0.00046226007,0.0015440981,0.0023774265,0.06253374,0.02601916,0.06811596,0.32626235,0.50322783],"study_design_scores_gemma":[0.0009006174,0.0002868571,0.0024555665,0.00054490526,0.0001886108,0.00092321914,0.00026043333,0.5086379,0.023687446,0.038095005,0.42373618,0.00028330635],"about_ca_topic_score_codex":0.0031008818,"about_ca_topic_score_gemma":0.0022458823,"teacher_disagreement_score":0.02668288,"about_ca_system_score_codex":0.00087834534,"about_ca_system_score_gemma":0.0021378624,"threshold_uncertainty_score":0.08926314},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048719577,0.00026257077,0.94642675,0.00030169476,0.00004061487,0.00007052663,0.00015175215,0.0016252777,0.002401274],"genre_scores_gemma":[0.6931954,0.00027468748,0.30248797,0.0001968153,0.00003043575,0.00017977544,0.00048226948,0.0001052707,0.003047425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967194,0.00008055503,0.000020213374,0.0001198434,0.00006342415,0.000044043336],"domain_scores_gemma":[0.9990964,0.0005656116,0.00008619863,0.00010504684,0.000114720875,0.000032089763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080490764,0.0006922797,0.00068064,0.0004482293,0.00034363318,0.0008008501,0.0014527811,0.001049604,0.0020410994],"category_scores_gemma":[0.0031259004,0.00047591238,0.00060009724,0.00050982327,0.0006052479,0.0016440003,0.00063232786,0.0016517588,0.00044710803],"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.00012354973,0.000094486444,0.0013748129,0.00005978778,0.00006458888,0.000083081955,0.000095047406,0.8566927,0.004084538,0.008160129,0.0012690172,0.12789822],"study_design_scores_gemma":[0.0000035396397,0.000010414827,0.000072228104,0.00000296974,0.000005318475,0.000005986461,0.0000031498787,0.9973252,0.00047658186,0.0019526304,0.00013829343,0.000003634783],"about_ca_topic_score_codex":0.019951144,"about_ca_topic_score_gemma":0.027770424,"teacher_disagreement_score":0.019951144,"about_ca_system_score_codex":0.0012412913,"about_ca_system_score_gemma":0.0013154278,"threshold_uncertainty_score":0.03966999},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05461853,0.00035205937,0.9194404,0.00039777948,0.00009293685,0.00039372922,0.00046146638,0.0066682333,0.017574882],"genre_scores_gemma":[0.27189338,0.00015885309,0.7154829,0.00040561767,0.000029462311,0.00040643278,0.0010308834,0.00064373587,0.009948835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959236,0.00009217285,0.00002849791,0.000104508,0.00009919902,0.00008338622],"domain_scores_gemma":[0.9986785,0.00061662536,0.00007039068,0.00039621448,0.0001740849,0.00006421264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006995388,0.0008810914,0.00068163767,0.00078638835,0.000592495,0.0006111623,0.0020526345,0.0010633472,0.007923798],"category_scores_gemma":[0.002590383,0.00044406534,0.0010124004,0.00092460006,0.00088905054,0.0018240093,0.0026435128,0.0014209456,0.0014902488],"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.00030568102,0.00034925467,0.002586708,0.00042906427,0.00007710716,0.00037538033,0.00039548895,0.18082857,0.022333821,0.03880308,0.017750539,0.7357653],"study_design_scores_gemma":[0.00010125337,0.00023648841,0.00057024835,0.00004943027,0.000058322243,0.0003694589,0.0001254818,0.9099366,0.016759804,0.051703244,0.020060657,0.000029040022],"about_ca_topic_score_codex":0.0027078525,"about_ca_topic_score_gemma":0.0048107523,"teacher_disagreement_score":0.007923798,"about_ca_system_score_codex":0.0004612854,"about_ca_system_score_gemma":0.0013405897,"threshold_uncertainty_score":0.026507795},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16098936,0.0010922957,0.83022565,0.0007471837,0.000058996855,0.00021507748,0.00017054773,0.00076396257,0.0057369783],"genre_scores_gemma":[0.5783534,0.00033587447,0.41899905,0.00020877854,0.000024426114,0.00019498642,0.00028324616,0.0003317897,0.0012684664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99317,0.0027623528,0.00034851325,0.00075583695,0.0020220254,0.00094118324],"domain_scores_gemma":[0.96122426,0.029766567,0.00228282,0.0036417106,0.0025337467,0.00055095006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010390451,0.0010579342,0.0011884844,0.0016318455,0.00085062085,0.0024720996,0.0018601719,0.0015930277,0.002350751],"category_scores_gemma":[0.049870536,0.00096117216,0.0014856778,0.0019079816,0.0019827415,0.0034653742,0.0015362684,0.002255701,0.00042084852],"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.00053506915,0.00022578755,0.0056376494,0.00028816325,0.00016541006,0.00014231635,0.00023401936,0.8869924,0.0054602455,0.019462183,0.0014870525,0.0793698],"study_design_scores_gemma":[0.000040086998,0.00021966983,0.00097640394,0.00004262874,0.00008982097,0.00007802256,0.00010078389,0.97159857,0.0040809033,0.021884818,0.0008716651,0.000016636712],"about_ca_topic_score_codex":0.0059463494,"about_ca_topic_score_gemma":0.008785746,"teacher_disagreement_score":0.010390451,"about_ca_system_score_codex":0.002110689,"about_ca_system_score_gemma":0.0024891354,"threshold_uncertainty_score":0.054950595},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03350775,0.0005567476,0.944377,0.00067141495,0.000108399996,0.00009289538,0.00025013436,0.00044231184,0.01999336],"genre_scores_gemma":[0.78925705,0.00069921854,0.1978264,0.00014969609,0.000121289806,0.0002063211,0.00044266903,0.00018908226,0.011108329],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988912,0.00034258424,0.000056439763,0.00015954729,0.00037029933,0.00017995392],"domain_scores_gemma":[0.99761814,0.0016834226,0.00016690855,0.00014625138,0.00025150817,0.00013379555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013792404,0.0008391428,0.00079731777,0.0003847868,0.000507903,0.0012933409,0.0011484771,0.00069758686,0.0043318495],"category_scores_gemma":[0.00481397,0.00064889994,0.00085945893,0.0008249623,0.0013959289,0.0021504918,0.0013716964,0.0019472825,0.00033840953],"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.00029636736,0.000044973465,0.00037761114,0.00022898274,0.00007033708,0.00021127395,0.00028687966,0.7603847,0.002746441,0.16338314,0.0034888205,0.06848051],"study_design_scores_gemma":[0.000019217874,0.00007279172,0.00018401496,0.000030520325,0.000021262735,0.00003293174,0.00007279103,0.818574,0.0017089563,0.17729057,0.001976947,0.000016028143],"about_ca_topic_score_codex":0.004627596,"about_ca_topic_score_gemma":0.004385758,"teacher_disagreement_score":0.004627596,"about_ca_system_score_codex":0.0010506411,"about_ca_system_score_gemma":0.001638229,"threshold_uncertainty_score":0.0144914985},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041835696,0.0044119684,0.68377525,0.00059046346,0.0006640956,0.0003118609,0.0014410185,0.061344624,0.20562498],"genre_scores_gemma":[0.41361016,0.0031317757,0.39070794,0.00087444973,0.00034526907,0.00041023642,0.0047207833,0.0030444283,0.18315491],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99982566,0.000018688828,0.0000092368655,0.000052807576,0.00007136305,0.000022268223],"domain_scores_gemma":[0.99991155,0.000020720252,0.0000061697847,0.0000316168,0.000015059247,0.000014921094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021483898,0.00048347536,0.00039955974,0.0005041653,0.0003067711,0.0012269509,0.0009951997,0.0005931315,0.01651214],"category_scores_gemma":[0.00026619653,0.00023785199,0.00033715236,0.00044135557,0.00026155214,0.00096248667,0.0009317208,0.00069279317,0.0056365742],"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.00060205784,0.00015397384,0.0011517502,0.0005784605,0.00010255266,0.0008892795,0.0008291004,0.013856823,0.13676253,0.06883654,0.065177836,0.7110591],"study_design_scores_gemma":[0.00011285748,0.00034397485,0.0024022982,0.00017496703,0.00017052187,0.0014028922,0.00018804621,0.077222,0.06692789,0.013674464,0.8372832,0.00009696105],"about_ca_topic_score_codex":0.0007608072,"about_ca_topic_score_gemma":0.00087316596,"teacher_disagreement_score":0.01651214,"about_ca_system_score_codex":0.00031110307,"about_ca_system_score_gemma":0.00035656334,"threshold_uncertainty_score":0.055238545},"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02382506,0.058332052,0.24928972,0.5184829,0.0067783166,0.00021462353,0.0004818513,0.00089591567,0.14169951],"genre_scores_gemma":[0.7339096,0.039588965,0.10287941,0.10379434,0.010096536,0.0008147864,0.000351178,0.0005447416,0.008020327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.96029806,0.02358561,0.0026013306,0.0034407452,0.008955273,0.001118908],"domain_scores_gemma":[0.78599787,0.18777558,0.0048163286,0.008841969,0.0114417905,0.0011263639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0422175,0.0012212017,0.001341146,0.0050763558,0.003796605,0.009832144,0.006266635,0.009449951,0.005723858],"category_scores_gemma":[0.1359442,0.0011416896,0.0013377946,0.004977596,0.048397478,0.017464727,0.004343316,0.016178187,0.0021146548],"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.0001288714,0.00003146792,0.0005432994,0.0006555136,0.00008237644,0.00021762226,0.0044657597,0.0029170413,0.00012297546,0.94302243,0.019549292,0.028263304],"study_design_scores_gemma":[0.00005383738,0.00003686403,0.00020487157,0.0007441954,0.000026071399,0.00037166645,0.0018110026,0.0032951587,0.00048088862,0.93311346,0.059802886,0.000059124905],"about_ca_topic_score_codex":0.0036872644,"about_ca_topic_score_gemma":0.0017452677,"teacher_disagreement_score":0.0422175,"about_ca_system_score_codex":0.005774842,"about_ca_system_score_gemma":0.0032852585,"threshold_uncertainty_score":0.22327018},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056281374,0.0003121599,0.80222803,0.00038126833,0.00016128358,0.00020640272,0.001368757,0.124143034,0.06557091],"genre_scores_gemma":[0.11747722,0.0009403802,0.6916418,0.00093964505,0.00012055142,0.0003828083,0.008312556,0.030019708,0.15016536],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99956876,0.00005925931,0.000036451616,0.00009733659,0.0001906507,0.000047467165],"domain_scores_gemma":[0.999209,0.0002669338,0.00003529067,0.0002571559,0.00015041858,0.0000812461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006565202,0.00056526787,0.00046914173,0.0006240386,0.00038452644,0.0013376711,0.0017438941,0.0006408182,0.046703763],"category_scores_gemma":[0.0026622887,0.0008419866,0.0004901502,0.00039435487,0.0005233388,0.0024699746,0.0023127429,0.0013338883,0.03211702],"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.00045802133,0.00014901653,0.00069394754,0.00048568466,0.000047755115,0.0002695879,0.0004053885,0.008214271,0.015039615,0.05566945,0.17266725,0.74590003],"study_design_scores_gemma":[0.00017729487,0.00007895682,0.001077796,0.00025548888,0.000051060964,0.00084225903,0.00011009434,0.11256654,0.0328214,0.12404109,0.7279,0.00007806709],"about_ca_topic_score_codex":0.0013328482,"about_ca_topic_score_gemma":0.0013243929,"teacher_disagreement_score":0.046703763,"about_ca_system_score_codex":0.00031619234,"about_ca_system_score_gemma":0.00095639727,"threshold_uncertainty_score":0.15623963},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22644937,0.0022460583,0.588855,0.00808551,0.0012108511,0.0016647872,0.0002927135,0.00870416,0.16249152],"genre_scores_gemma":[0.43690118,0.0031471562,0.49589932,0.0016685235,0.00024151494,0.0007978861,0.000762433,0.00037553633,0.060206458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948275,0.00015575062,0.000020629699,0.00006602945,0.00021191013,0.00006287783],"domain_scores_gemma":[0.998885,0.0001972418,0.00006341026,0.00016969774,0.00014809644,0.00053645286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081291446,0.0005077897,0.0001784269,0.00034483345,0.0004585384,0.0017411006,0.001408279,0.00090405165,0.009680524],"category_scores_gemma":[0.0030924482,0.00024687318,0.00034770064,0.00019828892,0.00061260513,0.0021922772,0.0027367196,0.0010083028,0.0035421688],"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.00020406592,0.001660069,0.0042712544,0.00045196543,0.000045168148,0.00037733122,0.0036559415,0.008599202,0.031001743,0.026472688,0.028413178,0.8948474],"study_design_scores_gemma":[0.00036842763,0.0065179206,0.0133817075,0.00060049735,0.000098241035,0.002155779,0.0056237523,0.046095222,0.03273212,0.06498206,0.8272466,0.00019771411],"about_ca_topic_score_codex":0.00072041637,"about_ca_topic_score_gemma":0.002073948,"teacher_disagreement_score":0.009680524,"about_ca_system_score_codex":0.0004255297,"about_ca_system_score_gemma":0.0013747724,"threshold_uncertainty_score":0.032384515},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0155483205,0.00008701234,0.98079956,0.00044088182,0.00002020191,0.000022931901,0.000021422044,0.00021107242,0.0028486776],"genre_scores_gemma":[0.44446808,0.00027970722,0.5533096,0.0001288981,0.000030680636,0.00022537661,0.000066872475,0.00007254814,0.0014181241],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964094,0.00019527455,0.000019033045,0.00003577665,0.00008897435,0.000019928511],"domain_scores_gemma":[0.99829024,0.0012431286,0.00010037563,0.00014374747,0.00016006453,0.000062485924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010947546,0.0005977565,0.00057462265,0.0005983396,0.00073109777,0.0023259923,0.0010271281,0.0014386374,0.0025704866],"category_scores_gemma":[0.008888469,0.0005003974,0.0005725608,0.0007687477,0.0016416954,0.0028411355,0.0016452442,0.0012464034,0.00036880915],"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.00003492945,0.00002841234,0.0004989028,0.000054538246,0.000012556087,0.000050141076,0.0002537736,0.89536226,0.0016883186,0.08270969,0.000493675,0.018812766],"study_design_scores_gemma":[0.0000091724,0.000008490367,0.00003106207,0.000007810109,0.0000034035475,0.000007778414,0.000028711314,0.9658527,0.00038744422,0.03303408,0.00062488683,0.0000045184897],"about_ca_topic_score_codex":0.004834399,"about_ca_topic_score_gemma":0.0039358037,"teacher_disagreement_score":0.004834399,"about_ca_system_score_codex":0.00086434337,"about_ca_system_score_gemma":0.001214601,"threshold_uncertainty_score":0.00961256},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02986085,0.00077430735,0.961291,0.0012167122,0.00006988732,0.00009683185,0.00013644702,0.00016222394,0.0063917413],"genre_scores_gemma":[0.76834303,0.0011520984,0.22274145,0.0002935088,0.0001472523,0.0003029682,0.00027199028,0.00007387404,0.0066737537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976769,0.0011880861,0.00010545216,0.0003695344,0.00047165802,0.00018826617],"domain_scores_gemma":[0.99179614,0.0064948606,0.00052187295,0.00024186629,0.0007069306,0.0002383012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005066316,0.0007711169,0.0013700697,0.00079670985,0.00075722544,0.002548801,0.0014834519,0.0014072198,0.0035680046],"category_scores_gemma":[0.016735904,0.0008300522,0.00077296124,0.0009822976,0.0017038041,0.0029957385,0.001086647,0.0020836745,0.0005900304],"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.00015477899,0.00007241178,0.0016299016,0.000117667034,0.000098212244,0.00007755828,0.00016491041,0.7830224,0.00043484333,0.16573042,0.0013825145,0.04711444],"study_design_scores_gemma":[0.000024665047,0.000025634336,0.00034845577,0.00001922798,0.000012454634,0.000013959693,0.00002814573,0.84656966,0.00017333112,0.15200594,0.00076440495,0.000014046551],"about_ca_topic_score_codex":0.012075763,"about_ca_topic_score_gemma":0.012053262,"teacher_disagreement_score":0.012075763,"about_ca_system_score_codex":0.0020888955,"about_ca_system_score_gemma":0.0018647149,"threshold_uncertainty_score":0.0267936},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013094839,0.00035183612,0.9959019,0.00021287538,0.00003489049,0.000044852004,0.00007364976,0.00044132644,0.0016292611],"genre_scores_gemma":[0.19109248,0.0013698171,0.803204,0.00034384197,0.0003463653,0.00040390284,0.00075251545,0.00015728411,0.0023298417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966714,0.0010152725,0.00032213403,0.00060049957,0.0012036507,0.00018709697],"domain_scores_gemma":[0.9862023,0.011377388,0.00046548006,0.0010498671,0.00079354737,0.000111449815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036016568,0.0010225961,0.0012936131,0.0034668618,0.0010344017,0.0020647056,0.0030229134,0.0013871018,0.0071030706],"category_scores_gemma":[0.019813174,0.0007613857,0.002310361,0.0023857732,0.0024587684,0.004663002,0.0024015366,0.004134247,0.0014389642],"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.00017386636,0.00014114921,0.0012632102,0.0005466919,0.00018026556,0.00036771773,0.0004883197,0.17121491,0.0024410735,0.4998878,0.0057192314,0.3175757],"study_design_scores_gemma":[0.000027407083,0.000025925772,0.0001630469,0.000069768525,0.000037059508,0.00009966763,0.00003902188,0.61803955,0.0015581588,0.37585846,0.0040594665,0.000022548022],"about_ca_topic_score_codex":0.0042907824,"about_ca_topic_score_gemma":0.003696049,"teacher_disagreement_score":0.0071030706,"about_ca_system_score_codex":0.0017467478,"about_ca_system_score_gemma":0.0011759722,"threshold_uncertainty_score":0.023762107},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057654854,0.0002669556,0.9338355,0.0002796412,0.000029606708,0.00029050198,0.00023176655,0.0032071997,0.0042039505],"genre_scores_gemma":[0.48974717,0.00027888006,0.50705427,0.00009271313,0.000024141837,0.0002856756,0.00054590794,0.00036780167,0.0016034365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644864,0.0011128909,0.00019656621,0.00071426015,0.001314876,0.00021273202],"domain_scores_gemma":[0.992253,0.0049009062,0.0010170974,0.0010442791,0.0006633241,0.000121385914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037314368,0.00067696645,0.0004930339,0.0008329993,0.00049476477,0.0012403848,0.0013855605,0.0007033106,0.0020460004],"category_scores_gemma":[0.015868645,0.0005666909,0.0005104367,0.0004839374,0.0010055404,0.0017859243,0.0015025187,0.0011950806,0.0005173676],"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.00068831415,0.00030651502,0.0116152195,0.0005080165,0.0001213134,0.00039392454,0.0011087363,0.49196342,0.048257537,0.038972475,0.0038393808,0.4022252],"study_design_scores_gemma":[0.00005885992,0.00025921446,0.002968539,0.00007115716,0.000051628955,0.0001638888,0.00018948408,0.92589694,0.034695942,0.027137328,0.008456012,0.00005099282],"about_ca_topic_score_codex":0.0023729028,"about_ca_topic_score_gemma":0.0030930408,"teacher_disagreement_score":0.0037314368,"about_ca_system_score_codex":0.00085154694,"about_ca_system_score_gemma":0.0023647253,"threshold_uncertainty_score":0.019733906},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022645906,0.00014781216,0.9671939,0.00022834807,0.000024895533,0.00010431939,0.00002569293,0.002309379,0.007319686],"genre_scores_gemma":[0.27263564,0.00029913482,0.7173741,0.00013845308,0.000013013665,0.00033421887,0.00015036538,0.0002465312,0.008808577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996487,0.00007280459,0.000023107516,0.00006910363,0.00014529271,0.00004098197],"domain_scores_gemma":[0.99976856,0.00006913301,0.00002374042,0.0000657631,0.000044816956,0.000027976945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004320732,0.0004504154,0.00018954978,0.00025995015,0.00046456052,0.0009746612,0.0011882134,0.00080434873,0.0025518225],"category_scores_gemma":[0.001067909,0.0004033483,0.0005339053,0.0001817611,0.0015107681,0.0015781973,0.0014493467,0.0011235018,0.0006367742],"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.00012941277,0.00012990712,0.000980772,0.00033007556,0.00004863524,0.00038680772,0.0017798439,0.26089835,0.10149073,0.43912733,0.0045101913,0.19018792],"study_design_scores_gemma":[0.000085921485,0.00027287385,0.0009429059,0.00013742095,0.000050688162,0.000347808,0.00025038308,0.65873903,0.031968713,0.19950232,0.10762375,0.0000781386],"about_ca_topic_score_codex":0.001720344,"about_ca_topic_score_gemma":0.0024199397,"teacher_disagreement_score":0.0025518225,"about_ca_system_score_codex":0.0006258305,"about_ca_system_score_gemma":0.0007667913,"threshold_uncertainty_score":0.008536696},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0949163,0.000845474,0.8931742,0.00027626802,0.00009252037,0.00062263716,0.00029200793,0.0020814862,0.007699076],"genre_scores_gemma":[0.6867769,0.000462132,0.30942574,0.00006939656,0.00009661608,0.0003964067,0.0007680946,0.00010830605,0.0018964331],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98700655,0.0040959837,0.0013306306,0.0012873965,0.005705288,0.00057427515],"domain_scores_gemma":[0.97702926,0.012071496,0.0023367014,0.0024418226,0.005709669,0.000411086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050846883,0.0007535585,0.0012315044,0.007921099,0.00087012816,0.0030682173,0.0014471317,0.00062899466,0.0035318546],"category_scores_gemma":[0.03742598,0.00028632293,0.0007446997,0.0066934125,0.00092339475,0.0035536303,0.0013208034,0.0007266073,0.0015483386],"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.0005403657,0.00038231415,0.019423392,0.0005024219,0.00019992008,0.00027714545,0.0006510044,0.020115223,0.013021118,0.023028744,0.005938167,0.9159201],"study_design_scores_gemma":[0.00012062411,0.00059562456,0.018831937,0.00009256,0.00027419106,0.0012614459,0.0006050268,0.911683,0.033029646,0.025972145,0.0073751267,0.00015863878],"about_ca_topic_score_codex":0.0032391853,"about_ca_topic_score_gemma":0.0025075783,"teacher_disagreement_score":0.007921099,"about_ca_system_score_codex":0.0011415809,"about_ca_system_score_gemma":0.002070417,"threshold_uncertainty_score":0.026890755},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022244288,0.000927023,0.98331547,0.0009501478,0.00009511877,0.00014310483,0.00016914825,0.0006714933,0.0115041705],"genre_scores_gemma":[0.10314596,0.00087569794,0.8907646,0.00024882978,0.00009312865,0.00020297064,0.0005792115,0.00010728819,0.0039823055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99669445,0.0012195419,0.00032259035,0.0004625042,0.001134162,0.0001667405],"domain_scores_gemma":[0.99364215,0.004795929,0.0002028002,0.0007987218,0.00044054748,0.000119928125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033017632,0.0011833705,0.0009607368,0.0027151094,0.0010963985,0.003425049,0.0030101775,0.002046344,0.014608763],"category_scores_gemma":[0.01405358,0.0008662047,0.0018876331,0.0022494467,0.0025722194,0.005900151,0.0020238187,0.0022613874,0.0026239944],"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.00025093858,0.00026941145,0.0010230353,0.00085376087,0.00017816528,0.00076176703,0.00051324035,0.075304694,0.003026546,0.50046915,0.017862359,0.3994869],"study_design_scores_gemma":[0.000092795184,0.000052736377,0.00037152602,0.00020964093,0.000108790264,0.0004202809,0.00018500551,0.36362,0.0048403502,0.5981067,0.031946145,0.00004602096],"about_ca_topic_score_codex":0.007429653,"about_ca_topic_score_gemma":0.0063953795,"teacher_disagreement_score":0.014608763,"about_ca_system_score_codex":0.0015408046,"about_ca_system_score_gemma":0.0016049799,"threshold_uncertainty_score":0.04887122},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08988852,0.00009317268,0.86606157,0.00024133942,0.00010211813,0.0004120663,0.0005018724,0.01758163,0.025117755],"genre_scores_gemma":[0.34046784,0.0002665864,0.64285606,0.00014787963,0.000025112926,0.000686038,0.0015330685,0.0031631375,0.010854248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963677,0.00009702467,0.000027467337,0.00006742935,0.0001230888,0.000048219325],"domain_scores_gemma":[0.9987534,0.000638369,0.000047873655,0.0002518244,0.000174357,0.00013423784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001097379,0.0006679829,0.0005217601,0.00047642138,0.0005200105,0.001617737,0.0016533462,0.0006768494,0.00986447],"category_scores_gemma":[0.0034201937,0.00073104445,0.00075378944,0.00028487542,0.0008855378,0.0019293057,0.0022076387,0.0012267926,0.0016464266],"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.00055657973,0.00038231717,0.0072113373,0.00047414808,0.00016412238,0.000709428,0.002926903,0.72693706,0.027187793,0.057771467,0.012409177,0.16326967],"study_design_scores_gemma":[0.00008562395,0.0000800005,0.00037860445,0.00005253966,0.000027992306,0.000080757,0.00022105852,0.92639256,0.014076148,0.0070739468,0.051489998,0.00004082563],"about_ca_topic_score_codex":0.0025093725,"about_ca_topic_score_gemma":0.0029842928,"teacher_disagreement_score":0.00986447,"about_ca_system_score_codex":0.0006559914,"about_ca_system_score_gemma":0.0010318831,"threshold_uncertainty_score":0.032999992},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007671111,0.00025409568,0.9863994,0.00011160123,0.000017546716,0.0001034562,0.00008963213,0.0014407928,0.003912298],"genre_scores_gemma":[0.38856396,0.00047520731,0.6043546,0.00017731925,0.0000300414,0.00073412654,0.00050137565,0.00040199704,0.0047613163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990758,0.0003629871,0.00004191487,0.00016308673,0.00028214627,0.00007404904],"domain_scores_gemma":[0.9988871,0.00069822086,0.00009236943,0.000133914,0.00013767362,0.000050690884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011088216,0.0008275983,0.0009581754,0.0010125706,0.00042276087,0.00082869676,0.0013450262,0.00091118313,0.003679554],"category_scores_gemma":[0.0035613126,0.00065335183,0.0007838678,0.0009534959,0.0010618096,0.0011471863,0.0016108227,0.0010682421,0.0009658318],"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.00008156343,0.00004268964,0.00023762253,0.000124874,0.00004775535,0.00010172614,0.00007643193,0.9159289,0.0021638235,0.02589362,0.0022627453,0.053038243],"study_design_scores_gemma":[0.00003600911,0.000039694845,0.000037214893,0.000009330504,0.000008691075,0.00002539109,0.000008553509,0.9832791,0.0007823154,0.014349367,0.001414721,0.000009663811],"about_ca_topic_score_codex":0.003072469,"about_ca_topic_score_gemma":0.00482454,"teacher_disagreement_score":0.003679554,"about_ca_system_score_codex":0.0008431997,"about_ca_system_score_gemma":0.0013085203,"threshold_uncertainty_score":0.012309313},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12134283,0.0003687477,0.8730932,0.00041098372,0.00007508766,0.00034958794,0.00014217656,0.0017324039,0.0024849593],"genre_scores_gemma":[0.81955415,0.00015651257,0.17824933,0.000112548085,0.000066804365,0.00017845599,0.0003093581,0.00014293152,0.0012298172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961467,0.001489014,0.00026234452,0.0006297716,0.0012462958,0.0002258732],"domain_scores_gemma":[0.97886264,0.014299574,0.0014505913,0.0021165488,0.0029144182,0.00035625935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005794403,0.001418518,0.0010648181,0.0018266783,0.0004423726,0.0015707121,0.0020145434,0.0016021408,0.0025056242],"category_scores_gemma":[0.059371784,0.0006711006,0.00054654916,0.0011527571,0.0008102433,0.004459215,0.0014482981,0.0017928922,0.0008210443],"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.000905414,0.000995467,0.008632611,0.00036199173,0.00014306833,0.00016111153,0.00039077605,0.23336232,0.015964076,0.005041361,0.0031653906,0.73087645],"study_design_scores_gemma":[0.00008707801,0.00027534392,0.0019153993,0.000031909625,0.000054780012,0.00010927541,0.000067002366,0.97657347,0.009915823,0.009573135,0.0013565284,0.000040216015],"about_ca_topic_score_codex":0.0024530152,"about_ca_topic_score_gemma":0.0034405948,"teacher_disagreement_score":0.005794403,"about_ca_system_score_codex":0.0010606105,"about_ca_system_score_gemma":0.0011031175,"threshold_uncertainty_score":0.030644119},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023091178,0.00047286574,0.97164714,0.00014237448,0.000028513237,0.00009259432,0.00014055442,0.0018983881,0.0024863975],"genre_scores_gemma":[0.30846462,0.00025071466,0.68861616,0.00013198139,0.000018820041,0.00024734612,0.00038751258,0.00021290025,0.0016698195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998418,0.0006066805,0.00009523862,0.00026487638,0.0004470482,0.00016824882],"domain_scores_gemma":[0.99775535,0.0010776608,0.00016386584,0.00078342936,0.0001244225,0.00009520791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001770769,0.00091158604,0.0009028087,0.0012427452,0.00059691624,0.0013374074,0.001826122,0.00069082284,0.0026331237],"category_scores_gemma":[0.0046985243,0.0004967544,0.0012775254,0.0014060062,0.00128238,0.0027832454,0.0035461665,0.002181589,0.00040272108],"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.00026113543,0.00013611892,0.002024841,0.00038841326,0.00014353487,0.00014869784,0.00057908637,0.56658787,0.00784493,0.11747563,0.0018848096,0.302525],"study_design_scores_gemma":[0.000054129694,0.00014269532,0.00053798704,0.00004956819,0.0000476092,0.000085047584,0.00011912743,0.8665359,0.0075070634,0.11483667,0.010051502,0.00003273184],"about_ca_topic_score_codex":0.004308115,"about_ca_topic_score_gemma":0.0051524737,"teacher_disagreement_score":0.004308115,"about_ca_system_score_codex":0.0013669789,"about_ca_system_score_gemma":0.0020589426,"threshold_uncertainty_score":0.009918153},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007873485,0.0008922537,0.9783678,0.0034636213,0.00011686968,0.00018612639,0.00096629816,0.0023151755,0.005818375],"genre_scores_gemma":[0.25811544,0.0021047704,0.7302244,0.0012713694,0.00026333804,0.0010580529,0.0031186405,0.0012602502,0.0025838378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952384,0.00202231,0.0003836632,0.0008297572,0.0012504674,0.00027536284],"domain_scores_gemma":[0.9678564,0.019673754,0.00294089,0.00566493,0.002635397,0.0012285459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007452449,0.0011298922,0.0012507746,0.0025420226,0.0010574703,0.0067400653,0.004138782,0.0017666531,0.008607089],"category_scores_gemma":[0.07093857,0.001092331,0.0014128825,0.0018871856,0.004228791,0.02458338,0.0033743202,0.004533977,0.0033395041],"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.00022658709,0.00019010862,0.0057290243,0.00078449876,0.00015005242,0.00010044006,0.00078908866,0.11470147,0.0007935691,0.45528516,0.014953857,0.40629604],"study_design_scores_gemma":[0.000030066129,0.00007129943,0.0011492241,0.00028454285,0.000049416885,0.00008580233,0.0004314542,0.3780104,0.0015063009,0.6046122,0.013704802,0.00006455733],"about_ca_topic_score_codex":0.006993145,"about_ca_topic_score_gemma":0.0074908054,"teacher_disagreement_score":0.008607089,"about_ca_system_score_codex":0.0026021777,"about_ca_system_score_gemma":0.0048090224,"threshold_uncertainty_score":0.039412737},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74066865,0.003435286,0.19725862,0.0018903022,0.00044231262,0.0019768798,0.0036719257,0.00319114,0.047464807],"genre_scores_gemma":[0.7710783,0.00082365173,0.21632369,0.0004208288,0.000069019334,0.0011818773,0.0024893854,0.00040163076,0.0072115166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996842,0.0017802898,0.00014654163,0.00035569482,0.00058691326,0.00028850793],"domain_scores_gemma":[0.9823989,0.014410584,0.00031312226,0.0016943495,0.00088655174,0.000296452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056419433,0.0014646574,0.0010544348,0.0009735567,0.000722141,0.0011428419,0.0019702148,0.0019804027,0.007107087],"category_scores_gemma":[0.0157368,0.0004878527,0.0008128881,0.0012190841,0.0012498422,0.0026347197,0.0017735942,0.002130574,0.0008548256],"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.0044943504,0.008605583,0.0048093847,0.0026155093,0.00032139817,0.0006023312,0.0016370857,0.6961601,0.01084838,0.03970662,0.022082424,0.20811686],"study_design_scores_gemma":[0.001300827,0.0043917214,0.0010939953,0.0001142632,0.000089560825,0.00016935245,0.00051164033,0.9501181,0.012267968,0.019613095,0.01026234,0.000067199035],"about_ca_topic_score_codex":0.0046633673,"about_ca_topic_score_gemma":0.006151531,"teacher_disagreement_score":0.007107087,"about_ca_system_score_codex":0.0013857676,"about_ca_system_score_gemma":0.001637231,"threshold_uncertainty_score":0.029837787},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026412016,0.00049227546,0.95973796,0.0009468821,0.00014083598,0.00022061983,0.0003373496,0.0006665122,0.011045523],"genre_scores_gemma":[0.64407337,0.00086006796,0.34637806,0.0007306632,0.0004103857,0.0009260562,0.0010883901,0.00058177236,0.004951202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9905719,0.002702831,0.000685261,0.0016204355,0.0031342553,0.0012853197],"domain_scores_gemma":[0.90180874,0.076755665,0.0052970373,0.0068738405,0.0071326243,0.0021319776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071319058,0.001448003,0.0024438994,0.0026381325,0.0011636562,0.0037939546,0.0026055088,0.0037391202,0.00965452],"category_scores_gemma":[0.09502227,0.0012704851,0.0020390365,0.0015810521,0.004859218,0.008646368,0.003717572,0.006174174,0.001603264],"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.0008761931,0.00015669281,0.0025357888,0.0005181627,0.00010854903,0.0006557907,0.0005583382,0.3907099,0.0062189344,0.5499078,0.0059924633,0.04176138],"study_design_scores_gemma":[0.00011411882,0.00016468881,0.0004244997,0.000105779065,0.000035499797,0.0002676403,0.00009861225,0.7377587,0.0032999262,0.2550664,0.002609558,0.00005464943],"about_ca_topic_score_codex":0.0018245826,"about_ca_topic_score_gemma":0.0017624921,"teacher_disagreement_score":0.00965452,"about_ca_system_score_codex":0.0018216842,"about_ca_system_score_gemma":0.0034814272,"threshold_uncertainty_score":0.03771758},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037210573,0.00020963275,0.96001244,0.00029258523,0.000017545875,0.00007115493,0.00006885019,0.001097471,0.0010196249],"genre_scores_gemma":[0.62157,0.00019799714,0.37575927,0.00029534227,0.000049043167,0.00032310633,0.00032099066,0.00024904584,0.0012351193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99571,0.0019654962,0.00024482093,0.0008355378,0.00086361426,0.00038039763],"domain_scores_gemma":[0.96268535,0.032387454,0.0015765376,0.0018717073,0.00095348107,0.0005254301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069295526,0.0010014985,0.0018521529,0.0016339957,0.00089264585,0.0025381385,0.003318579,0.0016392384,0.0030287073],"category_scores_gemma":[0.034050986,0.0012915301,0.0011651575,0.0013923323,0.0035438335,0.005941638,0.0027928702,0.002838169,0.00047117303],"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.0004789125,0.00016995681,0.0026427675,0.00014335007,0.00009830185,0.00011371525,0.00027116525,0.8203815,0.0022879166,0.040431682,0.0010771165,0.13190351],"study_design_scores_gemma":[0.000016287302,0.000032267715,0.00012175664,0.000008280209,0.000008990465,0.000016085225,0.000017943887,0.97250235,0.0007738268,0.02632942,0.00016306208,0.000009786477],"about_ca_topic_score_codex":0.0074196835,"about_ca_topic_score_gemma":0.007155793,"teacher_disagreement_score":0.0074196835,"about_ca_system_score_codex":0.0020948679,"about_ca_system_score_gemma":0.002683755,"threshold_uncertainty_score":0.03664738},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014170446,0.00008021602,0.98161536,0.0004419264,0.000021001531,0.00013692197,0.00015360265,0.001170376,0.0022100902],"genre_scores_gemma":[0.22467886,0.00018649276,0.77257144,0.00017138936,0.000025819178,0.00026469416,0.0006516445,0.00013832517,0.0013112429],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807715,0.00091482804,0.00010751721,0.0003091696,0.00049004005,0.00010123761],"domain_scores_gemma":[0.9944564,0.0038789161,0.00033141713,0.0008748983,0.0003441204,0.000114104594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026907632,0.0007378739,0.00038997267,0.0008324598,0.0005252398,0.0010388508,0.0021018921,0.0009550114,0.0037993544],"category_scores_gemma":[0.01233279,0.00041899196,0.0011593866,0.0008969428,0.002223389,0.0030164046,0.0019152235,0.001433393,0.00049137115],"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.00038126024,0.00021715662,0.0027357307,0.0005663702,0.00011966337,0.0007418862,0.002122882,0.34060022,0.0064723142,0.32776746,0.0066106105,0.31166443],"study_design_scores_gemma":[0.00006690267,0.00013116306,0.00043505698,0.00009741125,0.000047909994,0.00020438604,0.0003080261,0.72356987,0.006703845,0.26129797,0.0070970226,0.00004044245],"about_ca_topic_score_codex":0.0026522886,"about_ca_topic_score_gemma":0.0034289963,"teacher_disagreement_score":0.0037993544,"about_ca_system_score_codex":0.00077324116,"about_ca_system_score_gemma":0.001762055,"threshold_uncertainty_score":0.014230311},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24468717,0.0021295398,0.7339361,0.00091355265,0.00011475364,0.0013116086,0.0003408986,0.0022719586,0.014294519],"genre_scores_gemma":[0.78544617,0.00047969396,0.21074599,0.0001773558,0.000024931767,0.00048951345,0.0005957489,0.00011338437,0.001927332],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956974,0.0017042122,0.00040700176,0.00083824963,0.0011076254,0.0002454282],"domain_scores_gemma":[0.96159154,0.029363599,0.001775076,0.0037279043,0.0023153212,0.0012266143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071341335,0.00089119724,0.001008603,0.0016529559,0.00042834686,0.0014877433,0.0024090712,0.0015151491,0.0027738172],"category_scores_gemma":[0.04889269,0.0003962876,0.000634224,0.0007878701,0.00096235966,0.004366072,0.002385511,0.001534807,0.00067045685],"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.0010402241,0.0011893096,0.012956835,0.00045102998,0.00026297587,0.00010769035,0.0009856531,0.12481871,0.0041960175,0.018527647,0.0024753716,0.83298856],"study_design_scores_gemma":[0.00012884228,0.00087152794,0.004488161,0.00008143228,0.0000791798,0.0001576259,0.00042714505,0.96922886,0.0041990844,0.017330453,0.002955724,0.000052023144],"about_ca_topic_score_codex":0.004309318,"about_ca_topic_score_gemma":0.0049984674,"teacher_disagreement_score":0.0071341335,"about_ca_system_score_codex":0.0015023227,"about_ca_system_score_gemma":0.002082631,"threshold_uncertainty_score":0.037729383},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08777818,0.004469759,0.8957316,0.002712093,0.0001526432,0.00010038616,0.00066724,0.0012443063,0.0071437615],"genre_scores_gemma":[0.6899663,0.0028202832,0.3026637,0.0002872979,0.00014508874,0.00017264944,0.0010545307,0.00033665093,0.0025535033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99597955,0.0016181928,0.00022498232,0.00097169884,0.0009862387,0.00021926692],"domain_scores_gemma":[0.9721757,0.018718572,0.0026131934,0.0030563886,0.0029901224,0.0004459856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005174892,0.0008426998,0.0011006582,0.0020243179,0.00072567415,0.003199699,0.0014543163,0.0014464676,0.002529855],"category_scores_gemma":[0.06197331,0.0005696532,0.0006222836,0.0023626674,0.001544713,0.011128985,0.0012648171,0.0020510578,0.0012452945],"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.00047437884,0.00012402884,0.040946368,0.00043667582,0.00021612497,0.00008166935,0.0007466846,0.26079276,0.0025096352,0.08862467,0.0061405585,0.59890646],"study_design_scores_gemma":[0.000045729266,0.00036856014,0.009227436,0.00042956087,0.00009304061,0.00022204785,0.0007303834,0.80822843,0.005478476,0.15476818,0.020295328,0.000112768685],"about_ca_topic_score_codex":0.0059117107,"about_ca_topic_score_gemma":0.0040893997,"teacher_disagreement_score":0.0059117107,"about_ca_system_score_codex":0.001214177,"about_ca_system_score_gemma":0.0022197773,"threshold_uncertainty_score":0.02736777},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048739754,0.0013897852,0.93777466,0.00063026027,0.000055301214,0.000077362005,0.000102557715,0.0024493844,0.008781046],"genre_scores_gemma":[0.5245824,0.0008099619,0.469947,0.0001946266,0.000051136707,0.0001948818,0.00026653928,0.00056652783,0.003386987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897575,0.0003378669,0.0000391291,0.00017739015,0.0003168791,0.00015297893],"domain_scores_gemma":[0.9980848,0.0012595488,0.00010734571,0.00031297962,0.00016896098,0.00006639679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012442849,0.0010225816,0.00093280437,0.00080568204,0.0007409803,0.0012296237,0.0012213687,0.00082614465,0.0041300985],"category_scores_gemma":[0.0063271737,0.00052143,0.0008412444,0.0009652117,0.0016543674,0.0027214058,0.002338866,0.0017688535,0.0005874912],"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.00014553971,0.00007011519,0.0012674421,0.00024908065,0.0000331196,0.00009539312,0.00032565044,0.78412306,0.0037460178,0.046952646,0.003652246,0.1593396],"study_design_scores_gemma":[0.00002575382,0.00005231834,0.00024706376,0.000033434277,0.00001704961,0.000039381943,0.00008306389,0.94611335,0.0024844396,0.04720271,0.003687413,0.000013990135],"about_ca_topic_score_codex":0.007950091,"about_ca_topic_score_gemma":0.009831643,"teacher_disagreement_score":0.007950091,"about_ca_system_score_codex":0.0012535278,"about_ca_system_score_gemma":0.0022163675,"threshold_uncertainty_score":0.015807629},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23748277,0.000768581,0.74281496,0.00058747595,0.0001693985,0.001168925,0.0033343493,0.006387055,0.0072863717],"genre_scores_gemma":[0.64954835,0.00035726448,0.34127706,0.00011574868,0.00004027817,0.00047924355,0.0043732505,0.0007512759,0.0030574603],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9927134,0.0018306678,0.0005596981,0.0009211059,0.0037222381,0.000252807],"domain_scores_gemma":[0.9546555,0.018927097,0.004677854,0.008656008,0.012261746,0.0008216578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005421485,0.0008186638,0.0006932982,0.006410232,0.00081301015,0.001953194,0.0015731077,0.0009454808,0.0020502752],"category_scores_gemma":[0.044025544,0.00044428319,0.00071101723,0.0034478845,0.0006948231,0.0027724036,0.0017267056,0.0012198478,0.0008060341],"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.0009989361,0.0008293722,0.081680275,0.0013868682,0.0005202358,0.0021529025,0.010127427,0.018077148,0.048610933,0.009914308,0.0066696545,0.81903195],"study_design_scores_gemma":[0.00015947736,0.0021301105,0.19855657,0.0013116486,0.00077074504,0.005712082,0.017339882,0.47083694,0.14333424,0.048861474,0.11024865,0.00073816977],"about_ca_topic_score_codex":0.006945654,"about_ca_topic_score_gemma":0.008697596,"teacher_disagreement_score":0.006945654,"about_ca_system_score_codex":0.0008882962,"about_ca_system_score_gemma":0.0016041724,"threshold_uncertainty_score":0.02867192},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11596534,0.0029995719,0.87046504,0.0017154625,0.00013070939,0.00015283136,0.00017518729,0.0016112657,0.0067846007],"genre_scores_gemma":[0.65846837,0.00064915395,0.337687,0.00026586108,0.000056997742,0.00014490756,0.00022113125,0.00015864705,0.0023479653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988372,0.0006167642,0.000056738594,0.00022247618,0.00016930039,0.0000974477],"domain_scores_gemma":[0.9947166,0.0038550755,0.000429697,0.00039436138,0.00036088843,0.00024345127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024150892,0.0010109108,0.0012521095,0.0010275934,0.0006163483,0.0013238713,0.002235264,0.0018849738,0.002107727],"category_scores_gemma":[0.011767003,0.00060182414,0.00054723874,0.0015066161,0.0016026999,0.0032048451,0.0010301346,0.0019185634,0.00033166702],"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.00032430704,0.00016083081,0.0014771916,0.00008989173,0.000054444048,0.00006795356,0.000115309165,0.8425772,0.00029358303,0.020155719,0.0023362515,0.13234729],"study_design_scores_gemma":[0.000036951857,0.0000359866,0.00015179387,0.000009625211,0.000009346181,0.00001835173,0.000018771778,0.98603165,0.0002476777,0.012914427,0.0005168914,0.000008540046],"about_ca_topic_score_codex":0.016292265,"about_ca_topic_score_gemma":0.012018108,"teacher_disagreement_score":0.016292265,"about_ca_system_score_codex":0.0021209116,"about_ca_system_score_gemma":0.0022394783,"threshold_uncertainty_score":0.032394886},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013894542,0.0006309644,0.9911255,0.0005158858,0.000038180107,0.00006734778,0.00009118335,0.00013909211,0.0060023624],"genre_scores_gemma":[0.26946384,0.0048888205,0.7150441,0.0008771999,0.00053917215,0.0014840859,0.00052320445,0.0003180033,0.0068616825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963566,0.0017194148,0.00021632022,0.0006567861,0.0007972429,0.000253751],"domain_scores_gemma":[0.98869926,0.009105544,0.0006635916,0.00091255514,0.00044296222,0.00017610496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040261955,0.0016615955,0.0011475568,0.0036629147,0.001079919,0.0030737736,0.0032485703,0.0023896454,0.006964386],"category_scores_gemma":[0.013427453,0.0009114962,0.0022319006,0.0036170494,0.005633868,0.006307681,0.0019593001,0.003346073,0.0014630584],"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.000006259669,0.00001729994,0.0001271831,0.00008325405,0.000020371233,0.000032751563,0.00006284556,0.05523269,0.00022647077,0.9375275,0.0005908322,0.0060725706],"study_design_scores_gemma":[0.000014362145,0.00005027982,0.000093699935,0.000050154158,0.000013604433,0.000060504844,0.000040691597,0.14099175,0.00023223314,0.85021734,0.008216512,0.000018851588],"about_ca_topic_score_codex":0.003991319,"about_ca_topic_score_gemma":0.0025615008,"teacher_disagreement_score":0.006964386,"about_ca_system_score_codex":0.003132606,"about_ca_system_score_gemma":0.0018470691,"threshold_uncertainty_score":0.023298204},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009838257,0.00031136104,0.9867834,0.00056675833,0.000011812079,0.00019759081,0.000048899183,0.0001716278,0.0020702512],"genre_scores_gemma":[0.20289811,0.00042412823,0.79486305,0.000080796475,0.000029794966,0.0004318787,0.0002185228,0.000028532304,0.0010252018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952887,0.0029841422,0.00038114615,0.0005520944,0.00066539756,0.00012853682],"domain_scores_gemma":[0.9884581,0.009564856,0.00054197724,0.00087876915,0.00035929974,0.00019694498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006407924,0.00082834985,0.00087487814,0.0022716292,0.000899224,0.003022209,0.0027515197,0.0015679962,0.003500974],"category_scores_gemma":[0.01601769,0.00079306186,0.0013612983,0.0018715336,0.004730331,0.0045058085,0.002886733,0.0018265706,0.000322637],"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.00019461616,0.00047748265,0.0033600163,0.00057409966,0.00021361107,0.00075282936,0.0024699068,0.4058065,0.002537125,0.26284486,0.0024404319,0.31832856],"study_design_scores_gemma":[0.00007344024,0.000090404224,0.00070807023,0.0001608132,0.00005091221,0.00030776756,0.00037026493,0.76553035,0.0021627725,0.2236938,0.006795054,0.000056374458],"about_ca_topic_score_codex":0.006464503,"about_ca_topic_score_gemma":0.0075505385,"teacher_disagreement_score":0.006464503,"about_ca_system_score_codex":0.0023462777,"about_ca_system_score_gemma":0.0017897375,"threshold_uncertainty_score":0.033888757},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18615076,0.0006627683,0.7563212,0.009692276,0.00048231037,0.00021976022,0.0001456913,0.0018929805,0.044432268],"genre_scores_gemma":[0.8245392,0.0004797457,0.15943173,0.00081443065,0.000090258196,0.00027888184,0.000255426,0.00024304538,0.013867329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826837,0.0009716154,0.000088200424,0.00025782073,0.00027357804,0.00014034861],"domain_scores_gemma":[0.9958146,0.0027297393,0.00020924397,0.00061031984,0.00043059714,0.00020545804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026054818,0.0004913775,0.00037362246,0.0003271589,0.000884681,0.004292141,0.0013771462,0.0011190472,0.0032879],"category_scores_gemma":[0.012385942,0.00054562185,0.0016173712,0.00021319427,0.0029317872,0.0056764795,0.0037440045,0.002813814,0.00053324667],"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.00022262674,0.0001552042,0.0022065213,0.0001606404,0.000106188556,0.00064662186,0.00957609,0.07214199,0.01208202,0.8227174,0.012405695,0.067579046],"study_design_scores_gemma":[0.0000624784,0.000079127414,0.0007830709,0.00007626741,0.00006963631,0.00020922197,0.0011227253,0.3954624,0.008646994,0.54668915,0.04669571,0.00010327151],"about_ca_topic_score_codex":0.0019855544,"about_ca_topic_score_gemma":0.0014172987,"teacher_disagreement_score":0.004292141,"about_ca_system_score_codex":0.0013921991,"about_ca_system_score_gemma":0.00092442427,"threshold_uncertainty_score":0.013779283},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041164374,0.00074281456,0.98533404,0.0014421791,0.00005471911,0.00007914164,0.00018527183,0.0002708416,0.007774673],"genre_scores_gemma":[0.2657616,0.0019647065,0.723666,0.00058715604,0.0002210628,0.0006615813,0.0009894288,0.00026637316,0.0058821337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99619436,0.0018967523,0.00022621968,0.0006979971,0.0007668298,0.00021782384],"domain_scores_gemma":[0.9873727,0.010133649,0.0005440964,0.001178349,0.0005578791,0.00021318095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048635523,0.0011224176,0.00078060693,0.0023854203,0.0014050872,0.003433493,0.002824495,0.0021948488,0.009282666],"category_scores_gemma":[0.018263662,0.00083525386,0.0025163253,0.0019042939,0.0059752814,0.007214346,0.0029935888,0.0029534118,0.0008427648],"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.000031535335,0.000022809629,0.0003141142,0.00020236977,0.000035214347,0.00014345869,0.00043956254,0.037937913,0.0003143655,0.93113685,0.0017028353,0.027719116],"study_design_scores_gemma":[0.00002046828,0.000011666657,0.000051560655,0.00004745557,0.000016306649,0.00005754997,0.000069167996,0.07125968,0.00042486907,0.92387086,0.004156659,0.00001366869],"about_ca_topic_score_codex":0.0039633955,"about_ca_topic_score_gemma":0.00486062,"teacher_disagreement_score":0.009282666,"about_ca_system_score_codex":0.0022533606,"about_ca_system_score_gemma":0.0020216396,"threshold_uncertainty_score":0.031053662},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02685639,0.008693304,0.9275659,0.0060261167,0.00040111897,0.00082124764,0.0049066935,0.0032378421,0.021491317],"genre_scores_gemma":[0.20743738,0.003889128,0.7735854,0.0005429109,0.0002451175,0.0006567628,0.008341453,0.0001984153,0.005103399],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749786,0.0012803618,0.00028011875,0.00029397683,0.0005310161,0.00011657014],"domain_scores_gemma":[0.99281,0.005181834,0.00034393652,0.00090492796,0.0005303124,0.00022901174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030268722,0.0007299842,0.0005440102,0.007110214,0.00060062285,0.0050513083,0.0024517635,0.0013344181,0.0060957097],"category_scores_gemma":[0.02420721,0.00046460459,0.0010885197,0.005497423,0.0021481377,0.0076651387,0.002937191,0.0019130872,0.0015820264],"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.0003401094,0.00041254234,0.0034692185,0.0009799589,0.00016425832,0.0012136457,0.00206293,0.026431158,0.0036389534,0.17440382,0.037527703,0.7493556],"study_design_scores_gemma":[0.00008045909,0.00011109137,0.0030087398,0.0006319771,0.00018684797,0.0008460092,0.0025957322,0.2229874,0.0061000613,0.6890859,0.0742889,0.00007686911],"about_ca_topic_score_codex":0.0056391703,"about_ca_topic_score_gemma":0.0059067416,"teacher_disagreement_score":0.007110214,"about_ca_system_score_codex":0.0017246356,"about_ca_system_score_gemma":0.0011233895,"threshold_uncertainty_score":0.02039218},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.305301,0.0003216432,0.6902965,0.00023541125,0.000026463415,0.0001267532,0.00030675242,0.0010517098,0.0023337775],"genre_scores_gemma":[0.8352076,0.00009487817,0.16326623,0.0000504912,0.000011670808,0.00020037648,0.0005259819,0.00008791867,0.0005548666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879634,0.00053068966,0.000063775464,0.00017992551,0.00031383126,0.00011530329],"domain_scores_gemma":[0.98893625,0.0077297706,0.00076701876,0.0012646056,0.0011041678,0.00019825262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028484548,0.0007211771,0.00096560916,0.0012690658,0.000466506,0.0009800578,0.0010416514,0.0011533321,0.001467052],"category_scores_gemma":[0.020610947,0.00068782654,0.00061201595,0.0009413927,0.0007800166,0.0017058866,0.00092802977,0.0010539498,0.00039704784],"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.00027294952,0.00009023877,0.0093633905,0.000047565594,0.000053758788,0.000042713957,0.00006872189,0.9357862,0.0014375002,0.008657491,0.000810427,0.043369092],"study_design_scores_gemma":[0.0000074604523,0.000013941735,0.00041224627,0.000002800777,0.00000405436,0.000004212118,0.0000075279772,0.9951637,0.0003991661,0.0038948255,0.00008652564,0.0000034451064],"about_ca_topic_score_codex":0.014148109,"about_ca_topic_score_gemma":0.014035522,"teacher_disagreement_score":0.014148109,"about_ca_system_score_codex":0.0013641858,"about_ca_system_score_gemma":0.0020144351,"threshold_uncertainty_score":0.028131545},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23593523,0.00021132114,0.7607149,0.0001709344,0.000024760559,0.00013155045,0.00023345635,0.0007525311,0.0018253577],"genre_scores_gemma":[0.8232859,0.000074029354,0.17543852,0.000052863827,0.000013819792,0.00018805558,0.00034814046,0.00007148479,0.00052718027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885404,0.00052246335,0.000054513155,0.00016508349,0.0002818618,0.00012207683],"domain_scores_gemma":[0.99289554,0.0049516605,0.0005008847,0.00064919697,0.00083208585,0.00017063454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027166284,0.0005638656,0.00093195064,0.0009383744,0.00038139513,0.0009645866,0.00086609076,0.000847527,0.0014360592],"category_scores_gemma":[0.0146665275,0.000569591,0.00055029604,0.000769205,0.0007548181,0.0014117413,0.0009773406,0.000823301,0.00035329172],"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.0004878359,0.0001548403,0.012907845,0.00007789119,0.000068054826,0.000058859372,0.00008289427,0.88972116,0.002679528,0.010971699,0.0011261718,0.08166315],"study_design_scores_gemma":[0.000008933565,0.000024677563,0.00047280066,0.000004151492,0.0000054167194,0.0000061293485,0.000008969574,0.99496245,0.00066460716,0.0037421288,0.000095774965,0.000003963403],"about_ca_topic_score_codex":0.01231613,"about_ca_topic_score_gemma":0.010778267,"teacher_disagreement_score":0.01231613,"about_ca_system_score_codex":0.0010880817,"about_ca_system_score_gemma":0.0019054707,"threshold_uncertainty_score":0.024488926},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16303673,0.007723859,0.568029,0.029004144,0.00057186006,0.00012868071,0.00041599135,0.0006850687,0.23040472],"genre_scores_gemma":[0.95337886,0.00079333707,0.040497366,0.00038518527,0.00015499337,0.00008449593,0.00011469756,0.00007182054,0.0045192144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99695694,0.0019672418,0.00014653799,0.00031195287,0.0004211288,0.00019624307],"domain_scores_gemma":[0.99432385,0.004254919,0.0003450288,0.0006835207,0.00023771606,0.0001550509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003341571,0.0006896651,0.0011026432,0.0024591475,0.0021120794,0.0043860725,0.001968718,0.0030174789,0.0065402724],"category_scores_gemma":[0.0125842625,0.00068865594,0.0014875082,0.002522715,0.020875603,0.013762778,0.0038833087,0.0034374553,0.00056906167],"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.000019337578,0.000004736289,0.000094915405,0.000028022765,0.000007539845,0.000020905976,0.00038037068,0.0016205608,0.000046160858,0.9947772,0.0004736501,0.00252657],"study_design_scores_gemma":[0.000005121699,0.0000012157841,0.0000143517545,0.000002523513,0.0000012105444,0.000004796355,0.00004232246,0.00083538156,0.000011834424,0.9986084,0.0004712844,0.0000016116511],"about_ca_topic_score_codex":0.003269551,"about_ca_topic_score_gemma":0.0021112051,"teacher_disagreement_score":0.0065402724,"about_ca_system_score_codex":0.0020836152,"about_ca_system_score_gemma":0.0012044073,"threshold_uncertainty_score":0.021879375},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024525609,0.0001858322,0.9681722,0.00019131727,0.000029649873,0.00011235148,0.00007941486,0.0027797117,0.003923934],"genre_scores_gemma":[0.35163084,0.00014600884,0.6436548,0.00023656996,0.000033768978,0.0003256753,0.00042474206,0.0006380681,0.002909401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997866,0.0008492227,0.00011781235,0.0004520072,0.00050674984,0.00020828392],"domain_scores_gemma":[0.9970155,0.0014282183,0.0002909184,0.0009521474,0.00024014838,0.00007298495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019479101,0.0010754935,0.0010972457,0.0006437654,0.00048572264,0.0013235436,0.0020146968,0.0008220299,0.005506631],"category_scores_gemma":[0.005141123,0.00058673124,0.0011906475,0.0008362178,0.0014177833,0.0025700782,0.0019092307,0.0019264173,0.00094338146],"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.00073347497,0.00039878322,0.0009771317,0.00019988872,0.000069009104,0.0001465402,0.00024009946,0.67124283,0.02182862,0.07447914,0.0036649762,0.22601956],"study_design_scores_gemma":[0.00010399259,0.00021473606,0.00019778001,0.0000174127,0.000023560304,0.00003642134,0.000027472457,0.95978343,0.010309234,0.026119718,0.003140297,0.000025985755],"about_ca_topic_score_codex":0.0022055549,"about_ca_topic_score_gemma":0.0035861386,"teacher_disagreement_score":0.005506631,"about_ca_system_score_codex":0.0008871847,"about_ca_system_score_gemma":0.0019307286,"threshold_uncertainty_score":0.01842153},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02527857,0.00063806435,0.9398693,0.0003871193,0.0002817109,0.00005120966,0.000043236098,0.0013910667,0.032059655],"genre_scores_gemma":[0.51741904,0.0010477214,0.44444343,0.0002277449,0.00007587346,0.0001685969,0.00024607393,0.00027535067,0.03609614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998852,0.000019776371,0.0000065847003,0.000024650615,0.000039363145,0.000024437939],"domain_scores_gemma":[0.9999174,0.000017005037,0.0000065227478,0.000021869286,0.000019270994,0.000017821703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018351508,0.00037505673,0.00033273018,0.00018474739,0.00059868995,0.0014748422,0.0012699733,0.000776515,0.003397076],"category_scores_gemma":[0.00031596603,0.00029576532,0.00039993323,0.00020990391,0.0006540533,0.0012828179,0.001730395,0.0009514119,0.00077193993],"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.00022165265,0.00013742103,0.00071174063,0.00021487511,0.000092599745,0.00037769182,0.00093481934,0.20148003,0.053987294,0.44955933,0.012307664,0.2799748],"study_design_scores_gemma":[0.00004623239,0.00014172283,0.00042820882,0.000054130272,0.00006325857,0.00022072128,0.00015136367,0.7248505,0.017640987,0.16545358,0.09091434,0.0000350716],"about_ca_topic_score_codex":0.0018382112,"about_ca_topic_score_gemma":0.0024678984,"teacher_disagreement_score":0.003397076,"about_ca_system_score_codex":0.0003722979,"about_ca_system_score_gemma":0.00051174086,"threshold_uncertainty_score":0.011364341},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009447971,0.080325626,0.56697136,0.0069716643,0.002119784,0.0002801495,0.00057291973,0.00091328984,0.3409004],"genre_scores_gemma":[0.032992415,0.07872185,0.6480781,0.0031188587,0.0018727335,0.00055197923,0.0022876505,0.00056524074,0.23181121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990392,0.00027850588,0.00007794753,0.00011814992,0.00044929946,0.00003689105],"domain_scores_gemma":[0.9988121,0.0008722728,0.000033414584,0.00010681812,0.00014580035,0.000029496397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012418891,0.0016877669,0.00091119617,0.002835342,0.00072870846,0.004317141,0.0029694708,0.001741996,0.02953607],"category_scores_gemma":[0.002998715,0.00066828344,0.0012630528,0.0034300815,0.0024939184,0.0062263887,0.0018269584,0.0026735347,0.009137805],"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.0000121319235,0.000054066335,0.000058028392,0.00083167985,0.000034582295,0.0001278437,0.00030916597,0.004353074,0.00048540518,0.5394778,0.091541305,0.36271486],"study_design_scores_gemma":[0.00000905891,0.000009313079,0.00007616937,0.00070462073,0.000019552455,0.00020232699,0.000095395575,0.007793029,0.00035158475,0.63692904,0.35379192,0.000017983575],"about_ca_topic_score_codex":0.0026134616,"about_ca_topic_score_gemma":0.003362385,"teacher_disagreement_score":0.02953607,"about_ca_system_score_codex":0.001907576,"about_ca_system_score_gemma":0.0014286191,"threshold_uncertainty_score":0.09880799},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087624916,0.000059325524,0.9970306,0.000053591804,0.000007036731,0.000046923236,0.00005185377,0.00047875356,0.0013956666],"genre_scores_gemma":[0.06939046,0.00030939668,0.9273391,0.000056119443,0.000022180615,0.0004980497,0.00036046823,0.00015194171,0.001872325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967361,0.0015617437,0.00018762732,0.00046037228,0.0009374627,0.00011659026],"domain_scores_gemma":[0.9968822,0.0021522613,0.00026460565,0.00024745738,0.0003785883,0.000074890784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038252561,0.0016312195,0.001043466,0.0017579282,0.0006871167,0.002547085,0.0018780966,0.0013671056,0.006705956],"category_scores_gemma":[0.008379938,0.0015050498,0.0019137519,0.0012207429,0.0011696145,0.0024555672,0.002178024,0.0018605606,0.0013196052],"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.00008120078,0.000053001517,0.0005203532,0.00019684622,0.00007804892,0.0001116353,0.00017478588,0.8767114,0.0015276043,0.058609754,0.0011916219,0.060743812],"study_design_scores_gemma":[0.000028632934,0.000028355624,0.00007392602,0.000036542642,0.000024294084,0.000030899795,0.000015523263,0.96132284,0.00078832137,0.03191589,0.005722392,0.000012278155],"about_ca_topic_score_codex":0.0048455475,"about_ca_topic_score_gemma":0.005757341,"teacher_disagreement_score":0.006705956,"about_ca_system_score_codex":0.0013338526,"about_ca_system_score_gemma":0.0021394459,"threshold_uncertainty_score":0.022433698},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010707269,0.001673701,0.9739463,0.0012988307,0.000044418015,0.00005643308,0.000050975992,0.0002558585,0.011966268],"genre_scores_gemma":[0.5152516,0.0025841305,0.47339895,0.0003005312,0.0001367773,0.00033334622,0.0002129781,0.00021930235,0.0075625232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99652606,0.0019066375,0.00020499279,0.0003975576,0.0008138757,0.00015080434],"domain_scores_gemma":[0.9904281,0.0067198616,0.00031074576,0.0020046069,0.00036898837,0.0001677731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003831668,0.0005897063,0.0009872062,0.0010966115,0.00080356165,0.0037361265,0.002180352,0.0014238178,0.0029052193],"category_scores_gemma":[0.01682594,0.0010096312,0.0013829713,0.0014983325,0.0035663436,0.0075596557,0.0025881159,0.0022922342,0.00054132415],"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.000032664444,0.00002704986,0.000374501,0.00013818043,0.000071968396,0.00005473297,0.0005503244,0.06156215,0.00032214157,0.878403,0.0014319213,0.057031397],"study_design_scores_gemma":[0.00000790231,0.000015350923,0.000055085926,0.000035961853,0.000025689997,0.000041951986,0.00005245654,0.08693794,0.00046991213,0.90644574,0.005902791,0.000009163877],"about_ca_topic_score_codex":0.0020081047,"about_ca_topic_score_gemma":0.0028931196,"teacher_disagreement_score":0.003831668,"about_ca_system_score_codex":0.0018130773,"about_ca_system_score_gemma":0.0018128917,"threshold_uncertainty_score":0.02026403},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013016752,0.00039695724,0.9746644,0.00064072374,0.00006478808,0.00022962755,0.001124244,0.0043703984,0.005492065],"genre_scores_gemma":[0.13658807,0.0004714661,0.85567117,0.00015382012,0.000042534102,0.00044416505,0.002335692,0.0004704629,0.0038226233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862826,0.0006324635,0.00009360366,0.00017629731,0.0004155779,0.00005386064],"domain_scores_gemma":[0.9917276,0.0072350143,0.00026994376,0.00039652077,0.000311697,0.00005927485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013836082,0.0012558504,0.00043816713,0.0010685531,0.00042037963,0.0013008757,0.0015354363,0.0013836503,0.013771828],"category_scores_gemma":[0.0110577075,0.0005274797,0.0010728043,0.0006705214,0.0006757633,0.0016361052,0.0013437964,0.0016594044,0.0014776848],"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.00022769069,0.0001904915,0.0020315952,0.0011085048,0.00009994524,0.0010960152,0.0013904164,0.39482376,0.005835817,0.20434555,0.022790195,0.36606002],"study_design_scores_gemma":[0.00007963199,0.00003757117,0.00024390496,0.00016516488,0.000031067317,0.00017659749,0.00009386136,0.86963445,0.0040577683,0.10297293,0.022481909,0.000025204974],"about_ca_topic_score_codex":0.0016964717,"about_ca_topic_score_gemma":0.0040511102,"teacher_disagreement_score":0.013771828,"about_ca_system_score_codex":0.0012083574,"about_ca_system_score_gemma":0.0011088342,"threshold_uncertainty_score":0.04607135},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053957473,0.019204823,0.7345331,0.0031292855,0.0011178324,0.00013469809,0.00074738736,0.00073680957,0.23500034],"genre_scores_gemma":[0.39720887,0.018433983,0.5090289,0.001124231,0.0025936502,0.0006356259,0.0012753385,0.0012080801,0.06849136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995906,0.0011015732,0.00037199326,0.0007250156,0.0016689708,0.00022643537],"domain_scores_gemma":[0.99387854,0.003529332,0.0004249302,0.0013626402,0.0005825778,0.00022194482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037948198,0.0014426255,0.0010947974,0.0034635568,0.0011625965,0.005980407,0.0014348645,0.0015534408,0.024371969],"category_scores_gemma":[0.017127272,0.00074423786,0.0016123494,0.0031937156,0.0029883843,0.008090591,0.002814993,0.004322886,0.0058894996],"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.000021865586,0.000010157819,0.00014075963,0.00018395812,0.00001713703,0.000031904052,0.00014033983,0.0037888396,0.000349305,0.9302235,0.006769739,0.058322378],"study_design_scores_gemma":[0.00000487905,0.000016030808,0.00021302595,0.00012641957,0.000011773934,0.00007200986,0.000042489504,0.005364425,0.00030994441,0.9641023,0.02972227,0.000014434642],"about_ca_topic_score_codex":0.0009974279,"about_ca_topic_score_gemma":0.00063981616,"teacher_disagreement_score":0.024371969,"about_ca_system_score_codex":0.0029469025,"about_ca_system_score_gemma":0.0008413342,"threshold_uncertainty_score":0.08153242},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006350615,0.10412005,0.5657776,0.008887351,0.0016843261,0.00013882075,0.00023192582,0.00049471424,0.31231457],"genre_scores_gemma":[0.383039,0.05630677,0.45017478,0.002370612,0.0029846798,0.0005206242,0.000712254,0.00023360738,0.10365771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901915,0.00043394783,0.00007053176,0.00012002355,0.00030229794,0.0000541213],"domain_scores_gemma":[0.99865544,0.0009854474,0.00003628823,0.0001281658,0.00016098023,0.000033665827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015714391,0.0012429132,0.00080860156,0.0017540257,0.0010627158,0.004232279,0.002083278,0.0021290337,0.0060416404],"category_scores_gemma":[0.0033530868,0.0009474899,0.0006359733,0.0026071675,0.01054698,0.0065509975,0.0013267606,0.0039405753,0.0011602256],"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.000006617296,0.000013108571,0.000039856775,0.000098609795,0.000004646348,0.000028411916,0.00022042882,0.0015364231,0.00009124917,0.97270525,0.0042082258,0.021047266],"study_design_scores_gemma":[0.000004744355,0.0000040503446,0.000029388795,0.000058078327,0.0000028999643,0.000031165306,0.00003890948,0.0027897132,0.00009167771,0.97580475,0.021138709,0.0000058703868],"about_ca_topic_score_codex":0.0044940133,"about_ca_topic_score_gemma":0.0032915415,"teacher_disagreement_score":0.0060416404,"about_ca_system_score_codex":0.0032070728,"about_ca_system_score_gemma":0.0014797723,"threshold_uncertainty_score":0.023269057},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040572267,0.029326249,0.49226165,0.011637144,0.007885433,0.0008910922,0.020975746,0.0022895979,0.43067583],"genre_scores_gemma":[0.085475706,0.054867566,0.59884435,0.0131530585,0.011156072,0.0067854575,0.03550019,0.0028243233,0.19139335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975293,0.0008178026,0.00034354566,0.0004403969,0.00067168614,0.00019735581],"domain_scores_gemma":[0.996567,0.0014439892,0.00036654074,0.00048992387,0.0009900113,0.0001426354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033711833,0.0028467188,0.0019764663,0.00471073,0.003069449,0.0046138293,0.0037210227,0.0022938685,0.07352111],"category_scores_gemma":[0.009650326,0.0012325417,0.001423334,0.007433557,0.002670893,0.0065384414,0.0033119032,0.0078713205,0.055776536],"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.000031787105,0.00009125638,0.00021243234,0.0007127019,0.000018056231,0.00030943454,0.0004513322,0.0012542615,0.0006331972,0.80014676,0.16321108,0.032927673],"study_design_scores_gemma":[0.00001127627,0.000042235697,0.00018906606,0.00022865502,0.000014703536,0.00044449326,0.00013312219,0.0014100319,0.00026317855,0.3846905,0.61254585,0.000026943235],"about_ca_topic_score_codex":0.0024444447,"about_ca_topic_score_gemma":0.0016969984,"teacher_disagreement_score":0.07352111,"about_ca_system_score_codex":0.0021398223,"about_ca_system_score_gemma":0.001825485,"threshold_uncertainty_score":0.2459526},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013475428,0.33486888,0.09513509,0.038304027,0.031047478,0.0004407961,0.009077264,0.007121491,0.47052953],"genre_scores_gemma":[0.016844567,0.0859977,0.02194673,0.00103928,0.001129651,0.00013282422,0.007433797,0.0009842614,0.86449105],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993222,0.000074258554,0.000028900224,0.00007050729,0.00039983782,0.000104301944],"domain_scores_gemma":[0.99817705,0.0001852374,0.000028294895,0.0001147772,0.0011912675,0.0003034466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018403613,0.0013243991,0.0011480838,0.0013499144,0.0015053607,0.0044810446,0.0012619284,0.0012393349,0.05590108],"category_scores_gemma":[0.0017907335,0.000592309,0.00040347135,0.0025548185,0.0012723955,0.0025954712,0.001740214,0.0021612851,0.028214658],"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.0000739584,0.00004657066,0.00035872796,0.00032863868,0.00001529101,0.00004132674,0.0001867713,0.0010525457,0.0011221095,0.004467255,0.8103972,0.1819097],"study_design_scores_gemma":[0.000009170249,0.000021880907,0.0014459155,0.0002116722,0.000019302908,0.00008823246,0.0002653815,0.0016261286,0.00093775423,0.0028205712,0.9925383,0.000015826798],"about_ca_topic_score_codex":0.18013172,"about_ca_topic_score_gemma":0.3548394,"teacher_disagreement_score":0.18013172,"about_ca_system_score_codex":0.0051581203,"about_ca_system_score_gemma":0.012658249,"threshold_uncertainty_score":0.35816652},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010615299,0.005780422,0.22298974,0.0034134218,0.00045631954,0.000098281685,0.00025466163,0.00034339688,0.75604844],"genre_scores_gemma":[0.6004867,0.010362742,0.13505647,0.0012827244,0.00068999303,0.00053261203,0.0007280402,0.00040228176,0.25045842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995844,0.0001405784,0.00002629953,0.000088787165,0.0001170033,0.00004287456],"domain_scores_gemma":[0.99935275,0.00030587128,0.000029267676,0.0001534229,0.000113938455,0.000044737775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005328394,0.00057581457,0.00042393245,0.0010921151,0.0007195347,0.002271961,0.0011444613,0.00073088356,0.013603389],"category_scores_gemma":[0.001899965,0.00032901025,0.00071834086,0.0013460488,0.0048674103,0.0052160565,0.0022808479,0.0028782168,0.0019888235],"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.0000030479978,0.0000045346133,0.000029697725,0.000027796877,0.0000012850253,0.000012217866,0.0001012847,0.0005928536,0.000072710216,0.9824981,0.0014727283,0.01518379],"study_design_scores_gemma":[0.0000037288667,0.0000049095493,0.00007959738,0.00004600114,0.0000024913486,0.000063172534,0.00009165623,0.003515882,0.00024079117,0.9403549,0.05559184,0.000005051964],"about_ca_topic_score_codex":0.0024222697,"about_ca_topic_score_gemma":0.0022515892,"teacher_disagreement_score":0.013603389,"about_ca_system_score_codex":0.0019705363,"about_ca_system_score_gemma":0.0010492416,"threshold_uncertainty_score":0.04550785},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006494419,0.016547183,0.96093315,0.0019512953,0.00017816042,0.000017064225,0.000017935981,0.000097488126,0.013763259],"genre_scores_gemma":[0.4414124,0.024046157,0.5196912,0.00050045317,0.0013689981,0.00013480583,0.000108159235,0.0000870528,0.012650795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863654,0.00050334784,0.00007856858,0.00015192718,0.0005739117,0.00005567872],"domain_scores_gemma":[0.99299836,0.006176822,0.0001689817,0.00030308496,0.0003028287,0.000049927414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002488649,0.00063421944,0.0011329029,0.0009795345,0.0004531913,0.0019323113,0.0016107085,0.0012371023,0.0018077933],"category_scores_gemma":[0.010291492,0.00043919706,0.0005995593,0.0017857763,0.002569356,0.0045616818,0.0016638918,0.0034478093,0.000360882],"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.000035696685,0.000043359232,0.00034128982,0.00037933912,0.000080578175,0.00008467898,0.00039816738,0.13508958,0.0007068446,0.6552178,0.0027784572,0.20484419],"study_design_scores_gemma":[0.000007605615,0.000020283573,0.0001331593,0.00010109534,0.000013470679,0.00005517892,0.000047920028,0.29438162,0.0005425451,0.69757026,0.007114357,0.000012458768],"about_ca_topic_score_codex":0.0008035015,"about_ca_topic_score_gemma":0.000599721,"teacher_disagreement_score":0.002488649,"about_ca_system_score_codex":0.0009488165,"about_ca_system_score_gemma":0.0005418579,"threshold_uncertainty_score":0.013161361},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007205439,0.00042041903,0.9842158,0.00013957062,0.000078448604,0.000048943977,0.0008911116,0.012213477,0.0012717549],"genre_scores_gemma":[0.03431493,0.0010272108,0.94534737,0.0001878198,0.00012622113,0.00041246336,0.005258655,0.00521906,0.008106359],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817646,0.00042603211,0.00021121942,0.0005900458,0.00053190923,0.000064369895],"domain_scores_gemma":[0.99248546,0.004142818,0.00027091653,0.002322222,0.0006650474,0.000113602495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002722114,0.0029426226,0.0018977354,0.0026144139,0.00061689835,0.002585815,0.0022721877,0.0015064892,0.03803737],"category_scores_gemma":[0.020608898,0.0016970921,0.0020114542,0.0022480076,0.0008621061,0.00548732,0.0025385816,0.0037391803,0.026169993],"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.0001601087,0.00005990287,0.0009807398,0.00046834216,0.00012423462,0.00007705418,0.00011803076,0.030961493,0.007154232,0.01669201,0.027954858,0.91524893],"study_design_scores_gemma":[0.00013978987,0.00011942946,0.001660083,0.00036818488,0.00014911352,0.0005210044,0.00018851586,0.543885,0.04937717,0.2799529,0.12345994,0.000178839],"about_ca_topic_score_codex":0.0012774579,"about_ca_topic_score_gemma":0.0017555276,"teacher_disagreement_score":0.03803737,"about_ca_system_score_codex":0.000691944,"about_ca_system_score_gemma":0.00095206243,"threshold_uncertainty_score":0.12724763},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03712049,0.0017317317,0.9451289,0.00052136614,0.00018672137,0.00024765052,0.00008128504,0.00030439408,0.014677484],"genre_scores_gemma":[0.60254216,0.000924193,0.39479676,0.000095227,0.00014496723,0.00017539295,0.00005757057,0.000028654733,0.0012351421],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99220604,0.0037374836,0.00047486374,0.00037367313,0.0030572002,0.00015074201],"domain_scores_gemma":[0.9863282,0.009242862,0.0008626974,0.00057584536,0.002784881,0.00020557409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063875793,0.00078375835,0.0005465093,0.0054495307,0.000576063,0.0023756237,0.0010577096,0.00085390045,0.0013195059],"category_scores_gemma":[0.03275957,0.00020993775,0.0005688781,0.0028483747,0.0016851615,0.0018730315,0.0011406504,0.0011911613,0.0002710055],"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.00041052446,0.00019035964,0.006004316,0.0006108542,0.00013231528,0.0006414827,0.0018196553,0.2930435,0.012435076,0.19240919,0.0022572645,0.49004546],"study_design_scores_gemma":[0.000036770245,0.00026156908,0.0033595264,0.00020913774,0.00005711807,0.00037059293,0.00044837323,0.81456786,0.008936355,0.16288088,0.008752933,0.00011891198],"about_ca_topic_score_codex":0.0023566047,"about_ca_topic_score_gemma":0.0011782577,"teacher_disagreement_score":0.0063875793,"about_ca_system_score_codex":0.0013739963,"about_ca_system_score_gemma":0.0008326422,"threshold_uncertainty_score":0.03378111},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010961137,0.0010287367,0.9089786,0.016908996,0.00063530495,0.0028790452,0.0013466468,0.001463628,0.055797856],"genre_scores_gemma":[0.06941149,0.0011166441,0.91574043,0.001818072,0.000192748,0.0019412881,0.003360245,0.00040456274,0.0060146647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9769067,0.005927507,0.00491796,0.0017230012,0.009048995,0.0014757975],"domain_scores_gemma":[0.96927196,0.010855763,0.0019472486,0.004894878,0.0110765705,0.0019534961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024572859,0.0008831767,0.0013618233,0.0046582175,0.0052629192,0.010080566,0.003500678,0.0048278724,0.003944346],"category_scores_gemma":[0.032895558,0.0015514274,0.0035401022,0.004186794,0.0059326473,0.016754951,0.00708158,0.005951481,0.0028092032],"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.000043730895,0.00021141504,0.001376248,0.00063118775,0.000041353775,0.00071978313,0.0035998633,0.004892215,0.0036907343,0.92367375,0.013051514,0.048068218],"study_design_scores_gemma":[0.00006411953,0.00009032486,0.0013922841,0.0016613102,0.00008238521,0.0014874331,0.0060861027,0.030398862,0.003872067,0.44992423,0.50482357,0.00011737161],"about_ca_topic_score_codex":0.014237247,"about_ca_topic_score_gemma":0.008034601,"teacher_disagreement_score":0.024572859,"about_ca_system_score_codex":0.004886778,"about_ca_system_score_gemma":0.014253465,"threshold_uncertainty_score":0.12995529},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034105375,0.0002689569,0.95345664,0.0003078934,0.00003108608,0.00020172416,0.0004711987,0.0010529849,0.010104092],"genre_scores_gemma":[0.32983556,0.00028780458,0.6649839,0.00015161753,0.00002445359,0.00034204556,0.00085527054,0.000259807,0.0032595228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946374,0.00019735965,0.000023091436,0.00009759572,0.00014967339,0.00006861139],"domain_scores_gemma":[0.999014,0.0007039748,0.000097646196,0.000080352445,0.00007754475,0.000026451016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008612095,0.0010235466,0.0005209737,0.0004801233,0.00034573738,0.0007141525,0.000681792,0.000494368,0.0034198493],"category_scores_gemma":[0.0025355853,0.0005180563,0.0008606386,0.0007299049,0.0007100124,0.0011177118,0.00093011174,0.0012335911,0.00040936156],"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.00010877472,0.0000579339,0.00034673428,0.00018583598,0.00003150773,0.00011125913,0.00008582317,0.89846253,0.002674011,0.035805494,0.0025894307,0.05954062],"study_design_scores_gemma":[0.000041950687,0.00007875955,0.000115394054,0.000026860578,0.00001754739,0.00003853174,0.000058820046,0.9462395,0.0025327578,0.048183385,0.0026579145,0.000008669009],"about_ca_topic_score_codex":0.0028963028,"about_ca_topic_score_gemma":0.0062071546,"teacher_disagreement_score":0.0034198493,"about_ca_system_score_codex":0.00083201646,"about_ca_system_score_gemma":0.001608962,"threshold_uncertainty_score":0.0114405155},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019069545,0.00012635232,0.9753236,0.0003369093,0.000026159956,0.00011317802,0.00027293558,0.0012403507,0.003491054],"genre_scores_gemma":[0.41567802,0.00041155043,0.57766825,0.0003052213,0.0000473332,0.0004886448,0.0012061641,0.0003082682,0.0038865614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735403,0.0007217246,0.00022279147,0.00053757627,0.00086376484,0.00030012423],"domain_scores_gemma":[0.99264306,0.0035735655,0.00061292195,0.0025327278,0.00048749332,0.00015015485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020855009,0.00084618543,0.00064863777,0.000795637,0.00072562887,0.0017481229,0.0017908743,0.0008455116,0.0038863053],"category_scores_gemma":[0.011224518,0.00064454536,0.0022556097,0.0009975438,0.0020272986,0.0034214829,0.0036559987,0.003359981,0.00069667905],"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.00025114501,0.0001432807,0.0029326132,0.0006274726,0.00011831164,0.00046951446,0.0012454701,0.23518075,0.022386853,0.58580977,0.0049032657,0.14593163],"study_design_scores_gemma":[0.000062272215,0.00021563753,0.0005113136,0.00009080701,0.00007667339,0.00025674788,0.00019391828,0.36619866,0.023558462,0.58631045,0.022491286,0.000033717555],"about_ca_topic_score_codex":0.0015783544,"about_ca_topic_score_gemma":0.0019323849,"teacher_disagreement_score":0.0038863053,"about_ca_system_score_codex":0.001078525,"about_ca_system_score_gemma":0.0018391921,"threshold_uncertainty_score":0.013001025},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14237659,0.0006874851,0.8493845,0.0004074934,0.00004310114,0.00011293237,0.00003436231,0.0017000247,0.0052535213],"genre_scores_gemma":[0.87094665,0.00017820626,0.12697408,0.00012620674,0.000015356882,0.00013067624,0.00006953014,0.0001800725,0.0013792524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738675,0.0011218251,0.00010447797,0.00037249643,0.00054400985,0.00047048528],"domain_scores_gemma":[0.9859235,0.009873094,0.0009781049,0.0019200222,0.00085438916,0.00045090413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035729087,0.00084191555,0.0013617086,0.0005222868,0.0007989145,0.0014208015,0.0020284285,0.0013738575,0.0022554004],"category_scores_gemma":[0.02596865,0.00068038056,0.0005316617,0.0006841766,0.0021009073,0.0029799927,0.0017077551,0.0018573542,0.000698957],"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.00044465144,0.00022053446,0.0016484678,0.00015130322,0.000048535076,0.00014547496,0.00041233495,0.8588634,0.0050860397,0.023164717,0.00094652537,0.10886806],"study_design_scores_gemma":[0.00002112678,0.000097384225,0.00017117237,0.000013361496,0.00000964951,0.000038206832,0.00005517784,0.98321265,0.0026080578,0.013265353,0.00049963564,0.000008198342],"about_ca_topic_score_codex":0.0040808367,"about_ca_topic_score_gemma":0.0038010944,"teacher_disagreement_score":0.0040808367,"about_ca_system_score_codex":0.0014406301,"about_ca_system_score_gemma":0.0024959785,"threshold_uncertainty_score":0.018895566},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04229887,0.00057898444,0.92296255,0.0007874097,0.00017172607,0.00017183223,0.00043933289,0.0024523167,0.03013707],"genre_scores_gemma":[0.3922581,0.00033303234,0.5954769,0.0005379836,0.000093664945,0.0003559227,0.0006639664,0.00069353066,0.009586877],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884534,0.0003753012,0.00009631264,0.00022046771,0.00027237556,0.00019026379],"domain_scores_gemma":[0.9963331,0.0016823006,0.00028911405,0.00096194947,0.00055281905,0.00018073566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019301627,0.00061948196,0.0008850941,0.00082954735,0.0009138071,0.0018204431,0.0019267804,0.0016014735,0.011460032],"category_scores_gemma":[0.009925645,0.00052773766,0.0009012368,0.0014086921,0.00093642954,0.0023782842,0.0028174946,0.0015186765,0.0029160788],"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.0010118386,0.000472998,0.0022048778,0.00075060164,0.00012121729,0.00032143487,0.00056530494,0.2322383,0.015889099,0.24888459,0.02632084,0.47121897],"study_design_scores_gemma":[0.00016098807,0.00025406084,0.00036202668,0.00012448453,0.000051681985,0.0002139919,0.00016970486,0.8305804,0.010199456,0.13622585,0.021601692,0.00005576826],"about_ca_topic_score_codex":0.005682818,"about_ca_topic_score_gemma":0.006325567,"teacher_disagreement_score":0.011460032,"about_ca_system_score_codex":0.00068290986,"about_ca_system_score_gemma":0.0033026186,"threshold_uncertainty_score":0.038337648},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029872343,0.0003998804,0.9355509,0.0013908374,0.000112357884,0.0009681981,0.0009836607,0.019945877,0.010775941],"genre_scores_gemma":[0.24454811,0.00039665433,0.7451939,0.0004488898,0.0000681335,0.00071882934,0.0018221608,0.00028638126,0.0065169944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740356,0.0008147349,0.00037755867,0.0004647841,0.0007838813,0.00015548029],"domain_scores_gemma":[0.9967583,0.0017188619,0.00020234723,0.0004152953,0.0007007563,0.00020447857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037876104,0.0008763177,0.0011301355,0.0025103516,0.0011141669,0.0044758758,0.002759254,0.002761844,0.01011878],"category_scores_gemma":[0.008229783,0.0006796981,0.0011323289,0.0013181932,0.00095743674,0.0024599114,0.0018795916,0.0016325496,0.0037320305],"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.0014396447,0.0020123722,0.005300186,0.0012698047,0.00029727365,0.0033187685,0.0017057753,0.18964054,0.030165937,0.037998166,0.029182373,0.69766915],"study_design_scores_gemma":[0.0004066157,0.00017491859,0.0011717973,0.0002577884,0.00013107521,0.00071312254,0.00026716862,0.9312158,0.017768987,0.012695756,0.035079725,0.00011720878],"about_ca_topic_score_codex":0.0111334305,"about_ca_topic_score_gemma":0.004746085,"teacher_disagreement_score":0.0111334305,"about_ca_system_score_codex":0.0018748153,"about_ca_system_score_gemma":0.0024315743,"threshold_uncertainty_score":0.03385073},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010670398,0.0500266,0.022697113,0.1432656,0.1826839,0.0010976923,0.01641844,0.0057816748,0.56735855],"genre_scores_gemma":[0.024646189,0.033467293,0.017829856,0.010137136,0.020073656,0.00083596294,0.034025114,0.0016056143,0.8573791],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9954852,0.0006846976,0.00030484537,0.00055392476,0.002477129,0.00049422425],"domain_scores_gemma":[0.98871803,0.00091840065,0.00034167303,0.0009405772,0.006560657,0.0025206234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007262145,0.0018174985,0.0011512268,0.0035245237,0.0029327744,0.008559982,0.0023098798,0.0031348893,0.14314777],"category_scores_gemma":[0.009403729,0.0007673333,0.0011467799,0.0031301396,0.0005821643,0.006350038,0.0034394357,0.00409888,0.09792324],"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.00008364728,0.00012573914,0.00019897924,0.000116710995,0.000008953506,0.000046019853,0.000060885166,0.00011037399,0.0003011203,0.0009443234,0.9414788,0.056524504],"study_design_scores_gemma":[0.000022200576,0.000033438853,0.00091514835,0.00011812117,0.000018706993,0.00006244079,0.00021491932,0.00042647065,0.00048630283,0.0010861459,0.9965887,0.000027373377],"about_ca_topic_score_codex":0.0084965965,"about_ca_topic_score_gemma":0.022215405,"teacher_disagreement_score":0.14314777,"about_ca_system_score_codex":0.0029794376,"about_ca_system_score_gemma":0.0045870026,"threshold_uncertainty_score":0.478877},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007874066,0.0004921341,0.9761198,0.0008553753,0.00004159835,0.00008594507,0.00016995764,0.0003706482,0.013990418],"genre_scores_gemma":[0.42056915,0.0015576473,0.56811,0.00046797426,0.00022217659,0.0006483392,0.00081977184,0.00023046794,0.007374457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769104,0.00071288116,0.0002169099,0.00044425877,0.0006522068,0.00028271586],"domain_scores_gemma":[0.99415356,0.003923124,0.00043988688,0.000747444,0.00050961797,0.00022640111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028427015,0.000748622,0.0006551123,0.001420733,0.0010375136,0.0030884643,0.0015966181,0.0016845986,0.0048849075],"category_scores_gemma":[0.0077807284,0.0006467643,0.0022241604,0.0012850784,0.0052393633,0.0036170061,0.0035312506,0.0036154583,0.0006421629],"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.000012032809,0.000013108748,0.00016491105,0.000068646754,0.000016146947,0.00009469755,0.00018083252,0.04077878,0.0004969312,0.94828075,0.0005389533,0.009354281],"study_design_scores_gemma":[0.000013699855,0.000015524842,0.00009495448,0.000034244757,0.000008411918,0.000039683528,0.000037542744,0.081496134,0.00026804412,0.9138846,0.0040974002,0.000009701644],"about_ca_topic_score_codex":0.0064817807,"about_ca_topic_score_gemma":0.005612572,"teacher_disagreement_score":0.0064817807,"about_ca_system_score_codex":0.0026927872,"about_ca_system_score_gemma":0.0025206483,"threshold_uncertainty_score":0.019537628},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10565069,0.0006205353,0.8621047,0.0009231434,0.00012791349,0.00021845875,0.00029815096,0.0027818887,0.027274597],"genre_scores_gemma":[0.5088096,0.00021247093,0.48400566,0.00040144552,0.000039500068,0.0002572156,0.0005073489,0.00058025337,0.0051865224],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987802,0.00040267553,0.0000824085,0.00022278687,0.00029793562,0.00021403679],"domain_scores_gemma":[0.9957152,0.0022306703,0.00044189917,0.0008244017,0.00048189345,0.00030585416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022265415,0.0008448158,0.0012578532,0.0012767804,0.0014045507,0.0016845778,0.0017184844,0.00201037,0.0053295484],"category_scores_gemma":[0.012691649,0.0006970944,0.00091049453,0.0011046592,0.0009676629,0.002779061,0.0033518553,0.0014789271,0.0018428032],"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.0024089327,0.0007416586,0.005504721,0.00064053154,0.00021827983,0.00040728739,0.0009955809,0.2805244,0.021839058,0.22249098,0.01632201,0.44790664],"study_design_scores_gemma":[0.0002247987,0.00041038662,0.0004121685,0.0001331817,0.000074866715,0.0002488805,0.00034788347,0.85802066,0.014106949,0.11345855,0.012512582,0.0000491135],"about_ca_topic_score_codex":0.003735789,"about_ca_topic_score_gemma":0.005230429,"teacher_disagreement_score":0.0053295484,"about_ca_system_score_codex":0.00066930166,"about_ca_system_score_gemma":0.0031910965,"threshold_uncertainty_score":0.01782912},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03402697,0.0011385202,0.9477627,0.0016383881,0.000074533185,0.00018484985,0.00033822967,0.0009874018,0.013848378],"genre_scores_gemma":[0.5206553,0.002145142,0.46681082,0.0011679223,0.00028058875,0.0008291783,0.0010911403,0.0018907158,0.0051291795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9805834,0.009856739,0.0010973505,0.0029114939,0.004172657,0.0013782971],"domain_scores_gemma":[0.74586207,0.19889656,0.0076342286,0.036602333,0.008765647,0.002239206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.033692684,0.002110952,0.003851816,0.0035118987,0.003321127,0.00480116,0.0043338924,0.0037020242,0.004782738],"category_scores_gemma":[0.17944413,0.0018450447,0.0036892933,0.004105673,0.008366121,0.014436511,0.0068425005,0.0069460217,0.0015647156],"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.00052667665,0.0001793175,0.0033383665,0.0004144132,0.00017298335,0.00016869756,0.00095038145,0.4621776,0.0011157967,0.47404432,0.004231199,0.05268026],"study_design_scores_gemma":[0.00010371811,0.00012221877,0.00037607847,0.00017555163,0.00006811945,0.00021725852,0.00008321801,0.55336803,0.0012832925,0.44102988,0.0031220508,0.000050592247],"about_ca_topic_score_codex":0.004218962,"about_ca_topic_score_gemma":0.0036774324,"teacher_disagreement_score":0.033692684,"about_ca_system_score_codex":0.0028860166,"about_ca_system_score_gemma":0.0069402717,"threshold_uncertainty_score":0.17818612},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02261206,0.00016657473,0.96591604,0.00023849217,0.000054663422,0.000112129324,0.0002252965,0.0020707848,0.008603849],"genre_scores_gemma":[0.53387076,0.00030101562,0.4599418,0.00015908941,0.000028268201,0.0002545932,0.00048641846,0.0003338347,0.004624189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985279,0.0005446956,0.00011191152,0.0002025258,0.00045815922,0.00015481436],"domain_scores_gemma":[0.9957241,0.0029610859,0.00021363843,0.0006640499,0.0003291357,0.000107914864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019197535,0.0006749591,0.00041011657,0.0004437355,0.00051247695,0.0008959041,0.0010330697,0.0006127952,0.003477259],"category_scores_gemma":[0.006046241,0.00047726274,0.00095651223,0.0003826405,0.0015828611,0.0016243607,0.0019490358,0.0013142526,0.00035473012],"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.0002904212,0.00011281533,0.0015000199,0.00046653394,0.0000734326,0.00070837646,0.0004530819,0.54501104,0.0093802,0.33858734,0.0029625543,0.10045413],"study_design_scores_gemma":[0.000047137626,0.000079592515,0.0003519729,0.000056555113,0.000046992645,0.00012412443,0.000054319473,0.7768881,0.010231959,0.20061773,0.011468155,0.000033349384],"about_ca_topic_score_codex":0.0046989406,"about_ca_topic_score_gemma":0.00980872,"teacher_disagreement_score":0.0046989406,"about_ca_system_score_codex":0.00078238756,"about_ca_system_score_gemma":0.0019991058,"threshold_uncertainty_score":0.011632562},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007524643,0.00028688027,0.9818475,0.0002960438,0.00007809804,0.00008113666,0.00033833715,0.0027056106,0.006841726],"genre_scores_gemma":[0.31983894,0.00053941907,0.6724762,0.00020822455,0.000057502813,0.0003529053,0.0011303367,0.00046422044,0.0049324017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990545,0.00033152054,0.00007084518,0.00013595055,0.0003049291,0.000102333346],"domain_scores_gemma":[0.99863535,0.0007583416,0.00011419028,0.0003253729,0.00012768975,0.000039057915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088111404,0.00075965864,0.00051381567,0.0006686698,0.0005067161,0.001137041,0.0010357049,0.00053741597,0.008932634],"category_scores_gemma":[0.003907441,0.0004260797,0.0011438788,0.0011346585,0.0015223519,0.0017329274,0.0020782056,0.001764149,0.0013713189],"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.00020871557,0.00007749294,0.00074568845,0.00044114774,0.00006073182,0.00034411743,0.0002702998,0.67707074,0.0057934048,0.14342019,0.009868169,0.16169924],"study_design_scores_gemma":[0.000053745,0.000060388877,0.00023160617,0.00007661613,0.000035964335,0.00012402592,0.000050464878,0.79911846,0.0054500382,0.17657961,0.018194355,0.000024612451],"about_ca_topic_score_codex":0.0056080897,"about_ca_topic_score_gemma":0.006619976,"teacher_disagreement_score":0.008932634,"about_ca_system_score_codex":0.00086459913,"about_ca_system_score_gemma":0.0013193802,"threshold_uncertainty_score":0.02988261},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07132992,0.0005822197,0.9168584,0.00060919,0.00008665494,0.0001366765,0.00035159403,0.004186802,0.0058585405],"genre_scores_gemma":[0.63516146,0.00032042,0.36119154,0.00026332444,0.000041517596,0.0002140501,0.0006990144,0.0005322398,0.0015763991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853396,0.00047545566,0.00009295596,0.00026581518,0.00045375735,0.00017803488],"domain_scores_gemma":[0.9914072,0.0064476905,0.00048123096,0.0010006967,0.00039146905,0.00027168426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025235934,0.001188087,0.001162251,0.0007379776,0.0005500137,0.00125192,0.001708522,0.0013742239,0.003292712],"category_scores_gemma":[0.016662017,0.00078639213,0.00089701754,0.00078559294,0.0017626818,0.0025569082,0.0024887412,0.0022912463,0.0003828112],"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.0001272948,0.000052160533,0.0005820984,0.00011271607,0.00002773471,0.00006497955,0.00005898827,0.9412,0.00084730046,0.016757721,0.001332331,0.03883663],"study_design_scores_gemma":[0.000019092266,0.000044021668,0.0000678951,0.000011333486,0.0000074271484,0.000019384863,0.000012514042,0.97567403,0.0007402183,0.022824084,0.00057346217,0.0000065574736],"about_ca_topic_score_codex":0.005841655,"about_ca_topic_score_gemma":0.008769387,"teacher_disagreement_score":0.005841655,"about_ca_system_score_codex":0.0012042612,"about_ca_system_score_gemma":0.0030505774,"threshold_uncertainty_score":0.013346136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021656258,0.0014377519,0.96929234,0.00026206777,0.000050705417,0.00014887964,0.00009895509,0.00071539107,0.006337579],"genre_scores_gemma":[0.38869458,0.0012262247,0.60538554,0.00023287527,0.00008571125,0.0006023789,0.00031835816,0.00023351153,0.0032208448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985202,0.0007463354,0.00006657936,0.0001811607,0.00039142245,0.0000943492],"domain_scores_gemma":[0.9978947,0.0015830644,0.000099861994,0.00021890219,0.0001406669,0.00006299406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021903056,0.0010748641,0.0012959593,0.001469671,0.00075470406,0.0012682924,0.0011662829,0.0007920246,0.0026717226],"category_scores_gemma":[0.004961739,0.00074776495,0.0008028865,0.00157342,0.001513496,0.001730213,0.0012744943,0.0009875022,0.00059618015],"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.00020464514,0.00008928552,0.00082976196,0.00025766285,0.00009195718,0.0001081922,0.00016141884,0.7446112,0.0018853227,0.05662518,0.0033422927,0.19179308],"study_design_scores_gemma":[0.00003898346,0.00009898156,0.0001612061,0.00005253378,0.000034435478,0.00004500417,0.00004284077,0.93473506,0.0017130042,0.059164736,0.0038978984,0.0000152896],"about_ca_topic_score_codex":0.0032658717,"about_ca_topic_score_gemma":0.004121973,"teacher_disagreement_score":0.0032658717,"about_ca_system_score_codex":0.0011573662,"about_ca_system_score_gemma":0.0016584875,"threshold_uncertainty_score":0.011583567},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4806025,0.012717136,0.47094646,0.0021566895,0.00012227028,0.0007748057,0.0011964961,0.0009472029,0.030536447],"genre_scores_gemma":[0.87764496,0.0022800353,0.116324395,0.0001520531,0.00008955097,0.00048658336,0.0011685593,0.00020344004,0.001650479],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98785734,0.007056511,0.00052567443,0.0011010809,0.0031567519,0.00030261307],"domain_scores_gemma":[0.8095861,0.16982776,0.0037693437,0.011221406,0.0047438988,0.00085154385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.028607557,0.0009040052,0.0009550842,0.0032099462,0.0007791507,0.0020211528,0.0019277995,0.0012326555,0.004869885],"category_scores_gemma":[0.13991141,0.0006382722,0.0010120788,0.0051611164,0.0016449922,0.005703008,0.0021480364,0.002765007,0.00059735874],"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.0010135319,0.0012095751,0.059355505,0.0006968116,0.00050585234,0.0001267087,0.0005349555,0.35962167,0.00049925986,0.062146798,0.0076889964,0.5066003],"study_design_scores_gemma":[0.000166531,0.0008479432,0.018720267,0.00019822929,0.00016651177,0.00026055757,0.00035636383,0.9318197,0.00074715377,0.039772592,0.006889168,0.000054888555],"about_ca_topic_score_codex":0.003056568,"about_ca_topic_score_gemma":0.002792399,"teacher_disagreement_score":0.028607557,"about_ca_system_score_codex":0.0020393294,"about_ca_system_score_gemma":0.001772298,"threshold_uncertainty_score":0.15129304},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060067866,0.00044202924,0.980648,0.00024489473,0.000056929224,0.00006190852,0.00025931542,0.0008438123,0.011436285],"genre_scores_gemma":[0.3552021,0.00070996577,0.63581634,0.00014541352,0.000060223134,0.00023338232,0.0009392266,0.00029624693,0.0065970514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992192,0.00025756742,0.00004951212,0.00011219746,0.00026998474,0.000091401365],"domain_scores_gemma":[0.99888974,0.0006338958,0.00006690334,0.0002502828,0.00011223536,0.000046889665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008718964,0.0006615155,0.00072345213,0.00088683906,0.0005231413,0.0014132438,0.001316267,0.00058340025,0.0074533345],"category_scores_gemma":[0.0053490577,0.0004357672,0.0011841666,0.0012616592,0.0010145622,0.002297879,0.0027258964,0.0019745945,0.0010883497],"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.00021113524,0.00007360441,0.000847557,0.00040404708,0.00009416607,0.00015692123,0.00031143829,0.48261294,0.002855197,0.2898096,0.008451074,0.21417232],"study_design_scores_gemma":[0.00003447309,0.00003300673,0.00016269632,0.00005043395,0.000036728274,0.00004804627,0.000060027374,0.74339426,0.0010272687,0.24752668,0.0076152557,0.000011108313],"about_ca_topic_score_codex":0.0058713444,"about_ca_topic_score_gemma":0.009499796,"teacher_disagreement_score":0.0074533345,"about_ca_system_score_codex":0.00089506194,"about_ca_system_score_gemma":0.0012990908,"threshold_uncertainty_score":0.024933875},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028205097,0.0001405615,0.9960824,0.00007863129,0.00001864082,0.00001831402,0.000056154855,0.00028433767,0.0005003885],"genre_scores_gemma":[0.42571533,0.00038246828,0.5702494,0.00014311886,0.00007806233,0.0002632537,0.00055366044,0.00015756472,0.0024571405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989792,0.00036917184,0.00008239679,0.0002001029,0.000270749,0.00009829136],"domain_scores_gemma":[0.9929261,0.0054644067,0.00034776668,0.00052331475,0.0006139715,0.0001245028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025145663,0.0006454047,0.0013050833,0.0014081937,0.00079744274,0.0016928859,0.0019731752,0.0011964724,0.003550494],"category_scores_gemma":[0.017413171,0.0008891819,0.0010471172,0.001538218,0.001224792,0.0030761298,0.0015268822,0.0021698652,0.00064986787],"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.00037989073,0.0000987118,0.0012342406,0.00019131294,0.00012686285,0.000072871015,0.00018654586,0.7599772,0.0014507779,0.06928126,0.0026087204,0.16439167],"study_design_scores_gemma":[0.000009656885,0.000014266861,0.00010409731,0.000010559486,0.000013659038,0.000006575727,0.000012312557,0.97611314,0.00053483085,0.022745717,0.00042901913,0.000006218712],"about_ca_topic_score_codex":0.02791331,"about_ca_topic_score_gemma":0.030982893,"teacher_disagreement_score":0.02791331,"about_ca_system_score_codex":0.0018834576,"about_ca_system_score_gemma":0.0028807742,"threshold_uncertainty_score":0.05550164},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021339217,0.00019510624,0.9735059,0.00020253546,0.000019075873,0.0001565546,0.00066232425,0.0023183355,0.0016009809],"genre_scores_gemma":[0.2022601,0.00035743773,0.7915065,0.000117932745,0.000017882456,0.00043141423,0.00297111,0.00031427463,0.002023243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876153,0.00041738508,0.0001163382,0.00024071537,0.00037930673,0.000084774845],"domain_scores_gemma":[0.99701536,0.0011825375,0.00023003838,0.0011370325,0.00036523107,0.00006989702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008969274,0.0005359741,0.0007254204,0.0018006612,0.00047208922,0.0017087497,0.0017371161,0.00069162395,0.0023953905],"category_scores_gemma":[0.006067924,0.00047163587,0.00076817954,0.0030888035,0.000515153,0.0028679522,0.0013123051,0.0010330097,0.00060408266],"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.000263312,0.0001558911,0.0019944748,0.00033079932,0.000084230545,0.0003874095,0.00041059166,0.4092803,0.011128614,0.11422587,0.009314467,0.4524241],"study_design_scores_gemma":[0.000030810283,0.000048081147,0.00026352037,0.000025803125,0.000021422265,0.00016174224,0.000094467294,0.92081714,0.00630741,0.065969765,0.006239705,0.000020071322],"about_ca_topic_score_codex":0.0031803832,"about_ca_topic_score_gemma":0.0039277473,"teacher_disagreement_score":0.0031803832,"about_ca_system_score_codex":0.00091052573,"about_ca_system_score_gemma":0.0014134665,"threshold_uncertainty_score":0.008013368},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00409277,0.041275524,0.3759185,0.13317749,0.12541425,0.00041623655,0.009513245,0.0041304287,0.30606154],"genre_scores_gemma":[0.2193494,0.023218185,0.28772086,0.03742399,0.051639363,0.0024240937,0.00937676,0.0027294913,0.36611786],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984397,0.00045654536,0.00014178567,0.00026130828,0.0005885981,0.000112063],"domain_scores_gemma":[0.993208,0.0046011787,0.00027501208,0.00048709742,0.0012770438,0.00015159334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028655462,0.0011984999,0.0009406937,0.0013685107,0.0018326419,0.0032138422,0.0038025465,0.0047277925,0.037520956],"category_scores_gemma":[0.017988632,0.0011047812,0.0017117694,0.001358291,0.0038468994,0.008983319,0.002473302,0.007310148,0.010946781],"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.00025138576,0.000049821898,0.00019128926,0.0006641444,0.00006347928,0.0006920758,0.00052590604,0.004823726,0.00065209356,0.35102528,0.5847892,0.056271575],"study_design_scores_gemma":[0.000118324926,0.00008282704,0.0011082779,0.00069650647,0.00009395527,0.0005976733,0.00018062195,0.010543763,0.0014538157,0.3771297,0.6078811,0.0001133211],"about_ca_topic_score_codex":0.01848735,"about_ca_topic_score_gemma":0.023835892,"teacher_disagreement_score":0.037520956,"about_ca_system_score_codex":0.0037767552,"about_ca_system_score_gemma":0.0019370883,"threshold_uncertainty_score":0.12552005},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059628924,0.004068463,0.58369046,0.0012577203,0.00068550307,0.00021032631,0.0002046734,0.0032652442,0.4006547],"genre_scores_gemma":[0.13625515,0.0076640067,0.6134698,0.00090283784,0.00021627118,0.00052268297,0.0007942632,0.0011675804,0.23900744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893314,0.0003671203,0.000068758985,0.00015664918,0.0003927606,0.00008159353],"domain_scores_gemma":[0.99941385,0.00016495705,0.000027332977,0.00019388278,0.00015591478,0.00004404007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013076433,0.00078091345,0.0004301557,0.0007852008,0.001038678,0.0045707542,0.002046904,0.0016902697,0.023191886],"category_scores_gemma":[0.0021700684,0.00057209027,0.00081611454,0.00075824873,0.0013358486,0.0048689856,0.0023967992,0.0017890178,0.009392807],"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.000018199955,0.00002329251,0.000055960667,0.00015588172,0.00001169791,0.0000818736,0.00046738883,0.0035348001,0.0012927837,0.92081255,0.007786516,0.06575902],"study_design_scores_gemma":[0.000017840763,0.000039033646,0.0000669647,0.00017701817,0.00001750816,0.00031734176,0.00021742398,0.02391699,0.002541509,0.23220354,0.74045736,0.000027508213],"about_ca_topic_score_codex":0.0010450921,"about_ca_topic_score_gemma":0.0015755743,"teacher_disagreement_score":0.023191886,"about_ca_system_score_codex":0.0013893342,"about_ca_system_score_gemma":0.0009989719,"threshold_uncertainty_score":0.077584624},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003629639,0.000317223,0.98605704,0.0018171446,0.00008905868,0.00019813955,0.00032580787,0.00070771726,0.0068582343],"genre_scores_gemma":[0.1000976,0.0009246379,0.8916482,0.001051265,0.00016739428,0.00062216766,0.0016597451,0.0002207597,0.0036083465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9859446,0.0075204284,0.0012149776,0.0018312909,0.002767995,0.0007207015],"domain_scores_gemma":[0.9730598,0.020223675,0.001378089,0.002822781,0.0019845332,0.0005312277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011201874,0.0022476697,0.0012687547,0.003022462,0.0026174956,0.007484094,0.0044534635,0.0035115285,0.006190895],"category_scores_gemma":[0.033153746,0.0017348547,0.004456771,0.002508764,0.0053590476,0.014531863,0.006897208,0.0069998465,0.0016709063],"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.00007826763,0.00009826327,0.00048517896,0.0004107984,0.00014435488,0.0003623368,0.0011850756,0.04243468,0.00094139646,0.9226669,0.0044711917,0.02672158],"study_design_scores_gemma":[0.000078332305,0.000035575096,0.0000755934,0.00015528743,0.00007929808,0.0001549528,0.00033980556,0.10170855,0.001992111,0.8699729,0.025374275,0.000033431792],"about_ca_topic_score_codex":0.009063389,"about_ca_topic_score_gemma":0.011485871,"teacher_disagreement_score":0.011201874,"about_ca_system_score_codex":0.0036646086,"about_ca_system_score_gemma":0.0035676719,"threshold_uncertainty_score":0.05924189},"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":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009545072,0.03936978,0.014828337,0.14067526,0.18349616,0.0009899304,0.01842083,0.004448009,0.58822656],"genre_scores_gemma":[0.022579499,0.028486928,0.013108084,0.010067565,0.017630741,0.00073295255,0.035542604,0.0012599989,0.8705917],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.995878,0.00061385066,0.0002804028,0.00052491436,0.002187604,0.0005151854],"domain_scores_gemma":[0.98882383,0.0009812857,0.00035619247,0.0010310846,0.0060731946,0.0027344627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007628318,0.0018746975,0.0011206757,0.0037206903,0.0035776496,0.009688,0.002512245,0.003641915,0.15943591],"category_scores_gemma":[0.009264503,0.0008079654,0.00124935,0.0031605614,0.0006627496,0.0071555623,0.0038583335,0.004547031,0.10372234],"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.00007456458,0.00011704717,0.00023074579,0.00009736469,0.000008441561,0.000049844013,0.000059667706,0.00011380209,0.00023399605,0.0012422857,0.95766944,0.040102728],"study_design_scores_gemma":[0.00001785724,0.000029872188,0.00083975756,0.000119782075,0.000016435055,0.00006230365,0.00023722576,0.00038135378,0.00040514066,0.0011392642,0.9967231,0.000027815595],"about_ca_topic_score_codex":0.009079463,"about_ca_topic_score_gemma":0.025528438,"teacher_disagreement_score":0.15943591,"about_ca_system_score_codex":0.0037313038,"about_ca_system_score_gemma":0.0056140386,"threshold_uncertainty_score":0.53336626},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9709954,0.000076061224,0.025450706,0.00009184925,0.000011148806,0.00005950083,0.000684057,0.0007634389,0.0018678656],"genre_scores_gemma":[0.98633194,0.000024556632,0.012508842,0.000009104004,0.0000012719642,0.000019356343,0.0004900979,0.0000673017,0.00054762117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998062,0.000037498983,0.000013012207,0.000062028834,0.00005705912,0.000024213172],"domain_scores_gemma":[0.9997019,0.000045904406,0.000039549734,0.000037511843,0.00015576917,0.000019293464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005764785,0.00037038975,0.00030116082,0.00044973646,0.00043124246,0.00056935055,0.0010131206,0.00028375973,0.00067191914],"category_scores_gemma":[0.0015505295,0.00030573577,0.00032573598,0.00069233484,0.00024758058,0.00038616775,0.00051666534,0.00039086555,0.00011313983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.000072057046,0.00006741675,0.035995666,0.00003312663,0.00007992236,0.000060236584,0.0001969655,0.9195852,0.0032050651,0.0007862467,0.0006212696,0.039296824],"study_design_scores_gemma":[0.000017112157,0.000012759533,0.010181644,0.0000039978904,0.000012508281,0.0000052047426,0.000037714864,0.9875093,0.001395506,0.00017724028,0.00063872064,0.0000083574105],"about_ca_topic_score_codex":0.58723056,"about_ca_topic_score_gemma":0.62521756,"teacher_disagreement_score":0.41276944,"about_ca_system_score_codex":0.00301959,"about_ca_system_score_gemma":0.004124045,"threshold_uncertainty_score":0.83040065},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030436996,0.001826916,0.9064789,0.0007738572,0.000313865,0.00014082929,0.00005997169,0.0024849423,0.057483688],"genre_scores_gemma":[0.37304014,0.0018989828,0.5952145,0.00028737183,0.00007251302,0.00031302616,0.00018651171,0.0002792542,0.02870772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981326,0.000028694914,0.000016513324,0.00005766202,0.00004625653,0.00003755361],"domain_scores_gemma":[0.999845,0.000025723064,0.000013200625,0.00005074027,0.000038336726,0.000026910304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002989142,0.00045802922,0.00027161103,0.00037112072,0.0009315468,0.0014575662,0.0012842542,0.001000615,0.0036692966],"category_scores_gemma":[0.00067944324,0.00033055493,0.0006473384,0.00034043213,0.0014555688,0.0017026853,0.0019672539,0.0011439099,0.00089303456],"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.000044593242,0.000028134182,0.00029116214,0.00021660433,0.000029172179,0.00023636347,0.00090532453,0.035085425,0.018554829,0.820082,0.00444008,0.120086245],"study_design_scores_gemma":[0.000037398793,0.00015254873,0.0006350026,0.00017741264,0.00008322152,0.00081629626,0.00055718643,0.27494195,0.018950898,0.43407992,0.2694991,0.0000690946],"about_ca_topic_score_codex":0.0023155967,"about_ca_topic_score_gemma":0.0023309328,"teacher_disagreement_score":0.0036692966,"about_ca_system_score_codex":0.00083046476,"about_ca_system_score_gemma":0.00090366893,"threshold_uncertainty_score":0.012274981},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17275058,0.0008435249,0.7718856,0.0011205036,0.000105339954,0.00080195855,0.001061905,0.046536025,0.004894602],"genre_scores_gemma":[0.3458225,0.0004304636,0.6388562,0.0006133898,0.000038654165,0.00018065663,0.0026931856,0.0010582791,0.010306549],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989562,0.00012754866,0.00010705404,0.00034912993,0.00037619288,0.00008385029],"domain_scores_gemma":[0.9948485,0.0024445206,0.00024148972,0.0011537774,0.0011179787,0.00019378169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024493134,0.00086096016,0.0011639987,0.0014766249,0.0007261833,0.002992375,0.0029061574,0.0017671149,0.0039172233],"category_scores_gemma":[0.008350541,0.0009539638,0.0006879426,0.0011421498,0.0004979085,0.0034120688,0.0011297211,0.0013668577,0.0021538218],"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.0009618247,0.0010671908,0.00768388,0.00062034896,0.00023249381,0.0014476354,0.0021070885,0.061518222,0.08276248,0.0036979092,0.013541612,0.82435936],"study_design_scores_gemma":[0.0001318488,0.00025679107,0.004173687,0.00008069993,0.00024571156,0.00055064127,0.00036911076,0.8630044,0.103768736,0.0027805683,0.024560947,0.000076893164],"about_ca_topic_score_codex":0.03050134,"about_ca_topic_score_gemma":0.024092931,"teacher_disagreement_score":0.03050134,"about_ca_system_score_codex":0.0015319043,"about_ca_system_score_gemma":0.0028239673,"threshold_uncertainty_score":0.060647607},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18250921,0.00015750904,0.81388766,0.00027121382,0.00001596539,0.00024484188,0.000090208974,0.00044952816,0.0023738223],"genre_scores_gemma":[0.40086436,0.00010131581,0.59819114,0.000028499897,0.0000074097406,0.00028300798,0.00016064702,0.000095902025,0.00026771784],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99679935,0.0018634305,0.00018589903,0.00031266303,0.000683839,0.00015481809],"domain_scores_gemma":[0.97972715,0.015818125,0.0011265491,0.0014677696,0.0015050679,0.00035530954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006769315,0.0008072993,0.00093463843,0.0047252714,0.0012473161,0.0016418862,0.001614507,0.0007677675,0.0016650084],"category_scores_gemma":[0.027137982,0.00047998482,0.00088407414,0.0027859558,0.00089446484,0.0021667588,0.0022513554,0.0011899031,0.00024222337],"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.0003183576,0.00039335567,0.024497086,0.00047584213,0.00018670337,0.00027042392,0.003792507,0.32220107,0.0087557,0.030547587,0.0014486465,0.60711265],"study_design_scores_gemma":[0.00003444301,0.00013534172,0.004259992,0.00009596926,0.000064914384,0.00008305797,0.0005369793,0.95846725,0.0029718992,0.031503804,0.0018145905,0.00003176644],"about_ca_topic_score_codex":0.0035385164,"about_ca_topic_score_gemma":0.005165682,"teacher_disagreement_score":0.006769315,"about_ca_system_score_codex":0.001663282,"about_ca_system_score_gemma":0.002489962,"threshold_uncertainty_score":0.03579998},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029700726,0.00018892209,0.9634127,0.00043163975,0.000033080058,0.00010536207,0.0001604427,0.0012270187,0.004740089],"genre_scores_gemma":[0.49301913,0.00029164582,0.50258327,0.00023453306,0.000028627206,0.00032813335,0.00046364003,0.00034548642,0.002705446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794596,0.00087782013,0.00017269321,0.00026769986,0.0005625825,0.00017319592],"domain_scores_gemma":[0.9903775,0.006734222,0.00067623355,0.0013882177,0.0006120417,0.00021181592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025608721,0.00063684577,0.0004946926,0.00045545094,0.00063053216,0.0018388007,0.0012951067,0.00092179765,0.0021409397],"category_scores_gemma":[0.010736328,0.00046802394,0.00095861324,0.00074711075,0.0023928974,0.0033918654,0.0017389653,0.0020611766,0.0003816032],"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.00031664933,0.00015324695,0.0016099284,0.00033107118,0.000063832405,0.00046069743,0.0007561791,0.59720975,0.008103204,0.3018727,0.0016818121,0.087440856],"study_design_scores_gemma":[0.000053796946,0.000078025245,0.00017385469,0.000054062482,0.00002870602,0.000078510784,0.00011351946,0.80425155,0.008249309,0.1826266,0.004271241,0.000020937237],"about_ca_topic_score_codex":0.004723975,"about_ca_topic_score_gemma":0.0075815665,"teacher_disagreement_score":0.004723975,"about_ca_system_score_codex":0.0013722609,"about_ca_system_score_gemma":0.0029307115,"threshold_uncertainty_score":0.013543308},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32850462,0.004867414,0.58933985,0.002169217,0.0009374901,0.0003380692,0.0021100047,0.0038781434,0.06785519],"genre_scores_gemma":[0.85310465,0.0014240786,0.11817524,0.0003269311,0.00014463425,0.00041813008,0.00071037316,0.0008373202,0.024858624],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99977106,0.000081004764,0.00000864167,0.00005581884,0.000055697234,0.000027732469],"domain_scores_gemma":[0.99958295,0.00024997946,0.000017909877,0.00006307892,0.000041164974,0.00004501169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005899545,0.0007983373,0.00027783675,0.00040371585,0.0004592234,0.0018371878,0.0005645894,0.0012459335,0.021821395],"category_scores_gemma":[0.0019285218,0.00030474574,0.00031879332,0.00037873664,0.0011091913,0.003219404,0.001110708,0.000996753,0.0025621343],"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.0030052792,0.00044741007,0.0054595005,0.0017920918,0.00017282035,0.0037150471,0.030352551,0.012741273,0.34808043,0.1133453,0.024624728,0.45626366],"study_design_scores_gemma":[0.00078329636,0.002647843,0.054423437,0.00083980476,0.00027193394,0.009475335,0.022323085,0.10688038,0.17788659,0.2514167,0.37259063,0.00046103116],"about_ca_topic_score_codex":0.0010127125,"about_ca_topic_score_gemma":0.0010878355,"teacher_disagreement_score":0.021821395,"about_ca_system_score_codex":0.00037346577,"about_ca_system_score_gemma":0.00035302743,"threshold_uncertainty_score":0.072999895},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014689261,0.017183306,0.9351447,0.0022359148,0.00044174553,0.000086531036,0.00019045209,0.00024460035,0.043003913],"genre_scores_gemma":[0.086269036,0.037561234,0.83197546,0.00087442534,0.0007649039,0.0004718464,0.00083199877,0.0002285894,0.0410225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989778,0.0003899788,0.00008520304,0.00014115276,0.0003665476,0.000039403105],"domain_scores_gemma":[0.99893075,0.00072810723,0.00007034,0.000097644195,0.0001281581,0.000044953544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016359829,0.0014612582,0.0010088678,0.003083109,0.0009055466,0.004908523,0.0029377243,0.0018338583,0.008274606],"category_scores_gemma":[0.0038296718,0.00084265723,0.0011906708,0.0051322947,0.0046429676,0.0071286745,0.0018896861,0.0020888767,0.0015930898],"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.000010288043,0.000041991767,0.00021955163,0.00035605495,0.000043469176,0.000108554486,0.00033242817,0.020528657,0.00020094402,0.879471,0.011442645,0.087244436],"study_design_scores_gemma":[0.0000049414316,0.0000069314647,0.0001215563,0.00015802805,0.000018888362,0.00011866008,0.00017807484,0.028020462,0.00020589917,0.9065404,0.06461314,0.000013089938],"about_ca_topic_score_codex":0.006932635,"about_ca_topic_score_gemma":0.008028284,"teacher_disagreement_score":0.008274606,"about_ca_system_score_codex":0.0027564398,"about_ca_system_score_gemma":0.0021125537,"threshold_uncertainty_score":0.02768135},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053541176,0.056232926,0.014481095,0.052637357,0.79862344,0.0002342597,0.00097388687,0.0009141904,0.07536731],"genre_scores_gemma":[0.0071477545,0.062142536,0.0079723075,0.015063415,0.6224661,0.00038977247,0.0019651358,0.0020495707,0.28080338],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964934,0.00068758556,0.0003152268,0.0005075862,0.0017531124,0.00024302941],"domain_scores_gemma":[0.99089783,0.003941421,0.00040678907,0.00083532516,0.0024830946,0.001435566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035656842,0.0019988166,0.002512141,0.0030406525,0.0019251253,0.009031454,0.0024408207,0.0044715567,0.15879418],"category_scores_gemma":[0.010481324,0.00075065333,0.0027377387,0.0021497316,0.0016325254,0.0062107323,0.0029763214,0.008293057,0.04877236],"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.000022471477,0.00003161105,0.00008770545,0.0003050642,0.000025842543,0.00005192145,0.000039233542,0.00036491946,0.00017351708,0.010572772,0.95711267,0.031212253],"study_design_scores_gemma":[0.0000089857685,0.000031678177,0.00013788998,0.00021486913,0.000010595782,0.00008060805,0.00002955751,0.0007055494,0.00008337894,0.008909339,0.9897776,0.000009748055],"about_ca_topic_score_codex":0.0010705405,"about_ca_topic_score_gemma":0.0014508147,"teacher_disagreement_score":0.15879418,"about_ca_system_score_codex":0.0020613188,"about_ca_system_score_gemma":0.0031462978,"threshold_uncertainty_score":0.5312195},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020520639,0.000316249,0.9745594,0.00026728134,0.0000467357,0.00008130843,0.000097382894,0.0010845453,0.0030263977],"genre_scores_gemma":[0.5839281,0.0003673375,0.41239595,0.00016616912,0.000056596455,0.00020265284,0.000378553,0.00024904034,0.0022556593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981536,0.0006408492,0.00010937998,0.00036661385,0.00055718573,0.00017234508],"domain_scores_gemma":[0.99485344,0.0035771725,0.00034083458,0.0008356371,0.0002853883,0.00010753369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018559359,0.0007442396,0.0008835496,0.0007503147,0.0005419132,0.0010341633,0.0015708812,0.0009190558,0.002443073],"category_scores_gemma":[0.009938689,0.0006617996,0.0010199099,0.00093182194,0.0012727125,0.003295652,0.0022731642,0.0018606005,0.00047352404],"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.00016618724,0.00011212333,0.0006001446,0.00016029709,0.00004141318,0.0001463254,0.00018653579,0.8662734,0.0028334393,0.040705375,0.0013240178,0.08745073],"study_design_scores_gemma":[0.000017326625,0.00004432094,0.00012004029,0.000011299129,0.000012521412,0.000020115154,0.000011964491,0.96006256,0.0014440902,0.037164412,0.0010784131,0.0000129838645],"about_ca_topic_score_codex":0.0043821535,"about_ca_topic_score_gemma":0.007597966,"teacher_disagreement_score":0.0043821535,"about_ca_system_score_codex":0.0011286348,"about_ca_system_score_gemma":0.0020783206,"threshold_uncertainty_score":0.009815276},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0092338035,0.0003430026,0.9831729,0.00027656773,0.00003658548,0.00008487207,0.00009662643,0.0014785889,0.0052771466],"genre_scores_gemma":[0.29595968,0.00060189,0.7001855,0.00015791385,0.000041753316,0.00029071738,0.0003851071,0.00021056495,0.0021668484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851435,0.00053775177,0.00010810586,0.00023212387,0.00047177874,0.00013601709],"domain_scores_gemma":[0.9984945,0.00082284986,0.00016091422,0.00035862913,0.00010489769,0.000058208447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013828019,0.00090965297,0.0007031213,0.00096823554,0.0006772094,0.0012723597,0.0013770558,0.0009147836,0.0031678244],"category_scores_gemma":[0.005611276,0.0005442623,0.0010738336,0.0012620018,0.0027274848,0.0021656065,0.0025853184,0.0016666966,0.0005951648],"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.00014356678,0.000051534367,0.0006454818,0.00024766478,0.00004922192,0.00015283188,0.00025661956,0.7045379,0.003918753,0.1799919,0.0029360824,0.10706843],"study_design_scores_gemma":[0.000032365828,0.000037402744,0.00013349562,0.000045407643,0.000017923712,0.00005785028,0.00003967375,0.83089566,0.0020463453,0.16105242,0.005625478,0.00001591965],"about_ca_topic_score_codex":0.0062507424,"about_ca_topic_score_gemma":0.006166978,"teacher_disagreement_score":0.0062507424,"about_ca_system_score_codex":0.0015701985,"about_ca_system_score_gemma":0.0023545488,"threshold_uncertainty_score":0.012428701},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10936795,0.00035527057,0.8840004,0.00088706333,0.000048086833,0.0001531894,0.00037610126,0.0008602055,0.003951705],"genre_scores_gemma":[0.5558601,0.00033842228,0.43800053,0.00019940826,0.000030878928,0.000231268,0.0009520038,0.000069639726,0.004317751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992254,0.0001725777,0.00008052664,0.00032999646,0.00011984231,0.000071702656],"domain_scores_gemma":[0.99872476,0.000682192,0.00017249567,0.00020648337,0.0001389492,0.000075150085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010175083,0.000684502,0.00078204693,0.0011859168,0.00078047643,0.0010551659,0.0016459118,0.0012114663,0.0036457235],"category_scores_gemma":[0.0045308806,0.00045513993,0.0012385248,0.0012293819,0.0009122903,0.0040193275,0.0019484301,0.0021503363,0.00033811142],"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.00019391674,0.00036454227,0.01053074,0.0003953478,0.00021586256,0.00064184197,0.00082743244,0.5106966,0.0030452535,0.08295707,0.003928457,0.38620296],"study_design_scores_gemma":[0.000017551802,0.000033447875,0.0007426495,0.000020446763,0.000031851025,0.00013198963,0.000130927,0.9312102,0.0017569789,0.06433521,0.0015700733,0.00001878569],"about_ca_topic_score_codex":0.0075312816,"about_ca_topic_score_gemma":0.01065037,"teacher_disagreement_score":0.0075312816,"about_ca_system_score_codex":0.0008762576,"about_ca_system_score_gemma":0.0019105296,"threshold_uncertainty_score":0.014974892},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04006008,0.00040213676,0.9399173,0.00039298052,0.00010187293,0.0002396672,0.00035034007,0.0013110036,0.017224554],"genre_scores_gemma":[0.48491773,0.00030762726,0.5079742,0.0002931946,0.000031710268,0.00030895486,0.0011345958,0.00030102572,0.004730969],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989907,0.00031894367,0.000059881007,0.00019703218,0.00025280667,0.00018058682],"domain_scores_gemma":[0.9980915,0.0010545871,0.00010753722,0.00039356117,0.00024481857,0.000107934844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011230803,0.00076819997,0.0005106019,0.0010047341,0.0006501461,0.0009470391,0.001259609,0.00110672,0.0050711613],"category_scores_gemma":[0.0056872014,0.0003310333,0.000664853,0.00088805327,0.0010033991,0.0015068909,0.001392892,0.00088912726,0.0006310275],"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.00031941957,0.00016091045,0.0018126683,0.0002963073,0.000053218424,0.00030366727,0.0003125298,0.67299944,0.0052459696,0.057247404,0.008774172,0.25247437],"study_design_scores_gemma":[0.000037201182,0.00008530757,0.00030231703,0.00006076614,0.000035516103,0.00009795019,0.000097576514,0.9567975,0.0026326498,0.033711873,0.0061226417,0.000018563564],"about_ca_topic_score_codex":0.005376874,"about_ca_topic_score_gemma":0.009795858,"teacher_disagreement_score":0.005376874,"about_ca_system_score_codex":0.0010789848,"about_ca_system_score_gemma":0.0022085127,"threshold_uncertainty_score":0.016964734},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03500778,0.0009623633,0.955506,0.00021015447,0.000073672934,0.00009262193,0.000098435055,0.0042123348,0.003836622],"genre_scores_gemma":[0.54132825,0.00041945008,0.45400354,0.00019845634,0.000040493716,0.00025935672,0.0003750307,0.00040734033,0.0029680235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988049,0.00033604476,0.00009675532,0.00024012463,0.00036423677,0.00015783151],"domain_scores_gemma":[0.99671656,0.0019853031,0.0002337282,0.0006969096,0.00024192195,0.00012552338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015019273,0.0007855383,0.001068062,0.0010023013,0.00083314657,0.0012788926,0.0025311066,0.0012511791,0.0034342161],"category_scores_gemma":[0.007139145,0.0004755197,0.0006157737,0.0010662575,0.0009196737,0.0023356425,0.0017671982,0.0016084318,0.00077001867],"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.0006022133,0.0003293781,0.0013417418,0.00034004456,0.000090394,0.00031535383,0.00040760424,0.49972335,0.014419555,0.035287388,0.0058505586,0.44129235],"study_design_scores_gemma":[0.00004385215,0.0000687972,0.00019691442,0.000022111672,0.000018860197,0.00008303166,0.000023888726,0.97687167,0.003606313,0.016348796,0.002704768,0.000011059796],"about_ca_topic_score_codex":0.0042780237,"about_ca_topic_score_gemma":0.006416814,"teacher_disagreement_score":0.0042780237,"about_ca_system_score_codex":0.00081692025,"about_ca_system_score_gemma":0.0015855763,"threshold_uncertainty_score":0.011488557},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15809122,0.000388531,0.83425695,0.00024579707,0.000032330023,0.00014447061,0.00008654801,0.0007376153,0.006016559],"genre_scores_gemma":[0.61201537,0.00014903668,0.3860478,0.00012213818,0.000012945932,0.00017232985,0.00010425773,0.00015947605,0.0012167158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906605,0.00037952556,0.000045306206,0.00010947684,0.00027913263,0.00012048483],"domain_scores_gemma":[0.9956726,0.0030866137,0.00029911322,0.0006372975,0.00019008586,0.00011444632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013500757,0.0009084637,0.0007957459,0.00091734447,0.00065360527,0.00078966276,0.0011101327,0.0008508794,0.002003525],"category_scores_gemma":[0.006851583,0.00053726486,0.0008159808,0.00085809326,0.0010276409,0.0018286776,0.0017053782,0.0015932757,0.00019817286],"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.00034525333,0.00019701579,0.0025191964,0.00025262203,0.00008424296,0.00015601992,0.00035456638,0.7492554,0.013381169,0.04714345,0.0016660164,0.18464509],"study_design_scores_gemma":[0.00005931295,0.00015758174,0.0007116174,0.000029447992,0.00006516546,0.000107276384,0.000138302,0.93858874,0.0078032883,0.049688973,0.002627263,0.00002301646],"about_ca_topic_score_codex":0.002153249,"about_ca_topic_score_gemma":0.005708884,"teacher_disagreement_score":0.002153249,"about_ca_system_score_codex":0.0010184093,"about_ca_system_score_gemma":0.0013238183,"threshold_uncertainty_score":0.0073890686},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05920121,0.0007054519,0.9281924,0.00089361024,0.00008747844,0.00011521393,0.00013466249,0.0015046232,0.009165411],"genre_scores_gemma":[0.6478961,0.00042432593,0.3455304,0.000427861,0.0001489444,0.00022656134,0.0004911911,0.00029024374,0.004564441],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987851,0.0004390092,0.000057619753,0.00019881991,0.0003670843,0.0001523982],"domain_scores_gemma":[0.9965203,0.0023351707,0.0002185465,0.00037738946,0.0003646854,0.00018383305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025775123,0.0012860647,0.0015723035,0.0011051281,0.0008745935,0.0013626666,0.0017079366,0.0021761348,0.0040817903],"category_scores_gemma":[0.012154559,0.00066437485,0.0007722876,0.0009849966,0.0018553071,0.0028438845,0.0029815445,0.002312591,0.00074456766],"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.00026525612,0.0001659704,0.0015133923,0.00026637278,0.000044893175,0.0001371273,0.0004044216,0.72626424,0.002397601,0.1342463,0.0056148083,0.12867966],"study_design_scores_gemma":[0.00003140588,0.000052970827,0.00012943054,0.000021168951,0.000011712242,0.000022231974,0.000032358435,0.9321992,0.0005117735,0.065249,0.0017320465,0.0000066734283],"about_ca_topic_score_codex":0.0034974709,"about_ca_topic_score_gemma":0.0049620685,"teacher_disagreement_score":0.0040817903,"about_ca_system_score_codex":0.0012827666,"about_ca_system_score_gemma":0.001735792,"threshold_uncertainty_score":0.013654947},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5262442,0.0011784285,0.4342291,0.0016272677,0.000104280836,0.00019412472,0.0005721668,0.0004938703,0.035356548],"genre_scores_gemma":[0.93427205,0.000259693,0.06253087,0.00022039651,0.000027888282,0.00015932077,0.00022237732,0.00010659671,0.002200887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773896,0.00076274946,0.0001254487,0.00047142318,0.0006377917,0.00026361147],"domain_scores_gemma":[0.9801577,0.014916121,0.0012093886,0.002239476,0.00070634426,0.00077102263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019833795,0.0007460791,0.0010159648,0.0009453191,0.0010185189,0.0020971678,0.0017219073,0.0016722908,0.007903937],"category_scores_gemma":[0.01946603,0.00053436396,0.00075765676,0.0010855611,0.0015973975,0.0044523473,0.0022204078,0.0020512207,0.0006863696],"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.0015517529,0.001024747,0.011984312,0.00078693853,0.00033947034,0.0008844354,0.00042650526,0.49037868,0.021373885,0.23813589,0.0052725417,0.22784084],"study_design_scores_gemma":[0.00018490113,0.0008404657,0.0085683325,0.00006507508,0.000114372284,0.0007926464,0.00027367406,0.47390175,0.0067469557,0.5019615,0.0064739063,0.00007645076],"about_ca_topic_score_codex":0.0008624044,"about_ca_topic_score_gemma":0.0012959167,"teacher_disagreement_score":0.007903937,"about_ca_system_score_codex":0.00090055825,"about_ca_system_score_gemma":0.00089437654,"threshold_uncertainty_score":0.026441276},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010954882,0.00020074013,0.96717507,0.00013283255,0.00007302944,0.00017140927,0.00016801266,0.0131525,0.007971568],"genre_scores_gemma":[0.2916936,0.00019195014,0.69751316,0.00019613476,0.00003517975,0.000675881,0.000550778,0.0005489314,0.008594388],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995443,0.00013775396,0.000039665723,0.00008529194,0.00014214477,0.00005079859],"domain_scores_gemma":[0.9994217,0.0002738069,0.00004520488,0.0000738954,0.00008904124,0.00009650727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009619866,0.0007058571,0.0004533467,0.00045286008,0.000581362,0.0012128472,0.0018698694,0.0007526582,0.009390537],"category_scores_gemma":[0.0017959954,0.00037294388,0.0004822136,0.00042723783,0.00055467844,0.0012177646,0.0020888995,0.0010569255,0.0016266335],"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.0021104699,0.00086200796,0.0023626136,0.0010753793,0.00032156432,0.0021010234,0.0017359209,0.15878612,0.06655434,0.16504952,0.027979631,0.5710614],"study_design_scores_gemma":[0.00017751628,0.00036183462,0.00030202905,0.00005533815,0.000087180684,0.0003278663,0.000109127184,0.8960069,0.026205678,0.027942726,0.048355743,0.00006817044],"about_ca_topic_score_codex":0.0020063233,"about_ca_topic_score_gemma":0.0038179941,"teacher_disagreement_score":0.009390537,"about_ca_system_score_codex":0.00039151104,"about_ca_system_score_gemma":0.0009854251,"threshold_uncertainty_score":0.03141445},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43778953,0.00043013738,0.53440017,0.001069924,0.00008226412,0.00014853905,0.00019711716,0.00029698503,0.02558539],"genre_scores_gemma":[0.9430265,0.00023516142,0.05095449,0.00006366332,0.00001752853,0.00018725776,0.00007713377,0.000028101938,0.005410177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998307,0.000067209614,0.000008213529,0.000045123907,0.000025643974,0.00002302039],"domain_scores_gemma":[0.9994973,0.0003012431,0.00006260481,0.000046937515,0.00003809241,0.000053828295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041187438,0.00042718695,0.00034143907,0.00023970492,0.00030544444,0.0013664009,0.000715197,0.0009377666,0.003341922],"category_scores_gemma":[0.0016353677,0.00030692294,0.0007369129,0.0002285387,0.0007688591,0.00144708,0.0010353299,0.00066516263,0.0003633903],"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.00011265769,0.000097771976,0.0010875531,0.0000518235,0.00003873868,0.0001602102,0.00044078843,0.952466,0.003762489,0.032915317,0.00031132702,0.008555262],"study_design_scores_gemma":[0.000024910369,0.00005357874,0.00048235102,0.0000062247123,0.000010329468,0.000016651808,0.00004278315,0.986219,0.00023045632,0.01232076,0.0005830645,0.0000098266855],"about_ca_topic_score_codex":0.006873191,"about_ca_topic_score_gemma":0.0048333993,"teacher_disagreement_score":0.006873191,"about_ca_system_score_codex":0.0007698778,"about_ca_system_score_gemma":0.00063052826,"threshold_uncertainty_score":0.013666391},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0664133,0.115525454,0.32861462,0.341218,0.0019881846,0.00025357128,0.00043483384,0.0007577817,0.14479432],"genre_scores_gemma":[0.8353256,0.033636305,0.10930317,0.0073521645,0.0021789924,0.00024386364,0.00033904644,0.00013819354,0.011482752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829084,0.0010897398,0.000054204942,0.00023738846,0.00023460157,0.00009326742],"domain_scores_gemma":[0.9899692,0.008656312,0.00034449945,0.00032048087,0.00036912021,0.00034037456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036948796,0.00047812954,0.00040325927,0.0019284649,0.0015058538,0.009444544,0.0009522915,0.0026827431,0.006485507],"category_scores_gemma":[0.010348931,0.0006152361,0.0007199034,0.0016677465,0.012935015,0.0150748305,0.0025842562,0.0032165193,0.0007226962],"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.00006959378,0.000058092184,0.002893712,0.00039943293,0.00005450874,0.00032290912,0.007769714,0.0026183566,0.001185114,0.8997839,0.017299134,0.0675456],"study_design_scores_gemma":[0.000014385742,0.000018855373,0.0016259666,0.00019404091,0.000018688916,0.00020840594,0.0022327446,0.005262081,0.00035804065,0.96225303,0.027779179,0.000034647444],"about_ca_topic_score_codex":0.0022243562,"about_ca_topic_score_gemma":0.0020034353,"teacher_disagreement_score":0.009444544,"about_ca_system_score_codex":0.0018765846,"about_ca_system_score_gemma":0.0013647538,"threshold_uncertainty_score":0.02169615},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.283493,0.00939007,0.6427615,0.0034903202,0.0005141211,0.00019776441,0.00044042594,0.0018922777,0.05782053],"genre_scores_gemma":[0.7713318,0.005314502,0.18761683,0.00041394375,0.00008960481,0.00015128708,0.0003825,0.00026894815,0.03443069],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997272,0.000036799094,0.000011571045,0.00009359601,0.00010054696,0.000030261735],"domain_scores_gemma":[0.9994924,0.00018873526,0.000063407504,0.000101168196,0.000106902604,0.00004744566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000555598,0.00071862567,0.00040172986,0.0007256178,0.00079071504,0.0021715818,0.00084018015,0.0014647173,0.010976305],"category_scores_gemma":[0.002190543,0.0006830553,0.0007815169,0.00058838446,0.0016452961,0.0022674904,0.0016384552,0.0009052554,0.002006541],"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.00035703642,0.00010565478,0.010233126,0.0012834534,0.0002140741,0.0023655754,0.004860251,0.066703714,0.48512965,0.07874031,0.0050807795,0.34492627],"study_design_scores_gemma":[0.00008844626,0.0009507404,0.082664154,0.001119784,0.00046160398,0.0066734743,0.00616247,0.3244857,0.24049039,0.14403011,0.19252118,0.0003519572],"about_ca_topic_score_codex":0.008089677,"about_ca_topic_score_gemma":0.009693552,"teacher_disagreement_score":0.010976305,"about_ca_system_score_codex":0.0009692259,"about_ca_system_score_gemma":0.0010875558,"threshold_uncertainty_score":0.03671944},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016667243,0.00441744,0.88990724,0.0014121525,0.00015691135,0.00023157244,0.000150308,0.00019720531,0.08685988],"genre_scores_gemma":[0.5591894,0.008244574,0.37507764,0.00017626179,0.00015409966,0.0009900988,0.00034597248,0.0002144434,0.05560747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99722904,0.0017333471,0.0001154956,0.00033807155,0.00040875093,0.00017525646],"domain_scores_gemma":[0.9973437,0.0019271898,0.00016257733,0.00021842231,0.00018114237,0.00016691023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003018888,0.0010175592,0.0014717333,0.0011917112,0.0013688508,0.0034239532,0.0014820074,0.0020151762,0.018077768],"category_scores_gemma":[0.007721,0.0011835137,0.0011015324,0.0032880094,0.002284309,0.003103734,0.0034614739,0.0019443063,0.0018028917],"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.00009130989,0.00010920601,0.0004031562,0.0005153452,0.00012451527,0.00010234506,0.0005652594,0.45903742,0.0005672429,0.41792464,0.00847557,0.11208402],"study_design_scores_gemma":[0.00006701889,0.00011562346,0.00016631416,0.00019351747,0.00004366029,0.00003746191,0.0003206638,0.31698525,0.00040272664,0.6606424,0.021001365,0.000023920464],"about_ca_topic_score_codex":0.0038711487,"about_ca_topic_score_gemma":0.0046545793,"teacher_disagreement_score":0.018077768,"about_ca_system_score_codex":0.0030316,"about_ca_system_score_gemma":0.003219392,"threshold_uncertainty_score":0.060476124},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7867392,0.0010035774,0.20642953,0.0006899641,0.00006665782,0.00011529131,0.00041490252,0.0015116009,0.0030293015],"genre_scores_gemma":[0.9766049,0.000112606285,0.021859612,0.00012149673,0.000025778725,0.00008931011,0.00042831825,0.00024267168,0.0005153781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99475706,0.0019705836,0.0002441825,0.0013151075,0.00094340753,0.000769699],"domain_scores_gemma":[0.9446234,0.042578746,0.0037404583,0.0060145175,0.0019165862,0.0011263167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007461968,0.00066431274,0.0012385154,0.0011824623,0.00080655195,0.0014081174,0.0016060676,0.0010310055,0.0023341863],"category_scores_gemma":[0.04783374,0.00080011407,0.0010806075,0.0012463091,0.0023435939,0.0024796287,0.0012831069,0.002841241,0.0002731872],"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.0008484682,0.000289949,0.021167776,0.00021965917,0.000285591,0.0003499838,0.000542538,0.9171406,0.006557552,0.02176671,0.0025912148,0.028239936],"study_design_scores_gemma":[0.000059863716,0.00024967993,0.007834337,0.00002706733,0.000048953556,0.00018782592,0.00015610881,0.9589068,0.0039186105,0.027919106,0.0006494896,0.000042235468],"about_ca_topic_score_codex":0.0032226925,"about_ca_topic_score_gemma":0.005144219,"teacher_disagreement_score":0.007461968,"about_ca_system_score_codex":0.0016686592,"about_ca_system_score_gemma":0.0013555784,"threshold_uncertainty_score":0.039463103},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007465805,0.00034093758,0.9840641,0.0002402789,0.000043335513,0.0000887221,0.00013335618,0.0007540674,0.0068693394],"genre_scores_gemma":[0.19070241,0.00037118598,0.80626625,0.00015896342,0.00003086573,0.00026461823,0.0003152198,0.00026599615,0.0016244466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801934,0.0009486857,0.00013437784,0.0002542234,0.00045064866,0.00019281569],"domain_scores_gemma":[0.99404776,0.0044677206,0.00042606212,0.00058347743,0.0003510572,0.00012391264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026755151,0.001131051,0.0008339635,0.001238014,0.00064001436,0.002171685,0.0015411619,0.0009475901,0.0061706146],"category_scores_gemma":[0.00902045,0.00077563815,0.0011517752,0.0018120428,0.0013891483,0.0022302067,0.0012775717,0.0025005355,0.00094125187],"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.00008370608,0.00008451495,0.00024606127,0.0001423777,0.000026271502,0.000036109024,0.000075859345,0.8696722,0.0007845844,0.06908443,0.001997979,0.05776597],"study_design_scores_gemma":[0.000016987311,0.000032022348,0.00004030877,0.000028317545,0.0000080068085,0.000012223243,0.000020331032,0.9651819,0.0005775129,0.032353435,0.001720995,0.000007986416],"about_ca_topic_score_codex":0.007774509,"about_ca_topic_score_gemma":0.009533723,"teacher_disagreement_score":0.007774509,"about_ca_system_score_codex":0.0026649653,"about_ca_system_score_gemma":0.0034555902,"threshold_uncertainty_score":0.020642698},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019929824,0.029657587,0.15539949,0.066054754,0.0036229198,0.00011940071,0.0003420511,0.0010648444,0.7238092],"genre_scores_gemma":[0.5522258,0.03731753,0.1321977,0.015122525,0.002938507,0.00042324266,0.000631269,0.0007085727,0.25843483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970879,0.0008352204,0.00011743748,0.000691603,0.000994801,0.00027315735],"domain_scores_gemma":[0.9976687,0.00076263613,0.00017536666,0.0006270827,0.0005491627,0.00021705155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032477842,0.001184961,0.0005869055,0.0017869592,0.0027396532,0.007605574,0.0016956959,0.004006796,0.012264186],"category_scores_gemma":[0.005452519,0.00061021704,0.0011607385,0.0013501355,0.020391954,0.010822756,0.005155207,0.0060582655,0.00424676],"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.000025021356,0.000009412352,0.00019560712,0.000099301156,0.000011432278,0.000057097484,0.0010767152,0.0009134125,0.0004899729,0.9692227,0.007624125,0.020275224],"study_design_scores_gemma":[0.000020494384,0.000045041514,0.0005619994,0.0003018595,0.000017317272,0.00024808012,0.0008633401,0.0022860817,0.0013587254,0.40269992,0.591559,0.000038118662],"about_ca_topic_score_codex":0.011593351,"about_ca_topic_score_gemma":0.0068068835,"teacher_disagreement_score":0.012264186,"about_ca_system_score_codex":0.005583033,"about_ca_system_score_gemma":0.004478943,"threshold_uncertainty_score":0.041027784},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032803072,0.000068613976,0.9944792,0.00016670278,0.000014759241,0.000107808824,0.00005886903,0.00037241128,0.0014512986],"genre_scores_gemma":[0.1388581,0.0001678611,0.85871893,0.000114574956,0.00002163397,0.00029230397,0.00024040132,0.0000506561,0.0015356723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980191,0.0006230959,0.00021276799,0.0004860619,0.00057572953,0.00008331891],"domain_scores_gemma":[0.9969606,0.0016860056,0.00031650058,0.0004507101,0.00044874815,0.00013741308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022711137,0.0011746164,0.0008295307,0.002302637,0.00077482895,0.0017032811,0.0029488744,0.00152151,0.0046178326],"category_scores_gemma":[0.010060886,0.0006624136,0.0015952877,0.0016781363,0.0016202658,0.0029394429,0.00176723,0.0019021246,0.0004950626],"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.00008923748,0.00039157167,0.00347926,0.00026335265,0.00019507008,0.00026411688,0.00044102702,0.59227353,0.003457159,0.13643996,0.0030502644,0.25965542],"study_design_scores_gemma":[0.000013182434,0.00004227311,0.00021197862,0.000020019295,0.000026495394,0.000072874325,0.000033293607,0.9564774,0.0014959031,0.039530855,0.0020621319,0.000013632106],"about_ca_topic_score_codex":0.0079255635,"about_ca_topic_score_gemma":0.008994078,"teacher_disagreement_score":0.0079255635,"about_ca_system_score_codex":0.0017262668,"about_ca_system_score_gemma":0.0017499184,"threshold_uncertainty_score":0.015758872},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027898522,0.00016455536,0.96776897,0.00021100671,0.000032843753,0.000078735044,0.0003784508,0.0015910188,0.0018758666],"genre_scores_gemma":[0.40042093,0.00022859807,0.5950119,0.00015537013,0.000020956191,0.00025847342,0.0010006392,0.00027121734,0.002631971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937433,0.00014602397,0.000041309348,0.00022203442,0.00014901896,0.000067306355],"domain_scores_gemma":[0.9983139,0.0010768903,0.00013507468,0.00025235294,0.00017268522,0.000049159557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066149567,0.00078626885,0.00063885644,0.00046437923,0.00028125185,0.0008307806,0.0012901034,0.0007815347,0.0051007373],"category_scores_gemma":[0.003727128,0.00056680065,0.0008798036,0.00074809964,0.001014483,0.0024660479,0.0013102862,0.0021571345,0.0005059656],"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.00008368976,0.000042133935,0.00039035233,0.00008599922,0.000022865348,0.000049631188,0.000059438324,0.93976474,0.0011456808,0.012716621,0.0007521447,0.044886734],"study_design_scores_gemma":[0.000009388513,0.000013304288,0.00004168315,0.0000068697914,0.0000052002397,0.000009121405,0.000008662492,0.98791194,0.0005531619,0.010938337,0.0004988454,0.0000035221835],"about_ca_topic_score_codex":0.013667484,"about_ca_topic_score_gemma":0.02484122,"teacher_disagreement_score":0.013667484,"about_ca_system_score_codex":0.0016661604,"about_ca_system_score_gemma":0.0016975616,"threshold_uncertainty_score":0.027175903},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004142925,0.00029984917,0.9804968,0.00017044596,0.000063501284,0.00016678269,0.00034653716,0.011653757,0.002659405],"genre_scores_gemma":[0.04740334,0.00016239539,0.94537777,0.00023992563,0.00004076307,0.00028077234,0.0010807847,0.0021448634,0.003269441],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858934,0.0003266295,0.00012580228,0.00024030554,0.0005648136,0.00015299504],"domain_scores_gemma":[0.9978957,0.00095394964,0.00017231879,0.00058710575,0.00027229468,0.00011851387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019228644,0.001201109,0.0011483249,0.002145255,0.00091176503,0.0012998341,0.002763351,0.0012182577,0.009785345],"category_scores_gemma":[0.0064840103,0.00097574224,0.0019627952,0.001702776,0.0011268948,0.0033376666,0.0041919323,0.0022507452,0.0027088507],"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.0005978957,0.00018160329,0.0016450948,0.00092747837,0.00018715244,0.00026329726,0.00054389285,0.06501036,0.0141289625,0.037405048,0.043618847,0.8354904],"study_design_scores_gemma":[0.00041079408,0.0002491174,0.00076793734,0.00013949533,0.00013899946,0.00035552384,0.0002739718,0.8135482,0.022153411,0.07758121,0.08426635,0.00011495494],"about_ca_topic_score_codex":0.0023352094,"about_ca_topic_score_gemma":0.005862273,"teacher_disagreement_score":0.009785345,"about_ca_system_score_codex":0.0007958653,"about_ca_system_score_gemma":0.0023849178,"threshold_uncertainty_score":0.03273529},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49838588,0.0005835671,0.49086225,0.0005316741,0.00007282115,0.00016718233,0.0009085953,0.004126866,0.0043611582],"genre_scores_gemma":[0.89442176,0.000099367426,0.1038718,0.000059917682,0.00002259919,0.00014033167,0.00064824504,0.00010841096,0.0006275625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984471,0.00036422643,0.00010155445,0.00045821085,0.00044742465,0.00018157449],"domain_scores_gemma":[0.9769031,0.016221952,0.0014520346,0.0025087027,0.0022286281,0.00068563095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038287442,0.0010166813,0.0011500863,0.0026828197,0.00064828765,0.0012439383,0.0021074333,0.0014275502,0.001426518],"category_scores_gemma":[0.03178844,0.0006910454,0.0006561318,0.001758012,0.0011067421,0.002972776,0.0012450893,0.0024117036,0.00065141195],"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.00052831287,0.000212375,0.06304832,0.00011345661,0.00011761976,0.00007533115,0.00019410407,0.7534927,0.0025387425,0.007257174,0.0029919972,0.1694299],"study_design_scores_gemma":[0.0000075521066,0.000026464228,0.0018313194,0.0000037615598,0.000008058151,0.0000146186,0.000010918327,0.9941446,0.0012408989,0.002588212,0.00011521174,0.000008421241],"about_ca_topic_score_codex":0.012052972,"about_ca_topic_score_gemma":0.009728862,"teacher_disagreement_score":0.012052972,"about_ca_system_score_codex":0.0022726408,"about_ca_system_score_gemma":0.0016673179,"threshold_uncertainty_score":0.023965657},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004576968,0.92856365,0.020593323,0.00797759,0.0006329545,0.000032332176,0.0001215313,0.00013348201,0.037368216],"genre_scores_gemma":[0.06068596,0.9081975,0.018769164,0.0022743552,0.0015276042,0.000119565324,0.00024526194,0.000103692386,0.008076908],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985728,0.00043572165,0.00014774184,0.0002966751,0.00044608684,0.00010099658],"domain_scores_gemma":[0.99518365,0.0033776544,0.00021204376,0.0003634688,0.0006700319,0.00019312401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031027393,0.0014274631,0.0010750378,0.005226342,0.0010401668,0.003943071,0.0016474662,0.002095449,0.0063612764],"category_scores_gemma":[0.0063906214,0.0007137229,0.0008174411,0.005385186,0.004648149,0.008340194,0.0025257391,0.0030370639,0.0015736514],"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.000070921444,0.00006499508,0.0012285236,0.0043394943,0.00008870821,0.000117256655,0.0016125459,0.003292379,0.0007461263,0.3832398,0.016738197,0.58846104],"study_design_scores_gemma":[0.000010491668,0.00008988721,0.0024865184,0.003933823,0.00004971002,0.00051009096,0.00082354236,0.0020589076,0.0006172372,0.302117,0.687238,0.000064932225],"about_ca_topic_score_codex":0.0039274623,"about_ca_topic_score_gemma":0.0030353304,"teacher_disagreement_score":0.0063612764,"about_ca_system_score_codex":0.0036166473,"about_ca_system_score_gemma":0.0031379128,"threshold_uncertainty_score":0.026240706},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008941397,0.000929346,0.9126865,0.0023941556,0.00022032659,0.00009452111,0.00069776067,0.001137226,0.07289875],"genre_scores_gemma":[0.25861818,0.00174194,0.68562305,0.00073099055,0.0001915218,0.00046230518,0.0015942176,0.00069108297,0.050346777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892277,0.00034965298,0.00009001769,0.000182046,0.00036769078,0.000087710316],"domain_scores_gemma":[0.99905473,0.00044976815,0.000073112955,0.00019652308,0.00017140606,0.00005446642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081975287,0.00059306226,0.0005624187,0.00096633297,0.00090431445,0.002199485,0.0010485592,0.001326789,0.010803986],"category_scores_gemma":[0.0043019587,0.00036364296,0.0007907426,0.0013664485,0.0020691631,0.004580293,0.00193747,0.0018144292,0.003820556],"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.00004050891,0.000011553761,0.00008426597,0.00006357867,0.0000063689754,0.000076237084,0.00013742123,0.019240769,0.00074494357,0.93412817,0.0053073536,0.04015885],"study_design_scores_gemma":[0.000012608482,0.000025300444,0.00006133119,0.000031449967,0.000007908885,0.0000694356,0.000058640173,0.060993105,0.0018762279,0.87465996,0.062188834,0.000015131304],"about_ca_topic_score_codex":0.0040739668,"about_ca_topic_score_gemma":0.004328634,"teacher_disagreement_score":0.010803986,"about_ca_system_score_codex":0.0015014503,"about_ca_system_score_gemma":0.0013153577,"threshold_uncertainty_score":0.036142945},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015972074,0.00045310083,0.45705634,0.013225268,0.00097019837,0.0009773752,0.0010750901,0.028762177,0.48150834],"genre_scores_gemma":[0.16261478,0.0008178165,0.5497349,0.0051957383,0.00029791283,0.00080987276,0.0016147536,0.0029935532,0.2759206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933964,0.00020130344,0.000038451693,0.000108254244,0.00021156136,0.00010075664],"domain_scores_gemma":[0.9989911,0.00035018267,0.000070563554,0.00015819186,0.00018989453,0.00023995875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010411588,0.000749083,0.00047368833,0.00086589606,0.0017605125,0.0023819164,0.0013474239,0.0015375335,0.093395524],"category_scores_gemma":[0.0035608846,0.00042078397,0.0006631441,0.00042688852,0.0008892933,0.002679822,0.0027208559,0.0016648932,0.023029968],"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.0011338629,0.00046100013,0.0023654348,0.00044870662,0.00008917476,0.0010778037,0.0020561898,0.008599599,0.008589973,0.14055689,0.37164456,0.4629769],"study_design_scores_gemma":[0.00019631578,0.00029162393,0.0009180831,0.0002383679,0.00006280347,0.00060657575,0.0012698057,0.08066417,0.005485592,0.07261612,0.8375542,0.00009629052],"about_ca_topic_score_codex":0.01239724,"about_ca_topic_score_gemma":0.037150607,"teacher_disagreement_score":0.093395524,"about_ca_system_score_codex":0.0008399513,"about_ca_system_score_gemma":0.002156209,"threshold_uncertainty_score":0.3124392},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076556054,0.0000362454,0.9852683,0.0001900317,0.000024779358,0.0001425989,0.0004254822,0.011031661,0.00211522],"genre_scores_gemma":[0.029804984,0.00016064699,0.96242213,0.00024214605,0.00002440237,0.00054121885,0.0010880228,0.002250716,0.0034657286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996648,0.0010169598,0.0005239311,0.0005635251,0.0010420091,0.00020555411],"domain_scores_gemma":[0.98865396,0.00791192,0.00073234166,0.0016341384,0.00079989934,0.00026770594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008260602,0.0013565123,0.0008603788,0.0030587602,0.001437626,0.0037817927,0.0033569615,0.0020845304,0.017452417],"category_scores_gemma":[0.02027849,0.0020109583,0.0028315804,0.0016493426,0.002766667,0.0075419177,0.004827474,0.0036648645,0.0033456679],"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.0002816577,0.00021971574,0.0025767202,0.0013290257,0.00015459627,0.001281837,0.0025450822,0.0685665,0.009435147,0.6923212,0.027407648,0.19388084],"study_design_scores_gemma":[0.00015036392,0.000092105336,0.00040015051,0.00048806504,0.0000753808,0.00085104955,0.00035154005,0.38311648,0.016201893,0.34767374,0.2504635,0.00013580013],"about_ca_topic_score_codex":0.005856892,"about_ca_topic_score_gemma":0.00908894,"teacher_disagreement_score":0.017452417,"about_ca_system_score_codex":0.0021221219,"about_ca_system_score_gemma":0.0030964995,"threshold_uncertainty_score":0.05838418},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01333891,0.000284606,0.98222995,0.00026166526,0.00003563988,0.00010923738,0.000029294682,0.00011047161,0.003600199],"genre_scores_gemma":[0.21394752,0.00027039688,0.7836378,0.00014287193,0.00002514771,0.000393316,0.00006328697,0.000040488598,0.0014791503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994531,0.00027377345,0.000024545445,0.00006278584,0.00014574442,0.00004004846],"domain_scores_gemma":[0.99907076,0.0006913987,0.00009081836,0.000048527723,0.00006881687,0.000029532806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014709164,0.0009607843,0.00072097237,0.0012449619,0.0007010725,0.00087187724,0.0014720057,0.0014342108,0.0014027294],"category_scores_gemma":[0.0026825378,0.0005311278,0.0012567532,0.0010974209,0.0012236405,0.0007228708,0.0010312594,0.0015537625,0.00016165074],"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.000022528764,0.000041235886,0.00025543157,0.0000651731,0.000051112875,0.00004939702,0.000060809805,0.94251204,0.001975675,0.02825273,0.0003841059,0.026329724],"study_design_scores_gemma":[0.000013715194,0.000040013936,0.000042549505,0.000014167683,0.000012981371,0.00002512337,0.000013611836,0.9882422,0.000576301,0.010100156,0.00091294735,0.000006183408],"about_ca_topic_score_codex":0.0026164602,"about_ca_topic_score_gemma":0.003128512,"teacher_disagreement_score":0.0026164602,"about_ca_system_score_codex":0.0013350702,"about_ca_system_score_gemma":0.0016755253,"threshold_uncertainty_score":0.009686649},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0094397385,0.00028264415,0.9660035,0.00021500915,0.000055714132,0.0002689781,0.0002917492,0.0013209726,0.022121813],"genre_scores_gemma":[0.20116095,0.0005679556,0.78180695,0.0002459953,0.000035376714,0.0008086836,0.0011408896,0.0008192011,0.013414079],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838674,0.0005509759,0.00007841868,0.00021917436,0.0006203455,0.00014438486],"domain_scores_gemma":[0.99635977,0.0019491205,0.00013386951,0.000951729,0.00049913325,0.00010644292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016225908,0.0007120621,0.0005518913,0.0010024317,0.000678699,0.0017503193,0.0017367987,0.0011518444,0.015258003],"category_scores_gemma":[0.008274226,0.00043829743,0.0009625408,0.0008873115,0.0013470319,0.002484436,0.0029356454,0.001016169,0.002671236],"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.00024598307,0.0002081672,0.0010703839,0.0008378069,0.0000626782,0.0005539449,0.000958913,0.19709243,0.015450263,0.37909043,0.014216913,0.39021218],"study_design_scores_gemma":[0.00010832498,0.00024205945,0.00057792367,0.00028558483,0.00006143379,0.0006567715,0.00038813538,0.5392051,0.01979027,0.3544959,0.08411956,0.00006891034],"about_ca_topic_score_codex":0.0008967308,"about_ca_topic_score_gemma":0.0016540887,"teacher_disagreement_score":0.015258003,"about_ca_system_score_codex":0.0006646227,"about_ca_system_score_gemma":0.001220117,"threshold_uncertainty_score":0.051043153},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003304288,0.00010443304,0.9940006,0.00019208435,0.000025156485,0.0000927895,0.00009520578,0.0013168108,0.00086862996],"genre_scores_gemma":[0.19619018,0.0001335628,0.80079746,0.00022469347,0.000059530237,0.00042286576,0.0006637991,0.0003090791,0.0011987733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.987911,0.00614549,0.00095340423,0.0015781276,0.0027021891,0.00070979417],"domain_scores_gemma":[0.9540765,0.0319724,0.0023064837,0.006431702,0.0038723892,0.0013405049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013731564,0.0013724059,0.0013566118,0.0022904975,0.00077524397,0.0030273527,0.0067796973,0.0030168607,0.0037480816],"category_scores_gemma":[0.08273254,0.0012735067,0.002760796,0.0012697804,0.0048489403,0.006546552,0.0059542996,0.004738107,0.0008625243],"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.00060558284,0.0007969147,0.009317645,0.00049015525,0.0005401925,0.0006727274,0.00083953625,0.46342915,0.00531466,0.31187314,0.004288911,0.20183137],"study_design_scores_gemma":[0.000038307964,0.00010883408,0.00038978845,0.000059666865,0.000042902437,0.0000646051,0.00007686957,0.8435277,0.0021219125,0.1518337,0.0017146277,0.000021056856],"about_ca_topic_score_codex":0.015920639,"about_ca_topic_score_gemma":0.014019654,"teacher_disagreement_score":0.015920639,"about_ca_system_score_codex":0.001939941,"about_ca_system_score_gemma":0.0037891762,"threshold_uncertainty_score":0.07262033},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012615001,0.0051085665,0.8852609,0.0073026526,0.000304613,0.0002994584,0.00024669684,0.000363787,0.08849835],"genre_scores_gemma":[0.72571325,0.002818899,0.26303762,0.00070893945,0.00032486665,0.00062041247,0.0004423667,0.00006746158,0.0062661706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99280035,0.0040655183,0.00045242335,0.0011892244,0.00102587,0.0004665538],"domain_scores_gemma":[0.98391217,0.010865361,0.0010168921,0.0025229556,0.0008771615,0.0008054774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066045467,0.000920925,0.0011074233,0.0018164875,0.0031049629,0.007284255,0.0034199518,0.0036300388,0.008478145],"category_scores_gemma":[0.021599205,0.0011616107,0.0012396885,0.0020084248,0.0072101974,0.010309215,0.006896215,0.0028722931,0.0016236294],"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.00004812638,0.000114163806,0.00048329515,0.00021878215,0.00009926265,0.00022806072,0.0013899016,0.010288604,0.0004921209,0.9568475,0.003236837,0.02655339],"study_design_scores_gemma":[0.00002243556,0.000025711977,0.00019918715,0.00007670127,0.000035144407,0.00010281476,0.00033408112,0.02999934,0.00026771348,0.959755,0.009165593,0.000016162749],"about_ca_topic_score_codex":0.004189926,"about_ca_topic_score_gemma":0.0025994603,"teacher_disagreement_score":0.008478145,"about_ca_system_score_codex":0.0022205792,"about_ca_system_score_gemma":0.0035133676,"threshold_uncertainty_score":0.03492862},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013889489,0.00033534583,0.9763525,0.00032878845,0.00005464397,0.00011409578,0.00021471057,0.0013622869,0.007348033],"genre_scores_gemma":[0.378216,0.00032962675,0.61590445,0.00035810348,0.000036369038,0.00031169096,0.0006812328,0.0004147929,0.0037477221],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942577,0.00016883564,0.000039216528,0.00012957268,0.0001588168,0.00007784989],"domain_scores_gemma":[0.99842715,0.0011283823,0.0000927398,0.0001495123,0.00015641031,0.000045815974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000793537,0.00078809354,0.0005463319,0.00065924536,0.00040683034,0.0011155668,0.0014783011,0.0009289826,0.005522368],"category_scores_gemma":[0.00450811,0.0004524004,0.0008259738,0.00079898036,0.0009076907,0.0016213498,0.0013579663,0.0018671037,0.00082158076],"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.0001504207,0.00018394148,0.00061904156,0.0003042453,0.000092541326,0.00016312496,0.00011656926,0.6733792,0.007826538,0.064188324,0.0057371873,0.24723892],"study_design_scores_gemma":[0.000011508546,0.000019425794,0.000027514965,0.000015145036,0.000011538667,0.000013435748,0.000014714264,0.96596354,0.0014648299,0.03124493,0.0012098465,0.0000036486445],"about_ca_topic_score_codex":0.0058314153,"about_ca_topic_score_gemma":0.016260672,"teacher_disagreement_score":0.0058314153,"about_ca_system_score_codex":0.0008192378,"about_ca_system_score_gemma":0.0016845281,"threshold_uncertainty_score":0.018474162},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10678792,0.0011396626,0.8730089,0.00020429517,0.00019016543,0.0003054592,0.0025406305,0.0064111254,0.0094117895],"genre_scores_gemma":[0.70687234,0.0006707464,0.28594702,0.00006791579,0.000019700397,0.00023007827,0.002551009,0.00017204233,0.003469172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997732,0.000030507408,0.000015052368,0.00010044501,0.00005119975,0.000029526498],"domain_scores_gemma":[0.99956995,0.0001902978,0.00005531352,0.000049701546,0.000079205005,0.000055510205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003723009,0.0006632089,0.0004433507,0.0009824248,0.00022068588,0.00069577165,0.0008080216,0.00049858127,0.00512195],"category_scores_gemma":[0.0022394026,0.00034425108,0.0003928347,0.00058526796,0.0002294273,0.0012908925,0.0006493095,0.0006492999,0.0011478099],"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.0012675124,0.000382076,0.0073667625,0.00044576966,0.00017851697,0.0004630235,0.000331556,0.06122504,0.0526345,0.008927459,0.00911005,0.85766774],"study_design_scores_gemma":[0.000035654648,0.00024872532,0.0064664865,0.00009473305,0.00006185526,0.00024120668,0.00018746503,0.94549304,0.024964299,0.016646398,0.005526186,0.000033959113],"about_ca_topic_score_codex":0.0067321314,"about_ca_topic_score_gemma":0.010499871,"teacher_disagreement_score":0.0067321314,"about_ca_system_score_codex":0.00034452474,"about_ca_system_score_gemma":0.0007519607,"threshold_uncertainty_score":0.017134607},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071005723,0.00037250016,0.97731316,0.000988944,0.000078432226,0.0002707847,0.00021657113,0.00070620654,0.012952777],"genre_scores_gemma":[0.16577332,0.0003059265,0.82819015,0.00018295059,0.000052695697,0.00029344458,0.00043331523,0.00008933714,0.004678814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992849,0.00026294423,0.000046238874,0.00015594331,0.00018766953,0.00006232389],"domain_scores_gemma":[0.998645,0.0008867768,0.00006686124,0.00012065938,0.00017594152,0.000104663864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013659709,0.00058459974,0.00052078377,0.00087383506,0.0009549396,0.0014359875,0.0021263852,0.0012918642,0.007450269],"category_scores_gemma":[0.005154297,0.0005169203,0.00089153275,0.00093850534,0.0011050306,0.0021682149,0.0017997306,0.0018935332,0.000668739],"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.00022978132,0.0003787684,0.0009959833,0.0003259003,0.00011681245,0.00027006003,0.00046329494,0.5614433,0.0027212054,0.1740805,0.0148306815,0.24414366],"study_design_scores_gemma":[0.000032066895,0.000036284302,0.00019521073,0.00002048523,0.00002209454,0.000039250237,0.000095546275,0.9337846,0.00083037774,0.061294325,0.0036390694,0.000010675279],"about_ca_topic_score_codex":0.016928049,"about_ca_topic_score_gemma":0.020227311,"teacher_disagreement_score":0.016928049,"about_ca_system_score_codex":0.001117526,"about_ca_system_score_gemma":0.002666007,"threshold_uncertainty_score":0.03365904},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011413263,0.00027028745,0.98184764,0.00017350788,0.000036273694,0.00007972199,0.000101436126,0.00075184606,0.0053260135],"genre_scores_gemma":[0.27574527,0.00045374886,0.71640545,0.00022539351,0.0000664259,0.00036762262,0.0005633508,0.00050285447,0.005669841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957331,0.0017384938,0.00022986569,0.00054500945,0.0013664679,0.00038700714],"domain_scores_gemma":[0.9899894,0.006060268,0.00054089964,0.002111109,0.0010115672,0.0002868251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042421813,0.0012686265,0.0014794884,0.0014683378,0.0007368536,0.001888948,0.0037176374,0.0017823313,0.006400609],"category_scores_gemma":[0.022138443,0.0008521687,0.0011608558,0.0017594026,0.0020459674,0.004971398,0.006056543,0.0028482908,0.0017225344],"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.0003821351,0.00021062797,0.0013065698,0.00038077708,0.000064396925,0.0001091058,0.00027159942,0.41719785,0.0056473864,0.28489968,0.0038997594,0.28563005],"study_design_scores_gemma":[0.000045624693,0.00008788337,0.00011377498,0.000048231206,0.000016326298,0.000060632374,0.00004273599,0.8678416,0.002330796,0.12309391,0.0063003222,0.000018140601],"about_ca_topic_score_codex":0.0031131536,"about_ca_topic_score_gemma":0.0046265135,"teacher_disagreement_score":0.006400609,"about_ca_system_score_codex":0.001191764,"about_ca_system_score_gemma":0.002589968,"threshold_uncertainty_score":0.02243507},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05016194,0.0004923785,0.9287411,0.0005061714,0.000051485484,0.00013622566,0.00041587785,0.010242783,0.009252027],"genre_scores_gemma":[0.55625015,0.0002669649,0.43882784,0.00018404395,0.000020314721,0.00020248408,0.0007586013,0.00058804883,0.0029015904],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992895,0.00024189641,0.000049607916,0.00014230178,0.00019470188,0.00008208899],"domain_scores_gemma":[0.99821424,0.0011941892,0.000113203765,0.0002962384,0.00011555018,0.0000666076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011049286,0.00058447715,0.0005236374,0.0006407138,0.00070528255,0.0010999867,0.001106894,0.00067206135,0.005649538],"category_scores_gemma":[0.0045414786,0.0004197455,0.0007745927,0.0007277407,0.0009185598,0.00243916,0.0024514871,0.0012502166,0.00077893434],"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.0007702504,0.0002461237,0.0026396366,0.00055788027,0.00013248081,0.00039625523,0.00087077694,0.42302224,0.021129766,0.09142938,0.009480374,0.44932494],"study_design_scores_gemma":[0.000055639328,0.00009759764,0.00030075124,0.00003137982,0.000030722676,0.00009444858,0.00010755776,0.9322707,0.010019818,0.05114746,0.005824444,0.000019535284],"about_ca_topic_score_codex":0.0054794303,"about_ca_topic_score_gemma":0.011728157,"teacher_disagreement_score":0.005649538,"about_ca_system_score_codex":0.0009533505,"about_ca_system_score_gemma":0.0016777297,"threshold_uncertainty_score":0.01889956},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6140101,0.00016857432,0.34786436,0.00067349005,0.000194985,0.0037345816,0.0021275352,0.0039390572,0.02728733],"genre_scores_gemma":[0.80165565,0.00012375416,0.18313466,0.0003569443,0.000028660443,0.004249063,0.0039784145,0.000442947,0.0060298415],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975752,0.001009323,0.00016901587,0.00036734852,0.00065840327,0.00022067424],"domain_scores_gemma":[0.98758996,0.005866474,0.00057455053,0.0026365744,0.0024388675,0.000893587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00315904,0.0008138353,0.00050790055,0.0011170119,0.0005109885,0.0015782575,0.002889099,0.0011037681,0.005689807],"category_scores_gemma":[0.01627508,0.00046236464,0.000544074,0.0007534246,0.001205194,0.0025512255,0.0024466456,0.0015237472,0.0018391054],"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.0059280223,0.01918895,0.054587234,0.0019496011,0.0004855607,0.0019997717,0.0072534494,0.26200482,0.07817455,0.09130212,0.04111841,0.43600753],"study_design_scores_gemma":[0.0015479955,0.010511843,0.033943422,0.00033325522,0.0002215483,0.00091990625,0.0024570765,0.71533835,0.10143673,0.053895816,0.079116225,0.00027788038],"about_ca_topic_score_codex":0.004747461,"about_ca_topic_score_gemma":0.0046480075,"teacher_disagreement_score":0.005689807,"about_ca_system_score_codex":0.0013087247,"about_ca_system_score_gemma":0.0014049447,"threshold_uncertainty_score":0.019034266},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014862143,0.000150987,0.9798171,0.00029852576,0.000034134762,0.00012111269,0.00009233814,0.00054885197,0.004074762],"genre_scores_gemma":[0.2364692,0.00026902964,0.7585842,0.00014188931,0.000036222562,0.00038244115,0.00028065324,0.00017878953,0.0036575454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723583,0.0009596667,0.00021896804,0.00064091943,0.00064851553,0.0002961889],"domain_scores_gemma":[0.9969976,0.0014000053,0.0002633207,0.0009615107,0.00019383838,0.00018366467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025120405,0.0011808415,0.0011509724,0.0008544156,0.0015767217,0.0026896326,0.0027889076,0.0011470169,0.0043943347],"category_scores_gemma":[0.0071705584,0.00083522435,0.0023414956,0.0015417616,0.004289768,0.008593607,0.006192972,0.0030646448,0.0005018708],"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.00013541944,0.000060853894,0.00052146666,0.00028801613,0.00007497559,0.0003876523,0.0007314278,0.14607593,0.003819351,0.78013545,0.0015282927,0.066241264],"study_design_scores_gemma":[0.00003619209,0.000049281974,0.0001479457,0.000037925733,0.00003907525,0.00009426827,0.000109924316,0.20397808,0.0021271,0.78462267,0.008728944,0.000028624647],"about_ca_topic_score_codex":0.004236034,"about_ca_topic_score_gemma":0.0051711714,"teacher_disagreement_score":0.0043943347,"about_ca_system_score_codex":0.0016463952,"about_ca_system_score_gemma":0.0019739612,"threshold_uncertainty_score":0.014700472},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02091115,0.008473605,0.91480917,0.0026400888,0.0007167983,0.00036647293,0.00034594702,0.00071661716,0.051020205],"genre_scores_gemma":[0.39588863,0.0071512084,0.5810527,0.0033272097,0.0006798452,0.00061492866,0.0011920794,0.00042576384,0.009667596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9893113,0.0049035624,0.0007613877,0.0014900952,0.0029600442,0.0005735995],"domain_scores_gemma":[0.96684873,0.023321548,0.0020605233,0.0049611107,0.0022695314,0.00053853425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008547309,0.0018057714,0.0020163052,0.002861972,0.0020288292,0.004674817,0.0030939735,0.0034614492,0.0078896815],"category_scores_gemma":[0.05279933,0.0011914116,0.0018040995,0.0035637163,0.0042930013,0.005593733,0.0037753885,0.0049536168,0.001826881],"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.00037465317,0.00020928393,0.0031702444,0.0012796669,0.00031978753,0.00042029886,0.0005770249,0.084272765,0.001216718,0.7495973,0.011151533,0.14741078],"study_design_scores_gemma":[0.00015207652,0.000177344,0.0005388505,0.00046267957,0.0002179861,0.0005453029,0.00024261215,0.11755331,0.0017520018,0.8388516,0.03942209,0.000084211846],"about_ca_topic_score_codex":0.0014758495,"about_ca_topic_score_gemma":0.0020944034,"teacher_disagreement_score":0.008547309,"about_ca_system_score_codex":0.0020953764,"about_ca_system_score_gemma":0.0031278636,"threshold_uncertainty_score":0.04520303},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032314457,0.0009619026,0.92813545,0.0053993696,0.0002725744,0.00020515645,0.00017647684,0.00031861398,0.032215975],"genre_scores_gemma":[0.68661326,0.00037482835,0.30624554,0.0003244842,0.000095678435,0.00021641339,0.00031460362,0.00008264808,0.0057326127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940724,0.0032134138,0.0004178877,0.0011739933,0.0007367185,0.00038558978],"domain_scores_gemma":[0.9925436,0.003927448,0.00052917853,0.0015003067,0.0006578251,0.0008417194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005023268,0.00072281674,0.001122524,0.0011778225,0.0037972142,0.0049096835,0.0037584868,0.0049791904,0.0062722676],"category_scores_gemma":[0.023231719,0.0008846885,0.0020908944,0.0012132059,0.0053734295,0.010542528,0.007105368,0.0036829785,0.0007772311],"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.00012071664,0.00011125415,0.0009339877,0.0002103028,0.0001555823,0.0003862301,0.0015789665,0.06354216,0.0005527338,0.8903127,0.0066264546,0.03546889],"study_design_scores_gemma":[0.000023435961,0.00003522761,0.00019623907,0.00005491426,0.000041364427,0.000119133925,0.0006536305,0.14882779,0.00044321807,0.8436365,0.0059491373,0.00001929307],"about_ca_topic_score_codex":0.007554034,"about_ca_topic_score_gemma":0.006244155,"teacher_disagreement_score":0.007554034,"about_ca_system_score_codex":0.0020541307,"about_ca_system_score_gemma":0.002712789,"threshold_uncertainty_score":0.02656591},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012122106,0.0001472574,0.99606293,0.00008027906,0.000026699665,0.00003317552,0.000033680735,0.00027823096,0.0021254655],"genre_scores_gemma":[0.17852058,0.00045920437,0.8136722,0.00013900024,0.00009945369,0.0005327743,0.00023615666,0.00032898187,0.006011618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702555,0.0013371104,0.0001374278,0.00038348808,0.000963599,0.00015292832],"domain_scores_gemma":[0.9914732,0.0069094887,0.00031239868,0.0005016552,0.0006028112,0.00020052615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035817404,0.0013105676,0.00178725,0.0014362603,0.0008599787,0.0016104969,0.0024424733,0.0015554485,0.008115664],"category_scores_gemma":[0.011650661,0.0017588331,0.0015781884,0.0020561481,0.0019255952,0.0020131806,0.002338868,0.0026191454,0.0010717456],"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.00007824924,0.00003942191,0.00020474389,0.00008875777,0.000049344682,0.000024315177,0.000039633196,0.89763796,0.00026581675,0.0676647,0.0010076693,0.0328994],"study_design_scores_gemma":[0.000015040086,0.000008458992,0.000025770007,0.0000071181535,0.000007127643,0.00000642933,0.0000021912904,0.96767354,0.00018598251,0.031244881,0.00081863574,0.0000049342843],"about_ca_topic_score_codex":0.02157624,"about_ca_topic_score_gemma":0.021636112,"teacher_disagreement_score":0.02157624,"about_ca_system_score_codex":0.0021495218,"about_ca_system_score_gemma":0.0034119617,"threshold_uncertainty_score":0.042901278},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14996357,0.013471802,0.77477247,0.0057048043,0.0009491903,0.0006046825,0.0008445668,0.0024179332,0.051270973],"genre_scores_gemma":[0.8311945,0.0019931493,0.14112733,0.0010102205,0.0003772586,0.0004901753,0.0008735921,0.0001861266,0.022747649],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990126,0.00029542483,0.000057426092,0.00021128368,0.00027043032,0.00015282271],"domain_scores_gemma":[0.99820375,0.001133034,0.00017019182,0.0001363061,0.0002700594,0.00008673022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011982329,0.00088659266,0.0021934884,0.001744878,0.00082495995,0.0013005486,0.0016536076,0.002130336,0.0073048286],"category_scores_gemma":[0.0056648967,0.00036911428,0.000893235,0.0017339959,0.00064852834,0.0017306523,0.0012304058,0.0009975143,0.0014931109],"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.00067886506,0.0003391431,0.0032691385,0.00043967596,0.00029576413,0.0004996532,0.00013382378,0.45324606,0.0029318596,0.02690717,0.012961932,0.4982969],"study_design_scores_gemma":[0.00015237973,0.00030720874,0.0006690947,0.000029060973,0.00009660264,0.0002585549,0.00006506794,0.9642668,0.0015893604,0.02491831,0.007626558,0.000021094897],"about_ca_topic_score_codex":0.004070888,"about_ca_topic_score_gemma":0.0037160534,"teacher_disagreement_score":0.0073048286,"about_ca_system_score_codex":0.0008692515,"about_ca_system_score_gemma":0.0012878439,"threshold_uncertainty_score":0.02443707},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020515447,0.0010045511,0.96080875,0.011040509,0.000109320215,0.00017770502,0.00012700248,0.00036379654,0.0058529577],"genre_scores_gemma":[0.31648067,0.00052747363,0.68063956,0.0009197334,0.00014703172,0.0002683854,0.00014625094,0.000121134646,0.0007498028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.94651717,0.0375949,0.003031283,0.0045280256,0.006975905,0.0013526434],"domain_scores_gemma":[0.72433907,0.24957605,0.008602546,0.009339681,0.0064989505,0.0016436168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.04375805,0.0015726404,0.0017415747,0.0057918,0.0031583793,0.0065783695,0.0047681774,0.005843971,0.003587386],"category_scores_gemma":[0.19368875,0.0016072807,0.0033984918,0.004627163,0.020781996,0.013903601,0.005454208,0.006686071,0.0004312667],"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.00021608997,0.00019362164,0.006293893,0.0009678111,0.00032098498,0.0013995589,0.0052638426,0.08536341,0.0012782285,0.8109375,0.0029596903,0.084805265],"study_design_scores_gemma":[0.00006717436,0.00005148075,0.0006645713,0.00012920579,0.00005277728,0.0002925436,0.0006748215,0.13024749,0.0013541523,0.8619605,0.0044521317,0.000053240394],"about_ca_topic_score_codex":0.007850216,"about_ca_topic_score_gemma":0.004481493,"teacher_disagreement_score":0.04375805,"about_ca_system_score_codex":0.0047554187,"about_ca_system_score_gemma":0.005324169,"threshold_uncertainty_score":0.23141748},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008167808,0.00021181631,0.9863197,0.00003948886,0.000019003457,0.00004118074,0.00007954543,0.00033716703,0.004784237],"genre_scores_gemma":[0.33140028,0.00026974344,0.663016,0.000035622757,0.000017531585,0.00015463641,0.00024957635,0.00017308617,0.0046834857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993943,0.00016332946,0.00003866992,0.00013363833,0.00021414735,0.00005591036],"domain_scores_gemma":[0.9992386,0.0004733366,0.00005529265,0.000096346324,0.00010475814,0.00003171141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089545565,0.00094143033,0.0010832533,0.0009071887,0.00045456024,0.0008981627,0.001516797,0.00082257844,0.0048279343],"category_scores_gemma":[0.002221841,0.0006613044,0.0007733853,0.0017299553,0.0010745637,0.0017933513,0.0015781298,0.00092896,0.0004294585],"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.00008160726,0.000025701871,0.00013274557,0.00011729377,0.000028278422,0.00007238799,0.000057556088,0.86865777,0.0016119416,0.041699275,0.0010438171,0.086471654],"study_design_scores_gemma":[0.000007583267,0.00003623067,0.00003856305,0.000009699424,0.000005749766,0.00002445652,0.000009115024,0.9757798,0.00069023453,0.022221463,0.0011696682,0.000007343095],"about_ca_topic_score_codex":0.008738008,"about_ca_topic_score_gemma":0.009608962,"teacher_disagreement_score":0.008738008,"about_ca_system_score_codex":0.0011416222,"about_ca_system_score_gemma":0.0009825254,"threshold_uncertainty_score":0.017374277},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021832975,0.00040632216,0.96831,0.00075297564,0.0002603911,0.00013095209,0.00021521648,0.0010791552,0.0070121596],"genre_scores_gemma":[0.29717153,0.0002828991,0.69503707,0.0003929613,0.00009833819,0.00036008898,0.00039689103,0.0005720313,0.005688212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938002,0.0021714445,0.0004285728,0.0010402304,0.002124976,0.0004344579],"domain_scores_gemma":[0.9644342,0.021337422,0.0017604751,0.006715697,0.005389957,0.00036214164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055449763,0.0010441412,0.00097284233,0.0013453298,0.0010465946,0.0017681706,0.002175053,0.0014303249,0.009467845],"category_scores_gemma":[0.049929675,0.0005465215,0.0011632101,0.002198757,0.0016769489,0.0026967993,0.0027595442,0.0031240094,0.0013550273],"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.0004031352,0.00022032013,0.0035589403,0.0005132609,0.00014802652,0.00028803464,0.00045338334,0.5261404,0.0072052428,0.1331039,0.015793817,0.31217152],"study_design_scores_gemma":[0.000043203112,0.000107385225,0.0006712979,0.000065920176,0.000031337368,0.000133964,0.00008634258,0.9148779,0.0052872314,0.072195865,0.006468853,0.000030683866],"about_ca_topic_score_codex":0.009339093,"about_ca_topic_score_gemma":0.008223313,"teacher_disagreement_score":0.009467845,"about_ca_system_score_codex":0.0016173626,"about_ca_system_score_gemma":0.003884032,"threshold_uncertainty_score":0.031673074},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03132369,0.00015498028,0.96396095,0.00029668078,0.000026023503,0.000041676474,0.000064754306,0.0007063867,0.0034248184],"genre_scores_gemma":[0.72802395,0.00015941952,0.26589638,0.00013691188,0.000028091008,0.00015337397,0.00012918585,0.00012554172,0.0053471522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993554,0.00024048115,0.000029230738,0.00014739794,0.00012502463,0.00010256733],"domain_scores_gemma":[0.99865806,0.00091182615,0.00010328073,0.00014897721,0.000097179305,0.00008062704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012024288,0.0007871849,0.00089388713,0.00046874455,0.00047895516,0.0010999003,0.0014848496,0.0010389185,0.0036590223],"category_scores_gemma":[0.003589497,0.00055409793,0.0006141461,0.00064606935,0.0015081291,0.0015609672,0.001522128,0.0015483157,0.00041242287],"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.00008881172,0.00004136301,0.00039044037,0.00004888659,0.000023769071,0.00004979805,0.00008268859,0.94053984,0.0007294373,0.030787641,0.00042308465,0.026794255],"study_design_scores_gemma":[0.000007947065,0.000014838152,0.000022767581,0.0000025810405,0.0000028477841,0.0000050626354,0.00000610029,0.99100494,0.0002665914,0.008426951,0.00023674776,0.0000027941844],"about_ca_topic_score_codex":0.009531183,"about_ca_topic_score_gemma":0.008973484,"teacher_disagreement_score":0.009531183,"about_ca_system_score_codex":0.0013739131,"about_ca_system_score_gemma":0.0016593073,"threshold_uncertainty_score":0.018951356},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07930382,0.00078758143,0.8473277,0.0011971174,0.00012789627,0.00030959447,0.0004841443,0.01493467,0.055527437],"genre_scores_gemma":[0.5131403,0.00052600785,0.46990493,0.00034587356,0.00003427603,0.00017399054,0.00066290976,0.00026678844,0.01494494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998367,0.00002115345,0.000009521559,0.000042497588,0.00006320599,0.000026991143],"domain_scores_gemma":[0.9998745,0.000018411094,0.0000151375925,0.000026847267,0.000040382776,0.000024760757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020893407,0.00030498873,0.00019653463,0.00039222458,0.0003908918,0.0008970624,0.00080191623,0.0003955569,0.006075673],"category_scores_gemma":[0.0003328333,0.00020801852,0.0003180811,0.0002182683,0.0006298432,0.00073658227,0.0012460883,0.00058178883,0.0012853538],"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.00035291046,0.00017994484,0.003545616,0.0006436309,0.00012455432,0.0007902275,0.00077508064,0.2322112,0.043518562,0.16177987,0.028651468,0.52742696],"study_design_scores_gemma":[0.00010289109,0.00022214772,0.0017411999,0.00013425021,0.00008612037,0.000542031,0.00022035505,0.7000477,0.021339132,0.07427968,0.20121983,0.00006466994],"about_ca_topic_score_codex":0.0057012076,"about_ca_topic_score_gemma":0.0059564,"teacher_disagreement_score":0.006075673,"about_ca_system_score_codex":0.0006150836,"about_ca_system_score_gemma":0.0009902252,"threshold_uncertainty_score":0.020325184},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0413397,0.00041575258,0.9532169,0.00045329833,0.000025422445,0.000050632487,0.000035332345,0.00021656467,0.004246423],"genre_scores_gemma":[0.7275625,0.0008011079,0.2696029,0.00009062634,0.000052584175,0.0001209583,0.00008719099,0.00006907565,0.0016130451],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798054,0.0011108115,0.00009366328,0.00024720776,0.00035827197,0.00020959992],"domain_scores_gemma":[0.99235463,0.0064674043,0.00044240267,0.0003269591,0.00019770022,0.0002109117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021309888,0.0009689041,0.0009153037,0.0008526674,0.000799954,0.0012863991,0.0010818936,0.0011081605,0.0016053641],"category_scores_gemma":[0.00883335,0.000792717,0.00090822525,0.0014695716,0.0025394089,0.0028139292,0.002240849,0.0017161341,0.00017601575],"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.00006441212,0.00004003133,0.00058328203,0.00006189858,0.000031671523,0.0001253747,0.00011809817,0.88071924,0.0007205333,0.10334274,0.00014733018,0.014045283],"study_design_scores_gemma":[0.000010111311,0.000025529376,0.0000980028,0.000010730514,0.000010029764,0.000016885751,0.000027681,0.90685,0.0005768465,0.09156697,0.0007993288,0.000007846405],"about_ca_topic_score_codex":0.010321375,"about_ca_topic_score_gemma":0.0072987895,"teacher_disagreement_score":0.010321375,"about_ca_system_score_codex":0.0015037417,"about_ca_system_score_gemma":0.0020197819,"threshold_uncertainty_score":0.020522594},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9386165,0.00076794304,0.043430556,0.00016070448,0.0000344409,0.0004426504,0.000186543,0.0001563368,0.016204262],"genre_scores_gemma":[0.95537806,0.00038247346,0.042462647,0.00005576093,0.000026902655,0.00045065762,0.00021995149,0.000016046395,0.0010074402],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9916129,0.0033828428,0.0006145029,0.00066585315,0.0034003637,0.00032353506],"domain_scores_gemma":[0.9672089,0.019708904,0.005610447,0.0015445218,0.004499989,0.0014272848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041077635,0.0004966976,0.00030605393,0.005643367,0.00088261644,0.0019026108,0.00073833036,0.00058221404,0.0009543102],"category_scores_gemma":[0.036911625,0.00020818539,0.000364113,0.0027627058,0.00090239686,0.0018980704,0.00164665,0.000833351,0.00023480244],"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.0004945561,0.0017347618,0.35947895,0.0012878788,0.00023052243,0.00022130976,0.04071036,0.0064782277,0.020439629,0.01295966,0.0014827354,0.5544815],"study_design_scores_gemma":[0.00008704682,0.0024631864,0.89524305,0.00035194305,0.00014636497,0.000697446,0.023040298,0.014871103,0.016869484,0.02831617,0.017663565,0.0002503304],"about_ca_topic_score_codex":0.0018690919,"about_ca_topic_score_gemma":0.0020561423,"teacher_disagreement_score":0.005643367,"about_ca_system_score_codex":0.0009678496,"about_ca_system_score_gemma":0.0011202712,"threshold_uncertainty_score":0.021724164},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036100473,0.0005408147,0.9581027,0.00046746136,0.0000627162,0.00006185089,0.00004609419,0.00033326037,0.0042846077],"genre_scores_gemma":[0.8350975,0.00043108524,0.16028053,0.00026002774,0.00007324381,0.00024270071,0.000113566406,0.00007004274,0.003431239],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947995,0.00023838971,0.00001764597,0.00007004421,0.0001061733,0.00008790567],"domain_scores_gemma":[0.9964384,0.0029253198,0.00021853979,0.00007371446,0.00022395968,0.000120123026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013132265,0.0007176098,0.0013776807,0.00095794356,0.0005887678,0.0010246065,0.0011116597,0.0014098085,0.0022204935],"category_scores_gemma":[0.004926193,0.00070554507,0.000580773,0.00094720017,0.00096066314,0.0011050069,0.0008018383,0.0011639983,0.00024056832],"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.000021482863,0.000014777874,0.000117717114,0.000009229687,0.000007180037,0.000007905358,0.000008470274,0.99002683,0.00008628769,0.0041845115,0.00018417768,0.0053314553],"study_design_scores_gemma":[0.0000024241117,0.0000032418316,0.0000094267,8.992545e-7,7.232069e-7,9.035045e-7,9.0415784e-7,0.99894947,0.0000183553,0.0009758269,0.000037216538,6.833877e-7],"about_ca_topic_score_codex":0.014031529,"about_ca_topic_score_gemma":0.0116060665,"teacher_disagreement_score":0.014031529,"about_ca_system_score_codex":0.0018428162,"about_ca_system_score_gemma":0.0020575929,"threshold_uncertainty_score":0.027899742},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01101389,0.00023764672,0.98365027,0.00017827014,0.00006340085,0.00014693975,0.00023288824,0.00061931595,0.0038573355],"genre_scores_gemma":[0.14688867,0.00028819643,0.8496986,0.00013860122,0.000021806583,0.00031200433,0.0006038446,0.00021067173,0.0018375817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983621,0.0006654042,0.00009453437,0.00024319485,0.00045527166,0.00017953606],"domain_scores_gemma":[0.9965012,0.0023112635,0.00024659286,0.00045664387,0.00034270983,0.00014157855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019560605,0.0011933305,0.0010559506,0.0013789914,0.00063170743,0.001700189,0.0016690961,0.0010029242,0.006045937],"category_scores_gemma":[0.0066906894,0.0009230606,0.00156787,0.0011456901,0.0014630883,0.001848544,0.0014643464,0.0021611596,0.00085119205],"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.00029044005,0.0001497475,0.0005970396,0.00040515242,0.000055457385,0.00012730256,0.0002038097,0.8046074,0.003751592,0.07860102,0.003231095,0.10797998],"study_design_scores_gemma":[0.00008095855,0.0001692906,0.000119034165,0.00008819166,0.000035618858,0.00005425036,0.000056404988,0.93972886,0.0029564744,0.050534308,0.0061499747,0.000026638088],"about_ca_topic_score_codex":0.0045321006,"about_ca_topic_score_gemma":0.006569703,"teacher_disagreement_score":0.006045937,"about_ca_system_score_codex":0.0013076338,"about_ca_system_score_gemma":0.002861761,"threshold_uncertainty_score":0.020225704},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011195723,0.0005264161,0.9699516,0.0006707866,0.00009976307,0.00013880827,0.00015433301,0.00088800315,0.016374575],"genre_scores_gemma":[0.23876895,0.00048311675,0.74920684,0.0005196638,0.00011122808,0.0005187275,0.0004589467,0.00047963858,0.009452908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971288,0.0010071065,0.00013196736,0.00053084345,0.0008105411,0.00039078496],"domain_scores_gemma":[0.99263316,0.0045360858,0.00042021688,0.0013707946,0.00064558454,0.00039412975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031731639,0.00113653,0.0014046704,0.0011480745,0.00089245103,0.0017653166,0.003786103,0.001553713,0.008423159],"category_scores_gemma":[0.0148666855,0.0007945585,0.0011594102,0.0020535747,0.0017749777,0.0035358642,0.0038827723,0.0037749542,0.0019832822],"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.00038906146,0.00024027271,0.0014205107,0.0003893944,0.000111515925,0.00009649877,0.00040349294,0.5633483,0.0026298177,0.19628526,0.014293109,0.22039281],"study_design_scores_gemma":[0.00006908404,0.00005885046,0.00012313073,0.000034608016,0.000022292914,0.000055918703,0.000031788735,0.9139355,0.00097526266,0.07758159,0.0070980946,0.000013946372],"about_ca_topic_score_codex":0.004584171,"about_ca_topic_score_gemma":0.007004426,"teacher_disagreement_score":0.008423159,"about_ca_system_score_codex":0.0020843677,"about_ca_system_score_gemma":0.0029764515,"threshold_uncertainty_score":0.028178215},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026291145,0.0000822114,0.970918,0.00038650288,0.000014920465,0.000056595287,0.00034523875,0.0007417713,0.0011636605],"genre_scores_gemma":[0.58489734,0.00022131715,0.41125095,0.00024886892,0.000037570542,0.00028029986,0.0012616743,0.00012364975,0.0016783688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981962,0.0006266865,0.00012093525,0.0004306948,0.00048669,0.00013886548],"domain_scores_gemma":[0.9915495,0.0062584793,0.00084129674,0.0006781178,0.0005512209,0.00012141916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001766897,0.0008472868,0.00058271835,0.0008982187,0.00034065158,0.0016157735,0.0016747835,0.0008416541,0.0022217182],"category_scores_gemma":[0.013231933,0.00043631732,0.0012004909,0.00088530243,0.0017164497,0.0025922712,0.000995047,0.0017451239,0.0003488501],"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.00023332256,0.00021154778,0.0036808539,0.00026603058,0.000099753284,0.00034180575,0.0006390561,0.78947794,0.0053739785,0.12987256,0.0012948953,0.06850826],"study_design_scores_gemma":[0.000014822806,0.00003526843,0.000108332526,0.000016098447,0.000013410383,0.00002446526,0.000027211207,0.9253917,0.0015357892,0.072313085,0.0005124592,0.000007384541],"about_ca_topic_score_codex":0.0056621684,"about_ca_topic_score_gemma":0.009398586,"teacher_disagreement_score":0.0056621684,"about_ca_system_score_codex":0.0017667683,"about_ca_system_score_gemma":0.0018441246,"threshold_uncertainty_score":0.012818873},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07242705,0.00049252104,0.91678405,0.00087029947,0.00030114388,0.00019843061,0.00015978918,0.0017898416,0.006976806],"genre_scores_gemma":[0.45855415,0.00017836278,0.5372888,0.0002614071,0.000047115398,0.00028736275,0.00022374916,0.0005115933,0.0026474968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99163145,0.0027992285,0.0005740701,0.0013646013,0.0029455929,0.0006850534],"domain_scores_gemma":[0.9357987,0.041142363,0.0035651736,0.010622794,0.008280143,0.0005908008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006984164,0.001205159,0.001299454,0.0017118484,0.0014808718,0.0017207266,0.002450473,0.0015151752,0.0047511985],"category_scores_gemma":[0.08699933,0.0006231269,0.0010835475,0.001971524,0.0017752639,0.002772704,0.002560637,0.0032228245,0.0008454528],"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.0006657817,0.00028137694,0.007677266,0.0004812369,0.00018925185,0.00028478334,0.0006481675,0.632423,0.011228982,0.07436014,0.007907077,0.26385298],"study_design_scores_gemma":[0.000063496074,0.00016731556,0.0010864721,0.000077312565,0.00004605555,0.0001656597,0.00019262017,0.9470377,0.008894886,0.038328227,0.0038993831,0.000040877698],"about_ca_topic_score_codex":0.0070190537,"about_ca_topic_score_gemma":0.007853009,"teacher_disagreement_score":0.0070190537,"about_ca_system_score_codex":0.0018192373,"about_ca_system_score_gemma":0.0040049697,"threshold_uncertainty_score":0.036936224},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031020625,0.015674155,0.88476217,0.017142,0.0007247548,0.00017191829,0.00089805876,0.0002106176,0.04939575],"genre_scores_gemma":[0.75688744,0.014399496,0.21403183,0.0031097452,0.0018312272,0.0004363429,0.0009882154,0.00014419771,0.0081714485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99386,0.0032775833,0.0005116569,0.00069333916,0.0010942623,0.0005630919],"domain_scores_gemma":[0.85362273,0.13753872,0.0030935525,0.0023300229,0.0023610094,0.0010538525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008772957,0.0012085255,0.0016171957,0.0028175067,0.0018804354,0.0035845763,0.0022063134,0.0033840053,0.0075461306],"category_scores_gemma":[0.06889155,0.0011562097,0.0020163879,0.003030855,0.0075132544,0.0121793235,0.0029161258,0.00657312,0.00064474565],"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.00005477062,0.000041241783,0.00064984086,0.00015809713,0.00009242943,0.0001442514,0.00023077748,0.024230259,0.0001262928,0.96244144,0.0024611042,0.009369564],"study_design_scores_gemma":[0.000008072237,0.000009217122,0.00008639553,0.000032347816,0.0000122213505,0.000021708163,0.0000220679,0.022049613,0.000046275076,0.97702277,0.0006806769,0.00000874847],"about_ca_topic_score_codex":0.009600471,"about_ca_topic_score_gemma":0.0074171936,"teacher_disagreement_score":0.009600471,"about_ca_system_score_codex":0.0034939344,"about_ca_system_score_gemma":0.0026476046,"threshold_uncertainty_score":0.046396375},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08332561,0.0001963131,0.89885485,0.00063021755,0.00004562652,0.00020157087,0.00019670892,0.00094027736,0.015608829],"genre_scores_gemma":[0.6206391,0.00023455238,0.374727,0.00011166377,0.000021455664,0.0001494751,0.0002624393,0.0002006273,0.0036537643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987771,0.0004518721,0.00006962579,0.00015199435,0.00038808936,0.00016128199],"domain_scores_gemma":[0.99711955,0.0019931123,0.00017362132,0.00029044753,0.00030658272,0.000116657364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013337701,0.0005137055,0.0004608872,0.0004898781,0.0005162824,0.0011049991,0.0008466339,0.00056596653,0.0031199018],"category_scores_gemma":[0.0045841644,0.00042254513,0.0006446689,0.0006330452,0.0014484291,0.0016329288,0.0013022331,0.0011865613,0.00025998979],"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.00019397114,0.000109257046,0.000701952,0.00015791338,0.000032533426,0.00013630184,0.0001198881,0.858562,0.003792682,0.08046337,0.00182553,0.053904608],"study_design_scores_gemma":[0.00003479455,0.000057017663,0.00015661499,0.000014662659,0.00001837905,0.000042845768,0.00005168309,0.9216357,0.004301806,0.07062664,0.0030509376,0.000008930561],"about_ca_topic_score_codex":0.004513742,"about_ca_topic_score_gemma":0.0055645737,"teacher_disagreement_score":0.004513742,"about_ca_system_score_codex":0.001151212,"about_ca_system_score_gemma":0.0018120861,"threshold_uncertainty_score":0.010437131},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06809759,0.00037514765,0.9207386,0.0012086527,0.000060788643,0.00021034706,0.00038885814,0.0018779237,0.0070421477],"genre_scores_gemma":[0.3656549,0.00037121677,0.63013947,0.00026232906,0.00004665226,0.00027362976,0.00063307065,0.00039790382,0.0022208167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871814,0.00045710447,0.000056862158,0.00027217547,0.00033901547,0.00015662458],"domain_scores_gemma":[0.99407285,0.004040746,0.00041847274,0.0011217467,0.00019323158,0.0001529349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011233445,0.0009200463,0.0006804558,0.0011298809,0.0009143301,0.0015592499,0.0019146639,0.0010513915,0.005462411],"category_scores_gemma":[0.0066773044,0.0005602986,0.0011991954,0.0017273879,0.0017181091,0.0049430486,0.0026600247,0.0024326087,0.00043040197],"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.00036220753,0.00025870567,0.0018393327,0.00036784043,0.00007676091,0.00029173875,0.0005757228,0.4627716,0.011352891,0.27433184,0.0063853944,0.24138594],"study_design_scores_gemma":[0.000054096305,0.00010006547,0.0003578766,0.000051044684,0.000034993882,0.00014222917,0.00016082024,0.717991,0.0072389552,0.26627657,0.007572243,0.00002018172],"about_ca_topic_score_codex":0.003423182,"about_ca_topic_score_gemma":0.0065682493,"teacher_disagreement_score":0.005462411,"about_ca_system_score_codex":0.0019197619,"about_ca_system_score_gemma":0.0014770566,"threshold_uncertainty_score":0.018273592},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030905848,0.00029672822,0.9618963,0.00075613114,0.000040490213,0.00019566712,0.00014019525,0.00078644924,0.004982172],"genre_scores_gemma":[0.66253084,0.00033340437,0.33403474,0.00015865179,0.000037532645,0.00041609802,0.00027975158,0.00009396025,0.00211499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867105,0.0006297445,0.00008165198,0.000173038,0.00029982405,0.00014477431],"domain_scores_gemma":[0.9976822,0.0016546346,0.00019997102,0.00014253323,0.0002077435,0.000112902206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024791723,0.0010925027,0.0010175417,0.000723719,0.0009754792,0.002599742,0.0016605415,0.0015494019,0.0034375302],"category_scores_gemma":[0.005026885,0.00077402045,0.0012859869,0.000718973,0.001713169,0.001825803,0.001821574,0.0020558154,0.00031233847],"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.00003296943,0.000045732246,0.00020392494,0.00004866914,0.000025632238,0.000041116942,0.00007188505,0.97688293,0.00044229085,0.011898116,0.00025975582,0.010047038],"study_design_scores_gemma":[0.000013672398,0.00001524862,0.00003044254,0.000007739455,0.00000631812,0.000004548723,0.000017163986,0.98827714,0.00021555033,0.01109575,0.00031304688,0.000003277113],"about_ca_topic_score_codex":0.021162873,"about_ca_topic_score_gemma":0.024648055,"teacher_disagreement_score":0.021162873,"about_ca_system_score_codex":0.0025128615,"about_ca_system_score_gemma":0.0031688216,"threshold_uncertainty_score":0.04207939},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03120492,0.00023920156,0.963845,0.00022823662,0.000034416404,0.00015685517,0.0002210125,0.0007367041,0.0033336077],"genre_scores_gemma":[0.28621817,0.0002184073,0.71098924,0.00011347972,0.00001542164,0.00029350113,0.0006362898,0.00018898043,0.0013265612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769825,0.0012303788,0.00012755278,0.00033639572,0.00039620904,0.0002112961],"domain_scores_gemma":[0.9914009,0.006726029,0.0004470978,0.0007704601,0.00044019643,0.00021525373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002744821,0.0010187955,0.00094284496,0.001165908,0.0005325424,0.0014648673,0.001560523,0.0010866113,0.004508391],"category_scores_gemma":[0.011987811,0.0008433774,0.0013187068,0.001093297,0.0012965526,0.0025010614,0.0018436752,0.002156767,0.00050559297],"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.00026273832,0.00015925494,0.0009935984,0.00036757533,0.000063773245,0.00009829375,0.00026346068,0.8412388,0.0026192477,0.059357397,0.0015169056,0.09305895],"study_design_scores_gemma":[0.00008302943,0.00012921588,0.0001562174,0.000045079163,0.00002935501,0.000036591548,0.000073012336,0.9290968,0.0024242739,0.06575855,0.0021472243,0.000020692372],"about_ca_topic_score_codex":0.0047081513,"about_ca_topic_score_gemma":0.008581103,"teacher_disagreement_score":0.0047081513,"about_ca_system_score_codex":0.001361612,"about_ca_system_score_gemma":0.003093579,"threshold_uncertainty_score":0.015082121},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021883796,0.007854851,0.023835495,0.0017876804,0.0009071152,0.00004981094,0.0018387267,0.0015082959,0.9619992],"genre_scores_gemma":[0.006008954,0.012487259,0.022237265,0.00077081914,0.00035913076,0.00011403496,0.003454799,0.0011497884,0.95341784],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998454,0.000019339179,0.0000073154524,0.00003131031,0.00008326784,0.000013345223],"domain_scores_gemma":[0.9997843,0.00008275113,0.000008875492,0.000032981898,0.00006588624,0.000025206424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016855517,0.0012551694,0.00066275493,0.0016044939,0.0008028253,0.003120391,0.0011387607,0.0010045728,0.24506871],"category_scores_gemma":[0.00090660196,0.001011497,0.00065298204,0.0027910157,0.00059248175,0.0033752841,0.0011933226,0.0020309242,0.118353926],"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.000012752413,0.00002124268,0.000035213492,0.00028571102,0.000005553494,0.000033233562,0.000060188424,0.002383305,0.0003491899,0.07684061,0.7103696,0.2096034],"study_design_scores_gemma":[0.000002509647,0.0000030630395,0.000042864714,0.00008842468,0.0000026867742,0.000059216803,0.000020663048,0.00048510797,0.00017236204,0.02522916,0.9738894,0.0000046122027],"about_ca_topic_score_codex":0.0052758534,"about_ca_topic_score_gemma":0.012214575,"teacher_disagreement_score":0.24506871,"about_ca_system_score_codex":0.0018834763,"about_ca_system_score_gemma":0.0016535107,"threshold_uncertainty_score":0.8198365},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031836808,0.0048291534,0.15347083,0.022811301,0.001431486,0.00014757563,0.00048111132,0.0008009262,0.8128439],"genre_scores_gemma":[0.23023336,0.01587867,0.11078456,0.014251902,0.0011618293,0.0010800067,0.0023481923,0.00056296535,0.62369853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990753,0.00038219814,0.00004880842,0.00018373104,0.00024184733,0.000068086316],"domain_scores_gemma":[0.9989459,0.0005546426,0.00006461899,0.00022849833,0.000112863054,0.0000934625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011463866,0.00080663577,0.00035823646,0.00044487134,0.00084934925,0.004426119,0.0010378096,0.0016679022,0.04249543],"category_scores_gemma":[0.004001534,0.00030278918,0.00054966175,0.00039634426,0.004305287,0.004606064,0.001996919,0.00345355,0.017936133],"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.00001775875,0.00003580113,0.00028123998,0.00022569386,0.000021831014,0.00009094174,0.0011177511,0.0017310911,0.00031311758,0.82120806,0.065974414,0.10898226],"study_design_scores_gemma":[0.000012025207,0.000020517811,0.00019561968,0.0002320413,0.000008626891,0.00017190613,0.00035873122,0.002720888,0.00030602067,0.6076058,0.3883544,0.000013462816],"about_ca_topic_score_codex":0.0010874454,"about_ca_topic_score_gemma":0.0012809711,"teacher_disagreement_score":0.04249543,"about_ca_system_score_codex":0.00096116256,"about_ca_system_score_gemma":0.001763254,"threshold_uncertainty_score":0.14216137},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04364297,0.0002074375,0.94623584,0.00095372036,0.000049593455,0.00003253591,0.00023819419,0.0026770881,0.0059626456],"genre_scores_gemma":[0.6381546,0.00033593888,0.3541016,0.00035077686,0.000034849265,0.00009298527,0.0005301576,0.00042425425,0.005974762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999806,0.00007436703,0.000007445598,0.000058384096,0.0000332245,0.000020687048],"domain_scores_gemma":[0.99931586,0.00039178165,0.000042145184,0.00016330433,0.00004473561,0.000042147512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052466587,0.0004338074,0.0005049959,0.00028960727,0.00025916813,0.0009966822,0.001165962,0.0007943284,0.0039851363],"category_scores_gemma":[0.0024388954,0.0004915328,0.00056323817,0.00041700897,0.0015176415,0.0023214577,0.0016259204,0.0020114225,0.00068360136],"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.00013016036,0.000039506096,0.00057410775,0.00007991806,0.00003896229,0.000115922354,0.00021614393,0.77417684,0.0023747068,0.13081662,0.0040396163,0.0873975],"study_design_scores_gemma":[0.000013021273,0.000020804502,0.000055126842,0.000014191864,0.000005554996,0.000016747781,0.000022578122,0.8951727,0.0014437394,0.10112422,0.0021035022,0.000007755436],"about_ca_topic_score_codex":0.004500729,"about_ca_topic_score_gemma":0.0062156497,"teacher_disagreement_score":0.004500729,"about_ca_system_score_codex":0.000739911,"about_ca_system_score_gemma":0.0011137452,"threshold_uncertainty_score":0.013331592},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035965364,0.0001582181,0.9582112,0.0004090822,0.000022734232,0.00017713182,0.00015084064,0.0014216867,0.0034837208],"genre_scores_gemma":[0.3029912,0.000544198,0.69203985,0.00017793682,0.00003222178,0.00027594608,0.0007187409,0.00025102065,0.0029689332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988054,0.00033567304,0.00009587423,0.00033863567,0.00032058355,0.000103932034],"domain_scores_gemma":[0.9977489,0.000938584,0.00020520443,0.00088618684,0.0001582464,0.0000628977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001477309,0.0007946062,0.00052532286,0.000594619,0.0004204752,0.0012093253,0.0012099677,0.0007988529,0.0022427922],"category_scores_gemma":[0.0068183406,0.00045249914,0.0010563924,0.00071956316,0.0019159019,0.0030346191,0.0020524773,0.0018092463,0.0004494204],"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.00017722399,0.00009819484,0.0017255696,0.0002698645,0.00008846427,0.0003702295,0.0017641897,0.448423,0.013759118,0.22503804,0.0028571808,0.30542898],"study_design_scores_gemma":[0.000032744996,0.00014867575,0.0006365099,0.00008840053,0.00006628121,0.00020679494,0.00038038314,0.7113339,0.007696954,0.26037174,0.018999344,0.000038353966],"about_ca_topic_score_codex":0.0042314953,"about_ca_topic_score_gemma":0.0048347455,"teacher_disagreement_score":0.0042314953,"about_ca_system_score_codex":0.00085790595,"about_ca_system_score_gemma":0.0011824387,"threshold_uncertainty_score":0.008413732},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013692123,0.006898822,0.9083322,0.044676755,0.00049569836,0.00015173737,0.00019455576,0.00059152953,0.024966495],"genre_scores_gemma":[0.3607705,0.0127901705,0.60786754,0.0071464935,0.0015238294,0.0006640371,0.00042002133,0.0002531943,0.008564289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99623543,0.0022552693,0.00020607795,0.00045773617,0.00066619343,0.0001793331],"domain_scores_gemma":[0.9830184,0.011385982,0.00054278516,0.003518055,0.00085611397,0.0006786332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074978597,0.0008695476,0.0012064448,0.0019410186,0.0012351207,0.007221976,0.0024942753,0.0021920677,0.0041351225],"category_scores_gemma":[0.016842704,0.0007872157,0.0015133965,0.0019382356,0.010981509,0.018407311,0.0076566124,0.0063559473,0.0010515227],"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.000029076811,0.00009994588,0.0009972599,0.00033102866,0.000068605965,0.000045100376,0.00061599095,0.004459082,0.00052870915,0.93104756,0.004326753,0.057451036],"study_design_scores_gemma":[0.00000751245,0.000010370137,0.00009978338,0.000054386073,0.0000068419963,0.00002102274,0.00013476326,0.009644287,0.00024302704,0.98244274,0.007326624,0.000008474852],"about_ca_topic_score_codex":0.0010326707,"about_ca_topic_score_gemma":0.001178438,"teacher_disagreement_score":0.0074978597,"about_ca_system_score_codex":0.0013236665,"about_ca_system_score_gemma":0.0031159443,"threshold_uncertainty_score":0.039652944},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10679314,0.00025966737,0.86689097,0.0012028399,0.00010206252,0.00010977186,0.0006163757,0.0020185239,0.022006746],"genre_scores_gemma":[0.92465734,0.0001186165,0.06923925,0.00017767212,0.000038189937,0.00015552032,0.0002895649,0.00015563738,0.0051681953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999456,0.00020046454,0.000030341973,0.00011479096,0.00009597969,0.00010235544],"domain_scores_gemma":[0.9961196,0.0028383771,0.00016586583,0.00043691118,0.00022672037,0.00021249715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012054214,0.00063295045,0.0011066889,0.0005563396,0.0007476389,0.0011652652,0.0015563049,0.00079472316,0.005651046],"category_scores_gemma":[0.0051332633,0.0007719977,0.00070416403,0.0008099878,0.00127524,0.0018394286,0.0022465899,0.0014249526,0.00048065928],"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.00025789998,0.00004777477,0.00047196724,0.000105321684,0.00004586973,0.00009855474,0.00009668668,0.9118842,0.0011768026,0.061890706,0.0022162758,0.021708012],"study_design_scores_gemma":[0.000017504286,0.000012722173,0.000040142175,0.0000027244532,0.000005359717,0.000006927409,0.00000866678,0.96805197,0.00025194383,0.031406187,0.00019254541,0.0000032476719],"about_ca_topic_score_codex":0.007778545,"about_ca_topic_score_gemma":0.012446266,"teacher_disagreement_score":0.007778545,"about_ca_system_score_codex":0.0011233825,"about_ca_system_score_gemma":0.0023519448,"threshold_uncertainty_score":0.018904686},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04288435,0.00019497728,0.94749445,0.00088788505,0.00004609297,0.000031541917,0.0002117599,0.0026688627,0.005580008],"genre_scores_gemma":[0.64952105,0.00033169016,0.34291703,0.00036522336,0.000033733486,0.00008756244,0.00047556916,0.00041434646,0.005853786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998135,0.00007164306,0.000006952865,0.000054068496,0.00003321233,0.000020608577],"domain_scores_gemma":[0.9993418,0.00037516595,0.00004071539,0.00015733234,0.000042915857,0.000042128595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005377803,0.00043338872,0.0005100811,0.00027458108,0.00024670118,0.0009983825,0.0011996895,0.0007897478,0.0039991746],"category_scores_gemma":[0.002292511,0.00051031116,0.00054707006,0.00039003885,0.001521644,0.0023249956,0.0016477682,0.0020089773,0.0006561602],"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.00013674422,0.000038940223,0.0005800281,0.00007907418,0.000041278905,0.00011896246,0.00023119192,0.78080624,0.002566506,0.12209231,0.003745913,0.08956277],"study_design_scores_gemma":[0.000012920597,0.000023168413,0.000054561562,0.00001377207,0.0000057200614,0.000016591372,0.000022331584,0.91098493,0.0014568106,0.08540882,0.0019923788,0.00000794614],"about_ca_topic_score_codex":0.0042507765,"about_ca_topic_score_gemma":0.0060628527,"teacher_disagreement_score":0.0042507765,"about_ca_system_score_codex":0.0006881085,"about_ca_system_score_gemma":0.0010752811,"threshold_uncertainty_score":0.013378561},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9228208,0.0019343058,0.06087211,0.00083445024,0.000061239574,0.00011434699,0.00020994898,0.00024148992,0.012911345],"genre_scores_gemma":[0.9838389,0.00030954008,0.015195118,0.00006456505,0.00002087347,0.00004124966,0.00016926606,0.000041759424,0.00031865825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959533,0.002172887,0.0003408403,0.00042216555,0.0006926417,0.00041812632],"domain_scores_gemma":[0.92380553,0.06431035,0.0035104754,0.003659166,0.0035876764,0.001126778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011643898,0.0004920479,0.0007109189,0.0019889572,0.00056536216,0.0019069305,0.0007899687,0.0013268137,0.001968775],"category_scores_gemma":[0.07752342,0.00029252906,0.00038060427,0.001819853,0.00082823815,0.0040686536,0.0012361282,0.0012035914,0.00051740784],"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.0020644732,0.0007194016,0.08426953,0.0005415516,0.0003186733,0.00014258253,0.00036515173,0.61612993,0.0047821836,0.025569735,0.0022467615,0.26284996],"study_design_scores_gemma":[0.00007329182,0.0007967327,0.0076827374,0.00008298163,0.00007790401,0.00007855315,0.000343835,0.95894444,0.0027968204,0.02785059,0.0012442771,0.00002780918],"about_ca_topic_score_codex":0.0030697903,"about_ca_topic_score_gemma":0.00405214,"teacher_disagreement_score":0.011643898,"about_ca_system_score_codex":0.0009927393,"about_ca_system_score_gemma":0.0011946509,"threshold_uncertainty_score":0.061579585},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036678195,0.00067823933,0.9224505,0.0015890272,0.00023881083,0.0009309704,0.0003906813,0.019212818,0.017830797],"genre_scores_gemma":[0.15838109,0.0003799845,0.8343938,0.0004369201,0.00011872986,0.0003214689,0.00057534466,0.000213346,0.005179364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984976,0.0005142984,0.00016634681,0.00031856136,0.00040843236,0.000094763935],"domain_scores_gemma":[0.9964593,0.0020987913,0.00016636796,0.00039576067,0.0006559205,0.00022375643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024594902,0.000597207,0.0006699536,0.0012693295,0.0009603839,0.0026961993,0.0019335165,0.001088444,0.008107592],"category_scores_gemma":[0.006475121,0.00053455937,0.0004864309,0.0013349399,0.00061621465,0.0021004884,0.0012005549,0.0011283251,0.0026897604],"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.001110334,0.0012260963,0.007630104,0.0006145276,0.0002061901,0.0010141003,0.0012842849,0.09809259,0.02693585,0.023169713,0.021516876,0.8171993],"study_design_scores_gemma":[0.00021545793,0.0003226335,0.001739387,0.00013042797,0.00018571137,0.00049510703,0.00028290285,0.90015614,0.015005876,0.019801866,0.061569918,0.00009464462],"about_ca_topic_score_codex":0.008386043,"about_ca_topic_score_gemma":0.00835809,"teacher_disagreement_score":0.008386043,"about_ca_system_score_codex":0.0011083912,"about_ca_system_score_gemma":0.0024639948,"threshold_uncertainty_score":0.027122617},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021943377,0.0003302137,0.91696525,0.0002444107,0.00010805406,0.00015024112,0.005892978,0.06670494,0.009384507],"genre_scores_gemma":[0.011165461,0.0009803053,0.9157748,0.0007263443,0.00015548138,0.0015193673,0.0238711,0.026549777,0.019257318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727505,0.0004723461,0.00031977016,0.0004432639,0.001308973,0.00018058244],"domain_scores_gemma":[0.995449,0.002260918,0.00020896377,0.0010557385,0.0008848459,0.00014042403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023117594,0.0024836643,0.0015046247,0.003026426,0.00096426,0.003337413,0.005997489,0.0025536935,0.13185276],"category_scores_gemma":[0.013761477,0.0021216907,0.0032154082,0.0037693921,0.0010469047,0.0037535122,0.0051572276,0.005055876,0.06799911],"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.00022471198,0.00018593337,0.0005862161,0.0019610003,0.00019400356,0.00035582567,0.00018561872,0.044755854,0.0031335542,0.11667026,0.27640074,0.55534637],"study_design_scores_gemma":[0.00022103416,0.000056963065,0.00025468427,0.00035827787,0.00004555646,0.0004482736,0.00004105162,0.1943768,0.006894721,0.16879413,0.6284173,0.00009125192],"about_ca_topic_score_codex":0.004411845,"about_ca_topic_score_gemma":0.008730239,"teacher_disagreement_score":0.13185276,"about_ca_system_score_codex":0.0013952611,"about_ca_system_score_gemma":0.0033356275,"threshold_uncertainty_score":0.44109142},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028594725,0.00078767556,0.97344637,0.00032298377,0.00009346375,0.000046184505,0.00019863983,0.00016394313,0.022081219],"genre_scores_gemma":[0.19798908,0.0014908008,0.7796949,0.00031383603,0.00028507377,0.00048590408,0.0007460607,0.00038556062,0.018608697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994825,0.00020935197,0.000017666238,0.000055861838,0.00018115001,0.000053449578],"domain_scores_gemma":[0.9992749,0.00045167023,0.0000669264,0.000061319486,0.00010468125,0.000040414103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095449196,0.00075734884,0.00057018606,0.00083821063,0.00039560458,0.0010293856,0.0006504993,0.0004992537,0.012630751],"category_scores_gemma":[0.0027669156,0.0004128847,0.0010698023,0.0013629852,0.0012454891,0.00097071746,0.0012475936,0.0017340174,0.0028465348],"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.000037237773,0.00003832344,0.00015701148,0.00023936782,0.000028060953,0.00007386241,0.0000756171,0.34851807,0.0009114672,0.59263754,0.010522392,0.046761],"study_design_scores_gemma":[0.00001270779,0.00001544783,0.000098179786,0.000051653053,0.000008526596,0.000020339785,0.000013870714,0.6176005,0.00033167866,0.37466705,0.007171895,0.000008167402],"about_ca_topic_score_codex":0.005941227,"about_ca_topic_score_gemma":0.0063221995,"teacher_disagreement_score":0.012630751,"about_ca_system_score_codex":0.0019720672,"about_ca_system_score_gemma":0.0013556567,"threshold_uncertainty_score":0.04225409},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012868217,0.0028539575,0.966729,0.0025846665,0.00015883007,0.00014405906,0.00020434444,0.0008566634,0.013600344],"genre_scores_gemma":[0.38494435,0.0032322318,0.6082938,0.0005017217,0.00022049065,0.00020943554,0.0005016446,0.00018522184,0.0019110842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.987405,0.0066354983,0.00065168156,0.0010755578,0.003927097,0.00030524394],"domain_scores_gemma":[0.9572082,0.035434455,0.0015239733,0.003376061,0.001996722,0.0004604413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011479517,0.0010753492,0.0012697696,0.003667749,0.00065406173,0.0044508995,0.003227911,0.0026991975,0.0046937834],"category_scores_gemma":[0.051450953,0.000725475,0.0017530058,0.0043543577,0.0021350374,0.010348775,0.0022565653,0.0023615246,0.0007912095],"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.0003766935,0.00036987488,0.003055714,0.0007299519,0.00028488823,0.00018306187,0.00065324974,0.2773148,0.0009115762,0.36032885,0.004707666,0.3510836],"study_design_scores_gemma":[0.000053826683,0.00012383744,0.00090662437,0.00020792024,0.0000962076,0.00017472876,0.00017314166,0.79174995,0.000852368,0.19724421,0.0083591,0.0000581109],"about_ca_topic_score_codex":0.007886886,"about_ca_topic_score_gemma":0.0059064864,"teacher_disagreement_score":0.011479517,"about_ca_system_score_codex":0.0027272813,"about_ca_system_score_gemma":0.0017316533,"threshold_uncertainty_score":0.06071019},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070048973,0.00006954957,0.99583286,0.00013520649,0.000041716154,0.00008755751,0.00006012307,0.00045236465,0.002620244],"genre_scores_gemma":[0.036285233,0.00010995792,0.9591854,0.00007825708,0.000041387866,0.00039651062,0.0001439342,0.0001053038,0.003653904],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99747425,0.0009306862,0.00016138435,0.0005955548,0.0007320641,0.00010595641],"domain_scores_gemma":[0.9951201,0.003346352,0.00024304146,0.0005996638,0.0005580624,0.00013270385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028179046,0.0011087054,0.00076775794,0.0021137905,0.0010878075,0.0021952677,0.002500588,0.0019064134,0.010637164],"category_scores_gemma":[0.011423966,0.00065059663,0.001182174,0.0017780226,0.0020978693,0.0030191476,0.0023828063,0.002357504,0.0020996202],"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.00017587307,0.00013052399,0.0010551247,0.0005074294,0.0000916859,0.0003057118,0.00044690512,0.11606324,0.0040879413,0.4101706,0.0123074055,0.45465758],"study_design_scores_gemma":[0.00006049407,0.000057142002,0.00019404218,0.00009361485,0.000028042406,0.000291341,0.00008348827,0.78165054,0.002980509,0.17827812,0.036244657,0.000037989168],"about_ca_topic_score_codex":0.002804899,"about_ca_topic_score_gemma":0.0033764825,"teacher_disagreement_score":0.010637164,"about_ca_system_score_codex":0.0012840732,"about_ca_system_score_gemma":0.002170715,"threshold_uncertainty_score":0.035584867},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065679386,0.00024864683,0.93067217,0.00021601122,0.000017252565,0.00008971429,0.00026851156,0.0013939054,0.00141445],"genre_scores_gemma":[0.6404954,0.00022080982,0.35751984,0.00006865563,0.000031202955,0.0001848623,0.00061810226,0.00018527936,0.0006758243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745196,0.00082854944,0.00017771362,0.0005379027,0.0007586465,0.00024515242],"domain_scores_gemma":[0.9908728,0.0070655514,0.0007275667,0.0006813575,0.00044144978,0.00021145128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00311046,0.0010784735,0.0012020579,0.0016875836,0.0005908709,0.0014351864,0.0012611384,0.0011824961,0.0017787098],"category_scores_gemma":[0.015606333,0.0009821174,0.00167673,0.0010212628,0.0025580563,0.0026210733,0.0022639344,0.0015048776,0.00027885815],"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.00011572477,0.000024951427,0.00060755614,0.00008786538,0.00005558034,0.00010835791,0.00009205623,0.957187,0.0014174313,0.020572243,0.00028729395,0.019443952],"study_design_scores_gemma":[0.00001655076,0.000030684947,0.0001223015,0.000009662991,0.0000136394965,0.000016304177,0.000022363216,0.9559943,0.0011982736,0.04234312,0.00022421867,0.000008629692],"about_ca_topic_score_codex":0.005849578,"about_ca_topic_score_gemma":0.0043362635,"teacher_disagreement_score":0.005849578,"about_ca_system_score_codex":0.0018393586,"about_ca_system_score_gemma":0.0020502948,"threshold_uncertainty_score":0.016449869},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47495225,0.0007419289,0.49493852,0.006535955,0.000107610445,0.000377483,0.001488002,0.002364367,0.018493872],"genre_scores_gemma":[0.83576274,0.00032866356,0.15935802,0.0002894706,0.00007499348,0.00020511393,0.0014408829,0.0002361811,0.0023038324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974119,0.0011349167,0.000135726,0.0004929809,0.0004502988,0.00037413748],"domain_scores_gemma":[0.97369224,0.023417026,0.0007733536,0.0014871993,0.00033578137,0.00029432075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002729788,0.000640947,0.0010620609,0.00067522156,0.0010868588,0.002600672,0.0021411006,0.00135988,0.0059299283],"category_scores_gemma":[0.01639002,0.0006766275,0.0018896024,0.0012548275,0.0024915398,0.0053754817,0.00206712,0.0026899623,0.00046537095],"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.00075293594,0.00031805926,0.005499708,0.0007899096,0.0002099021,0.0003601271,0.00064241805,0.7255532,0.005024202,0.15166764,0.00615074,0.103031255],"study_design_scores_gemma":[0.00009650977,0.00005254647,0.00067403953,0.00002569546,0.00004153946,0.00006335178,0.00015554875,0.7342358,0.0021250597,0.26145053,0.0010626742,0.000016649135],"about_ca_topic_score_codex":0.009087777,"about_ca_topic_score_gemma":0.01214626,"teacher_disagreement_score":0.009087777,"about_ca_system_score_codex":0.0024852857,"about_ca_system_score_gemma":0.0035506175,"threshold_uncertainty_score":0.019837558},"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":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000547056,0.00063078577,0.0011734517,0.99356383,0.0020099059,0.0000050292156,0.0000146305565,0.00001977697,0.0020354781],"genre_scores_gemma":[0.043123573,0.004050636,0.008838692,0.89655614,0.039373126,0.00008707711,0.000053990636,0.00008526294,0.007831494],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975255,0.0011143475,0.0002957614,0.00031403394,0.00054794713,0.00020240355],"domain_scores_gemma":[0.9699411,0.02400207,0.00076294085,0.001043513,0.0023473243,0.0019031633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053873057,0.00038407985,0.0008549788,0.0008739662,0.0027423147,0.0037861483,0.0017840271,0.02142799,0.0061992644],"category_scores_gemma":[0.038949985,0.00055042276,0.000668601,0.00057265896,0.007673986,0.009430319,0.0019979503,0.04139698,0.0032270656],"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.00014133423,0.00008929783,0.0029866903,0.000118007214,0.00003901851,0.0039090454,0.0013465745,0.000807312,0.00035161868,0.06290161,0.8176367,0.109672785],"study_design_scores_gemma":[0.00009198325,0.00008048288,0.0011549994,0.0003533223,0.000028130973,0.008058253,0.0023997668,0.0049756966,0.00043804653,0.42758742,0.55471927,0.00011257112],"about_ca_topic_score_codex":0.0046819383,"about_ca_topic_score_gemma":0.013321443,"teacher_disagreement_score":0.02142799,"about_ca_system_score_codex":0.0027544925,"about_ca_system_score_gemma":0.0034420046,"threshold_uncertainty_score":0.02849114},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00671785,0.5232641,0.21633881,0.094912134,0.041078556,0.00012363974,0.0007331104,0.0010763956,0.11575546],"genre_scores_gemma":[0.1934843,0.50303733,0.10383231,0.02434654,0.058130305,0.00024986826,0.0020737627,0.00096475345,0.113880806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99808145,0.00055430195,0.00019082434,0.00031002008,0.0006869738,0.0001763521],"domain_scores_gemma":[0.9966929,0.0022400941,0.00021083027,0.00026552172,0.00044332087,0.00014740026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018966177,0.0006983039,0.00059729663,0.002658938,0.0008543823,0.0038187853,0.0009653456,0.0021439213,0.006963845],"category_scores_gemma":[0.005967893,0.0005264906,0.0009056708,0.003475906,0.0036010323,0.005938828,0.0024414083,0.004814614,0.002031196],"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.000091643,0.000057213794,0.00055685657,0.0012219574,0.000026155169,0.001034795,0.0008674202,0.0048595816,0.0017405346,0.62425834,0.12014922,0.24513629],"study_design_scores_gemma":[0.000008537797,0.00006024057,0.0006802788,0.00043276776,0.000019581792,0.0011978794,0.00024126512,0.0034463874,0.0011122087,0.11562099,0.8771434,0.000036500245],"about_ca_topic_score_codex":0.0074408255,"about_ca_topic_score_gemma":0.00448194,"teacher_disagreement_score":0.0074408255,"about_ca_system_score_codex":0.0032903994,"about_ca_system_score_gemma":0.0023206207,"threshold_uncertainty_score":0.023873627},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45368433,0.0024885132,0.4703438,0.0022001197,0.00023813263,0.0007213471,0.0005752846,0.0012982149,0.06845034],"genre_scores_gemma":[0.8438169,0.0009786797,0.13438778,0.0002210723,0.000036598205,0.00039339426,0.0009916705,0.00008754004,0.019086393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991922,0.00023714981,0.000043616845,0.00026109055,0.0001999994,0.000065948334],"domain_scores_gemma":[0.99702567,0.0017056811,0.0002571773,0.00037815922,0.0003553568,0.00027796256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012453608,0.0005337633,0.00030761812,0.00067640346,0.0005979839,0.0018835347,0.00096016575,0.00095891743,0.011244608],"category_scores_gemma":[0.008970987,0.00029025687,0.0005402072,0.00060094974,0.0013337542,0.004310517,0.0026081498,0.0014623223,0.0013477362],"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.00046005932,0.0011393165,0.021086505,0.00097245834,0.00008403574,0.000762324,0.010550364,0.040156614,0.0075566773,0.15027778,0.01197,0.7549839],"study_design_scores_gemma":[0.00018623835,0.001079759,0.01915089,0.00089775183,0.00009454018,0.0007022923,0.0064494107,0.24367402,0.012249228,0.583835,0.13152637,0.00015450866],"about_ca_topic_score_codex":0.0041385763,"about_ca_topic_score_gemma":0.007156454,"teacher_disagreement_score":0.011244608,"about_ca_system_score_codex":0.0014979979,"about_ca_system_score_gemma":0.0017779659,"threshold_uncertainty_score":0.03761691},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017616251,0.026500773,0.8924528,0.004977801,0.00048421932,0.00007432319,0.0002119323,0.0002793289,0.05740264],"genre_scores_gemma":[0.7422686,0.026727377,0.20721756,0.00045006117,0.0012695672,0.00017248633,0.0005123289,0.00010627862,0.021275666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895906,0.0002730995,0.000084283616,0.00011091158,0.00048960425,0.00008298594],"domain_scores_gemma":[0.996439,0.0028963918,0.00013072632,0.00023298888,0.00023568043,0.000065160864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016470051,0.00055853423,0.0008080051,0.0012222241,0.0005633093,0.004334145,0.0012793392,0.0012833739,0.003634738],"category_scores_gemma":[0.006334331,0.00045556854,0.00056758017,0.0025531105,0.001959622,0.006098516,0.0015566123,0.0015587022,0.00060867553],"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.00012478286,0.00007320518,0.0004623571,0.00037695933,0.000083453095,0.00022745016,0.00044022535,0.18269384,0.0015544865,0.4882548,0.00967504,0.31603333],"study_design_scores_gemma":[0.000010595267,0.000028725815,0.00021699489,0.00007895205,0.000025284358,0.00007602395,0.00009952408,0.20805204,0.0011600349,0.77510476,0.0151264295,0.000020556745],"about_ca_topic_score_codex":0.0028112638,"about_ca_topic_score_gemma":0.0017844272,"teacher_disagreement_score":0.004334145,"about_ca_system_score_codex":0.0012228913,"about_ca_system_score_gemma":0.0010079814,"threshold_uncertainty_score":0.012159467},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14031038,0.0007105519,0.78064257,0.0031585838,0.00042372438,0.00042810815,0.0011819858,0.010707671,0.06243651],"genre_scores_gemma":[0.34080794,0.0005957149,0.63795346,0.00015597598,0.000041912317,0.00010687437,0.0011268307,0.0010490828,0.018162226],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996706,0.000067994544,0.000015128821,0.00011343121,0.000091431844,0.000041435876],"domain_scores_gemma":[0.9994124,0.00020573012,0.0000363395,0.00015772175,0.00011029134,0.00007747239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044170782,0.0008579137,0.0005584437,0.00056013605,0.0015426808,0.002468407,0.0022217773,0.0016810667,0.015370485],"category_scores_gemma":[0.0031547183,0.000705492,0.0008262273,0.00088258955,0.0014971708,0.0026125011,0.002236248,0.0016829554,0.0021758955],"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.00047559632,0.00019146789,0.006195531,0.00034118135,0.00011038605,0.0005988233,0.0032428396,0.16354938,0.019675843,0.052347228,0.047549736,0.70572203],"study_design_scores_gemma":[0.00008127038,0.00013062418,0.0050174105,0.00010657615,0.00010065832,0.0002759323,0.0040493393,0.72269744,0.016135618,0.12094538,0.13036214,0.0000976339],"about_ca_topic_score_codex":0.06577118,"about_ca_topic_score_gemma":0.12807444,"teacher_disagreement_score":0.06577118,"about_ca_system_score_codex":0.0010146864,"about_ca_system_score_gemma":0.0023839104,"threshold_uncertainty_score":0.13077664},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04483442,0.00089697505,0.9403488,0.00088923716,0.000050371797,0.00008798261,0.00067058194,0.0051511377,0.00707059],"genre_scores_gemma":[0.7041638,0.0006280914,0.28726536,0.0003554156,0.000042526623,0.0002252679,0.001630412,0.00034265788,0.0053465217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995203,0.00015892817,0.000021693291,0.00013405373,0.00010008183,0.00006496078],"domain_scores_gemma":[0.99873286,0.0008669683,0.00007946213,0.00016189324,0.00009458003,0.00006432886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082353357,0.0008544319,0.0007524069,0.00058657076,0.0004530831,0.0011760965,0.0012564821,0.001056002,0.0045467373],"category_scores_gemma":[0.0029327478,0.0005205376,0.0007418416,0.0007492372,0.0017278354,0.0025000337,0.0017059912,0.0020985543,0.00057296176],"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.00013958973,0.000059334863,0.0006735415,0.00016435272,0.00004105512,0.00006981807,0.00009225253,0.86672014,0.0010223078,0.057441853,0.0027776028,0.07079807],"study_design_scores_gemma":[0.000013967183,0.000014618999,0.00006294809,0.000009197568,0.000004074019,0.0000074501654,0.000008845401,0.9496291,0.00054165744,0.049008675,0.00069551053,0.0000038981966],"about_ca_topic_score_codex":0.018076118,"about_ca_topic_score_gemma":0.027362915,"teacher_disagreement_score":0.018076118,"about_ca_system_score_codex":0.0022402317,"about_ca_system_score_gemma":0.0021645813,"threshold_uncertainty_score":0.03594184},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031176183,0.00035802374,0.9517906,0.0003345891,0.00008015077,0.00021221614,0.00029185592,0.00092552986,0.014830936],"genre_scores_gemma":[0.2751556,0.00016661936,0.7211844,0.00017446377,0.000033173823,0.00031117268,0.00044987162,0.00017301564,0.0023517103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998776,0.00051351247,0.000071750976,0.0001706941,0.00033041416,0.00013751189],"domain_scores_gemma":[0.9972325,0.0019756304,0.00024612393,0.00025027824,0.00017881276,0.00011676742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016270764,0.0009740963,0.0007617449,0.0010612983,0.0005475946,0.0010674355,0.0013997209,0.0010410417,0.005993613],"category_scores_gemma":[0.005903268,0.00046317678,0.00071768946,0.0013756577,0.0016635109,0.0015795437,0.0010934414,0.0018355893,0.00053877564],"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.0002070332,0.00012157246,0.00040548277,0.00024811522,0.000021994738,0.00012216228,0.000092235714,0.8449719,0.002602716,0.07299747,0.0023847735,0.075824544],"study_design_scores_gemma":[0.000049566013,0.000081259546,0.00013213999,0.000043368516,0.000009928606,0.000040187588,0.000031603005,0.9290458,0.0018434213,0.06647202,0.0022368946,0.000013744599],"about_ca_topic_score_codex":0.002855798,"about_ca_topic_score_gemma":0.004125028,"teacher_disagreement_score":0.005993613,"about_ca_system_score_codex":0.0017348008,"about_ca_system_score_gemma":0.0019057383,"threshold_uncertainty_score":0.020050585},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003869694,0.0009937803,0.9581409,0.0028011405,0.00010083375,0.00018505775,0.00013948552,0.00027902785,0.03349013],"genre_scores_gemma":[0.2281043,0.0017279185,0.7574567,0.0006126257,0.00012866328,0.0012535481,0.00039259528,0.00019390201,0.010129743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783796,0.0010939302,0.00011690296,0.00034101697,0.0004970293,0.00011317405],"domain_scores_gemma":[0.99766386,0.0014213581,0.000114257105,0.00042329798,0.0002747085,0.000102467675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037974743,0.0013251441,0.0010885706,0.0018106608,0.001134847,0.0066140806,0.0038675533,0.0019519653,0.005295336],"category_scores_gemma":[0.005166682,0.00074753235,0.0025256744,0.0014690364,0.0065070027,0.0052626417,0.0033628067,0.0035104472,0.0007248234],"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.0000073095125,0.000017239547,0.00010412733,0.00007446252,0.00003347405,0.000042887685,0.000336624,0.020340212,0.00014700826,0.9726251,0.0005245525,0.0057470035],"study_design_scores_gemma":[0.000016668406,0.000017491846,0.0000506222,0.000056800403,0.000018740506,0.000030955176,0.00010666034,0.051095646,0.00021152309,0.93216795,0.016215257,0.000011760279],"about_ca_topic_score_codex":0.0065909396,"about_ca_topic_score_gemma":0.0063250964,"teacher_disagreement_score":0.0066140806,"about_ca_system_score_codex":0.0058751446,"about_ca_system_score_gemma":0.004761403,"threshold_uncertainty_score":0.042627335},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040622927,0.00054621074,0.9501504,0.00031904373,0.000066539935,0.00013564363,0.0001252231,0.0027271123,0.0053068004],"genre_scores_gemma":[0.37983698,0.00023967211,0.61707836,0.00021041163,0.000022231665,0.0002516108,0.00020832192,0.0004092037,0.0017431172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802196,0.00093700096,0.00010419435,0.00025221417,0.00048211036,0.00020256106],"domain_scores_gemma":[0.99206936,0.0053643743,0.0005345219,0.0013534527,0.0004611045,0.00021718726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025154885,0.0008900851,0.0008237047,0.00070531276,0.00060057675,0.0012207063,0.0018019602,0.0008981413,0.0028043494],"category_scores_gemma":[0.012212865,0.0005494064,0.0008687923,0.0010655944,0.0014068406,0.002328602,0.0022660345,0.0015146169,0.0006108324],"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.00060539134,0.00021166731,0.0045988383,0.00041305294,0.00013577139,0.00017394,0.0003770471,0.5533001,0.008968993,0.047132626,0.006283334,0.37779927],"study_design_scores_gemma":[0.00004970164,0.00015713446,0.00024756012,0.000040090745,0.000027960132,0.00009908663,0.00006597943,0.96145207,0.0040015024,0.030363273,0.0034763347,0.000019332005],"about_ca_topic_score_codex":0.0037863962,"about_ca_topic_score_gemma":0.006968011,"teacher_disagreement_score":0.0037863962,"about_ca_system_score_codex":0.00079053314,"about_ca_system_score_gemma":0.0026619188,"threshold_uncertainty_score":0.0133033395},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03473171,0.00074572064,0.95152414,0.00050336,0.00020583144,0.00033179758,0.00010484186,0.0017384883,0.010114263],"genre_scores_gemma":[0.44355184,0.00046835482,0.5492132,0.0005058939,0.00014227554,0.0004955182,0.00041283478,0.0010466976,0.0041633546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9911617,0.0030488363,0.0007403367,0.000870399,0.0027375226,0.0014411905],"domain_scores_gemma":[0.9602577,0.028363377,0.002019614,0.0043139695,0.003906324,0.0011389005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010210409,0.0014680394,0.0029055274,0.0012576866,0.00177267,0.002441113,0.0029779873,0.0020193704,0.007955757],"category_scores_gemma":[0.06542972,0.0010471127,0.0014184031,0.0009763987,0.002536678,0.0051106806,0.00311924,0.003831588,0.0018253791],"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.002705734,0.00053864333,0.0033435863,0.0012068198,0.00018233882,0.00075846445,0.00084696745,0.6040088,0.01620212,0.1346985,0.009677415,0.22583058],"study_design_scores_gemma":[0.00017391039,0.0005021799,0.00047284612,0.00022262853,0.00007170377,0.00036302113,0.00014035423,0.8993267,0.013736397,0.0798059,0.0051106308,0.000073786905],"about_ca_topic_score_codex":0.002520689,"about_ca_topic_score_gemma":0.0034458698,"teacher_disagreement_score":0.010210409,"about_ca_system_score_codex":0.0014706006,"about_ca_system_score_gemma":0.0041425615,"threshold_uncertainty_score":0.05399847},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019788003,0.0019588028,0.8119889,0.0062724627,0.00022845506,0.00032035797,0.0011110342,0.00088875735,0.15744317],"genre_scores_gemma":[0.44133466,0.0029541429,0.52415204,0.001847865,0.00037035096,0.0008918485,0.0018463923,0.00021988338,0.026382793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985336,0.00043301572,0.0001292843,0.00037629847,0.00034755006,0.00018025596],"domain_scores_gemma":[0.99903935,0.0002035468,0.00009048267,0.00036191102,0.00016099267,0.00014364407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014792335,0.0006711355,0.0005494496,0.0014423034,0.0014381915,0.0042049023,0.0018203425,0.0020269125,0.00560944],"category_scores_gemma":[0.0016002923,0.00042701227,0.0013573703,0.0015503746,0.0060258317,0.0076176403,0.002534628,0.0022661996,0.0011609243],"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.0000025962077,0.000004624834,0.00007922602,0.000019287923,0.0000034163304,0.000024386336,0.00013861622,0.0011130073,0.00013823497,0.99600935,0.0005374076,0.0019298043],"study_design_scores_gemma":[0.000014170265,0.000023380959,0.00028497534,0.000055682587,0.000015361973,0.00013585518,0.00020288996,0.014545558,0.00023229019,0.9162167,0.06825536,0.000017691273],"about_ca_topic_score_codex":0.005639312,"about_ca_topic_score_gemma":0.0044346643,"teacher_disagreement_score":0.005639312,"about_ca_system_score_codex":0.0018698223,"about_ca_system_score_gemma":0.0021434624,"threshold_uncertainty_score":0.01876551},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058313096,0.00027489942,0.98836666,0.0002614228,0.000040817697,0.000051745992,0.00006380984,0.00014190028,0.004967416],"genre_scores_gemma":[0.19468787,0.00046218667,0.80067545,0.00013547775,0.00007235189,0.00026179577,0.00017115266,0.00008106342,0.0034526538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987423,0.0005857619,0.00007209617,0.00017126783,0.00033315824,0.00009543315],"domain_scores_gemma":[0.9978194,0.0016003628,0.00011656369,0.00018393547,0.00018453848,0.00009519914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019712124,0.0007280778,0.0010724876,0.0014411062,0.0009254264,0.0018003708,0.0025223047,0.0014704417,0.005634915],"category_scores_gemma":[0.0069085117,0.0010024036,0.0014301043,0.0029720752,0.001900674,0.0031407375,0.001502217,0.0016655546,0.00044330847],"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.0002037344,0.00013697702,0.0004396825,0.00019866391,0.00013825859,0.00023287079,0.00034990782,0.52524316,0.000948599,0.38992694,0.003054169,0.07912711],"study_design_scores_gemma":[0.000062629435,0.00005522987,0.000092725786,0.00002907272,0.00005203663,0.00006413972,0.00006060732,0.82194555,0.00050001877,0.17415012,0.002961554,0.000026292082],"about_ca_topic_score_codex":0.008812609,"about_ca_topic_score_gemma":0.010736525,"teacher_disagreement_score":0.008812609,"about_ca_system_score_codex":0.0014523538,"about_ca_system_score_gemma":0.0020615305,"threshold_uncertainty_score":0.018850625},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08286754,0.0004732176,0.88920784,0.00045759155,0.000109295266,0.00056002283,0.0009398253,0.016178101,0.009206623],"genre_scores_gemma":[0.3280575,0.0002193725,0.6658988,0.00022940412,0.0000372341,0.0007365251,0.0013872081,0.0011919725,0.0022420113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845934,0.0004630226,0.00012752693,0.00031135487,0.00040585606,0.00023297331],"domain_scores_gemma":[0.99494946,0.0030617397,0.00032126822,0.0008871464,0.00065879105,0.00012156486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019351222,0.0012000421,0.0012336528,0.0019693887,0.0005724849,0.0021089532,0.002214373,0.0010454993,0.005040153],"category_scores_gemma":[0.011341309,0.00083096145,0.0010717956,0.0013949807,0.0009721715,0.0027234165,0.001888457,0.0012746206,0.001481666],"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.00077740627,0.00036902577,0.0052839206,0.0007030012,0.00013052161,0.00040196185,0.0009101941,0.27499434,0.029209783,0.08843363,0.018814007,0.57997227],"study_design_scores_gemma":[0.00010728264,0.00013344106,0.000399909,0.00006733544,0.000047571073,0.00006897782,0.00015414027,0.9362859,0.014413251,0.042237237,0.006049167,0.000035787714],"about_ca_topic_score_codex":0.0021955788,"about_ca_topic_score_gemma":0.0036872623,"teacher_disagreement_score":0.005040153,"about_ca_system_score_codex":0.0015768447,"about_ca_system_score_gemma":0.002418276,"threshold_uncertainty_score":0.016860962},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04134315,0.00040047485,0.94998384,0.0004875536,0.00004467319,0.00021277193,0.00020210518,0.0033504786,0.0039749024],"genre_scores_gemma":[0.3549894,0.00027869554,0.6407664,0.00018168215,0.000059824943,0.0002826236,0.0007266856,0.00079376996,0.0019208695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747235,0.00067576166,0.00015032178,0.00072470855,0.00081329164,0.00016358284],"domain_scores_gemma":[0.98875284,0.007029936,0.0007739751,0.002681721,0.00061954896,0.00014203617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025216402,0.0015925257,0.0021256823,0.0022501936,0.0011444656,0.0018002532,0.0019523677,0.0014054117,0.013208482],"category_scores_gemma":[0.021141479,0.0014997213,0.0018199864,0.0019287502,0.0016143434,0.0068070646,0.0041192067,0.0031232329,0.0017355129],"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.0007223236,0.00047666245,0.0048459102,0.0010202321,0.00021894282,0.00036418834,0.0013479206,0.276417,0.016219033,0.20975016,0.005508465,0.4831092],"study_design_scores_gemma":[0.00008958437,0.000110670895,0.0009055936,0.00006868967,0.000116214826,0.000105056555,0.00016583307,0.69177735,0.0066594947,0.29393455,0.006027628,0.000039340266],"about_ca_topic_score_codex":0.0053267507,"about_ca_topic_score_gemma":0.008133002,"teacher_disagreement_score":0.013208482,"about_ca_system_score_codex":0.0015268495,"about_ca_system_score_gemma":0.002166803,"threshold_uncertainty_score":0.04418677},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034234433,0.06621563,0.43559554,0.008753239,0.002233101,0.00013156958,0.0007316071,0.0013193107,0.48159656],"genre_scores_gemma":[0.103840396,0.078616716,0.34932095,0.0041066958,0.0029654761,0.00044475863,0.0019038297,0.0011281163,0.45767304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998636,0.000031511074,0.0000059011213,0.000035496458,0.000053193227,0.000010238181],"domain_scores_gemma":[0.9998592,0.000088036184,0.000004779632,0.000018085166,0.000020683101,0.00000909022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022619615,0.00081201876,0.00034170967,0.00068606815,0.00060481776,0.0018027492,0.0007204253,0.00094384805,0.015891805],"category_scores_gemma":[0.00061333453,0.00033580905,0.00053474307,0.0015403434,0.0016904395,0.0022780122,0.00086375844,0.0023654713,0.005910604],"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.000024098405,0.000038237857,0.00008698676,0.00036850732,0.000009185001,0.0000990614,0.00029007287,0.00632093,0.0009030776,0.7625684,0.0710071,0.15828432],"study_design_scores_gemma":[0.000005343897,0.000016618154,0.00013785565,0.00020177652,0.0000061228366,0.00020752252,0.000054044387,0.010678872,0.0009030109,0.5417991,0.44597408,0.000015531657],"about_ca_topic_score_codex":0.0020904655,"about_ca_topic_score_gemma":0.0034716637,"teacher_disagreement_score":0.015891805,"about_ca_system_score_codex":0.0013379966,"about_ca_system_score_gemma":0.00071941374,"threshold_uncertainty_score":0.05316341},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019891437,0.0088627385,0.0035598548,0.0036853317,0.0008365053,0.00004412885,0.000110326066,0.000064941894,0.98084706],"genre_scores_gemma":[0.17176083,0.015962714,0.007024668,0.0043755937,0.0011185843,0.00024037187,0.00050412025,0.00018403814,0.7988291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896693,0.00039448607,0.000034095134,0.00023053373,0.00024736786,0.00012660318],"domain_scores_gemma":[0.9996846,0.00010123948,0.000029096997,0.00006924532,0.000052976557,0.000062839565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000612203,0.00057451037,0.0003624126,0.0009854907,0.002643924,0.0075738104,0.00064900226,0.0014428364,0.0433696],"category_scores_gemma":[0.0013172715,0.00026363743,0.00025628484,0.0016150507,0.0082469955,0.006490729,0.0036191826,0.0023636017,0.011945808],"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.000007665098,0.000008020889,0.00014793692,0.000050097053,0.0000033553333,0.000039192393,0.0029827266,0.00006184704,0.00008537447,0.9372709,0.029597046,0.029745866],"study_design_scores_gemma":[0.0000030921747,0.000006998592,0.00022863262,0.00009845649,0.0000024546973,0.00007554279,0.0011946139,0.000050057988,0.00003971895,0.16595651,0.83234066,0.000003293826],"about_ca_topic_score_codex":0.0027189716,"about_ca_topic_score_gemma":0.0025517824,"teacher_disagreement_score":0.0433696,"about_ca_system_score_codex":0.002348443,"about_ca_system_score_gemma":0.0017337028,"threshold_uncertainty_score":0.14508575},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030293845,0.016821027,0.0020870117,0.0065591657,0.009724573,0.00011959797,0.0053320606,0.0006888784,0.9583648],"genre_scores_gemma":[0.0019261123,0.011257357,0.0022159927,0.0024175628,0.0014116247,0.00006923244,0.0072597163,0.00060846825,0.9728338],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990564,0.00009934961,0.000059042264,0.0001416553,0.000573878,0.00006963118],"domain_scores_gemma":[0.9986009,0.0002514843,0.000057592537,0.00015938963,0.0007844556,0.00014609573],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006179797,0.0008141878,0.00078554987,0.0045524,0.0018773851,0.0047870954,0.0017731981,0.0018780946,0.51818866],"category_scores_gemma":[0.004420583,0.00032096345,0.00067394285,0.0052835816,0.0006518373,0.0042630634,0.002074686,0.0022150762,0.43729457],"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.000007672848,0.00001744254,0.000066570836,0.00018096711,0.0000019316938,0.00004767227,0.000096714895,0.00006597082,0.00007760847,0.013784403,0.92356014,0.062092938],"study_design_scores_gemma":[7.9016695e-7,0.0000014878683,0.000057685116,0.00012908074,6.655085e-7,0.000039484148,0.00003587805,0.000009012186,0.000019843314,0.0017571035,0.99794704,0.0000019382435],"about_ca_topic_score_codex":0.006489831,"about_ca_topic_score_gemma":0.010373442,"teacher_disagreement_score":0.48181134,"about_ca_system_score_codex":0.0027474575,"about_ca_system_score_gemma":0.0021840723,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072424286,0.034940355,0.27994108,0.0070501748,0.0010900438,0.00010915912,0.00018671511,0.0010172788,0.6684229],"genre_scores_gemma":[0.48741698,0.029914103,0.118196264,0.002069338,0.0009421123,0.00050760084,0.0004926324,0.00036851558,0.3600925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997342,0.000068374466,0.000009842754,0.000046904963,0.00010849402,0.000032198936],"domain_scores_gemma":[0.9998047,0.000075084405,0.000016675267,0.000040660736,0.00003740795,0.000025543748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034058385,0.000511754,0.0002798628,0.00033906268,0.00055684784,0.0024082428,0.0006995428,0.0010440631,0.009855112],"category_scores_gemma":[0.0008439485,0.0002975908,0.00030889033,0.00052302436,0.002000997,0.0020206363,0.00097575155,0.0016061601,0.0018187516],"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.000007142435,0.0000070687483,0.000054068012,0.00006108203,0.000007653395,0.000025015665,0.00013566614,0.00835675,0.00023038621,0.9533444,0.0095069,0.028263897],"study_design_scores_gemma":[0.000012957202,0.000015858093,0.000161135,0.00008250898,0.0000071935797,0.000043772405,0.000064560954,0.024270302,0.00023554327,0.7726147,0.20248373,0.000007777432],"about_ca_topic_score_codex":0.0036919324,"about_ca_topic_score_gemma":0.002705393,"teacher_disagreement_score":0.009855112,"about_ca_system_score_codex":0.0016985395,"about_ca_system_score_gemma":0.00119433,"threshold_uncertainty_score":0.03296864},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014087306,0.09644742,0.0017104369,0.10512988,0.06979672,0.00003737864,0.00043753244,0.00021646974,0.7248154],"genre_scores_gemma":[0.011395862,0.036651265,0.0008180623,0.028542196,0.016380357,0.000038333197,0.00036976382,0.0002098903,0.9055942],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993051,0.00013247658,0.000026515385,0.00012880862,0.00033640536,0.000070636306],"domain_scores_gemma":[0.9984707,0.00046827307,0.00007004499,0.00014045392,0.00052222604,0.00032841877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093768793,0.00075615465,0.000462692,0.0014747264,0.0024069117,0.009468556,0.0010421482,0.0021346991,0.07440801],"category_scores_gemma":[0.0048824577,0.00030848625,0.00039945275,0.0012798114,0.0026699074,0.009469043,0.0026747442,0.0052387794,0.047718465],"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.000022958162,0.000017727567,0.00012276291,0.00013127438,0.0000029656892,0.000086095126,0.00048151362,0.000058794983,0.00009920343,0.08033912,0.86662555,0.05201207],"study_design_scores_gemma":[7.596892e-7,0.0000028560119,0.000040874038,0.00009602867,4.9436983e-7,0.000057747882,0.00014048221,0.0000105282215,0.000021984233,0.0047206855,0.9949056,0.0000019382774],"about_ca_topic_score_codex":0.0015842068,"about_ca_topic_score_gemma":0.0034215932,"teacher_disagreement_score":0.07440801,"about_ca_system_score_codex":0.0022896219,"about_ca_system_score_gemma":0.0021821153,"threshold_uncertainty_score":0.2489196},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067673814,0.053032387,0.47422972,0.03433003,0.002768259,0.00011338626,0.0005444544,0.00052505283,0.42768928],"genre_scores_gemma":[0.5350526,0.06615445,0.1515336,0.0105951205,0.007503242,0.0007124759,0.0017387916,0.00042584716,0.22628379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846774,0.00060282927,0.00007381853,0.00023989734,0.00053133327,0.00008436381],"domain_scores_gemma":[0.99743503,0.0019201166,0.00011390237,0.00026523587,0.000189403,0.0000762772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018002156,0.00089734746,0.00075244915,0.0007225306,0.0010133509,0.0043235365,0.001058868,0.0015479892,0.012792289],"category_scores_gemma":[0.008259087,0.00036279354,0.00069475523,0.00092302845,0.0035133024,0.005660638,0.0027542375,0.0036161316,0.0026709603],"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.000016606826,0.00001267068,0.00021222523,0.00020326908,0.000035732188,0.00009661779,0.0003279103,0.0067778626,0.00012225042,0.8932321,0.027679924,0.07128282],"study_design_scores_gemma":[0.000004703395,0.000008820406,0.00009464787,0.00011400207,0.000006539777,0.00006606522,0.000068727495,0.0072341985,0.00009139974,0.9205058,0.071796164,0.000008961076],"about_ca_topic_score_codex":0.0011069024,"about_ca_topic_score_gemma":0.0010038099,"teacher_disagreement_score":0.012792289,"about_ca_system_score_codex":0.0017537302,"about_ca_system_score_gemma":0.0013672294,"threshold_uncertainty_score":0.042794466},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006666917,0.00871121,0.56553835,0.014771315,0.0015808918,0.00040332388,0.002737063,0.0014308062,0.3981602],"genre_scores_gemma":[0.21241558,0.014122638,0.5826487,0.0045812167,0.0015447171,0.0009705023,0.009539516,0.00092377345,0.17325343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99656564,0.0011344161,0.00031085272,0.00072608824,0.0010376382,0.0002254374],"domain_scores_gemma":[0.99693143,0.0019596296,0.00014144515,0.00049018196,0.00038031474,0.00009704664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022578,0.00148816,0.0009205293,0.0015779381,0.0020787765,0.0070970035,0.0030840496,0.0025149481,0.02973045],"category_scores_gemma":[0.010522466,0.0009470093,0.002280631,0.0020508694,0.0038175974,0.012265682,0.005291228,0.0044299527,0.006801721],"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.000030340689,0.00003536168,0.00021381173,0.00042071022,0.000049694157,0.00035035788,0.0007563474,0.0036869266,0.00044666437,0.89484316,0.03412807,0.06503862],"study_design_scores_gemma":[0.000022119963,0.000010201723,0.000104374725,0.00024646582,0.000024623476,0.00030493675,0.0003851563,0.008433392,0.0008055994,0.74868435,0.24095458,0.000024145025],"about_ca_topic_score_codex":0.0048165433,"about_ca_topic_score_gemma":0.0058315177,"teacher_disagreement_score":0.02973045,"about_ca_system_score_codex":0.0020045978,"about_ca_system_score_gemma":0.0024914464,"threshold_uncertainty_score":0.09945822},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072431588,0.01813696,0.8439194,0.0039005037,0.002284961,0.00037274277,0.0027872997,0.0055681225,0.115786895],"genre_scores_gemma":[0.20631415,0.017949434,0.58170956,0.0027773767,0.0035018828,0.0011080584,0.02015061,0.0013773894,0.16511156],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99788505,0.00055600196,0.00014607958,0.00050603406,0.00080363924,0.000103157],"domain_scores_gemma":[0.9980241,0.0008220823,0.00010741475,0.0005066851,0.00046099813,0.00007863496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015440439,0.000970662,0.0012207725,0.0013098845,0.0006568941,0.0028602595,0.0020886709,0.001370067,0.020716837],"category_scores_gemma":[0.005640248,0.00038989924,0.0008215311,0.0021956917,0.0009294004,0.0025275094,0.0018597965,0.0021463619,0.013328251],"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.00005938584,0.00009253375,0.0010237324,0.00057559303,0.00013340093,0.00007818847,0.000104491526,0.013727439,0.000899583,0.056328755,0.123449676,0.8035273],"study_design_scores_gemma":[0.000055369506,0.00014179351,0.0017934033,0.00040539476,0.000058915466,0.00050725695,0.0001665831,0.2841965,0.0033215669,0.309905,0.39938867,0.000059587263],"about_ca_topic_score_codex":0.001037475,"about_ca_topic_score_gemma":0.0017935452,"teacher_disagreement_score":0.020716837,"about_ca_system_score_codex":0.00075109553,"about_ca_system_score_gemma":0.0015881578,"threshold_uncertainty_score":0.069304764},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001627844,0.026128603,0.05849013,0.010252765,0.002105184,0.00009962,0.0006567025,0.00034244038,0.9002967],"genre_scores_gemma":[0.2957673,0.054832786,0.12169855,0.009220814,0.0047260723,0.00084724603,0.003679104,0.00063727185,0.5085909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805874,0.0008582999,0.00012364074,0.00035160652,0.0004947587,0.00011296851],"domain_scores_gemma":[0.9983516,0.0010202377,0.000084772946,0.0002402025,0.00024201257,0.00006119164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001770106,0.0009499133,0.00057457475,0.0019694497,0.002126956,0.008739326,0.001355403,0.0017282557,0.03579962],"category_scores_gemma":[0.004962393,0.0005244256,0.0007947149,0.0019092034,0.008498665,0.009448438,0.0025435113,0.0036385597,0.010403518],"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.0000067630513,0.000005116932,0.000042500564,0.00010049025,0.0000058040637,0.000039852664,0.00054730196,0.00013925873,0.00004360061,0.9640848,0.01684451,0.018139832],"study_design_scores_gemma":[0.00000449765,0.0000053013264,0.000076106815,0.00019224813,0.000004599832,0.000091758404,0.00032836752,0.0003880163,0.000097929544,0.73867065,0.26013505,0.0000054516527],"about_ca_topic_score_codex":0.0017581282,"about_ca_topic_score_gemma":0.0015533165,"teacher_disagreement_score":0.03579962,"about_ca_system_score_codex":0.0029711865,"about_ca_system_score_gemma":0.0020086274,"threshold_uncertainty_score":0.119761646},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051135686,0.021741927,0.25259036,0.009496141,0.0034457552,0.00040772787,0.0008596776,0.001719384,0.7046255],"genre_scores_gemma":[0.20946155,0.022524608,0.15650085,0.0032259326,0.001953942,0.0011014731,0.0024865014,0.00042762244,0.60231763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924016,0.00026343696,0.000061420535,0.00014658616,0.00022062681,0.000067769724],"domain_scores_gemma":[0.99947697,0.00019421594,0.000044174813,0.00011160266,0.00010046563,0.00007262589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006739037,0.000990272,0.00063733576,0.0006437335,0.0012947959,0.0047887773,0.0016933744,0.0024410668,0.050361346],"category_scores_gemma":[0.0018127426,0.00043231918,0.0006363607,0.0007700594,0.001117187,0.0030674124,0.003470681,0.0017350914,0.013208743],"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.000043823933,0.00007211515,0.00042836834,0.0004978988,0.00007986729,0.00042097043,0.00046857918,0.011410595,0.0012901002,0.72316474,0.10882555,0.1532974],"study_design_scores_gemma":[0.000025578134,0.000037293346,0.00022530007,0.00016771391,0.00001969687,0.00033376596,0.00018500452,0.019394485,0.0004351089,0.27923998,0.69991493,0.00002121764],"about_ca_topic_score_codex":0.0014965236,"about_ca_topic_score_gemma":0.0016251389,"teacher_disagreement_score":0.050361346,"about_ca_system_score_codex":0.001134398,"about_ca_system_score_gemma":0.0010384198,"threshold_uncertainty_score":0.16847551},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020695608,0.0042861383,0.15121697,0.008185439,0.0007993285,0.00011524135,0.00044728955,0.00047871997,0.8324014],"genre_scores_gemma":[0.39172524,0.01630105,0.1321516,0.0041670003,0.001475721,0.0006388452,0.0018485786,0.00084610604,0.45084584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99859005,0.00036441095,0.000092263705,0.00036646053,0.00046778715,0.0001189232],"domain_scores_gemma":[0.9987545,0.0005180172,0.000088945904,0.00035577346,0.00021077653,0.00007200731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012564535,0.00082646037,0.0005174978,0.00068920746,0.0015872628,0.005517685,0.0011667619,0.0015480084,0.03791858],"category_scores_gemma":[0.0062507275,0.00050564593,0.0007684394,0.00086791354,0.005436271,0.0075402255,0.0033327532,0.0034912622,0.009922397],"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.000010966124,0.0000039655165,0.000040612347,0.000067676374,0.0000054894003,0.00003685095,0.00021166755,0.0011421373,0.0000678939,0.9708165,0.009025689,0.018570611],"study_design_scores_gemma":[0.000009182345,0.0000092743485,0.000047400485,0.00011050706,0.0000054112274,0.00006699678,0.0001023912,0.0014189767,0.00018774756,0.80205315,0.19597964,0.000009261391],"about_ca_topic_score_codex":0.0028724158,"about_ca_topic_score_gemma":0.0028845721,"teacher_disagreement_score":0.03791858,"about_ca_system_score_codex":0.0022981633,"about_ca_system_score_gemma":0.0030733573,"threshold_uncertainty_score":0.12685025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020725362,0.012523279,0.18690711,0.028862566,0.0024239449,0.0007069309,0.002363429,0.001817301,0.7436701],"genre_scores_gemma":[0.1371561,0.025397541,0.41002238,0.0063464856,0.0010388352,0.0007713903,0.0081626875,0.0008938276,0.41021076],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99916613,0.00021894772,0.00005916673,0.00021844779,0.00024697636,0.00009020843],"domain_scores_gemma":[0.9994703,0.00024205534,0.000050865947,0.00008376744,0.00009105687,0.00006194167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007168159,0.0010353482,0.0005928224,0.0013383267,0.0014969705,0.0043279375,0.0021601748,0.0023967274,0.09282982],"category_scores_gemma":[0.0031731622,0.00042480303,0.0014252397,0.001549135,0.0007462121,0.005139416,0.0031397643,0.0019586848,0.031330436],"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.00008838457,0.00018146737,0.0013819596,0.0017316126,0.00016067507,0.0009486215,0.0012934643,0.007291307,0.0028230082,0.37388885,0.21428601,0.39592472],"study_design_scores_gemma":[0.00004960986,0.000106680716,0.000495393,0.0007907609,0.00007105268,0.0009170358,0.0028967576,0.01427131,0.0015088473,0.25849074,0.72035736,0.000044436205],"about_ca_topic_score_codex":0.0009213397,"about_ca_topic_score_gemma":0.0020669864,"teacher_disagreement_score":0.09282982,"about_ca_system_score_codex":0.0007619162,"about_ca_system_score_gemma":0.0017673352,"threshold_uncertainty_score":0.3105467},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038672048,0.028642613,0.33483666,0.011647366,0.0015381444,0.0001246782,0.0005173468,0.00056833733,0.61825764],"genre_scores_gemma":[0.39708444,0.05202508,0.19575053,0.003512845,0.0024275053,0.00074830453,0.0018436965,0.000632938,0.34597465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930537,0.00020919733,0.0000358157,0.00013551049,0.0002649632,0.000049091333],"domain_scores_gemma":[0.9992336,0.000488938,0.000046904643,0.00010382726,0.00008464757,0.000042005973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007710838,0.0010017081,0.00052139343,0.0005696456,0.0010386825,0.003836576,0.0010296985,0.0012360599,0.016146047],"category_scores_gemma":[0.003482691,0.00045642882,0.00070598634,0.0009997193,0.0029475244,0.0040355506,0.002267254,0.0026654075,0.0031574743],"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.000014679232,0.000007073955,0.00007715162,0.00017496516,0.00001333978,0.000079480975,0.0002664081,0.0106901545,0.00013488963,0.92467165,0.019546334,0.044323944],"study_design_scores_gemma":[0.0000055710875,0.000010716638,0.000063301384,0.0001666909,0.0000066488083,0.000068911715,0.00010576852,0.00876861,0.00016306851,0.82678145,0.16384915,0.000010123807],"about_ca_topic_score_codex":0.0024179157,"about_ca_topic_score_gemma":0.0023558706,"teacher_disagreement_score":0.016146047,"about_ca_system_score_codex":0.002194854,"about_ca_system_score_gemma":0.0024380474,"threshold_uncertainty_score":0.05401385},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007100873,0.03460874,0.44537506,0.042117074,0.002862431,0.00018045663,0.0008643212,0.00054305955,0.466348],"genre_scores_gemma":[0.53002137,0.04377275,0.2517181,0.010405427,0.0057707215,0.0006841307,0.0029565669,0.00043250783,0.15423836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966258,0.001423906,0.00021912437,0.00046877848,0.0010691473,0.00019329085],"domain_scores_gemma":[0.99622077,0.0027994334,0.00016717702,0.00038162823,0.00034034025,0.0000906616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029925813,0.0011463123,0.0008541193,0.0011924641,0.0019721508,0.0072163916,0.0018001753,0.002653553,0.014435459],"category_scores_gemma":[0.0109931985,0.0005639849,0.001318931,0.001278624,0.005536656,0.0101097375,0.0046640136,0.0046550925,0.002845513],"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.000015045603,0.000010858097,0.00012892632,0.00018055973,0.00003317711,0.00016249562,0.0005718924,0.0031690819,0.00011944505,0.9454634,0.018634347,0.031510685],"study_design_scores_gemma":[0.000005496484,0.000005050182,0.000046626817,0.00012804236,0.0000083793475,0.000090735724,0.00019235774,0.0037310282,0.00012874494,0.93091273,0.06474152,0.000009197087],"about_ca_topic_score_codex":0.0019765254,"about_ca_topic_score_gemma":0.001743031,"teacher_disagreement_score":0.014435459,"about_ca_system_score_codex":0.0023953654,"about_ca_system_score_gemma":0.0018377159,"threshold_uncertainty_score":0.048291445},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088147144,0.14828241,0.012222128,0.01158925,0.0031938714,0.000076066,0.0001732345,0.0002610858,0.82332045],"genre_scores_gemma":[0.056635194,0.1582038,0.020689854,0.011659143,0.0043631564,0.000504611,0.0007563119,0.00043609054,0.74675184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988906,0.00033468803,0.000052322714,0.00016192884,0.00048230708,0.00007831308],"domain_scores_gemma":[0.9992981,0.00039251984,0.000044367178,0.00010338862,0.00009912452,0.00006253118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058140885,0.00127682,0.0007905421,0.0013493192,0.0015292655,0.008335148,0.001259483,0.0027151082,0.025903262],"category_scores_gemma":[0.0018641168,0.00044804323,0.0004279091,0.0022291266,0.0047281673,0.0054585235,0.0025632225,0.004958893,0.009822446],"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.000008016145,0.00002376882,0.0001185612,0.000398859,0.000014493053,0.00008582875,0.00093683484,0.0005397216,0.00015307736,0.782412,0.13726448,0.07804441],"study_design_scores_gemma":[0.0000036591412,0.0000072501452,0.000117002935,0.0002995035,0.0000029906366,0.00010092769,0.00016850753,0.0002015775,0.00004716196,0.16223396,0.8368127,0.0000047895223],"about_ca_topic_score_codex":0.0021712915,"about_ca_topic_score_gemma":0.00242763,"teacher_disagreement_score":0.025903262,"about_ca_system_score_codex":0.0029033704,"about_ca_system_score_gemma":0.00285725,"threshold_uncertainty_score":0.08665502},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003810837,0.081088774,0.25311592,0.008176395,0.0011997588,0.00015220193,0.000624693,0.0008484824,0.650983],"genre_scores_gemma":[0.23053183,0.11994429,0.24944535,0.0031844971,0.002964866,0.00065451686,0.0030604545,0.00061311794,0.38960114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993742,0.00016531162,0.000031117997,0.00012126609,0.00026279123,0.0000453716],"domain_scores_gemma":[0.99947995,0.0003385186,0.00003271957,0.000072709605,0.00004863008,0.00002744868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080244825,0.0011723071,0.0005144069,0.000916161,0.00080482336,0.004155277,0.0014550588,0.0011038608,0.011237988],"category_scores_gemma":[0.0022848935,0.000681765,0.0009173458,0.0019903574,0.0040742997,0.0055739647,0.0015588847,0.0030765408,0.0031302597],"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.00001287018,0.000017309474,0.000113422815,0.00028254086,0.000015259571,0.00004621674,0.00040437022,0.0057308404,0.00013039394,0.88067067,0.028384073,0.084192105],"study_design_scores_gemma":[0.0000057979405,0.000009378204,0.00018808049,0.00018492423,0.000007163483,0.000079070705,0.000118559125,0.005369798,0.000113755115,0.8360426,0.1578714,0.000009498275],"about_ca_topic_score_codex":0.0047504674,"about_ca_topic_score_gemma":0.0047558635,"teacher_disagreement_score":0.011237988,"about_ca_system_score_codex":0.0024824843,"about_ca_system_score_gemma":0.0023333114,"threshold_uncertainty_score":0.037594795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000740462,0.0078078858,0.0029624384,0.0097293435,0.033833392,0.00020435931,0.0032369515,0.00086218456,0.9406229],"genre_scores_gemma":[0.0022837003,0.0030777443,0.0011166253,0.0017466667,0.0041010496,0.00007310462,0.0023397927,0.0004138804,0.98484737],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994097,0.000060068363,0.000033111835,0.00010826204,0.00034001397,0.000048860766],"domain_scores_gemma":[0.99841225,0.00026833135,0.00006454469,0.00016220857,0.0007989304,0.00029367526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061783247,0.0009027007,0.0007249401,0.002026929,0.0019335322,0.0046141273,0.0012230712,0.0013584088,0.48940378],"category_scores_gemma":[0.0036677802,0.00033344753,0.0005218688,0.0017499344,0.0006671816,0.0036958999,0.002062661,0.0031309624,0.33946788],"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.00001575658,0.000023133096,0.0000641468,0.00010566996,0.0000013860109,0.00004461267,0.00011643623,0.000060316284,0.00014676082,0.010562458,0.9321538,0.056705527],"study_design_scores_gemma":[0.0000012163011,0.0000058317405,0.00009202592,0.00006991409,5.6256346e-7,0.000045994246,0.000040796393,0.000014838157,0.000035907364,0.0016464123,0.9980446,0.0000018346151],"about_ca_topic_score_codex":0.001953202,"about_ca_topic_score_gemma":0.0031930336,"teacher_disagreement_score":0.48940378,"about_ca_system_score_codex":0.0017597391,"about_ca_system_score_gemma":0.0015527775,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00906457,0.012299771,0.56421965,0.010560021,0.0006645649,0.00012793264,0.00036701284,0.0004206102,0.40227586],"genre_scores_gemma":[0.61923987,0.019463135,0.22649051,0.0044122366,0.0017465027,0.00071577047,0.0012035439,0.0004875875,0.12624082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987404,0.0003886297,0.00008209726,0.00021817278,0.00044650774,0.00012422234],"domain_scores_gemma":[0.9984977,0.0009129805,0.00007701249,0.0002195818,0.0002245133,0.0000681885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011787338,0.0005663567,0.00045912643,0.0010683516,0.0015373182,0.0035115469,0.0010450119,0.0011691109,0.010371514],"category_scores_gemma":[0.0033368769,0.0003645386,0.0006436405,0.002675724,0.0060637663,0.0065191532,0.0018913948,0.002929526,0.0016046262],"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.0000014959217,0.0000018218418,0.000014402014,0.000026214226,0.0000016198433,0.000008342436,0.00010085606,0.00054822274,0.00008310217,0.9931224,0.0013513316,0.004740287],"study_design_scores_gemma":[0.0000033735685,0.0000070537944,0.00004550875,0.00004201308,0.000004097319,0.000034068842,0.00007112553,0.003091629,0.00024145612,0.937914,0.058540054,0.0000056466743],"about_ca_topic_score_codex":0.0041671344,"about_ca_topic_score_gemma":0.0037661025,"teacher_disagreement_score":0.010371514,"about_ca_system_score_codex":0.0027033517,"about_ca_system_score_gemma":0.0018024327,"threshold_uncertainty_score":0.03469616},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005481375,0.0882908,0.2515382,0.024542505,0.014956005,0.0006816377,0.015533679,0.0028644225,0.5961115],"genre_scores_gemma":[0.16953646,0.14218,0.3383564,0.027336268,0.031604867,0.006219723,0.036004297,0.0047781696,0.24398378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99659294,0.0012048444,0.0004077042,0.00062117155,0.00089623575,0.00027707036],"domain_scores_gemma":[0.9963959,0.0015151217,0.0006231008,0.00053701433,0.00074481865,0.00018401408],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0037898927,0.0039921133,0.0025401576,0.0052770097,0.003601862,0.0073174913,0.0047035413,0.0033348382,0.052044187],"category_scores_gemma":[0.009152996,0.0014317326,0.001741835,0.008398268,0.0048169703,0.008154825,0.004039549,0.009716314,0.066664524],"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.00003575872,0.000072084855,0.00022270225,0.00075305655,0.000018144812,0.00028357827,0.00072904216,0.0008005656,0.0007740804,0.7989088,0.17066042,0.02674172],"study_design_scores_gemma":[0.000011642869,0.00004250118,0.00018217062,0.00021176042,0.00001588262,0.0004415407,0.00019789638,0.00094208005,0.00017352367,0.35840055,0.639356,0.000024383575],"about_ca_topic_score_codex":0.0024059583,"about_ca_topic_score_gemma":0.0014750109,"teacher_disagreement_score":0.9479558,"about_ca_system_score_codex":0.002592774,"about_ca_system_score_gemma":0.002165869,"threshold_uncertainty_score":0.17410511},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00092650304,0.00082368904,0.9951249,0.00029877483,0.0000522208,0.000040971496,0.00005335955,0.00032651794,0.002353125],"genre_scores_gemma":[0.09287531,0.0037006608,0.8937505,0.0005039502,0.0004238855,0.00036437565,0.0006571284,0.0005270181,0.00719718],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99597037,0.00096282613,0.00025373974,0.0011925797,0.0014127046,0.0002078272],"domain_scores_gemma":[0.9864427,0.009035998,0.0006533447,0.0024385925,0.001113574,0.00031576847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037934803,0.001860264,0.0012159634,0.0017107731,0.0008498038,0.0024332288,0.004096177,0.0022662233,0.005946157],"category_scores_gemma":[0.018723993,0.0013418461,0.00306868,0.002106124,0.0022633926,0.0042103827,0.0033964927,0.005285326,0.0022094408],"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.00014538552,0.0003396958,0.0026992946,0.0013120491,0.00036360422,0.00020571175,0.00085881795,0.25458407,0.0035097627,0.2259554,0.008314507,0.5017117],"study_design_scores_gemma":[0.000033430806,0.00009477189,0.0010517564,0.00029360474,0.00009216651,0.00019013697,0.00009750426,0.69086844,0.002920008,0.27489805,0.029393403,0.00006673162],"about_ca_topic_score_codex":0.007496458,"about_ca_topic_score_gemma":0.0062392517,"teacher_disagreement_score":0.007496458,"about_ca_system_score_codex":0.0017039444,"about_ca_system_score_gemma":0.0023333402,"threshold_uncertainty_score":0.020062089},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073117875,0.00094148493,0.8976661,0.0005992952,0.00013019699,0.00046915747,0.0007344725,0.008077572,0.018263768],"genre_scores_gemma":[0.4625626,0.00047930624,0.5296194,0.00019441832,0.00003768159,0.00045086554,0.0014344844,0.0007025884,0.004518661],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990701,0.00028270195,0.000053731244,0.0002058916,0.0002505814,0.00013702709],"domain_scores_gemma":[0.997924,0.0014547051,0.00013251432,0.00023530617,0.00018668151,0.000066832916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010053847,0.0014521844,0.00091952394,0.0009578682,0.0005602786,0.0012254559,0.0013453555,0.0010052981,0.005623755],"category_scores_gemma":[0.0049698954,0.0006610788,0.0012713718,0.0007801218,0.0012252155,0.0013442042,0.0017188584,0.0017910268,0.0009897085],"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.0001665566,0.00009651597,0.00060010114,0.00021858026,0.000041331976,0.00012895449,0.00010200818,0.8947987,0.0024748226,0.014508793,0.002662139,0.084201545],"study_design_scores_gemma":[0.0000446854,0.00004544904,0.00009248528,0.000020670073,0.000015500924,0.000019832712,0.00003418521,0.9853087,0.0014401993,0.011521203,0.0014482351,0.000008758305],"about_ca_topic_score_codex":0.013062286,"about_ca_topic_score_gemma":0.017932126,"teacher_disagreement_score":0.013062286,"about_ca_system_score_codex":0.0013539677,"about_ca_system_score_gemma":0.0034317838,"threshold_uncertainty_score":0.025972545},"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016313669,0.010066177,0.0071341014,0.026222538,0.08887787,0.00071787165,0.02995426,0.0032852036,0.8321107],"genre_scores_gemma":[0.007621603,0.0062930896,0.0033725642,0.006518919,0.011082706,0.00044747978,0.024499364,0.0015101485,0.9386542],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99848455,0.00020711502,0.00013382085,0.00033763025,0.0006711567,0.00016571603],"domain_scores_gemma":[0.9954299,0.0006210309,0.00018755038,0.0004886,0.0025537068,0.0007191712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014969591,0.0012708756,0.0010357146,0.0028581182,0.002546408,0.0054701436,0.0020689121,0.0019209418,0.6402698],"category_scores_gemma":[0.0097494405,0.0004527904,0.0008361425,0.0028914406,0.0007201257,0.0044945506,0.0030607164,0.0029221396,0.48330283],"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.000031675838,0.000017974195,0.00011978633,0.0001455601,0.000002830772,0.000046100686,0.000079307385,0.000055945016,0.00008690448,0.004041821,0.9573107,0.03806141],"study_design_scores_gemma":[0.000004205144,0.000012603306,0.00020933295,0.00012413382,0.0000016950585,0.000052127474,0.00008487754,0.000024742149,0.000056791974,0.0014018645,0.99802303,0.000004744606],"about_ca_topic_score_codex":0.0040032924,"about_ca_topic_score_gemma":0.0040511717,"teacher_disagreement_score":0.6402698,"about_ca_system_score_codex":0.0024547859,"about_ca_system_score_gemma":0.0031351366,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018232737,0.010099239,0.011089079,0.042637274,0.1867549,0.0003718441,0.006992534,0.001328829,0.738903],"genre_scores_gemma":[0.007696436,0.0022294554,0.0016076079,0.0060129752,0.016907316,0.00012847115,0.002674849,0.0003465107,0.9623964],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99953854,0.0000641404,0.000025574433,0.000087627566,0.00024501455,0.00003911345],"domain_scores_gemma":[0.9969593,0.00046147767,0.000109572466,0.0003024585,0.0018227609,0.00034445428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085366576,0.00073134823,0.00048849534,0.0026847457,0.0026383821,0.002378342,0.0009898626,0.0010357852,0.37783274],"category_scores_gemma":[0.0048019094,0.0002502433,0.00045155935,0.0018207664,0.00060788123,0.0023367184,0.0014201988,0.0024279624,0.19272791],"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.000026749225,0.00001779108,0.000099475605,0.00006557784,0.0000019423699,0.000027339256,0.000057213336,0.00003455551,0.00017589585,0.012677233,0.94616723,0.04064896],"study_design_scores_gemma":[0.000004003304,0.000009853017,0.00036450784,0.00004722368,0.0000023384093,0.00002441042,0.000045658755,0.000058055768,0.000109342014,0.004251244,0.9950799,0.0000035300814],"about_ca_topic_score_codex":0.0055895247,"about_ca_topic_score_gemma":0.009754653,"teacher_disagreement_score":0.37783274,"about_ca_system_score_codex":0.0018630781,"about_ca_system_score_gemma":0.0010818688,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073117875,0.00094148493,0.8976661,0.0005992952,0.00013019699,0.00046915747,0.0007344725,0.008077572,0.018263768],"genre_scores_gemma":[0.4625626,0.00047930624,0.5296194,0.00019441832,0.00003768159,0.00045086554,0.0014344844,0.0007025884,0.004518661],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990701,0.00028270195,0.000053731244,0.0002058916,0.0002505814,0.00013702709],"domain_scores_gemma":[0.997924,0.0014547051,0.00013251432,0.00023530617,0.00018668151,0.000066832916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010053847,0.0014521844,0.00091952394,0.0009578682,0.0005602786,0.0012254559,0.0013453555,0.0010052981,0.005623755],"category_scores_gemma":[0.0049698954,0.0006610788,0.0012713718,0.0007801218,0.0012252155,0.0013442042,0.0017188584,0.0017910268,0.0009897085],"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.0001665566,0.00009651597,0.00060010114,0.00021858026,0.000041331976,0.00012895449,0.00010200818,0.8947987,0.0024748226,0.014508793,0.002662139,0.084201545],"study_design_scores_gemma":[0.0000446854,0.00004544904,0.00009248528,0.000020670073,0.000015500924,0.000019832712,0.00003418521,0.9853087,0.0014401993,0.011521203,0.0014482351,0.000008758305],"about_ca_topic_score_codex":0.013062286,"about_ca_topic_score_gemma":0.017932126,"teacher_disagreement_score":0.013062286,"about_ca_system_score_codex":0.0013539677,"about_ca_system_score_gemma":0.0034317838,"threshold_uncertainty_score":0.025972545},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004801934,0.070377894,0.63472646,0.015805872,0.027542494,0.0014052467,0.0038946776,0.010223021,0.2312224],"genre_scores_gemma":[0.03387713,0.0843806,0.5480745,0.0073587494,0.008561221,0.0023645042,0.01604639,0.0063923923,0.29294455],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99493825,0.0018336354,0.00071521814,0.000658827,0.0015864767,0.00026758446],"domain_scores_gemma":[0.9926278,0.0035227046,0.0003087401,0.0016155888,0.0013041567,0.00062105706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056647332,0.0019960543,0.0019618464,0.0015502719,0.0011934072,0.007389792,0.0025770552,0.0020631223,0.078175835],"category_scores_gemma":[0.009989289,0.0017369319,0.0020428668,0.0016880609,0.0025756252,0.0052313227,0.0033371241,0.0077145686,0.030417658],"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.0002813782,0.0003056944,0.0010440296,0.0015460866,0.00020497054,0.00036253085,0.0013324624,0.0035698286,0.0038536775,0.08880272,0.4597145,0.43898216],"study_design_scores_gemma":[0.00003465268,0.00005637063,0.00031746927,0.00040557003,0.000042700784,0.00026527952,0.0001232888,0.0022089134,0.00063711416,0.022076953,0.9738042,0.000027461743],"about_ca_topic_score_codex":0.005109665,"about_ca_topic_score_gemma":0.0048904503,"teacher_disagreement_score":0.078175835,"about_ca_system_score_codex":0.0015722585,"about_ca_system_score_gemma":0.005501768,"threshold_uncertainty_score":0.26152426},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044908198,0.5613049,0.017448097,0.033635836,0.009164242,0.00004198838,0.00009994714,0.00018727065,0.3736268],"genre_scores_gemma":[0.122533865,0.57457745,0.035851605,0.01106679,0.021338124,0.00021917198,0.00044801141,0.00031803566,0.23364693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987049,0.00029443475,0.00011442608,0.000150163,0.00064555026,0.00009058238],"domain_scores_gemma":[0.99694747,0.0014780452,0.00019271682,0.00032961738,0.00060889154,0.00044326964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020233854,0.0007560347,0.000727098,0.0033422748,0.0009541969,0.007337056,0.0011314324,0.0015214954,0.014865891],"category_scores_gemma":[0.0033654782,0.0003770992,0.00055149297,0.007070973,0.0030377035,0.00929746,0.0033315592,0.0037849,0.0045875534],"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.00003231085,0.000092885675,0.0005566228,0.0014126352,0.000035597433,0.000089449015,0.0008136507,0.00060204644,0.00073845993,0.48082927,0.09688542,0.41791165],"study_design_scores_gemma":[0.000008156528,0.000035210454,0.0012092934,0.00081261666,0.000013698228,0.0003577277,0.00056296634,0.0011409466,0.0001993937,0.2605733,0.7350748,0.000011808724],"about_ca_topic_score_codex":0.00045501455,"about_ca_topic_score_gemma":0.0014473909,"teacher_disagreement_score":0.014865891,"about_ca_system_score_codex":0.001984963,"about_ca_system_score_gemma":0.0025421493,"threshold_uncertainty_score":0.049731433},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50755584,0.0006372207,0.45270422,0.0037132527,0.00020262026,0.00078379485,0.0008520342,0.0016905107,0.031860467],"genre_scores_gemma":[0.75709915,0.00048562977,0.2353765,0.00042470152,0.00005577953,0.0006713897,0.00087566633,0.00018938951,0.0048217513],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99589396,0.0018130934,0.00022276338,0.00064916036,0.0011847307,0.00023636274],"domain_scores_gemma":[0.97805035,0.011327137,0.002986135,0.0020471876,0.004189003,0.0014000452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005227701,0.0006775729,0.00055707135,0.00388403,0.001022135,0.0050488403,0.0013157498,0.0012818292,0.0041556796],"category_scores_gemma":[0.033174854,0.00032168638,0.00043991063,0.0031198869,0.002448449,0.006391215,0.005604458,0.0022490998,0.0016562524],"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.00036711333,0.00067778025,0.15450571,0.001469682,0.000091814836,0.00032677187,0.027517332,0.005868265,0.018624423,0.03037704,0.012149612,0.7480244],"study_design_scores_gemma":[0.00012100324,0.0012514673,0.37919623,0.0023408856,0.00020055391,0.0010816111,0.08532582,0.14107518,0.058437616,0.19837606,0.13229176,0.00030180792],"about_ca_topic_score_codex":0.0013704108,"about_ca_topic_score_gemma":0.0012071443,"teacher_disagreement_score":0.005227701,"about_ca_system_score_codex":0.001225871,"about_ca_system_score_gemma":0.0029340491,"threshold_uncertainty_score":0.027647078},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010559879,0.0051961336,0.4553578,0.003592076,0.0011565395,0.00017905311,0.0037966885,0.0053452454,0.5243205],"genre_scores_gemma":[0.05031306,0.012537965,0.28199095,0.0027406006,0.0009767449,0.0006823153,0.020795815,0.0033800213,0.62658244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994542,0.00011082039,0.00006197908,0.00014218251,0.00018773643,0.000043026255],"domain_scores_gemma":[0.9995957,0.00014066018,0.000021539036,0.00010790799,0.000111398345,0.000022731234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005028771,0.0011777141,0.0007461033,0.0021299974,0.00078407023,0.0064403205,0.0021260595,0.001142177,0.06810549],"category_scores_gemma":[0.0015766699,0.00055670383,0.00079355255,0.003662419,0.0017173453,0.009709265,0.0019777787,0.0025665553,0.04779774],"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.000014243763,0.000021171152,0.000028896278,0.00035738095,0.000011954368,0.00006395324,0.00031706903,0.0010003512,0.0008340653,0.69901174,0.118312664,0.18002647],"study_design_scores_gemma":[0.000005583888,0.00000537668,0.000037738595,0.00013677707,0.000011174502,0.00011611243,0.000082550294,0.0017538993,0.00058365625,0.26665866,0.73059535,0.000013180653],"about_ca_topic_score_codex":0.0027510761,"about_ca_topic_score_gemma":0.002393929,"teacher_disagreement_score":0.06810549,"about_ca_system_score_codex":0.0013067712,"about_ca_system_score_gemma":0.0014074423,"threshold_uncertainty_score":0.22783554},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007989117,0.020064643,0.94852865,0.0017497437,0.00030984878,0.000036783684,0.00020353701,0.0001674523,0.020950159],"genre_scores_gemma":[0.64490783,0.025840705,0.3126074,0.00033058957,0.00081875327,0.0002479483,0.000663261,0.00013035297,0.014453075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733967,0.00084348535,0.00020736246,0.00024235316,0.0012147417,0.00015237051],"domain_scores_gemma":[0.994785,0.003946163,0.00026100533,0.0004294318,0.0004748225,0.000103549624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002586958,0.0009691885,0.0015274042,0.0018657439,0.0005212633,0.004366711,0.0016671662,0.00127172,0.0028137525],"category_scores_gemma":[0.01028269,0.0009887227,0.0012715892,0.0036538783,0.00227125,0.008197433,0.002304201,0.0026195913,0.00060105004],"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.0000670573,0.000049932274,0.00035181647,0.0004256801,0.00018068627,0.00011839709,0.00028083785,0.16996656,0.0004830101,0.680092,0.0039631235,0.144021],"study_design_scores_gemma":[0.000003795851,0.000012865873,0.00009890319,0.00006866837,0.000027320824,0.0000332696,0.000032456042,0.10560254,0.00028756337,0.8882409,0.005575325,0.000016378985],"about_ca_topic_score_codex":0.0032070011,"about_ca_topic_score_gemma":0.0023524126,"teacher_disagreement_score":0.004366711,"about_ca_system_score_codex":0.002064452,"about_ca_system_score_gemma":0.0013586509,"threshold_uncertainty_score":0.014978707},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065943575,0.0017153502,0.16173106,0.0009393491,0.0006098516,0.00021852866,0.0199026,0.15126902,0.66295475],"genre_scores_gemma":[0.00912075,0.0025867892,0.14786033,0.0010343303,0.00023051092,0.0007887456,0.05329742,0.071570106,0.7135111],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99907327,0.00016097372,0.000062948704,0.00017265743,0.0004135275,0.00011653554],"domain_scores_gemma":[0.99900216,0.00027266756,0.000036116227,0.0003381018,0.00025078622,0.00010020754],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00092735625,0.0014721819,0.0010823837,0.0027170882,0.0010249902,0.004356618,0.0028118,0.0012678414,0.46520716],"category_scores_gemma":[0.0034337007,0.0011169742,0.0014727511,0.0024555402,0.00046786715,0.0053098975,0.00452179,0.0021592395,0.41279855],"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.00008619697,0.000039850627,0.00008900315,0.0005319324,0.000017745746,0.000057139598,0.00015719589,0.0005202211,0.0012523268,0.04912522,0.71351874,0.2346045],"study_design_scores_gemma":[0.000014442938,0.0000054962275,0.00007276886,0.000087853725,0.0000071030554,0.00008033912,0.000029830835,0.00077028194,0.00060052465,0.01563774,0.9826774,0.000016216209],"about_ca_topic_score_codex":0.0016842682,"about_ca_topic_score_gemma":0.0029260877,"teacher_disagreement_score":0.46520716,"about_ca_system_score_codex":0.000804053,"about_ca_system_score_gemma":0.0013441811,"threshold_uncertainty_score":0.7628171},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016332213,0.0032378114,0.2776635,0.002026874,0.0020625207,0.00059575075,0.0021934763,0.0025583243,0.6933295],"genre_scores_gemma":[0.3287965,0.003371222,0.13410585,0.0015448628,0.0011839181,0.0005270999,0.0072384723,0.0011232884,0.5221088],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985436,0.00017625348,0.00007818434,0.00040770712,0.0006814906,0.00011279081],"domain_scores_gemma":[0.9987154,0.00021012305,0.000071687115,0.00047297167,0.00045030197,0.00007952306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006617608,0.000543928,0.00064653874,0.0027087296,0.0011412145,0.0032049485,0.0015938445,0.0011944483,0.07580498],"category_scores_gemma":[0.0053419233,0.00025355132,0.0006388616,0.0029945937,0.0011511961,0.004125594,0.0022502546,0.0012065547,0.028628089],"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.00009841119,0.000085670334,0.0007277614,0.00026298632,0.000041118325,0.00011877405,0.00027578947,0.0024000055,0.004381893,0.42022932,0.07446332,0.49691495],"study_design_scores_gemma":[0.000040847215,0.00014795722,0.0016962652,0.000106771826,0.000046213623,0.0012295381,0.0004568683,0.016881688,0.007986144,0.31304964,0.65830433,0.000053753876],"about_ca_topic_score_codex":0.0014474468,"about_ca_topic_score_gemma":0.0012450977,"teacher_disagreement_score":0.07580498,"about_ca_system_score_codex":0.0008670461,"about_ca_system_score_gemma":0.0010457733,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059366613,0.013432794,0.6207676,0.015213444,0.0005838301,0.00012741974,0.0004460979,0.00040065564,0.34309146],"genre_scores_gemma":[0.39114425,0.016704576,0.49194306,0.003542633,0.001078611,0.00062383554,0.0013032078,0.00029105588,0.09336889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917126,0.00031837553,0.000042778316,0.00014974522,0.00025411084,0.00006376894],"domain_scores_gemma":[0.99896276,0.00065774866,0.00004036208,0.00018099694,0.000106870015,0.000051276842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011757313,0.0007308947,0.000592693,0.001585907,0.001293981,0.0066046813,0.0022379202,0.0018904309,0.01172487],"category_scores_gemma":[0.002375807,0.00040971136,0.0013654486,0.0020900609,0.0073576053,0.008357533,0.0022623718,0.003186499,0.002742444],"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.0000023339699,0.0000050824697,0.000030050773,0.000057800993,0.000006489373,0.000021918204,0.00022109238,0.0010117068,0.00007003365,0.98588264,0.0026143,0.010076636],"study_design_scores_gemma":[0.0000031348743,0.0000032950911,0.000036002937,0.000046763624,0.0000037748873,0.000042908374,0.00007615799,0.0038018376,0.00006843784,0.96368355,0.032230128,0.0000039085944],"about_ca_topic_score_codex":0.0033613835,"about_ca_topic_score_gemma":0.0022770304,"teacher_disagreement_score":0.01172487,"about_ca_system_score_codex":0.0026190868,"about_ca_system_score_gemma":0.0019107242,"threshold_uncertainty_score":0.03922355},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006359447,0.0040480928,0.5105227,0.0014345509,0.0007516254,0.00021287505,0.00021958131,0.0032764466,0.4731746],"genre_scores_gemma":[0.13146938,0.0073654023,0.5662815,0.00096064736,0.00022189267,0.0005015992,0.00083080825,0.0011731504,0.2911956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989172,0.00039125074,0.000066988425,0.00015099402,0.00038917016,0.00008430854],"domain_scores_gemma":[0.9993807,0.00018119082,0.000027829661,0.00019730865,0.00016522885,0.000047613048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013650658,0.0006928206,0.00037409615,0.000877103,0.0011003992,0.0048342086,0.0020777439,0.0016845969,0.026094038],"category_scores_gemma":[0.0020877258,0.0005495245,0.0007399808,0.0008401882,0.0012699745,0.0049669277,0.0022575797,0.0016984394,0.010374064],"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.000017385979,0.000025286685,0.00006265286,0.0001542792,0.0000105094605,0.00010007585,0.0005553339,0.0026462805,0.0012899747,0.92201596,0.009163434,0.06395871],"study_design_scores_gemma":[0.0000146937455,0.000036048517,0.00006597978,0.00015114088,0.00001478211,0.00032899374,0.00025024396,0.017016517,0.0021735518,0.17772217,0.8022021,0.000023794551],"about_ca_topic_score_codex":0.0010429691,"about_ca_topic_score_gemma":0.001805084,"teacher_disagreement_score":0.026094038,"about_ca_system_score_codex":0.0015033818,"about_ca_system_score_gemma":0.0009992388,"threshold_uncertainty_score":0.08729327},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005793226,0.015730834,0.8744359,0.0049310257,0.00046788593,0.00014575187,0.0007514145,0.0018111446,0.095932946],"genre_scores_gemma":[0.21321979,0.022043783,0.6650792,0.002281481,0.002010863,0.0004017921,0.0054221735,0.0007554062,0.08878546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974867,0.0007628505,0.00024642443,0.00043887965,0.0009046167,0.00016054117],"domain_scores_gemma":[0.9970989,0.001930583,0.000074598734,0.00047651827,0.000346645,0.0000727835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023372164,0.0008594635,0.0013515912,0.0023696565,0.0011802606,0.0067747445,0.0023479515,0.001312934,0.013664153],"category_scores_gemma":[0.00798543,0.0008769037,0.0012100108,0.004044536,0.002481893,0.00844621,0.0027931014,0.0027274184,0.005830984],"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.00006947166,0.00007937121,0.00027896016,0.0006478451,0.000045229663,0.00010000581,0.0007159874,0.006364912,0.001549899,0.7152876,0.039284673,0.23557594],"study_design_scores_gemma":[0.00001746374,0.000020728581,0.00020714918,0.0001527163,0.000039221388,0.0002425795,0.00035168757,0.044256847,0.0022240465,0.8132917,0.13917162,0.000024173874],"about_ca_topic_score_codex":0.0024481951,"about_ca_topic_score_gemma":0.0018009507,"teacher_disagreement_score":0.013664153,"about_ca_system_score_codex":0.0014738651,"about_ca_system_score_gemma":0.0011978232,"threshold_uncertainty_score":0.04571116},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007063182,0.001567758,0.17829758,0.0008395683,0.0005209305,0.00022386298,0.01808591,0.1525197,0.6472384],"genre_scores_gemma":[0.008836067,0.0023054392,0.15217271,0.0009422455,0.00018409359,0.0007539873,0.045862615,0.066691555,0.72225124],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99910444,0.00015310112,0.00006134615,0.00016545024,0.00040240368,0.00011314944],"domain_scores_gemma":[0.9990746,0.00025483078,0.000033833127,0.00030556548,0.00024035948,0.000090806054],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009108437,0.0014337383,0.0010828612,0.0026305642,0.0010031807,0.0040696952,0.002775366,0.001197846,0.43327063],"category_scores_gemma":[0.003146808,0.0011607684,0.0014374924,0.0023760262,0.0004675488,0.0051630265,0.004398655,0.002072184,0.3761848],"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.000093299495,0.0000407892,0.000097081196,0.00051000854,0.000018700302,0.000060977534,0.00017406853,0.00055990164,0.0014680654,0.04815782,0.68885547,0.25996387],"study_design_scores_gemma":[0.0000149061,0.000005770274,0.000083058796,0.000087327484,0.000007570667,0.000087511406,0.000032582455,0.0008465859,0.00071358995,0.014321017,0.98378223,0.000017911936],"about_ca_topic_score_codex":0.001970133,"about_ca_topic_score_gemma":0.0033895322,"teacher_disagreement_score":0.43327063,"about_ca_system_score_codex":0.00082029426,"about_ca_system_score_gemma":0.001363787,"threshold_uncertainty_score":0.80837065},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005375808,0.09256239,0.028032186,0.057018533,0.7729594,0.0003002959,0.00083081296,0.0007009012,0.047057867],"genre_scores_gemma":[0.0029797726,0.07378959,0.0122629,0.02691481,0.795078,0.00025593198,0.0017094977,0.000715741,0.08629376],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99696034,0.0006934148,0.000506628,0.0005675915,0.0010949877,0.00017703987],"domain_scores_gemma":[0.9824823,0.010467249,0.00070985616,0.0009547482,0.0035631876,0.0018226494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037032412,0.001987707,0.0027065137,0.005889125,0.0013727753,0.007413923,0.0023283914,0.0039984887,0.06423379],"category_scores_gemma":[0.013105227,0.00080581824,0.0028446515,0.0046522142,0.0017758919,0.0056769582,0.0028799728,0.0068266666,0.028284317],"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.00002531418,0.00005966472,0.00011116773,0.00041198859,0.000029386312,0.00009400562,0.00005788492,0.00026342133,0.00021936919,0.0030494225,0.9310034,0.06467496],"study_design_scores_gemma":[0.0000130116805,0.000040405197,0.00032677638,0.000344706,0.000017873239,0.0003387722,0.000048862556,0.00028557258,0.00007330117,0.00732691,0.9911675,0.000016195707],"about_ca_topic_score_codex":0.0007878359,"about_ca_topic_score_gemma":0.001456339,"teacher_disagreement_score":0.06423379,"about_ca_system_score_codex":0.001520111,"about_ca_system_score_gemma":0.0014696465,"threshold_uncertainty_score":0.21488339},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016432849,0.10894563,0.005532323,0.043521035,0.151034,0.0007211526,0.012765357,0.0011091549,0.6747281],"genre_scores_gemma":[0.015031185,0.11065349,0.0054595605,0.015214511,0.04591165,0.0005265398,0.026195167,0.00063822,0.78036976],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967644,0.00041739788,0.00028561903,0.0004582145,0.001813905,0.00026030347],"domain_scores_gemma":[0.99222153,0.0006693507,0.0005166536,0.0011491011,0.004049317,0.0013941262],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0032541675,0.0012023195,0.001355667,0.0044806655,0.0014073317,0.00638833,0.0023058963,0.0030140348,0.39694634],"category_scores_gemma":[0.013580827,0.00045194026,0.0011776165,0.0049355654,0.00088525604,0.0030632946,0.0023028455,0.0026227105,0.32678342],"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.00013997834,0.000057759127,0.00024791944,0.0011346384,0.000046242436,0.00010760111,0.000041447383,0.00008721402,0.00067426974,0.011681182,0.8596203,0.12616155],"study_design_scores_gemma":[0.000017510489,0.00002164875,0.0002939086,0.0002720887,0.000011799668,0.0000966248,0.000021900763,0.000021465883,0.00019816558,0.0030398066,0.99600035,0.0000048063825],"about_ca_topic_score_codex":0.0012690738,"about_ca_topic_score_gemma":0.0016108804,"teacher_disagreement_score":0.39694634,"about_ca_system_score_codex":0.0024078314,"about_ca_system_score_gemma":0.00511037,"threshold_uncertainty_score":0.8601829},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003669545,0.00005775499,0.9960724,0.000048040198,0.000018621213,0.00003573645,0.00010097454,0.0025193898,0.00078025734],"genre_scores_gemma":[0.06212813,0.00034970263,0.92875737,0.00010738178,0.000084367995,0.0003074001,0.0010282978,0.0007544678,0.0064829295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987539,0.00028383738,0.00008607529,0.00037691634,0.0003886452,0.00011066515],"domain_scores_gemma":[0.9983273,0.000667535,0.000091667396,0.00056787435,0.00023461551,0.00011101302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002066768,0.001289259,0.0011894369,0.0012372661,0.0008665803,0.0026453226,0.0049282317,0.0015184147,0.015365558],"category_scores_gemma":[0.00612861,0.00095768535,0.0024871188,0.0013997935,0.0012206725,0.0036564504,0.0034552421,0.0025223,0.006795462],"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.00043818745,0.00025301566,0.00197574,0.00044556058,0.00021315546,0.00035806268,0.000296854,0.16675456,0.007347849,0.31653064,0.018404087,0.4869823],"study_design_scores_gemma":[0.00003733557,0.00004963984,0.00022691484,0.00003092554,0.000041372336,0.000113211376,0.000025240019,0.86944854,0.0026348755,0.10676827,0.020601045,0.000022660462],"about_ca_topic_score_codex":0.009060391,"about_ca_topic_score_gemma":0.012625168,"teacher_disagreement_score":0.015365558,"about_ca_system_score_codex":0.0010219266,"about_ca_system_score_gemma":0.0022311935,"threshold_uncertainty_score":0.051402926},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036082582,0.0006164998,0.99212074,0.00023350715,0.0000375731,0.000054095,0.00004790522,0.00013309304,0.0031482517],"genre_scores_gemma":[0.22944148,0.0009974256,0.7631948,0.0004403705,0.00022068444,0.00064602925,0.00042104046,0.00041862234,0.0042196317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9892588,0.0073274085,0.0002813715,0.00094436825,0.0018303461,0.00035765313],"domain_scores_gemma":[0.9558523,0.038317468,0.0006351685,0.0033719575,0.001317363,0.0005057313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010913655,0.0012117698,0.0025871866,0.0012495178,0.000870129,0.0021163416,0.0033554204,0.0018619382,0.004617512],"category_scores_gemma":[0.05285466,0.0018506445,0.001057229,0.003290098,0.0032241251,0.004625163,0.0039772857,0.0047904155,0.00061634975],"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.00040120748,0.00013298132,0.0007636952,0.0003982265,0.00008616877,0.000071948794,0.00015560398,0.45493153,0.0010383223,0.41926345,0.0052467263,0.11751009],"study_design_scores_gemma":[0.000035502388,0.000036636586,0.00010231188,0.000033392716,0.000011004683,0.000026459556,0.000019452533,0.8060454,0.00040986817,0.19182438,0.0014483288,0.0000072974203],"about_ca_topic_score_codex":0.0033091356,"about_ca_topic_score_gemma":0.003604137,"teacher_disagreement_score":0.010913655,"about_ca_system_score_codex":0.0023570848,"about_ca_system_score_gemma":0.0015793211,"threshold_uncertainty_score":0.05771762},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051720976,0.027696067,0.08942551,0.005749464,0.0025733148,0.000027718308,0.00024455035,0.00042338128,0.8686878],"genre_scores_gemma":[0.361459,0.021700295,0.0465364,0.002953867,0.005467183,0.0002227424,0.00056226354,0.00091186084,0.56018645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994869,0.00015180241,0.00002126172,0.00009362234,0.00020186086,0.0000445591],"domain_scores_gemma":[0.999148,0.0005373767,0.000034537992,0.00009905918,0.00011465975,0.000066270295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006621775,0.00101858,0.0007465507,0.0014075073,0.0016895304,0.005307078,0.00083420076,0.0008563869,0.020904556],"category_scores_gemma":[0.0025146573,0.0007316383,0.00046336796,0.0020685291,0.00494531,0.008265494,0.0016854393,0.004990396,0.0053945086],"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.000007669535,0.0000066286116,0.000027127251,0.000041278603,0.0000014728148,0.000010584151,0.0001325295,0.0002392366,0.00010803918,0.9726566,0.013652381,0.013116438],"study_design_scores_gemma":[0.0000022069914,0.0000035644198,0.000043978944,0.00003365634,0.0000019887914,0.00004050796,0.000043489457,0.0004400166,0.00007464244,0.9379161,0.061395224,0.000004591517],"about_ca_topic_score_codex":0.0007770672,"about_ca_topic_score_gemma":0.0012932362,"teacher_disagreement_score":0.020904556,"about_ca_system_score_codex":0.0023175583,"about_ca_system_score_gemma":0.0006645506,"threshold_uncertainty_score":0.06993276},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006714311,0.15371361,0.13732766,0.085499555,0.16743018,0.00036639997,0.0025651273,0.0018033343,0.44457978],"genre_scores_gemma":[0.10842894,0.09941626,0.07913918,0.007113542,0.06922579,0.0005064233,0.0060701086,0.00174971,0.62835014],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99629104,0.0012000296,0.00021193866,0.00043920384,0.0015775927,0.0002803319],"domain_scores_gemma":[0.9943013,0.0016113701,0.00020146594,0.0008698665,0.002072593,0.00094338413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063939258,0.0011730783,0.0018574011,0.0021635692,0.0016382344,0.009958608,0.0019871935,0.0021563445,0.057848785],"category_scores_gemma":[0.011530372,0.0004520077,0.0010194625,0.0021746194,0.0027043717,0.0051095556,0.004477708,0.004454225,0.014769517],"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.00019937285,0.00011056081,0.00073076825,0.00031488933,0.000096225325,0.00013410879,0.00028815365,0.0011802536,0.00041575226,0.055142373,0.70997876,0.23140879],"study_design_scores_gemma":[0.000017567709,0.000028363811,0.0007013894,0.00024734228,0.00003609734,0.000104337814,0.0001536835,0.0022412953,0.00035522727,0.033232085,0.9628585,0.000024078461],"about_ca_topic_score_codex":0.007003726,"about_ca_topic_score_gemma":0.010433869,"teacher_disagreement_score":0.057848785,"about_ca_system_score_codex":0.003572968,"about_ca_system_score_gemma":0.0039587882,"threshold_uncertainty_score":0.19352347},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017247905,0.02105945,0.54400873,0.0024142887,0.0015380562,0.00015359116,0.00087724306,0.008107847,0.42011604],"genre_scores_gemma":[0.014601871,0.03233383,0.34835932,0.0015376735,0.00078335835,0.00038772434,0.0019418616,0.008152774,0.5919016],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997371,0.000024093704,0.000013597801,0.00005681371,0.00015143058,0.000016907348],"domain_scores_gemma":[0.9997727,0.00008712855,0.000012699644,0.00004167791,0.000056184723,0.000029604164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036495432,0.0009135354,0.00029505894,0.0010249609,0.00060407515,0.0024654532,0.001112284,0.00091374136,0.02666048],"category_scores_gemma":[0.00070779375,0.0008405737,0.00048554092,0.0017189877,0.00089116156,0.0036679688,0.0013155844,0.0025815598,0.021125725],"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.000021751128,0.000037577058,0.000117087075,0.000544539,0.000010898006,0.00010751699,0.0006335816,0.003044883,0.006145778,0.22931033,0.28419405,0.47583202],"study_design_scores_gemma":[0.0000025268096,0.000006517054,0.000088922796,0.00008835836,0.0000028077793,0.00018379636,0.000024941453,0.0015053346,0.0006601624,0.02653324,0.97089356,0.000009848908],"about_ca_topic_score_codex":0.0014825192,"about_ca_topic_score_gemma":0.0028766487,"teacher_disagreement_score":0.02666048,"about_ca_system_score_codex":0.00090897933,"about_ca_system_score_gemma":0.0007681311,"threshold_uncertainty_score":0.08918816},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018283993,0.0005391482,0.9737428,0.00052594364,0.000053674135,0.000108388966,0.00014670537,0.0006054215,0.0059939413],"genre_scores_gemma":[0.4500334,0.0005963567,0.5445331,0.00027087415,0.00008148186,0.0004687703,0.00032568202,0.00031100868,0.0033793559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988445,0.0006080573,0.00004810668,0.00013785274,0.0002713318,0.00009005624],"domain_scores_gemma":[0.99199355,0.006856132,0.00032063434,0.0003077714,0.00035221627,0.00016974931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024038544,0.00084655243,0.001251063,0.0013656112,0.0005443061,0.0011728599,0.0016541777,0.0017264155,0.004020532],"category_scores_gemma":[0.010890466,0.00072955305,0.00093234587,0.0015153757,0.0012695151,0.0014038006,0.0008734155,0.0016277799,0.00040926208],"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.000023886938,0.00001790119,0.00018278518,0.000030260697,0.000018376353,0.000021148813,0.00001802099,0.98037946,0.00015993732,0.012205138,0.0004000132,0.0065431213],"study_design_scores_gemma":[0.0000072539774,0.000006118181,0.000030308789,0.0000050028084,0.0000034985337,0.000004582734,0.0000029854307,0.9935607,0.00006147275,0.006078271,0.00023640475,0.000003376403],"about_ca_topic_score_codex":0.010591916,"about_ca_topic_score_gemma":0.014055703,"teacher_disagreement_score":0.010591916,"about_ca_system_score_codex":0.0014270867,"about_ca_system_score_gemma":0.0018399049,"threshold_uncertainty_score":0.021060526},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37393683,0.010256436,0.54338986,0.002291465,0.0002804202,0.00055137847,0.0008003084,0.0022993959,0.06619385],"genre_scores_gemma":[0.9125402,0.0038040038,0.069893785,0.0002545361,0.00005988466,0.0003220146,0.00069683965,0.00019721921,0.012231508],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99722445,0.0006276314,0.00018059809,0.000632801,0.0011126618,0.00022188918],"domain_scores_gemma":[0.9947817,0.002586506,0.00053564296,0.0004520139,0.0014840646,0.0001600194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024283228,0.0013980496,0.0009074771,0.0022212297,0.0010579298,0.004305792,0.0009783854,0.0011432072,0.00705978],"category_scores_gemma":[0.010980048,0.00061073754,0.0013732348,0.0014861701,0.0013854105,0.00412304,0.0012575452,0.0014427018,0.0015609346],"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.0008958183,0.0005092899,0.07822973,0.0031749401,0.00088899536,0.0015362924,0.007646029,0.091741905,0.042414375,0.12047187,0.008123662,0.6443671],"study_design_scores_gemma":[0.00017406914,0.0016922094,0.1545507,0.0019737978,0.0014907989,0.002459096,0.012184331,0.47759083,0.049892645,0.17082998,0.12666893,0.00049259205],"about_ca_topic_score_codex":0.007653435,"about_ca_topic_score_gemma":0.004399532,"teacher_disagreement_score":0.007653435,"about_ca_system_score_codex":0.0016021201,"about_ca_system_score_gemma":0.002087261,"threshold_uncertainty_score":0.023617327},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16353108,0.00015611667,0.816286,0.0006628384,0.00005960394,0.00030815208,0.00006951566,0.006913822,0.012012983],"genre_scores_gemma":[0.61979324,0.000121141704,0.37613532,0.00012432308,0.000022353464,0.00018089436,0.00010245104,0.00010755101,0.0034127089],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995098,0.000195488,0.000022532966,0.00011166138,0.00010849325,0.000051911764],"domain_scores_gemma":[0.99851674,0.00079430843,0.00012563895,0.00022836335,0.00023005895,0.00010476945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076061516,0.00061521004,0.0002941548,0.0003709824,0.0002727484,0.00059729494,0.00094416516,0.00070045807,0.0032697872],"category_scores_gemma":[0.0039701066,0.00035142154,0.0001924606,0.00018509457,0.00048415613,0.0009880903,0.0009975091,0.00084783713,0.0008959557],"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.00037457075,0.0013235839,0.0058082803,0.00031072972,0.000048554743,0.00025964793,0.0014812116,0.22865485,0.09539212,0.007179362,0.0036419788,0.6555251],"study_design_scores_gemma":[0.000070171365,0.0006159649,0.0021333394,0.000047298592,0.000034579778,0.0001497673,0.0002196986,0.93347794,0.040919345,0.006351912,0.015948197,0.000031770945],"about_ca_topic_score_codex":0.002474347,"about_ca_topic_score_gemma":0.003106915,"teacher_disagreement_score":0.0032697872,"about_ca_system_score_codex":0.00033970524,"about_ca_system_score_gemma":0.0007976499,"threshold_uncertainty_score":0.010938525},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039520092,0.0012226539,0.9401367,0.00020851873,0.000049405025,0.00038227686,0.00029533304,0.011858785,0.0063262745],"genre_scores_gemma":[0.27836892,0.00056702923,0.7129713,0.00015062497,0.00006434208,0.00063653575,0.00124453,0.0007605135,0.005236175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974306,0.0010536186,0.00023706429,0.00028279008,0.00075279194,0.00024304327],"domain_scores_gemma":[0.9935574,0.0042514424,0.0001330951,0.0009429791,0.00094642874,0.00016861953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030026797,0.0010074693,0.0016703343,0.0025960626,0.0016529653,0.003182871,0.0038572026,0.0019430537,0.009691721],"category_scores_gemma":[0.014112699,0.0010701071,0.00079102593,0.0024807919,0.0010451538,0.0056665945,0.0031583118,0.0017427515,0.0031784154],"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.0017000514,0.00071176427,0.0013960162,0.0007271674,0.00016280595,0.00033596522,0.0023682513,0.038121566,0.02875673,0.023510689,0.015759172,0.8864499],"study_design_scores_gemma":[0.00027473085,0.00021036158,0.00058525964,0.000055981385,0.00024028147,0.0003031406,0.00057939044,0.9305906,0.023589054,0.031781364,0.011709258,0.00008063349],"about_ca_topic_score_codex":0.010580583,"about_ca_topic_score_gemma":0.010902831,"teacher_disagreement_score":0.010580583,"about_ca_system_score_codex":0.0010184321,"about_ca_system_score_gemma":0.0021489596,"threshold_uncertainty_score":0.032422006},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025081862,0.00020906165,0.9670838,0.00021983145,0.000035610625,0.000113478985,0.00008799755,0.00299454,0.0041737873],"genre_scores_gemma":[0.36392066,0.00014906602,0.6311264,0.00026351959,0.00003607384,0.0003255901,0.0004789294,0.00070318347,0.0029964347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976909,0.00091710495,0.000120709985,0.00049684796,0.00054504804,0.00022936636],"domain_scores_gemma":[0.996838,0.0015354272,0.00029662662,0.0009953107,0.0002547676,0.00007994149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002017,0.0010748539,0.0010889181,0.000650025,0.00047926276,0.0013505239,0.0020135639,0.0008357617,0.005822388],"category_scores_gemma":[0.0052409917,0.000593416,0.0012586778,0.0008369664,0.0013984931,0.0025784478,0.0018874813,0.0020575086,0.0010186795],"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.00072815997,0.00040718753,0.0009605874,0.00020081388,0.00007167687,0.0001543825,0.00023755875,0.6842359,0.022278799,0.07624624,0.0041692206,0.21030946],"study_design_scores_gemma":[0.00009818198,0.00019786661,0.00018203832,0.000016988408,0.00002190358,0.000033621523,0.000024828554,0.96186626,0.009386942,0.024969801,0.0031764915,0.000025040667],"about_ca_topic_score_codex":0.0023290098,"about_ca_topic_score_gemma":0.0036556912,"teacher_disagreement_score":0.005822388,"about_ca_system_score_codex":0.00091658393,"about_ca_system_score_gemma":0.0020119117,"threshold_uncertainty_score":0.019477844},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019039625,0.0006845676,0.97243685,0.0002027339,0.00005142367,0.000103454346,0.000071871254,0.0031210494,0.0042883605],"genre_scores_gemma":[0.34703755,0.0004891578,0.6470257,0.00025308918,0.0000638686,0.00040175134,0.0002913372,0.0006177598,0.0038197984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986022,0.0006734944,0.00006483555,0.00021633501,0.00032639704,0.00011661931],"domain_scores_gemma":[0.9966575,0.002315791,0.00022263183,0.0004062989,0.00028569516,0.00011203839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020928434,0.0009780728,0.0014934822,0.001285622,0.00062177493,0.0008453755,0.0017232955,0.0011454991,0.0040984517],"category_scores_gemma":[0.00721494,0.0006469579,0.001005676,0.0011874513,0.001222971,0.0015603497,0.001929022,0.001824818,0.0010816205],"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.00027420922,0.0001598521,0.0005451627,0.0002479536,0.000084077394,0.00010925341,0.00018937595,0.84703547,0.0029928472,0.017515507,0.0040679104,0.12677841],"study_design_scores_gemma":[0.000048958977,0.000079223166,0.00007960927,0.000017227636,0.00002216359,0.000025152554,0.000020612057,0.99081695,0.0012794674,0.0065601785,0.0010403882,0.000010141609],"about_ca_topic_score_codex":0.005528258,"about_ca_topic_score_gemma":0.0076978835,"teacher_disagreement_score":0.005528258,"about_ca_system_score_codex":0.0010593458,"about_ca_system_score_gemma":0.0016150997,"threshold_uncertainty_score":0.013710678},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029121669,0.0007900838,0.9539829,0.005510661,0.00012014873,0.00013975096,0.00011139751,0.0012162665,0.009007095],"genre_scores_gemma":[0.55657065,0.000913972,0.43865988,0.0009643061,0.00009715365,0.0002592603,0.00037903505,0.00019312948,0.001962657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.986667,0.0075784824,0.0007382967,0.0014132358,0.0030283893,0.00057461084],"domain_scores_gemma":[0.944313,0.043164734,0.003753456,0.005301006,0.0027287905,0.0007389535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017520234,0.0015206207,0.0009355431,0.0033603993,0.0027670497,0.010621279,0.004292131,0.0033030845,0.0034867346],"category_scores_gemma":[0.05836134,0.0016125629,0.0025941767,0.0019204628,0.009990457,0.017317606,0.0066116555,0.0071588326,0.0006042456],"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.0005193709,0.0002473567,0.0066990433,0.0010871018,0.0005141608,0.0015836912,0.02189883,0.101134606,0.005576297,0.6710749,0.006125025,0.18353951],"study_design_scores_gemma":[0.00008191403,0.000080415586,0.0006132699,0.0002832261,0.00016255367,0.00030851326,0.0026367987,0.20863445,0.0034508808,0.7685893,0.015053951,0.00010474655],"about_ca_topic_score_codex":0.010245226,"about_ca_topic_score_gemma":0.0101496475,"teacher_disagreement_score":0.017520234,"about_ca_system_score_codex":0.005012096,"about_ca_system_score_gemma":0.0066184616,"threshold_uncertainty_score":0.09265697},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060796723,0.00035597116,0.92711985,0.00025141807,0.000081435486,0.00022457135,0.00008863502,0.005130604,0.0059508355],"genre_scores_gemma":[0.55205166,0.00019139997,0.44160834,0.0002934247,0.000047933117,0.0003371331,0.0002359119,0.00034064308,0.004893705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996729,0.00010688378,0.000015407277,0.000080862905,0.00008373426,0.000040191084],"domain_scores_gemma":[0.9993216,0.00036434122,0.00006177466,0.00009348027,0.00006946486,0.000089352485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091019005,0.0006737579,0.00090805965,0.0003408327,0.00033483707,0.0007285359,0.0017412647,0.00091106596,0.004696437],"category_scores_gemma":[0.0026045525,0.0005010341,0.00039905732,0.00021801349,0.0009666686,0.001071738,0.0010365152,0.0010805854,0.00074742694],"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.00056531315,0.00045239742,0.0039527314,0.00023760067,0.00013080046,0.0001878896,0.00037663148,0.6147192,0.008115725,0.014031965,0.0057020006,0.35152778],"study_design_scores_gemma":[0.0000618321,0.00010094269,0.00022765626,0.000011900951,0.000011508743,0.00003263422,0.000025058494,0.99138063,0.0015709609,0.0047308006,0.0018369256,0.000009146983],"about_ca_topic_score_codex":0.0049874824,"about_ca_topic_score_gemma":0.007462073,"teacher_disagreement_score":0.0049874824,"about_ca_system_score_codex":0.00056566857,"about_ca_system_score_gemma":0.0011970054,"threshold_uncertainty_score":0.015711129},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011494394,0.0007912388,0.9779563,0.00020952249,0.000042291158,0.00014765839,0.00028849428,0.0011412653,0.007928815],"genre_scores_gemma":[0.2617546,0.00054151815,0.73231894,0.00029115842,0.000054401648,0.0006152841,0.0011268322,0.00037908665,0.0029181198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894446,0.00047418365,0.000053139305,0.00014272227,0.00026546605,0.00012011752],"domain_scores_gemma":[0.9972314,0.002191594,0.00015569008,0.0001658095,0.00017842808,0.00007699703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014156374,0.0011363291,0.0009412447,0.0013617333,0.00049069925,0.0010888962,0.0012681959,0.0011474147,0.007387501],"category_scores_gemma":[0.0061031855,0.00057473936,0.0008698894,0.0014035358,0.0010755991,0.001311062,0.0012237272,0.0017770564,0.0007572972],"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.00015563014,0.000071970564,0.0004383633,0.0002669404,0.000031238254,0.000110299996,0.000079208105,0.8676476,0.0014876939,0.032922253,0.0041961293,0.09259265],"study_design_scores_gemma":[0.000042126714,0.000052368327,0.000117233336,0.000058473546,0.00001582712,0.000035637113,0.000025926973,0.95740956,0.0008538751,0.039037433,0.0023421897,0.000009389052],"about_ca_topic_score_codex":0.0039505633,"about_ca_topic_score_gemma":0.006342037,"teacher_disagreement_score":0.007387501,"about_ca_system_score_codex":0.0018357787,"about_ca_system_score_gemma":0.0018828713,"threshold_uncertainty_score":0.024713635},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05285422,0.0012997891,0.93763274,0.0006551179,0.00006464413,0.00016825092,0.00008033729,0.0007685357,0.006476338],"genre_scores_gemma":[0.7504599,0.0005861433,0.24577883,0.0005206353,0.000089758505,0.00055362907,0.00017707878,0.0002622994,0.0015717811],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964898,0.001962169,0.00015984627,0.00036912356,0.00073974155,0.00027919962],"domain_scores_gemma":[0.98127085,0.014994818,0.001074716,0.0015361978,0.00079769024,0.00032576686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005488111,0.0010340238,0.001164778,0.0015529793,0.0008072682,0.0013479114,0.0014027368,0.0014021484,0.002915689],"category_scores_gemma":[0.031900946,0.0007376974,0.0010492591,0.0012374971,0.0020780761,0.0026343036,0.0019988613,0.0018785809,0.00044217065],"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.00048937753,0.00014609283,0.0057418756,0.00040548496,0.00017499152,0.00016577807,0.00040996552,0.73794055,0.0039319685,0.13383242,0.0030794193,0.11368208],"study_design_scores_gemma":[0.000069550646,0.000116511204,0.00036597266,0.000069139314,0.000034619323,0.00008857739,0.000045242414,0.9094453,0.0017660722,0.08633508,0.0016441498,0.000019745297],"about_ca_topic_score_codex":0.0017599292,"about_ca_topic_score_gemma":0.0020778081,"teacher_disagreement_score":0.005488111,"about_ca_system_score_codex":0.0017895245,"about_ca_system_score_gemma":0.0024162394,"threshold_uncertainty_score":0.029024243},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032278273,0.0006648437,0.9546613,0.00044848328,0.00011313703,0.00027336073,0.0001817833,0.0018046388,0.009574174],"genre_scores_gemma":[0.5740529,0.00045618817,0.41969714,0.00047504855,0.00012396726,0.00078317855,0.0008701461,0.00030208926,0.0032392251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980063,0.0010301925,0.000101560065,0.00030553987,0.00042394167,0.00013245967],"domain_scores_gemma":[0.9910199,0.0062127304,0.00047326405,0.0013890121,0.00068243063,0.00022261207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003272354,0.001463986,0.001563718,0.0017057679,0.00061966706,0.0012898768,0.0021599177,0.0015854721,0.005147683],"category_scores_gemma":[0.023230497,0.0007945381,0.0010976389,0.0011690619,0.0016985484,0.002054289,0.0020103613,0.0020840098,0.0012246263],"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.00026223104,0.000305282,0.0027414986,0.00045340712,0.00018445244,0.00014361281,0.00019917339,0.73196596,0.0020642353,0.058855552,0.0060970695,0.19672751],"study_design_scores_gemma":[0.000049459137,0.00008362223,0.00012414463,0.000041527797,0.000018679491,0.00002634924,0.000029349043,0.9587823,0.0010255582,0.0379797,0.0018299384,0.000009323401],"about_ca_topic_score_codex":0.0012355002,"about_ca_topic_score_gemma":0.0019245398,"teacher_disagreement_score":0.005147683,"about_ca_system_score_codex":0.0012531345,"about_ca_system_score_gemma":0.001471432,"threshold_uncertainty_score":0.01730609},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008051309,0.0006584417,0.9779708,0.00025512747,0.000049469432,0.0001823615,0.00023730227,0.00081792846,0.011777343],"genre_scores_gemma":[0.12404715,0.00038809326,0.8714659,0.00025310708,0.000036633068,0.0004476889,0.0005516691,0.00028764558,0.0025221447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821365,0.0006794166,0.00011169613,0.00027815977,0.0005691901,0.00014791971],"domain_scores_gemma":[0.9970784,0.002032489,0.00021425201,0.0003645234,0.00020962366,0.00010060472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021196937,0.0011325943,0.00083646725,0.0012660066,0.0007131987,0.0013617818,0.0015947691,0.0010353388,0.0070839277],"category_scores_gemma":[0.008119631,0.0005881641,0.0010933273,0.0014892699,0.0016444048,0.0018062452,0.0013344074,0.0025284041,0.0009917261],"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.00032783597,0.00014817336,0.0009654767,0.00088817166,0.000078886726,0.00019690192,0.00026616934,0.4452037,0.0051566567,0.21799372,0.012067724,0.3167066],"study_design_scores_gemma":[0.000078921636,0.0001867463,0.0003679135,0.00019381302,0.000039986877,0.0002380338,0.00007962388,0.76448053,0.005015055,0.21086419,0.018411657,0.000043456956],"about_ca_topic_score_codex":0.002200673,"about_ca_topic_score_gemma":0.0035417494,"teacher_disagreement_score":0.0070839277,"about_ca_system_score_codex":0.0019489977,"about_ca_system_score_gemma":0.0024903575,"threshold_uncertainty_score":0.023698092},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02700164,0.00027407618,0.9253573,0.0014132265,0.00015070189,0.0010243868,0.004196575,0.023254935,0.017327186],"genre_scores_gemma":[0.16940941,0.00023173603,0.8211618,0.00035393302,0.000031511638,0.0004162316,0.0036520306,0.0002714317,0.004471927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904996,0.00018635234,0.000154147,0.00018446692,0.00036801197,0.000057105528],"domain_scores_gemma":[0.9963948,0.0025816795,0.00020522026,0.00026563022,0.00038621854,0.00016641463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015693607,0.0014886686,0.0008232755,0.004129879,0.00095314434,0.0027093454,0.0027674788,0.002380932,0.021930583],"category_scores_gemma":[0.008386502,0.00070799486,0.0012248292,0.0013187822,0.00052896293,0.0021139747,0.0017626247,0.0011134859,0.0029273524],"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.000874271,0.0024068216,0.00852725,0.0011168923,0.00040871935,0.0036380882,0.0011463582,0.18320194,0.011922838,0.037928063,0.058745604,0.69008315],"study_design_scores_gemma":[0.0003677868,0.00014210932,0.0012078024,0.00028425863,0.00021863106,0.0007009263,0.00038247183,0.923973,0.008093116,0.026350081,0.038191177,0.00008854883],"about_ca_topic_score_codex":0.01405378,"about_ca_topic_score_gemma":0.019114615,"teacher_disagreement_score":0.021930583,"about_ca_system_score_codex":0.000992763,"about_ca_system_score_gemma":0.0018705735,"threshold_uncertainty_score":0.07336509},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07497448,0.00023066196,0.9085199,0.000688567,0.00009476636,0.000121253666,0.00026793565,0.0020865,0.013015938],"genre_scores_gemma":[0.62799346,0.00030240323,0.36144805,0.00020233051,0.000057722566,0.00034096758,0.00061972265,0.00031985808,0.008715449],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923515,0.00015206059,0.00004390987,0.00027847735,0.00018382318,0.00010655157],"domain_scores_gemma":[0.99862933,0.00076492305,0.00015898228,0.00021684944,0.000121442026,0.00010859438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070350064,0.0007948747,0.0007287956,0.00035356617,0.000512937,0.0010653025,0.0014187956,0.00076174707,0.0072437488],"category_scores_gemma":[0.0038051126,0.00048134773,0.00071632286,0.00046319482,0.0012275313,0.0019385224,0.0015308092,0.0012659042,0.0009876926],"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.00019329033,0.0001260163,0.0009147204,0.00016673922,0.000046958616,0.00020398672,0.0002528778,0.8774198,0.004383859,0.034510925,0.0032778995,0.078503],"study_design_scores_gemma":[0.000024504894,0.00006142308,0.00016372072,0.000008329517,0.00001551136,0.000036717644,0.00006049757,0.9680015,0.0018952917,0.026524533,0.0031993801,0.000008526364],"about_ca_topic_score_codex":0.0087323105,"about_ca_topic_score_gemma":0.011006635,"teacher_disagreement_score":0.0087323105,"about_ca_system_score_codex":0.0011258036,"about_ca_system_score_gemma":0.0012510129,"threshold_uncertainty_score":0.024232745},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041814893,0.001533026,0.92974806,0.0016849076,0.00014877618,0.00010015545,0.00019083775,0.0003096111,0.024469713],"genre_scores_gemma":[0.8949574,0.0007061478,0.09142436,0.00024614178,0.00019130493,0.00020284526,0.00023231607,0.00008488126,0.011954473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973291,0.001225513,0.00017381123,0.00046059367,0.0005916057,0.00021934594],"domain_scores_gemma":[0.98740757,0.01026059,0.00047522236,0.0010529332,0.0005023213,0.0003013363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002941021,0.00082532316,0.0017005987,0.0015092245,0.0011685727,0.002660069,0.0018728016,0.0027246845,0.008963139],"category_scores_gemma":[0.022745194,0.0008026677,0.001126186,0.0020790761,0.002460315,0.0072469385,0.0042130766,0.0023626406,0.00075076247],"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.0005501779,0.00013226204,0.00070635305,0.00035867293,0.00017133012,0.0003453181,0.00032131077,0.4805497,0.0008187496,0.4240305,0.0036237466,0.088391855],"study_design_scores_gemma":[0.000034020704,0.000060466424,0.000111129106,0.000020268362,0.000028254497,0.000058869686,0.000033789252,0.67176056,0.0004829667,0.32623827,0.0011539207,0.000017409846],"about_ca_topic_score_codex":0.0024996058,"about_ca_topic_score_gemma":0.0013554287,"teacher_disagreement_score":0.008963139,"about_ca_system_score_codex":0.0013588255,"about_ca_system_score_gemma":0.0010438911,"threshold_uncertainty_score":0.029984713},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026420704,0.001579257,0.7013839,0.0011977791,0.000310476,0.0002506007,0.00037617536,0.0026132276,0.28964663],"genre_scores_gemma":[0.09743548,0.003659916,0.7073396,0.001472309,0.00048291066,0.0007855689,0.0025971038,0.0017723195,0.18445483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985353,0.00041482828,0.00007588743,0.0003978227,0.00048728965,0.000088779954],"domain_scores_gemma":[0.99723274,0.0012729061,0.00010000497,0.00079210015,0.0004690322,0.00013329032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002109183,0.0012548687,0.0005518145,0.0010123092,0.0007531967,0.0034938029,0.003054664,0.0010807995,0.058314662],"category_scores_gemma":[0.00804054,0.00054093165,0.0011024253,0.0011366134,0.0022927884,0.0054311506,0.0033166271,0.0033713148,0.019641882],"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.000043300377,0.00007773706,0.00024067733,0.0002742628,0.00002899184,0.000041121824,0.00039895182,0.002630157,0.0010812879,0.51883465,0.029613618,0.44673526],"study_design_scores_gemma":[0.000022676277,0.000051739025,0.00041661152,0.0002304665,0.000022480635,0.00023631184,0.00012833785,0.017080057,0.0034558421,0.6405671,0.3377564,0.00003191768],"about_ca_topic_score_codex":0.00075258827,"about_ca_topic_score_gemma":0.001208579,"teacher_disagreement_score":0.058314662,"about_ca_system_score_codex":0.0014406274,"about_ca_system_score_gemma":0.0021434429,"threshold_uncertainty_score":0.19508201},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000906726,0.000050511517,0.968198,0.00009326753,0.000032584703,0.00010090917,0.00048181714,0.027496973,0.0026391095],"genre_scores_gemma":[0.029046228,0.00017427221,0.96217036,0.00012321316,0.000020072703,0.00031875208,0.0022670715,0.0032318523,0.0026482844],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981384,0.0004972415,0.00022698149,0.00039101395,0.00061719265,0.00012914269],"domain_scores_gemma":[0.9954869,0.002343075,0.00027415954,0.0012087572,0.0005513196,0.00013577899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019787843,0.0015966219,0.00063366996,0.001723691,0.0009309563,0.0026597753,0.003262609,0.0012067116,0.02004939],"category_scores_gemma":[0.00873501,0.0012292525,0.0013083963,0.0014762628,0.0013328437,0.0028299824,0.0030530642,0.0031979429,0.005222835],"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.00029624594,0.00038240707,0.0012353879,0.001328368,0.0001395108,0.00059309363,0.0009451362,0.08887942,0.01933389,0.116498485,0.049282484,0.72108567],"study_design_scores_gemma":[0.00023986086,0.00028935666,0.00058098306,0.00035677763,0.00011518487,0.0011406055,0.00037752363,0.5238077,0.06314625,0.14345,0.26634136,0.0001544238],"about_ca_topic_score_codex":0.0051032742,"about_ca_topic_score_gemma":0.0051641944,"teacher_disagreement_score":0.02004939,"about_ca_system_score_codex":0.000866423,"about_ca_system_score_gemma":0.0034381626,"threshold_uncertainty_score":0.067071915},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018060075,0.00009607164,0.9944332,0.000033155753,0.00004335904,0.00003509213,0.000046094006,0.0014413928,0.0020655687],"genre_scores_gemma":[0.070947155,0.00023210477,0.9176697,0.000106751024,0.000059658,0.00008436571,0.00032625213,0.00022345109,0.010350637],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994991,0.000043733467,0.00001915295,0.00012812686,0.0002558158,0.000053999094],"domain_scores_gemma":[0.99964213,0.00009805016,0.00002050556,0.00007901456,0.0001431312,0.000017190385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032268747,0.0009704539,0.00091858953,0.0016208352,0.00073225243,0.0012938005,0.002041658,0.0011591684,0.006014162],"category_scores_gemma":[0.00077004876,0.0005592291,0.00084609515,0.0011637643,0.00059906574,0.0009637053,0.0018034085,0.0010852044,0.0022733274],"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.00014666813,0.00015577419,0.0007174604,0.00012312285,0.0000772757,0.00022059276,0.000103822225,0.052746627,0.067200705,0.018891558,0.00824488,0.8513715],"study_design_scores_gemma":[0.000018496905,0.000089496,0.0006422402,0.000020342153,0.00004180811,0.00035801507,0.00007943992,0.9384784,0.028713245,0.019092234,0.012435449,0.000030887517],"about_ca_topic_score_codex":0.0056769853,"about_ca_topic_score_gemma":0.006803809,"teacher_disagreement_score":0.006014162,"about_ca_system_score_codex":0.00044859154,"about_ca_system_score_gemma":0.0007992297,"threshold_uncertainty_score":0.020119369},"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008159174,0.0055449605,0.001633028,0.5263061,0.30464855,0.00010645756,0.0008024661,0.00047181788,0.15967076],"genre_scores_gemma":[0.014867185,0.005445897,0.0011798235,0.22495006,0.09438679,0.00030156266,0.0007120877,0.0007682433,0.65738827],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99853575,0.00036251426,0.000060207996,0.00027429723,0.00043052647,0.00033660393],"domain_scores_gemma":[0.9975666,0.0005253009,0.00009159825,0.000090596564,0.0007829197,0.00094296713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022974405,0.0011657786,0.00068253145,0.00066071283,0.0055900896,0.00831022,0.0013550357,0.0081782695,0.18163007],"category_scores_gemma":[0.0072405403,0.0003343449,0.00097580405,0.00056350935,0.0018093386,0.009969912,0.004356597,0.012223092,0.10671591],"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.000024956498,0.000011799885,0.000042880816,0.000033385484,0.0000014243693,0.000027883982,0.00018001595,0.000009137727,0.00007922315,0.0063335407,0.98877305,0.004482695],"study_design_scores_gemma":[0.000008013011,0.000019948751,0.00018034513,0.0000954129,0.0000035155333,0.000054282464,0.0008437691,0.000041806263,0.00009202506,0.0036021245,0.99504733,0.0000115188805],"about_ca_topic_score_codex":0.0031527397,"about_ca_topic_score_gemma":0.004476072,"teacher_disagreement_score":0.18163007,"about_ca_system_score_codex":0.0025122054,"about_ca_system_score_gemma":0.0025185535,"threshold_uncertainty_score":0.60761315},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22649115,0.00021917446,0.7432116,0.0010068922,0.00009294114,0.00040917468,0.00007450452,0.007866396,0.02062813],"genre_scores_gemma":[0.6786929,0.0001379422,0.3167684,0.00015616238,0.000027490292,0.00018351794,0.000088486224,0.000083888845,0.003861223],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995747,0.00016614063,0.000019602334,0.0000867682,0.00010098874,0.00005161981],"domain_scores_gemma":[0.9986027,0.00071644824,0.000115891075,0.00021067497,0.00024725034,0.000107009015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007044493,0.00052250514,0.0002546614,0.0003369223,0.0002734689,0.0006030931,0.00091138546,0.0006249796,0.0032312446],"category_scores_gemma":[0.0037685453,0.00030316843,0.00015703896,0.00016727383,0.00040130637,0.0009772577,0.0009581219,0.000728108,0.00087634404],"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.00035878585,0.0015857195,0.0064620674,0.000278588,0.00004292678,0.00027697446,0.0013804103,0.16876124,0.08397229,0.0063257646,0.0039457604,0.72660947],"study_design_scores_gemma":[0.00010119633,0.0010594534,0.0035672989,0.0000733525,0.000050834657,0.00023660148,0.0003183176,0.9185922,0.042778905,0.0065186587,0.026658267,0.000044940643],"about_ca_topic_score_codex":0.0025588474,"about_ca_topic_score_gemma":0.0031502156,"teacher_disagreement_score":0.0032312446,"about_ca_system_score_codex":0.0003107278,"about_ca_system_score_gemma":0.00081054907,"threshold_uncertainty_score":0.01080966},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011243266,0.00028461416,0.9807258,0.00067309727,0.000054307082,0.00015143144,0.00025680911,0.0015175057,0.0050930833],"genre_scores_gemma":[0.419837,0.00064136885,0.5743864,0.00041991533,0.00013800141,0.00037860722,0.0010212563,0.00051709637,0.0026603462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99459285,0.0017983479,0.00037393547,0.0010428855,0.0017272941,0.00046471227],"domain_scores_gemma":[0.9729984,0.019656636,0.0016967885,0.003751382,0.001510819,0.00038601714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005118319,0.0012529864,0.00085919735,0.0033357085,0.0010410656,0.0028819428,0.002149668,0.002253964,0.0067983847],"category_scores_gemma":[0.052223623,0.00066840893,0.0014542409,0.0024827218,0.004002414,0.008317603,0.0039883913,0.0034597488,0.0007993235],"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.00009244885,0.00011055217,0.0025463912,0.00032073705,0.00006471554,0.00018015961,0.000590657,0.29031834,0.0010636724,0.5660094,0.0024540725,0.13624893],"study_design_scores_gemma":[0.000028952198,0.00003667598,0.00044524,0.00010087996,0.000027673472,0.000072390605,0.00008917165,0.41641855,0.0019499041,0.5733067,0.0074931146,0.000030879088],"about_ca_topic_score_codex":0.0082110595,"about_ca_topic_score_gemma":0.009257166,"teacher_disagreement_score":0.0082110595,"about_ca_system_score_codex":0.002377685,"about_ca_system_score_gemma":0.0054417853,"threshold_uncertainty_score":0.027068615},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18854861,0.00028475447,0.80009,0.0003161123,0.000040818282,0.00013715737,0.0002392165,0.0012129084,0.009130353],"genre_scores_gemma":[0.75460106,0.00009804885,0.24381441,0.00006053832,0.000010541545,0.00009025544,0.00027631482,0.00011642411,0.0009323491],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979996,0.00069107284,0.00011816347,0.00024394495,0.00075505103,0.00019216239],"domain_scores_gemma":[0.9936407,0.00400407,0.0007793259,0.00097016065,0.00046076757,0.00014494659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001841353,0.0004951882,0.0005772323,0.0009620874,0.0007004217,0.0012289246,0.0010901167,0.0006388963,0.0023398285],"category_scores_gemma":[0.012022662,0.00049454806,0.0007204466,0.0008646065,0.0018342425,0.0015385265,0.0012984297,0.0011289153,0.00030385627],"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.0005214587,0.00015050749,0.0047682915,0.0002854122,0.00005703154,0.00030683505,0.0002558127,0.66646,0.010459075,0.14614835,0.0018645778,0.16872266],"study_design_scores_gemma":[0.000028083938,0.00008426673,0.000492972,0.000022919017,0.000012095501,0.00007381625,0.000055768975,0.905581,0.006207759,0.08667267,0.00075612427,0.000012510101],"about_ca_topic_score_codex":0.004145096,"about_ca_topic_score_gemma":0.0027851334,"teacher_disagreement_score":0.004145096,"about_ca_system_score_codex":0.0012845228,"about_ca_system_score_gemma":0.002028661,"threshold_uncertainty_score":0.009738088},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060455855,0.00032608153,0.9616688,0.0013166846,0.00007134182,0.00011309763,0.00019602105,0.00031510438,0.029947327],"genre_scores_gemma":[0.30431575,0.0010086038,0.6815801,0.0004999691,0.00019595619,0.0004903862,0.00055438833,0.00016821364,0.011186625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950848,0.002721897,0.00028728502,0.0006069569,0.0010043852,0.0002946084],"domain_scores_gemma":[0.99246526,0.005109547,0.00040254297,0.0011952757,0.00059654,0.00023090186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035016844,0.0008746785,0.0005322364,0.0009372637,0.0012304748,0.0026970406,0.001212477,0.0011628025,0.0060933125],"category_scores_gemma":[0.013278266,0.0005953103,0.0015266408,0.0012002033,0.0024590772,0.0050425353,0.0029952857,0.0023852442,0.0010640008],"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.00009134893,0.00006307805,0.00037439665,0.00021085997,0.000057764668,0.00016572764,0.00061009295,0.042069886,0.0012758946,0.889584,0.0035962905,0.061900724],"study_design_scores_gemma":[0.00004022117,0.000043602497,0.00013346015,0.00006361047,0.000039647326,0.00013480098,0.00018317989,0.10746655,0.0022296372,0.8613091,0.02832837,0.000027867194],"about_ca_topic_score_codex":0.0024742445,"about_ca_topic_score_gemma":0.0043472853,"teacher_disagreement_score":0.0060933125,"about_ca_system_score_codex":0.0011627243,"about_ca_system_score_gemma":0.0021867964,"threshold_uncertainty_score":0.020384192},"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":"commentary","genre_gemma":"commentary","domain_codex":"methods","domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":"methods","domain_consensus":"methods","prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008404992,0.06395584,0.089005336,0.66091126,0.094529785,0.016378634,0.0062134066,0.0017169203,0.058883905],"genre_scores_gemma":[0.17640868,0.012205982,0.10485131,0.629857,0.029964589,0.035633743,0.0019448019,0.0012742251,0.007859663],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.22671022,0.5350712,0.09360203,0.028231388,0.11281628,0.0035689254],"domain_scores_gemma":[0.057305947,0.80640376,0.021429032,0.055969153,0.055080466,0.0038115955],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.7053625,0.0027625507,0.0050105886,0.014500649,0.0047057117,0.0114816055,0.011066246,0.012832886,0.019332813],"category_scores_gemma":[0.8967885,0.0026660133,0.006787511,0.012252067,0.021372542,0.02041458,0.0102434335,0.025928048,0.00544048],"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.0022518078,0.000611265,0.019401362,0.027401118,0.0047826665,0.0012947962,0.024266934,0.0017872934,0.00070394436,0.12642476,0.43370062,0.35737342],"study_design_scores_gemma":[0.0021023315,0.0013098716,0.021059556,0.08353134,0.0026165722,0.002335287,0.012869607,0.007406191,0.0023747378,0.25603083,0.607759,0.00060470076],"about_ca_topic_score_codex":0.011457391,"about_ca_topic_score_gemma":0.011513433,"teacher_disagreement_score":0.2946375,"about_ca_system_score_codex":0.01781777,"about_ca_system_score_gemma":0.021681555,"threshold_uncertainty_score":0.36334056},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007904762,0.00044767448,0.9875651,0.000077794124,0.00002732188,0.00004886866,0.00015665348,0.00088108337,0.0028906313],"genre_scores_gemma":[0.1710883,0.00036655812,0.8259646,0.00008601573,0.000028794851,0.00018250942,0.00076522696,0.00032570734,0.0011922957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867743,0.0003341115,0.000091907394,0.0002711059,0.00051745685,0.00010796936],"domain_scores_gemma":[0.99635386,0.0025106599,0.00030580992,0.00043508774,0.00032337292,0.000071082424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012562769,0.0012730216,0.0009376121,0.0019393315,0.0005597741,0.0015693757,0.0011568256,0.00082160934,0.0039629834],"category_scores_gemma":[0.008832899,0.0007388921,0.00083410734,0.0020144256,0.0010880118,0.002581739,0.0015238523,0.0017972823,0.0007975568],"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.00022446139,0.00009059698,0.0018937009,0.000528275,0.000049280687,0.00019471493,0.00028014733,0.5407504,0.008879475,0.0630688,0.0054512275,0.37858889],"study_design_scores_gemma":[0.000015330395,0.00003438888,0.0003134126,0.000092342736,0.000020142088,0.000060435104,0.00004785336,0.9297972,0.004995647,0.06100826,0.0035943438,0.000020643238],"about_ca_topic_score_codex":0.002640859,"about_ca_topic_score_gemma":0.003541001,"teacher_disagreement_score":0.0039629834,"about_ca_system_score_codex":0.001036036,"about_ca_system_score_gemma":0.0015508189,"threshold_uncertainty_score":0.013257563},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012225611,0.00015510136,0.9271425,0.0002627235,0.0000921318,0.00022908357,0.003579931,0.059977714,0.0073381797],"genre_scores_gemma":[0.03741816,0.00064587063,0.92556596,0.0007441643,0.00009723797,0.0014208218,0.010421835,0.012851059,0.010834932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989466,0.00031246163,0.00020898187,0.00016288739,0.00026735076,0.00010167243],"domain_scores_gemma":[0.9981589,0.00094286184,0.00018005914,0.00029075137,0.0003142477,0.00011319468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018092532,0.0016183963,0.00073449133,0.00092779857,0.0007157916,0.00306757,0.0032226895,0.0014458665,0.019890802],"category_scores_gemma":[0.0033317823,0.0014259646,0.0017252917,0.0009894464,0.0011246263,0.003029099,0.0022858526,0.003416459,0.010333335],"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.0008691216,0.00025034498,0.0009341385,0.003437715,0.00016640937,0.0012278002,0.0016576005,0.060147874,0.022161154,0.38964266,0.24699886,0.2725063],"study_design_scores_gemma":[0.0002203598,0.00012293758,0.00023561993,0.0003312197,0.00006781649,0.0011410794,0.00017060089,0.13943212,0.017891426,0.06312902,0.77711225,0.0001456092],"about_ca_topic_score_codex":0.0033342945,"about_ca_topic_score_gemma":0.003989776,"teacher_disagreement_score":0.019890802,"about_ca_system_score_codex":0.0009528734,"about_ca_system_score_gemma":0.0022884237,"threshold_uncertainty_score":0.06654143},"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043268144,0.00081149593,0.0004367734,0.9672322,0.020265356,0.000029468065,0.00017309932,0.00013252646,0.01048638],"genre_scores_gemma":[0.008883989,0.00065943494,0.0008822708,0.8942912,0.011469008,0.00013529597,0.00012752436,0.0003586806,0.083192624],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.97206724,0.0045388048,0.0014557941,0.0031475832,0.014458874,0.0043316907],"domain_scores_gemma":[0.9059134,0.044855926,0.0030780714,0.0036733446,0.03559486,0.006884487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018392695,0.0017503693,0.0017714242,0.002359764,0.02515103,0.013737086,0.008028853,0.07812345,0.03592681],"category_scores_gemma":[0.13699114,0.0016430261,0.002008401,0.003464459,0.011928918,0.008590394,0.007312605,0.064667076,0.011542949],"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.000017207089,0.000003986054,0.000058889138,0.000023488214,0.000002692196,0.0000853502,0.0007541495,0.00006211367,0.000046731588,0.005728347,0.9921745,0.0010426415],"study_design_scores_gemma":[0.000016491553,0.0000092116225,0.0005683631,0.00010777036,0.0000068943596,0.000051566705,0.0011028866,0.00013160688,0.00013761867,0.0018124557,0.99598616,0.00006899651],"about_ca_topic_score_codex":0.6593866,"about_ca_topic_score_gemma":0.7346566,"teacher_disagreement_score":0.9648978,"about_ca_system_score_codex":0.035102166,"about_ca_system_score_gemma":0.048263736,"threshold_uncertainty_score":0.6852387},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021112174,0.00009782249,0.97710437,0.00015824703,0.000015715388,0.000022291933,0.00003314663,0.00055961066,0.0008965767],"genre_scores_gemma":[0.78467125,0.00017203689,0.21341492,0.00014801117,0.000019124673,0.000104733765,0.000119016215,0.000111125046,0.0012398965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997098,0.000101785336,0.000014683228,0.0000822065,0.00005396589,0.000037550442],"domain_scores_gemma":[0.9992077,0.00037269192,0.00008620815,0.00020215099,0.00004737844,0.000083822786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007220884,0.00058639917,0.0006968241,0.0002538728,0.00032528912,0.0006984444,0.0012191137,0.00060848927,0.001759204],"category_scores_gemma":[0.0025212215,0.00036571323,0.0007725783,0.00030333296,0.0010400084,0.001909377,0.001904605,0.0017679209,0.00022339378],"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.00013015578,0.00010131769,0.0010192586,0.000106828236,0.00007146308,0.00010574177,0.000281942,0.84589875,0.009647534,0.058505923,0.001641137,0.08248986],"study_design_scores_gemma":[0.0000070584165,0.000024758796,0.000077545614,0.0000036228087,0.0000057846455,0.000011335608,0.000009336145,0.9725427,0.0008260925,0.026148407,0.00033894315,0.000004361801],"about_ca_topic_score_codex":0.003069577,"about_ca_topic_score_gemma":0.0042800657,"teacher_disagreement_score":0.003069577,"about_ca_system_score_codex":0.00077163836,"about_ca_system_score_gemma":0.0011186725,"threshold_uncertainty_score":0.0061033964},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029260507,0.000587293,0.9790244,0.0012849048,0.0001434898,0.0001797167,0.0011143798,0.0063149277,0.008424828],"genre_scores_gemma":[0.13892716,0.00096950674,0.8432248,0.0007162804,0.00021233993,0.00086794747,0.0037794672,0.0027549688,0.008547516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694026,0.0012512859,0.00025305792,0.000467667,0.00090025587,0.00018753353],"domain_scores_gemma":[0.9942887,0.0036722394,0.00030969587,0.00087219337,0.0007276351,0.00012945799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025804783,0.0015413088,0.0007669909,0.0016304742,0.0010935414,0.0040062726,0.0025317892,0.0018567541,0.015197425],"category_scores_gemma":[0.008185865,0.0011778981,0.0037876249,0.0009475351,0.0026934107,0.004592573,0.0039414885,0.004096646,0.004583986],"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.00012160786,0.000120499586,0.0005883683,0.00059823075,0.00006918165,0.00031140845,0.00061663054,0.15105216,0.0039821807,0.7760684,0.014498117,0.051973287],"study_design_scores_gemma":[0.00006195836,0.00003890734,0.0001028766,0.00014249247,0.00003585345,0.00009950234,0.00010018199,0.44258183,0.0033289164,0.47520265,0.07826567,0.0000391956],"about_ca_topic_score_codex":0.0070320503,"about_ca_topic_score_gemma":0.008395672,"teacher_disagreement_score":0.015197425,"about_ca_system_score_codex":0.0027095592,"about_ca_system_score_gemma":0.0028707816,"threshold_uncertainty_score":0.050840437},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005647674,0.0018390582,0.9881144,0.00060795306,0.00011764512,0.00013856155,0.00014232141,0.00014229605,0.003250133],"genre_scores_gemma":[0.38669062,0.0046500205,0.5983896,0.00051694247,0.00058258086,0.0006044465,0.0005301968,0.00006301583,0.007972591],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996729,0.0009834921,0.00027123318,0.000502831,0.0013287925,0.00018457448],"domain_scores_gemma":[0.99611074,0.002478461,0.00030234462,0.00018869103,0.000856777,0.00006300462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004595606,0.0010662266,0.0015953667,0.008785185,0.00081901107,0.0018854395,0.0021971485,0.0022315683,0.0036164736],"category_scores_gemma":[0.011058687,0.0004479798,0.0015400617,0.005961015,0.0015573284,0.0024769478,0.0010157393,0.0018431251,0.0009883619],"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.00008089121,0.000119212345,0.002572499,0.00036919504,0.00020097726,0.00027009312,0.00022423777,0.3601073,0.001348806,0.09800235,0.006939424,0.529765],"study_design_scores_gemma":[0.000011572967,0.000092038936,0.0018810453,0.000057905687,0.000030305868,0.00029105943,0.000059272887,0.9007955,0.0007861752,0.09103246,0.004916286,0.000046371802],"about_ca_topic_score_codex":0.008630113,"about_ca_topic_score_gemma":0.0063175578,"teacher_disagreement_score":0.008785185,"about_ca_system_score_codex":0.0027448966,"about_ca_system_score_gemma":0.0015657537,"threshold_uncertainty_score":0.024304211},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16477123,0.00015156342,0.8262837,0.000394503,0.00003533059,0.00013153475,0.00065448455,0.004199086,0.0033786623],"genre_scores_gemma":[0.80802566,0.000089096844,0.1888962,0.00012954406,0.000010765118,0.00010006237,0.0009977408,0.00015058288,0.001600336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777657,0.0007031004,0.00018159121,0.0005319581,0.0005882186,0.00021858924],"domain_scores_gemma":[0.9911697,0.005248212,0.0009265906,0.0014941007,0.00087190856,0.00028957528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022867674,0.00069097365,0.00066840515,0.0007725588,0.00040520166,0.0020578846,0.0014302221,0.0011801218,0.0020622911],"category_scores_gemma":[0.012132897,0.00053558114,0.0012453954,0.00053741183,0.0013460001,0.004114292,0.0025776252,0.0016255907,0.00034833618],"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.00043905593,0.00016174778,0.005998643,0.00015846296,0.00009669443,0.00053306017,0.00054829835,0.86960834,0.0058213244,0.053395845,0.001286349,0.061952226],"study_design_scores_gemma":[0.00000876779,0.000029328437,0.0002542512,0.000009727464,0.000008058063,0.000029875957,0.000037559505,0.9744965,0.0023132183,0.02225776,0.0005426838,0.000012178236],"about_ca_topic_score_codex":0.016066523,"about_ca_topic_score_gemma":0.01645928,"teacher_disagreement_score":0.016066523,"about_ca_system_score_codex":0.002020021,"about_ca_system_score_gemma":0.0019137128,"threshold_uncertainty_score":0.031946003},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012388286,0.0007584925,0.9759996,0.00020562344,0.0001065834,0.0001597658,0.00025318176,0.0022854176,0.007843046],"genre_scores_gemma":[0.24812914,0.0015487657,0.73968214,0.00015922722,0.00006254974,0.00073308765,0.0015108086,0.0002443761,0.00792988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990816,0.00016909682,0.00009756548,0.00020287014,0.00038103832,0.00006791916],"domain_scores_gemma":[0.9994241,0.00012665955,0.000031660693,0.00008915582,0.00029137044,0.000036965394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009143449,0.00054426177,0.0010505564,0.0015050784,0.0007828563,0.0018166362,0.002119621,0.00080521073,0.0045260917],"category_scores_gemma":[0.0017280015,0.0005873991,0.000999097,0.0020022478,0.00031836602,0.0013125613,0.0008778073,0.00068987446,0.0009364055],"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.00025922386,0.00021210346,0.005193773,0.00054287765,0.00020471789,0.00039773423,0.0003722631,0.478553,0.018314112,0.038254026,0.012316547,0.4453797],"study_design_scores_gemma":[0.00007137064,0.00005330925,0.0007542373,0.000021893413,0.0000470039,0.00015853971,0.00005888092,0.96493053,0.008408691,0.0046857083,0.020779248,0.000030574356],"about_ca_topic_score_codex":0.008690906,"about_ca_topic_score_gemma":0.0039134645,"teacher_disagreement_score":0.008690906,"about_ca_system_score_codex":0.000807883,"about_ca_system_score_gemma":0.0018151572,"threshold_uncertainty_score":0.017280638},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032453954,0.00035770968,0.9870331,0.0013948471,0.00006497674,0.000066507084,0.00024185481,0.00064143015,0.006954291],"genre_scores_gemma":[0.26897997,0.0009600027,0.71684027,0.0010339833,0.00048008215,0.00029368448,0.0010710616,0.00074143085,0.009599528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99384815,0.002244241,0.0006087357,0.0010075795,0.0017883583,0.0005029115],"domain_scores_gemma":[0.98416686,0.0103939595,0.00044164006,0.003149243,0.0015395845,0.00030877543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056627453,0.0007568366,0.0013433299,0.002734152,0.0016117609,0.0071900054,0.004697509,0.0023893893,0.008645183],"category_scores_gemma":[0.020503432,0.0015505953,0.003073223,0.003925713,0.007281129,0.018477686,0.0047116405,0.0054328353,0.0012951073],"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.000049751376,0.000031104173,0.00018129182,0.000121462755,0.000033541048,0.00009508116,0.0006884625,0.01167857,0.0005695267,0.9570836,0.0020598916,0.027407732],"study_design_scores_gemma":[0.000017741055,0.000021644351,0.00010122388,0.000051105908,0.000054543936,0.00007872903,0.00020492372,0.06043641,0.0019629488,0.9276212,0.009427665,0.000021928348],"about_ca_topic_score_codex":0.009846894,"about_ca_topic_score_gemma":0.0058083693,"teacher_disagreement_score":0.009846894,"about_ca_system_score_codex":0.0024905826,"about_ca_system_score_gemma":0.002252051,"threshold_uncertainty_score":0.029947758},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0137999235,0.00029513217,0.9744892,0.0003681538,0.000034764773,0.00010110012,0.0002410559,0.0009075275,0.009763095],"genre_scores_gemma":[0.32477722,0.00045475896,0.667908,0.00014996088,0.000037791826,0.0002807245,0.00050318294,0.00020262365,0.005685756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922645,0.00028081113,0.000054615088,0.00010488412,0.0002552329,0.00007797285],"domain_scores_gemma":[0.99884725,0.00088309916,0.000060270966,0.00008458233,0.000077866884,0.00004687077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010656883,0.0005966489,0.00047290698,0.00068866776,0.0006625664,0.0017284177,0.0011295016,0.0007096792,0.0059123863],"category_scores_gemma":[0.0033013616,0.0004835475,0.0010886556,0.0009375652,0.0017427083,0.0018024626,0.0017317474,0.0014066483,0.00046462208],"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.00008215445,0.000053108706,0.00031023132,0.00027119817,0.00004259451,0.00027534767,0.00031224822,0.5295547,0.0019818095,0.4189562,0.0033437507,0.04481661],"study_design_scores_gemma":[0.000033878256,0.000017297149,0.000066840184,0.000030038866,0.00001446734,0.00004726476,0.00009202094,0.8380362,0.0013191439,0.15361616,0.006715173,0.000011603724],"about_ca_topic_score_codex":0.009032362,"about_ca_topic_score_gemma":0.013503897,"teacher_disagreement_score":0.009032362,"about_ca_system_score_codex":0.0016647213,"about_ca_system_score_gemma":0.0020824564,"threshold_uncertainty_score":0.019778907},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0137999235,0.00029513217,0.9744892,0.0003681538,0.000034764773,0.00010110012,0.0002410559,0.0009075275,0.009763095],"genre_scores_gemma":[0.32477722,0.00045475896,0.667908,0.00014996088,0.000037791826,0.0002807245,0.00050318294,0.00020262365,0.005685756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922645,0.00028081113,0.000054615088,0.00010488412,0.0002552329,0.00007797285],"domain_scores_gemma":[0.99884725,0.00088309916,0.000060270966,0.00008458233,0.000077866884,0.00004687077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010656883,0.0005966489,0.00047290698,0.00068866776,0.0006625664,0.0017284177,0.0011295016,0.0007096792,0.0059123863],"category_scores_gemma":[0.0033013616,0.0004835475,0.0010886556,0.0009375652,0.0017427083,0.0018024626,0.0017317474,0.0014066483,0.00046462208],"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.00008215445,0.000053108706,0.00031023132,0.00027119817,0.00004259451,0.00027534767,0.00031224822,0.5295547,0.0019818095,0.4189562,0.0033437507,0.04481661],"study_design_scores_gemma":[0.000033878256,0.000017297149,0.000066840184,0.000030038866,0.00001446734,0.00004726476,0.00009202094,0.8380362,0.0013191439,0.15361616,0.006715173,0.000011603724],"about_ca_topic_score_codex":0.009032362,"about_ca_topic_score_gemma":0.013503897,"teacher_disagreement_score":0.009032362,"about_ca_system_score_codex":0.0016647213,"about_ca_system_score_gemma":0.0020824564,"threshold_uncertainty_score":0.019778907},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31975654,0.00027359303,0.67386293,0.00040407444,0.0000477043,0.00076111435,0.00047391173,0.0012664708,0.003153722],"genre_scores_gemma":[0.7172686,0.00009334251,0.28063816,0.00006416248,0.00001066993,0.0008904558,0.00053313567,0.00020412431,0.00029735325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929912,0.00486122,0.0005050549,0.00062000804,0.0007650256,0.00025745912],"domain_scores_gemma":[0.9742552,0.021066148,0.0011816925,0.001588958,0.0016997444,0.00020821224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022937823,0.0015812764,0.0019582356,0.0023992097,0.00083688856,0.0028919326,0.0021026796,0.0020658397,0.0020512296],"category_scores_gemma":[0.036444772,0.0006350003,0.0027030983,0.0015537492,0.0008713615,0.0034310906,0.0029052747,0.0017779337,0.00014653786],"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.00030823576,0.00032060372,0.003062128,0.00022640999,0.0002229668,0.0000613553,0.0003627768,0.96359897,0.0031998763,0.006794623,0.00024719865,0.021594882],"study_design_scores_gemma":[0.000053035306,0.00012228187,0.00076831586,0.000018555655,0.00003221795,0.000005295871,0.00007988222,0.9937714,0.0015959648,0.0032726433,0.00025806442,0.000022281378],"about_ca_topic_score_codex":0.010261718,"about_ca_topic_score_gemma":0.005231553,"teacher_disagreement_score":0.022937823,"about_ca_system_score_codex":0.0025924954,"about_ca_system_score_gemma":0.0024190075,"threshold_uncertainty_score":0.12130821},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025920743,0.013584919,0.06630068,0.122771055,0.023457894,0.000659871,0.009611927,0.002784901,0.734908],"genre_scores_gemma":[0.44548362,0.0100238435,0.09698262,0.044960503,0.004773952,0.0021246527,0.029127767,0.004430778,0.36209238],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99276537,0.0017847487,0.00019954973,0.0006610802,0.0035591281,0.0010301758],"domain_scores_gemma":[0.98747253,0.0028971338,0.00034145714,0.00093635434,0.0051510846,0.003201347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014213276,0.0013458994,0.0007521951,0.0021556704,0.0028814496,0.008600101,0.0028004982,0.0035804368,0.04089452],"category_scores_gemma":[0.011660103,0.0004348663,0.0010846324,0.0034282631,0.0025266837,0.0040384806,0.0042114803,0.005843705,0.00786629],"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.00023897401,0.00020033059,0.0005036493,0.00014752924,0.00003804016,0.00009391491,0.00012434622,0.010773242,0.00035671907,0.12403847,0.7488708,0.114613965],"study_design_scores_gemma":[0.00005821953,0.00011037741,0.0009182609,0.00018604362,0.000011512356,0.00006203734,0.00028851628,0.0080373995,0.00077482074,0.026817456,0.9626961,0.000039367464],"about_ca_topic_score_codex":0.061154023,"about_ca_topic_score_gemma":0.059593648,"teacher_disagreement_score":0.061154023,"about_ca_system_score_codex":0.011084938,"about_ca_system_score_gemma":0.021493569,"threshold_uncertainty_score":0.13680577},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076320213,0.00023866176,0.9889498,0.00064700475,0.000034910678,0.000087001084,0.00007496016,0.0002112469,0.0021244222],"genre_scores_gemma":[0.507349,0.00043353287,0.48582137,0.00061425735,0.00013687622,0.0007700084,0.00045860317,0.00038867843,0.004027657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978168,0.0011675252,0.00009034644,0.00042804767,0.0003187272,0.00017839242],"domain_scores_gemma":[0.987217,0.010780402,0.0006684218,0.00047992877,0.00053390936,0.00032029903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056949696,0.0017884806,0.0018385226,0.00073860836,0.00057583733,0.0018062149,0.0018803424,0.0024492564,0.008032918],"category_scores_gemma":[0.023742422,0.0013136237,0.0011870622,0.000708576,0.0022390224,0.0021102761,0.0029555524,0.0052655856,0.00090519205],"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.00007067041,0.00007176737,0.0005883071,0.00009721724,0.000031108906,0.00007320727,0.000078806144,0.93092024,0.00030809833,0.047864005,0.0016277067,0.01826895],"study_design_scores_gemma":[0.00001623998,0.000016703607,0.000032465854,0.000014236078,0.000003611217,0.0000076154893,0.0000073212173,0.9789519,0.00017797363,0.020412434,0.00035618173,0.000003437907],"about_ca_topic_score_codex":0.003149124,"about_ca_topic_score_gemma":0.004596708,"teacher_disagreement_score":0.008032918,"about_ca_system_score_codex":0.0020756342,"about_ca_system_score_gemma":0.0028073138,"threshold_uncertainty_score":0.030118227},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010663752,0.00005396187,0.00011228347,0.00012312633,0.00005320533,0.000036450052,0.9972996,0.00044125703,0.00081380474],"genre_scores_gemma":[0.0017037855,0.000024014158,0.0003081211,0.00005241334,0.000013675275,0.00014207464,0.9966569,0.000065908534,0.001033108],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99914443,0.0001449007,0.00011465015,0.00021487949,0.0002256899,0.00015534],"domain_scores_gemma":[0.9953584,0.0010566809,0.00033801227,0.001047808,0.0016468668,0.0005522097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014710608,0.002051616,0.0011678988,0.002956432,0.000673894,0.001740218,0.00303626,0.0020941044,0.044902056],"category_scores_gemma":[0.009164222,0.00043206583,0.0010453819,0.0028696284,0.00040685825,0.0010622011,0.0017118988,0.0018571862,0.05321579],"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.00024370055,0.00008748498,0.0040853093,0.0004324071,0.00004046779,0.000037382248,0.000032452685,0.00029269347,0.00010852787,0.00020668167,0.98978186,0.0046511004],"study_design_scores_gemma":[0.0014507696,0.00016405332,0.036313973,0.00044550322,0.00012190803,0.0002431437,0.00030845453,0.0021949965,0.0015069469,0.0021924276,0.9549802,0.00007774379],"about_ca_topic_score_codex":0.018821815,"about_ca_topic_score_gemma":0.043573834,"teacher_disagreement_score":0.044902056,"about_ca_system_score_codex":0.0010287723,"about_ca_system_score_gemma":0.0016658717,"threshold_uncertainty_score":0.15021235},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010663752,0.00005396187,0.00011228347,0.00012312633,0.00005320533,0.000036450052,0.9972996,0.00044125703,0.00081380474],"genre_scores_gemma":[0.0017037855,0.000024014158,0.0003081211,0.00005241334,0.000013675275,0.00014207464,0.9966569,0.000065908534,0.001033108],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99914443,0.0001449007,0.00011465015,0.00021487949,0.0002256899,0.00015534],"domain_scores_gemma":[0.9953584,0.0010566809,0.00033801227,0.001047808,0.0016468668,0.0005522097],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014710608,0.002051616,0.0011678988,0.002956432,0.000673894,0.001740218,0.00303626,0.0020941044,0.044902056],"category_scores_gemma":[0.009164222,0.00043206583,0.0010453819,0.0028696284,0.00040685825,0.0010622011,0.0017118988,0.0018571862,0.05321579],"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.00024370055,0.00008748498,0.0040853093,0.0004324071,0.00004046779,0.000037382248,0.000032452685,0.00029269347,0.00010852787,0.00020668167,0.98978186,0.0046511004],"study_design_scores_gemma":[0.0014507696,0.00016405332,0.036313973,0.00044550322,0.00012190803,0.0002431437,0.00030845453,0.0021949965,0.0015069469,0.0021924276,0.9549802,0.00007774379],"about_ca_topic_score_codex":0.018821815,"about_ca_topic_score_gemma":0.043573834,"teacher_disagreement_score":0.9550979,"about_ca_system_score_codex":0.0010287723,"about_ca_system_score_gemma":0.0016658717,"threshold_uncertainty_score":0.15021235},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015949481,0.000033186065,0.00012363252,0.000116442774,0.000024043356,0.00009235854,0.99672925,0.0001330015,0.0011530557],"genre_scores_gemma":[0.0026115116,0.000028514047,0.00033658865,0.00007369936,0.000011654062,0.00065456337,0.994207,0.00005800783,0.002018348],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992655,0.00013049244,0.00015964452,0.00014618557,0.00019034362,0.00010788674],"domain_scores_gemma":[0.99453306,0.0011725839,0.00053942046,0.00067384815,0.0026543713,0.00042668762],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017525135,0.0009791767,0.0009407654,0.0021497777,0.00054605235,0.0014375008,0.0022941171,0.0010880936,0.05615017],"category_scores_gemma":[0.010750797,0.00037448778,0.0009610833,0.002659583,0.00024028224,0.0010498785,0.0014916642,0.0013492075,0.044643387],"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.00033638452,0.00009925952,0.012053294,0.000392614,0.00005902879,0.00002240585,0.00005814906,0.00018782243,0.00006110946,0.000284349,0.9798821,0.006563498],"study_design_scores_gemma":[0.0014683598,0.00014352839,0.18573393,0.00057406427,0.00017446802,0.00015333036,0.00048697,0.00094224006,0.0008355877,0.0022552565,0.8071349,0.00009747182],"about_ca_topic_score_codex":0.023975058,"about_ca_topic_score_gemma":0.046414837,"teacher_disagreement_score":0.9438498,"about_ca_system_score_codex":0.0013241898,"about_ca_system_score_gemma":0.0017859064,"threshold_uncertainty_score":0.187841},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007095625,0.00004500408,0.00007941068,0.000102091915,0.000042873748,0.000026689831,0.99803,0.00029924526,0.00066516886],"genre_scores_gemma":[0.0012035421,0.000021397822,0.0002285571,0.000041341314,0.000012143177,0.0001087737,0.9975128,0.0000453665,0.00082606374],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99904054,0.00014899008,0.00013308648,0.00023714776,0.00026336472,0.00017692873],"domain_scores_gemma":[0.99527407,0.0009495774,0.00036424113,0.0010286752,0.0017950699,0.00058828277],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001438436,0.0021476,0.0013510744,0.0034946152,0.0007026457,0.0018787698,0.0032705346,0.002187606,0.049674973],"category_scores_gemma":[0.009239239,0.00047172597,0.001049641,0.0037375768,0.00040147567,0.001096891,0.001787029,0.0020263775,0.06032452],"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.00017628189,0.0000675957,0.0033691667,0.00033052792,0.000033259446,0.000033858934,0.000023288843,0.0002239268,0.000078266625,0.0001948765,0.99157166,0.003897274],"study_design_scores_gemma":[0.0011671359,0.00012752203,0.032747064,0.00043279392,0.000101308615,0.00023633531,0.00025994406,0.0017297738,0.0011299809,0.0021280001,0.95987,0.000070141235],"about_ca_topic_score_codex":0.019780401,"about_ca_topic_score_gemma":0.041142948,"teacher_disagreement_score":0.950325,"about_ca_system_score_codex":0.0011885965,"about_ca_system_score_gemma":0.0019661281,"threshold_uncertainty_score":0.16617936},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018248742,0.00018289963,0.9698603,0.0001336314,0.00007258889,0.00004523674,0.00006896569,0.003808998,0.0075786053],"genre_scores_gemma":[0.55421305,0.00015019522,0.43798426,0.00013252141,0.000038020127,0.00012973681,0.00020340201,0.00036825618,0.0067805876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998603,0.000024722089,0.000009220753,0.000040343864,0.000045016623,0.00002035485],"domain_scores_gemma":[0.9997296,0.0001093824,0.000013899651,0.00006439951,0.0000640458,0.000018716408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002870634,0.00048568586,0.000426845,0.000341122,0.00036889457,0.0007735153,0.0014572096,0.0007763854,0.006690604],"category_scores_gemma":[0.0011103294,0.00037431484,0.00040538923,0.0004015377,0.00057272916,0.00081969815,0.0010259632,0.0011365872,0.0011656715],"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.00011698152,0.0000890514,0.0004217052,0.00009481099,0.00007127448,0.0001109267,0.00013475513,0.57976156,0.034400873,0.024272481,0.0031993263,0.35732618],"study_design_scores_gemma":[0.000007928808,0.000021032476,0.00006151056,0.000004138457,0.000011610087,0.000016321277,0.0000064457504,0.99024117,0.003358611,0.0050085103,0.0012586638,0.0000040665127],"about_ca_topic_score_codex":0.005135341,"about_ca_topic_score_gemma":0.009314821,"teacher_disagreement_score":0.006690604,"about_ca_system_score_codex":0.00057122036,"about_ca_system_score_gemma":0.0007649762,"threshold_uncertainty_score":0.02238226},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068856813,0.00033937758,0.98494154,0.00053068023,0.000059475264,0.00006791575,0.00024155872,0.0007932418,0.006140525],"genre_scores_gemma":[0.31641346,0.00087405846,0.67418903,0.00035632495,0.0000708452,0.00048765758,0.0010070881,0.00020609217,0.006395444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999678,0.00010504867,0.000023999886,0.00008745586,0.00008566434,0.00001990156],"domain_scores_gemma":[0.9988117,0.0007388764,0.00009476039,0.00016614179,0.00014457821,0.00004396131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073243916,0.00053952617,0.00029959664,0.00055306003,0.00034978706,0.00082362036,0.0009261029,0.00077387074,0.0070988755],"category_scores_gemma":[0.004117818,0.00034874122,0.0005818684,0.00063260365,0.0010057344,0.00172145,0.00087194954,0.0019112091,0.0007654494],"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.00005152994,0.000047752037,0.00059345766,0.00016717386,0.00003496473,0.000049042177,0.00009004766,0.70403814,0.0018836255,0.14646633,0.0034993542,0.14307863],"study_design_scores_gemma":[0.0000061683468,0.000010768903,0.0000791874,0.000019571507,0.000005417853,0.000012720627,0.000009353277,0.91563815,0.0007038208,0.08036729,0.003143522,0.000004023132],"about_ca_topic_score_codex":0.0058560204,"about_ca_topic_score_gemma":0.00829032,"teacher_disagreement_score":0.0070988755,"about_ca_system_score_codex":0.0013959495,"about_ca_system_score_gemma":0.0011961978,"threshold_uncertainty_score":0.02374816},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068856813,0.00033937758,0.98494154,0.00053068023,0.000059475264,0.00006791575,0.00024155872,0.0007932418,0.006140525],"genre_scores_gemma":[0.31641346,0.00087405846,0.67418903,0.00035632495,0.0000708452,0.00048765758,0.0010070881,0.00020609217,0.006395444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999678,0.00010504867,0.000023999886,0.00008745586,0.00008566434,0.00001990156],"domain_scores_gemma":[0.9988117,0.0007388764,0.00009476039,0.00016614179,0.00014457821,0.00004396131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073243916,0.00053952617,0.00029959664,0.00055306003,0.00034978706,0.00082362036,0.0009261029,0.00077387074,0.0070988755],"category_scores_gemma":[0.004117818,0.00034874122,0.0005818684,0.00063260365,0.0010057344,0.00172145,0.00087194954,0.0019112091,0.0007654494],"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.00005152994,0.000047752037,0.00059345766,0.00016717386,0.00003496473,0.000049042177,0.00009004766,0.70403814,0.0018836255,0.14646633,0.0034993542,0.14307863],"study_design_scores_gemma":[0.0000061683468,0.000010768903,0.0000791874,0.000019571507,0.000005417853,0.000012720627,0.000009353277,0.91563815,0.0007038208,0.08036729,0.003143522,0.000004023132],"about_ca_topic_score_codex":0.0058560204,"about_ca_topic_score_gemma":0.00829032,"teacher_disagreement_score":0.0070988755,"about_ca_system_score_codex":0.0013959495,"about_ca_system_score_gemma":0.0011961978,"threshold_uncertainty_score":0.02374816},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2843129,0.014572029,0.1423636,0.35965383,0.0043714046,0.0013478119,0.00062843045,0.0028195984,0.18993033],"genre_scores_gemma":[0.84334564,0.0075113904,0.08985422,0.009826113,0.00071077317,0.0005007111,0.0005747791,0.00017172233,0.047504656],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9945903,0.0020396018,0.00022897517,0.000550677,0.0012721875,0.0013183688],"domain_scores_gemma":[0.9894853,0.0013810894,0.00078348164,0.0007112643,0.0038474062,0.003791538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005627273,0.00080660224,0.0003751912,0.0012478052,0.003979351,0.0061408854,0.004910907,0.0026829038,0.012004556],"category_scores_gemma":[0.008053012,0.00048212902,0.00031515464,0.0016285131,0.002182701,0.0055015488,0.0041716387,0.0052819103,0.001628517],"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.00036300326,0.002174929,0.03968663,0.0020270124,0.000071218295,0.0006537855,0.014117007,0.016656382,0.0065816026,0.11873431,0.068780154,0.73015404],"study_design_scores_gemma":[0.0001694506,0.001126953,0.06766083,0.0026011062,0.000046363315,0.0010700155,0.05418191,0.03160682,0.007660534,0.054673374,0.77893007,0.00027250807],"about_ca_topic_score_codex":0.03181913,"about_ca_topic_score_gemma":0.06459591,"teacher_disagreement_score":0.03181913,"about_ca_system_score_codex":0.008576358,"about_ca_system_score_gemma":0.020176148,"threshold_uncertainty_score":0.06326783},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042867124,0.00008616017,0.94962054,0.0002731449,0.000025500787,0.00006203382,0.000037468755,0.0013476729,0.005680331],"genre_scores_gemma":[0.8686908,0.00007361521,0.12916796,0.000083410996,0.000010925658,0.00007995414,0.000041873063,0.00006915562,0.0017823108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998305,0.00004760555,0.000007134498,0.00003098878,0.00004907017,0.000034661927],"domain_scores_gemma":[0.99927515,0.0004360647,0.000087555025,0.00006211294,0.00008960407,0.0000495854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004916579,0.0005074447,0.00033917968,0.0003093598,0.00023340185,0.00053491484,0.0010558829,0.00057958986,0.0029448366],"category_scores_gemma":[0.001713381,0.00024227718,0.0002583998,0.00016565135,0.0009070854,0.00072389457,0.0006826837,0.0008911314,0.00026874305],"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.00004105892,0.00003590333,0.00037934817,0.0000261075,0.0000110104,0.000041647952,0.000043015756,0.9628998,0.002636441,0.0072717383,0.00032122558,0.026292631],"study_design_scores_gemma":[0.000004599052,0.000012699201,0.000022177623,0.0000019707181,0.0000018655945,0.0000038214553,0.0000032480805,0.9977016,0.0004850103,0.001610749,0.00015082724,0.0000014500861],"about_ca_topic_score_codex":0.005311545,"about_ca_topic_score_gemma":0.005298614,"teacher_disagreement_score":0.005311545,"about_ca_system_score_codex":0.0007106518,"about_ca_system_score_gemma":0.0014642251,"threshold_uncertainty_score":0.010561287},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11089398,0.0033374054,0.7873958,0.041451745,0.00031153686,0.00018816668,0.00025859525,0.0005243873,0.05563852],"genre_scores_gemma":[0.90066886,0.00081418856,0.09526095,0.0005248208,0.00014766169,0.00019256493,0.00022343185,0.000101925485,0.002065655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9910052,0.006223965,0.00035437205,0.0007284064,0.0013492,0.0003387994],"domain_scores_gemma":[0.9434791,0.04294114,0.0032280076,0.007001822,0.0020362418,0.0013135379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010117548,0.0011601913,0.00087419985,0.0019016204,0.0011178949,0.008606702,0.0042827344,0.0038011486,0.0070942044],"category_scores_gemma":[0.067303665,0.001324188,0.0013260937,0.0014331623,0.008814379,0.021557154,0.0045208028,0.005846711,0.0007015009],"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.00018926243,0.00010687486,0.0024965112,0.00036841826,0.000121200974,0.00018471832,0.0021963518,0.028393747,0.0004800161,0.9034595,0.002279249,0.059724186],"study_design_scores_gemma":[0.00003845485,0.000013894139,0.00026818804,0.000059928167,0.000032094125,0.000052987787,0.0003343245,0.044828776,0.00037626378,0.9522599,0.0017192129,0.000016077383],"about_ca_topic_score_codex":0.0024862376,"about_ca_topic_score_gemma":0.002687055,"teacher_disagreement_score":0.010117548,"about_ca_system_score_codex":0.0027148086,"about_ca_system_score_gemma":0.0029743835,"threshold_uncertainty_score":0.053507328},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8037946,0.000058251422,0.19011328,0.0002690189,0.000020272893,0.0001058697,0.00013849807,0.00021153668,0.005288546],"genre_scores_gemma":[0.9856044,0.000029874725,0.013517956,0.000017133505,0.0000037752677,0.00006130585,0.00005489764,0.000008887678,0.0007017285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998086,0.00006734453,0.000009523117,0.000037859307,0.000038360853,0.0000383278],"domain_scores_gemma":[0.99874794,0.00076979765,0.00012362964,0.0000963887,0.00019008962,0.000072125185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005763513,0.00049894856,0.0003052261,0.00048095192,0.00035323968,0.0009858866,0.0010330811,0.0006344495,0.0012129412],"category_scores_gemma":[0.0030714015,0.00029549078,0.00059393625,0.00026766447,0.0005429157,0.0006526324,0.0004279997,0.0006035891,0.00011979661],"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.000038777063,0.000056949855,0.00225008,0.000011357289,0.000014927921,0.000026325199,0.00009979791,0.9912976,0.000674323,0.0015010765,0.00006458793,0.0039642085],"study_design_scores_gemma":[0.000003029195,0.000013347018,0.0005999956,0.0000013537172,0.000003503695,0.0000042361053,0.00001174131,0.99841905,0.00012787191,0.0007766271,0.00003641806,0.000002793139],"about_ca_topic_score_codex":0.03430057,"about_ca_topic_score_gemma":0.022503288,"teacher_disagreement_score":0.03430057,"about_ca_system_score_codex":0.0013131909,"about_ca_system_score_gemma":0.0014809917,"threshold_uncertainty_score":0.06820184},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016047856,0.000057827314,0.9812137,0.00010779729,0.00002004276,0.0000313851,0.000016263473,0.001405864,0.0010993363],"genre_scores_gemma":[0.83867544,0.00007459289,0.15984334,0.00009243896,0.00001446674,0.00008257129,0.00005875739,0.00014201217,0.0010163302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994954,0.000074027244,0.00002054128,0.00016314887,0.00017968759,0.00006724463],"domain_scores_gemma":[0.9989685,0.00050780055,0.00013456118,0.00015815692,0.00014159219,0.00008942097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072754064,0.00070312695,0.00056845613,0.00029605418,0.0006356076,0.0010412486,0.0013655461,0.0010319897,0.0016419229],"category_scores_gemma":[0.0028206194,0.00044157988,0.00041968573,0.00019619425,0.0018131628,0.0017008035,0.0020931202,0.0018408019,0.0003862589],"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.00035214255,0.00021573908,0.0012852433,0.0002053996,0.000049698556,0.00031618055,0.0009685445,0.78794485,0.05788861,0.038710617,0.0016457415,0.11041731],"study_design_scores_gemma":[0.000015299698,0.00006805519,0.0001984458,0.000008647956,0.000007394105,0.000031685024,0.000033194,0.9789702,0.005680929,0.014006445,0.0009681083,0.000011510178],"about_ca_topic_score_codex":0.0052729235,"about_ca_topic_score_gemma":0.0045343577,"teacher_disagreement_score":0.0052729235,"about_ca_system_score_codex":0.0006572379,"about_ca_system_score_gemma":0.002050048,"threshold_uncertainty_score":0.010484457},"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":"software","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068458594,0.010138213,0.1808027,0.09150975,0.061446432,0.0014726134,0.023500472,0.37845284,0.18421842],"genre_scores_gemma":[0.25557595,0.0050716684,0.30849245,0.022830818,0.014634916,0.00075057754,0.041386668,0.10414926,0.24710777],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9877796,0.0030816826,0.0011863231,0.0013722405,0.005717843,0.00086223177],"domain_scores_gemma":[0.9203687,0.028600987,0.0025051252,0.023075974,0.017999545,0.0074496903],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.011972041,0.0019624478,0.002507354,0.008307022,0.0045810863,0.013855222,0.0047003324,0.0037111014,0.1254269],"category_scores_gemma":[0.11246569,0.0016002594,0.0018621864,0.010986653,0.0020603146,0.014417602,0.007328833,0.0041694148,0.10063077],"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.0010140187,0.0002892021,0.0017175886,0.0003976927,0.00009046159,0.000265688,0.0006240379,0.0011450137,0.0039990274,0.004608756,0.7050776,0.28077084],"study_design_scores_gemma":[0.001184991,0.0008617664,0.0035655613,0.00038450267,0.00035439007,0.001211231,0.0019335807,0.04177569,0.032560058,0.06608773,0.84968424,0.0003962158],"about_ca_topic_score_codex":0.002920442,"about_ca_topic_score_gemma":0.00433502,"teacher_disagreement_score":0.8745731,"about_ca_system_score_codex":0.0012148103,"about_ca_system_score_gemma":0.005410961,"threshold_uncertainty_score":0.41959476},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011050062,0.0050049894,0.7607552,0.0030005905,0.0008862808,0.00007370151,0.0003441833,0.0010958445,0.21778913],"genre_scores_gemma":[0.23517518,0.004782419,0.5820135,0.00087719836,0.00027162198,0.00023059118,0.00059938565,0.0008492357,0.17520091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997191,0.00007040545,0.00002096804,0.00007409637,0.00008690721,0.00002851528],"domain_scores_gemma":[0.9997422,0.00017391585,0.000012588766,0.000024869272,0.000024706631,0.000021747954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005592683,0.00063417776,0.00047785565,0.00051087135,0.00096265087,0.0017314522,0.0009172003,0.0006778202,0.011852032],"category_scores_gemma":[0.0013693568,0.0006013566,0.00065386324,0.00095570507,0.0015570675,0.0025762024,0.0012186924,0.0017693504,0.0019196816],"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.00006365177,0.000029691435,0.00011824746,0.00010996172,0.000012616296,0.00006656083,0.00030427118,0.057503846,0.0007940432,0.8745938,0.01184701,0.05455632],"study_design_scores_gemma":[0.000015277228,0.000018429786,0.000103992395,0.00006331016,0.00002000277,0.000041361134,0.00007473944,0.1122737,0.001213896,0.8078981,0.07825041,0.000026877371],"about_ca_topic_score_codex":0.0061615533,"about_ca_topic_score_gemma":0.01052862,"teacher_disagreement_score":0.011852032,"about_ca_system_score_codex":0.001509768,"about_ca_system_score_gemma":0.0012558624,"threshold_uncertainty_score":0.03964895},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01946552,0.00083633926,0.97374535,0.00032363372,0.000077453435,0.00006511109,0.00015045113,0.00036718877,0.0049689002],"genre_scores_gemma":[0.4888681,0.0009919502,0.4991387,0.00032668508,0.00018045056,0.0003430353,0.0008964027,0.00027412636,0.00898059],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992994,0.0002238607,0.00004336833,0.00011471705,0.00023955578,0.00007908002],"domain_scores_gemma":[0.99758136,0.0015347095,0.000120205776,0.00027199351,0.00042185432,0.00006982514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011475179,0.0006717226,0.0010844613,0.0009258068,0.00049730187,0.0009125898,0.0015377545,0.0011856994,0.00452272],"category_scores_gemma":[0.006840667,0.0006475161,0.00051807775,0.0009972284,0.00070385437,0.0015412743,0.0011515717,0.0021062063,0.00051529147],"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.00014580502,0.00009276367,0.000486345,0.00014532582,0.00007707677,0.00009221011,0.00006675937,0.75653344,0.0026301595,0.053086463,0.005432817,0.1812109],"study_design_scores_gemma":[0.000010823184,0.000016918035,0.000080047204,0.0000161215,0.00000951135,0.000012738096,0.0000047663107,0.9720008,0.0007167329,0.026367879,0.0007609603,0.0000027681926],"about_ca_topic_score_codex":0.0047368747,"about_ca_topic_score_gemma":0.010157982,"teacher_disagreement_score":0.0047368747,"about_ca_system_score_codex":0.0009533937,"about_ca_system_score_gemma":0.0012761246,"threshold_uncertainty_score":0.015129983},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038327107,0.00028052396,0.9946688,0.00015587475,0.000033742508,0.00002142167,0.00012182542,0.0003602906,0.00052485056],"genre_scores_gemma":[0.44195265,0.001072511,0.54538333,0.000773881,0.00023126071,0.00037981677,0.0026620775,0.00054699404,0.0069973683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916935,0.00029862273,0.000047199883,0.0002369039,0.00017766411,0.00007025891],"domain_scores_gemma":[0.9979,0.0012572114,0.00016527426,0.00029648453,0.00030405895,0.00007693616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019828111,0.0009352147,0.0011573524,0.000478957,0.00033098442,0.0011903119,0.0023269807,0.0013879694,0.0026590494],"category_scores_gemma":[0.005532294,0.00070800964,0.0013994784,0.0007996194,0.00084201386,0.0019455734,0.0019055658,0.0026165608,0.0010187698],"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.00023659425,0.00012608244,0.0024272313,0.0002449198,0.00020864244,0.00019032852,0.0001991556,0.6852841,0.0057229176,0.024469076,0.009472702,0.2714182],"study_design_scores_gemma":[0.0000033014594,0.00001275517,0.000092637434,0.0000051649304,0.0000047147846,0.000018853221,0.00000495406,0.9941999,0.0005709614,0.0044572176,0.0006240317,0.000005559301],"about_ca_topic_score_codex":0.0030548107,"about_ca_topic_score_gemma":0.0043541985,"teacher_disagreement_score":0.0030548107,"about_ca_system_score_codex":0.00066981727,"about_ca_system_score_gemma":0.001036495,"threshold_uncertainty_score":0.010486245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040707387,0.00011308275,0.95671093,0.0001944218,0.00001842142,0.00006560218,0.00011384801,0.00044545846,0.0016308846],"genre_scores_gemma":[0.7258647,0.00025149103,0.27202198,0.0000754258,0.000019054722,0.00016280667,0.00044611853,0.00007025036,0.0010881834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989458,0.00036265826,0.0000976805,0.00033882848,0.00018917557,0.000065896806],"domain_scores_gemma":[0.98974586,0.007695143,0.00048660385,0.0011340376,0.0006934776,0.0002447939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022859625,0.0005460118,0.0005144449,0.0006317021,0.00031953762,0.0021054058,0.0020781693,0.00077472365,0.0036552935],"category_scores_gemma":[0.016607875,0.0006465923,0.000952341,0.00069889746,0.0012543316,0.0060306434,0.002144903,0.0021636125,0.00031381028],"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.00042713204,0.0003099817,0.0067558005,0.00033994587,0.00021614807,0.00025622253,0.0014815346,0.4850574,0.0046073105,0.21571808,0.0013107556,0.2835197],"study_design_scores_gemma":[0.00004132522,0.00006109446,0.00038669494,0.000029654542,0.000038875245,0.00003493942,0.00012643212,0.87981415,0.0025801922,0.11580989,0.0010612936,0.000015423959],"about_ca_topic_score_codex":0.0026803203,"about_ca_topic_score_gemma":0.0040927045,"teacher_disagreement_score":0.0036552935,"about_ca_system_score_codex":0.0010020573,"about_ca_system_score_gemma":0.0012039657,"threshold_uncertainty_score":0.012228131},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003298509,0.0007010227,0.9889802,0.00026350925,0.000041952317,0.000011689467,0.000027567736,0.00018870775,0.0064867986],"genre_scores_gemma":[0.21938914,0.0016342719,0.763136,0.0001360556,0.00012186622,0.00009923568,0.00014472552,0.00016590093,0.015172826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997323,0.000091991664,0.000013512701,0.00005795825,0.00008677759,0.000017502702],"domain_scores_gemma":[0.9988777,0.00087111304,0.00003252423,0.000099356854,0.000087532724,0.000031772623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008368463,0.0004128912,0.00050541613,0.0005532364,0.0004692945,0.0017051965,0.0020054164,0.0010233778,0.003410099],"category_scores_gemma":[0.0031022013,0.00045433672,0.00054915954,0.0010043461,0.0016256457,0.0029797475,0.0009873633,0.0020906148,0.00047685462],"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.000059767073,0.000068868154,0.0004618653,0.00018119441,0.000047135763,0.000073423675,0.0007721253,0.16812247,0.0020107538,0.5881513,0.00470104,0.23535019],"study_design_scores_gemma":[0.000008363604,0.00001776017,0.000101770696,0.000029478406,0.00001906288,0.000028724471,0.000060668026,0.61961323,0.0013031104,0.37081575,0.007990093,0.000011991283],"about_ca_topic_score_codex":0.0038513257,"about_ca_topic_score_gemma":0.0050671645,"teacher_disagreement_score":0.0038513257,"about_ca_system_score_codex":0.00060517667,"about_ca_system_score_gemma":0.00065341097,"threshold_uncertainty_score":0.011407912},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051302515,0.00048760884,0.0011508393,0.00036440353,0.00025430092,0.00011601038,0.0008808858,0.0009637679,0.99526924],"genre_scores_gemma":[0.00073148066,0.00020709675,0.00050024374,0.00016194169,0.000049151382,0.000068236295,0.0005058562,0.00019055497,0.99758554],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990798,0.00007328156,0.00007384885,0.0003307483,0.0002422852,0.00020009482],"domain_scores_gemma":[0.9973773,0.0007728345,0.00017693547,0.0003412196,0.0005545057,0.00077717786],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0013357392,0.0033655313,0.0022056198,0.0036406242,0.0025996233,0.0046165106,0.0043822117,0.0069610854,0.98888844],"category_scores_gemma":[0.0019519076,0.0011065381,0.0016587032,0.0040881396,0.002715351,0.006375615,0.0034205008,0.0032752063,0.99169207],"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.0003636217,0.00027651695,0.0009156368,0.00081909815,0.00005662751,0.00031240995,0.00015947325,0.00065080967,0.0026027893,0.009656919,0.3023137,0.6818724],"study_design_scores_gemma":[0.000049353726,0.00013105384,0.00066535466,0.00041534612,0.000017896858,0.0002855412,0.00013873524,0.00038027143,0.00048327443,0.0009059702,0.99649954,0.000027683638],"about_ca_topic_score_codex":0.005333953,"about_ca_topic_score_gemma":0.0038583626,"teacher_disagreement_score":0.0111115575,"about_ca_system_score_codex":0.0015750088,"about_ca_system_score_gemma":0.0017113246,"threshold_uncertainty_score":0.015849292},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038104825,0.00050319923,0.9541668,0.0004919622,0.000062627594,0.000087885266,0.0000651111,0.0021463356,0.0043712878],"genre_scores_gemma":[0.7183628,0.0005751005,0.27527153,0.00036899146,0.00004052039,0.00012077569,0.00026465487,0.00017052141,0.0048250165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997936,0.000047969697,0.000010257341,0.00006619685,0.00005628028,0.000025759644],"domain_scores_gemma":[0.9996786,0.00010838271,0.000028410574,0.00007990573,0.000073768766,0.000031028278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005478786,0.000748718,0.00051820785,0.00037176657,0.000250328,0.0008602402,0.0014365709,0.0007278412,0.0018957703],"category_scores_gemma":[0.0010523325,0.0003284615,0.00075742137,0.00036558445,0.0007226473,0.0016484901,0.001287799,0.0015314346,0.00063193357],"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.00011016136,0.0001478416,0.0012366131,0.0001250668,0.00012613404,0.00011766621,0.00014793553,0.7936777,0.013120732,0.025659654,0.0026614598,0.16286904],"study_design_scores_gemma":[0.000004264772,0.000026678961,0.00010074125,0.0000045607817,0.000014469758,0.000018388962,0.0000058551714,0.9888004,0.00128108,0.008935997,0.0008033038,0.0000042962374],"about_ca_topic_score_codex":0.00342745,"about_ca_topic_score_gemma":0.004354693,"teacher_disagreement_score":0.00342745,"about_ca_system_score_codex":0.00065090926,"about_ca_system_score_gemma":0.00083565776,"threshold_uncertainty_score":0.0068150163},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033964522,0.00020024378,0.99069947,0.0002617229,0.00006310253,0.00007393845,0.00011509192,0.0007011369,0.004488898],"genre_scores_gemma":[0.17546012,0.00052848976,0.8183335,0.00027714184,0.00011138198,0.0005683467,0.0004103799,0.0003148171,0.0039957706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799573,0.00063481875,0.00020613952,0.0002979345,0.0006694633,0.00019591377],"domain_scores_gemma":[0.998412,0.0006760932,0.00016072074,0.00044845935,0.00020970994,0.00009296446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021151488,0.0009277716,0.0006587646,0.00090055785,0.0008765474,0.0022531964,0.0016394765,0.0009656648,0.004087],"category_scores_gemma":[0.0038338895,0.0007884154,0.002679803,0.00089014025,0.0034082963,0.0038348255,0.0027726265,0.004251146,0.00068622245],"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.000029422417,0.000022620436,0.00012482503,0.0001072463,0.00002526897,0.00020057736,0.0003474035,0.06523607,0.0018532205,0.91617936,0.000872298,0.015001578],"study_design_scores_gemma":[0.00004215476,0.000044279335,0.00008672739,0.000074052514,0.00004851326,0.00009505041,0.00006159407,0.22992532,0.0022267916,0.7437953,0.023568856,0.000031392432],"about_ca_topic_score_codex":0.005614731,"about_ca_topic_score_gemma":0.0058200755,"teacher_disagreement_score":0.005614731,"about_ca_system_score_codex":0.0024069645,"about_ca_system_score_gemma":0.0026632498,"threshold_uncertainty_score":0.017463863},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27140498,0.0011792384,0.69515425,0.0016439632,0.00022638311,0.00037895862,0.003601164,0.003754015,0.022657014],"genre_scores_gemma":[0.6660373,0.0002721463,0.32710168,0.00022495525,0.000039651637,0.00032376277,0.003704433,0.00044463226,0.0018514916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986411,0.00072203734,0.00006842872,0.0001996559,0.0002774169,0.00009141907],"domain_scores_gemma":[0.9882393,0.009987588,0.00026309496,0.0006559244,0.0006377969,0.00021635083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029691672,0.0009435571,0.00081920926,0.0010603485,0.0007308895,0.0012892134,0.0019588806,0.0016255674,0.0038902783],"category_scores_gemma":[0.013755783,0.00053533004,0.0008478073,0.0015256346,0.001216582,0.0013745767,0.001676481,0.0017271297,0.00042634705],"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.000120091805,0.00011436062,0.00061558373,0.000119926415,0.000028372506,0.000049273072,0.00007772551,0.95169026,0.0004508296,0.018254783,0.0036211552,0.024857592],"study_design_scores_gemma":[0.000014911424,0.000013363785,0.000041009916,0.000005736215,0.000002862428,0.000006045041,0.000013484741,0.9909729,0.00032925708,0.008249573,0.00034864878,0.000002295196],"about_ca_topic_score_codex":0.009136073,"about_ca_topic_score_gemma":0.013527332,"teacher_disagreement_score":0.009136073,"about_ca_system_score_codex":0.0017181729,"about_ca_system_score_gemma":0.0016213561,"threshold_uncertainty_score":0.018165827},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009535918,0.00058899005,0.96815443,0.003386987,0.00013168239,0.00009281162,0.000083119034,0.0009854782,0.017040629],"genre_scores_gemma":[0.24388504,0.0005754693,0.74724114,0.00073252147,0.0001313484,0.00036613204,0.00011356357,0.00033582613,0.0066189296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997701,0.0011165735,0.000110080204,0.00040501714,0.00042557262,0.00024175063],"domain_scores_gemma":[0.9971641,0.0015842507,0.00021275121,0.00044121852,0.0003307033,0.00026700736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004021882,0.0007188904,0.0008215217,0.0012297203,0.00212448,0.003802337,0.002203022,0.0023793785,0.004921399],"category_scores_gemma":[0.009964943,0.0008863216,0.001364716,0.0006907228,0.006373344,0.006953426,0.005913258,0.0033402343,0.0011592358],"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.000082269464,0.00007768152,0.0005127959,0.00016281806,0.000023391029,0.00015847394,0.0017218505,0.024860097,0.001770106,0.9237016,0.0026748765,0.04425411],"study_design_scores_gemma":[0.000043079886,0.00007767361,0.00019922976,0.000131636,0.00003928113,0.000086744774,0.00038167354,0.19978426,0.0012982886,0.7751911,0.022726672,0.00004022965],"about_ca_topic_score_codex":0.003751352,"about_ca_topic_score_gemma":0.0042877276,"teacher_disagreement_score":0.004921399,"about_ca_system_score_codex":0.0017109774,"about_ca_system_score_gemma":0.0037760914,"threshold_uncertainty_score":0.021269977},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022496896,0.00032634108,0.969041,0.00072985556,0.0000360319,0.0002021753,0.000052158557,0.0016391177,0.0054764724],"genre_scores_gemma":[0.3608613,0.00040156266,0.6353651,0.0002483192,0.000062429404,0.00030048934,0.00019939,0.0004578054,0.0021035352],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.991919,0.0047202744,0.00044838942,0.0013628072,0.0012696699,0.00027989017],"domain_scores_gemma":[0.9673951,0.025801506,0.001323429,0.0036851056,0.0014046971,0.00039005428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009453496,0.0013090171,0.0010503788,0.0012686163,0.001095918,0.0047720643,0.0018021351,0.0014450193,0.004371334],"category_scores_gemma":[0.036831625,0.0007037991,0.0008818447,0.0011606424,0.0021569899,0.005973452,0.004786305,0.0018983271,0.0016846916],"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.00048818282,0.0006989056,0.004413897,0.0013913993,0.00026605066,0.00041020082,0.0032152678,0.32768252,0.027500292,0.060530122,0.003316126,0.5700871],"study_design_scores_gemma":[0.00008000351,0.00019927396,0.0008124103,0.00010873485,0.00007577174,0.00013191305,0.000717361,0.81442857,0.019168524,0.14731893,0.016905801,0.000052739633],"about_ca_topic_score_codex":0.0017256564,"about_ca_topic_score_gemma":0.0024079564,"teacher_disagreement_score":0.009453496,"about_ca_system_score_codex":0.0014099678,"about_ca_system_score_gemma":0.0032531205,"threshold_uncertainty_score":0.049995422},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013732533,0.004459638,0.1806333,0.002049302,0.0017717455,0.00028078386,0.020698732,0.123809606,0.66492355],"genre_scores_gemma":[0.023623094,0.006328295,0.19920145,0.001968382,0.0013095966,0.0009780646,0.047155645,0.043293864,0.6761415],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994236,0.00005437882,0.000031081247,0.000112144124,0.00027893364,0.000099933095],"domain_scores_gemma":[0.99935955,0.00013166282,0.00001837925,0.00023546135,0.00018434135,0.000070709786],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00042504034,0.0018256675,0.0013231428,0.002378626,0.0016343887,0.0032499353,0.0024432682,0.00093580346,0.36784124],"category_scores_gemma":[0.0022636477,0.0011873348,0.0011987569,0.0039204727,0.0005602463,0.0036503717,0.002728611,0.0026077752,0.30744612],"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.00006761671,0.00006609019,0.00014049551,0.00034485754,0.000017143988,0.000056500077,0.000093180075,0.0013591966,0.0012518205,0.043768942,0.71059597,0.24223825],"study_design_scores_gemma":[0.00002669395,0.000011226826,0.00018405006,0.000083825355,0.000013194554,0.00008024932,0.000025410307,0.002325077,0.0013331729,0.044539325,0.9513563,0.000021424066],"about_ca_topic_score_codex":0.002808601,"about_ca_topic_score_gemma":0.0032410258,"teacher_disagreement_score":0.36784124,"about_ca_system_score_codex":0.0008753756,"about_ca_system_score_gemma":0.0013416378,"threshold_uncertainty_score":0.90169775},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064190645,0.00062650145,0.95242846,0.0009286908,0.00015968039,0.00007658919,0.00033227418,0.0007651878,0.038263414],"genre_scores_gemma":[0.45987585,0.0022264067,0.5042597,0.0006783306,0.00036924717,0.0003661103,0.0022943637,0.00043737277,0.029492568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796546,0.00062818034,0.0001642391,0.00033520596,0.00071472005,0.000192132],"domain_scores_gemma":[0.9980684,0.0010650778,0.000104946565,0.00035961086,0.00029575365,0.000106201456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001955921,0.0015478065,0.001079577,0.002593603,0.0012912663,0.004678242,0.0024948095,0.0014288852,0.0139498],"category_scores_gemma":[0.0057682754,0.0011974256,0.0027150654,0.002457218,0.0041515455,0.009863599,0.0031646339,0.004515589,0.002621259],"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.000012019272,0.000014852736,0.000064701824,0.000056891742,0.000016456088,0.000039436854,0.00019586411,0.0077183875,0.00015090338,0.98045474,0.0008911319,0.010384761],"study_design_scores_gemma":[0.000006240886,0.000004976607,0.000020838155,0.000017530258,0.000014288403,0.000012565609,0.000039614308,0.017143609,0.00020494686,0.9782632,0.0042670052,0.0000051605457],"about_ca_topic_score_codex":0.0068331,"about_ca_topic_score_gemma":0.0058320593,"teacher_disagreement_score":0.0139498,"about_ca_system_score_codex":0.0023477362,"about_ca_system_score_gemma":0.0019661777,"threshold_uncertainty_score":0.04666674},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023730205,0.0008643758,0.92690194,0.0005942672,0.00020615582,0.00035472828,0.00077452225,0.029344132,0.017229667],"genre_scores_gemma":[0.19773953,0.00032498292,0.79261655,0.00045053536,0.000052049207,0.00051991385,0.0022500092,0.0023554857,0.0036909545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884194,0.00027186208,0.000072651696,0.00030797962,0.00039740407,0.00010818558],"domain_scores_gemma":[0.99782795,0.0011713932,0.0001706505,0.0005028509,0.00025260734,0.00007442147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013136338,0.001639169,0.0009419427,0.0010498646,0.0007801128,0.0011493596,0.002181591,0.0015548998,0.009515185],"category_scores_gemma":[0.0067284238,0.0007684321,0.0013634819,0.0010701285,0.0012490102,0.0016985913,0.0021497048,0.0023572484,0.002050845],"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.00048714285,0.00018419843,0.0010308261,0.00044890452,0.00011214354,0.0001600063,0.00015168029,0.6674835,0.004052076,0.022182075,0.029338602,0.2743688],"study_design_scores_gemma":[0.00013730083,0.00011462203,0.00012635603,0.000028703455,0.000023361796,0.000085726446,0.00003251386,0.97438544,0.0022825354,0.01646173,0.0063036745,0.00001797726],"about_ca_topic_score_codex":0.009659609,"about_ca_topic_score_gemma":0.017507762,"teacher_disagreement_score":0.009659609,"about_ca_system_score_codex":0.0010875382,"about_ca_system_score_gemma":0.0031563097,"threshold_uncertainty_score":0.031831503},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033650067,0.00039825248,0.9543788,0.0006071076,0.0000758917,0.0001015828,0.00012179106,0.0051594647,0.0055070985],"genre_scores_gemma":[0.50157046,0.00023935625,0.49485275,0.00029078193,0.000030240762,0.00019513055,0.00029001865,0.00023874949,0.0022924866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997985,0.000056999066,0.00001302282,0.000054029024,0.00005332308,0.000024211207],"domain_scores_gemma":[0.9995993,0.00016523975,0.000044090186,0.0000900924,0.0000606273,0.000040657505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005138825,0.0007748928,0.00039749,0.0003559471,0.00029190612,0.0006220855,0.0013414801,0.00069588533,0.0023924182],"category_scores_gemma":[0.0016733563,0.00031012227,0.00052955264,0.0002936731,0.0006582726,0.0009923923,0.001105427,0.0011404923,0.00056554645],"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.00012297701,0.00014720639,0.0013084277,0.0002226724,0.00010853429,0.00015671444,0.00018276296,0.74284804,0.021905784,0.023934491,0.005411056,0.20365135],"study_design_scores_gemma":[0.00001988916,0.000041049414,0.000084194515,0.0000063149864,0.000015759284,0.00002097575,0.000013253827,0.9849001,0.0034257374,0.009707083,0.0017600573,0.0000055376454],"about_ca_topic_score_codex":0.0034742663,"about_ca_topic_score_gemma":0.0068105534,"teacher_disagreement_score":0.0034742663,"about_ca_system_score_codex":0.00075465225,"about_ca_system_score_gemma":0.0013441682,"threshold_uncertainty_score":0.008003414},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011432585,0.002419031,0.9683612,0.0022000566,0.00019172468,0.000044324905,0.00014900381,0.00009567087,0.015106384],"genre_scores_gemma":[0.81836915,0.0032929813,0.17328979,0.0005259249,0.0006709854,0.00024316688,0.00017420467,0.00018153193,0.003252124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966878,0.0017322849,0.00020913566,0.0003945406,0.00079524156,0.00018104534],"domain_scores_gemma":[0.98722535,0.009520867,0.0009297311,0.0012181684,0.000711673,0.00039420862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004726951,0.0011842212,0.0011536815,0.0023954178,0.0011182048,0.0038834675,0.0017496146,0.0015027955,0.0030974757],"category_scores_gemma":[0.017588595,0.0005282155,0.0017376976,0.0017066272,0.007257454,0.008253772,0.004278436,0.0031430256,0.00036265023],"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.000018823073,0.000014302409,0.00033471873,0.00010118958,0.000041232623,0.0000638104,0.00014129805,0.064183004,0.00045930914,0.92328924,0.0004330085,0.0109199695],"study_design_scores_gemma":[0.000004427024,0.000017209119,0.00016090617,0.000041195333,0.000009855109,0.0000327542,0.000026240345,0.09709434,0.00020059061,0.9003478,0.002045031,0.000019731104],"about_ca_topic_score_codex":0.0024270767,"about_ca_topic_score_gemma":0.0014577627,"teacher_disagreement_score":0.004726951,"about_ca_system_score_codex":0.0026366825,"about_ca_system_score_gemma":0.0016008834,"threshold_uncertainty_score":0.024998784},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076840534,0.0015270034,0.9543546,0.0025100969,0.00007660427,0.00009559812,0.00027198595,0.0005181315,0.032961868],"genre_scores_gemma":[0.27948606,0.0028003673,0.7037274,0.000912017,0.00021721976,0.00093174016,0.00079766335,0.00031046203,0.010817104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986785,0.00039024436,0.00010719702,0.00025817327,0.00042789304,0.00013799751],"domain_scores_gemma":[0.9989594,0.00035429455,0.000077965175,0.00033923064,0.00016482308,0.00010426697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017305376,0.00080240116,0.0007478401,0.0017718298,0.0016759001,0.005259537,0.0027678998,0.0018442299,0.004297845],"category_scores_gemma":[0.0020830322,0.0007131358,0.0014552404,0.0016635662,0.008045136,0.008658655,0.002972636,0.0030498046,0.0010171977],"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.0000020780324,0.0000029381008,0.000044890614,0.000020113464,0.0000039014567,0.000011817127,0.00009050528,0.003590886,0.000110528934,0.9937447,0.00029847227,0.0020791206],"study_design_scores_gemma":[0.0000074018094,0.000009856254,0.000070779235,0.000025938712,0.00000684374,0.000031049312,0.000046985384,0.029253941,0.00021034047,0.95343035,0.016895788,0.00001069365],"about_ca_topic_score_codex":0.008147093,"about_ca_topic_score_gemma":0.0055786795,"teacher_disagreement_score":0.008147093,"about_ca_system_score_codex":0.003509345,"about_ca_system_score_gemma":0.0027584762,"threshold_uncertainty_score":0.02546221},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029380713,0.00024762662,0.93226117,0.0052058445,0.00012484932,0.00007856761,0.00007852566,0.00072836643,0.031894304],"genre_scores_gemma":[0.8169822,0.00021467025,0.17740417,0.00080072,0.00006151538,0.00015257005,0.000084694635,0.00015251011,0.0041469024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980057,0.00094282633,0.000110504545,0.0003140521,0.00045351146,0.00017345423],"domain_scores_gemma":[0.9948348,0.0026958336,0.0004647001,0.00081066863,0.0006372949,0.0005568037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034909055,0.000562004,0.00036747393,0.000515484,0.001284767,0.003725326,0.0017950023,0.001789976,0.0024603747],"category_scores_gemma":[0.015447909,0.0005053703,0.00083537877,0.0003751708,0.0050610765,0.007174946,0.0031386467,0.003284046,0.00054922974],"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.00009456914,0.000034404868,0.0011994655,0.000063313564,0.000028813673,0.00029752863,0.002752282,0.044910036,0.0012065228,0.9257815,0.001575236,0.022056285],"study_design_scores_gemma":[0.0000261499,0.0000343242,0.00025847778,0.00003799607,0.000021596077,0.00009463,0.00034442803,0.14156817,0.0013409356,0.84633404,0.009902735,0.000036556463],"about_ca_topic_score_codex":0.0036375073,"about_ca_topic_score_gemma":0.002721354,"teacher_disagreement_score":0.003725326,"about_ca_system_score_codex":0.0018141493,"about_ca_system_score_gemma":0.0020930765,"threshold_uncertainty_score":0.018461943},"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":"protocol","genre_gemma":"methods","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018840071,0.11880863,0.17867945,0.042801354,0.062104765,0.3005804,0.20769948,0.010853527,0.07658841],"genre_scores_gemma":[0.019007511,0.06600657,0.35876748,0.011867396,0.007761999,0.4625351,0.049522504,0.003589211,0.02094226],"study_design_codex":"systematic_review","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.7554357,0.08018145,0.098893195,0.010311213,0.05271066,0.0024677587],"domain_scores_gemma":[0.49127725,0.23232101,0.069769986,0.031522345,0.16963093,0.005478521],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.11435372,0.0036335345,0.015001403,0.051032674,0.0030476376,0.01420651,0.013399416,0.010066334,0.14737827],"category_scores_gemma":[0.4996938,0.003329769,0.021111254,0.02811282,0.005005853,0.00717048,0.007824646,0.013389618,0.040637184],"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.0015146161,0.00014871739,0.00065360125,0.43675622,0.0045847776,0.00020212433,0.0005465729,0.001895635,0.00051274017,0.021210358,0.3712739,0.16070071],"study_design_scores_gemma":[0.0020825348,0.000400543,0.0021140908,0.3256162,0.005702694,0.0004724078,0.00043533585,0.0025768126,0.0009037668,0.06400599,0.59535414,0.00033546795],"about_ca_topic_score_codex":0.005185323,"about_ca_topic_score_gemma":0.0051548257,"teacher_disagreement_score":0.8856463,"about_ca_system_score_codex":0.012519204,"about_ca_system_score_gemma":0.03953186,"threshold_uncertainty_score":0.60476744},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04222691,0.00023857794,0.9530409,0.0001722061,0.000025294667,0.00006645356,0.000045064156,0.0013540112,0.0028305135],"genre_scores_gemma":[0.6328495,0.00020497046,0.36475182,0.00011764538,0.000024145216,0.00018862248,0.00023217738,0.0002694155,0.0013616559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991523,0.00029606637,0.00004395726,0.00014593168,0.00026398315,0.00009776473],"domain_scores_gemma":[0.9967686,0.0023314366,0.00021268305,0.00032502713,0.00025558844,0.00010669427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015234656,0.00096603844,0.0009013192,0.00065498933,0.0006154097,0.00082562526,0.0014653604,0.00081111514,0.0015358976],"category_scores_gemma":[0.0076173916,0.0007834201,0.0007477411,0.0007354032,0.0013113562,0.0014568877,0.0014660221,0.0016233395,0.00029173502],"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.00011025446,0.000048050715,0.0003889624,0.000048741167,0.00003085698,0.00006507973,0.00012760586,0.94250995,0.0014777674,0.009517256,0.000910469,0.044764955],"study_design_scores_gemma":[0.000019670011,0.000028484206,0.00006648729,0.0000041505405,0.000009263427,0.000013364036,0.000016889233,0.99190676,0.0005962606,0.00697765,0.0003562226,0.0000048693564],"about_ca_topic_score_codex":0.0107093165,"about_ca_topic_score_gemma":0.011183061,"teacher_disagreement_score":0.0107093165,"about_ca_system_score_codex":0.0010824584,"about_ca_system_score_gemma":0.0022940638,"threshold_uncertainty_score":0.021293938},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055492196,0.0074997805,0.88080525,0.011919935,0.00068752223,0.00017669715,0.00034925714,0.003415902,0.03965338],"genre_scores_gemma":[0.35912457,0.0036561566,0.6143606,0.0018313616,0.0002740225,0.00013054126,0.0004660484,0.00023924693,0.019917408],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992487,0.00015835388,0.000073326395,0.00013652077,0.0003223784,0.00006064044],"domain_scores_gemma":[0.99736816,0.0013017134,0.0001306759,0.0005151579,0.0004577425,0.00022658278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014117796,0.0004903196,0.00056591287,0.0010023688,0.0004920158,0.002648267,0.0011938858,0.001977536,0.00536735],"category_scores_gemma":[0.004144303,0.0004456972,0.00044224545,0.0008332037,0.0008687112,0.0049724947,0.001855731,0.0018268365,0.0015310374],"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.00046994214,0.0002813004,0.002356444,0.0005753504,0.000058883914,0.0006034223,0.0011273416,0.005513299,0.019684182,0.07831537,0.0144260125,0.87658846],"study_design_scores_gemma":[0.0004749657,0.0015421761,0.011684404,0.0009666987,0.00044641393,0.005987761,0.0019189699,0.17370802,0.076991834,0.3215273,0.40450615,0.0002452598],"about_ca_topic_score_codex":0.0007530474,"about_ca_topic_score_gemma":0.001106322,"teacher_disagreement_score":0.00536735,"about_ca_system_score_codex":0.0006035799,"about_ca_system_score_gemma":0.0009210795,"threshold_uncertainty_score":0.017955542},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01108061,0.00012822756,0.9689765,0.000271378,0.000028239294,0.000088667526,0.0002011967,0.004156897,0.015068269],"genre_scores_gemma":[0.13055052,0.00022712885,0.8593917,0.00013714322,0.000024402101,0.00017412349,0.00072895386,0.0004934776,0.008272621],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927837,0.00021678706,0.00006353167,0.00014550396,0.00021023308,0.000085581596],"domain_scores_gemma":[0.997846,0.0015706846,0.00005188524,0.00024686276,0.00019685144,0.00008772296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014937652,0.00083529047,0.0005685184,0.00067452184,0.00081225514,0.0018965191,0.0022682704,0.0013306633,0.014401389],"category_scores_gemma":[0.006912095,0.0005647005,0.00090456265,0.00092343794,0.0008809268,0.0033368578,0.0022479796,0.0021925734,0.0030382872],"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.0002731768,0.00022926852,0.0009880861,0.00036254572,0.000051329178,0.0001542004,0.0006189087,0.1329918,0.0021686214,0.16768694,0.016551686,0.67792344],"study_design_scores_gemma":[0.00007182878,0.000045820634,0.00028355644,0.0001041171,0.000042422205,0.00010336599,0.00011696346,0.6871806,0.006683896,0.2815247,0.023812722,0.00003008968],"about_ca_topic_score_codex":0.008352129,"about_ca_topic_score_gemma":0.010091044,"teacher_disagreement_score":0.014401389,"about_ca_system_score_codex":0.0011510333,"about_ca_system_score_gemma":0.0015993438,"threshold_uncertainty_score":0.04817742},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3991513,0.0013402493,0.57072973,0.000990059,0.0001262416,0.0001861951,0.005696725,0.016630292,0.005149221],"genre_scores_gemma":[0.8679723,0.00022279097,0.12633671,0.00009503526,0.000049753686,0.00020360314,0.0036397977,0.000599227,0.00088072015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998933,0.0002729354,0.00006767864,0.00034710168,0.00027077008,0.00010852935],"domain_scores_gemma":[0.9904541,0.0063493927,0.0009855285,0.0012788152,0.0007396505,0.00019264736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018263975,0.0013532167,0.00096648815,0.0015631983,0.0003898422,0.001208228,0.0019577548,0.0011494374,0.0016839516],"category_scores_gemma":[0.018322192,0.00076614413,0.0009630779,0.0013443519,0.0006569789,0.0023064788,0.00086981856,0.0023376145,0.000477521],"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.00009232489,0.000051687868,0.003599217,0.000048011985,0.000022261736,0.000024305804,0.000025773259,0.9659165,0.00048519278,0.0010420427,0.0013569334,0.027335662],"study_design_scores_gemma":[0.0000046191644,0.0000126816485,0.00032823576,0.000004058535,0.000005254269,0.00000593884,0.000002235828,0.9981838,0.00032294486,0.00097051536,0.00015639141,0.000003299308],"about_ca_topic_score_codex":0.010090192,"about_ca_topic_score_gemma":0.011779613,"teacher_disagreement_score":0.010090192,"about_ca_system_score_codex":0.0015727782,"about_ca_system_score_gemma":0.0015477343,"threshold_uncertainty_score":0.020062923},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13628347,0.00044887426,0.85370266,0.00073491817,0.000041238833,0.00037942457,0.00021734665,0.004912227,0.0032797905],"genre_scores_gemma":[0.665625,0.00018282134,0.33230254,0.00013193456,0.000025740752,0.0002057365,0.0004301683,0.00031420024,0.00078186503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9864268,0.005341744,0.0008945447,0.0019507485,0.0044586994,0.0009275157],"domain_scores_gemma":[0.9457094,0.038686298,0.0051887697,0.0053513655,0.0043406994,0.000723423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011750264,0.0008624397,0.0011655382,0.0019694394,0.0012779831,0.0023573528,0.0022310142,0.0011087973,0.0016284464],"category_scores_gemma":[0.058303047,0.00085984846,0.0008525403,0.00096333213,0.0027559379,0.0036778522,0.003066994,0.0019273307,0.000384141],"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.0021068417,0.00031471043,0.03483168,0.00079993805,0.00030209258,0.0007259892,0.0037360017,0.40500423,0.02897451,0.07600919,0.0038699505,0.44332495],"study_design_scores_gemma":[0.00010495175,0.0003245964,0.0035306148,0.00013845139,0.0001077729,0.0002329409,0.00043960105,0.905017,0.028181931,0.056970816,0.004890861,0.00006040492],"about_ca_topic_score_codex":0.00522367,"about_ca_topic_score_gemma":0.0050968267,"teacher_disagreement_score":0.011750264,"about_ca_system_score_codex":0.00186093,"about_ca_system_score_gemma":0.0050438824,"threshold_uncertainty_score":0.062142074},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011332087,0.32563916,0.11846985,0.042008836,0.029568732,0.00032815177,0.004060075,0.0034764875,0.46511656],"genre_scores_gemma":[0.026757712,0.11173284,0.023584703,0.0008990032,0.0024139816,0.000087364235,0.002618078,0.00074743055,0.83115876],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992887,0.00008262214,0.0000235291,0.00006705899,0.00044838164,0.00008964734],"domain_scores_gemma":[0.99785584,0.000603045,0.000042332937,0.00012201475,0.0011270813,0.0002496168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019601441,0.00090751774,0.0014876632,0.0012746267,0.0013178298,0.004560428,0.0011579252,0.0009157337,0.071621776],"category_scores_gemma":[0.0028358314,0.00050654274,0.00042455786,0.0027913395,0.0013800274,0.002064512,0.0013563766,0.001599685,0.011418403],"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.00010867388,0.00004782802,0.00047364915,0.0003078701,0.00002764201,0.000056640743,0.00019784426,0.0019937677,0.0005166722,0.012054074,0.67593217,0.30828324],"study_design_scores_gemma":[0.00001595862,0.000019941848,0.0017574881,0.00035615088,0.000038050886,0.000078267534,0.00024462352,0.0054191463,0.0008620484,0.010055728,0.98112786,0.000024723799],"about_ca_topic_score_codex":0.26055804,"about_ca_topic_score_gemma":0.43770388,"teacher_disagreement_score":0.739442,"about_ca_system_score_codex":0.0062089516,"about_ca_system_score_gemma":0.007773703,"threshold_uncertainty_score":0.51808286},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016365364,0.03700924,0.063250124,0.01876181,0.032906372,0.00046426887,0.0058176494,0.0055001713,0.8199251],"genre_scores_gemma":[0.020564035,0.013735458,0.015060487,0.00071759784,0.00062223413,0.000090007794,0.005373783,0.00049886317,0.9433376],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993357,0.00010361994,0.000020890515,0.000060549784,0.00037881895,0.0001003799],"domain_scores_gemma":[0.9983376,0.00022717277,0.000020174135,0.00014568632,0.0009254477,0.00034382174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015396439,0.0011908142,0.0012353349,0.0011075437,0.0012786777,0.004667302,0.0013274129,0.0008912159,0.14063899],"category_scores_gemma":[0.0025138455,0.00040876397,0.00041098407,0.001311062,0.0008805391,0.0014592689,0.0013574654,0.0019505287,0.049517315],"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.00009457545,0.00012129805,0.0007348176,0.000090424066,0.000018926945,0.000047989244,0.00013207275,0.00066052907,0.00043833375,0.002570331,0.8615113,0.1335794],"study_design_scores_gemma":[0.000033227814,0.000045982604,0.002319161,0.00017885883,0.000038036236,0.00011499845,0.00054997904,0.0037425868,0.0011051766,0.002545073,0.98930603,0.00002089129],"about_ca_topic_score_codex":0.15281856,"about_ca_topic_score_gemma":0.32779002,"teacher_disagreement_score":0.15281856,"about_ca_system_score_codex":0.0027366844,"about_ca_system_score_gemma":0.0068816165,"threshold_uncertainty_score":0.47048432},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010345545,0.28623095,0.093239576,0.052768808,0.040816445,0.00034469235,0.0060856617,0.0024668083,0.5077016],"genre_scores_gemma":[0.030788174,0.06777907,0.014881846,0.0009961647,0.0022363765,0.00009053033,0.002439502,0.00056731154,0.88022107],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994504,0.000079940684,0.000019857483,0.00006232012,0.00030354783,0.00008390977],"domain_scores_gemma":[0.9981822,0.00036862446,0.00003645104,0.00011815297,0.0010676079,0.00022709796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020745934,0.000945365,0.0011935227,0.00087393454,0.0012628416,0.0042079063,0.0012156814,0.00083594816,0.09735796],"category_scores_gemma":[0.002660432,0.00041864184,0.00046273612,0.0017137285,0.0014765497,0.0015934395,0.0011425993,0.0015310044,0.011022196],"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.00007119071,0.00003776492,0.00053909555,0.00024034246,0.000030567277,0.000053726653,0.00018632205,0.0015957458,0.0004552793,0.01134079,0.77154416,0.21390498],"study_design_scores_gemma":[0.000011034865,0.000018419656,0.0016452998,0.00023101807,0.000026533338,0.000053801257,0.00017622189,0.0026815042,0.00053816475,0.0052525797,0.9893435,0.000021963308],"about_ca_topic_score_codex":0.44502693,"about_ca_topic_score_gemma":0.620195,"teacher_disagreement_score":0.44502693,"about_ca_system_score_codex":0.00848061,"about_ca_system_score_gemma":0.011028893,"threshold_uncertainty_score":0.88487315},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013840718,0.29274258,0.08802916,0.050399598,0.051156603,0.00030470014,0.0030183431,0.0027457676,0.49776247],"genre_scores_gemma":[0.029067088,0.085082464,0.014297303,0.0012291528,0.0032834504,0.00010853138,0.002103237,0.0007036608,0.8641251],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99927264,0.00012612439,0.000028040593,0.00006310277,0.00042601986,0.00008414468],"domain_scores_gemma":[0.9976694,0.0006838145,0.000050080725,0.0001546783,0.0011350722,0.000306959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022306798,0.00084112975,0.0014260609,0.00097322755,0.0012507483,0.0054175137,0.0010628384,0.0010417204,0.0698851],"category_scores_gemma":[0.0029385039,0.00042736286,0.00040697987,0.0017548501,0.0013280186,0.0018698456,0.0016121009,0.002026985,0.012527123],"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.00010020735,0.00005802112,0.00048546583,0.0002978725,0.00003211083,0.00006368181,0.00020751862,0.0012737997,0.0003969356,0.008758939,0.7470209,0.24130462],"study_design_scores_gemma":[0.000013348373,0.000020697584,0.0013704915,0.00038479827,0.000035089284,0.000084024505,0.00030327955,0.002878408,0.00061668415,0.008924986,0.98534495,0.000023245566],"about_ca_topic_score_codex":0.07818586,"about_ca_topic_score_gemma":0.1610307,"teacher_disagreement_score":0.07818586,"about_ca_system_score_codex":0.0039019294,"about_ca_system_score_gemma":0.005394452,"threshold_uncertainty_score":0.23378897},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023144135,0.00011401909,0.94983584,0.00007884167,0.000030429585,0.00029681812,0.0003266996,0.022021128,0.0041522067],"genre_scores_gemma":[0.2034129,0.00015764759,0.79096675,0.00009802875,0.00001319874,0.0005400968,0.0010951725,0.0020497192,0.0016664384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993376,0.00018990225,0.00005655035,0.0001996386,0.0001437167,0.000072594084],"domain_scores_gemma":[0.99851376,0.0007603241,0.0000970495,0.00044870228,0.0001343078,0.00004587968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094883464,0.0009885931,0.0007422723,0.00075023173,0.00040722612,0.0010224496,0.0019376874,0.0011980286,0.0060112667],"category_scores_gemma":[0.0044951225,0.0008138713,0.00083252275,0.0006476247,0.0013092553,0.0015070058,0.0018041648,0.0012989511,0.0019898298],"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.00038350248,0.00015560027,0.0018609378,0.00062320585,0.00008342777,0.00036201204,0.00037789185,0.6366572,0.043948185,0.017196346,0.008636039,0.2897157],"study_design_scores_gemma":[0.00008994461,0.00008456818,0.00040025794,0.000042941305,0.00003293423,0.00015939846,0.00008763351,0.95122665,0.02602891,0.011691964,0.010112547,0.000042203978],"about_ca_topic_score_codex":0.0019621751,"about_ca_topic_score_gemma":0.0035054986,"teacher_disagreement_score":0.0060112667,"about_ca_system_score_codex":0.000845753,"about_ca_system_score_gemma":0.001427141,"threshold_uncertainty_score":0.020109713},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023015959,0.37763935,0.045097355,0.018556828,0.031366263,0.00013183655,0.0023875202,0.0019831017,0.5205361],"genre_scores_gemma":[0.006357625,0.10809223,0.009374203,0.0008756028,0.0031944774,0.000057142795,0.0014963043,0.00046267908,0.8700899],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99949026,0.000048418635,0.000024245464,0.000060179522,0.00034348512,0.0000334583],"domain_scores_gemma":[0.9988926,0.0002788309,0.00003401086,0.000075327545,0.0005233358,0.00019590535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012295574,0.001174829,0.001088357,0.0016142012,0.0008220691,0.0047594737,0.0010049002,0.001084977,0.106429964],"category_scores_gemma":[0.0016686479,0.00058622175,0.00039487757,0.0030810137,0.0009835534,0.0025848167,0.0012299956,0.0019229605,0.029106924],"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.00004453571,0.00002984027,0.00010810836,0.00036532295,0.000012528793,0.000055808912,0.00014348199,0.0007169387,0.00041289188,0.011410285,0.7944986,0.19220166],"study_design_scores_gemma":[0.000004418609,0.00000848867,0.00035445162,0.00023841155,0.000009712604,0.00007619633,0.00006396012,0.0004117334,0.00019625081,0.0044884724,0.9941403,0.0000075300536],"about_ca_topic_score_codex":0.02048879,"about_ca_topic_score_gemma":0.048485253,"teacher_disagreement_score":0.106429964,"about_ca_system_score_codex":0.0029667725,"about_ca_system_score_gemma":0.0039168266,"threshold_uncertainty_score":0.3560437},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29483742,0.0051761274,0.60620916,0.023268096,0.0011468707,0.005333363,0.0047120927,0.015759718,0.043557234],"genre_scores_gemma":[0.46555576,0.0013441804,0.52572674,0.0011571867,0.00014319393,0.00074333785,0.0017078429,0.000108837135,0.0035129543],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989808,0.0005462065,0.00013182344,0.000102788814,0.00018446823,0.000053872565],"domain_scores_gemma":[0.99515307,0.0035487434,0.00021291526,0.00022319987,0.00049039,0.0003716684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002449106,0.0005006071,0.000390497,0.0011035543,0.00058459135,0.0017870374,0.0010692547,0.0009525651,0.007336326],"category_scores_gemma":[0.01374852,0.0002284729,0.00050287833,0.00076807407,0.00023611129,0.0012899449,0.0010828654,0.0008121236,0.0011961705],"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.0012479674,0.0017785841,0.012266404,0.0009123066,0.00019873402,0.0016959816,0.0009063359,0.03622639,0.0062922295,0.00533843,0.032886226,0.90025043],"study_design_scores_gemma":[0.0025986624,0.00180499,0.012379484,0.0009819597,0.0007362157,0.0034753506,0.0017056019,0.8279589,0.015332972,0.040898014,0.091867685,0.00026018376],"about_ca_topic_score_codex":0.0023823653,"about_ca_topic_score_gemma":0.0041395198,"teacher_disagreement_score":0.007336326,"about_ca_system_score_codex":0.0006721251,"about_ca_system_score_gemma":0.0017472483,"threshold_uncertainty_score":0.02454245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016844952,0.026503488,0.047005534,0.015851786,0.03133685,0.00038945058,0.0059283995,0.004967612,0.851172],"genre_scores_gemma":[0.015318425,0.008654324,0.0094323745,0.0004858012,0.00042957958,0.00005455682,0.004334749,0.0004309398,0.9608593],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993957,0.00006881818,0.000015028329,0.00004945838,0.00036111838,0.00010981489],"domain_scores_gemma":[0.99853945,0.0001450446,0.000014342828,0.00010297098,0.0008934988,0.0003048376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013576625,0.0011141076,0.0012593481,0.0012524603,0.001464428,0.004493998,0.0012942165,0.00084746885,0.17078859],"category_scores_gemma":[0.0017351098,0.00036929958,0.0004503319,0.0014503567,0.0009702053,0.0011403977,0.0011786693,0.0017880525,0.057540946],"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.0000882051,0.00010898256,0.0008103053,0.000082092556,0.000017500064,0.000049961323,0.00012079756,0.000614231,0.00054490706,0.00243023,0.88312525,0.11200755],"study_design_scores_gemma":[0.000026440617,0.000041822306,0.0026725247,0.0001462674,0.000036450452,0.000108598055,0.00066857453,0.0031032993,0.0012353223,0.0022801096,0.9896571,0.000023469924],"about_ca_topic_score_codex":0.25762257,"about_ca_topic_score_gemma":0.52696276,"teacher_disagreement_score":0.7423774,"about_ca_system_score_codex":0.0038313495,"about_ca_system_score_gemma":0.008918339,"threshold_uncertainty_score":0.57134473},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004848711,0.10710941,0.004303743,0.0033549687,0.0035741758,0.014176446,0.8546117,0.001374997,0.006645818],"genre_scores_gemma":[0.1307585,0.19651724,0.04444165,0.020370645,0.0045728665,0.18096858,0.3644278,0.0023643975,0.055578284],"study_design_codex":"systematic_review","study_design_gemma":"meta_analysis","domain_scores_codex":[0.9965995,0.0009946466,0.0010908223,0.0003819496,0.0007226898,0.00021038254],"domain_scores_gemma":[0.97661203,0.01609803,0.0035000825,0.00043571298,0.0031249984,0.00022919703],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005716893,0.0027651913,0.008319833,0.008052343,0.0007365503,0.0023728365,0.0025806318,0.0012401869,0.33389258],"category_scores_gemma":[0.040402748,0.0015882825,0.0143729085,0.010855886,0.00041503736,0.0035241519,0.001201833,0.0013887204,0.00990004],"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.0011194019,0.000027438453,0.0023740106,0.8893903,0.016674858,0.00014442312,0.000056270044,0.00039819806,0.00030321724,0.00058843236,0.076567434,0.0123560345],"study_design_scores_gemma":[0.023453094,0.0010983376,0.06741257,0.41342643,0.1704297,0.0014613739,0.000548103,0.0039334185,0.0019893702,0.008177174,0.3076472,0.0004232987],"about_ca_topic_score_codex":0.0062266774,"about_ca_topic_score_gemma":0.01716435,"teacher_disagreement_score":0.33389258,"about_ca_system_score_codex":0.0021666267,"about_ca_system_score_gemma":0.0048600202,"threshold_uncertainty_score":0.9501214},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095254175,0.0039626868,0.3532888,0.0056332387,0.00179224,0.00018828461,0.0016600838,0.0033742364,0.53484625],"genre_scores_gemma":[0.7888061,0.0022289304,0.0641413,0.0017789516,0.0011832321,0.00019265215,0.0020040039,0.001761908,0.13790298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977666,0.000048650272,0.000008324858,0.000023224835,0.00011454057,0.00002863315],"domain_scores_gemma":[0.99945766,0.00015799687,0.000067451416,0.00007526852,0.000121718374,0.00011984571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003931314,0.0008961188,0.0010463084,0.00095069833,0.0010982445,0.001560543,0.001309781,0.0014945178,0.018476939],"category_scores_gemma":[0.0027226056,0.00051664124,0.0009088083,0.0006966727,0.0015995305,0.0017074147,0.0019018276,0.0023989095,0.0015153901],"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.00011222297,0.000043791348,0.0007415113,0.00018753922,0.000056652385,0.0003052606,0.00010420346,0.19633944,0.0016617478,0.7620113,0.021800652,0.016635746],"study_design_scores_gemma":[0.000046858233,0.000014590114,0.0005735138,0.000031305262,0.000010717932,0.00011906793,0.000022607699,0.6016774,0.0005959412,0.39018878,0.006693996,0.000025201478],"about_ca_topic_score_codex":0.005418883,"about_ca_topic_score_gemma":0.0035120626,"teacher_disagreement_score":0.018476939,"about_ca_system_score_codex":0.001476026,"about_ca_system_score_gemma":0.0007430536,"threshold_uncertainty_score":0.061811507},"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":"dataset","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041860357,0.00002397733,0.0022621877,0.00028427292,0.00007944242,0.0005072311,0.9889826,0.0019684383,0.005473308],"genre_scores_gemma":[0.008863651,0.00013038305,0.021747781,0.0005498616,0.00015820721,0.0055678533,0.9381733,0.0045000003,0.020309],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981171,0.00047680954,0.00032503973,0.0002790926,0.00066145847,0.00014056159],"domain_scores_gemma":[0.9222242,0.057742953,0.0022509797,0.004453982,0.0122263245,0.001101538],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0050205975,0.0012041584,0.00088545046,0.0030352308,0.0011412335,0.0023123778,0.0027153522,0.0013829627,0.8407969],"category_scores_gemma":[0.07731847,0.0007447916,0.00089381513,0.00434231,0.0004360922,0.0036050142,0.0021797805,0.0014914292,0.22501718],"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.0003996609,0.000114844064,0.00084089814,0.002239423,0.000018845887,0.00004247148,0.00010911996,0.00037937507,0.00010960703,0.0009103066,0.97704506,0.01779035],"study_design_scores_gemma":[0.0036695413,0.0002871474,0.011470735,0.0020395832,0.00014264829,0.00022859113,0.0005655451,0.0022728448,0.0018917032,0.010787413,0.9664964,0.0001478696],"about_ca_topic_score_codex":0.008330754,"about_ca_topic_score_gemma":0.012745698,"teacher_disagreement_score":0.8407969,"about_ca_system_score_codex":0.001395113,"about_ca_system_score_gemma":0.0030435259,"threshold_uncertainty_score":0.22708392},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05915397,0.00015173129,0.91676503,0.0008429894,0.00009362856,0.0023144588,0.0007328221,0.0058701327,0.014075339],"genre_scores_gemma":[0.14587165,0.00021277928,0.8483568,0.00017616217,0.000024414965,0.00092519267,0.0009883165,0.0001180808,0.0033265115],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880886,0.00036539644,0.00019620638,0.00023871771,0.00030361203,0.000087161185],"domain_scores_gemma":[0.9970715,0.0019094521,0.00018084717,0.00025152578,0.00045844464,0.00012820929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029168385,0.0007077695,0.0006680568,0.0018185697,0.0010250825,0.0035554694,0.0022754895,0.0019054054,0.008329868],"category_scores_gemma":[0.007846399,0.0007843101,0.00090630446,0.0010849269,0.0004899872,0.002654781,0.0017900835,0.0009757557,0.0022967434],"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.0009778985,0.0023752477,0.008780609,0.0016850821,0.00027313564,0.005188342,0.0075048185,0.27139586,0.05059966,0.03967436,0.020497631,0.5910473],"study_design_scores_gemma":[0.00033284962,0.00034424532,0.0016033364,0.00041431133,0.00015312592,0.0008777878,0.001433576,0.91394365,0.019782653,0.015067001,0.045924433,0.00012304014],"about_ca_topic_score_codex":0.0023210768,"about_ca_topic_score_gemma":0.0025493416,"teacher_disagreement_score":0.008329868,"about_ca_system_score_codex":0.0010192144,"about_ca_system_score_gemma":0.0015127661,"threshold_uncertainty_score":0.027866185},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00298995,0.0001755123,0.99473345,0.0001310026,0.000012088147,0.000031103267,0.00005696447,0.00027196712,0.0015979739],"genre_scores_gemma":[0.24481714,0.00066454423,0.7507139,0.0001162493,0.000057136345,0.00030756637,0.0003570305,0.00022895027,0.0027374402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882203,0.00037199212,0.00007464773,0.00021653993,0.00038293502,0.00013188548],"domain_scores_gemma":[0.99570787,0.0034012275,0.00022300465,0.00035706867,0.00023135755,0.00007945957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019651963,0.0013133335,0.0013588384,0.0011145768,0.0007220818,0.0015165544,0.001908118,0.0013628496,0.005337258],"category_scores_gemma":[0.008787586,0.00082618947,0.0016568153,0.0014851948,0.0014884943,0.0028657631,0.002222508,0.0028789202,0.00059692387],"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.000048991158,0.000038329264,0.00024788393,0.0001698247,0.000048988168,0.00006600319,0.00014496675,0.80270875,0.0006390959,0.15144598,0.0012685334,0.043172613],"study_design_scores_gemma":[0.000018382352,0.000013615367,0.000024094801,0.000017085513,0.000011718525,0.000018176283,0.00002289139,0.892891,0.00045204192,0.105272844,0.0012523565,0.0000058357764],"about_ca_topic_score_codex":0.005654759,"about_ca_topic_score_gemma":0.008623661,"teacher_disagreement_score":0.005654759,"about_ca_system_score_codex":0.002070604,"about_ca_system_score_gemma":0.002017434,"threshold_uncertainty_score":0.017854929},"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":"empirical","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9987324,0.0005125705,0.00015154437,0.000037038793,0.000007838731,0.000005928315,0.00016001987,0.000019301648,0.0003733629],"genre_scores_gemma":[0.9983559,0.00047177204,0.00019831512,0.000051057683,0.000004876716,0.000017773249,0.00022255613,0.000005391313,0.0006723197],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9999156,0.000008359311,0.000012551386,0.000019260891,0.000019730967,0.000024430734],"domain_scores_gemma":[0.9998442,0.00001524902,0.00007191339,0.000020437481,0.00001573971,0.000032522403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000048351634,0.00032653412,0.0003290821,0.00018913962,0.00011265141,0.00022765205,0.0001283612,0.0002741644,0.0008745235],"category_scores_gemma":[0.00015762869,0.00016771894,0.00023586242,0.00009593321,0.00019018252,0.00014967847,0.00020528838,0.00051380636,0.00017410751],"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.00021707715,0.00003669082,0.001713433,0.000037017053,0.000011536155,0.00014575482,0.000021918724,0.0000212945,0.9963496,0.00001058715,0.000040424966,0.0013945922],"study_design_scores_gemma":[0.000037924394,0.0018946129,0.46611586,0.000033648663,0.00007533871,0.0014337586,0.00020228379,0.00063005416,0.52832186,0.000072038994,0.0011674936,0.000015145682],"about_ca_topic_score_codex":0.0012524538,"about_ca_topic_score_gemma":0.0018729503,"teacher_disagreement_score":0.0012524538,"about_ca_system_score_codex":0.00021287517,"about_ca_system_score_gemma":0.00010511958,"threshold_uncertainty_score":0.0029255748},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005137451,0.0010826115,0.0028902865,0.00035457424,0.001179986,0.00011030355,0.013261855,0.01983838,0.96076816],"genre_scores_gemma":[0.0025434305,0.00087451364,0.0018541786,0.0002801465,0.00021675724,0.000107413405,0.011653289,0.01242432,0.9700459],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99971837,0.000019779352,0.000008761036,0.00005679147,0.00013238961,0.00006377246],"domain_scores_gemma":[0.9993594,0.00006029077,0.00002130711,0.00012809847,0.00023164641,0.0001993262],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003240093,0.0015057635,0.00087135733,0.0016566499,0.0010680595,0.0042257225,0.0014016697,0.0010997725,0.86531466],"category_scores_gemma":[0.001147077,0.00061061035,0.0007823391,0.0012849646,0.00035509656,0.0024664702,0.0026415586,0.0013679353,0.81658715],"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.00010379638,0.000021891437,0.00007281596,0.00020218844,0.00000345086,0.00005834834,0.00005778373,0.00007769586,0.0013191543,0.0016029704,0.92385894,0.072620936],"study_design_scores_gemma":[0.0000074669288,0.0000063029383,0.00015787581,0.000036299905,0.0000015446102,0.000029810744,0.00001604341,0.000028579803,0.00021490426,0.00019405244,0.9993025,0.0000046009873],"about_ca_topic_score_codex":0.005999616,"about_ca_topic_score_gemma":0.014712064,"teacher_disagreement_score":0.13468534,"about_ca_system_score_codex":0.00078571873,"about_ca_system_score_gemma":0.00073997304,"threshold_uncertainty_score":0.19211227},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050472794,0.0003018069,0.03513004,0.00051282713,0.0003181648,0.00017461597,0.018773729,0.8858996,0.05838458],"genre_scores_gemma":[0.015572335,0.0005746512,0.05979183,0.0014308373,0.00029119346,0.00068285456,0.094166204,0.66667354,0.16081658],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99800044,0.00031893153,0.00011176966,0.0004490603,0.0008389139,0.00028098567],"domain_scores_gemma":[0.99504185,0.0008880271,0.00023812399,0.0018872716,0.0014402284,0.0005044441],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0025532464,0.0030923616,0.0012396089,0.0018534174,0.0010058719,0.0038693522,0.004172009,0.0020608264,0.4902386],"category_scores_gemma":[0.011183931,0.0024761716,0.0014650179,0.0013001417,0.0008384562,0.0048005446,0.005422804,0.00300913,0.6244947],"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.00016391254,0.000031670555,0.00016339611,0.00029395177,0.000014594563,0.00005496544,0.0000926697,0.00019171691,0.0011539207,0.0019163238,0.95632714,0.039595764],"study_design_scores_gemma":[0.000096052674,0.00002475089,0.0004365706,0.000078932666,0.000011517723,0.00020118446,0.000029078748,0.0011702292,0.004512548,0.0021409227,0.9912423,0.00005582675],"about_ca_topic_score_codex":0.005684069,"about_ca_topic_score_gemma":0.0046892567,"teacher_disagreement_score":0.4902386,"about_ca_system_score_codex":0.0014471993,"about_ca_system_score_gemma":0.0015683539,"threshold_uncertainty_score":0.72711277},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048958496,0.993808,0.0002769968,0.00018191728,0.00009566548,0.0001989957,0.00036814803,0.000014779538,0.00015965023],"genre_scores_gemma":[0.1641469,0.8304292,0.0017287495,0.00092796463,0.00026829596,0.0012301772,0.00097248284,0.000023063523,0.00027314544],"study_design_codex":"meta_analysis","study_design_gemma":"meta_analysis","domain_scores_codex":[0.9905938,0.0036096568,0.0032221663,0.00089783024,0.0012250333,0.00045145827],"domain_scores_gemma":[0.98650926,0.009004439,0.0023087144,0.00043039393,0.0015406804,0.00020648114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015715307,0.0030390702,0.018444404,0.008174662,0.00071594305,0.0029745633,0.0019604734,0.0019735263,0.0028047746],"category_scores_gemma":[0.028165743,0.0014107904,0.038880736,0.007964018,0.00057887303,0.0017654232,0.0015473968,0.0014312222,0.00022224974],"study_design_candidate":"meta_analysis","study_design_consensus":"meta_analysis","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013849903,0.00003217623,0.0075227506,0.46018645,0.5120847,0.00019545635,0.000117557094,0.0005909505,0.00022021365,0.00013878626,0.0008157718,0.01671021],"study_design_scores_gemma":[0.0005179539,0.00020459438,0.007258982,0.029618818,0.9602527,0.00011271998,0.000045604094,0.00024595266,0.00012548467,0.00013225603,0.0014600061,0.000024923153],"about_ca_topic_score_codex":0.013547829,"about_ca_topic_score_gemma":0.02688665,"teacher_disagreement_score":0.018444404,"about_ca_system_score_codex":0.0035976104,"about_ca_system_score_gemma":0.006447812,"threshold_uncertainty_score":0.083111465},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004764019,0.00003629515,0.000017852537,0.00010822253,0.00002281043,0.000011112465,0.9990687,0.000046502708,0.00064091693],"genre_scores_gemma":[0.000552602,0.00018523303,0.0002423523,0.000109978064,0.000014984892,0.00008734499,0.9961727,0.000073920746,0.0025608982],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9952608,0.00026809296,0.0005039439,0.0005857775,0.002281753,0.0010995542],"domain_scores_gemma":[0.95548433,0.001516495,0.00121755,0.0011587447,0.038811814,0.001810993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001944444,0.0025432985,0.0029707092,0.010251553,0.0036645788,0.0056229606,0.005595462,0.0015887787,0.07754209],"category_scores_gemma":[0.019622386,0.0017671713,0.002138764,0.048957955,0.00072737044,0.002989183,0.0026365384,0.0033740972,0.05611503],"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.000019168107,0.0000061859446,0.00093702035,0.000195724,0.000017283646,0.0000060475822,0.000017366823,0.000093342605,0.0000075296907,0.00030729664,0.9972934,0.001099614],"study_design_scores_gemma":[0.0001405468,0.000011562912,0.021554174,0.0008588853,0.00006776259,0.000026203477,0.0005715784,0.0005314931,0.00020216843,0.00065454957,0.975293,0.00008806449],"about_ca_topic_score_codex":0.9926979,"about_ca_topic_score_gemma":0.99136615,"teacher_disagreement_score":0.07754209,"about_ca_system_score_codex":0.05035008,"about_ca_system_score_gemma":0.13993034,"threshold_uncertainty_score":0.36531717},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11664615,0.051973794,0.027903259,0.15325376,0.0065063084,0.00041370335,0.0022628955,0.00067463674,0.6403655],"genre_scores_gemma":[0.7192522,0.030634003,0.014183192,0.016240437,0.003829662,0.00073749246,0.0016359668,0.000430905,0.21305613],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9901271,0.0028330276,0.00043000086,0.0024167085,0.003080807,0.0011124569],"domain_scores_gemma":[0.9833174,0.004946514,0.0031635205,0.0016451131,0.0048033926,0.0021240555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075392197,0.0008125327,0.0007663632,0.0019437307,0.0036862553,0.011712461,0.0019285586,0.003125358,0.035928413],"category_scores_gemma":[0.016590632,0.0006060211,0.00075349066,0.002695548,0.005120694,0.004273817,0.0055732667,0.0045170127,0.008588607],"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.00052909297,0.00037011324,0.1251242,0.0021422973,0.00034728326,0.00113917,0.027755052,0.0018570387,0.0054246173,0.2600282,0.15854391,0.41673902],"study_design_scores_gemma":[0.00003240043,0.00025713077,0.075839326,0.0010727262,0.00011945961,0.0010768266,0.01570399,0.0014116361,0.0025532874,0.06450368,0.83728504,0.00014454767],"about_ca_topic_score_codex":0.014996826,"about_ca_topic_score_gemma":0.024605893,"teacher_disagreement_score":0.035928413,"about_ca_system_score_codex":0.005562616,"about_ca_system_score_gemma":0.010316583,"threshold_uncertainty_score":0.12019247},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007838683,0.00096861174,0.9749997,0.003968164,0.00006628899,0.00009052625,0.0001376426,0.002611173,0.009319211],"genre_scores_gemma":[0.06933644,0.0008712688,0.92728496,0.00016508723,0.0000359505,0.0000601976,0.00025859883,0.00018194907,0.0018056423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973911,0.0015816981,0.00013698165,0.0002647052,0.0005503666,0.00007511976],"domain_scores_gemma":[0.992574,0.004654512,0.0004896875,0.00087905634,0.0011170342,0.00028568532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038540268,0.001072742,0.0005805267,0.003187537,0.0010255973,0.008256701,0.0022524323,0.0021841177,0.0054292087],"category_scores_gemma":[0.015624378,0.0010900005,0.00082683255,0.0018469109,0.0054598497,0.010148224,0.0038431955,0.0039947913,0.001240099],"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.00017983874,0.00012557271,0.0032150033,0.0012701639,0.00006498394,0.00081334694,0.026138926,0.031268846,0.0134647135,0.5742344,0.023220185,0.3260041],"study_design_scores_gemma":[0.00006216013,0.000090293965,0.0018056779,0.0005603887,0.00006301142,0.0010336752,0.0055121426,0.25930288,0.008732042,0.5555752,0.16717969,0.000082825296],"about_ca_topic_score_codex":0.007742305,"about_ca_topic_score_gemma":0.0071494845,"teacher_disagreement_score":0.008256701,"about_ca_system_score_codex":0.002006709,"about_ca_system_score_gemma":0.0021606549,"threshold_uncertainty_score":0.020382285},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02694778,0.003709009,0.89592,0.004550171,0.00044810906,0.00045061213,0.0017979231,0.021307165,0.044869334],"genre_scores_gemma":[0.27412912,0.0031072355,0.70119137,0.0013069909,0.0003774139,0.00027332237,0.0041988147,0.0006949563,0.014720759],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983011,0.0007116659,0.00019807155,0.00015709626,0.0005829864,0.000049111128],"domain_scores_gemma":[0.9941507,0.0038741622,0.00019289817,0.00076354283,0.0007257456,0.00029292138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024550625,0.00042461578,0.00044430752,0.0021928865,0.00043833192,0.0031649151,0.0008493367,0.0010668132,0.007369198],"category_scores_gemma":[0.0077589424,0.00032468556,0.00044201704,0.0016474819,0.00047308416,0.0025596593,0.001655602,0.0012972907,0.0039863875],"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.00039012497,0.00048171682,0.0032981888,0.0007556617,0.00014894427,0.0007622387,0.00046196545,0.0072530718,0.012887325,0.028513657,0.019532073,0.925515],"study_design_scores_gemma":[0.00022627103,0.00041163006,0.010560119,0.0011712017,0.0003574768,0.0030261537,0.00047406263,0.27980545,0.04140167,0.17778262,0.4846011,0.0001821595],"about_ca_topic_score_codex":0.0011691871,"about_ca_topic_score_gemma":0.0012237342,"teacher_disagreement_score":0.007369198,"about_ca_system_score_codex":0.0004484209,"about_ca_system_score_gemma":0.0010450911,"threshold_uncertainty_score":0.024652421},"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":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021393998,0.092473134,0.030373184,0.025302187,0.042450443,0.00010547932,0.0020695522,0.0011829566,0.8039037],"genre_scores_gemma":[0.027202427,0.04854534,0.028481342,0.002748622,0.007062042,0.00010174359,0.0025674053,0.00066666503,0.8826245],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990858,0.00011225354,0.000059233163,0.00013850731,0.0005514595,0.000052825446],"domain_scores_gemma":[0.99692386,0.000810637,0.00008232645,0.00082957785,0.0011386849,0.00021487723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001558527,0.0005199039,0.0009670058,0.0019220958,0.0008897061,0.004052992,0.0011267686,0.0014188814,0.13965833],"category_scores_gemma":[0.0047874837,0.00044499736,0.00058550865,0.0023166663,0.0011857095,0.0037970287,0.0014318812,0.0029280751,0.051125724],"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.00005537846,0.00006709151,0.00017251926,0.00061838585,0.000026502545,0.000059479305,0.00006470176,0.00041968183,0.00063969404,0.12574053,0.5915563,0.28057978],"study_design_scores_gemma":[0.00000972053,0.000013705453,0.00023948197,0.00020099223,0.000014422336,0.000084687934,0.000022898334,0.00068746944,0.0003709583,0.040417504,0.9579322,0.0000059497306],"about_ca_topic_score_codex":0.0016029052,"about_ca_topic_score_gemma":0.0025998508,"teacher_disagreement_score":0.13965833,"about_ca_system_score_codex":0.0010829329,"about_ca_system_score_gemma":0.0014740448,"threshold_uncertainty_score":0.46720368},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033010107,0.024732819,0.11297649,0.07753992,0.027895441,0.00069647393,0.00046655998,0.0010731821,0.721609],"genre_scores_gemma":[0.33514705,0.021568874,0.058825728,0.003423224,0.008693174,0.00029599748,0.0006539525,0.00040937818,0.5709827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962535,0.001406197,0.00017608047,0.0002777685,0.0017544129,0.00013207855],"domain_scores_gemma":[0.9803396,0.0075756386,0.001013468,0.0015636568,0.008536532,0.0009711509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041073794,0.00037838623,0.0007411968,0.0021301068,0.0020423857,0.004860447,0.000972146,0.0013492807,0.05584324],"category_scores_gemma":[0.02977087,0.00034720462,0.00033765205,0.0018579157,0.0013785444,0.001946708,0.0015170954,0.0015757199,0.011975358],"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.000193997,0.0001601096,0.0028775772,0.0009100026,0.00006545112,0.00074294035,0.0008157187,0.007199177,0.0018740062,0.11442436,0.23322892,0.63750774],"study_design_scores_gemma":[0.00006296841,0.00009865301,0.0028093925,0.00030789003,0.000039455386,0.00041498,0.0005866022,0.01533586,0.0027680458,0.108257346,0.86928165,0.00003705494],"about_ca_topic_score_codex":0.0016219738,"about_ca_topic_score_gemma":0.0031386735,"teacher_disagreement_score":0.05584324,"about_ca_system_score_codex":0.00097295025,"about_ca_system_score_gemma":0.0017062422,"threshold_uncertainty_score":0.18681425},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38438222,0.00017584782,0.587865,0.00036788816,0.000058251735,0.00082784635,0.00020983999,0.013268704,0.012844443],"genre_scores_gemma":[0.6069052,0.000062591,0.38590586,0.000102125996,0.000008776898,0.00016599041,0.00023977947,0.00020187268,0.0064078914],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992078,0.00024504005,0.000066485634,0.00019693107,0.00023249493,0.00005124981],"domain_scores_gemma":[0.99715316,0.0016510987,0.00018583384,0.00043190128,0.00041712125,0.00016096156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014052418,0.00037895405,0.00028048575,0.000295064,0.00033351968,0.0006565696,0.0012632043,0.0007066696,0.0060563195],"category_scores_gemma":[0.0042365473,0.00042959957,0.00020779372,0.00016177811,0.00036866448,0.00074259564,0.00036778743,0.0005055537,0.0008933708],"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.0017596141,0.00086018845,0.006135176,0.00046195037,0.00004264173,0.0020069876,0.0019774537,0.07686771,0.30421084,0.005861304,0.00796921,0.5918469],"study_design_scores_gemma":[0.0007071427,0.002385197,0.012224483,0.000121471094,0.00011868517,0.003000751,0.00072401186,0.6702504,0.2646356,0.003764668,0.041919142,0.00014845865],"about_ca_topic_score_codex":0.0013575028,"about_ca_topic_score_gemma":0.0021529223,"teacher_disagreement_score":0.0060563195,"about_ca_system_score_codex":0.00062747026,"about_ca_system_score_gemma":0.0005173733,"threshold_uncertainty_score":0.020260394},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004896548,0.007910205,0.010526948,0.1289958,0.007690644,0.00010217172,0.00047669053,0.0013809819,0.8380199],"genre_scores_gemma":[0.07215727,0.0092282165,0.009963861,0.007010515,0.0009296412,0.00014266711,0.00042518508,0.00093886454,0.89920366],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99952793,0.00012075983,0.0000120391815,0.000061764855,0.000169469,0.000108126056],"domain_scores_gemma":[0.9993291,0.00012536976,0.000022499733,0.00003841551,0.000107188316,0.00037742488],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013005368,0.00032440957,0.0001612943,0.0003142183,0.0031253982,0.005134798,0.00045028664,0.0014292315,0.11476631],"category_scores_gemma":[0.0016774948,0.00027712507,0.00018736388,0.0004055297,0.0034095093,0.0054364074,0.0039524306,0.0026217003,0.018910188],"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.000026116595,0.000018002114,0.00021773891,0.00006163399,0.0000014696029,0.000051630985,0.0018462043,0.00012830814,0.0004494194,0.03872156,0.87719464,0.0812833],"study_design_scores_gemma":[0.0000030037008,0.000008083183,0.00037284358,0.000120519915,9.2600607e-7,0.000013098024,0.0013163561,0.00008902825,0.0001622763,0.0052654874,0.99264246,0.000005844975],"about_ca_topic_score_codex":0.044570085,"about_ca_topic_score_gemma":0.17217696,"teacher_disagreement_score":0.8852337,"about_ca_system_score_codex":0.004977209,"about_ca_system_score_gemma":0.006509349,"threshold_uncertainty_score":0.38393152},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076854127,0.09402967,0.70249295,0.028524432,0.008348194,0.00023659486,0.0013637654,0.003065752,0.15425327],"genre_scores_gemma":[0.15605891,0.092962496,0.47305802,0.0021717015,0.0031570387,0.00033642948,0.004143866,0.0010211301,0.2670904],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989497,0.00028434012,0.000070564674,0.00013396711,0.00045257085,0.00010882737],"domain_scores_gemma":[0.99769187,0.0007284209,0.000054097767,0.00043947992,0.00085842964,0.00022766217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002723788,0.00087940134,0.0011139229,0.0011174409,0.0012530169,0.0062787207,0.0016981467,0.0012916747,0.023358796],"category_scores_gemma":[0.0038329859,0.0008284931,0.0008023328,0.0014355903,0.0024930765,0.0031507039,0.0019424537,0.0026301325,0.00488628],"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.00020491575,0.00020521184,0.0014652695,0.00056893687,0.00013454245,0.00017546673,0.0007086161,0.00809897,0.0023160216,0.26812664,0.33586246,0.38213292],"study_design_scores_gemma":[0.000037890888,0.000061028084,0.0019693784,0.0004335526,0.00011916719,0.00025596505,0.00038141626,0.048452716,0.0023345868,0.20085493,0.745054,0.0000454006],"about_ca_topic_score_codex":0.055664912,"about_ca_topic_score_gemma":0.086698614,"teacher_disagreement_score":0.055664912,"about_ca_system_score_codex":0.005025449,"about_ca_system_score_gemma":0.0060403636,"threshold_uncertainty_score":0.11068177},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11189675,0.0025736145,0.81199044,0.0028155698,0.0010832512,0.0010253165,0.0045464723,0.044295736,0.019772965],"genre_scores_gemma":[0.31950974,0.0009600887,0.6386745,0.0007992038,0.0003329746,0.0005341405,0.005553722,0.00092522945,0.032710403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856406,0.0005079732,0.0001455566,0.00029115635,0.0004242846,0.00006696762],"domain_scores_gemma":[0.991486,0.0038168612,0.00040932876,0.0021499677,0.0016881352,0.0004497025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030406078,0.0013498391,0.0014418194,0.0018767124,0.00092026324,0.0018541542,0.003226929,0.002860488,0.011210898],"category_scores_gemma":[0.014618926,0.0010200245,0.00072056777,0.0014453455,0.0003676628,0.0038595046,0.0016338613,0.0020673492,0.0058612],"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.0022655253,0.0022435493,0.022469604,0.0014865515,0.00082926505,0.00050958863,0.000898004,0.017156295,0.014695325,0.011681321,0.076407805,0.84935707],"study_design_scores_gemma":[0.0014479419,0.0022420678,0.014505526,0.00029844383,0.0015259056,0.001210974,0.00049635186,0.79918206,0.025492825,0.020302162,0.1327587,0.00053710875],"about_ca_topic_score_codex":0.0070845787,"about_ca_topic_score_gemma":0.023798356,"teacher_disagreement_score":0.011210898,"about_ca_system_score_codex":0.00053563656,"about_ca_system_score_gemma":0.0014134693,"threshold_uncertainty_score":0.037504137},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013289757,0.05370495,0.0025467917,0.038417846,0.0128753055,0.00007989999,0.002221544,0.0008948661,0.88792986],"genre_scores_gemma":[0.0024690984,0.00465402,0.00027729,0.0009983792,0.0002792903,0.000014140284,0.00016567725,0.00013340743,0.9910087],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995517,0.000035223376,0.000021902439,0.00013865942,0.00019345256,0.00005897281],"domain_scores_gemma":[0.99917245,0.0000700423,0.000049220085,0.0000711432,0.00047291678,0.00016434853],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005207828,0.00090450834,0.0004898746,0.0010184112,0.0027962734,0.0030186365,0.00071260356,0.0019860542,0.3664904],"category_scores_gemma":[0.0015477504,0.00049115927,0.00030021535,0.0012831136,0.00075573503,0.0025674393,0.0017392087,0.0025957034,0.25690192],"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.000023133445,0.0000065980635,0.00012654287,0.000052944248,0.0000017312119,0.00007191167,0.00020868766,0.00006338718,0.000296745,0.008046574,0.9097392,0.081362516],"study_design_scores_gemma":[0.000001853505,0.0000031577717,0.00019654211,0.000027660017,9.34861e-7,0.000044919805,0.000118712705,0.000017310647,0.00007858832,0.00043443622,0.9990734,0.0000025366635],"about_ca_topic_score_codex":0.043054,"about_ca_topic_score_gemma":0.106016934,"teacher_disagreement_score":0.3664904,"about_ca_system_score_codex":0.0019866508,"about_ca_system_score_gemma":0.0024022565,"threshold_uncertainty_score":0.90362453},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013119207,0.0328817,0.00030941862,0.0044935406,0.0035846375,0.000031882973,0.0048056534,0.00021563194,0.95236564],"genre_scores_gemma":[0.004814724,0.0054046037,0.00014880736,0.00056538923,0.00023404723,0.000012918236,0.00064977637,0.00006348938,0.98810625],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998103,0.000014798763,0.000011690987,0.000054780892,0.00007199459,0.000036532714],"domain_scores_gemma":[0.9998981,0.00000897089,0.000012542838,0.000006133323,0.00005052923,0.00002379924],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016038807,0.0008260573,0.00031665692,0.0013309587,0.0019326573,0.0017014269,0.00044693673,0.0010216808,0.44039273],"category_scores_gemma":[0.00044624068,0.00035782089,0.00020702898,0.0016678371,0.00043905515,0.0022864812,0.0011333482,0.001292471,0.21533705],"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.000029943067,0.000007298919,0.00023123066,0.00007085256,0.0000023158375,0.00014118385,0.00019344843,0.00004066676,0.000105688276,0.006808612,0.89403397,0.09833482],"study_design_scores_gemma":[9.315141e-7,0.000002789727,0.00038193775,0.000040420568,5.3729127e-7,0.000057517413,0.000058180038,0.0000045856286,0.000026208996,0.00023695736,0.99918896,0.0000010258203],"about_ca_topic_score_codex":0.03503683,"about_ca_topic_score_gemma":0.15585294,"teacher_disagreement_score":0.44039273,"about_ca_system_score_codex":0.001773638,"about_ca_system_score_gemma":0.000871494,"threshold_uncertainty_score":0.7982118},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005977027,0.00044722104,0.97094864,0.0008238372,0.00009564588,0.00018160268,0.00033652261,0.012565462,0.008624121],"genre_scores_gemma":[0.1996475,0.001037827,0.78164864,0.00030042077,0.00014383518,0.000472559,0.0034963284,0.0013199077,0.011932945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772376,0.00056998,0.00020663436,0.00039364098,0.0009294553,0.00017646517],"domain_scores_gemma":[0.9978631,0.0005421622,0.0001711853,0.00064263184,0.00060048496,0.00018050482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047958633,0.0009198499,0.0011198049,0.0022060238,0.0011834933,0.0067359135,0.0045329197,0.001955718,0.009041835],"category_scores_gemma":[0.0077378326,0.0007163129,0.0011677776,0.0018456463,0.0015252823,0.0055878926,0.005373251,0.0022110455,0.0028883354],"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.000706913,0.00027611107,0.0027487453,0.0005891265,0.00025976478,0.0005608148,0.00198291,0.16955104,0.017638683,0.3450493,0.029865626,0.43077096],"study_design_scores_gemma":[0.0000956118,0.00028402393,0.0006760068,0.00025779192,0.00014926954,0.0002596127,0.00040857363,0.733319,0.016455457,0.092441626,0.15555196,0.000101164514],"about_ca_topic_score_codex":0.0071047526,"about_ca_topic_score_gemma":0.006728886,"teacher_disagreement_score":0.009041835,"about_ca_system_score_codex":0.0019001106,"about_ca_system_score_gemma":0.004020925,"threshold_uncertainty_score":0.030247986},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04456881,0.00029194003,0.9167014,0.002138568,0.00014067316,0.0010877104,0.0038754686,0.019484634,0.011710751],"genre_scores_gemma":[0.22267094,0.00030570282,0.76987827,0.00027760305,0.000050173137,0.00034884666,0.0041672736,0.0003145875,0.0019865807],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784744,0.00074832694,0.0004393045,0.00025781064,0.0006063576,0.00010086433],"domain_scores_gemma":[0.99365824,0.004440095,0.00027792162,0.00076221576,0.00070638466,0.00015516153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00450131,0.0006480613,0.00060406764,0.0031767844,0.0007734995,0.004668549,0.0020865311,0.0013787558,0.0069355504],"category_scores_gemma":[0.014648222,0.0005509783,0.0012211865,0.0021585647,0.00091078255,0.0023791126,0.0022030796,0.0011847031,0.0020423478],"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.0010950946,0.0010873968,0.011863994,0.0010736116,0.00032655676,0.007233894,0.0035601973,0.30026674,0.017358746,0.105355375,0.036443878,0.5143345],"study_design_scores_gemma":[0.0002963477,0.00011436601,0.0013993474,0.00037655653,0.00019938314,0.0009322935,0.00068680174,0.85267276,0.01830976,0.07226206,0.052660234,0.00009006396],"about_ca_topic_score_codex":0.007603923,"about_ca_topic_score_gemma":0.006914792,"teacher_disagreement_score":0.007603923,"about_ca_system_score_codex":0.0014499519,"about_ca_system_score_gemma":0.0015777758,"threshold_uncertainty_score":0.0238055},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009255555,0.00020564723,0.96750826,0.00033381942,0.00008441298,0.0002801861,0.00067004544,0.009816253,0.011845772],"genre_scores_gemma":[0.24581024,0.00037953458,0.74298763,0.00011682148,0.00006217426,0.000422332,0.0015037573,0.00027170032,0.008445794],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999456,0.00016086163,0.00003525855,0.000113839,0.00019495879,0.000039093444],"domain_scores_gemma":[0.9992907,0.0002941162,0.000069925314,0.00016755679,0.00013622518,0.000041362735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081819354,0.000551708,0.0003897361,0.0009839939,0.0009899999,0.0017236745,0.0011223252,0.0006938623,0.009935077],"category_scores_gemma":[0.001855974,0.00028396104,0.0004955454,0.0007329083,0.0006939705,0.001140633,0.00071701396,0.0007311531,0.002002321],"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.00028503343,0.00022880026,0.0021103423,0.00043486,0.0001128344,0.00055087096,0.00054688775,0.368071,0.01821597,0.12033103,0.025357524,0.46375477],"study_design_scores_gemma":[0.000103661565,0.000074515316,0.00059839437,0.00005760794,0.000046775247,0.00013294703,0.00010014431,0.90145504,0.0065135825,0.023755746,0.06713208,0.000029387842],"about_ca_topic_score_codex":0.013983349,"about_ca_topic_score_gemma":0.016686417,"teacher_disagreement_score":0.013983349,"about_ca_system_score_codex":0.0011967864,"about_ca_system_score_gemma":0.003086945,"threshold_uncertainty_score":0.033236146},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015029203,0.00011399231,0.9960867,0.000075285985,0.00002742249,0.00005454076,0.000084122745,0.0012049194,0.00085005054],"genre_scores_gemma":[0.09092419,0.00022249781,0.90537125,0.00012991358,0.00008705308,0.0003068516,0.00038588585,0.00037097276,0.0022013637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987754,0.000312375,0.0001036929,0.00032388564,0.0004014738,0.0000830901],"domain_scores_gemma":[0.9954346,0.003038551,0.00025660804,0.00059150043,0.0005241712,0.00015466865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00211202,0.0014020349,0.0014462679,0.0019703694,0.00080320064,0.0021608379,0.0044279573,0.0022113274,0.011020382],"category_scores_gemma":[0.010084064,0.0011565881,0.0013244844,0.0024214077,0.0012337386,0.00413836,0.003510541,0.002688856,0.0020788566],"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.000349032,0.00016146612,0.0007226451,0.00042341722,0.00012603833,0.00011384747,0.00020266917,0.23952438,0.004002095,0.03017233,0.0076114824,0.7165905],"study_design_scores_gemma":[0.000041183685,0.00005536239,0.000076240765,0.000021435408,0.000023256536,0.000035782472,0.000013754791,0.97408426,0.0020972562,0.020584052,0.0029549089,0.000012624586],"about_ca_topic_score_codex":0.0030851716,"about_ca_topic_score_gemma":0.0060038315,"teacher_disagreement_score":0.011020382,"about_ca_system_score_codex":0.0008260963,"about_ca_system_score_gemma":0.0018154632,"threshold_uncertainty_score":0.036866903},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009415606,0.0012526222,0.9805002,0.00048041716,0.00004711962,0.000088443456,0.00020557405,0.0010480823,0.015435997],"genre_scores_gemma":[0.0318534,0.0023272487,0.9583991,0.000104795574,0.000045510773,0.00018882156,0.00077946787,0.00017719479,0.006124389],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981893,0.0005688934,0.00024373106,0.00022098787,0.00067983544,0.00009735589],"domain_scores_gemma":[0.99582976,0.0026310694,0.00013713815,0.00087360723,0.00044555563,0.00008287349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021486946,0.0008566864,0.0006497914,0.0037595425,0.0010303619,0.005422886,0.002420125,0.0011041078,0.010253324],"category_scores_gemma":[0.008149948,0.00095438655,0.0014833022,0.004456706,0.002069491,0.005978193,0.0026783745,0.0024605012,0.002924224],"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.000030503912,0.0000898269,0.00025835764,0.00069507747,0.000060523103,0.000119100085,0.00056713115,0.019545186,0.0013311852,0.4699729,0.008272287,0.49905795],"study_design_scores_gemma":[0.000027339309,0.000027624512,0.00031102513,0.0005724644,0.000060314407,0.00019860402,0.00042255322,0.08275115,0.0034809022,0.7477907,0.16432308,0.0000343023],"about_ca_topic_score_codex":0.008499248,"about_ca_topic_score_gemma":0.008734792,"teacher_disagreement_score":0.010253324,"about_ca_system_score_codex":0.001593623,"about_ca_system_score_gemma":0.0028973676,"threshold_uncertainty_score":0.034300745},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011510993,0.01836888,0.4034236,0.16087183,0.0058448557,0.00007022719,0.00032908795,0.0042848974,0.39529565],"genre_scores_gemma":[0.45760664,0.02231027,0.2728516,0.027862996,0.0046967114,0.0004446089,0.00095218857,0.0037686336,0.20950627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956168,0.0017931297,0.00017419674,0.00055423187,0.0015375323,0.00032399863],"domain_scores_gemma":[0.9869652,0.005098677,0.00036083022,0.004734476,0.0020402828,0.00080056814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008905393,0.0005374226,0.00047283774,0.0015000413,0.0024523223,0.0081227645,0.0016841248,0.003976207,0.01409198],"category_scores_gemma":[0.016714685,0.0005775531,0.0006358593,0.0011582037,0.008230989,0.022695303,0.0043524276,0.008009508,0.005380708],"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.000016311093,0.000017024639,0.0001337583,0.000050083454,0.0000103567545,0.000024634393,0.00079609844,0.000808831,0.00017632855,0.9254129,0.032188408,0.040365312],"study_design_scores_gemma":[0.000008659055,0.000013737203,0.00008274479,0.00016141546,0.000008493704,0.000048999,0.00030896018,0.0032074735,0.00035314122,0.503724,0.49206436,0.000017968143],"about_ca_topic_score_codex":0.003744145,"about_ca_topic_score_gemma":0.003222184,"teacher_disagreement_score":0.01409198,"about_ca_system_score_codex":0.0032456783,"about_ca_system_score_gemma":0.004070178,"threshold_uncertainty_score":0.047142327},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009836418,0.00033062443,0.9854047,0.000211045,0.00004986011,0.00008858721,0.00012508106,0.0007173323,0.0032363627],"genre_scores_gemma":[0.15926076,0.000331168,0.8358716,0.00032166837,0.000045458542,0.0003281942,0.0004954427,0.00022598014,0.0031198259],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911946,0.00032331416,0.00006014331,0.00013417337,0.00025448715,0.00010831879],"domain_scores_gemma":[0.99884087,0.00052963936,0.000114251045,0.00021488858,0.00023148186,0.000068789755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015321705,0.0007533528,0.0013174076,0.0010899355,0.00069689215,0.0010620017,0.0019299826,0.0014299864,0.0039272346],"category_scores_gemma":[0.0042122905,0.0006009999,0.0009768636,0.0018810029,0.0009947612,0.0017198456,0.0014861454,0.0009793787,0.0012884194],"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.00037017872,0.000120686396,0.0026021209,0.00024807337,0.00014383512,0.00016887803,0.0002957608,0.6085278,0.006891075,0.07336405,0.014286391,0.29298124],"study_design_scores_gemma":[0.00005406764,0.00007000277,0.00013484598,0.000021185977,0.00003147827,0.00007092047,0.00002861183,0.973797,0.0011059148,0.020915464,0.0037573015,0.000013184978],"about_ca_topic_score_codex":0.00465667,"about_ca_topic_score_gemma":0.006376651,"teacher_disagreement_score":0.00465667,"about_ca_system_score_codex":0.0009638053,"about_ca_system_score_gemma":0.0028448731,"threshold_uncertainty_score":0.013137877},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011078402,0.00016329037,0.9818325,0.00013582781,0.000038347705,0.00008572126,0.00008100375,0.0048305527,0.0017544357],"genre_scores_gemma":[0.34421253,0.000320061,0.6466503,0.00026520054,0.00003337475,0.00043118707,0.0006377204,0.00034742543,0.007102138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996455,0.00004611369,0.000021425561,0.00012402073,0.000116462594,0.000046480287],"domain_scores_gemma":[0.9994123,0.00020177591,0.000047276193,0.00016997103,0.00011291154,0.000055713735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087854284,0.0007357537,0.000757176,0.00032907675,0.0004227655,0.0008096189,0.0039315494,0.0009127011,0.00396078],"category_scores_gemma":[0.0017061278,0.0006581292,0.00059350365,0.00033215273,0.00096893596,0.002113531,0.0022649998,0.0020914464,0.0010752128],"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.0004285463,0.00034911928,0.0014271886,0.00024384321,0.00016711609,0.00020146203,0.0002146057,0.5282639,0.020362834,0.01714576,0.007971189,0.42322445],"study_design_scores_gemma":[0.000029282663,0.000048049606,0.00013658224,0.0000058169003,0.000014277914,0.000027455468,0.000013282334,0.98568094,0.0045705624,0.0068847314,0.0025787281,0.000010250704],"about_ca_topic_score_codex":0.0053065238,"about_ca_topic_score_gemma":0.010118995,"teacher_disagreement_score":0.0053065238,"about_ca_system_score_codex":0.00082976004,"about_ca_system_score_gemma":0.0014332496,"threshold_uncertainty_score":0.013250172},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13496092,0.00083018525,0.8064883,0.0029670966,0.00018272945,0.00011893085,0.00014630028,0.0022344019,0.0520711],"genre_scores_gemma":[0.9082928,0.00044164917,0.08353872,0.00036988693,0.000078198296,0.00011549125,0.0001669752,0.00018975449,0.0068066134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980507,0.0003966071,0.00014850727,0.00037232376,0.00072099344,0.0003109311],"domain_scores_gemma":[0.97603637,0.018015455,0.001002993,0.0030521052,0.0011959085,0.0006972081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021515389,0.00070413924,0.00062350655,0.0006159877,0.00093041715,0.0023522747,0.0018872648,0.0015780614,0.004075054],"category_scores_gemma":[0.019925743,0.0006539542,0.00067535386,0.0005862676,0.004383718,0.006609817,0.003632975,0.002948681,0.0005715518],"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.0011116873,0.0004333605,0.0051193335,0.00044980051,0.00012035753,0.0004402718,0.0015053295,0.18515815,0.038474858,0.5213478,0.0050370684,0.24080199],"study_design_scores_gemma":[0.00006694244,0.00020394778,0.001267854,0.000040816212,0.00005471316,0.00019284966,0.00021345087,0.55282146,0.017339658,0.42247525,0.0052816956,0.000041331892],"about_ca_topic_score_codex":0.0035871337,"about_ca_topic_score_gemma":0.002041655,"teacher_disagreement_score":0.004075054,"about_ca_system_score_codex":0.0005083825,"about_ca_system_score_gemma":0.0011547821,"threshold_uncertainty_score":0.013632417},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007646748,0.0021996144,0.9807755,0.0008136847,0.00009427294,0.00008638687,0.00005288908,0.00027784353,0.008053147],"genre_scores_gemma":[0.48282143,0.00412578,0.50252205,0.0009625353,0.0004979714,0.00081864005,0.00034141296,0.00030665327,0.007603458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99687093,0.0017059394,0.00014449778,0.00041459606,0.0006557817,0.0002083113],"domain_scores_gemma":[0.98743933,0.010410039,0.00055467786,0.0006735333,0.0006534534,0.00026907708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004880843,0.0014914868,0.0022003641,0.0012188153,0.00081569824,0.0022755025,0.0029858593,0.0023120828,0.0034789895],"category_scores_gemma":[0.019417161,0.0007936913,0.00096630346,0.0023659135,0.0035266576,0.0039741513,0.0031877551,0.0030877318,0.0006757012],"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.00015341418,0.00009606649,0.0005984452,0.00019466189,0.000101815785,0.00004650446,0.00015227096,0.7492136,0.00033093878,0.19131272,0.0019065563,0.055893037],"study_design_scores_gemma":[0.000047690155,0.00007737747,0.00011839706,0.000037356967,0.000017487899,0.00001674283,0.000016394693,0.80718315,0.00025714532,0.19036472,0.0018504129,0.0000130581075],"about_ca_topic_score_codex":0.005105047,"about_ca_topic_score_gemma":0.0037824644,"teacher_disagreement_score":0.005105047,"about_ca_system_score_codex":0.0024491583,"about_ca_system_score_gemma":0.002216049,"threshold_uncertainty_score":0.025812685},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021515137,0.000080034166,0.9931579,0.00023613928,0.00001858827,0.000042382162,0.00013117673,0.001120352,0.0030619577],"genre_scores_gemma":[0.10157302,0.00031114818,0.893597,0.00018088926,0.00003308138,0.00038422752,0.0005014003,0.0005920052,0.002827197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999027,0.0003008442,0.000089188085,0.00013176682,0.00036283443,0.000088260545],"domain_scores_gemma":[0.9989182,0.00038218687,0.00009797802,0.00034318134,0.00017719866,0.00008131049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015282342,0.0007405233,0.0006220061,0.0009359234,0.0008335417,0.0019527939,0.0024508038,0.000987895,0.004934959],"category_scores_gemma":[0.0032233207,0.000679184,0.0018840188,0.00087486184,0.0028152529,0.0034263134,0.0033377493,0.0022422043,0.0012349014],"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.00004008733,0.000034606182,0.0008040483,0.00019686976,0.00004074262,0.00014495171,0.00060742575,0.21630403,0.0024072835,0.7429332,0.0027485015,0.033738237],"study_design_scores_gemma":[0.00001709886,0.000026036867,0.00022011549,0.00005873679,0.000017505348,0.00006530872,0.000082736784,0.6887321,0.0022117149,0.27548835,0.033055786,0.00002455609],"about_ca_topic_score_codex":0.0101278825,"about_ca_topic_score_gemma":0.012776913,"teacher_disagreement_score":0.0101278825,"about_ca_system_score_codex":0.0016336349,"about_ca_system_score_gemma":0.0030110448,"threshold_uncertainty_score":0.020137846},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75456744,0.00011783033,0.22576939,0.0007374615,0.000036530408,0.0005508329,0.00013512766,0.0012970598,0.016788272],"genre_scores_gemma":[0.9389023,0.000058015787,0.058613084,0.000059117065,0.0000033350998,0.00013222497,0.00007193267,0.00008775608,0.0020722281],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990785,0.0003899906,0.000031603984,0.00010806074,0.00025594264,0.00013592649],"domain_scores_gemma":[0.99801946,0.0012973009,0.00010421675,0.000262917,0.00019570014,0.00012045645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015670015,0.0004954292,0.0003194779,0.00037285002,0.0014359279,0.0010851899,0.0011544527,0.0012509915,0.0024730454],"category_scores_gemma":[0.0042827693,0.00029355666,0.00045952754,0.00027681718,0.0025920726,0.001348644,0.0014552459,0.0012495404,0.0002148308],"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.0008926017,0.0010444103,0.0124847,0.0006077255,0.000073800285,0.005032085,0.008689346,0.78259706,0.054886453,0.063771114,0.0018985439,0.068022095],"study_design_scores_gemma":[0.00019172326,0.0010228913,0.0045739287,0.00010751552,0.00003873217,0.0005519211,0.0029646296,0.91705346,0.036426395,0.016544312,0.020456212,0.0000682281],"about_ca_topic_score_codex":0.0149652595,"about_ca_topic_score_gemma":0.021869004,"teacher_disagreement_score":0.0149652595,"about_ca_system_score_codex":0.0019257335,"about_ca_system_score_gemma":0.0025383509,"threshold_uncertainty_score":0.029756308},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020358538,0.0019063213,0.95635724,0.0010868413,0.0001635135,0.00031606457,0.0003117106,0.012363353,0.007136468],"genre_scores_gemma":[0.15249772,0.0010206731,0.8374909,0.0007723616,0.00011761798,0.00027220542,0.0007685764,0.0011196556,0.0059403107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980782,0.00064285006,0.00015690833,0.0004379987,0.0005660718,0.000117843934],"domain_scores_gemma":[0.99639916,0.001573802,0.0002520643,0.0011512407,0.00046813497,0.00015564148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003521169,0.0014133723,0.0012429577,0.0012081676,0.0009374227,0.0026301937,0.003082067,0.0017968008,0.004925669],"category_scores_gemma":[0.009025494,0.0007440566,0.0011089066,0.001101237,0.001640739,0.0047855577,0.0028111541,0.0032761795,0.003246533],"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.00060211157,0.00040985955,0.0018971775,0.00095702574,0.00022400032,0.0003161409,0.00086323626,0.21421468,0.02751306,0.062334254,0.03204451,0.65862393],"study_design_scores_gemma":[0.000120058736,0.0002879741,0.00036094114,0.00006883658,0.000092808456,0.00024111578,0.00015905034,0.91199505,0.015251979,0.03359921,0.03775297,0.00007004174],"about_ca_topic_score_codex":0.006540851,"about_ca_topic_score_gemma":0.008600374,"teacher_disagreement_score":0.006540851,"about_ca_system_score_codex":0.0010151999,"about_ca_system_score_gemma":0.0018109919,"threshold_uncertainty_score":0.018621981},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02505149,0.0005557616,0.7852089,0.0007679552,0.0009252484,0.00064846047,0.0013194316,0.12386066,0.061662048],"genre_scores_gemma":[0.23418419,0.0006874114,0.6334662,0.0009885546,0.00031791403,0.00076055154,0.0045822687,0.010218342,0.11479457],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991074,0.00023636837,0.00006916008,0.00029584338,0.0002285418,0.00006263604],"domain_scores_gemma":[0.99886143,0.0004237958,0.00007101289,0.00023527084,0.00028977415,0.000118773234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010937846,0.00090709236,0.0005448971,0.0005746032,0.00050518394,0.0021421493,0.0015148419,0.0010522923,0.036348093],"category_scores_gemma":[0.003381573,0.0004480802,0.0003781803,0.00035909828,0.0009792098,0.0024232157,0.0018504461,0.0011786182,0.019245861],"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.0020628534,0.00024143662,0.0025699877,0.0015025557,0.00011308668,0.0019147786,0.0042158104,0.0115395,0.22124186,0.05564045,0.14372377,0.5552339],"study_design_scores_gemma":[0.0004011135,0.0008750145,0.0013551571,0.0002691285,0.00012936471,0.0027168684,0.0012172123,0.15089607,0.18427996,0.015637407,0.64197886,0.00024378003],"about_ca_topic_score_codex":0.0006962227,"about_ca_topic_score_gemma":0.00063842733,"teacher_disagreement_score":0.036348093,"about_ca_system_score_codex":0.00039607155,"about_ca_system_score_gemma":0.0008028506,"threshold_uncertainty_score":0.121596515},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011749621,0.00024008687,0.85288966,0.00053096714,0.0002346255,0.0005828814,0.0006822995,0.12443122,0.008658642],"genre_scores_gemma":[0.14916699,0.00028994484,0.82996887,0.0004282942,0.00004748533,0.0013449367,0.0025582484,0.0071994485,0.008995759],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881124,0.00035223525,0.00011588532,0.0002741733,0.00033955378,0.0001068912],"domain_scores_gemma":[0.9974069,0.0011207713,0.00014337339,0.00059367507,0.0004672195,0.0002679569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021144433,0.0012687957,0.00062952517,0.00078555173,0.0010329629,0.0016920795,0.003973834,0.0016715173,0.0093209],"category_scores_gemma":[0.007908182,0.0008320358,0.00090706465,0.00043111914,0.0013362799,0.0025186387,0.0037039663,0.0029230856,0.003034058],"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.0020833411,0.00092301774,0.005412216,0.0014155069,0.00036455385,0.0009486925,0.0015833474,0.2643894,0.035700202,0.1413054,0.14909723,0.39677706],"study_design_scores_gemma":[0.00023951977,0.00012658909,0.000304599,0.000076808436,0.000045463592,0.0001412155,0.0000521016,0.879071,0.013462855,0.026994139,0.07941895,0.000066783134],"about_ca_topic_score_codex":0.008921315,"about_ca_topic_score_gemma":0.009535046,"teacher_disagreement_score":0.0093209,"about_ca_system_score_codex":0.0013412053,"about_ca_system_score_gemma":0.0044548227,"threshold_uncertainty_score":0.031181455},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031445444,0.0006895537,0.9307094,0.0008149714,0.00007528844,0.00034108665,0.0024076512,0.025455201,0.008061376],"genre_scores_gemma":[0.18328722,0.0003485415,0.80584115,0.00038570282,0.000028353013,0.0004091227,0.006169977,0.0014828295,0.0020471576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845827,0.00054039696,0.00009557421,0.00044705768,0.00036719677,0.00009149748],"domain_scores_gemma":[0.9935963,0.0043334514,0.00028126274,0.0012472564,0.00037920152,0.00016246321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018730647,0.0020986204,0.00093774823,0.001242854,0.00062935654,0.002304361,0.003897454,0.0017464628,0.00601095],"category_scores_gemma":[0.012944503,0.0009596947,0.002087862,0.0011707447,0.0014080937,0.004695608,0.0029479058,0.0038442488,0.0020944462],"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.00020980796,0.00034055253,0.0024253146,0.0008623592,0.00017284733,0.00034280578,0.0003547588,0.70252144,0.006028068,0.019316854,0.016497444,0.25092775],"study_design_scores_gemma":[0.0000313924,0.00004176747,0.00013193183,0.00003460572,0.000022596028,0.00005325751,0.000058248505,0.97685224,0.0031070076,0.014543815,0.0051100887,0.000013123706],"about_ca_topic_score_codex":0.01235602,"about_ca_topic_score_gemma":0.028999025,"teacher_disagreement_score":0.01235602,"about_ca_system_score_codex":0.0017192251,"about_ca_system_score_gemma":0.0027833208,"threshold_uncertainty_score":0.0245682},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003622531,0.0031997776,0.91281337,0.0032949331,0.00033565343,0.00025273333,0.00039138447,0.00086667726,0.0752229],"genre_scores_gemma":[0.2659477,0.0070760986,0.6950797,0.0019631325,0.00065277505,0.0009904887,0.0014745971,0.00045542282,0.026360078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99615127,0.0013439861,0.00038018657,0.0010780976,0.0007681661,0.00027817738],"domain_scores_gemma":[0.9957712,0.0026009716,0.00025191696,0.00085178536,0.00039639472,0.0001277145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042594783,0.0013972543,0.00096678565,0.0017375662,0.0021970868,0.0045109615,0.0022511808,0.0022289706,0.012508526],"category_scores_gemma":[0.009063508,0.0009165176,0.0030955032,0.0019635519,0.009290752,0.009138871,0.0045443363,0.00444446,0.001939615],"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.000020244002,0.000011177582,0.00018702378,0.00018070439,0.00002421206,0.000097466254,0.00035638927,0.015731953,0.00019672526,0.951355,0.0022917509,0.029547345],"study_design_scores_gemma":[0.000011021441,0.000017270773,0.00007441762,0.000084776475,0.000017111417,0.00007790188,0.00007587286,0.016132673,0.00031869876,0.95660174,0.026570475,0.000018063865],"about_ca_topic_score_codex":0.010758361,"about_ca_topic_score_gemma":0.0090686325,"teacher_disagreement_score":0.012508526,"about_ca_system_score_codex":0.0042209676,"about_ca_system_score_gemma":0.003421551,"threshold_uncertainty_score":0.041845262},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011624999,0.00020840528,0.99469525,0.0002487301,0.0000172713,0.00009544966,0.00008199354,0.00039714258,0.003093432],"genre_scores_gemma":[0.048133645,0.0007786685,0.9483711,0.0001642833,0.00004429057,0.00035615382,0.00033230666,0.0001572095,0.0016623355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954507,0.0018773181,0.00027780203,0.00043730743,0.0017633074,0.0001936606],"domain_scores_gemma":[0.9919761,0.0064955526,0.0003572917,0.00059078477,0.0004903961,0.00008999766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034339633,0.0013793907,0.00077856256,0.0013208443,0.0009912249,0.0018514963,0.0021754028,0.0010280135,0.0073303906],"category_scores_gemma":[0.013524323,0.0009257169,0.0018667687,0.0033674834,0.0017923001,0.0029633585,0.0026171072,0.003224179,0.001426512],"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.00008516644,0.00013012403,0.00044739462,0.00092796964,0.00019705207,0.00017921906,0.00040073757,0.42896897,0.0035169276,0.29662853,0.008487395,0.26003057],"study_design_scores_gemma":[0.00008558629,0.00006391608,0.00014185827,0.00010554233,0.00006779788,0.0001552048,0.0001236247,0.7473575,0.0051527913,0.21578312,0.030926332,0.000036679354],"about_ca_topic_score_codex":0.007910105,"about_ca_topic_score_gemma":0.010659343,"teacher_disagreement_score":0.007910105,"about_ca_system_score_codex":0.0012392446,"about_ca_system_score_gemma":0.0029743523,"threshold_uncertainty_score":0.024522603},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033404592,0.0002518016,0.81720585,0.00041544612,0.00009174379,0.00047390262,0.00060388964,0.13635188,0.011200893],"genre_scores_gemma":[0.356374,0.00022167286,0.6173471,0.00059823116,0.0000596489,0.00065134704,0.0018457691,0.0034031027,0.019499164],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992854,0.00023172714,0.00004858613,0.00019189231,0.00016855051,0.00007387018],"domain_scores_gemma":[0.99881065,0.000493615,0.000121255056,0.0002462848,0.00014893776,0.00017933003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012102898,0.00097547175,0.00045336434,0.00063070457,0.0005746073,0.0012206621,0.0022185135,0.0010709593,0.008220478],"category_scores_gemma":[0.0043690456,0.0004711216,0.00049936987,0.00033986496,0.00059931015,0.0027065433,0.0030752483,0.0012632471,0.0039646267],"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.0021413842,0.0011692783,0.0044981865,0.00094937306,0.00018468435,0.0018066621,0.0054719644,0.0256936,0.07030477,0.02718951,0.081399344,0.7791912],"study_design_scores_gemma":[0.00054775993,0.0006415137,0.0027099021,0.00014277633,0.00021090815,0.0011472572,0.0009202001,0.74372804,0.04650146,0.036894098,0.16626346,0.00029259757],"about_ca_topic_score_codex":0.004071464,"about_ca_topic_score_gemma":0.005080143,"teacher_disagreement_score":0.008220478,"about_ca_system_score_codex":0.0005552156,"about_ca_system_score_gemma":0.0021175656,"threshold_uncertainty_score":0.027500212},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027352755,0.0067943693,0.015812824,0.0012406361,0.002027162,0.00051737385,0.015484056,0.016536595,0.9388516],"genre_scores_gemma":[0.0040632184,0.0024326192,0.0026468863,0.0006471654,0.00010385967,0.00024619987,0.008125813,0.0018272506,0.9799069],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991829,0.000059166654,0.000067840076,0.00024173825,0.00028296828,0.00016534224],"domain_scores_gemma":[0.99849224,0.0003577042,0.000072834126,0.00047868417,0.00036171763,0.00023682126],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001989755,0.0038672355,0.0024881777,0.0026740206,0.0024328874,0.00447179,0.0031399913,0.004858231,0.93682724],"category_scores_gemma":[0.0031957135,0.0017500543,0.001258679,0.01086089,0.0015105307,0.0098680565,0.0053763585,0.0027760735,0.9518832],"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.0003448742,0.00020561782,0.00045790587,0.00073361036,0.0000485947,0.00024409467,0.00011028562,0.00096975756,0.0013986046,0.0070951856,0.6129475,0.37544397],"study_design_scores_gemma":[0.000040745905,0.000034476383,0.00070068944,0.00027230976,0.00004727135,0.00013679672,0.000078643905,0.0010628882,0.0005438944,0.0017070083,0.9953381,0.00003717327],"about_ca_topic_score_codex":0.024056245,"about_ca_topic_score_gemma":0.018345375,"teacher_disagreement_score":0.06317276,"about_ca_system_score_codex":0.0025500583,"about_ca_system_score_gemma":0.0012857016,"threshold_uncertainty_score":0.090108275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060015067,0.0049105296,0.8941977,0.002620298,0.00015766187,0.00011521056,0.00028905764,0.00052096165,0.037173443],"genre_scores_gemma":[0.84761935,0.0033702494,0.14178516,0.00035905332,0.00009146953,0.0002899929,0.00034438656,0.00007658821,0.006063797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993699,0.00033334285,0.00002084428,0.000115405615,0.00013705631,0.000023512439],"domain_scores_gemma":[0.9986908,0.00079858454,0.00017389904,0.00020481797,0.00007448191,0.00005741915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009527376,0.0005495821,0.00043718706,0.00048473242,0.00027297292,0.0014272749,0.0011125242,0.0007760156,0.005444979],"category_scores_gemma":[0.0042533064,0.00020361888,0.0005106265,0.00056981767,0.0019817792,0.0026949777,0.0009779945,0.0011459902,0.0004365524],"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.00015406102,0.00013636457,0.0016730881,0.00035778814,0.00021332582,0.00010638227,0.00038302006,0.16846055,0.0027465592,0.70761687,0.0022273497,0.1159247],"study_design_scores_gemma":[0.0000140010325,0.00008313223,0.0011498574,0.000035337667,0.000030482734,0.000094647454,0.00008595292,0.16016787,0.0011342221,0.8318634,0.0053234342,0.000017777014],"about_ca_topic_score_codex":0.0013062546,"about_ca_topic_score_gemma":0.0012699775,"teacher_disagreement_score":0.005444979,"about_ca_system_score_codex":0.0009034425,"about_ca_system_score_gemma":0.00052626635,"threshold_uncertainty_score":0.018215239},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010705941,0.0010139662,0.9749215,0.00056682725,0.00009838242,0.00030531606,0.000305992,0.0007445005,0.011337504],"genre_scores_gemma":[0.10535591,0.0005030015,0.8899445,0.00017468004,0.00005516733,0.00052257284,0.0005707434,0.00016357595,0.0027098784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956086,0.0012757176,0.0008507667,0.00072032824,0.0011050459,0.00043945902],"domain_scores_gemma":[0.98997724,0.0049533565,0.0013136846,0.0013760786,0.001794578,0.000585045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033974985,0.0011234398,0.0006206742,0.0028290034,0.0017529475,0.0053938148,0.0028228464,0.0023298275,0.0055371625],"category_scores_gemma":[0.011569994,0.0011159137,0.0019251205,0.003102856,0.006079207,0.007193849,0.002410488,0.0028487702,0.0013928853],"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.00006286923,0.00005425805,0.00212091,0.0004314488,0.000032853663,0.0009015767,0.0019563274,0.00767484,0.003928585,0.94584334,0.0028626085,0.034130454],"study_design_scores_gemma":[0.000049712457,0.00018157582,0.0024304448,0.00048739027,0.00009727296,0.0035342735,0.0013029752,0.08791892,0.0049414886,0.74222964,0.15673456,0.00009176837],"about_ca_topic_score_codex":0.005414968,"about_ca_topic_score_gemma":0.0038897975,"teacher_disagreement_score":0.0055371625,"about_ca_system_score_codex":0.0016946178,"about_ca_system_score_gemma":0.0019293544,"threshold_uncertainty_score":0.018523633},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12119189,0.0005520509,0.86720574,0.0006118221,0.0000820347,0.00020899007,0.0015812488,0.004930809,0.003635357],"genre_scores_gemma":[0.6108944,0.0003173194,0.3842828,0.00014892864,0.00004161061,0.00018507462,0.0022981612,0.00038987744,0.0014419064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924016,0.00024144819,0.00005804911,0.00017178222,0.00019811101,0.00009055179],"domain_scores_gemma":[0.9954389,0.0031405513,0.00047192603,0.00026051744,0.00053020567,0.00015792881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010281125,0.0011761279,0.00067562296,0.0025368254,0.000924187,0.0009436718,0.0006112908,0.00084243796,0.0030465429],"category_scores_gemma":[0.0077863396,0.0003955814,0.0009955135,0.0014077439,0.00076530105,0.0017730109,0.00082403683,0.0012638933,0.0012061278],"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.0014405117,0.0005059001,0.031237198,0.00064725487,0.00027644794,0.0013464359,0.0014076228,0.37830174,0.06118236,0.017498104,0.008070191,0.49808618],"study_design_scores_gemma":[0.000018709668,0.00010871501,0.0029513063,0.0000357368,0.000045433313,0.000108667315,0.00016033942,0.95935184,0.008737625,0.026307678,0.0021286542,0.000045385073],"about_ca_topic_score_codex":0.013934925,"about_ca_topic_score_gemma":0.025753919,"teacher_disagreement_score":0.013934925,"about_ca_system_score_codex":0.0008843236,"about_ca_system_score_gemma":0.002084701,"threshold_uncertainty_score":0.027707577},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011390025,0.0006490992,0.96659863,0.0003491427,0.000062660365,0.000024427458,0.000057901598,0.00045165297,0.020416467],"genre_scores_gemma":[0.6075558,0.0015753469,0.3637893,0.00018672459,0.00015884756,0.00023889319,0.00024607085,0.00034043152,0.025908608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999584,0.00016825601,0.00002069015,0.00007871154,0.00011274725,0.000035550212],"domain_scores_gemma":[0.9986339,0.0009771592,0.0000503885,0.00019983429,0.000079540456,0.00005914193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008320509,0.0005429364,0.0006507452,0.00043342524,0.0003440706,0.0011711607,0.0012520411,0.00068999385,0.0093020955],"category_scores_gemma":[0.0039384365,0.0005188749,0.00040528757,0.00097607134,0.0014694639,0.0030280307,0.0013950778,0.0017077699,0.00097224384],"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.00011920522,0.00005453893,0.000564134,0.00013750514,0.000028406246,0.00005922273,0.00016252823,0.3031334,0.0014144987,0.46090624,0.0038895635,0.22953072],"study_design_scores_gemma":[0.000012056735,0.00003296711,0.00018279249,0.00002635262,0.000008409559,0.000023920376,0.000028449445,0.5506257,0.0012532455,0.4439789,0.0038161278,0.000011083652],"about_ca_topic_score_codex":0.0028218399,"about_ca_topic_score_gemma":0.0032140694,"teacher_disagreement_score":0.0093020955,"about_ca_system_score_codex":0.0009002154,"about_ca_system_score_gemma":0.0006633331,"threshold_uncertainty_score":0},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04088592,0.0005071478,0.7983793,0.006915909,0.00012729161,0.00020115763,0.00016540386,0.0005355805,0.15228237],"genre_scores_gemma":[0.7625247,0.00023861243,0.23083118,0.00047048097,0.00005835422,0.00024715293,0.00022042086,0.00012861253,0.0052804127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780625,0.00080506393,0.00015436602,0.0004965631,0.00052718783,0.00021050073],"domain_scores_gemma":[0.9970311,0.001154392,0.00030337877,0.0008660475,0.00032564087,0.0003194012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029234178,0.00059360405,0.00055032433,0.0013438815,0.0019860326,0.0052192914,0.002153834,0.0024101406,0.006603064],"category_scores_gemma":[0.0063503482,0.0005498163,0.0012032962,0.0006367129,0.012314124,0.013906216,0.005885405,0.0036490436,0.00097381236],"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.000011999286,0.000012884015,0.00025790205,0.000028391703,0.00000978876,0.000086309126,0.0019959342,0.0014802678,0.000621101,0.9875773,0.000457869,0.007460388],"study_design_scores_gemma":[0.0000083646155,0.000019284327,0.00026773295,0.000019448184,0.000005935554,0.00009025019,0.00043203047,0.0076590516,0.00044434395,0.98542887,0.0056096627,0.000015119649],"about_ca_topic_score_codex":0.0015395831,"about_ca_topic_score_gemma":0.0011241699,"teacher_disagreement_score":0.006603064,"about_ca_system_score_codex":0.0014128333,"about_ca_system_score_gemma":0.0015904784,"threshold_uncertainty_score":0.022089422},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070939106,0.00007369854,0.9875679,0.00015487683,0.000026126943,0.00015976893,0.00007531915,0.00085010665,0.003998294],"genre_scores_gemma":[0.13957144,0.00016013959,0.8571468,0.00012257304,0.00002118178,0.00040592533,0.0002568833,0.00018733091,0.0021276937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879813,0.0003482492,0.00009712492,0.00028868284,0.0002905547,0.0001772301],"domain_scores_gemma":[0.9986644,0.0006038756,0.0001274087,0.0004377555,0.00008597897,0.0000806094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001453952,0.0010204348,0.0006118151,0.0006037654,0.0007522133,0.0015076107,0.0023076807,0.0009473528,0.004105932],"category_scores_gemma":[0.0037810865,0.0006289147,0.001749294,0.0008484554,0.0026348562,0.003454249,0.0036301992,0.0019848533,0.0005007562],"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.00013284292,0.000110496854,0.00065720227,0.00047583453,0.000103172046,0.00060939294,0.0009123571,0.21898693,0.009720637,0.6291223,0.0026759403,0.1364929],"study_design_scores_gemma":[0.000058509955,0.00012120643,0.0001877743,0.00011863876,0.00009742118,0.00028570555,0.00022546695,0.4339295,0.012606839,0.5328806,0.019434271,0.00005396331],"about_ca_topic_score_codex":0.0027740903,"about_ca_topic_score_gemma":0.004290992,"teacher_disagreement_score":0.004105932,"about_ca_system_score_codex":0.0008625297,"about_ca_system_score_gemma":0.002287231,"threshold_uncertainty_score":0.013735712},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057046628,0.0001185617,0.99021506,0.00008852608,0.000025499428,0.00008754831,0.00005707057,0.0023145345,0.0013885751],"genre_scores_gemma":[0.060776383,0.00023123923,0.93671787,0.00011714455,0.000030603107,0.000113647206,0.00019021438,0.00035229672,0.001470606],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99552274,0.0017368804,0.0003490784,0.0005567837,0.0015712101,0.00026332887],"domain_scores_gemma":[0.98758554,0.009104464,0.00047287016,0.001738273,0.0009683428,0.0001304772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005050535,0.0010688448,0.0007378873,0.0012796554,0.00058606034,0.00175989,0.0024366851,0.0008144124,0.0038549001],"category_scores_gemma":[0.0132616395,0.0011515822,0.0017360639,0.0012008437,0.0017097637,0.004214647,0.002758396,0.0027394786,0.0018618709],"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.0003909768,0.0002839622,0.0017944099,0.0011518355,0.00009813504,0.00058445043,0.0007196924,0.13200714,0.055827323,0.3548763,0.005086656,0.44717908],"study_design_scores_gemma":[0.00017235205,0.00034217513,0.00027943077,0.00012642008,0.00013133291,0.0007313079,0.000090490896,0.71852046,0.123829074,0.1116226,0.044062596,0.000091715236],"about_ca_topic_score_codex":0.0013011359,"about_ca_topic_score_gemma":0.0015836435,"teacher_disagreement_score":0.005050535,"about_ca_system_score_codex":0.0010202418,"about_ca_system_score_gemma":0.0027679077,"threshold_uncertainty_score":0.026710153},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018913448,0.00040752316,0.9739083,0.0006891894,0.00006141764,0.000065068656,0.00010131138,0.00068570947,0.0051679793],"genre_scores_gemma":[0.44332993,0.00073709886,0.54865295,0.0006258941,0.00006139571,0.00038487086,0.0003559341,0.0005041203,0.005347719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931124,0.0027467886,0.0005001582,0.00097647565,0.00210784,0.0005563398],"domain_scores_gemma":[0.985499,0.008436821,0.00093835796,0.003952662,0.0009208958,0.00025222442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051173307,0.00093685876,0.0011084012,0.0012188137,0.002460405,0.0023784891,0.0020741483,0.0019199929,0.0035398097],"category_scores_gemma":[0.024955424,0.0011341517,0.0018652199,0.001997603,0.0066460753,0.008555519,0.0076047895,0.004025559,0.0005183892],"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.00017932172,0.000040965395,0.002623923,0.0003574768,0.0000811679,0.0006488612,0.0013867927,0.07127513,0.0027987866,0.84416246,0.0030054415,0.07343959],"study_design_scores_gemma":[0.000023218508,0.000059108974,0.0003285359,0.00010362854,0.00007299625,0.00039232126,0.00021353504,0.11034461,0.0048300107,0.87005895,0.013537692,0.00003534975],"about_ca_topic_score_codex":0.0026543038,"about_ca_topic_score_gemma":0.0029483319,"teacher_disagreement_score":0.0051173307,"about_ca_system_score_codex":0.0015063665,"about_ca_system_score_gemma":0.0030516768,"threshold_uncertainty_score":0.02706331},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061165236,0.002603199,0.90022355,0.00071489526,0.0003304356,0.00057339756,0.0039346647,0.013150415,0.017304188],"genre_scores_gemma":[0.44550157,0.0009830785,0.5333386,0.00037454278,0.00011465649,0.000402457,0.005067636,0.0009225793,0.013294836],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977756,0.00032391187,0.00036320547,0.0007022828,0.00061426946,0.00022073161],"domain_scores_gemma":[0.9921799,0.0018953056,0.00046637718,0.00412878,0.0010414402,0.0002881852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017574056,0.0008099809,0.0013858607,0.0016506519,0.000896331,0.004391465,0.004684245,0.0010101555,0.014204473],"category_scores_gemma":[0.008861248,0.00077949197,0.00096946594,0.0041912757,0.0006109524,0.007702685,0.002795166,0.0010899081,0.0041187294],"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.0016904679,0.0004536215,0.008994397,0.0010835778,0.00033100325,0.0008447637,0.00040132643,0.03162332,0.02169597,0.057206664,0.021848183,0.8538267],"study_design_scores_gemma":[0.00036195418,0.0014722723,0.0047473777,0.00038963594,0.00057587866,0.0040176995,0.0011203605,0.4117569,0.11997317,0.20511383,0.25020367,0.00026726857],"about_ca_topic_score_codex":0.0018738197,"about_ca_topic_score_gemma":0.0017687492,"teacher_disagreement_score":0.014204473,"about_ca_system_score_codex":0.0007911936,"about_ca_system_score_gemma":0.0013227888,"threshold_uncertainty_score":0.04751867},"labels":[],"label_agreement":null}]}