{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":116,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":116,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"7b44eacfed5d","filters":{"venue":"Journal of Artificial Intelligence Research"}},"results":[{"id":"W1662133657","doi":"10.1613/jair.2934","title":"From Frequency to Meaning: Vector Space Models of Semantics","year":2010,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Topic Modeling","field":"Computer Science","cited_by":2883,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"National Research Council Canada","funders":"","keywords":"Semantics (computer science); Meaning (existential); Computer science; Context (archaeology); Space (punctuation); Perspective (graphical); Artificial intelligence; Programming language; Psychology","authors":[{"name":"Peter D. Turney","is_ca":true},{"name":"Patrick Pantel","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2081680926678031,"gpt":0.4142808458992752,"spread":0.2061127532314721,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002809105,0.000881384,0.0009516493,0.004467224,0.0009208026,0.005835699,0.001745973,0.001375013,0.005364779],"category_scores_gemma":[0.01830118,0.0004164711,0.001536391,0.005264552,0.003830201,0.01662653,0.002092414,0.002227633,0.001012651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001844048,"about_ca_system_score_gemma":0.001146197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004393936,"about_ca_topic_score_gemma":0.002805263,"domain_scores_codex":[0.9975967,0.001343091,0.000144313,0.0003509118,0.0004302321,0.0001346202],"domain_scores_gemma":[0.9927769,0.00515273,0.0005381376,0.000708864,0.0006210369,0.0002022805],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006323949,0.00002575797,0.00116662,0.00009833342,0.0000396696,0.00004851053,0.0009852167,0.01037541,0.0001736005,0.9436175,0.002276377,0.04112974],"study_design_scores_gemma":[0.000007608036,0.00001382483,0.0001985163,0.00002451734,0.000008953666,0.00004504293,0.0001498627,0.0341371,0.00004400995,0.9621933,0.00316759,0.000009558034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03187528,0.005143562,0.9355267,0.00529764,0.0002537654,0.0001121285,0.001066633,0.0004744394,0.02024987],"genre_scores_gemma":[0.7229849,0.005405884,0.258254,0.0008200248,0.00104879,0.0005380917,0.001479601,0.0002399448,0.009228783],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005835699,"threshold_uncertainty_score":0.01794696,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150468603","doi":"10.1613/jair.3912","title":"The Arcade Learning Environment: An Evaluation Platform for General Agents","year":2013,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":1060,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Alberta Innovates; University of Alberta; Compute Canada","keywords":"Testbed; Benchmarking; Reinforcement learning; Benchmark (surveying); Imitation; Interface (matter)","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.2902597031161736,"gpt":0.4427010381262976,"spread":0.152441335010124,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01337618,0.001908025,0.001078831,0.002286951,0.0005852241,0.001953681,0.003830818,0.001737645,0.008489219],"category_scores_gemma":[0.03481341,0.0007657617,0.0009738894,0.001327463,0.001255557,0.002862258,0.003909424,0.003113078,0.002936229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001480088,"about_ca_system_score_gemma":0.002318647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004746819,"about_ca_topic_score_gemma":0.004241815,"domain_scores_codex":[0.9887922,0.007331612,0.0008097087,0.0008219923,0.001816693,0.00042776],"domain_scores_gemma":[0.9787911,0.01330225,0.0009883412,0.002991008,0.002880726,0.00104653],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003549396,0.003639912,0.0098472,0.003319166,0.000914829,0.000463411,0.001117868,0.4374845,0.007879542,0.05099973,0.1444713,0.3363132],"study_design_scores_gemma":[0.001494366,0.002020892,0.002326968,0.0002504004,0.0001246794,0.0001865743,0.0002384754,0.8897074,0.00915134,0.02375511,0.07060668,0.0001371563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07411522,0.00135767,0.7953433,0.001674257,0.0007121144,0.004908601,0.008251042,0.08102206,0.03261568],"genre_scores_gemma":[0.2756532,0.000527038,0.6941121,0.0006190911,0.00009082857,0.007379126,0.009865311,0.006918795,0.004834517],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01337618,"threshold_uncertainty_score":0.07074082,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156413587","doi":"10.1613/jair.4272","title":"Sentiment Analysis of Short Informal Texts","year":2014,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":890,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; SemEval; Task (project management); Lexicon; Sentiment analysis; Phrase; Natural language processing; Artificial intelligence; Variety (cybernetics); Word (group theory); Term (time); Set (abstract data type); Linguistics","authors":[{"name":"Svetlana Kiritchenko","is_ca":true},{"name":"Xiaodan Zhu","is_ca":true},{"name":"Seyed Mohammad","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1410959079151924,"gpt":0.4268329994839138,"spread":0.2857370915687214,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008472537,0.0008502281,0.0005542776,0.001855311,0.0003991889,0.001054762,0.0003945854,0.000349615,0.004946096],"category_scores_gemma":[0.00449419,0.0001653096,0.0005781113,0.001020459,0.0002226372,0.001014735,0.0006578276,0.0004129567,0.004366931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002938476,"about_ca_system_score_gemma":0.0003167928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006610026,"about_ca_topic_score_gemma":0.001277136,"domain_scores_codex":[0.9988631,0.0002494388,0.0001310711,0.0001997902,0.0004717226,0.00008483694],"domain_scores_gemma":[0.9974105,0.000837594,0.0003894728,0.0001982417,0.001066459,0.00009781727],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007428139,0.0002456992,0.01720615,0.001535601,0.0002159345,0.0006995876,0.001047214,0.003034159,0.2145821,0.003283647,0.04082642,0.7165807],"study_design_scores_gemma":[0.0002005396,0.001285425,0.1620207,0.0005289968,0.0003904366,0.002338798,0.002571456,0.3234358,0.2359157,0.02292166,0.2481312,0.0002593223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4365283,0.003157627,0.4843453,0.001237366,0.001075216,0.001594182,0.02267822,0.01328597,0.03609788],"genre_scores_gemma":[0.7146364,0.001647339,0.2279976,0.0004047088,0.001023147,0.001029716,0.03492114,0.0007610975,0.0175788],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004946096,"threshold_uncertainty_score":0.01654631,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114660707","doi":"10.1613/jair.1234","title":"CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements","year":2004,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":878,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; University of Toronto","funders":"","keywords":"Ceteris paribus; Preference; Outcome (game theory); Inference; Representation (politics); Computer science; Semantics (computer science); Set (abstract data type); Interpretation (philosophy); Artificial intelligence; Mathematical economics; Mathematics; Statistics; Epistemology; Programming language","authors":[{"name":"Craig Boutilier","is_ca":true},{"name":"Ronen I. Brafman","is_ca":false},{"name":"Carmel Domshlak","is_ca":false},{"name":"Holger H. Hoos","is_ca":true},{"name":"David Poole","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2770353824879733,"gpt":0.4600891532587523,"spread":0.183053770770779,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004776825,0.001615281,0.001068806,0.003025199,0.00154053,0.00466223,0.003473893,0.002284534,0.01263584],"category_scores_gemma":[0.01992244,0.001324698,0.002132646,0.002934948,0.001960328,0.006645311,0.003263357,0.004530855,0.002852042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001669633,"about_ca_system_score_gemma":0.003202018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01020618,"about_ca_topic_score_gemma":0.01798831,"domain_scores_codex":[0.9977521,0.0007598758,0.0002961987,0.0003595469,0.0007176209,0.000114715],"domain_scores_gemma":[0.9924452,0.005375649,0.0005867346,0.0007389326,0.0005982162,0.0002553538],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003300692,0.0001790333,0.001612188,0.0009182969,0.0001935206,0.0006519752,0.0005285071,0.1382149,0.002598485,0.6596987,0.02354773,0.1715267],"study_design_scores_gemma":[0.00006504894,0.00003646118,0.0001401481,0.0001487767,0.00006288696,0.0002190656,0.00007419773,0.4248825,0.00261364,0.5245216,0.04718496,0.00005073801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007553441,0.00008846814,0.99335,0.0002197201,0.00005323137,0.0001271793,0.000871542,0.002753584,0.001780995],"genre_scores_gemma":[0.03011824,0.0003954602,0.963713,0.0002816681,0.00006756966,0.0006121541,0.001931925,0.0003728422,0.00250712],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01263584,"threshold_uncertainty_score":0.04227114,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2950680102","doi":"10.1613/jair.2861","title":"ParamILS: An Automatic Algorithm Configuration Framework","year":2009,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":868,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS","keywords":"Computer science; Algorithm; Artificial intelligence","authors":[{"name":"Frank Hutter","is_ca":true},{"name":"Holger H. Hoos","is_ca":true},{"name":"Kevin Leyton‐Brown","is_ca":true},{"name":"T. Stuetzle","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1317989993784504,"gpt":0.4330978139636827,"spread":0.3012988145852324,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006468293,0.002075024,0.001619586,0.002535275,0.001000177,0.003973432,0.006449062,0.001573955,0.01377877],"category_scores_gemma":[0.02153515,0.001821895,0.001824011,0.001571793,0.001448039,0.004779598,0.004456338,0.004476169,0.005830805],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001706553,"about_ca_system_score_gemma":0.003747485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001804111,"about_ca_topic_score_gemma":0.002722797,"domain_scores_codex":[0.9938542,0.002120579,0.000562782,0.0009525534,0.00203448,0.0004755273],"domain_scores_gemma":[0.9921207,0.003754105,0.0005655599,0.002169012,0.001141269,0.0002492581],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001082551,0.0005225237,0.002177864,0.001126792,0.0002185843,0.0004399251,0.0004207735,0.2122748,0.01805091,0.07652105,0.0643884,0.6227758],"study_design_scores_gemma":[0.0002819512,0.000159941,0.0004129253,0.0001242443,0.00005136942,0.000249839,0.0000691782,0.888005,0.02124219,0.04584089,0.04343589,0.0001266719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002245158,0.0001620963,0.9335461,0.0001436788,0.00004408438,0.0003086526,0.0005587641,0.06036428,0.002627165],"genre_scores_gemma":[0.06390143,0.0001639958,0.9239173,0.0002155921,0.0000606367,0.001217581,0.001818835,0.007122113,0.001582541],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01377877,"threshold_uncertainty_score":0.0460946,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147148915","doi":"10.1613/jair.2490","title":"SATzilla: Portfolio-based Algorithm Selection for SAT","year":2008,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":835,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Solver; Portfolio; Scalability; Selection (genetic algorithm); Set (abstract data type); Class (philosophy); Local search (optimization); Algorithm; Mathematical optimization; Machine learning; Artificial intelligence; Mathematics; Programming language","authors":[{"name":"Lizhong Xu","is_ca":true},{"name":"Frank Hutter","is_ca":true},{"name":"Holger H. Hoos","is_ca":true},{"name":"Kevin Leyton‐Brown","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1824121673170033,"gpt":0.4086704943385303,"spread":0.226258327021527,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008243506,0.002342821,0.00218039,0.003739722,0.00105517,0.002677919,0.003869922,0.002147947,0.009380968],"category_scores_gemma":[0.02380115,0.001282369,0.002298181,0.003378795,0.001128536,0.003167713,0.003297297,0.003185463,0.003970207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001931851,"about_ca_system_score_gemma":0.003688131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001964646,"about_ca_topic_score_gemma":0.004253292,"domain_scores_codex":[0.9917258,0.004263974,0.0004296505,0.0009375994,0.00211051,0.0005324443],"domain_scores_gemma":[0.9887109,0.007056963,0.0006930759,0.002293707,0.0009198337,0.0003255747],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000592912,0.0005672815,0.006345519,0.0004394731,0.0004090352,0.0001438765,0.0001708842,0.3125704,0.003330608,0.02845646,0.05176182,0.5952117],"study_design_scores_gemma":[0.000188161,0.0001220994,0.0003966409,0.00002412886,0.00003629907,0.00007503811,0.00002333325,0.9705498,0.001741316,0.02159689,0.005230302,0.00001600797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02139261,0.000907001,0.95072,0.0006951679,0.000195478,0.0007775427,0.0009518656,0.01583701,0.008523314],"genre_scores_gemma":[0.18787,0.0003715409,0.8007858,0.0005309802,0.0002047965,0.001414079,0.003272606,0.001965727,0.003584602],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009380968,"threshold_uncertainty_score":0.04359633,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144913588","doi":"10.1613/jair.2567","title":"Online Planning Algorithms for POMDPs","year":2008,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":515,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval; McGill University","funders":"National Institute of Mental Health; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Partially observable Markov decision process; Computer science; Heuristic; Markov decision process; Mathematical optimization; Upper and lower bounds; Reduction (mathematics); Observable; Focus (optics); Computational complexity theory; Action (physics); Artificial intelligence; Machine learning; Markov process; Markov chain; Algorithm; Markov model; Mathematics","authors":[{"name":"Stéphane Ross","is_ca":true},{"name":"Joëlle Pineau","is_ca":true},{"name":"S. Paquet","is_ca":true},{"name":"Brahim Chaib-draa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.4539481331437369,"gpt":0.4870388551056944,"spread":0.0330907219619575,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001822599,0.001692746,0.001766019,0.0008094936,0.0009390407,0.001468614,0.001948461,0.001534261,0.007722979],"category_scores_gemma":[0.00600829,0.0008495533,0.001174635,0.0009942529,0.00140311,0.002278903,0.00210889,0.002522729,0.0008390297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001661369,"about_ca_system_score_gemma":0.002689934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006411201,"about_ca_topic_score_gemma":0.007155139,"domain_scores_codex":[0.9988386,0.0004038612,0.00008412098,0.0002477339,0.0002826798,0.0001430957],"domain_scores_gemma":[0.9959903,0.003198366,0.0002709852,0.0002339043,0.0001839165,0.0001224953],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007728505,0.00007793029,0.0002494052,0.0001798804,0.000042349,0.00005522608,0.00006714846,0.9046542,0.0003635836,0.04603207,0.001524885,0.04667607],"study_design_scores_gemma":[0.00003477538,0.00002201183,0.0000274054,0.00001714049,0.000009255294,0.00001306346,0.00001434918,0.9623732,0.0002269494,0.0362148,0.001041439,0.000005562395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004665816,0.0005017859,0.9902807,0.0001623839,0.00004451199,0.00008982225,0.0000942896,0.0007344637,0.003426085],"genre_scores_gemma":[0.381019,0.001102506,0.6122476,0.0002131879,0.00009034325,0.0007896485,0.0005325382,0.000298679,0.003706469],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007722979,"threshold_uncertainty_score":0.02583593,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2110962519","doi":"10.1613/jair.2078","title":"Anytime Point-Based Approximations for Large POMDPs","year":2006,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":374,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Partially observable Markov decision process; Computer science; Markov decision process; Selection (genetic algorithm); Set (abstract data type); Mathematical optimization; Artificial intelligence; Simplex; Point (geometry); Robotics; Observable; Machine learning; Bellman equation; Markov chain; Markov process; Robot; Mathematics; Markov model","authors":[{"name":"Joëlle Pineau","is_ca":true},{"name":"Geoff Gordon","is_ca":false},{"name":"Sebastian Thrun","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1885125475786514,"gpt":0.4559106252343577,"spread":0.2673980776557062,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002145037,0.0009475613,0.001248599,0.0007497215,0.0006603666,0.001417407,0.00181831,0.0009319307,0.003713108],"category_scores_gemma":[0.008311304,0.0006773534,0.001033132,0.0007423804,0.001241385,0.001762777,0.001799247,0.002472513,0.0005471493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001799957,"about_ca_system_score_gemma":0.001753627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006393275,"about_ca_topic_score_gemma":0.007936267,"domain_scores_codex":[0.9990777,0.0003568742,0.00004609062,0.0001043199,0.000325595,0.00008939272],"domain_scores_gemma":[0.9959572,0.002956388,0.0003012829,0.000350908,0.0002990632,0.0001350591],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004146252,0.00001533745,0.0002369366,0.00004922326,0.00001345032,0.00003149117,0.00006158873,0.9457229,0.0002205947,0.0442944,0.0002493987,0.009063159],"study_design_scores_gemma":[0.000006658418,0.000009211825,0.00001726061,0.000007171919,0.000002373517,0.000004390884,0.000009627853,0.9823615,0.0001349253,0.01710399,0.0003405687,0.00000230071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006249705,0.0001048573,0.9918368,0.00005979656,0.00001395657,0.00002877389,0.00004198347,0.0001903055,0.001473793],"genre_scores_gemma":[0.4815742,0.0003619051,0.5151876,0.0000576459,0.00003189039,0.0003315104,0.0002600088,0.0001626471,0.002032606],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006393275,"threshold_uncertainty_score":0.01305968,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1480330138","doi":"10.1613/jair.4806","title":"Bayesian Optimization in a Billion Dimensions via Random Embeddings","year":2016,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":374,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Deutsche Forschungsgemeinschaft","keywords":"Bayesian optimization; Embedding; Computer science; Categorical variable; Curse of dimensionality; Solver; Bayesian probability; Artificial intelligence; Optimization problem; Mathematical optimization; Integer programming; Machine learning; Theoretical computer science; Algorithm; Mathematics","authors":[{"name":"Ziyu Wang","is_ca":false},{"name":"Frank Hutter","is_ca":false},{"name":"Masrour Zoghi","is_ca":false},{"name":"David S. Matheson","is_ca":true},{"name":"Nando De Feitas","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07307959598059346,"gpt":0.3908340800060834,"spread":0.31775448402549,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002731885,0.00139977,0.001816618,0.0008989803,0.000630802,0.001744846,0.001330915,0.001835973,0.003212527],"category_scores_gemma":[0.01141371,0.001257329,0.001371209,0.000900206,0.002175506,0.003086013,0.003040485,0.003141764,0.0007422419],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001260393,"about_ca_system_score_gemma":0.001390921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004532916,"about_ca_topic_score_gemma":0.005641275,"domain_scores_codex":[0.9984452,0.0008915336,0.00005961009,0.0002231863,0.0002596065,0.0001208727],"domain_scores_gemma":[0.9950942,0.003794117,0.0003148499,0.0003053202,0.0003310265,0.0001604386],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001175928,0.00007875368,0.0008084833,0.0001297542,0.00008775517,0.00005969438,0.00007822097,0.8638356,0.0005617411,0.09266441,0.003104147,0.03847385],"study_design_scores_gemma":[0.0000122385,0.00001434417,0.00007254497,0.00001197982,0.000004668891,0.000007736205,0.00000820812,0.9595841,0.00008631104,0.03963663,0.0005544522,0.000006847599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01536578,0.0005718336,0.9805983,0.0007504803,0.00004477379,0.0000393997,0.0001049699,0.0002761683,0.002248248],"genre_scores_gemma":[0.4333464,0.001082346,0.5557263,0.0007501463,0.0002223672,0.0005387963,0.0006913932,0.0003672495,0.007275113],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004532916,"threshold_uncertainty_score":0.01444781,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3013772641","doi":"10.1613/jair.1.12162","title":"Mapping the landscape of Artificial Intelligence applications against COVID-19","year":2020,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"COVID-19 diagnosis using AI","field":"Medicine","cited_by":338,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"Science and Technology Facilities Council; Institut de Valorisation des Données; William and Flora Hewlett Foundation","keywords":"Multidisciplinary approach; Coronavirus disease 2019 (COVID-19); Applications of artificial intelligence; Pandemic; 2019-20 coronavirus outbreak","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.3617784450179333,"gpt":0.4770410701565926,"spread":0.1152626251386594,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01606817,0.0009661526,0.0008657809,0.006267089,0.001198889,0.00938952,0.002896569,0.00263132,0.004325838],"category_scores_gemma":[0.04656734,0.000468333,0.000996462,0.006516016,0.002799377,0.009138815,0.003191254,0.003530412,0.001561432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002608869,"about_ca_system_score_gemma":0.004449649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002957616,"about_ca_topic_score_gemma":0.002656403,"domain_scores_codex":[0.9907503,0.004594809,0.00076934,0.0008201256,0.002542972,0.0005225008],"domain_scores_gemma":[0.9471158,0.04002812,0.001673026,0.001873022,0.008094075,0.001216018],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0002563893,0.0001589932,0.01112515,0.006479935,0.0002076532,0.0002809418,0.0006606691,0.01118757,0.001956425,0.1298861,0.03407323,0.8037269],"study_design_scores_gemma":[0.00007029883,0.000620374,0.01090692,0.01461299,0.0002558089,0.0009443444,0.002923203,0.05140252,0.00470876,0.1771308,0.7362823,0.000141621],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"review","genre_gemma":"empirical","genre_scores_codex":[0.03492989,0.6013572,0.0646911,0.1515823,0.001721139,0.0003696393,0.001137423,0.001308944,0.1429024],"genre_scores_gemma":[0.3177137,0.5306858,0.1233044,0.01530942,0.002459953,0.0005301119,0.003741474,0.0003477419,0.005907484],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01606817,"threshold_uncertainty_score":0.08497763,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160927913","doi":"10.1613/jair.1696","title":"Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators","year":2005,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":195,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Macro; Computer science; Artificial intelligence; Software engineering; Programming language","authors":[{"name":"Adi Botea","is_ca":true},{"name":"Markus Enzenberger","is_ca":true},{"name":"Michael Mueller","is_ca":true},{"name":"Jonathan Schaeffer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1124290222437872,"gpt":0.4091690585784714,"spread":0.2967400363346842,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001504355,0.001272349,0.0006737557,0.001064122,0.000459096,0.001016966,0.001637555,0.0009715048,0.006941041],"category_scores_gemma":[0.00625492,0.0004553867,0.0007004981,0.000782357,0.0008984653,0.002104023,0.00177572,0.001109788,0.001255636],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008221842,"about_ca_system_score_gemma":0.002589931,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009403066,"about_ca_topic_score_gemma":0.01429329,"domain_scores_codex":[0.9991925,0.0002164966,0.00006057345,0.0001987749,0.0002654494,0.00006610496],"domain_scores_gemma":[0.9977308,0.001499552,0.0001385333,0.0003416844,0.0002160018,0.0000734682],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004074932,0.0002420496,0.002310212,0.0004687032,0.00005566929,0.0001472835,0.000268393,0.190843,0.01027992,0.01225782,0.01977813,0.7629414],"study_design_scores_gemma":[0.0001002251,0.000172121,0.0005459768,0.00003999317,0.00003225009,0.00009628777,0.00006034604,0.9649232,0.009903042,0.01175788,0.01233809,0.00003067693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03971592,0.0005408215,0.91313,0.0004104117,0.00009114315,0.0003631942,0.0009935062,0.03603754,0.008717348],"genre_scores_gemma":[0.1455543,0.000212855,0.8493702,0.0001841295,0.0000282003,0.0002416688,0.001247275,0.0009696744,0.002191717],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009403066,"threshold_uncertainty_score":0.02322012,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2274912527","doi":"10.1613/jair.4787","title":"How Translation Alters Sentiment","year":2016,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":194,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta; National Research Council Canada","funders":"","keywords":"Sentiment analysis; Computer science; Focus (optics); Lexicon; Natural language processing; Annotation; Artificial intelligence; Arabic; Machine translation; Linguistics; Social media; Resource (disambiguation); World Wide Web","authors":[{"name":"Saif M. Mohammad","is_ca":true},{"name":"Mohammad Salameh","is_ca":true},{"name":"Svetlana Kiritchenko","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2633291444881119,"gpt":0.4243514885302698,"spread":0.1610223440421579,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002394137,0.0006790144,0.0003552284,0.0009247794,0.001173072,0.004771045,0.0004263674,0.00070978,0.01702052],"category_scores_gemma":[0.01474901,0.0004287495,0.0005320505,0.001254502,0.001463052,0.003518916,0.001529894,0.001296376,0.01270334],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001279678,"about_ca_system_score_gemma":0.00090314,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002319514,"about_ca_topic_score_gemma":0.002002365,"domain_scores_codex":[0.9977748,0.00106805,0.0001317173,0.0003306279,0.0005039575,0.0001908782],"domain_scores_gemma":[0.9953225,0.001418985,0.0003359242,0.0007901826,0.001999461,0.0001328394],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0008309794,0.0002845692,0.02354581,0.001387391,0.0002117722,0.001993182,0.02977808,0.003664358,0.1133438,0.0991704,0.1018908,0.6238989],"study_design_scores_gemma":[0.0001987266,0.0004035354,0.05012467,0.0006311639,0.0003306621,0.002071302,0.02497181,0.03484488,0.08888031,0.1564288,0.6408977,0.0002164685],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4577627,0.002374702,0.1150093,0.02060382,0.005271306,0.0004782967,0.003121463,0.004523551,0.390855],"genre_scores_gemma":[0.9166805,0.00178429,0.03191848,0.003071344,0.0006489494,0.0002130937,0.002206742,0.002472757,0.0410038],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01702052,"threshold_uncertainty_score":0.0569393,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3117215073","doi":"10.1613/jair.1.13673","title":"Towards Continual Reinforcement Learning: A Review and Perspectives","year":2022,"lang":"en","type":"review","venue":"Journal of Artificial Intelligence Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":180,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; McGill University","funders":"Canada Excellence Research Chairs, Government of Canada; Canadian Institute for Advanced Research","keywords":"Reinforcement learning; Computer science; Scope (computer science); Artificial intelligence; Bridging (networking); Taxonomy (biology); Function (biology); Management science; Engineering","authors":[{"name":"Khimya Khetarpal","is_ca":true},{"name":"Matthew Riemer","is_ca":true},{"name":"Irina Rish","is_ca":true},{"name":"Doina Precup","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3537488428002021,"gpt":0.4758490705427069,"spread":0.1221002277425048,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00179616,0.001154558,0.001409557,0.002675164,0.0004074779,0.002165541,0.001558592,0.001961206,0.00389698],"category_scores_gemma":[0.003938644,0.0006143135,0.0007157455,0.00442322,0.00113277,0.003142055,0.001051206,0.002958983,0.001991165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001330001,"about_ca_system_score_gemma":0.002184543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002105322,"about_ca_topic_score_gemma":0.001865717,"domain_scores_codex":[0.9994215,0.0001382155,0.00008101267,0.00014846,0.0001772007,0.00003373698],"domain_scores_gemma":[0.996796,0.002390386,0.000168001,0.00007519202,0.000472509,0.00009806215],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00007687198,0.0001449571,0.0003916822,0.02293243,0.0001241256,0.0001457375,0.0002302625,0.003641831,0.0005828555,0.0431855,0.01576897,0.9127749],"study_design_scores_gemma":[0.00003041949,0.0002574795,0.001106333,0.01509455,0.0001905615,0.0009705718,0.0002936817,0.002559174,0.0006364376,0.03512603,0.9436439,0.0000908437],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.0001791507,0.9949846,0.002204542,0.0006094696,0.0001689209,0.00000709577,0.00001005789,0.00001718403,0.001819003],"genre_scores_gemma":[0.002637474,0.99426,0.001881602,0.00036713,0.000347138,0.00001608421,0.00002534957,0.000008224983,0.0004569902],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.00389698,"threshold_uncertainty_score":0.01303673,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2097113539","doi":"10.1613/jair.898","title":"Accelerating Reinforcement Learning through Implicit Imitation","year":2003,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":176,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of British Columbia","funders":"Instituto de Ciencias del Mar y Limnología, Universidad Nacional Autónoma de México; Natural Sciences and Engineering Research Council of Canada","keywords":"Imitation; Reinforcement learning; Observability; Computer science; Convergence (economics); Action (physics); Space (punctuation); Artificial intelligence; State space; Reinforcement; Value (mathematics); Human–computer interaction; Machine learning; Psychology; Mathematics; Social psychology","authors":[{"name":"Blaine Price","is_ca":true},{"name":"Craig Boutilier","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2541885736812509,"gpt":0.4324161648659641,"spread":0.1782275911847133,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001404605,0.0006531003,0.0006546348,0.0002413794,0.0002388503,0.0005002687,0.001374361,0.0007705024,0.001365311],"category_scores_gemma":[0.006951879,0.0003390074,0.0003097387,0.0002146271,0.001272889,0.001375793,0.001438488,0.001236566,0.0002230647],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005211018,"about_ca_system_score_gemma":0.0007868782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001665948,"about_ca_topic_score_gemma":0.00133283,"domain_scores_codex":[0.9993852,0.0002355182,0.00002810632,0.0001086033,0.0001555496,0.00008695967],"domain_scores_gemma":[0.9958956,0.002361286,0.0004724326,0.0008455461,0.0002799573,0.0001452509],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002196725,0.0001504349,0.001664664,0.00008514465,0.00003645266,0.0001354901,0.0001825914,0.9001032,0.009209661,0.03314264,0.0003907284,0.05467931],"study_design_scores_gemma":[0.00002473221,0.00006284487,0.00009283708,0.000003032261,0.000004061013,0.00001602996,0.000004221215,0.9924014,0.001091234,0.006090937,0.0002048386,0.000003915628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1190772,0.00008316888,0.877167,0.000175195,0.00002136296,0.00005266925,0.00001648662,0.0007377224,0.002669093],"genre_scores_gemma":[0.9457831,0.00004690671,0.05264583,0.00003366066,0.000008167231,0.00006776935,0.00001938844,0.00002341401,0.001371906],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001665948,"threshold_uncertainty_score":0.007428288,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3092156990","doi":"10.1613/jair.1.12440","title":"Reward Machines: Exploiting Reward Function Structure in Reinforcement Learning","year":2022,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":172,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Vector Institute; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto; Government of Canada; Canadian Institute for Advanced Research; Vector Institute; Microsoft Research","keywords":"Reinforcement learning; Computer science; Exploit; Counterfactual thinking; Function (biology); Artificial intelligence; Finite-state machine; Machine learning; Algorithm; Psychology","authors":[{"name":"Rodrigo Toro Icarte","is_ca":true},{"name":"Toryn Q. Klassen","is_ca":true},{"name":"Richard Valenzano","is_ca":false},{"name":"Sheila A. McIlraith","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1113564636583909,"gpt":0.3745631904237698,"spread":0.2632067267653789,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002877827,0.0008595068,0.0008421073,0.0005075395,0.0004214588,0.001370213,0.001430926,0.001263346,0.003297319],"category_scores_gemma":[0.01116771,0.0005888832,0.0008212834,0.0004891472,0.002738575,0.002801512,0.001508486,0.002715355,0.000561111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001035382,"about_ca_system_score_gemma":0.001184069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001448808,"about_ca_topic_score_gemma":0.001353948,"domain_scores_codex":[0.9983287,0.0009114333,0.00007595006,0.0002666799,0.0003147154,0.0001025888],"domain_scores_gemma":[0.9943669,0.004296996,0.0003662179,0.0006042265,0.0002319131,0.0001337995],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002764249,0.0001254525,0.001026875,0.0001839499,0.00006096576,0.0001488147,0.0002818138,0.6184499,0.005538596,0.2792026,0.001410014,0.09329476],"study_design_scores_gemma":[0.00002804241,0.00005976033,0.00006505713,0.00002120178,0.000009422978,0.00002267068,0.000007260441,0.896973,0.002085738,0.09931213,0.001402336,0.00001328738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004660038,0.00008334038,0.9937045,0.0001250549,0.00001676991,0.00003502243,0.00002529977,0.0005355071,0.0008144121],"genre_scores_gemma":[0.4603901,0.0002563169,0.5362601,0.0002303978,0.00005716171,0.0003757845,0.0001056874,0.0002951884,0.002029386],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003297319,"threshold_uncertainty_score":0.01521963,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2110504071","doi":"10.1613/jair.1815","title":"Dynamic Local Search for the Maximum Clique Problem","year":2006,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":158,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Clique problem; Vertex (graph theory); Benchmark (surveying); Clique; Mathematics; Generalization; Mathematical optimization; Computer science; Algorithm; Combinatorics; Graph; Chordal graph","authors":[{"name":"Wayne Pullan","is_ca":false},{"name":"Holger H. Hoos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1249041833922344,"gpt":0.4055584359057617,"spread":0.2806542525135273,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001725784,0.0008071417,0.001552049,0.001179547,0.000945161,0.0009807298,0.002134195,0.001405734,0.0053288],"category_scores_gemma":[0.005650738,0.0004787785,0.0007046427,0.001517952,0.001116656,0.001916395,0.002189314,0.001649444,0.0009444337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001339119,"about_ca_system_score_gemma":0.001562399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002707126,"about_ca_topic_score_gemma":0.004472312,"domain_scores_codex":[0.9987953,0.0005842615,0.00003039565,0.0002215252,0.0002551379,0.0001134349],"domain_scores_gemma":[0.9982374,0.001218848,0.0001230885,0.0001347589,0.0001594359,0.0001265433],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001472696,0.0001421207,0.000454266,0.0002536058,0.0000692423,0.0001111747,0.00008971641,0.8623996,0.001414632,0.06645794,0.008497393,0.05996299],"study_design_scores_gemma":[0.0000389607,0.00003372491,0.00004698136,0.000009594865,0.000007160091,0.00002959401,0.00001547536,0.9752516,0.0003503914,0.02238614,0.001823165,0.00000713015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01947948,0.0007971837,0.9714541,0.0004552201,0.00005580708,0.0001351323,0.0001414528,0.0007788165,0.006702901],"genre_scores_gemma":[0.4292706,0.0005799503,0.5614495,0.000482869,0.0001412933,0.0006730146,0.0008916016,0.0004761872,0.006035013],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0053288,"threshold_uncertainty_score":0.01782662,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155992093","doi":"10.1613/jair.4171","title":"Enhanced Partial Expansion A*","year":2014,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":151,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Computer science; A priori and a posteriori; Heuristic; Benchmark (surveying); Node (physics); Domain (mathematical analysis); Mathematical optimization; Theoretical computer science; Mathematics; Artificial intelligence","authors":[{"name":"Mitchell G. Goldenberg","is_ca":true},{"name":"Ariel Felner","is_ca":true},{"name":"Roni Stern","is_ca":true},{"name":"Gil Sharon","is_ca":true},{"name":"Nathan Sturtevant","is_ca":true},{"name":"Robert C. Holte","is_ca":true},{"name":"Jonathan Schaeffer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1483667407816816,"gpt":0.4088555009411715,"spread":0.2604887601594899,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000822834,0.0008333661,0.0007087191,0.0008462842,0.0006544658,0.0008090406,0.001637381,0.0009109809,0.006483123],"category_scores_gemma":[0.003467628,0.0003925131,0.001046973,0.001225214,0.0007298368,0.001914013,0.001950395,0.001382782,0.0009120587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005221848,"about_ca_system_score_gemma":0.001672512,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002276213,"about_ca_topic_score_gemma":0.003620641,"domain_scores_codex":[0.99938,0.0001811577,0.00004587286,0.0001362263,0.0001568127,0.00009995799],"domain_scores_gemma":[0.998421,0.0009060656,0.0001122757,0.0002484454,0.0002435938,0.00006868836],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003639775,0.0004379787,0.00256244,0.0005518775,0.0001188143,0.0004611753,0.0003131532,0.2500034,0.01728278,0.05183297,0.01559506,0.6604764],"study_design_scores_gemma":[0.0001087555,0.0003475815,0.0006598943,0.00006143635,0.00007061267,0.000524541,0.0001206312,0.9154831,0.008858732,0.05267484,0.02106196,0.00002794884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06052338,0.0007247113,0.9160752,0.0007288996,0.0001661221,0.0004643928,0.0004047915,0.002286022,0.01862644],"genre_scores_gemma":[0.2489925,0.0003266895,0.7410996,0.0005447757,0.00006862775,0.0004777286,0.0007486296,0.0002605645,0.007480862],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006483123,"threshold_uncertainty_score":0.02168816,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4391399751","doi":"10.1613/jair.1.15348","title":"Human-in-the-Loop Reinforcement Learning: A Survey and Position on Requirements, Challenges, and Opportunities","year":2024,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":133,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Artificial Intelligence in Medicine (Canada); University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Austrian Science Fund; University of Alberta; Alberta Machine Intelligence Institute; Compute Canada; Canadian Institute for Advanced Research","keywords":"Human-in-the-loop; Reinforcement learning; Position (finance); Loop (graph theory); Computer science; Reinforcement; Artificial intelligence; Business; Psychology; Mathematics; Social psychology","authors":[{"name":"Carl Orge Retzlaff","is_ca":false},{"name":"Srijita Das","is_ca":true},{"name":"Christabel Wayllace","is_ca":true},{"name":"Payam Mousavi","is_ca":true},{"name":"Mohammad Afshari","is_ca":true},{"name":"Tianpei Yang","is_ca":true},{"name":"Anna Saranti","is_ca":true},{"name":"Alessa Angerschmid","is_ca":true},{"name":"Matthew E. Taylor","is_ca":true},{"name":"Andreas Holzinger","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.4886989474982671,"gpt":0.4569376480713653,"spread":0.03176129942690176,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003583313,0.0008258613,0.001137092,0.001522648,0.0004460923,0.003093082,0.001996574,0.00208417,0.003353982],"category_scores_gemma":[0.005797259,0.000634996,0.0007480102,0.002350661,0.001521596,0.004334291,0.001376805,0.002571811,0.001341233],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001644091,"about_ca_system_score_gemma":0.001918828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002632716,"about_ca_topic_score_gemma":0.001618935,"domain_scores_codex":[0.9983942,0.0004878294,0.0001695354,0.0003053081,0.0005459243,0.00009718847],"domain_scores_gemma":[0.9930853,0.005451431,0.0002390788,0.0002432442,0.0008108486,0.0001700731],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00008981721,0.000223206,0.001919179,0.005940475,0.0000780673,0.0001148716,0.0003832243,0.01950579,0.0007945432,0.1032021,0.01055643,0.8571924],"study_design_scores_gemma":[0.00006030313,0.0008401987,0.00303787,0.006986271,0.0001545887,0.0008980132,0.001469581,0.1154659,0.002577621,0.1738071,0.694502,0.0002006193],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.006232893,0.8435751,0.1094961,0.01161769,0.0006909893,0.0001304983,0.0001027697,0.0004066256,0.02774726],"genre_scores_gemma":[0.1110275,0.8267695,0.04985069,0.002618396,0.002094848,0.0002229393,0.0002654457,0.0001619097,0.006988735],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.003583313,"threshold_uncertainty_score":0.01895058,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2122128939","doi":"10.1613/jair.1789","title":"Learning in Real-Time Search: A Unifying Framework","year":2006,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":124,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Computer science; Heuristic; Scalability; Completeness (order theory); Function (biology); Convergence (economics); Control (management); Machine learning; Mathematical optimization; Artificial intelligence; Mathematics","authors":[{"name":"Vadim Bulitko","is_ca":true},{"name":"G. Lee","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1779391985443843,"gpt":0.4233065913614683,"spread":0.245367392817084,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002884503,0.001141312,0.001473401,0.00172253,0.0006713306,0.003646165,0.003363899,0.001939513,0.002568426],"category_scores_gemma":[0.006080213,0.0005474568,0.001636082,0.001984494,0.004815147,0.006908947,0.002816518,0.0030891,0.0006487027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002471363,"about_ca_system_score_gemma":0.002184373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004034313,"about_ca_topic_score_gemma":0.002158854,"domain_scores_codex":[0.9979101,0.0006689448,0.0001443809,0.0004256431,0.0006507661,0.0002002043],"domain_scores_gemma":[0.997131,0.001434635,0.000261027,0.0006114577,0.0003447295,0.00021715],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005826028,0.00004738664,0.0003876394,0.0002007146,0.00004727646,0.00006969133,0.0001986579,0.342153,0.0008517058,0.5973992,0.00100643,0.0575801],"study_design_scores_gemma":[0.00002697438,0.0000669869,0.000163973,0.00005544683,0.0000188594,0.00004920489,0.00004748321,0.6893959,0.0005168541,0.3015801,0.008054414,0.00002380544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002641543,0.001616696,0.9913985,0.0004269987,0.00005137541,0.00002860956,0.00002697382,0.0001587947,0.003650549],"genre_scores_gemma":[0.4089018,0.005339745,0.579154,0.0003976249,0.0006955586,0.0003225902,0.0001488447,0.000235838,0.004803943],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004034313,"threshold_uncertainty_score":0.01793104,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1621585639","doi":"10.1613/jair.740","title":"Partial-Order Planning with Concurrent Interacting Actions","year":2001,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":115,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia","keywords":"Planner; Computer science; Order (exchange); Plan (archaeology); Representation (politics); Task (project management); Action (physics); Simple (philosophy); Control (management); Distributed computing; Artificial intelligence; Engineering; Systems engineering; Economics","authors":[{"name":"Craig Boutilier","is_ca":true},{"name":"Ronen I. Brafman","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.328713626214809,"gpt":0.4722555756749504,"spread":0.1435419494601414,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00181086,0.00095004,0.0006547699,0.000594112,0.00088391,0.001496495,0.00132505,0.0008691508,0.003238403],"category_scores_gemma":[0.004596287,0.0007223286,0.001398072,0.0008318503,0.002789026,0.002300263,0.002425534,0.001504678,0.0005585821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001154349,"about_ca_system_score_gemma":0.002434003,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006036497,"about_ca_topic_score_gemma":0.0100824,"domain_scores_codex":[0.9984617,0.0005271708,0.0001311346,0.0002408093,0.0005206628,0.0001184699],"domain_scores_gemma":[0.9978316,0.001404002,0.0001602457,0.000288834,0.0002085443,0.000106828],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001390812,0.00008486844,0.0005241311,0.0003004492,0.00008618677,0.0006712964,0.000617283,0.5553519,0.003473209,0.3694406,0.002351902,0.06695913],"study_design_scores_gemma":[0.00007879989,0.00006631143,0.00010509,0.00003664776,0.00004436118,0.0001301682,0.00009812698,0.6724364,0.003541749,0.3115572,0.01187444,0.00003067103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007944752,0.0002024834,0.9847835,0.0002463556,0.00003293349,0.000122976,0.00009413389,0.0006831462,0.005889746],"genre_scores_gemma":[0.2155594,0.0005269349,0.7785162,0.0001281501,0.00003468254,0.0004380724,0.0004350371,0.0001237549,0.004237739],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006036497,"threshold_uncertainty_score":0.01200271,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1258972194","doi":"10.1613/jair.4726","title":"AutoFolio: An Automatically Configured Algorithm Selector","year":2015,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Computer science; Benchmark (surveying); Parameterized complexity; Set (abstract data type); Algorithm; Exploit; Hyperparameter; Variety (cybernetics); Selection (genetic algorithm); Range (aeronautics); State (computer science); Machine learning; Artificial intelligence","authors":[{"name":"Marius Lindauer","is_ca":false},{"name":"Holger H. Hoos","is_ca":true},{"name":"Frank Hutter","is_ca":false},{"name":"Torsten Schaub","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2320042108967314,"gpt":0.4389980739433883,"spread":0.2069938630466569,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004000746,0.002283289,0.000916618,0.001546881,0.0005760036,0.001995356,0.003784577,0.001503434,0.01075486],"category_scores_gemma":[0.01259907,0.001022392,0.001116269,0.001051924,0.001138117,0.002835284,0.002021507,0.001920366,0.00551615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001268553,"about_ca_system_score_gemma":0.002046425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001348433,"about_ca_topic_score_gemma":0.001945941,"domain_scores_codex":[0.9971789,0.0008534029,0.0002548829,0.000657174,0.0007907815,0.0002648958],"domain_scores_gemma":[0.9942698,0.003255424,0.0004347561,0.001146546,0.0006417581,0.0002517344],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00344063,0.0009244869,0.01608429,0.002325238,0.0003575107,0.0007785499,0.0006699829,0.1498404,0.04596286,0.01693004,0.1198516,0.6428345],"study_design_scores_gemma":[0.000945139,0.0008008033,0.00207014,0.000184422,0.0001008091,0.0006055683,0.0002099853,0.8306456,0.07965329,0.01417575,0.07044844,0.0001601145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08745124,0.001441506,0.5457155,0.0008603614,0.0004433566,0.0007571931,0.002877828,0.3396827,0.02077045],"genre_scores_gemma":[0.435146,0.0006401378,0.5256333,0.001214818,0.0001242787,0.001458431,0.007016465,0.02038238,0.008384137],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01075486,"threshold_uncertainty_score":0.03597856,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125592902","doi":"10.1613/jair.1509","title":"Learning From Labeled And Unlabeled Data: An Empirical Study Across Techniques And Domains","year":2005,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":97,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Labeled data; Semi-supervised learning; Relevance (law); Independence (probability theory); Selection (genetic algorithm); Empirical research; Bivariate analysis; Process (computing); Selection bias","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.2839496994906822,"gpt":0.524008033142466,"spread":0.2400583336517838,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.07462388,0.001142854,0.001248782,0.006404977,0.002042362,0.003164663,0.002321455,0.002626695,0.001118234],"category_scores_gemma":[0.3005234,0.0006709936,0.001561848,0.007555592,0.004770027,0.007988516,0.003250567,0.003153588,0.0006037896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001657993,"about_ca_system_score_gemma":0.001018512,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001996029,"about_ca_topic_score_gemma":0.003070139,"domain_scores_codex":[0.9021531,0.07004455,0.004660438,0.007672345,0.01459388,0.0008755882],"domain_scores_gemma":[0.3241137,0.6103453,0.01903173,0.02687059,0.01784821,0.0017905],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.002064988,0.002729457,0.4093144,0.003875118,0.002519568,0.0004555163,0.006322849,0.05768108,0.00202441,0.01907527,0.01400519,0.4799322],"study_design_scores_gemma":[0.0006475797,0.005757357,0.4448055,0.006130484,0.002020629,0.006773097,0.02326671,0.3372336,0.01271522,0.08543523,0.07455759,0.0006569715],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8431463,0.02452665,0.1109241,0.003438853,0.0002914163,0.0008704404,0.001518103,0.0003439657,0.01494016],"genre_scores_gemma":[0.9196181,0.006358972,0.06752194,0.0008059692,0.0002885,0.0004767551,0.003426344,0.0002463437,0.001257105],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07462388,"threshold_uncertainty_score":0.3946535,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2942315111","doi":"10.1613/jair.1.13225","title":"Graph Kernels: A Survey","year":2021,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Graph; Theoretical computer science; Data science","authors":[{"name":"Giannis Nikolentzos","is_ca":true},{"name":"Giannis Siglidis","is_ca":false},{"name":"Michalis Vazirgiannis","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2937579756576601,"gpt":0.4530306973098932,"spread":0.1592727216522331,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001075761,0.001270814,0.001374719,0.004352909,0.0005848528,0.002538685,0.00137434,0.001223853,0.00412131],"category_scores_gemma":[0.006211595,0.0004796317,0.001266608,0.006169959,0.0007984134,0.005312099,0.001225467,0.001617221,0.002272471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001074099,"about_ca_system_score_gemma":0.0009823631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003256988,"about_ca_topic_score_gemma":0.002320815,"domain_scores_codex":[0.9989674,0.0001735386,0.00009860905,0.0002163784,0.0004578083,0.00008628389],"domain_scores_gemma":[0.9970102,0.001664363,0.0002128438,0.0003489508,0.0006323403,0.0001313097],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001527578,0.0002207243,0.005071874,0.00267732,0.0002018026,0.0002401718,0.0002090503,0.02285572,0.002737865,0.0808486,0.04046718,0.844317],"study_design_scores_gemma":[0.00004538279,0.0003593768,0.01031405,0.001248497,0.0002903334,0.004321062,0.0004551118,0.2572804,0.006516989,0.2840771,0.4348915,0.0002001705],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.04465134,0.3770944,0.5294592,0.00410561,0.001490799,0.0002791418,0.00271582,0.003212214,0.0369914],"genre_scores_gemma":[0.3505426,0.4428838,0.175054,0.0016865,0.002793232,0.0002813254,0.008448797,0.001186135,0.01712362],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.004352909,"threshold_uncertainty_score":0.01378715,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1557519121","doi":"10.1613/jair.2293","title":"Graph Abstraction in Real-time Heuristic Search","year":2007,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"University of Alberta; Western Canada Research Grid","keywords":"Computer science; Abstraction; Incremental heuristic search; Heuristic; Graph; Maxima and minima; Theoretical computer science; Pathfinding; Class (philosophy); Situated; Beam search; Artificial intelligence; Search algorithm; Algorithm; Mathematics","authors":[{"name":"Vadim Bulitko","is_ca":true},{"name":"Nathan Sturtevant","is_ca":true},{"name":"Junhao Lu","is_ca":true},{"name":"Thomas Yau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1599400188619807,"gpt":0.4311293688593298,"spread":0.2711893499973491,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002526141,0.0006045668,0.0009087593,0.001140479,0.000608115,0.001433952,0.001340406,0.00105042,0.002016126],"category_scores_gemma":[0.01394699,0.0006140378,0.0009819224,0.001581496,0.002899691,0.004070633,0.001685829,0.001960537,0.0002994516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001665054,"about_ca_system_score_gemma":0.001421478,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003917666,"about_ca_topic_score_gemma":0.002869066,"domain_scores_codex":[0.9983959,0.0008603692,0.00006548713,0.0002263404,0.0003255981,0.0001263425],"domain_scores_gemma":[0.9881248,0.008507265,0.0007897236,0.001818307,0.0005190279,0.0002408207],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000147189,0.0000594166,0.0007875434,0.000143975,0.00004278972,0.00007252827,0.0002357463,0.82928,0.001393038,0.120023,0.0005408597,0.04727389],"study_design_scores_gemma":[0.00002944057,0.00006262549,0.0002541703,0.00001691675,0.00001895681,0.00003807234,0.00003205933,0.8368143,0.0008080375,0.1605801,0.001330594,0.00001470344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05344927,0.000656957,0.9424456,0.0002708171,0.00002377031,0.0000622859,0.00006023758,0.0006141726,0.002416802],"genre_scores_gemma":[0.7175075,0.0007073586,0.2793964,0.0001132326,0.00003441436,0.0001781109,0.0001739282,0.00013117,0.001757961],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003917666,"threshold_uncertainty_score":0.01335961,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149586740","doi":"10.1613/jair.4117","title":"Scalable and Efficient Bayes-Adaptive Reinforcement Learning Based on Monte-Carlo Tree Search","year":2013,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Gatsby Charitable Foundation; Royal Society","keywords":"Computer science; Monte Carlo tree search; Machine learning; Reinforcement learning; Tree (set theory); Scalability; Bayesian probability; Artificial intelligence; Benchmark (surveying); Monte Carlo method; Mathematical optimization; Mathematics; Statistics","authors":[{"name":"A. Guez","is_ca":false},{"name":"David Silver","is_ca":false},{"name":"Peter Dayan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1097453708321637,"gpt":0.354419875162297,"spread":0.2446745043301333,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001926857,0.0007508426,0.001797223,0.0005669168,0.0004505221,0.0008539415,0.001940788,0.001182488,0.002998225],"category_scores_gemma":[0.00971664,0.0005829147,0.0005686133,0.0006918503,0.001239188,0.001478544,0.001574844,0.002057521,0.0005389464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001165106,"about_ca_system_score_gemma":0.002634323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006894886,"about_ca_topic_score_gemma":0.008601874,"domain_scores_codex":[0.9988276,0.0004542182,0.00004834862,0.0001508272,0.0004041819,0.000114712],"domain_scores_gemma":[0.9960204,0.003024276,0.000253006,0.0002649516,0.0002793802,0.0001580548],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000116672,0.00008672538,0.0007542658,0.00006337798,0.00004015286,0.00005462065,0.00007465323,0.9003484,0.0007350576,0.02501696,0.001443137,0.07126589],"study_design_scores_gemma":[0.00001105728,0.000009978257,0.0000296098,0.000003251593,0.00000262589,0.000005858009,0.000002460069,0.9931479,0.00008580121,0.006567268,0.0001318499,0.000002289593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01081555,0.0001821295,0.9861163,0.000172377,0.00002482189,0.00006026662,0.00003358808,0.0005985299,0.001996305],"genre_scores_gemma":[0.6410341,0.0002020992,0.3562351,0.0001902058,0.00004659309,0.0003066898,0.0001483506,0.0001484593,0.001688297],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006894886,"threshold_uncertainty_score":0.01370949,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3192223999","doi":"10.1613/jair.1.12895","title":"Ethics and Governance of Artificial Intelligence: Evidence from a Survey of Machine Learning Researchers","year":2021,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Ethics and Social Impacts of AI","field":"Social Sciences","cited_by":76,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Oxford; Open Philanthropy Project; Georgetown University; Canadian Institute for Advanced Research","keywords":"Relevance (law); Artificial intelligence; Corporate governance; Work (physics); Political science; Private sector; Public relations; Public sector; Psychology; Sociology; Computer science; Engineering; Management; Law; Economics","authors":[{"name":"Zhang Baobao","is_ca":false},{"name":"Markus Anderljung","is_ca":false},{"name":"Lauren Kahn","is_ca":false},{"name":"Noemi Dreksler","is_ca":false},{"name":"Michael C. Horowitz","is_ca":false},{"name":"Allan Dafoe","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.6323708808206586,"gpt":0.5702557216662416,"spread":0.06211515915441701,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.06973486,0.000207682,0.0006843673,0.004700627,0.003282253,0.006986076,0.001211252,0.002124597,0.003304763],"category_scores_gemma":[0.2802836,0.0007257115,0.0004600158,0.006986526,0.005707593,0.00740129,0.004240192,0.002807844,0.000683124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002599486,"about_ca_system_score_gemma":0.00572749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006621029,"about_ca_topic_score_gemma":0.006820679,"domain_scores_codex":[0.9030417,0.06732813,0.009091209,0.003870042,0.01351499,0.003153886],"domain_scores_gemma":[0.4063064,0.3577053,0.15921,0.01926599,0.03971439,0.01779789],"domain_codex":null,"domain_gemma":"incentives","domain_candidate":"incentives","domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0002593786,0.0002377388,0.8879679,0.0008527713,0.0001956744,0.0002836206,0.0645217,0.0001139523,0.00014548,0.004476618,0.006970118,0.03397502],"study_design_scores_gemma":[0.0001457528,0.0003606653,0.7535929,0.003611203,0.0001779751,0.0007647392,0.1951742,0.0009689602,0.0003669922,0.005683564,0.03901884,0.0001341519],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9624792,0.006725867,0.0009237199,0.01549402,0.0001263256,0.0001016919,0.0003639956,0.00001169091,0.0137735],"genre_scores_gemma":[0.9936332,0.002901573,0.0002787739,0.002556028,0.00008312794,0.00008322773,0.0001339112,0.00001371515,0.000316552],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9302651,"threshold_uncertainty_score":0.3687976,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1575452963","doi":"10.1613/jair.788","title":"Conflict-Directed Backjumping Revisited","year":2001,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Backtracking; Look-ahead; Beam stack search; Constraint learning; Consistency (knowledge bases); Local consistency; Heuristic; Computer science; Constraint satisfaction problem; Focus (optics); Constraint (computer-aided design); Mathematical optimization; Algorithm; Contrast (vision); Constraint satisfaction; Search algorithm; Mathematics; Artificial intelligence; Incremental heuristic search; Beam search","authors":[{"name":"Xinguang Chen","is_ca":true},{"name":"Peter van Beek","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2109980789570575,"gpt":0.4285933742557623,"spread":0.2175952952987048,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002996451,0.001084859,0.001452652,0.001144364,0.001392808,0.001754437,0.004042278,0.001575383,0.004145621],"category_scores_gemma":[0.01124012,0.0009769218,0.00152872,0.003241691,0.002569134,0.00306983,0.002195892,0.003989325,0.0007569704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001476903,"about_ca_system_score_gemma":0.002072828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007300815,"about_ca_topic_score_gemma":0.006748482,"domain_scores_codex":[0.9963959,0.001110513,0.000194146,0.0005969481,0.001334343,0.0003681231],"domain_scores_gemma":[0.990699,0.004756548,0.0005825026,0.002426479,0.001272849,0.0002626707],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005743664,0.0005006729,0.006569677,0.001592414,0.0003276474,0.0008201448,0.001314793,0.2240378,0.01513967,0.1539164,0.01454788,0.5806585],"study_design_scores_gemma":[0.0002305987,0.0002969047,0.002042311,0.0001629315,0.0003092758,0.001466609,0.0003369143,0.7848572,0.03418275,0.1338502,0.04212702,0.000137292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08283518,0.007856597,0.8884766,0.002135949,0.0003852264,0.0002988499,0.0002389452,0.003919553,0.01385315],"genre_scores_gemma":[0.4612482,0.002841089,0.5271543,0.00111365,0.0001659142,0.0001891921,0.0004146152,0.0006250442,0.006247989],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007300815,"threshold_uncertainty_score":0.01584691,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136791927","doi":"10.1613/jair.2486","title":"A General Theory of Additive State Space Abstractions","year":2008,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Disjoint sets; Heuristics; Computer science; State (computer science); Space (punctuation); Heuristic; State space; Cube (algebra); Set (abstract data type); Theoretical computer science; Algorithm; Mathematics; Discrete mathematics; Combinatorics; Programming language; Artificial intelligence","authors":[{"name":"Fan Yang","is_ca":true},{"name":"Joseph Culberson","is_ca":true},{"name":"Robert C. Holte","is_ca":true},{"name":"Uzi Zahavi","is_ca":false},{"name":"Ariel Felner","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1425791225320405,"gpt":0.4123511718843479,"spread":0.2697720493523074,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003332542,0.001352732,0.001135884,0.002226278,0.001325355,0.004986197,0.003079406,0.001647418,0.007131952],"category_scores_gemma":[0.01494511,0.001234537,0.003186666,0.002591122,0.005380559,0.007954082,0.005359334,0.004385013,0.001136872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002117167,"about_ca_system_score_gemma":0.00244456,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002073406,"about_ca_topic_score_gemma":0.001374298,"domain_scores_codex":[0.9947721,0.00111443,0.0006381673,0.001293992,0.001529047,0.0006522334],"domain_scores_gemma":[0.9913825,0.004386978,0.0008628855,0.002309873,0.0007568464,0.0003009686],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005760953,0.00003956678,0.0005547292,0.0001468056,0.00004517385,0.0001009832,0.0002629055,0.07043266,0.001557947,0.9049677,0.0009500323,0.02088381],"study_design_scores_gemma":[0.0000317487,0.0001228897,0.0002300987,0.00007472378,0.0000537062,0.0001667675,0.0001026443,0.1805363,0.002920067,0.8057384,0.009983605,0.00003903816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009922077,0.0002416133,0.9839115,0.0002780721,0.00004620013,0.00009671562,0.0002373463,0.0005993187,0.004667141],"genre_scores_gemma":[0.3975696,0.0007414817,0.5933116,0.0005922919,0.000160772,0.001108361,0.0008769404,0.0002562948,0.005382618],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007131952,"threshold_uncertainty_score":0.02385879,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2133180954","doi":"10.1613/jair.1676","title":"Decision-Theoretic Planning with non-Markovian Rewards","year":2006,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Australian Government; National ICT Australia","keywords":"Markov decision process; Computer science; Markov process; Partially observable Markov decision process; Heuristic; Probabilistic logic; Planner; Mathematical optimization; Decision problem; Process (computing); Function (biology); Artificial intelligence; Mathematics; Algorithm","authors":[{"name":"Sylvie Thiébaux","is_ca":false},{"name":"Charles Gretton","is_ca":false},{"name":"John Slaney","is_ca":false},{"name":"David J. Price","is_ca":false},{"name":"F. Kabanza","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06525791475197834,"gpt":0.3788264025247418,"spread":0.3135684877727634,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002852846,0.0008560957,0.0006189278,0.0005622145,0.0005730974,0.001747343,0.001338337,0.0008750975,0.003350336],"category_scores_gemma":[0.008090721,0.0005173255,0.00112291,0.0007538411,0.002094002,0.002665948,0.001703262,0.001846606,0.0004341502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001586553,"about_ca_system_score_gemma":0.003620665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003037399,"about_ca_topic_score_gemma":0.004189306,"domain_scores_codex":[0.997491,0.001044557,0.0001601229,0.0003845273,0.0007447887,0.0001749783],"domain_scores_gemma":[0.9951038,0.003737218,0.0003550956,0.0003795446,0.0002670512,0.0001573034],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000131453,0.00007196478,0.0004929677,0.0002296018,0.00005151986,0.0001494945,0.0002562901,0.3906796,0.001979043,0.545961,0.001570184,0.05842682],"study_design_scores_gemma":[0.00005327458,0.00006680785,0.0001430346,0.00004036877,0.00002300312,0.00006252289,0.00003647338,0.7106074,0.002309883,0.2784242,0.008210194,0.00002286369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007782176,0.0002308931,0.9855924,0.0002798346,0.00003197437,0.00009580952,0.00009742974,0.0003209503,0.005568493],"genre_scores_gemma":[0.3203368,0.0006625506,0.6739384,0.000134517,0.0000437077,0.0003502244,0.0002984238,0.0001209726,0.004114474],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003350336,"threshold_uncertainty_score":0.01508743,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3115320986","doi":"10.1613/jair.1.12590","title":"Confronting Abusive Language Online: A Survey from the Ethical and Human Rights Perspective","year":2021,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Hate Speech and Cyberbullying Detection","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"National Research Council Canada","funders":"","keywords":"Unintended consequences; Perspective (graphical); Human rights; Transparency (behavior); Situational ethics; The Internet; Redress; Social media; Situation awareness","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.1474093345032763,"gpt":0.442678039612974,"spread":0.2952687051096977,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01014452,0.0003077023,0.0006665558,0.002721247,0.001379612,0.003552408,0.0006985885,0.001699576,0.002712995],"category_scores_gemma":[0.03662886,0.0004619748,0.0006635677,0.002413465,0.002576245,0.007821193,0.00304173,0.002820992,0.001018566],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009411062,"about_ca_system_score_gemma":0.001635285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002685281,"about_ca_topic_score_gemma":0.003046143,"domain_scores_codex":[0.9903373,0.00491744,0.001056794,0.0005404059,0.002257612,0.0008904428],"domain_scores_gemma":[0.9653189,0.02064037,0.006531169,0.0008042003,0.004762816,0.001942442],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"qualitative","study_design_scores_codex":[0.0001529323,0.0003620088,0.5712671,0.002705743,0.0001513272,0.001981202,0.2114606,0.0002039582,0.001430578,0.004944998,0.02016394,0.1851756],"study_design_scores_gemma":[0.00001379631,0.0004676061,0.3524652,0.004229913,0.00008464019,0.007325229,0.5045439,0.001041723,0.0006456196,0.002437768,0.126633,0.0001115479],"study_design_candidate":"qualitative","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9604198,0.01618596,0.002239635,0.01075753,0.0001904215,0.000134875,0.0005369636,0.00003956811,0.009495174],"genre_scores_gemma":[0.9613071,0.02672738,0.001585643,0.007593762,0.0001682958,0.0001679377,0.0004571622,0.00006621884,0.00192643],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01014452,"threshold_uncertainty_score":0.05364996,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167116921","doi":"10.1613/jair.1122","title":"Exploiting Contextual Independence In Probabilistic Inference","year":2003,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Hong Kong University of Science and Technology","keywords":"Exploit; Conditional independence; Variable elimination; Inference; Independence (probability theory); Variable (mathematics); Representation (politics); Probabilistic logic","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.2762382946313396,"gpt":0.4383195104679956,"spread":0.162081215836656,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005604084,0.001021586,0.001491882,0.002629144,0.001270443,0.002307696,0.001682117,0.001414806,0.003175662],"category_scores_gemma":[0.0358041,0.001641777,0.001913517,0.003163823,0.002652403,0.007781737,0.004213861,0.003104514,0.0006450751],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00124061,"about_ca_system_score_gemma":0.001886668,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007180953,"about_ca_topic_score_gemma":0.007870225,"domain_scores_codex":[0.9939743,0.00291632,0.0002923749,0.0008907475,0.001624352,0.0003019918],"domain_scores_gemma":[0.9793966,0.01699242,0.0006995947,0.001916143,0.0007995999,0.0001956061],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002008311,0.00006463236,0.002854656,0.0003423076,0.0002156375,0.0002902169,0.0006079757,0.2013824,0.001479271,0.519567,0.003255478,0.2697396],"study_design_scores_gemma":[0.00002208374,0.00002491804,0.0004823671,0.00005476276,0.00006945324,0.000099167,0.00004150705,0.3648467,0.001278949,0.6287295,0.004314973,0.00003558224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004992682,0.0003968151,0.9926872,0.0002195184,0.00001501523,0.00002345731,0.00007365143,0.0003167789,0.00127491],"genre_scores_gemma":[0.2436778,0.001713254,0.7518401,0.0002865341,0.0001755726,0.0002246198,0.0005442614,0.000213107,0.001324733],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007180953,"threshold_uncertainty_score":0.02963763,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W256842657","doi":"10.1613/jair.4030","title":"Inapproximability of Treewidth and Related Problems","year":2014,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Treewidth; Partial k-tree; Pathwidth; Combinatorics; Tree-depth; Graphical model; Tree decomposition; Mathematics; Chordal graph; Discrete mathematics; Computer science; Graph; 1-planar graph; Line graph; Artificial intelligence","authors":[{"name":"Yuhuai Wu","is_ca":true},{"name":"Per Austrin","is_ca":true},{"name":"Toniann Pitassi","is_ca":true},{"name":"David Liu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.142345972613428,"gpt":0.382805798384195,"spread":0.240459825770767,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004738964,0.002144797,0.003024451,0.001800839,0.001776067,0.005373297,0.005851966,0.003536266,0.00929116],"category_scores_gemma":[0.0429528,0.001798549,0.003601935,0.003726824,0.003947707,0.01356358,0.003090178,0.009104516,0.001154159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003988109,"about_ca_system_score_gemma":0.002340607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003890474,"about_ca_topic_score_gemma":0.003723189,"domain_scores_codex":[0.994436,0.001795525,0.0002272627,0.001448599,0.001250053,0.0008425108],"domain_scores_gemma":[0.932134,0.06035396,0.002331807,0.002915544,0.001236168,0.00102838],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008520202,0.000777191,0.004007733,0.001369882,0.0003317998,0.0003994243,0.00132631,0.4502202,0.004709152,0.4324094,0.02621994,0.077377],"study_design_scores_gemma":[0.0000864168,0.00005189864,0.0003397724,0.0000655293,0.00005835221,0.00016572,0.0001419949,0.3432363,0.00101658,0.6524714,0.002341804,0.00002416666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1783924,0.005043356,0.7775353,0.01254744,0.0003053859,0.0002903121,0.003107969,0.001870189,0.02090758],"genre_scores_gemma":[0.6878986,0.00537701,0.2867139,0.002738751,0.001082563,0.0006975748,0.003985377,0.001168921,0.01033732],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00929116,"threshold_uncertainty_score":0.03108209,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127002961","doi":"10.1613/jair.3640","title":"Domain and Function: A Dual-Space Model of Semantic Relations and Compositions","year":2012,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"National Research Council Canada","funders":"","keywords":"Domain (mathematical analysis); Function (biology); Similarity (geometry); Space (punctuation); Vector space model; Semantic space; Vector space; Semantic similarity","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.1732412730920352,"gpt":0.3904327719438797,"spread":0.2171914988518445,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001636033,0.001293613,0.0008249615,0.002531061,0.0008777567,0.004288218,0.002487086,0.002038546,0.007792963],"category_scores_gemma":[0.0046732,0.000698654,0.002504205,0.001698102,0.003146435,0.01283061,0.002997995,0.00251552,0.002304319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00188213,"about_ca_system_score_gemma":0.001640638,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008792302,"about_ca_topic_score_gemma":0.00441421,"domain_scores_codex":[0.998131,0.0006490982,0.0001092619,0.0005528546,0.0003836239,0.000174233],"domain_scores_gemma":[0.9983795,0.0005276249,0.0001567539,0.0004410563,0.0003006873,0.0001945106],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004820568,0.0001476008,0.002864496,0.0001819398,0.000094578,0.000218657,0.00134655,0.1045263,0.004074334,0.7597629,0.003539844,0.1227607],"study_design_scores_gemma":[0.00003699702,0.00008105305,0.0005599054,0.0000332649,0.00003340771,0.0001783903,0.0001856532,0.5795481,0.001131897,0.4091628,0.009014539,0.00003407494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02620866,0.0003358888,0.9607733,0.0009132229,0.000068789,0.00007744969,0.0004282925,0.0009476262,0.01024682],"genre_scores_gemma":[0.5696641,0.0004855279,0.412068,0.0003833298,0.0001124819,0.0003522043,0.001619695,0.00030104,0.01501358],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008792302,"threshold_uncertainty_score":0.02607,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2924816077","doi":"10.1613/jair.1.11418","title":"Modeling and Planning with Macro-Actions in Decentralized POMDPs","year":2019,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Office of Naval Research; National Institute of Mental Health; Multidisciplinary University Research Initiative; Air Force Office of Scientific Research; Defense Advanced Research Projects Agency; National Institutes of Health; National Science Foundation","keywords":"Computer science; Partially observable Markov decision process; Macro; Markov decision process; Exploit; Action (physics); Class (philosophy); Mathematical optimization; Artificial intelligence; Markov chain; Markov process; Markov model; Machine learning","authors":[{"name":"Christopher Amato","is_ca":false},{"name":"George Konidaris","is_ca":false},{"name":"Leslie Pack Kaelbling","is_ca":true},{"name":"Jonathan P. How","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2096420685101475,"gpt":0.4311779567163518,"spread":0.2215358882062043,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001276598,0.0007442669,0.0007625017,0.0003766993,0.0005203456,0.001172549,0.001029084,0.0008020538,0.001733584],"category_scores_gemma":[0.002943004,0.0005720668,0.0007816371,0.0005141821,0.001203703,0.001281365,0.001346051,0.001518225,0.0002022407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00107358,"about_ca_system_score_gemma":0.001382387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005792742,"about_ca_topic_score_gemma":0.007364449,"domain_scores_codex":[0.9993474,0.0002297257,0.00004449004,0.0001445738,0.0001482253,0.00008562833],"domain_scores_gemma":[0.9986859,0.0008383844,0.0001790786,0.0001175889,0.0001025047,0.00007652195],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002298945,0.00001256175,0.0002919135,0.00003246828,0.000009994695,0.00004707754,0.00003734376,0.9762113,0.0003726581,0.01738191,0.0001785192,0.005401298],"study_design_scores_gemma":[0.000009949988,0.0000110279,0.00006496305,0.000004597137,0.000003593588,0.000007650508,0.00001084934,0.9849852,0.0002376653,0.01413368,0.0005276392,0.000003198655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0201081,0.0001562998,0.9770823,0.0001527518,0.00002129399,0.00005564762,0.0001235186,0.0002862556,0.002013892],"genre_scores_gemma":[0.6724612,0.0004029033,0.3242426,0.00009323659,0.00003501041,0.0003466093,0.0002713357,0.00007795761,0.002069161],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005792742,"threshold_uncertainty_score":0.01151806,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169142063","doi":"10.1613/jair.3940","title":"Topic Segmentation and Labeling in Asynchronous Conversations","year":2013,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Advanced Text Analysis Techniques","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia","keywords":"Computer science; Asynchronous communication; Segmentation; Artificial intelligence; Conversation; Natural language processing; Exploit; Graph; Linguistics; Theoretical computer science","authors":[{"name":"Shafiq Joty","is_ca":false},{"name":"Giuseppe Carenini","is_ca":true},{"name":"Raymond T. Ng","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1082659095785678,"gpt":0.424850168063926,"spread":0.3165842584853582,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005408508,0.001015378,0.001034947,0.002402256,0.00209882,0.002590633,0.001632388,0.001766325,0.001818956],"category_scores_gemma":[0.02927748,0.0006232549,0.0009398351,0.001832323,0.00122094,0.003867432,0.002327436,0.001740273,0.001550519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001229982,"about_ca_system_score_gemma":0.00148746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005213632,"about_ca_topic_score_gemma":0.007229337,"domain_scores_codex":[0.9918485,0.004537428,0.0003562074,0.002092314,0.0008401446,0.0003254047],"domain_scores_gemma":[0.9691306,0.02260645,0.001983828,0.002948555,0.002620153,0.0007104086],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.004932778,0.0007007124,0.05377226,0.001993169,0.0004754022,0.001461678,0.02275943,0.1641653,0.09098533,0.05478608,0.02690663,0.5770612],"study_design_scores_gemma":[0.00009919636,0.0001399109,0.01267889,0.00009963029,0.0001345451,0.0003394267,0.001691377,0.8910539,0.0237433,0.05291623,0.01697447,0.0001292227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2004868,0.0009937906,0.7877063,0.0006492131,0.0001770947,0.0003308395,0.001371279,0.002780067,0.005504643],"genre_scores_gemma":[0.7780083,0.0003759026,0.2129153,0.000187475,0.0002595436,0.0005252056,0.003593986,0.0005529955,0.003581311],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005408508,"threshold_uncertainty_score":0.02860326,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125990606","doi":"10.1613/jair.2169","title":"Solution-Guided Multi-Point Constructive Search for Job Shop Scheduling","year":2007,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":60,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Tabu search; Constructive; Set (abstract data type); Computer science; Guided Local Search; Mathematical optimization; Job shop scheduling; Benchmark (surveying); Scheduling (production processes); Beam search; Iterative deepening depth-first search; Search algorithm; Incremental heuristic search; Mathematics; Artificial intelligence; Schedule","authors":[{"name":"J. Christopher Beck","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2050300271260984,"gpt":0.4302269118399463,"spread":0.2251968847138479,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002407684,0.0008445374,0.001051066,0.001274627,0.00055431,0.0006437295,0.001542026,0.0009891032,0.001302512],"category_scores_gemma":[0.007716751,0.0005776514,0.0006226306,0.001798504,0.001222769,0.0008961704,0.0008789619,0.001044087,0.0004064274],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006277398,"about_ca_system_score_gemma":0.001222151,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00152103,"about_ca_topic_score_gemma":0.001517477,"domain_scores_codex":[0.9981332,0.001148522,0.00004818442,0.00008766725,0.0005026787,0.00007973413],"domain_scores_gemma":[0.9961351,0.002831735,0.000287945,0.0002377732,0.000428692,0.00007874757],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001397303,0.00009160882,0.0004790182,0.0001683884,0.00004495222,0.00007285243,0.0001080209,0.9073277,0.003644585,0.01218254,0.001058142,0.07468255],"study_design_scores_gemma":[0.00003571209,0.00009440826,0.00006811258,0.00001098462,0.000009986379,0.00003840091,0.00001295322,0.9934162,0.001826139,0.003847347,0.0006319569,0.000007889057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02803136,0.0005969387,0.9670759,0.0001495538,0.00003146214,0.00009030434,0.00004018053,0.001060253,0.00292402],"genre_scores_gemma":[0.4220757,0.0003151981,0.575994,0.0001265475,0.00003490409,0.0002268782,0.0001440286,0.0001649489,0.0009177587],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002407684,"threshold_uncertainty_score":0.01273322,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167609405","doi":"10.1613/jair.2693","title":"The Latent Relation Mapping Engine: Algorithm and Experiments","year":2008,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Topic Modeling","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"National Research Council Canada","funders":"Princeton University","keywords":"Analogy; Relation (database); Core (optical fiber); Set (abstract data type); Latent semantic analysis; Variety (cybernetics); Relational database; Raw data","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.2756728393136693,"gpt":0.4075134273255451,"spread":0.1318405880118758,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00528759,0.001454667,0.001557627,0.001197364,0.0008447156,0.001451396,0.003178008,0.002974618,0.0092215],"category_scores_gemma":[0.0268497,0.0006241743,0.000673834,0.00213032,0.0007216026,0.004403548,0.001823387,0.002008102,0.002762828],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001328083,"about_ca_system_score_gemma":0.002066595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01001203,"about_ca_topic_score_gemma":0.007139135,"domain_scores_codex":[0.9975247,0.0009866931,0.0002272293,0.0005137013,0.0005357959,0.0002118321],"domain_scores_gemma":[0.9825532,0.01355743,0.0002829311,0.001717418,0.001588986,0.000300017],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.004512602,0.005467864,0.009874507,0.001242687,0.0004381286,0.0003534133,0.0006001504,0.2317805,0.00642992,0.01080732,0.03104986,0.6974431],"study_design_scores_gemma":[0.0009780178,0.0004254688,0.001424702,0.00004688253,0.00008238017,0.00009551922,0.0001803625,0.9816638,0.004404127,0.007859108,0.002805456,0.00003416669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6400386,0.003992807,0.2972321,0.002084834,0.0006197609,0.002731104,0.003175063,0.02346424,0.02666141],"genre_scores_gemma":[0.5441714,0.0006897709,0.4442716,0.0004548565,0.00007259358,0.001716669,0.003658497,0.000847284,0.004117365],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01001203,"threshold_uncertainty_score":0.03084898,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1799762961","doi":"10.1613/jair.904","title":"Accelerating Reinforcement Learning by Composing Solutions of Automatically Identified Subtasks","year":2002,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Reinforcement learning; Exploit; Partition (number theory); Function (biology); Base (topology); State space; Reinforcement; Function approximation","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.2748869913500262,"gpt":0.396747064427609,"spread":0.1218600730775828,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001145652,0.0009350267,0.0007912785,0.0004615308,0.0003441231,0.0005655198,0.001543995,0.00071445,0.003616001],"category_scores_gemma":[0.004633822,0.0004698567,0.0004359708,0.0002979573,0.0006059353,0.001242458,0.001217726,0.001171402,0.001070484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004460455,"about_ca_system_score_gemma":0.0006759282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001485715,"about_ca_topic_score_gemma":0.001297837,"domain_scores_codex":[0.9995541,0.0001074651,0.00003204748,0.0001264772,0.0001287145,0.00005118828],"domain_scores_gemma":[0.9984424,0.0007934638,0.0001889012,0.0002841071,0.0001915959,0.00009956884],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005961486,0.000903324,0.00233347,0.0001933537,0.0001075187,0.0001883825,0.0003313167,0.3132252,0.06351679,0.006676112,0.001691532,0.6102368],"study_design_scores_gemma":[0.00009314164,0.0002727565,0.0004715872,0.00001451725,0.00003611137,0.00009134388,0.00002689647,0.9674308,0.02352276,0.005551459,0.0024683,0.00002031397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09591879,0.00008921867,0.8962111,0.0000960365,0.00004728784,0.0002545096,0.00002540708,0.004415188,0.002942406],"genre_scores_gemma":[0.5686299,0.00009953748,0.4271002,0.00008123036,0.00002974094,0.0003129284,0.0001161823,0.0002664943,0.003363631],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003616001,"threshold_uncertainty_score":0.01209676,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2140994944","doi":"10.1613/jair.2241","title":"Compressed Pattern Databases","year":2007,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Israel Science Foundation; National Science Foundation","keywords":"Computer science; Table (database); Set (abstract data type); Uncompressed video; Database; Heuristic; Merge (version control); Domain (mathematical analysis); Algorithm; Data mining; Theoretical computer science; Information retrieval; Programming language; Artificial intelligence; Mathematics","authors":[{"name":"Ariel Felner","is_ca":false},{"name":"Richard E. Korf","is_ca":false},{"name":"Ram Meshulam","is_ca":false},{"name":"Robert C. Holte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3046764847256089,"gpt":0.4608203706218097,"spread":0.1561438858962008,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008459085,0.0007615595,0.00113819,0.002548054,0.0007847829,0.002718816,0.003200774,0.001078593,0.01715063],"category_scores_gemma":[0.008260282,0.0005725381,0.0007058225,0.007005116,0.0005711989,0.005599635,0.002307038,0.001213673,0.00420561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009098246,"about_ca_system_score_gemma":0.001514261,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002360557,"about_ca_topic_score_gemma":0.003112001,"domain_scores_codex":[0.9981909,0.0002642213,0.0002411429,0.0003180995,0.0008204862,0.0001651045],"domain_scores_gemma":[0.9944019,0.001233397,0.0003309786,0.002886095,0.001010335,0.0001373886],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001459046,0.0003539084,0.001982943,0.0007867489,0.0001146519,0.0006620953,0.0003499511,0.04284903,0.01683892,0.0620344,0.07507002,0.7974983],"study_design_scores_gemma":[0.0006640779,0.0006802641,0.002712423,0.000383268,0.0001507131,0.003170355,0.001046552,0.4264146,0.06293914,0.2563447,0.2453478,0.000145976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07511418,0.003947719,0.8339663,0.002390162,0.0007491993,0.001039204,0.03338121,0.01823823,0.03117372],"genre_scores_gemma":[0.2953318,0.002588809,0.6267207,0.0007654142,0.0002091175,0.001198971,0.05889077,0.0008872895,0.0134072],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01715063,"threshold_uncertainty_score":0.0573746,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2170780172","doi":"10.1613/jair.3463","title":"Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems","year":2012,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Heuristics; Constraint satisfaction problem; Computer science; Benchmark (surveying); Constraint programming; Heuristic; Constraint (computer-aided design); Constraint satisfaction; Search tree; Mathematical optimization; Local search (optimization); Theoretical computer science; Search algorithm; Mathematics; Artificial intelligence; Algorithm","authors":[{"name":"Gilles Pesant","is_ca":true},{"name":"Claude-Guy Quimper","is_ca":false},{"name":"Alessandro Zanarini","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2126970487318262,"gpt":0.408101652300917,"spread":0.1954046035690908,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004417024,0.001277933,0.00158847,0.002082513,0.0007643208,0.001491374,0.002523106,0.001552769,0.002352534],"category_scores_gemma":[0.01876333,0.0006076397,0.001010203,0.004224699,0.001621947,0.002284652,0.001549747,0.002073417,0.0004132998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001796906,"about_ca_system_score_gemma":0.001951939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003806674,"about_ca_topic_score_gemma":0.005127515,"domain_scores_codex":[0.9971411,0.001466381,0.0002067368,0.0003305251,0.0006261749,0.000229042],"domain_scores_gemma":[0.9915023,0.006203283,0.0006743075,0.0008728685,0.0005505565,0.0001967427],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002413432,0.0001912221,0.001900448,0.0003984952,0.0001064366,0.0001095713,0.0002222451,0.646166,0.003650113,0.05468564,0.004239761,0.2880888],"study_design_scores_gemma":[0.0000730566,0.00006495733,0.0001777633,0.0000344029,0.00002400919,0.00005692324,0.00003561327,0.9634135,0.00154731,0.03262223,0.001934307,0.00001590946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01179322,0.000577424,0.9846967,0.0001781661,0.00002830868,0.0001695999,0.00009236686,0.0007648567,0.001699357],"genre_scores_gemma":[0.1842302,0.0004908977,0.8130314,0.0002332015,0.00005121106,0.0003855697,0.000441888,0.0002614339,0.0008741705],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004417024,"threshold_uncertainty_score":0.02335972,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2754879180","doi":"10.1613/jair.5699","title":"Revisiting the Arcade Learning Environment: Evaluation Protocols and Open Problems for General Agents","year":2018,"lang":"en","type":"preprint","venue":"Journal of Artificial Intelligence Research","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Alberta Innovates; Alberta Innovates - Technology Futures; Alberta Machine Intelligence Institute; Compute Canada; DeepMind; National Science Foundation","keywords":"Variety (cybernetics); Computer science; Benchmark (surveying); Key (lock); Field (mathematics); Data science; Best practice; State (computer science); Management science; Artificial intelligence; Engineering; Computer security; Political science","authors":[{"name":"Marlos C. Machado","is_ca":false},{"name":"Marc G. Bellemare","is_ca":false},{"name":"Erik Talvitie","is_ca":false},{"name":"Joel Veness","is_ca":false},{"name":"Matthew Hausknecht","is_ca":false},{"name":"Michael Bowling","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.4920271193673282,"gpt":0.5281472299857938,"spread":0.03612011061846554,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.1092359,0.00157611,0.002031175,0.002430534,0.001975174,0.008701421,0.005152726,0.004062979,0.008125558],"category_scores_gemma":[0.3080233,0.001185015,0.001257238,0.002136852,0.006246079,0.01533696,0.01014672,0.009704608,0.002485888],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005616248,"about_ca_system_score_gemma":0.00810021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005822661,"about_ca_topic_score_gemma":0.006563233,"domain_scores_codex":[0.8508615,0.1193537,0.005649713,0.006876897,0.01563162,0.001626518],"domain_scores_gemma":[0.7420573,0.1925093,0.006582883,0.02889262,0.02618293,0.003774914],"domain_codex":null,"domain_gemma":"evaluation","domain_candidate":"evaluation","domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001562071,0.0007472308,0.00472513,0.001117001,0.0004364427,0.0001814562,0.002596735,0.1308234,0.001467112,0.5359082,0.03554575,0.2848896],"study_design_scores_gemma":[0.000585775,0.0006794519,0.0008370691,0.0006034026,0.0001091905,0.0001247693,0.0007289476,0.5693612,0.003951241,0.3831101,0.03976535,0.0001436379],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0226384,0.0009048047,0.9435588,0.009530804,0.000414702,0.0009384098,0.0006010251,0.004081619,0.01733155],"genre_scores_gemma":[0.2790711,0.0005345293,0.7079653,0.002315576,0.0002308871,0.002501197,0.0008710578,0.001540488,0.004969928],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8907641,"threshold_uncertainty_score":0.5777017,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2902729397","doi":"10.1613/jair.1.11263","title":"Grounding Language for Transfer in Deep Reinforcement Learning","year":2018,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Reinforcement learning; Computer science; Variety (cybernetics); Transfer of learning; Representation (politics); Artificial intelligence; Task (project management); Differentiable function; Domain (mathematical analysis); Component (thermodynamics); Meaning (existential); Machine learning","authors":[{"name":"Karthik Narasimhan","is_ca":true},{"name":"Regina Barzilay","is_ca":true},{"name":"Tommi Jaakkola","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1503297529386259,"gpt":0.4297375410971567,"spread":0.2794077881585307,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015388,0.000822863,0.0006731302,0.0003128105,0.0003187484,0.0009020603,0.001455251,0.0009878164,0.003869926],"category_scores_gemma":[0.008419376,0.0003767623,0.0004645805,0.0003237191,0.001615824,0.002792707,0.001638919,0.00228585,0.0006117422],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001166476,"about_ca_system_score_gemma":0.001001064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002177422,"about_ca_topic_score_gemma":0.002020562,"domain_scores_codex":[0.9993768,0.0002712831,0.00003212376,0.000157309,0.0001059309,0.00005657274],"domain_scores_gemma":[0.9978663,0.001466484,0.00019536,0.0002575567,0.0001456883,0.00006858312],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001057424,0.0001197023,0.0005512286,0.0001001776,0.00002803802,0.0001357105,0.000220332,0.859905,0.00339498,0.07762755,0.001225425,0.05658612],"study_design_scores_gemma":[0.000009332321,0.00002929068,0.00002881457,0.000007184947,0.000003341387,0.000008356428,0.000008064091,0.9723651,0.0006973583,0.02629643,0.0005424908,0.000004216641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01679389,0.0001259852,0.979665,0.0003685812,0.0000445777,0.00004646293,0.00005348457,0.0007189062,0.002183159],"genre_scores_gemma":[0.8872722,0.0001346256,0.1086542,0.0002729237,0.00003913224,0.0002487676,0.0001310886,0.000143729,0.003103318],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003869926,"threshold_uncertainty_score":0.01294619,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124464337","doi":"10.1613/jair.2497","title":"Dynamic Control in Real-Time Heuristic Search","year":2008,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Háskólinn í Reykjavík; Ministrstvo za visoko šolstvo, znanost in tehnologijo","keywords":"Computer science; Incremental heuristic search; Heuristic; Completeness (order theory); Bounded function; Action (physics); Constant (computer programming); Search problem; Mathematical optimization; Time complexity; State (computer science); Search algorithm; Beam search; Algorithm; Artificial intelligence; Mathematics","authors":[{"name":"Vadim Bulitko","is_ca":true},{"name":"Mitja Luštrek","is_ca":false},{"name":"Jonathan Schaeffer","is_ca":true},{"name":"Yngvi Björnsson","is_ca":false},{"name":"Sverrir Sigmundarson","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1420727133656529,"gpt":0.4191170462261772,"spread":0.2770443328605243,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001990665,0.0008131384,0.0007367433,0.0006983082,0.0004744545,0.001759884,0.001561415,0.001122949,0.003452437],"category_scores_gemma":[0.009126629,0.000543997,0.000445439,0.0008389702,0.003192765,0.002572932,0.001343452,0.001477891,0.0004149549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00180391,"about_ca_system_score_gemma":0.001408303,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004558701,"about_ca_topic_score_gemma":0.002517963,"domain_scores_codex":[0.9987207,0.0004943867,0.00005881139,0.0002459296,0.0003553396,0.00012478],"domain_scores_gemma":[0.9960867,0.002785562,0.0003242839,0.0004003658,0.0002952853,0.0001077435],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001401426,0.00008202504,0.0003364997,0.0001809185,0.00003780238,0.00009041041,0.0001357554,0.7412595,0.001836428,0.1854033,0.001302661,0.06919452],"study_design_scores_gemma":[0.00005233318,0.00004732352,0.00008350902,0.00001880395,0.00001064553,0.00002974567,0.00002222273,0.9146658,0.0007984615,0.08044419,0.003814909,0.00001193415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02153204,0.001395372,0.9594408,0.0005775627,0.0001213058,0.00007636135,0.00003513585,0.0005493908,0.01627203],"genre_scores_gemma":[0.7625882,0.001209136,0.2292704,0.0003250944,0.0001320493,0.0003669111,0.00008285041,0.0001614613,0.00586383],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004558701,"threshold_uncertainty_score":0.01308829,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2106654973","doi":"10.1613/jair.1332","title":"Existence of Multiagent Equilibria with Limited Agents","year":2004,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":42,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"U.S. Air Force; Advanced Research Projects Agency; Defense Advanced Research Projects Agency","keywords":"Nash equilibrium; Counterexample; Computer science; Perspective (graphical); Extension (predicate logic); Abstraction; Mathematical economics; Artificial intelligence; Mathematics; Epistemology","authors":[{"name":"Michael Bowling","is_ca":true},{"name":"Manuela Veloso","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.6119528539313067,"gpt":0.5618701263001141,"spread":0.05008272763119259,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004246173,0.0005157671,0.0008354775,0.0006255598,0.001009136,0.00235858,0.001611127,0.001591947,0.003083315],"category_scores_gemma":[0.03023677,0.0004407434,0.0007160345,0.00057654,0.00250523,0.005905238,0.002574283,0.001900091,0.0003657206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001293121,"about_ca_system_score_gemma":0.001005973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001232744,"about_ca_topic_score_gemma":0.001080628,"domain_scores_codex":[0.9968445,0.001364974,0.0002533838,0.0005745438,0.0006127968,0.0003498064],"domain_scores_gemma":[0.9719312,0.01959504,0.003424337,0.002627634,0.001522046,0.0008996659],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000242025,0.0001853636,0.008217545,0.0002449868,0.0001297884,0.0006576877,0.0009628307,0.1502218,0.004373424,0.8092673,0.001140564,0.02435686],"study_design_scores_gemma":[0.00008714607,0.0001042584,0.001133915,0.00005805788,0.00002828091,0.0002312509,0.0004039584,0.3675566,0.002830009,0.6241381,0.003396369,0.00003222489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3718626,0.0003470861,0.6018096,0.001720332,0.00002776759,0.0001870829,0.0001740203,0.00018145,0.02369013],"genre_scores_gemma":[0.941676,0.0001406044,0.05564114,0.0001084276,0.00001791323,0.0002266358,0.00006047936,0.00001885008,0.002109987],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004246173,"threshold_uncertainty_score":0.02245617,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2778562959","doi":"10.1613/jair.5530","title":"A Knowledge Level Account of Forgetting","year":2017,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Forgetting; Computer science; Equivalence (formal languages); Rotation formalisms in three dimensions; Non-monotonic logic; Logical consequence; Set (abstract data type); Classical logic; Description logic; Relation (database); Knowledge representation and reasoning; Theoretical computer science; Artificial intelligence; Mathematics; Discrete mathematics; Programming language; Linguistics","authors":[{"name":"James P. Delgrande","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.4105495774803021,"gpt":0.4803035970827368,"spread":0.06975401960243471,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00254893,0.0005854493,0.0004910877,0.002468376,0.001954736,0.004994651,0.002398315,0.002257235,0.005231712],"category_scores_gemma":[0.005031308,0.0004496317,0.001642707,0.001887079,0.01044405,0.01731873,0.00419999,0.003685975,0.0005723668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002485603,"about_ca_system_score_gemma":0.001371796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002477644,"about_ca_topic_score_gemma":0.001617896,"domain_scores_codex":[0.9979976,0.0004248827,0.0001540651,0.0004635822,0.0006434108,0.0003165012],"domain_scores_gemma":[0.9954312,0.001847773,0.0003402866,0.001518385,0.000687544,0.0001748326],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006544523,0.000005459035,0.0001112739,0.00002199209,0.00000646581,0.00009687175,0.0004475779,0.001038268,0.000161624,0.9943247,0.0003455802,0.003433539],"study_design_scores_gemma":[0.000005854375,0.00001079194,0.0001319571,0.00002494946,0.00001570018,0.0001252855,0.00007521186,0.004296965,0.0004025371,0.988583,0.006318596,0.000009157866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04636739,0.003998628,0.7970407,0.007732918,0.0003516399,0.00008378811,0.0003580942,0.0004066238,0.1436602],"genre_scores_gemma":[0.9031729,0.001707956,0.0750961,0.001586211,0.0006254105,0.0001083136,0.000378992,0.0001251205,0.01719904],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005231712,"threshold_uncertainty_score":0.0180344,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4409258158","doi":"10.1613/jair.1.16665","title":"Detecting AI-Generated Text: Factors Influencing Detectability with Current Methods","year":2025,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Topic Modeling","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"National Research Council Canada","funders":"Ministère de la Défense Nationale","keywords":"Current (fluid); Computer science; Artificial intelligence; Physics","authors":[{"name":"Kathleen Fraser","is_ca":true},{"name":"Hillary Dawkins","is_ca":true},{"name":"Svetlana Kiritchenko","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2192959255969502,"gpt":0.498691993893544,"spread":0.2793960682965937,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03233095,0.001458091,0.001389667,0.006893528,0.002117226,0.008502508,0.002819546,0.002971203,0.002855466],"category_scores_gemma":[0.2383678,0.0005881769,0.001186764,0.004880014,0.002266101,0.01475893,0.003054719,0.003825939,0.003835718],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001442375,"about_ca_system_score_gemma":0.001611154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004329859,"about_ca_topic_score_gemma":0.004582524,"domain_scores_codex":[0.9726078,0.01420758,0.00305499,0.004326969,0.005052515,0.0007501737],"domain_scores_gemma":[0.6395614,0.307193,0.01313207,0.02609702,0.01219128,0.001825278],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001745343,0.0006932091,0.3704461,0.002270594,0.0007209558,0.000477067,0.004773808,0.0190265,0.007965226,0.01272688,0.04045288,0.5387014],"study_design_scores_gemma":[0.0002283044,0.0005967573,0.1382182,0.00128442,0.0006804547,0.002593728,0.006381493,0.6894081,0.02510892,0.07747814,0.05768181,0.0003395933],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5131224,0.03063308,0.3947145,0.01596719,0.001718416,0.00127631,0.009720131,0.007247591,0.02560031],"genre_scores_gemma":[0.899339,0.003534572,0.08482188,0.0009293738,0.001085131,0.0003628375,0.006872129,0.0005274373,0.00252753],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03233095,"threshold_uncertainty_score":0.1709844,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1671111194","doi":"10.1613/jair.689","title":"On Deducing Conditional Independence from d-Separation in Causal Graphs with Feedback (Research Note)","year":2000,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Conditional independence; Uniqueness; Independence (probability theory); Separation (statistics); Pearl; Mathematics; Conditional expectation; Causal model; Mathematical economics; Discrete mathematics; Econometrics; Statistics; Geography","authors":[{"name":"Radford M. Neal","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1668487231968562,"gpt":0.4464364931101303,"spread":0.2795877699132742,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009477746,0.001527828,0.001843112,0.002664534,0.001846285,0.002088799,0.001677144,0.002566093,0.007479812],"category_scores_gemma":[0.06240935,0.001504173,0.003961305,0.003181779,0.006512576,0.009251128,0.00592639,0.007761726,0.00128796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002415731,"about_ca_system_score_gemma":0.002201944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005838035,"about_ca_topic_score_gemma":0.00337941,"domain_scores_codex":[0.9949607,0.002363018,0.0002550781,0.001180556,0.0009416023,0.0002990202],"domain_scores_gemma":[0.9239622,0.06474353,0.003096896,0.003700036,0.003214132,0.001283063],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009582422,0.00006658021,0.001114083,0.0002576219,0.0001035775,0.0002220397,0.0005230912,0.03013129,0.0008392462,0.9364376,0.00322104,0.02698804],"study_design_scores_gemma":[0.0000200666,0.0000165378,0.0002878491,0.00003985115,0.00001817856,0.00006697651,0.00002446197,0.03497478,0.0002632118,0.9622414,0.002024341,0.00002233203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007114289,0.0006826852,0.9831132,0.001694802,0.0001005324,0.00005435939,0.0002054497,0.0001338085,0.006900914],"genre_scores_gemma":[0.4443012,0.004614296,0.535386,0.004589047,0.001416394,0.0006227141,0.001463951,0.00045881,0.007147661],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009477746,"threshold_uncertainty_score":0.05012375,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3166631396","doi":"10.1613/jair.1.13083","title":"Crossing the Conversational Chasm: A Primer on Natural Language Processing for Multilingual Task-Oriented Dialogue Systems","year":2022,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Topic Modeling","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Task (project management); Pipeline (software); Natural language processing; Focus (optics); Machine translation; Artificial intelligence; Modular design; Conversation; Point (geometry); Field (mathematics); Linguistics; Programming language","authors":[{"name":"Evgeniia Razumovskaia","is_ca":false},{"name":"Goran Glavašš","is_ca":false},{"name":"Olga Majewska","is_ca":false},{"name":"Edoardo Maria Ponti","is_ca":true},{"name":"Anna Korhonen","is_ca":false},{"name":"Ivan Vulić","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.145382552456486,"gpt":0.4254142850814288,"spread":0.2800317326249428,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008202052,0.001518971,0.001591237,0.005153244,0.001364842,0.00888267,0.004828205,0.005335535,0.006844417],"category_scores_gemma":[0.009718705,0.002017056,0.001681662,0.003801266,0.007246613,0.02160467,0.006105505,0.008615621,0.004644806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00273982,"about_ca_system_score_gemma":0.001912193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001925616,"about_ca_topic_score_gemma":0.001311005,"domain_scores_codex":[0.9949768,0.002306592,0.0005306732,0.0009077652,0.001064563,0.0002135655],"domain_scores_gemma":[0.9933301,0.004883179,0.0002345108,0.0006074238,0.0007249819,0.0002199241],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001279792,0.0001850379,0.0004001303,0.003338536,0.00008577416,0.0004483491,0.005398672,0.004677929,0.003569563,0.5502567,0.0319704,0.3995409],"study_design_scores_gemma":[0.00001920948,0.000106487,0.0002825656,0.002207899,0.0000272516,0.0005361754,0.0009357925,0.01819799,0.001994139,0.3680974,0.6074804,0.0001147202],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.001030363,0.1233564,0.8373643,0.01258367,0.001745172,0.0002745742,0.0001866199,0.001414999,0.0220438],"genre_scores_gemma":[0.04158784,0.127808,0.7991263,0.007792281,0.005770571,0.001681798,0.0008354019,0.001469763,0.0139281],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.00888267,"threshold_uncertainty_score":0.0433771,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1037351197","doi":"10.1613/jair.4676","title":"Approximate Value Iteration with Temporally Extended Actions","year":2015,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Landmark; Computer science; Convergence (economics); Bellman equation; Mathematical optimization; Reinforcement learning; Value (mathematics); Function (biology); Term (time); State space; Mathematics; Artificial intelligence; Machine learning; Statistics","authors":[{"name":"Timothy Mann","is_ca":false},{"name":"Shie Mannor","is_ca":false},{"name":"Doina Precup","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3129026095091614,"gpt":0.4403874809011682,"spread":0.1274848713920068,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00181944,0.0007013217,0.0009005973,0.0004314267,0.0003636199,0.0008234325,0.001210394,0.001073595,0.00218793],"category_scores_gemma":[0.009021895,0.0004651643,0.00068642,0.0005604375,0.001545109,0.001880801,0.001528931,0.00147158,0.0002591783],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008666422,"about_ca_system_score_gemma":0.001103593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002651111,"about_ca_topic_score_gemma":0.00295563,"domain_scores_codex":[0.9990249,0.0004388251,0.00006057854,0.0001635262,0.0002209964,0.00009116196],"domain_scores_gemma":[0.9963998,0.002617716,0.0003030895,0.0003036343,0.0002569566,0.0001188202],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001933607,0.00003391119,0.0009379204,0.00005970962,0.00003402476,0.00007814893,0.0001523689,0.9063586,0.001500281,0.04725663,0.0003501524,0.04304481],"study_design_scores_gemma":[0.00001406497,0.00003853927,0.00005273847,0.000008295465,0.000004173721,0.00001520862,0.0000110135,0.981024,0.0005599939,0.017954,0.0003122049,0.000005774678],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02330738,0.0001096339,0.9752405,0.00007882988,0.00001590351,0.00003171539,0.00002396324,0.0001831043,0.001008951],"genre_scores_gemma":[0.6523781,0.0001289923,0.3452871,0.00008075738,0.00001840452,0.0001931799,0.00009320434,0.00007835437,0.001741914],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002651111,"threshold_uncertainty_score":0.009622276,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2540405007","doi":"10.1613/jair.5128","title":"Optimal Partial-Order Plan Relaxation via MaxSAT","year":2016,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Flexibility (engineering); Computer science; Plan (archaeology); Encoding (memory); Mathematical optimization; Heuristic; Metric (unit); Order (exchange); Algorithm; Artificial intelligence; Mathematics; Operations management","authors":[{"name":"Christian Muise","is_ca":true},{"name":"J. Christopher Beck","is_ca":true},{"name":"Sheila A. McIlraith","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.154734988145756,"gpt":0.3874821599405522,"spread":0.2327471717947962,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008612095,0.001023547,0.0005209737,0.0004801233,0.0003457374,0.0007141525,0.000681792,0.000494368,0.003419849],"category_scores_gemma":[0.002535585,0.0005180563,0.0008606386,0.0007299049,0.0007100124,0.001117712,0.0009301117,0.001233591,0.0004093616],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008320165,"about_ca_system_score_gemma":0.001608962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002896303,"about_ca_topic_score_gemma":0.006207155,"domain_scores_codex":[0.9994637,0.0001973597,0.00002309144,0.00009759572,0.0001496734,0.00006861139],"domain_scores_gemma":[0.999014,0.0007039748,0.0000976462,0.00008035245,0.00007754475,0.00002645102],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001087747,0.0000579339,0.0003467343,0.000185836,0.00003150773,0.0001112591,0.00008582317,0.8984625,0.002674011,0.03580549,0.002589431,0.05954062],"study_design_scores_gemma":[0.00004195069,0.00007875955,0.0001153941,0.00002686058,0.00001754739,0.00003853174,0.00005882005,0.9462395,0.002532758,0.04818339,0.002657915,0.000008669009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03410538,0.0002689569,0.9534566,0.0003078934,0.00003108608,0.0002017242,0.0004711987,0.001052985,0.01010409],"genre_scores_gemma":[0.3298356,0.0002878046,0.6649839,0.0001516175,0.00002445359,0.0003420456,0.0008552705,0.000259807,0.003259523],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003419849,"threshold_uncertainty_score":0.01144052,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}