{"meta":{"query_hash":"7b44eacfed5d","filters":{"venue":"Journal of Artificial Intelligence Research"},"cohort_total":116,"direct_labels_cover":0,"predictions_cover":116,"exported":116,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/7b44eacfed5d","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Artificial+Intelligence+Research"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.3129026095091614,"score_gpt":0.4403874809011682,"score_spread":0.12748487139200682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1037351197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058895596,0.00004413497,0.98907715,0.0023429203,0.0003474538,0.00016781094,2.0766439e-7,0.000029754756,0.0021010193],"genre_scores_gemma":[0.8755842,0.000032473476,0.12357999,0.00005334305,0.0003195096,0.0000051943157,8.1035125e-7,0.000014059084,0.00041041075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965006,0.00037039127,0.0006449328,0.00020415854,0.0018593626,0.00042057328],"domain_scores_gemma":[0.9963797,0.00024776618,0.00031170197,0.00040328366,0.002350853,0.00030671046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004761231,0.00011444859,0.00018726851,0.00058172183,0.00023106358,0.0007168989,0.0010764931,0.00006657666,0.000016923814],"category_scores_gemma":[0.0007684708,0.00008539605,0.000062470084,0.0011652311,0.0001700007,0.0013771408,0.00016885245,0.00078821456,0.00010691651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000189924,0.00018304108,0.0001290981,0.000015767038,0.00004868655,0.00013908761,0.0030127808,0.7680834,0.0028026074,0.17401065,0.0010006395,0.050384343],"study_design_scores_gemma":[0.00008520187,0.002237396,0.000052340987,0.00010207959,0.0000075778735,0.00024067014,0.0018335835,0.93347174,0.028519746,0.030397616,0.0028771688,0.00017486369],"about_ca_topic_score_codex":0.00002482724,"about_ca_topic_score_gemma":0.000005977709,"teacher_disagreement_score":0.86969465,"about_ca_system_score_codex":0.00021586785,"about_ca_system_score_gemma":0.00082869217,"threshold_uncertainty_score":0.69130725},"labels":[],"label_agreement":null},{"id":"W1221313983","doi":"10.1613/jair.4558","title":"Belief Change with Uncertain Action Histories","year":2015,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; British Columbia Institute of Technology","funders":"","keywords":"Belief revision; Iterated function; Sequence (biology); Generalization; Action (physics); Computer science; Perception; Formalism (music); Artificial intelligence; Mathematics; Epistemology","score_opus":0.5288386770750579,"score_gpt":0.4561122789807625,"score_spread":0.07272639809429543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1221313983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06767481,0.0029769044,0.9057264,0.009046574,0.003333159,0.00049211713,0.0000012852471,0.000095851705,0.010652942],"genre_scores_gemma":[0.9895321,0.00014727653,0.008465333,0.00004249609,0.0012821811,0.000009854782,3.2245597e-7,0.000010876627,0.0005095203],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972137,0.00032040584,0.00041084836,0.00022453713,0.0013544476,0.00047605985],"domain_scores_gemma":[0.99640644,0.00025799492,0.00021348213,0.00031994397,0.002431903,0.00037025503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004001107,0.00011940101,0.0002202299,0.00045997644,0.0002255309,0.00029062422,0.001067275,0.000082255094,0.000025196245],"category_scores_gemma":[0.00074977655,0.00008266888,0.00006964378,0.0011257549,0.00024467372,0.0010951469,0.00017091782,0.0006451375,0.00012577561],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005029625,0.0005634705,0.00097291375,0.000038648763,0.000055648354,0.000453918,0.029943591,0.00031284388,0.0013446644,0.23573694,0.005867266,0.72420716],"study_design_scores_gemma":[0.0005513579,0.019851739,0.00096725515,0.0005841459,0.000050608258,0.0017029728,0.035193086,0.062250018,0.17334615,0.45210344,0.2519819,0.0014173168],"about_ca_topic_score_codex":0.00020636775,"about_ca_topic_score_gemma":0.0002657807,"teacher_disagreement_score":0.92185736,"about_ca_system_score_codex":0.00046271528,"about_ca_system_score_gemma":0.00074185623,"threshold_uncertainty_score":0.3371139},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.23200421089673143,"score_gpt":0.4389980739433883,"score_spread":0.20699386304665687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1258972194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054951063,0.00004591129,0.99045956,0.0019415393,0.00056302163,0.000127909,0.0000011060437,0.000056144476,0.0013096936],"genre_scores_gemma":[0.57928663,0.000035668945,0.41994804,0.0000992832,0.00047359458,0.0000038485427,0.0000011928433,0.000013734639,0.00013796224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967655,0.00051344966,0.0007009537,0.00020920948,0.0014075408,0.00040338142],"domain_scores_gemma":[0.9958146,0.0002620699,0.00019089974,0.00030862648,0.0028519107,0.0005718495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004610363,0.0001038374,0.0002064978,0.0006055731,0.0001548519,0.00052969786,0.00091620913,0.00009301355,0.00016882282],"category_scores_gemma":[0.0010842705,0.000088966706,0.00007431196,0.001168406,0.00018184172,0.0010987957,0.000095821895,0.000573651,0.0001717925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002765334,0.00017036193,0.000029011206,0.0000037163609,0.000018491868,0.00007037818,0.0015149704,0.0016687092,0.0014047456,0.076313496,0.0006040996,0.9181744],"study_design_scores_gemma":[0.000060231203,0.00084088516,0.0001664333,0.000026166483,0.0000037494476,0.00020334178,0.0009220534,0.93031925,0.014449513,0.051741347,0.001142715,0.00012431537],"about_ca_topic_score_codex":0.000032065906,"about_ca_topic_score_gemma":0.00002494985,"teacher_disagreement_score":0.92865056,"about_ca_system_score_codex":0.00017599571,"about_ca_system_score_gemma":0.0012364159,"threshold_uncertainty_score":0.51078886},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07307959598059346,"score_gpt":0.39083408000608344,"score_spread":0.31775448402549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480330138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014864787,0.000084485626,0.99537027,0.0023038054,0.00035058512,0.0002565175,8.1002696e-7,0.000023443827,0.00012362475],"genre_scores_gemma":[0.60375285,0.00047047512,0.39548966,0.00003349079,0.00014611905,0.0000068766744,2.5729446e-7,0.000017130587,0.000083121966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673647,0.00051243044,0.0009018873,0.00033075328,0.0010106164,0.0005078327],"domain_scores_gemma":[0.9962897,0.0011281166,0.00030293717,0.000339451,0.001717783,0.00022207075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003428349,0.00013802238,0.00027703095,0.0014079458,0.00019191402,0.00014721643,0.0008460852,0.00009853821,0.00010230252],"category_scores_gemma":[0.002111295,0.00009285769,0.00010232518,0.0021935524,0.00020553659,0.0015156212,0.00021755288,0.0004424105,0.00005568787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025568804,0.0003254128,0.000103192215,0.0000057330944,0.000016917838,0.00016150568,0.0010491416,0.5424291,0.018570555,0.0066608866,0.000047075486,0.4303748],"study_design_scores_gemma":[0.0002698063,0.00028516244,0.000023442999,0.00016577516,0.0000021959202,0.00008555794,0.00022155473,0.9199374,0.049060814,0.029703872,0.00010139456,0.00014305486],"about_ca_topic_score_codex":0.00001983055,"about_ca_topic_score_gemma":0.000019145782,"teacher_disagreement_score":0.6022664,"about_ca_system_score_codex":0.0003634111,"about_ca_system_score_gemma":0.00025522025,"threshold_uncertainty_score":0.37866268},"labels":[],"label_agreement":null},{"id":"W1539123322","doi":"10.1613/jair.2539","title":"Compositional Belief Update","year":2008,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Operator (biology); Sentence; Hierarchy; Core (optical fiber); Dual (grammatical number); Belief revision; Semantics (computer science); Class (philosophy)","score_opus":0.19611251418010606,"score_gpt":0.4013635257268115,"score_spread":0.20525101154670544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539123322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13707499,0.001100678,0.8475596,0.0046575894,0.0010407949,0.00015615656,0.000001978724,0.0000428042,0.008365434],"genre_scores_gemma":[0.9815009,0.0005319416,0.016909795,0.00009105597,0.0007316645,0.0000023542682,6.9109836e-7,0.0000081264125,0.00022343453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968782,0.00033196388,0.00065392745,0.00023442261,0.0013732797,0.0005282134],"domain_scores_gemma":[0.997031,0.00046256962,0.00018783992,0.00032160117,0.0017065529,0.00029043836],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027523194,0.0001161882,0.00023637911,0.000503389,0.000575255,0.00019111064,0.0016274494,0.00008183362,0.00018537306],"category_scores_gemma":[0.00040439444,0.00009260908,0.0001667955,0.0009694602,0.00039851392,0.00066281925,0.00030405057,0.0008075266,0.00081952894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015373967,0.0009796813,0.0006928133,0.000018070987,0.00007011468,0.0013225041,0.0034795469,0.00048567803,0.014637563,0.8041507,0.014708902,0.1593007],"study_design_scores_gemma":[0.00019557407,0.002508526,0.0026390227,0.00018282459,0.000012419909,0.004295643,0.00073257077,0.04013323,0.33300406,0.57976687,0.03588528,0.00064401637],"about_ca_topic_score_codex":0.000018999699,"about_ca_topic_score_gemma":0.0000093758845,"teacher_disagreement_score":0.844426,"about_ca_system_score_codex":0.00012346586,"about_ca_system_score_gemma":0.0005650731,"threshold_uncertainty_score":0.99995846},"labels":[],"label_agreement":null},{"id":"W1557519121","doi":"10.1613/jair.2293","title":"Graph Abstraction in Real-time Heuristic Search","year":2007,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"University of Alberta; Western Canada Research Grid","keywords":"Computer science; Abstraction; Incremental heuristic search; Heuristic; Graph; Maxima and minima; Theoretical computer science; Pathfinding; Class (philosophy); Situated; Beam search; Artificial intelligence; Search algorithm; Algorithm; Mathematics","score_opus":0.15994001886198067,"score_gpt":0.4311293688593298,"score_spread":0.2711893499973491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557519121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37778693,0.00018284403,0.6173208,0.001119923,0.00038666127,0.00015182272,7.660321e-7,0.000032226148,0.0030180498],"genre_scores_gemma":[0.9835452,0.00014791868,0.015870804,0.000014498303,0.0002852159,9.510731e-7,5.3797015e-7,0.000009965436,0.00012492064],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9963234,0.00038304174,0.0009273931,0.00025128206,0.0013596858,0.0007551763],"domain_scores_gemma":[0.99641436,0.0019786563,0.00018166569,0.00030160407,0.0008705085,0.00025320283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019410966,0.000110931804,0.00021921971,0.0015310328,0.0002249931,0.0002657706,0.0010298959,0.000117564596,0.00007408169],"category_scores_gemma":[0.00067678635,0.00010020982,0.00009457166,0.0019277221,0.00014279566,0.00057939236,0.00012197786,0.0013818414,0.00026305832],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066382275,0.0007207816,0.0039192447,0.00008410973,0.000045870584,0.0026970173,0.0064749657,0.027635805,0.10903009,0.03759545,0.0014483101,0.8096845],"study_design_scores_gemma":[0.00027748715,0.0038376646,0.019532032,0.0013270507,0.000015002038,0.00093438104,0.0051591527,0.28020835,0.40486303,0.28133795,0.0015238853,0.0009840402],"about_ca_topic_score_codex":0.00042452913,"about_ca_topic_score_gemma":0.00007439489,"teacher_disagreement_score":0.8087005,"about_ca_system_score_codex":0.00020220892,"about_ca_system_score_gemma":0.00038540852,"threshold_uncertainty_score":0.6727492},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.21099807895705755,"score_gpt":0.4285933742557623,"score_spread":0.21759529529870478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575452963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015390288,0.0002397966,0.97746474,0.00298875,0.00037908982,0.00013344237,4.7991637e-7,0.00006162696,0.0033418173],"genre_scores_gemma":[0.9570758,0.0014399955,0.040601026,0.00013890241,0.00042861217,0.0000023088653,8.479052e-7,0.0000114901995,0.00030103655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752355,0.00034502527,0.0006872815,0.00019289057,0.0008900285,0.0003612088],"domain_scores_gemma":[0.99699485,0.00044339546,0.00021320119,0.0002744553,0.0018730855,0.00020098132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029899352,0.00009018095,0.00018921847,0.00073019904,0.00023261741,0.00037558185,0.0007112829,0.00007277869,0.0004856511],"category_scores_gemma":[0.0010103639,0.00007997937,0.00009865154,0.0018951597,0.00013448199,0.00070349494,0.000110247915,0.00058449595,0.00018712277],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008028609,0.00011126043,0.00066498655,0.000009885238,0.000031661002,0.00018071666,0.0010413295,0.0016971371,0.00857255,0.056208145,0.0013750789,0.93002695],"study_design_scores_gemma":[0.00018225302,0.00090019824,0.0029369476,0.0004223748,0.000015233005,0.0013874851,0.001960676,0.8437591,0.055555712,0.039902873,0.05244819,0.0005289305],"about_ca_topic_score_codex":0.000018131253,"about_ca_topic_score_gemma":0.0000133235235,"teacher_disagreement_score":0.9416855,"about_ca_system_score_codex":0.0001125705,"about_ca_system_score_gemma":0.0002509718,"threshold_uncertainty_score":0.5317539},"labels":[],"label_agreement":null},{"id":"W1584124733","doi":"10.1613/jair.3713","title":"Generating Approximate Solutions to the TTP using a Linear Distance Relaxation","year":2012,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Canadian Mathematical Society","keywords":"Tournament; Linear programming relaxation; Combinatorics; Mathematics; Linear programming; Schedule; Scheduling (production processes); Mathematical optimization; Modulo; Relaxation (psychology); Computer science; Discrete mathematics","score_opus":0.6328128500768635,"score_gpt":0.5480436522897456,"score_spread":0.08476919778711789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584124733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23519924,0.0007065097,0.7583492,0.0045198305,0.000902534,0.00015551042,0.0000044318535,0.000008678099,0.0001541036],"genre_scores_gemma":[0.94599986,0.000024743738,0.051627405,0.000075183205,0.0020258732,0.0000052520913,3.7733926e-7,0.000012020638,0.00022930946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938561,0.0010205818,0.0012722381,0.00021688649,0.002775335,0.00085887144],"domain_scores_gemma":[0.99332166,0.002503491,0.00045336768,0.0005052228,0.002850089,0.00036618917],"candidate_categories":["metaresearch","sts"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.041357085,0.00010740725,0.00023115368,0.0007156473,0.0016347825,0.00050355727,0.0010033132,0.00007672705,0.00013768373],"category_scores_gemma":[0.028210219,0.00006526514,0.00017529937,0.0032403106,0.00023508772,0.0006748062,0.00020778566,0.00083422684,0.0005240302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020729419,0.0005664155,0.0020497462,0.00000817432,0.00006966031,0.000010233125,0.0113099655,0.6774558,0.046523463,0.073685914,0.004684244,0.18342912],"study_design_scores_gemma":[0.000028648485,0.00016430498,0.00021573047,0.000085196996,0.000024118714,0.00009426683,0.010492075,0.93171835,0.015713567,0.029008066,0.012282667,0.00017301738],"about_ca_topic_score_codex":0.00006345896,"about_ca_topic_score_gemma":0.00006441302,"teacher_disagreement_score":0.7108006,"about_ca_system_score_codex":0.00018482315,"about_ca_system_score_gemma":0.00035595143,"threshold_uncertainty_score":0.99966496},"labels":[],"label_agreement":null},{"id":"W1621585639","doi":"10.1613/jair.740","title":"Partial-Order Planning with Concurrent Interacting Actions","year":2001,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":115,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia","keywords":"Planner; Computer science; Order (exchange); Plan (archaeology); Representation (politics); Task (project management); Action (physics); Simple (philosophy); Control (management); Distributed computing; Artificial intelligence; Engineering; Systems engineering; Economics","score_opus":0.328713626214809,"score_gpt":0.4722555756749504,"score_spread":0.14354194946014143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1621585639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0692778,0.00032118193,0.9258031,0.0024625892,0.00063981523,0.00009966575,5.015937e-7,0.000034749668,0.0013605729],"genre_scores_gemma":[0.9816054,0.000058138547,0.017715788,0.000039710456,0.0004472051,0.0000043592636,5.5444144e-7,0.000011802211,0.000117058284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971448,0.00034508144,0.00064916664,0.00025334567,0.0010001569,0.000607432],"domain_scores_gemma":[0.99646413,0.0014110873,0.0003203015,0.0002813433,0.0012755452,0.00024758416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034505748,0.00013575668,0.00022445135,0.0005457481,0.0005286296,0.0005403721,0.00092033064,0.00006662449,0.0000955862],"category_scores_gemma":[0.0008006478,0.000104250794,0.00007401509,0.0014345549,0.0001345827,0.00094391016,0.00014891702,0.0013620319,0.000080999765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039827861,0.0004778474,0.006557595,0.000039675753,0.0001503666,0.0014806936,0.011758571,0.09565782,0.0052089514,0.033391714,0.002105069,0.84277344],"study_design_scores_gemma":[0.00027272035,0.00441494,0.00042127827,0.0028431725,0.000040783172,0.003204652,0.0150249805,0.80771,0.08076125,0.014654701,0.06973782,0.00091372465],"about_ca_topic_score_codex":0.000056827517,"about_ca_topic_score_gemma":0.000015409576,"teacher_disagreement_score":0.9123276,"about_ca_system_score_codex":0.00011551314,"about_ca_system_score_gemma":0.0004463054,"threshold_uncertainty_score":0.59174263},"labels":[],"label_agreement":null},{"id":"W1640443237","doi":"10.1613/jair.4584","title":"Knowledge-Based Textual Inference via Parse-Tree Transformations","year":2015,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"FP7 Information and Communication Technologies; Azrieli Foundation; Bar-Ilan University","keywords":"Computer science; Inference; Natural language processing; Parsing; Artificial intelligence; Logical consequence; Formalism (music); Correctness; Parse tree; Natural language understanding; Natural language; Representation (politics); Tree structure; Algorithm; Programming language; Data structure","score_opus":0.23184268415197817,"score_gpt":0.46167685917493306,"score_spread":0.2298341750229549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1640443237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019286699,0.001578582,0.9926478,0.0021176212,0.0002271357,0.00014810839,0.0000011137926,0.000084610474,0.0012663357],"genre_scores_gemma":[0.79708815,0.000028054159,0.2026036,0.00003896151,0.00019209791,0.000006173845,6.090997e-7,0.000008346817,0.000034031378],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967845,0.00041213553,0.0007911394,0.00020942782,0.0013050066,0.0004978108],"domain_scores_gemma":[0.9949648,0.0006979855,0.00020951784,0.00039130394,0.0033563615,0.00038007798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052193925,0.00014133581,0.00023976938,0.00090242457,0.00020728087,0.0004663017,0.0021747523,0.00012292607,0.0000242394],"category_scores_gemma":[0.0017338292,0.000111536516,0.00011386261,0.001799568,0.00027108574,0.0013164019,0.00016976157,0.0010721221,0.00016656752],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007875401,0.00035583868,0.000044088218,0.000026550013,0.000011940027,0.00007248363,0.003454034,0.000559744,0.005217623,0.09080564,0.0019536049,0.8974197],"study_design_scores_gemma":[0.00007253546,0.0009829614,0.00000937296,0.00018609021,0.0000064444243,0.00008170562,0.0008764771,0.21857378,0.35402876,0.42292807,0.002023645,0.00023014258],"about_ca_topic_score_codex":0.00003429979,"about_ca_topic_score_gemma":0.0000897723,"teacher_disagreement_score":0.89718956,"about_ca_system_score_codex":0.00023162285,"about_ca_system_score_gemma":0.0015338188,"threshold_uncertainty_score":0.46578968},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.2081680926678031,"score_gpt":0.4142808458992752,"score_spread":0.20611275323147213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1662133657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2848188,0.000045416764,0.7103081,0.0034089766,0.0007623553,0.00009915532,0.0000013808251,0.000010538599,0.00054527906],"genre_scores_gemma":[0.7964733,0.00001941509,0.20288268,0.000020135138,0.00056685635,0.0000012773427,1.0966436e-7,0.000009334332,0.00002687202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99672973,0.00017505429,0.0008508869,0.00028729328,0.001499836,0.00045721856],"domain_scores_gemma":[0.99649984,0.0005914351,0.00024548845,0.00069533754,0.0016449082,0.00032298503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032138107,0.00011762819,0.0002966262,0.00054550584,0.000113518974,0.00020299212,0.002119904,0.00011402164,0.00007000169],"category_scores_gemma":[0.0012327847,0.00010254421,0.00012049781,0.0008725387,0.0001227681,0.0006347563,0.00037388105,0.0011591206,0.000059909034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032059317,0.00014076171,0.000088103334,0.000012683414,0.000026908378,0.000059582293,0.007730806,0.011192164,0.3854487,0.54414093,0.00014374185,0.050983585],"study_design_scores_gemma":[0.000016604916,0.00020943298,0.000017783768,0.00006690537,0.0000034951152,0.000014282604,0.00061882753,0.2786266,0.25475377,0.46549565,0.000083753584,0.00009292806],"about_ca_topic_score_codex":0.0005379259,"about_ca_topic_score_gemma":0.00019556486,"teacher_disagreement_score":0.5116545,"about_ca_system_score_codex":0.000060270366,"about_ca_system_score_gemma":0.00045171255,"threshold_uncertainty_score":0.5035867},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.1668487231968562,"score_gpt":0.44643649311013034,"score_spread":0.27958776991327416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1671111194","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57570577,0.00009521187,0.4215265,0.0012026853,0.0001225356,0.00016770027,0.0000043404966,0.000015110888,0.0011601585],"genre_scores_gemma":[0.9911216,0.00014547084,0.008364606,0.000059114147,0.00020303453,0.000010573206,0.0000029220587,0.000012582741,0.000080114165],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937662,0.000962874,0.00080278557,0.00050297525,0.0031946816,0.0007705062],"domain_scores_gemma":[0.9956915,0.001764792,0.00013432644,0.0004395239,0.0016835827,0.0002863118],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.006651617,0.00017030102,0.00028037766,0.001127413,0.00037305738,0.0005598485,0.0014590259,0.00017947904,0.00054913666],"category_scores_gemma":[0.0004475158,0.00013924745,0.00007287013,0.0021634025,0.00041841302,0.000999813,0.00010092874,0.002617645,0.00047420344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001243748,0.0010191178,0.0004532689,0.000015911848,0.00004254877,0.0007180388,0.004836504,0.08805917,0.00999901,0.32053548,0.00066344615,0.57241374],"study_design_scores_gemma":[0.00013232011,0.001646719,0.0014452523,0.00044302116,0.0000031743573,0.000082709645,0.00053807686,0.17160276,0.037418615,0.7863653,0.00007726482,0.00024484063],"about_ca_topic_score_codex":0.0008060032,"about_ca_topic_score_gemma":0.0004971211,"teacher_disagreement_score":0.57216895,"about_ca_system_score_codex":0.000277254,"about_ca_system_score_gemma":0.001080429,"threshold_uncertainty_score":0.9996834},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.2748869913500262,"score_gpt":0.396747064427609,"score_spread":0.12186007307758279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1799762961","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010750928,0.00022188597,0.98530376,0.0010879447,0.0003047289,0.00018035188,2.653346e-7,0.00003623838,0.0021139227],"genre_scores_gemma":[0.9750773,0.00014242255,0.02402497,0.000021920625,0.00011555934,0.0000027616304,9.130298e-7,0.000014361459,0.00059983577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99458545,0.0005479954,0.0017414482,0.00023876896,0.002137171,0.00074917276],"domain_scores_gemma":[0.9959714,0.0010673987,0.00076004304,0.0004041972,0.0015740006,0.00022296912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005513628,0.00015821347,0.0003574942,0.0006347562,0.00064905774,0.0006008826,0.0015324506,0.00010353777,0.00028639458],"category_scores_gemma":[0.0019822696,0.0001477241,0.00016959048,0.0012061176,0.0003029009,0.0009707657,0.00048619506,0.0013404291,0.00011760809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018447217,0.00015224972,0.00008921423,0.000054812223,0.000065592256,0.000026360376,0.0028752813,0.840547,0.073575184,0.035861198,0.0018617394,0.04487291],"study_design_scores_gemma":[0.000047974256,0.0006240203,0.000015838537,0.00018827942,0.000008033384,0.000038728158,0.0006874988,0.94608265,0.050352473,0.0014668049,0.00035904907,0.0001286611],"about_ca_topic_score_codex":0.00003391218,"about_ca_topic_score_gemma":0.0000018600249,"teacher_disagreement_score":0.9643263,"about_ca_system_score_codex":0.00020241906,"about_ca_system_score_gemma":0.00013934674,"threshold_uncertainty_score":0.6024014},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.25418857368125086,"score_gpt":0.4324161648659641,"score_spread":0.17822759118471326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097113539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007117496,0.00010141247,0.98067695,0.0005295918,0.00044074922,0.0001755816,4.1658787e-8,0.00002476661,0.010933403],"genre_scores_gemma":[0.9279053,0.00015945954,0.071227595,0.000058206067,0.00018186531,0.000004634013,5.2587745e-7,0.000014943611,0.00044743367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954541,0.00067831064,0.0011706825,0.00025708045,0.001750634,0.0006891928],"domain_scores_gemma":[0.9964403,0.00091068936,0.00052192976,0.00036312515,0.0016039745,0.00015999562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063111703,0.00015364416,0.0002507791,0.00044312954,0.0005890947,0.0007183951,0.0011119016,0.000095398,0.0001312823],"category_scores_gemma":[0.0037495503,0.00013679282,0.00013677683,0.0012795978,0.00012245461,0.0015018588,0.00019080279,0.0013969052,0.0001742293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013584984,0.000027925622,0.00009031263,0.000012111173,0.000021879088,0.000023482815,0.0025490578,0.7210429,0.0060994555,0.24787572,0.00011911896,0.022124454],"study_design_scores_gemma":[0.00009995599,0.001855639,0.000045278695,0.00016541872,0.000009800402,0.00014024976,0.006143613,0.7771646,0.15092716,0.056452412,0.006663742,0.0003321527],"about_ca_topic_score_codex":0.000026208209,"about_ca_topic_score_gemma":0.0000023467896,"teacher_disagreement_score":0.9207879,"about_ca_system_score_codex":0.00025324826,"about_ca_system_score_gemma":0.00041100124,"threshold_uncertainty_score":0.69275004},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.6119528539313067,"score_gpt":0.5618701263001141,"score_spread":0.05008272763119259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106654973","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82075435,0.00007910196,0.17586012,0.0018359348,0.0001489737,0.00018720597,0.0000044037183,0.000005992442,0.0011239118],"genre_scores_gemma":[0.99318266,0.000051557843,0.006282405,0.000024056224,0.00015902311,0.000004403933,3.0161476e-7,0.000008408841,0.00028716322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948995,0.00038994834,0.001304595,0.0002487678,0.0028371047,0.00032006577],"domain_scores_gemma":[0.99410695,0.0013771143,0.00062516954,0.00048400043,0.003173794,0.00023299818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009205993,0.000096827025,0.00028085537,0.0007072411,0.0002328371,0.00015165977,0.0012150274,0.00006500991,0.00061039464],"category_scores_gemma":[0.003922108,0.00006224961,0.00013991633,0.0023608943,0.0007551798,0.00042650377,0.00012670837,0.0004857926,0.00034329863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022769303,0.0019753124,0.0009811745,0.000023614582,0.00012122767,0.00015489865,0.007390438,0.037663516,0.11916332,0.45274287,0.00087431533,0.37663236],"study_design_scores_gemma":[0.00010071881,0.0009889748,0.000703779,0.00011509894,0.000010288128,0.000095986776,0.012040853,0.0017992397,0.33853206,0.64337516,0.0021236765,0.000114134],"about_ca_topic_score_codex":0.000030198124,"about_ca_topic_score_gemma":0.000025120817,"teacher_disagreement_score":0.37651825,"about_ca_system_score_codex":0.0000894465,"about_ca_system_score_gemma":0.00040867395,"threshold_uncertainty_score":0.6683393},"labels":[],"label_agreement":null},{"id":"W2109015525","doi":"10.1613/jair.2155","title":"Consistency and Random Constraint Satisfaction Models","year":2007,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Backtracking; Constraint satisfaction problem; Local consistency; Constraint satisfaction; Constraint satisfaction dual problem; Constraint learning; Computer science; Constraint (computer-aided design); Consistency (knowledge bases); Robustness (evolution); Theoretical computer science; Mathematical optimization; Algorithm; Mathematics; Artificial intelligence","score_opus":0.14172274926718278,"score_gpt":0.3914333672345828,"score_spread":0.2497106179674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109015525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036594756,0.00019453163,0.9597119,0.0011395141,0.0003680653,0.00014310417,6.158327e-7,0.000018251832,0.0018292657],"genre_scores_gemma":[0.96080273,0.0003378758,0.03868393,0.000040708786,0.000110650995,8.8145543e-7,1.492704e-7,0.0000047993976,0.000018277959],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777275,0.00019445704,0.000749132,0.00018536356,0.000764938,0.00033332966],"domain_scores_gemma":[0.9973785,0.0008800818,0.00020955926,0.00017650171,0.0011253587,0.00022997452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006257093,0.00009117843,0.00019068585,0.0006379364,0.0002611245,0.00026050306,0.0002569686,0.000082599494,0.00006825866],"category_scores_gemma":[0.0005316299,0.000079627695,0.00007362041,0.0006024985,0.0003864942,0.0008558912,0.00007971521,0.0005189006,0.000015425772],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008940301,0.000029506105,0.0003658843,0.0000061926794,0.00001522924,0.000044017623,0.00073001895,0.0015941666,0.0025942673,0.22520171,0.000041695046,0.7692879],"study_design_scores_gemma":[0.00043669876,0.00079893915,0.0051271836,0.00016432535,0.000017755217,0.0015744552,0.007080268,0.44330996,0.037830606,0.50286156,0.00040973234,0.0003884789],"about_ca_topic_score_codex":0.000051973435,"about_ca_topic_score_gemma":0.00013628876,"teacher_disagreement_score":0.924208,"about_ca_system_score_codex":0.00009803104,"about_ca_system_score_gemma":0.00028615573,"threshold_uncertainty_score":0.3247123},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.12490418339223444,"score_gpt":0.40555843590576174,"score_spread":0.28065425251352727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110504071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030798414,0.0005467168,0.9878349,0.007297743,0.0003977502,0.00041221894,0.0000031493662,0.000019879253,0.0004078431],"genre_scores_gemma":[0.9197697,0.00017487096,0.07928893,0.00005652166,0.00048110916,0.000024051136,7.530057e-7,0.000016140197,0.00018790111],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99655145,0.00033049827,0.00078892667,0.00027564922,0.001325693,0.000727761],"domain_scores_gemma":[0.9954527,0.002152234,0.00015182978,0.0004697648,0.0016445179,0.00012897048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007878719,0.0001306616,0.00021895996,0.00048565754,0.0006953015,0.00054044515,0.0025247142,0.00009008148,0.00003243525],"category_scores_gemma":[0.00014091814,0.00008793006,0.0002500847,0.0013386625,0.0006735318,0.00042846,0.00035989098,0.0010481116,0.000044644945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007634742,0.0001923622,0.000015726719,0.00002262247,0.000021849253,0.00003178425,0.0002881316,0.010313403,0.0010380291,0.41806814,0.0006457413,0.56928587],"study_design_scores_gemma":[0.000034588742,0.0004752713,0.00006508361,0.000041402218,0.0000037712925,0.00008445493,0.0006368437,0.39956483,0.0143422205,0.58102304,0.003634352,0.00009412937],"about_ca_topic_score_codex":0.00024413275,"about_ca_topic_score_gemma":0.00023485618,"teacher_disagreement_score":0.9166899,"about_ca_system_score_codex":0.00016175353,"about_ca_system_score_gemma":0.00048800316,"threshold_uncertainty_score":0.53477675},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.1885125475786514,"score_gpt":0.45591062523435766,"score_spread":0.2673980776557062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110962519","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033465056,0.00009638862,0.99307233,0.0020062057,0.00036743892,0.00034816022,0.0000057986017,0.000039763738,0.00071739766],"genre_scores_gemma":[0.23950051,0.00000727614,0.759962,0.00003922695,0.00037536453,0.0000215573,0.0000015578912,0.000010886651,0.00008159452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695176,0.00039887056,0.0008784746,0.00023000987,0.0009783874,0.000562512],"domain_scores_gemma":[0.99627715,0.0008265962,0.00031754895,0.00045794866,0.0019950923,0.00012564172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010025819,0.000107738495,0.0002007795,0.00073429337,0.00037903414,0.00034905318,0.0013505138,0.00009502768,0.000038731843],"category_scores_gemma":[0.0013640514,0.00009495563,0.00016973107,0.0012151876,0.00009486289,0.00087940606,0.00010097758,0.0004656592,0.00007607314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069037014,0.00058244314,0.000030912044,0.000039937746,0.000011385451,0.000008223577,0.00029339248,0.0015538237,0.010675318,0.9419853,0.001503923,0.043246273],"study_design_scores_gemma":[0.00006332541,0.00044503048,0.00007544181,0.00003362273,0.0000041887115,0.000019136934,0.00022025699,0.56452304,0.22435997,0.20398463,0.0061606304,0.00011074648],"about_ca_topic_score_codex":0.000018866613,"about_ca_topic_score_gemma":0.000010408176,"teacher_disagreement_score":0.7380007,"about_ca_system_score_codex":0.00018691526,"about_ca_system_score_gemma":0.000454759,"threshold_uncertainty_score":0.3872178},"labels":[],"label_agreement":null},{"id":"W2114562718","doi":"10.1613/jair.2784","title":"Complex Question Answering: Unsupervised Learning Approaches and Experiments","year":2009,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Topic Modeling","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Lethbridge","keywords":"Automatic summarization; Set (abstract data type); Tree kernel; Weighting; Relevance (law); Unsupervised learning; ENCODE; Kernel (algebra); Feature (linguistics)","score_opus":0.4485195580979168,"score_gpt":0.4474377941188779,"score_spread":0.0010817639790389189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114562718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2151801,0.0003884833,0.7817964,0.0019360421,0.00010077084,0.000091906986,6.573642e-8,0.000021665284,0.00048459356],"genre_scores_gemma":[0.9527923,0.00009432474,0.046859175,0.00002878244,0.00018812426,0.0000011052115,1.9156298e-7,0.0000046323157,0.000031387648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778503,0.00035356404,0.000498074,0.00023124258,0.0007809822,0.0003510946],"domain_scores_gemma":[0.9989751,0.00015767588,0.00011752127,0.00020948533,0.00036486558,0.000175379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031178656,0.000094545714,0.000179608,0.00036611297,0.00024743116,0.00035985754,0.0006569347,0.000060045742,0.000015652984],"category_scores_gemma":[0.0003324164,0.0000834112,0.000050802493,0.0004223457,0.00009291626,0.0005909434,0.00013110401,0.00062770385,0.000011758468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044465065,0.00013736467,0.00021157843,0.0000097293005,0.00001085481,0.000039726878,0.0038190642,0.007575038,0.038812675,0.08616489,0.000025420857,0.86314917],"study_design_scores_gemma":[0.0000521817,0.00085371005,0.0008585846,0.0000868584,0.000002642957,0.00008885657,0.0023438085,0.8930392,0.05097654,0.051134244,0.0004143214,0.00014901171],"about_ca_topic_score_codex":0.000019755362,"about_ca_topic_score_gemma":0.0000020648215,"teacher_disagreement_score":0.8854642,"about_ca_system_score_codex":0.00007564771,"about_ca_system_score_gemma":0.00009456297,"threshold_uncertainty_score":0.34701145},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.27703538248797327,"score_gpt":0.46008915325875227,"score_spread":0.183053770770779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114660707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23442087,0.00013031298,0.76401544,0.0010073691,0.00015548068,0.00017677451,0.0000051725474,0.0000159536,0.00007263399],"genre_scores_gemma":[0.8903816,0.00013856895,0.10921528,0.000045195,0.00016309565,0.000017880633,0.0000014754071,0.000009336969,0.000027594851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99716645,0.00016303943,0.0007992837,0.00036965797,0.00093619653,0.00056534016],"domain_scores_gemma":[0.9974142,0.00042072512,0.0002883056,0.00029257158,0.0013839497,0.00020025644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00383516,0.00013634801,0.0002368212,0.00032297766,0.00041105345,0.00065948174,0.00081621343,0.00008096778,0.000016182996],"category_scores_gemma":[0.0010127912,0.000119691955,0.00008193379,0.00047955394,0.00019313979,0.0012265911,0.00025681875,0.0005548393,0.0000134148595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043024032,0.000523226,0.0012674264,0.00013775419,0.0001516398,0.00013711787,0.0062937476,0.011982021,0.028841775,0.51742625,0.0005035965,0.4323052],"study_design_scores_gemma":[0.00025701168,0.0013412213,0.00071506534,0.0007829584,0.00001469052,0.00023339086,0.0011298925,0.09030212,0.07790895,0.82659966,0.0003459183,0.00036914257],"about_ca_topic_score_codex":0.000096197604,"about_ca_topic_score_gemma":0.000019348367,"teacher_disagreement_score":0.6559607,"about_ca_system_score_codex":0.00011846755,"about_ca_system_score_gemma":0.00048108023,"threshold_uncertainty_score":0.6359397},"labels":[],"label_agreement":null},{"id":"W2116816400","doi":"10.1613/jair.3132","title":"Iterated Belief Change Due to Actions and Observations","year":2011,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; British Columbia Institute of Technology","funders":"","keywords":"Belief revision; Iterated function; Rationality; Action (physics); Computer science; Set (abstract data type); Class (philosophy); Artificial intelligence; Epistemology; Cognitive psychology; Psychology; Mathematics","score_opus":0.6200459931118603,"score_gpt":0.4382108662719989,"score_spread":0.18183512683986136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116816400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31754774,0.00064095086,0.66829336,0.0057736137,0.0012567877,0.00050225895,0.0000034846998,0.000058927766,0.0059228633],"genre_scores_gemma":[0.97849727,0.00015279803,0.02057031,0.00012051467,0.0004163936,0.00001516229,2.6992117e-7,0.000007950145,0.00021936286],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823993,0.0002120937,0.0004321823,0.00021370208,0.0005000065,0.0004020547],"domain_scores_gemma":[0.997534,0.0002624381,0.00010948041,0.00027292458,0.0014697696,0.00035141423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020796128,0.00009520058,0.0001790149,0.0005780816,0.00036774107,0.00026387261,0.0008145066,0.00007287472,0.00008392804],"category_scores_gemma":[0.0007578477,0.00007701985,0.00006131023,0.0014482389,0.00011725938,0.0008580612,0.00027126676,0.0004975382,0.0001581478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087958484,0.0006015333,0.0015866463,0.00002086711,0.00004722409,0.0002542654,0.038814846,0.000016759977,0.007872105,0.43099564,0.0015165797,0.51818556],"study_design_scores_gemma":[0.0002462029,0.00799401,0.11088212,0.0007028527,0.00004892881,0.0014548715,0.010378225,0.056499463,0.24365874,0.52439487,0.04241305,0.0013266631],"about_ca_topic_score_codex":0.0001668603,"about_ca_topic_score_gemma":0.00016999367,"teacher_disagreement_score":0.66094947,"about_ca_system_score_codex":0.00006985158,"about_ca_system_score_gemma":0.00016946605,"threshold_uncertainty_score":0.31407785},"labels":[],"label_agreement":null},{"id":"W2118182253","doi":"10.1613/jair.1081","title":"An Analysis of Phase Transition in NK Landscapes","year":2002,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Infinity; Phase transition; Mathematics; Upper and lower bounds; Polynomial; Perspective (graphical); Phase (matter); Discrete mathematics; Applied mathematics; Statistical physics; Mathematical analysis; Physics; Quantum mechanics","score_opus":0.17904413690257273,"score_gpt":0.4374027383675618,"score_spread":0.2583586014649891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118182253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36789516,0.0001535243,0.6307313,0.00081807055,0.00008579144,0.0000729137,0.0000047728045,0.0000064998712,0.00023199721],"genre_scores_gemma":[0.9946961,0.00030545914,0.004882023,0.000013585976,0.00008235592,0.0000011059344,0.0000021834671,0.0000030203175,0.000014185424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784774,0.00026084762,0.00062340643,0.00017116377,0.0008346224,0.0002622205],"domain_scores_gemma":[0.9989027,0.00016112832,0.0001433905,0.0003093814,0.0003817202,0.00010172091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031845674,0.00006538859,0.00024378332,0.002176675,0.000058444013,0.00018444614,0.0010705397,0.00003638712,0.00023363215],"category_scores_gemma":[0.00009533515,0.000055523087,0.0001164256,0.0035038132,0.00006591741,0.001241225,0.000055673117,0.0002845232,0.000018794037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072866984,0.002042434,0.00023311355,0.000020011455,0.000170831,0.000179679,0.004653929,0.012880138,0.007145782,0.016496625,0.00016954071,0.95593506],"study_design_scores_gemma":[0.000062162006,0.00062543445,0.00016758282,0.000025305184,0.000029727353,0.000002900304,0.0009686927,0.983364,0.010905213,0.0036609087,0.00012636131,0.00006172347],"about_ca_topic_score_codex":0.000060735867,"about_ca_topic_score_gemma":0.00012760649,"teacher_disagreement_score":0.97048384,"about_ca_system_score_codex":0.000037152317,"about_ca_system_score_gemma":0.00002500502,"threshold_uncertainty_score":0.25581083},"labels":[],"label_agreement":null},{"id":"W2118191986","doi":"10.1613/jair.1336","title":"Can We Learn to Beat the Best Stock","year":2004,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Algorithmic trading; Technical analysis; Computer science; Smoothing; Heuristics; Stock market; Trading strategy; Stock (firearms); Pairs trade; Econometrics; Financial economics; Empirical evidence; Artificial intelligence; Machine learning; Context (archaeology); Alternative trading system; Economics; Engineering","score_opus":0.5013709025139251,"score_gpt":0.568274054729651,"score_spread":0.06690315221572585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118191986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2256978,0.001332546,0.56125647,0.20731694,0.0015936197,0.0013301832,0.000023453456,0.000023880799,0.001425104],"genre_scores_gemma":[0.99245304,0.0003717598,0.003152168,0.00013411755,0.0012819063,0.000015835958,2.644654e-7,0.000030695664,0.0025602127],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98703885,0.00094015035,0.0016017351,0.000484795,0.008697879,0.0012365903],"domain_scores_gemma":[0.9877302,0.0046388907,0.0003149854,0.00093189755,0.0056037116,0.0007803313],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.022845417,0.00019123113,0.00043293167,0.0016793563,0.0009313023,0.0010194455,0.0038770356,0.000119167154,0.00064518733],"category_scores_gemma":[0.025727868,0.00010809508,0.00026195083,0.0050280783,0.0008713827,0.0005192182,0.00064293324,0.0021781733,0.0030085999],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003442689,0.00027990944,0.000104056526,0.0000039761135,0.000028227825,0.00024239713,0.0037687013,0.06719098,0.0043716,0.0039255526,0.0017367855,0.91800356],"study_design_scores_gemma":[0.00010550207,0.0022657774,0.00013625062,0.00015058009,0.000007933061,0.0001945965,0.041566625,0.002492883,0.090108044,0.8273155,0.035401475,0.00025479996],"about_ca_topic_score_codex":0.00027729786,"about_ca_topic_score_gemma":0.0010247068,"teacher_disagreement_score":0.91774875,"about_ca_system_score_codex":0.00061399414,"about_ca_system_score_gemma":0.0014006689,"threshold_uncertainty_score":0.9977677},"labels":[],"label_agreement":null},{"id":"W2121605956","doi":"10.1613/jair.4278","title":"Integrating Queueing Theory and Scheduling for Dynamic Scheduling Problems","year":2014,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Queueing theory; Computer science; Scheduling (production processes); Mathematical optimization; Layered queueing network; Dynamic priority scheduling; Schedule; Distributed computing; Mathematics; Computer network","score_opus":0.06363703394117042,"score_gpt":0.36788600686330775,"score_spread":0.3042489729221373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121605956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14278598,0.00092850096,0.85537,0.00016756769,0.00037423256,0.00016755768,9.815507e-7,0.00004726044,0.0001579281],"genre_scores_gemma":[0.72141594,0.00022703597,0.27794954,0.00001056336,0.0003331892,0.0000087004755,9.251071e-7,0.00003583153,0.000018238685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979596,0.00024530667,0.0007386039,0.00017327651,0.0004315979,0.0004516161],"domain_scores_gemma":[0.99696016,0.0017796265,0.00012108802,0.0001418948,0.0008206675,0.0001765877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009382523,0.00014778996,0.00026894978,0.00051519636,0.00028626688,0.000276302,0.00027946546,0.00012070905,0.000020336449],"category_scores_gemma":[0.0036168578,0.00013000185,0.000093467126,0.0004527305,0.00014528037,0.00028328615,0.000043184224,0.00083957566,0.000009567536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005757514,0.000025371843,0.000027814633,0.00012878896,0.000041199914,0.0000020006298,0.001249121,0.6619287,0.01289427,0.026976677,0.000003160494,0.2966653],"study_design_scores_gemma":[0.00005169657,0.00017551241,0.0000041107,0.00033554784,0.000010681107,0.000023076853,0.0039082584,0.9286614,0.015717182,0.050907776,0.00007390278,0.00013084688],"about_ca_topic_score_codex":0.000004884969,"about_ca_topic_score_gemma":0.000013596618,"teacher_disagreement_score":0.57863,"about_ca_system_score_codex":0.00009743746,"about_ca_system_score_gemma":0.00007400612,"threshold_uncertainty_score":0.5301322},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Computer science; Heuristic; Scalability; Completeness (order theory); Function (biology); Convergence (economics); Control (management); Machine learning; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.17793919854438428,"score_gpt":0.42330659136146825,"score_spread":0.24536739281708397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122128939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16853705,0.00017760125,0.8265545,0.0018919406,0.00030922913,0.00016593572,3.6334944e-7,0.00006204361,0.0023013854],"genre_scores_gemma":[0.7215489,0.0001218905,0.27737537,0.000012580816,0.00059039675,0.0000028710733,4.874795e-7,0.000019383426,0.00032809746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99495184,0.0010366383,0.0009982968,0.00032788605,0.0017819877,0.00090335077],"domain_scores_gemma":[0.9962087,0.002142813,0.00021736814,0.0003776048,0.0008606186,0.00019284368],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.010336234,0.00014553046,0.0003328918,0.0013748626,0.00027054088,0.00046471282,0.0016548983,0.00016042677,0.00004245384],"category_scores_gemma":[0.0016492428,0.00013365805,0.000109336244,0.0026883313,0.00020704388,0.000637517,0.00032880635,0.0024273915,0.00031236085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013884786,0.0006022715,0.004509574,0.000048116155,0.000032214342,0.0031356805,0.006673924,0.50331444,0.03425399,0.10318595,0.00047098318,0.343634],"study_design_scores_gemma":[0.000059300935,0.000882573,0.0023488475,0.0006409806,0.0000032386959,0.0002218366,0.0015832857,0.8166136,0.023772722,0.15338787,0.00020195176,0.00028379515],"about_ca_topic_score_codex":0.0005258476,"about_ca_topic_score_gemma":0.000009373973,"teacher_disagreement_score":0.5530119,"about_ca_system_score_codex":0.0002888864,"about_ca_system_score_gemma":0.000558878,"threshold_uncertainty_score":0.99987406},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.1420727133656529,"score_gpt":0.4191170462261772,"score_spread":0.2770443328605243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124464337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46884462,0.00038283583,0.524943,0.0029919583,0.0005820617,0.00048045343,0.0000032611777,0.00006395473,0.0017078331],"genre_scores_gemma":[0.98633516,0.0010327651,0.012005683,0.000053139236,0.00020794028,0.000009409006,4.299676e-7,0.000027344831,0.00032815692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926937,0.0012165098,0.0018294529,0.00052960205,0.0024748072,0.0012558791],"domain_scores_gemma":[0.9938601,0.0025368484,0.0003009083,0.00078841107,0.002086584,0.00042709906],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.008394702,0.00025224808,0.00061148906,0.0018842344,0.00041161026,0.0002644245,0.0030966254,0.00019252545,0.00022214456],"category_scores_gemma":[0.0019545753,0.00022709132,0.00023675503,0.0028235223,0.00093176536,0.0010646397,0.00035680676,0.0017039189,0.0013903083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014384552,0.0031397492,0.005352716,0.00010556764,0.00019189842,0.011930089,0.021925736,0.05135221,0.23571606,0.10561403,0.002671516,0.56056195],"study_design_scores_gemma":[0.0001171733,0.0015462812,0.0015406313,0.00022246345,0.0000076214715,0.0009356251,0.0015841927,0.85202724,0.057031523,0.08409059,0.00041010324,0.0004865841],"about_ca_topic_score_codex":0.00037828466,"about_ca_topic_score_gemma":0.00010782734,"teacher_disagreement_score":0.800675,"about_ca_system_score_codex":0.0005282728,"about_ca_system_score_gemma":0.0011757552,"threshold_uncertainty_score":0.9993872},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.2839496994906822,"score_gpt":0.524008033142466,"score_spread":0.2400583336517838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125592902","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91874206,0.00031259173,0.07779205,0.0028402314,0.000049982194,0.00016873509,0.0000044503163,0.00004600145,0.000043903616],"genre_scores_gemma":[0.9709637,0.00032377528,0.028138937,0.000026018397,0.0004920706,0.0000030749038,0.000006676139,0.000009830418,0.000035930138],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658436,0.0011041767,0.000601707,0.00049725437,0.0008395939,0.00037291404],"domain_scores_gemma":[0.9976065,0.00076932,0.00021226912,0.00069767324,0.00046347498,0.00025074268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008206872,0.00012146596,0.0002443503,0.00024695942,0.00052514434,0.0008792608,0.0013967603,0.00008331259,0.000013393298],"category_scores_gemma":[0.0011297979,0.00009840656,0.000019660507,0.000552252,0.00021457131,0.0016913981,0.0009282492,0.0012439161,0.000015334941],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000959222,0.00047899576,0.017674217,0.000004650558,0.00002506583,0.000057716825,0.007070971,0.000048683978,0.004432799,0.0008270133,0.00009016633,0.9691938],"study_design_scores_gemma":[0.00058389746,0.009978671,0.038079116,0.00018106551,0.000046471272,0.00040188912,0.03539537,0.828493,0.027718116,0.016828086,0.041469652,0.0008246821],"about_ca_topic_score_codex":0.00021818209,"about_ca_topic_score_gemma":0.0003532617,"teacher_disagreement_score":0.9683691,"about_ca_system_score_codex":0.00005180987,"about_ca_system_score_gemma":0.00012434376,"threshold_uncertainty_score":0.8478733},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.2050300271260984,"score_gpt":0.43022691183994627,"score_spread":0.22519688471384786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125990606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09277709,0.00035362935,0.90517724,0.00024606698,0.000798632,0.00026202784,0.0000045611114,0.000045276676,0.00033550078],"genre_scores_gemma":[0.637368,0.00012658536,0.36175007,0.0000097569055,0.00066625915,0.000004588907,0.0000011987231,0.000032820615,0.000040691408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973146,0.000096276584,0.0009699153,0.0001539241,0.00073750335,0.0007278101],"domain_scores_gemma":[0.9959591,0.0009765931,0.000087702276,0.00017291636,0.0025031837,0.00030047275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007815317,0.00014532602,0.00026685058,0.00082913344,0.0002971517,0.00014956042,0.0003747689,0.0001572274,0.00009114465],"category_scores_gemma":[0.0011737293,0.00013770502,0.00016687695,0.00081753056,0.00027586677,0.00027287332,0.00004714272,0.0009425461,0.00005311254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003004738,0.00015873168,0.00034619874,0.00010054067,0.00016913442,0.000048328024,0.0032636777,0.76832104,0.039097928,0.0084909,0.0001973918,0.17950565],"study_design_scores_gemma":[0.00011092907,0.00015153279,0.000036062032,0.00008690978,0.000009077538,0.000070936105,0.009176262,0.7806533,0.20795202,0.0015640312,0.000045060428,0.00014387094],"about_ca_topic_score_codex":0.000015916867,"about_ca_topic_score_gemma":0.000022221078,"teacher_disagreement_score":0.54459095,"about_ca_system_score_codex":0.00030209386,"about_ca_system_score_gemma":0.00022566614,"threshold_uncertainty_score":0.5615448},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.1732412730920352,"score_gpt":0.39043277194387965,"score_spread":0.21719149885184447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127002961","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3312164,0.0008811761,0.66461563,0.002808715,0.00011396835,0.00006415195,7.227195e-7,0.0000066350235,0.0002925921],"genre_scores_gemma":[0.95745647,0.00019273156,0.042186875,0.00001504003,0.000096214244,0.0000015609693,1.138522e-7,0.0000035583334,0.00004745918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985298,0.00018105678,0.000410207,0.00011262039,0.0004827359,0.00028357527],"domain_scores_gemma":[0.99846655,0.00059207965,0.00013933584,0.00018262699,0.00046244528,0.00015695294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002317841,0.000069511094,0.00017647189,0.00036089437,0.00024079005,0.000100917474,0.00021564259,0.000058817182,0.000010969704],"category_scores_gemma":[0.00018578683,0.00005656168,0.00004469289,0.0004381022,0.00032712566,0.00068482925,0.00017463119,0.00033268696,0.00000956831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007092163,0.0002522396,0.0026562903,0.00003558589,0.000041992036,0.000010829958,0.0058943564,0.001538222,0.02965,0.93909484,0.0005967948,0.020157948],"study_design_scores_gemma":[0.00010800958,0.0007626217,0.005962556,0.00019008011,0.00003814804,0.0004700569,0.0073215286,0.3613928,0.028014025,0.5950256,0.000491617,0.00022293115],"about_ca_topic_score_codex":0.000022875454,"about_ca_topic_score_gemma":0.000015836611,"teacher_disagreement_score":0.6262401,"about_ca_system_score_codex":0.000026653535,"about_ca_system_score_gemma":0.00011208017,"threshold_uncertainty_score":0.23065183},"labels":[],"label_agreement":null},{"id":"W2128419582","doi":"10.1613/jair.4360","title":"Optimal Scheduling of Contract Algorithms for Anytime Problem-Solving","year":2014,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Computer science; Dynamic programming; Schedule; Mathematical optimization; Computation; Acceleration; Scheduling (production processes); Conjecture; Matching (statistics); Algorithm; Class (philosophy); Job shop scheduling; Mathematics; Discrete mathematics","score_opus":0.16732274216625714,"score_gpt":0.4248170278948427,"score_spread":0.25749428572858557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128419582","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008919497,0.00013035488,0.98844737,0.0014430837,0.00020563042,0.00035316177,0.0000015625865,0.000015621608,0.00048371794],"genre_scores_gemma":[0.47749558,0.00007257335,0.5221122,0.000022542257,0.00023237447,0.0000059430135,4.2597026e-7,0.000010628531,0.000047742815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658275,0.00039140868,0.0010450083,0.0002484485,0.0011422739,0.00059012225],"domain_scores_gemma":[0.9942555,0.0014945632,0.00040016606,0.00030846297,0.0032919357,0.00024936488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011183342,0.00011721062,0.00033577814,0.00061727705,0.00024607708,0.0003285653,0.0013465642,0.000095487994,0.000051600215],"category_scores_gemma":[0.0021183991,0.00009762182,0.00017698035,0.00084028166,0.00021437445,0.0007761155,0.00019438445,0.0005977102,0.000019851772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001787214,0.00046001447,0.000080295686,0.00011766212,0.00006964593,0.000010921738,0.002680016,0.25307906,0.030629601,0.17229244,0.00019680326,0.5402048],"study_design_scores_gemma":[0.00008729207,0.001091472,0.000018275701,0.00012975374,0.0000037833863,0.000020662814,0.00029175964,0.9135448,0.060250655,0.023869814,0.0005899808,0.00010177958],"about_ca_topic_score_codex":0.000021285703,"about_ca_topic_score_gemma":0.000004366805,"teacher_disagreement_score":0.6604657,"about_ca_system_score_codex":0.000069911584,"about_ca_system_score_gemma":0.00044262956,"threshold_uncertainty_score":0.39809024},"labels":[],"label_agreement":null},{"id":"W2130058925","doi":"10.1613/jair.3902","title":"Scheduling a Dynamic Aircraft Repair Shop with Limited Repair Resources","year":2013,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Schedule; Time horizon; Computer science; Scheduling (production processes); Integer programming; Job shop scheduling; Operations research; Dynamic programming; Mathematical optimization; Dynamic priority scheduling; Reliability engineering; Engineering; Mathematics; Algorithm","score_opus":0.043717456545048716,"score_gpt":0.3167900718857077,"score_spread":0.27307261534065896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130058925","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8570408,0.00061824545,0.13952556,0.0008637397,0.00024490873,0.00042575147,0.0000012235474,0.00027420826,0.0010055332],"genre_scores_gemma":[0.95661974,0.00068618375,0.042258095,0.000017363334,0.0001949151,0.000019506728,0.0000011610996,0.000042623215,0.00016043666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973871,0.0001782654,0.0008059663,0.00021379066,0.00084311434,0.00057175837],"domain_scores_gemma":[0.9973328,0.0003862115,0.00010686007,0.00034852634,0.0016010806,0.00022450827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023642897,0.000163713,0.00028460484,0.0005547957,0.00017951705,0.00017368601,0.00034522393,0.00013861571,0.0002349566],"category_scores_gemma":[0.0009449335,0.0001254387,0.000187992,0.0010497511,0.0002819896,0.00061952934,0.000052381372,0.0010249843,0.00014572086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023082753,0.00016441192,0.0004863147,0.00016803184,0.00014559069,0.000073420895,0.0017328871,0.95175976,0.009066059,0.00069948204,0.0010005605,0.03447266],"study_design_scores_gemma":[0.00004492039,0.0005709305,0.00027988452,0.00032826586,0.0000147186975,0.00006504368,0.0047340225,0.98364794,0.005368827,0.0038831802,0.00088244217,0.00017980924],"about_ca_topic_score_codex":0.00005781938,"about_ca_topic_score_gemma":0.000068678055,"teacher_disagreement_score":0.09957889,"about_ca_system_score_codex":0.00024929387,"about_ca_system_score_gemma":0.00011228785,"threshold_uncertainty_score":0.5115242},"labels":[],"label_agreement":null},{"id":"W2131529421","doi":"10.1613/jair.2808","title":"Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem","year":2009,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Satisfiability; Interpretation (philosophy); Cover (algebra); Combinatorics; Mathematics; Set (abstract data type); Maximum satisfiability problem; Algorithm; Random walk; State (computer science); Discrete mathematics; Computer science; Statistics","score_opus":0.1536970349026865,"score_gpt":0.4022898729203972,"score_spread":0.2485928380177107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131529421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009628567,0.00006987586,0.9791751,0.010061756,0.0002849413,0.00060739834,0.0000023541602,0.00001945075,0.0001505924],"genre_scores_gemma":[0.9474835,0.00009658223,0.052162826,0.000058989277,0.00014776742,0.000009048081,0.000001449061,0.0000040948303,0.000035735862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731225,0.0006020093,0.00073143473,0.00020829747,0.0008257385,0.00032027112],"domain_scores_gemma":[0.9950567,0.0017645364,0.00026723463,0.00032550198,0.0024773325,0.000108696884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010554482,0.00009100357,0.00015687602,0.00026884963,0.00042721158,0.0003725432,0.00075437117,0.00007294106,0.000047687965],"category_scores_gemma":[0.0016982062,0.00006036529,0.00010046546,0.001106297,0.00015677648,0.0005868561,0.00004875138,0.00047895685,0.000017524984],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012961877,0.0001020923,0.00047765698,0.000006311464,0.000012746497,0.0000022987779,0.00046599907,0.0017773903,0.0010832801,0.044588726,0.00042159078,0.95093226],"study_design_scores_gemma":[0.0001093837,0.0012864202,0.030007018,0.000056455516,0.00000908149,0.00004890475,0.00036623623,0.52108085,0.02228254,0.42354903,0.0010179243,0.0001861401],"about_ca_topic_score_codex":0.00004671044,"about_ca_topic_score_gemma":0.00016479673,"teacher_disagreement_score":0.9507462,"about_ca_system_score_codex":0.00013851124,"about_ca_system_score_gemma":0.00042995845,"threshold_uncertainty_score":0.3657994},"labels":[],"label_agreement":null},{"id":"W2133180954","doi":"10.1613/jair.1676","title":"Decision-Theoretic Planning with non-Markovian Rewards","year":2006,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Australian Government; National ICT Australia","keywords":"Markov decision process; Computer science; Markov process; Partially observable Markov decision process; Heuristic; Probabilistic logic; Planner; Mathematical optimization; Decision problem; Process (computing); Function (biology); Artificial intelligence; Mathematics; Algorithm","score_opus":0.06525791475197834,"score_gpt":0.37882640252474176,"score_spread":0.3135684877727634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133180954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10092291,0.00037097203,0.8945156,0.0010233897,0.00028876515,0.00010881004,8.693661e-7,0.000025426307,0.002743301],"genre_scores_gemma":[0.9057747,0.000018967612,0.09360936,0.000032980723,0.00042710075,0.000002766715,5.627056e-7,0.000015348081,0.00011818026],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962333,0.00028288324,0.00079027587,0.00031227138,0.0016870485,0.00069420727],"domain_scores_gemma":[0.9960357,0.0018509898,0.00028165433,0.00045164395,0.0011532586,0.00022673384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006385134,0.00016422312,0.00028351828,0.00078519084,0.00046169688,0.0005846304,0.0015400255,0.00010464007,0.000053842843],"category_scores_gemma":[0.00051188824,0.00011979434,0.00010389761,0.0014203835,0.00026569358,0.0005773912,0.00017795098,0.0010802803,0.000083175175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012186624,0.0005490212,0.0066282586,0.00009486771,0.00009006105,0.0035866548,0.0050052255,0.15364908,0.0055373474,0.12967546,0.012015181,0.68195015],"study_design_scores_gemma":[0.00022738703,0.0040410426,0.0014239061,0.0025489626,0.000024386552,0.001049885,0.0019077461,0.29359317,0.071341924,0.61814815,0.004946143,0.0007472781],"about_ca_topic_score_codex":0.00010920442,"about_ca_topic_score_gemma":0.00002068085,"teacher_disagreement_score":0.80485183,"about_ca_system_score_codex":0.00012354393,"about_ca_system_score_gemma":0.00058192894,"threshold_uncertainty_score":0.5637604},"labels":[],"label_agreement":null},{"id":"W2133726639","doi":"10.1613/jair.2622","title":"Identification of Pleonastic It Using the Web","year":2009,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Authorship Attribution and Profiling","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Pronoun; Identification (biology); Set (abstract data type); Simple (philosophy); Natural language; Syntactic structure","score_opus":0.33272403793991595,"score_gpt":0.4899785421297413,"score_spread":0.15725450418982534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133726639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09420965,0.00021797947,0.89706,0.007996618,0.00031858718,0.00010211877,8.693824e-7,0.0000066232587,0.00008759165],"genre_scores_gemma":[0.9961169,0.0000756367,0.0035326472,0.0000544803,0.00018326631,4.3604715e-7,1.1635448e-7,0.0000027354079,0.000033824963],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99713624,0.00048101007,0.00089788996,0.00013364531,0.0010645988,0.00028662966],"domain_scores_gemma":[0.9971476,0.0005750979,0.00040615562,0.0003180089,0.0014598189,0.00009328481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009097558,0.00006665616,0.0001475316,0.0003560387,0.00026602653,0.00019820522,0.0012573458,0.000057728983,0.000029242214],"category_scores_gemma":[0.0014547827,0.000046068777,0.0001017013,0.0013209905,0.00016581872,0.00041967153,0.00008398985,0.0005717639,0.000028168317],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008305708,0.00018915022,0.0000749887,0.00001527987,0.000020757147,0.000022613993,0.0030285555,0.00659901,0.47785464,0.30605942,0.00027749868,0.20577504],"study_design_scores_gemma":[0.000019859188,0.0002762018,0.0001727137,0.00007339523,0.0000066020048,0.00006296452,0.0015998653,0.46618372,0.4190722,0.11216784,0.00029016624,0.00007445157],"about_ca_topic_score_codex":0.0000066231414,"about_ca_topic_score_gemma":0.0000034674727,"teacher_disagreement_score":0.9019072,"about_ca_system_score_codex":0.000079045305,"about_ca_system_score_gemma":0.0004254645,"threshold_uncertainty_score":0.31530502},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","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","score_opus":0.14257912253204047,"score_gpt":0.4123511718843479,"score_spread":0.2697720493523074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136791927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27237794,0.00018555456,0.72470796,0.0010247862,0.0003564429,0.000078000056,0.000004475707,0.000015009519,0.0012498436],"genre_scores_gemma":[0.9700024,0.00040127672,0.028013026,0.000015248818,0.0003927709,0.0000020325851,3.6439303e-7,0.000008883191,0.0011639929],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99728596,0.000565259,0.00058860285,0.00017305338,0.0010216542,0.0003654667],"domain_scores_gemma":[0.9970516,0.00092684623,0.0003040064,0.0002688285,0.0012738755,0.00017483602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035539453,0.00009228518,0.00021604187,0.00053822127,0.00029849252,0.00007056279,0.0008559627,0.00004627031,0.0001593986],"category_scores_gemma":[0.0007806726,0.000074500036,0.00014063912,0.0007414942,0.00036130167,0.0004179076,0.00014189877,0.001002502,0.00010410638],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017235894,0.0005441619,0.00026821226,0.000015893926,0.00008967794,0.00054793106,0.0075411643,0.016008409,0.010236381,0.13033976,0.0014029605,0.8328331],"study_design_scores_gemma":[0.00016092378,0.0031194868,0.005095238,0.00020867186,0.000014920163,0.001710796,0.004335576,0.20786172,0.43069735,0.33539212,0.010909674,0.0004934971],"about_ca_topic_score_codex":0.00013040195,"about_ca_topic_score_gemma":0.000010612406,"teacher_disagreement_score":0.8323396,"about_ca_system_score_codex":0.000057848076,"about_ca_system_score_gemma":0.00045740823,"threshold_uncertainty_score":0.43554282},"labels":[],"label_agreement":null},{"id":"W2138781282","doi":"10.1613/jair.3384","title":"Policy Invariance under Reward Transformations for General-Sum Stochastic Games","year":2011,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Carleton University","funders":"","keywords":"Convergence (economics); Nash equilibrium; Mathematical economics; Property (philosophy); Markov chain; Computer science; Markov decision process; Mathematical optimization; Mathematics; Markov process; Economics; Machine learning","score_opus":0.28393678730286626,"score_gpt":0.42748179026709787,"score_spread":0.14354500296423162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138781282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017137027,0.000059105732,0.9933514,0.0029133954,0.00040612227,0.00032744906,0.0000014810025,0.000024543868,0.0012028277],"genre_scores_gemma":[0.8490356,0.00016556735,0.14950973,0.00016414956,0.0006205224,0.000021478872,8.4914547e-7,0.000020888121,0.00046119752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697876,0.00021568459,0.00093936257,0.00021038689,0.000995241,0.00066059385],"domain_scores_gemma":[0.99699354,0.00056284445,0.00028935153,0.00042026973,0.0014890822,0.00024492186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033249191,0.00013895474,0.00024298855,0.00091712363,0.00034515143,0.00029324242,0.0016801326,0.00009809709,0.000053871107],"category_scores_gemma":[0.0011736267,0.00012060578,0.00017199354,0.0011926246,0.00022672358,0.0010410234,0.00013368396,0.00064882694,0.00009125513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007928378,0.000091658694,0.000007100266,0.000022165028,0.000043933705,0.0000074087566,0.0042349542,0.28906798,0.0011459973,0.6682715,0.00033040036,0.036697663],"study_design_scores_gemma":[0.00008218078,0.0010966856,0.000116986186,0.00010333325,0.000009370399,0.00006430957,0.0009837464,0.5628976,0.020910177,0.41296214,0.00056213146,0.00021129072],"about_ca_topic_score_codex":0.00007209532,"about_ca_topic_score_gemma":0.000014912487,"teacher_disagreement_score":0.8473219,"about_ca_system_score_codex":0.00018663582,"about_ca_system_score_gemma":0.00089623313,"threshold_uncertainty_score":0.49181607},"labels":[],"label_agreement":null},{"id":"W2140994944","doi":"10.1613/jair.2241","title":"Compressed Pattern Databases","year":2007,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation; National Science Foundation","keywords":"Computer science; Table (database); Set (abstract data type); Uncompressed video; Database; Heuristic; Merge (version control); Domain (mathematical analysis); Algorithm; Data mining; Theoretical computer science; Information retrieval; Programming language; Artificial intelligence; Mathematics","score_opus":0.30467648472560893,"score_gpt":0.46082037062180975,"score_spread":0.15614388589620082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140994944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028137768,0.00041361022,0.96894145,0.0012233914,0.00046728904,0.00007782086,0.0000021935596,0.000025243968,0.0007112438],"genre_scores_gemma":[0.9709154,0.000048373742,0.02840744,0.00009337181,0.00046775892,7.2380004e-7,0.0000011020788,0.000009017145,0.00005685362],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9967976,0.00027930102,0.0007764463,0.0002251327,0.0012749247,0.0006465612],"domain_scores_gemma":[0.9961248,0.0019330285,0.00023553628,0.00043091516,0.000999447,0.00027628013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010726635,0.00011066182,0.00020620109,0.000635125,0.0003008555,0.00027459243,0.0015203455,0.000055621134,0.00008059816],"category_scores_gemma":[0.0006793815,0.000092092574,0.00009390027,0.00092221383,0.00015010452,0.0006412326,0.00027214488,0.0009494028,0.00014747516],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009457978,0.00022885497,0.0018559174,0.000031697287,0.000032006043,0.0007242956,0.0016876216,0.001453942,0.01149055,0.02170089,0.0031775765,0.9575221],"study_design_scores_gemma":[0.0001628342,0.0018862454,0.0018790168,0.0009122363,0.000016524682,0.0006010008,0.003267954,0.1880978,0.7181883,0.051833756,0.03244727,0.0007070716],"about_ca_topic_score_codex":0.00014528549,"about_ca_topic_score_gemma":0.000052359348,"teacher_disagreement_score":0.956815,"about_ca_system_score_codex":0.00007333916,"about_ca_system_score_gemma":0.00025528393,"threshold_uncertainty_score":0.41247356},"labels":[],"label_agreement":null},{"id":"W2142099814","doi":"10.1613/jair.1993","title":"The Power of Modeling---a Response to PDDL2.1","year":2003,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Competition (biology); Context (archaeology); Domain (mathematical analysis); Computer science; Field (mathematics); Management science; Power (physics); Operations research; Engineering; Mathematics; Geography","score_opus":0.1343993698351554,"score_gpt":0.4085443561313474,"score_spread":0.274144986296192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142099814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07391125,0.00018785353,0.92391044,0.0014423783,0.00026471386,0.00015440414,5.090343e-7,0.00002784545,0.00010060922],"genre_scores_gemma":[0.8070121,0.00006224974,0.19280152,0.00001687662,0.000034058987,0.000005397183,1.5482344e-8,0.000010791967,0.000056998888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99643606,0.00072353764,0.00082121545,0.00019614378,0.0013455336,0.00047748903],"domain_scores_gemma":[0.99605536,0.00093993347,0.00014027889,0.000707442,0.0019366847,0.00022027512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014279775,0.0001095445,0.00020960967,0.0005563821,0.00020459972,0.00018373984,0.0018903401,0.00007396677,0.000013481119],"category_scores_gemma":[0.0017639565,0.000077559176,0.00012622145,0.0012206688,0.00012349979,0.00028495837,0.00022287929,0.0006500768,0.0000332359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054994004,0.00016860102,0.000025618354,0.000009892812,0.00003427429,0.000060293805,0.0032770403,0.07922061,0.032978486,0.71163607,0.0007988301,0.17124033],"study_design_scores_gemma":[0.000041509225,0.0021522488,0.000025446714,0.00019873439,0.000004351267,0.00012576136,0.0004398785,0.3924839,0.42819354,0.14296369,0.033099398,0.0002715631],"about_ca_topic_score_codex":0.0000120134755,"about_ca_topic_score_gemma":0.0000044432886,"teacher_disagreement_score":0.73310083,"about_ca_system_score_codex":0.00013118329,"about_ca_system_score_gemma":0.00044789579,"threshold_uncertainty_score":0.49491137},"labels":[],"label_agreement":null},{"id":"W2142190389","doi":"10.1613/jair.2446","title":"A Constraint Programming Approach for Solving a Queueing Control Problem","year":2008,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Constraint programming; Queueing theory; Heuristic; Constraint (computer-aided design); Constraint satisfaction; Concurrent constraint logic programming; Stochastic programming; Staffing; Control (management)","score_opus":0.15808666941614952,"score_gpt":0.37932137778767777,"score_spread":0.22123470837152825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142190389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026454364,0.000096194635,0.9949879,0.0009834715,0.0001492656,0.0006072512,0.0000010648331,0.000034133547,0.0004953008],"genre_scores_gemma":[0.6219927,0.000038296257,0.37774095,0.00002555556,0.00015242936,0.000021650161,3.6780446e-7,0.0000069525063,0.000021075815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974613,0.0001774961,0.0007944243,0.00025278926,0.0007950669,0.0005188895],"domain_scores_gemma":[0.9969792,0.00061916385,0.00028964167,0.00019716023,0.0017129623,0.00020192396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003949767,0.00011613704,0.00025217276,0.000541935,0.00054926414,0.00030076882,0.00062200194,0.00008314176,0.000020010883],"category_scores_gemma":[0.00076207373,0.00010136374,0.00017062915,0.00074364804,0.00034154858,0.000670354,0.00006879921,0.0005433654,0.000006852777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011637391,0.00026666382,0.00035083227,0.00004992607,0.00005769843,0.000058109003,0.0031739026,0.016986825,0.00466787,0.095546916,0.0001650835,0.8785598],"study_design_scores_gemma":[0.00022517054,0.0007607758,0.000073723175,0.00010029474,0.0000094968,0.000943691,0.0023457292,0.97149163,0.010078932,0.0128076095,0.0009318797,0.00023105548],"about_ca_topic_score_codex":0.000020473946,"about_ca_topic_score_gemma":0.000008358311,"teacher_disagreement_score":0.9545048,"about_ca_system_score_codex":0.00013697341,"about_ca_system_score_gemma":0.00071517157,"threshold_uncertainty_score":0.42245513},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.4539481331437369,"score_gpt":0.4870388551056944,"score_spread":0.0330907219619575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144913588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014141948,0.00019750088,0.98346865,0.001156918,0.0005757028,0.00019062005,9.831576e-7,0.000033475888,0.00023417981],"genre_scores_gemma":[0.5305747,0.00027932672,0.4673403,0.00009028836,0.0012374645,0.0000060515017,0.0000016241368,0.000023364328,0.00044691318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968257,0.00017088499,0.00084091205,0.00021818551,0.0013412748,0.00060307694],"domain_scores_gemma":[0.9963918,0.0010729071,0.00028978774,0.00034839587,0.0016823207,0.00021481626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003161627,0.00011930691,0.0002483997,0.0006251191,0.00046261854,0.00018137993,0.0016435031,0.00008752154,0.000018699146],"category_scores_gemma":[0.0012905208,0.00010218367,0.00015777712,0.0008386896,0.00017337737,0.0006108243,0.00023077229,0.00081630726,0.00004755243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016748704,0.0007302961,0.00048194945,0.000058903086,0.0001337133,0.00063445343,0.008394283,0.7665037,0.0038627347,0.043660197,0.004426053,0.17094626],"study_design_scores_gemma":[0.000070068,0.0015353994,0.00016696563,0.00009343179,0.000004972575,0.0003390118,0.00077266357,0.9612532,0.018687967,0.0097106695,0.007198069,0.00016753326],"about_ca_topic_score_codex":0.000008837411,"about_ca_topic_score_gemma":8.872053e-7,"teacher_disagreement_score":0.5164327,"about_ca_system_score_codex":0.00014248613,"about_ca_system_score_gemma":0.0005033809,"threshold_uncertainty_score":0.4166929},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; 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","score_opus":0.1824121673170033,"score_gpt":0.40867049433853025,"score_spread":0.22625832702152696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147148915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046284464,0.000077396566,0.9930465,0.0013487235,0.00046086637,0.00020478257,0.0000016099915,0.000027244701,0.00020441732],"genre_scores_gemma":[0.57252115,0.00020159084,0.42651448,0.00009308095,0.00049510365,0.000009896355,0.0000016714849,0.000012531838,0.00015052738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786997,0.00016275294,0.0005922227,0.00019830729,0.00082490186,0.0003518579],"domain_scores_gemma":[0.99700785,0.0004441606,0.0002104016,0.00016280639,0.0020048667,0.0001699238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002107196,0.00009273928,0.0001731313,0.0007339581,0.00044600118,0.00013878924,0.00044789736,0.00008174893,0.00011456385],"category_scores_gemma":[0.0004454133,0.00008375545,0.0001461786,0.0011208885,0.00016162948,0.0004885521,0.00003974252,0.00038091303,0.00004062097],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005704911,0.00011245078,0.00032174267,0.0000070238816,0.000016379754,0.000023480894,0.00025617678,0.005787748,0.0016982679,0.007841962,0.0012974711,0.98258024],"study_design_scores_gemma":[0.00008654765,0.0007041182,0.00038528728,0.000027775082,0.0000043025743,0.00031067172,0.00019380008,0.9229377,0.059704397,0.01222745,0.0032832953,0.00013464026],"about_ca_topic_score_codex":0.000021711552,"about_ca_topic_score_gemma":0.000019971063,"teacher_disagreement_score":0.9824456,"about_ca_system_score_codex":0.00016787478,"about_ca_system_score_gemma":0.0007917904,"threshold_uncertainty_score":0.34303257},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.1097453708321637,"score_gpt":0.354419875162297,"score_spread":0.24467450433013332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149586740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043451983,0.00008065807,0.9511471,0.0017067122,0.0002475839,0.00048758672,1.4752037e-7,0.000034584733,0.0028436657],"genre_scores_gemma":[0.98701805,0.00006693841,0.01195211,0.00006725278,0.00016149945,0.00001319237,2.6672038e-7,0.0000210606,0.00069964316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940898,0.00072085793,0.0009819152,0.0004229187,0.0028253356,0.0009591772],"domain_scores_gemma":[0.9952742,0.0015215272,0.0002982956,0.00051376724,0.0019376157,0.00045460858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005920767,0.0002316583,0.00035576223,0.0011152879,0.0005681771,0.00092271855,0.0013308496,0.00012302946,0.00021028398],"category_scores_gemma":[0.0012135223,0.00018946931,0.00014309991,0.0012354389,0.00035299687,0.00058064726,0.00045913667,0.0018962253,0.0003977752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000963148,0.00009252336,0.00015361364,0.00001775933,0.00002373833,0.000035000918,0.00084574043,0.9359654,0.0012066419,0.005470461,0.00020986355,0.055882897],"study_design_scores_gemma":[0.000095660325,0.0028826725,0.00022859564,0.00018114461,0.000004763602,0.000014970659,0.0012098339,0.982104,0.012364112,0.00055153307,0.00018498194,0.00017774856],"about_ca_topic_score_codex":0.0001783437,"about_ca_topic_score_gemma":0.0000034722525,"teacher_disagreement_score":0.943566,"about_ca_system_score_codex":0.00035023602,"about_ca_system_score_gemma":0.0004203224,"threshold_uncertainty_score":0.8897796},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Alberta Innovates; University of Alberta; Compute Canada","keywords":"Testbed; Benchmarking; Reinforcement learning; Benchmark (surveying); Imitation; Interface (matter)","score_opus":0.29025970311617355,"score_gpt":0.4427010381262976,"score_spread":0.15244133501012402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150468603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0776395,0.00011415057,0.9195682,0.0012941144,0.0004011518,0.00063313515,1.5214343e-7,0.000012665434,0.00033696866],"genre_scores_gemma":[0.9676027,0.00033821454,0.030571409,0.000040153758,0.0006171849,0.000060222785,0.000001990808,0.000019037963,0.00074904086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958612,0.0004719288,0.0007582436,0.00021820032,0.0020757867,0.0006146715],"domain_scores_gemma":[0.99687946,0.0009411229,0.00035926767,0.0003876486,0.0012249118,0.00020760397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010364811,0.00011473528,0.00014583132,0.00026284528,0.00094491115,0.0010069141,0.001638236,0.00007871621,0.00014900157],"category_scores_gemma":[0.001593545,0.00007997811,0.00011056025,0.0003240265,0.00018970013,0.0013434042,0.00021957389,0.0008387021,0.0002262879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002452238,0.000038752758,0.00006165066,0.0000045992624,0.000023130397,0.00000178245,0.0011417979,0.56498045,0.0025405593,0.017244529,0.00031156326,0.4136267],"study_design_scores_gemma":[0.00004503443,0.00085899216,0.00022363587,0.0000164548,0.0000057532498,0.000010975389,0.0008975657,0.9479652,0.008820786,0.03571634,0.005351497,0.00008775616],"about_ca_topic_score_codex":0.000029253295,"about_ca_topic_score_gemma":0.0000033937415,"teacher_disagreement_score":0.88996327,"about_ca_system_score_codex":0.0002630366,"about_ca_system_score_gemma":0.00022404343,"threshold_uncertainty_score":0.97096956},"labels":[],"label_agreement":null},{"id":"W2155727572","doi":"10.1613/jair.3076","title":"Case-Based Subgoaling in Real-Time Heuristic Search for Video Game Pathfinding","year":2010,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristic; Domain (mathematical analysis); Pathfinding; Constant (computer programming); Property (philosophy); Incremental heuristic search; Video game; Scale (ratio)","score_opus":0.19857307610173033,"score_gpt":0.4394584863231504,"score_spread":0.24088541022142004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155727572","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5722265,0.00004217172,0.42524245,0.000955035,0.00078272296,0.00050122215,0.000004759437,0.000040470182,0.00020466441],"genre_scores_gemma":[0.94650203,0.00003094559,0.052618895,0.000042385833,0.00068587344,0.000029999683,8.851671e-7,0.00004079173,0.00004819825],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99357796,0.00069240225,0.0019042904,0.0006473136,0.0017331541,0.0014449052],"domain_scores_gemma":[0.9893911,0.0062007,0.0004106553,0.00084692804,0.002651289,0.00049933745],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.017696084,0.0002862281,0.00057040405,0.002149302,0.00044374441,0.0008329203,0.002474732,0.00025888867,0.00015728838],"category_scores_gemma":[0.0047114193,0.00026696725,0.00030722347,0.002368261,0.0005846428,0.00093250035,0.00032104776,0.0024662474,0.00023348193],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006753804,0.0010545867,0.0014426233,0.00015704361,0.00005334549,0.010186955,0.0075927963,0.021709118,0.4716811,0.118210614,0.00033646447,0.3669],"study_design_scores_gemma":[0.000061952844,0.00069975347,0.000032300526,0.0001504088,0.0000069398775,0.001052848,0.00097574777,0.4944609,0.44487533,0.05709512,0.0002953697,0.00029331737],"about_ca_topic_score_codex":0.000494745,"about_ca_topic_score_gemma":0.0005064945,"teacher_disagreement_score":0.4727518,"about_ca_system_score_codex":0.00029929634,"about_ca_system_score_gemma":0.0013271936,"threshold_uncertainty_score":0.99997824},"labels":[],"label_agreement":null},{"id":"W2155992093","doi":"10.1613/jair.4171","title":"Enhanced Partial Expansion A*","year":2014,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":151,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Computer science; A priori and a posteriori; Heuristic; Benchmark (surveying); Node (physics); Domain (mathematical analysis); Mathematical optimization; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.14836674078168158,"score_gpt":0.40885550094117146,"score_spread":0.26048876015948985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155992093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0644659,0.00011211826,0.9321118,0.0017302854,0.0005669022,0.000066586275,2.4428599e-7,0.0000252639,0.0009208857],"genre_scores_gemma":[0.9780781,0.000037774647,0.021110889,0.00006272644,0.00061774935,0.0000022929357,2.611667e-7,0.000008068331,0.000082116385],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9967772,0.000630787,0.000664647,0.00023692976,0.0011566812,0.00053377205],"domain_scores_gemma":[0.9971391,0.0010824482,0.00021996687,0.00038579598,0.0009297839,0.00024288383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076390626,0.00010672746,0.00021850699,0.00042160574,0.00032191773,0.0003240113,0.0012708462,0.00008999485,0.00006392901],"category_scores_gemma":[0.0013322717,0.00008683373,0.00010925523,0.000775842,0.0001262197,0.00054190704,0.00018111807,0.0008169856,0.00023551854],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009908002,0.00013250817,0.000053894288,0.000019010053,0.000015977552,0.000039786235,0.002385088,0.0051722485,0.086939424,0.08648396,0.0010772669,0.8175818],"study_design_scores_gemma":[0.00004287922,0.001118846,0.000040299205,0.00018388311,0.0000035897908,0.00004278234,0.00034597435,0.19667897,0.71800715,0.07924316,0.0041247043,0.00016775978],"about_ca_topic_score_codex":0.000027096006,"about_ca_topic_score_gemma":0.0000057117213,"teacher_disagreement_score":0.91361225,"about_ca_system_score_codex":0.00006126242,"about_ca_system_score_gemma":0.00027827252,"threshold_uncertainty_score":0.35494414},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; 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","score_opus":0.14109590791519244,"score_gpt":0.42683299948391384,"score_spread":0.2857370915687214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156413587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25898558,0.00010926648,0.7387027,0.00045220353,0.00024063866,0.000063507214,5.9210277e-7,0.0000072640864,0.0014382609],"genre_scores_gemma":[0.9913398,0.00005721714,0.0083325505,0.000023209,0.00015369945,9.575153e-7,8.630357e-7,0.0000040745267,0.00008762798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962405,0.00028501195,0.0011778091,0.00018855048,0.001728562,0.0003795446],"domain_scores_gemma":[0.9972973,0.00048603077,0.00031722107,0.00043094423,0.0012884858,0.00018000607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072179316,0.00010026259,0.0004378361,0.002302445,0.00014087031,0.00022381068,0.0012371154,0.000058624282,0.00018648876],"category_scores_gemma":[0.00035219808,0.000080030775,0.00042841045,0.003872633,0.00013612588,0.0005576493,0.00027334443,0.0003571259,0.00004132438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007221759,0.00043173018,0.010159694,0.000018941822,0.0016483744,0.00001826176,0.0028905089,0.024070967,0.012360564,0.098123804,0.00046408924,0.84974086],"study_design_scores_gemma":[0.000028817,0.00052773056,0.003912264,0.000049362665,0.00018111714,0.0000071251307,0.00084101903,0.8474557,0.1414292,0.0036214532,0.0017979313,0.00014832173],"about_ca_topic_score_codex":0.00002320993,"about_ca_topic_score_gemma":0.0000190418,"teacher_disagreement_score":0.8495925,"about_ca_system_score_codex":0.000043695487,"about_ca_system_score_gemma":0.00012217295,"threshold_uncertainty_score":0.32635602},"labels":[],"label_agreement":null},{"id":"W2156890722","doi":"10.1613/jair.2648","title":"Solving #SAT and Bayesian Inference with Backtracking Search","year":2009,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Backtracking; Memoization; Speedup; Look-ahead; Simple (philosophy); Probabilistic logic; Range (aeronautics); Inference; Exploit","score_opus":0.16824577073741623,"score_gpt":0.41698642003924197,"score_spread":0.24874064930182574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156890722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08920921,0.00034498674,0.90648997,0.0031514675,0.000082793515,0.00010135975,3.642329e-7,0.000025925581,0.000593926],"genre_scores_gemma":[0.94364786,0.00025571423,0.05578364,0.00008849671,0.00018545939,0.000001007481,1.7736271e-7,0.0000083045425,0.00002932339],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996563,0.0003307496,0.00064423366,0.00036400266,0.0013789132,0.00071909296],"domain_scores_gemma":[0.9969021,0.0006446866,0.00015556,0.00038949723,0.0015192396,0.00038892825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004457885,0.00017003666,0.00029259085,0.0006158378,0.000388771,0.000943996,0.0012462832,0.00010359949,0.00002471127],"category_scores_gemma":[0.0004321789,0.0001293936,0.00006165569,0.0011512889,0.00027920338,0.0011365056,0.00017542164,0.0013022637,0.000030987598],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099795565,0.00015408003,0.00039654132,0.000019337884,0.000019328942,0.00021587274,0.002621454,0.002165844,0.010823676,0.14471403,0.000046229456,0.8387238],"study_design_scores_gemma":[0.00011881973,0.004426005,0.0016152037,0.0008566815,0.000013268455,0.0006731815,0.0021937538,0.58420736,0.07678433,0.32843518,0.00012856339,0.00054766936],"about_ca_topic_score_codex":0.000034276385,"about_ca_topic_score_gemma":0.000021657326,"teacher_disagreement_score":0.85443866,"about_ca_system_score_codex":0.00008391716,"about_ca_system_score_gemma":0.00055015564,"threshold_uncertainty_score":0.9102976},"labels":[],"label_agreement":null},{"id":"W2159272820","doi":"10.1613/jair.3175","title":"Non-Deterministic Policies in Markovian Decision Processes","year":2011,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Institutes of Health; Duke-NUS Medical School; Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Reinforcement learning; Computer science; Flexibility (engineering); Markov decision process; Set (abstract data type); Task (project management); Action selection; Markov process; Construct (python library); Process (computing); Action (physics); Decision problem; Artificial intelligence; Selection (genetic algorithm); Decision support system; Machine learning; Operations research; Algorithm; Mathematics; Engineering","score_opus":0.23871200327016803,"score_gpt":0.42671615641768834,"score_spread":0.1880041531475203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159272820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083281286,0.00007090092,0.91266733,0.00022231613,0.00036898375,0.0001577288,1.9183761e-7,0.000012367402,0.0032188948],"genre_scores_gemma":[0.9673474,0.00017806583,0.03220369,0.000027752356,0.0001334822,0.0000034305906,8.985341e-8,0.000010730807,0.00009538501],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967707,0.00015409087,0.0009914415,0.0002211468,0.0012708976,0.0005917335],"domain_scores_gemma":[0.99711394,0.0008335555,0.00027633947,0.00037497774,0.0012106369,0.00019053374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038191376,0.00012722067,0.00024954896,0.0012199546,0.00015356898,0.00029138298,0.0020780328,0.00008744935,0.00007762185],"category_scores_gemma":[0.0027555989,0.00010503458,0.00007118322,0.0019182384,0.0002285508,0.0007699018,0.00037409685,0.0007933617,0.0001521819],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008799643,0.0011040197,0.012893447,0.00034154524,0.000068877445,0.0018762836,0.048470978,0.08950875,0.005101085,0.055215433,0.0008626198,0.783677],"study_design_scores_gemma":[0.00024320355,0.00621681,0.015602529,0.0018849899,0.000015886624,0.00048969703,0.007659744,0.5799738,0.15763931,0.22816664,0.0012300133,0.0008773938],"about_ca_topic_score_codex":0.00009503392,"about_ca_topic_score_gemma":0.000063946834,"teacher_disagreement_score":0.8840661,"about_ca_system_score_codex":0.0001350784,"about_ca_system_score_gemma":0.00067231985,"threshold_uncertainty_score":0.4283186},"labels":[],"label_agreement":null},{"id":"W2160927913","doi":"10.1613/jair.1696","title":"Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators","year":2005,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":195,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Macro; Computer science; Artificial intelligence; Software engineering; Programming language","score_opus":0.1124290222437872,"score_gpt":0.40916905857847136,"score_spread":0.29674003633468415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160927913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116004676,0.0004403629,0.87398,0.008454273,0.0002131702,0.00017761582,0.0000011699434,0.000085422405,0.0006433482],"genre_scores_gemma":[0.892694,0.00001962502,0.10629743,0.00025895511,0.0005371549,0.000004538226,5.598604e-7,0.000023888306,0.0001638365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99554974,0.0004587042,0.00097522733,0.000398743,0.0016531295,0.00096443295],"domain_scores_gemma":[0.99666876,0.00090302975,0.00031331842,0.00046876393,0.0012299289,0.00041619033],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.006285138,0.00022135078,0.0003589571,0.00068698183,0.0006320009,0.0010837514,0.0016751838,0.00013922082,0.000109418594],"category_scores_gemma":[0.000706595,0.00016785978,0.00011605611,0.0012163506,0.00023514636,0.0012597106,0.00027314783,0.0018798403,0.00019945059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003381265,0.00026265287,0.0015450768,0.00008248341,0.00009123896,0.0007465443,0.0079602795,0.0741058,0.01691009,0.024541525,0.0016240194,0.87179214],"study_design_scores_gemma":[0.00015039735,0.0021743283,0.00020017567,0.0006316257,0.000016759624,0.00055854145,0.0015120041,0.8741157,0.10434011,0.012051843,0.0037544477,0.00049403415],"about_ca_topic_score_codex":0.000051793835,"about_ca_topic_score_gemma":0.000019691059,"teacher_disagreement_score":0.87129813,"about_ca_system_score_codex":0.00020848801,"about_ca_system_score_gemma":0.0009604084,"threshold_uncertainty_score":0.9999532},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Hong Kong University of Science and Technology","keywords":"Exploit; Conditional independence; Variable elimination; Inference; Independence (probability theory); Variable (mathematics); Representation (politics); Probabilistic logic","score_opus":0.2762382946313396,"score_gpt":0.4383195104679956,"score_spread":0.16208121583665602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167116921","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13180998,0.0002642486,0.8654202,0.00042822093,0.0003053051,0.00015775985,4.267388e-7,0.000019440007,0.0015943681],"genre_scores_gemma":[0.9836258,0.00010643498,0.016093299,0.000039672177,0.00008227013,0.000008835797,9.506e-8,0.000009279176,0.0000343099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995333,0.0008925783,0.00115566,0.00037175603,0.00150294,0.0007440468],"domain_scores_gemma":[0.9958054,0.0014853505,0.0002645256,0.00042507632,0.0017528321,0.00026680995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009734759,0.00016180656,0.00032609073,0.0007556821,0.00017956895,0.0004291507,0.0016076106,0.00014543268,0.000059254176],"category_scores_gemma":[0.0075880317,0.0001425224,0.0000906719,0.0016808202,0.00026499023,0.0010096516,0.00018080635,0.0017010623,0.00010069053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034498313,0.00027453588,0.00056459813,0.000023304381,0.0000087894905,0.00021109902,0.002309345,0.004885624,0.004078178,0.8162969,0.000030098396,0.17128304],"study_design_scores_gemma":[0.00009173021,0.0007904471,0.00017553252,0.000454265,0.000003356233,0.00020698442,0.0033520272,0.1181802,0.044325322,0.8319033,0.00018403004,0.00033281953],"about_ca_topic_score_codex":0.00007433366,"about_ca_topic_score_gemma":0.000094129806,"teacher_disagreement_score":0.8518158,"about_ca_system_score_codex":0.00019644278,"about_ca_system_score_gemma":0.0011755271,"threshold_uncertainty_score":0.90841305},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.2756728393136693,"score_gpt":0.4075134273255451,"score_spread":0.13184058801187576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167609405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08787469,0.0010507613,0.90895873,0.0015794897,0.00034121796,0.00008251892,9.243689e-8,0.000009084917,0.000103426675],"genre_scores_gemma":[0.8989751,0.001304174,0.099238954,0.000018472005,0.00032421862,0.0000030939284,6.623928e-8,0.0000059797217,0.00012996406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980669,0.00018190897,0.00047742654,0.00014639519,0.0008295553,0.00029780835],"domain_scores_gemma":[0.9986466,0.000398945,0.0001161981,0.00023072585,0.00049386604,0.000113648166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028023394,0.00006350524,0.00010088911,0.00021046764,0.0005825163,0.0001829822,0.0006110411,0.000043693108,0.000005233038],"category_scores_gemma":[0.0002961662,0.000043661443,0.000044865894,0.00039698073,0.00014282044,0.00042137862,0.0001960297,0.00048135966,0.000019095149],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009875154,0.000038170703,0.00015107967,0.0000027899193,0.000015702068,0.000076933706,0.0037661672,0.0011153289,0.0028060589,0.013895137,0.00010689936,0.97801584],"study_design_scores_gemma":[0.000036764643,0.00019736009,0.00073342596,0.000056113273,0.0000013762825,0.00032044746,0.001053914,0.9290766,0.03429125,0.03241746,0.0017131576,0.00010212755],"about_ca_topic_score_codex":0.000019549567,"about_ca_topic_score_gemma":0.0000011030086,"teacher_disagreement_score":0.97791374,"about_ca_system_score_codex":0.00007800399,"about_ca_system_score_gemma":0.00013214203,"threshold_uncertainty_score":0.44803035},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia","keywords":"Computer science; Asynchronous communication; Segmentation; Artificial intelligence; Conversation; Natural language processing; Exploit; Graph; Linguistics; Theoretical computer science","score_opus":0.1082659095785678,"score_gpt":0.424850168063926,"score_spread":0.3165842584853582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169142063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21495397,0.000177129,0.7828961,0.001651909,0.000049526996,0.00013543857,8.147802e-8,0.000011412539,0.0001244048],"genre_scores_gemma":[0.8893526,0.00022837993,0.110312805,0.000026162365,0.000050243845,0.000007254876,1.3010883e-7,0.0000031377267,0.000019244195],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857366,0.00016097615,0.00046214083,0.00013560754,0.00044700276,0.00022060056],"domain_scores_gemma":[0.99868536,0.00033001683,0.000120939345,0.00015596033,0.00062738115,0.00008034636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014832333,0.000056077577,0.00012926375,0.00061737647,0.00009331142,0.0002190246,0.0004075541,0.00003963238,0.000054873683],"category_scores_gemma":[0.00033087758,0.000049506623,0.000032053413,0.000753769,0.00009904255,0.0010674554,0.000115013645,0.00035483687,0.00003760059],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050794783,0.00009118294,0.0016658598,0.000009693793,0.000012905411,0.000021459484,0.0020881363,0.00059849734,0.049458023,0.0401774,0.00006379978,0.905808],"study_design_scores_gemma":[0.00005879125,0.00043670638,0.0018083883,0.000096507196,0.000004935979,0.00003980524,0.003578268,0.16953956,0.28077537,0.543384,0.00011159923,0.00016607049],"about_ca_topic_score_codex":0.00014920614,"about_ca_topic_score_gemma":0.00006485697,"teacher_disagreement_score":0.9056419,"about_ca_system_score_codex":0.00013642163,"about_ca_system_score_gemma":0.000098161196,"threshold_uncertainty_score":0.21120593},"labels":[],"label_agreement":null},{"id":"W2170431068","doi":"10.1613/jair.4031","title":"Horn Clause Contraction Functions","year":2013,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Horn clause; Contraction (grammar); Propositional calculus; French horn; Remainder; Mathematics; Classical logic; Forgetting; Computer science; Algorithm; Discrete mathematics; Artificial intelligence; Logic programming; Arithmetic; Linguistics","score_opus":0.1545227878795776,"score_gpt":0.39424318178333695,"score_spread":0.23972039390375935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170431068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078606434,0.00046809568,0.9058334,0.0040135207,0.0018632791,0.00027968676,5.8095554e-7,0.0000475538,0.0088874195],"genre_scores_gemma":[0.99432087,0.00017357353,0.0034709948,0.000042078256,0.0008354946,0.000010955245,2.712225e-7,0.000008563592,0.0011372031],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737877,0.00033928474,0.00062716025,0.000225518,0.0009033949,0.00052588317],"domain_scores_gemma":[0.9959939,0.0006664134,0.00021569664,0.000360756,0.002462233,0.0003009653],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027283886,0.00011027277,0.00020573314,0.0005364262,0.00038603265,0.00067623396,0.001014576,0.000108092565,0.0004895901],"category_scores_gemma":[0.0011042975,0.0000842592,0.00014942368,0.000994377,0.00018756793,0.00144318,0.00015929216,0.00094930455,0.002688553],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055892007,0.0005592451,0.00041286604,0.000013668739,0.000060667655,0.00006732231,0.0015886439,0.000279678,0.022867864,0.11837287,0.021887308,0.833834],"study_design_scores_gemma":[0.00024293053,0.0040997528,0.005876591,0.00022445973,0.000036484995,0.00083852914,0.008411556,0.15036738,0.15827689,0.60610837,0.0646884,0.0008286556],"about_ca_topic_score_codex":0.00017055505,"about_ca_topic_score_gemma":0.00005440811,"teacher_disagreement_score":0.91571444,"about_ca_system_score_codex":0.00015750049,"about_ca_system_score_gemma":0.0003316185,"threshold_uncertainty_score":0.99808794},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.21269704873182618,"score_gpt":0.408101652300917,"score_spread":0.1954046035690908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170780172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014381535,0.00010662081,0.9823598,0.0017658045,0.00084109773,0.0003452369,0.0000039962747,0.000028356853,0.00016750759],"genre_scores_gemma":[0.90551186,0.000047833248,0.09392729,0.00005551639,0.0004260031,0.0000073257333,0.0000010851913,0.000010917007,0.000012151859],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716413,0.00029684338,0.0007433028,0.00017526979,0.0010100217,0.00061041344],"domain_scores_gemma":[0.99635804,0.0011704342,0.00025954773,0.0002194382,0.0017237661,0.0002687798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006791956,0.00011673648,0.00019978601,0.00059356913,0.0004010872,0.00038592445,0.00041636822,0.00009257729,0.00008539693],"category_scores_gemma":[0.0012081958,0.0001063935,0.00013041761,0.0006852772,0.00022930183,0.00091627275,0.000060521787,0.00062522246,0.00003302514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007159277,0.000183141,0.0038769853,0.000079378275,0.000030748706,0.0000047779504,0.0015461697,0.042556986,0.006048503,0.117421925,0.00026632953,0.82791346],"study_design_scores_gemma":[0.00019865343,0.00072255277,0.0026276363,0.00022968934,0.00001683396,0.00015010354,0.00160333,0.9112295,0.050352223,0.030121721,0.0024038712,0.0003438671],"about_ca_topic_score_codex":0.000036908,"about_ca_topic_score_gemma":0.00003714543,"teacher_disagreement_score":0.8911303,"about_ca_system_score_codex":0.00020544275,"about_ca_system_score_gemma":0.0005300402,"threshold_uncertainty_score":0.43386006},"labels":[],"label_agreement":null},{"id":"W223326216","doi":"10.1613/jair.4301","title":"Policy Iteration Based on Stochastic Factorization","year":2014,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; National Institutes of Health; McGill University; Fonds Québécois de la Recherche sur la Nature et les Technologies; Compute Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Markov decision process; Factorization; Mathematical optimization; Factoring; Mathematics; Multiplication (music); Computer science; Markov process; Applied mathematics; Algorithm; Finance","score_opus":0.12763786672913804,"score_gpt":0.4165855694153244,"score_spread":0.2889477026861863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W223326216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009982113,0.0000033781837,0.9951997,0.002491475,0.0004031405,0.00010937478,1.772307e-7,0.000018992432,0.00077556906],"genre_scores_gemma":[0.98781073,0.0000041446892,0.011329444,0.00011922279,0.0006452555,0.0000017574177,8.1295195e-7,0.000008986704,0.00007964638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969166,0.00045629308,0.0005771903,0.00017353245,0.0015204474,0.00035596904],"domain_scores_gemma":[0.9971175,0.0009934565,0.00025279215,0.0003588338,0.0011208192,0.00015656797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034780137,0.000098442826,0.00014937867,0.0010993907,0.00022759885,0.0004986643,0.00090117037,0.00006964059,0.000027714445],"category_scores_gemma":[0.0042599346,0.00008301176,0.00007371903,0.001179662,0.00008377041,0.00049524574,0.00007894828,0.00058515696,0.00014448151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025887779,0.000042194257,0.00001801281,0.0000055901596,0.0000035671858,0.0000024587425,0.00026074136,0.8027494,0.001479438,0.12359322,0.000046410256,0.07177306],"study_design_scores_gemma":[0.000028271725,0.0010368568,0.00006314416,0.00006494281,0.0000014515289,0.0000042676993,0.000034382316,0.9617393,0.009555851,0.02721175,0.00018634435,0.000073428935],"about_ca_topic_score_codex":0.000011279856,"about_ca_topic_score_gemma":0.0000015301077,"teacher_disagreement_score":0.98681253,"about_ca_system_score_codex":0.00019560281,"about_ca_system_score_gemma":0.0003836134,"threshold_uncertainty_score":0.50998473},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.2633291444881119,"score_gpt":0.42435148853026977,"score_spread":0.16102234404215787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274912527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018318769,0.00027565952,0.957945,0.022769995,0.0003952751,0.000069517235,3.4497717e-7,0.000009635021,0.00021581019],"genre_scores_gemma":[0.97938156,0.00026641972,0.01955865,0.000024995421,0.0003636738,0.0000015566837,1.5642968e-7,0.0000060559205,0.00039695762],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974611,0.00026372907,0.00048681875,0.00019637172,0.0012419124,0.00035007362],"domain_scores_gemma":[0.99826115,0.00045695543,0.0002005175,0.00026018173,0.00066588394,0.00015532257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032935056,0.00008220005,0.0001684346,0.00061147206,0.00014986879,0.00047081427,0.0008231121,0.0000435983,0.00008524885],"category_scores_gemma":[0.00018199324,0.000050364553,0.00017413514,0.000752169,0.00010511495,0.0009951501,0.000082022285,0.000198766,0.00008576074],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023612893,0.000070501956,0.000098520606,0.0000029977527,0.000039963095,0.000022214077,0.00056626345,0.000047902082,0.06834627,0.021915214,0.00045090538,0.9084156],"study_design_scores_gemma":[0.00013482,0.0007634017,0.0001254693,0.00025150133,0.000017259346,0.000048041675,0.0016216051,0.046233423,0.8775336,0.056213155,0.016789276,0.00026842856],"about_ca_topic_score_codex":0.0000040702816,"about_ca_topic_score_gemma":0.0000039214888,"teacher_disagreement_score":0.9610628,"about_ca_system_score_codex":0.00008668641,"about_ca_system_score_gemma":0.0001098643,"threshold_uncertainty_score":0.45400727},"labels":[],"label_agreement":null},{"id":"W2540405007","doi":"10.1613/jair.5128","title":"Optimal Partial-Order Plan Relaxation via MaxSAT","year":2016,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Flexibility (engineering); Computer science; Plan (archaeology); Encoding (memory); Mathematical optimization; Heuristic; Metric (unit); Order (exchange); Algorithm; Artificial intelligence; Mathematics; Operations management","score_opus":0.15473498814575595,"score_gpt":0.3874821599405522,"score_spread":0.23274717179479623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2540405007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041825157,0.00017808074,0.95116144,0.0058560995,0.0004874595,0.000095229465,0.000001300269,0.000029685634,0.00036552077],"genre_scores_gemma":[0.9473227,0.00010118823,0.05163166,0.000046854213,0.00054061995,0.000003894603,4.6038548e-7,0.000013030925,0.00033956696],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99677217,0.0004572205,0.0007355089,0.00026818452,0.0011726732,0.0005942505],"domain_scores_gemma":[0.9967875,0.0011435228,0.0003082879,0.00037262242,0.0011376189,0.00025044082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005630549,0.00012419868,0.00020348495,0.0004866753,0.00030964782,0.00026650523,0.001149724,0.000114140035,0.0001635284],"category_scores_gemma":[0.0010629824,0.00008137616,0.00009546232,0.00085611513,0.00016574573,0.0008745661,0.00018221025,0.00058409304,0.0004208913],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024274613,0.00016573913,0.00088378676,0.000017528942,0.000045210527,0.00022775712,0.0019084957,0.005662408,0.03800736,0.03771637,0.0026623192,0.91246027],"study_design_scores_gemma":[0.00025761442,0.003497135,0.00046428214,0.0010200884,0.000020648135,0.00060337747,0.0008099165,0.25075626,0.5826594,0.13542144,0.023732407,0.0007574083],"about_ca_topic_score_codex":0.00003376392,"about_ca_topic_score_gemma":0.0000074036466,"teacher_disagreement_score":0.9117029,"about_ca_system_score_codex":0.00011425217,"about_ca_system_score_gemma":0.0003721636,"threshold_uncertainty_score":0.54098463},"labels":[],"label_agreement":null},{"id":"W2548985425","doi":"10.1613/jair.4908","title":"Scrubbing During Learning In Real-time Heuristic Search","year":2016,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristic; Computer science; Incremental heuristic search; Bounded function; State (computer science); Computation; Simple (philosophy); Mathematical optimization; Data scrubbing; State space; Algorithm; Beam search; Search algorithm; Mathematics; Artificial intelligence","score_opus":0.12913082411398621,"score_gpt":0.39175393480266063,"score_spread":0.2626231106886744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548985425","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7889868,0.00018217452,0.2067495,0.0027114316,0.00019552693,0.00012874904,6.442266e-7,0.00005539081,0.0009897898],"genre_scores_gemma":[0.99160063,0.0002732486,0.007219475,0.0000063739863,0.0002638404,0.0000023993175,1.4776545e-7,0.000016019769,0.0006178908],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9956294,0.0009820184,0.00086254353,0.00033246443,0.001305607,0.00088799535],"domain_scores_gemma":[0.9961988,0.002218717,0.00025177145,0.00031902525,0.00075559487,0.00025613798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009739788,0.00013765982,0.0002859052,0.0012031144,0.00037254742,0.0003091594,0.0013137142,0.00010116745,0.00011511377],"category_scores_gemma":[0.0022895415,0.0000998285,0.00009832937,0.0013626779,0.00017004124,0.0007542946,0.000338756,0.0011843422,0.0003970015],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033363924,0.00021071488,0.011030624,0.00008387292,0.000036658552,0.0014993991,0.0049404786,0.015545367,0.49529356,0.012230114,0.00019847498,0.45859712],"study_design_scores_gemma":[0.0005350541,0.0029709511,0.009696319,0.006021819,0.000012495165,0.00077687285,0.0027500638,0.24370277,0.6631941,0.06845278,0.000738766,0.0011479851],"about_ca_topic_score_codex":0.0001303572,"about_ca_topic_score_gemma":0.00001253885,"teacher_disagreement_score":0.45744914,"about_ca_system_score_codex":0.0003008275,"about_ca_system_score_gemma":0.0005091258,"threshold_uncertainty_score":0.5145443},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.14234597261342796,"score_gpt":0.382805798384195,"score_spread":0.24045982577076702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W256842657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17983428,0.00023682123,0.81723505,0.0013193066,0.00014872637,0.00010187439,3.7056552e-7,0.000012557149,0.0011110438],"genre_scores_gemma":[0.984411,0.000111473775,0.0153736845,0.000009208809,0.000053326563,0.0000015993738,9.01411e-8,0.000005199523,0.000034392626],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731237,0.0005187082,0.0008452017,0.00022889364,0.0007734891,0.00032136723],"domain_scores_gemma":[0.9974067,0.0005864053,0.00026156407,0.0003571211,0.0012084708,0.00017969219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008166771,0.00009223441,0.00027030273,0.00034288585,0.00011455088,0.00013138031,0.00086829666,0.00009461852,0.000018047871],"category_scores_gemma":[0.0011969989,0.00007240948,0.0000749504,0.00079946994,0.00039294886,0.0004071852,0.00021029559,0.0006711581,0.000012386691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028798513,0.00021629556,0.00033521844,0.000059465496,0.000018676266,0.000005005416,0.0017281534,0.0008782649,0.01107477,0.27801332,0.000044593762,0.70759743],"study_design_scores_gemma":[0.000037498798,0.0009944633,0.0003288011,0.0001257961,0.000003980523,0.000059596437,0.00019780995,0.29287598,0.03152817,0.67363065,0.00012388048,0.00009335026],"about_ca_topic_score_codex":0.000043910975,"about_ca_topic_score_gemma":0.000008779103,"teacher_disagreement_score":0.80457675,"about_ca_system_score_codex":0.00003819533,"about_ca_system_score_gemma":0.0001956339,"threshold_uncertainty_score":0.29527727},"labels":[],"label_agreement":null},{"id":"W2576139645","doi":"10.1613/jair.5187","title":"Convergence of Iterative Scoring Rules","year":2016,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Microsoft Research","keywords":"Voting; Computer science; Convergence (economics); Social choice theory; Veto; Majority rule; Iterative and incremental development; Order (exchange); Aggregate (composite); Mathematical economics; Mathematical optimization; Mathematics; Artificial intelligence; Economics","score_opus":0.3029385508815912,"score_gpt":0.3929278465399769,"score_spread":0.0899892956583857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576139645","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93289274,0.0009046464,0.06152641,0.000590921,0.0007359217,0.00010716957,0.000023775608,0.000004988462,0.003213408],"genre_scores_gemma":[0.998506,0.00025481894,0.0004630317,0.0000054804505,0.00030149275,0.000001921471,1.0743134e-7,0.000009858399,0.0004572761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979412,0.00014948721,0.0012678949,0.00016615934,0.00016632762,0.0003089493],"domain_scores_gemma":[0.9978035,0.0007095098,0.0006421495,0.00019829794,0.0005422935,0.00010423416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007160239,0.000081172286,0.00036157938,0.000534904,0.00009159543,0.00004696596,0.00044706056,0.00006431526,0.0006970987],"category_scores_gemma":[0.0018743766,0.000060375332,0.00013351277,0.00035082546,0.00031225674,0.00033338988,0.000062142055,0.000250953,0.00067788985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015595973,0.00011131935,0.008551246,0.00004215546,0.000051800438,0.0000148079225,0.0016555334,0.000041594252,0.019883027,0.9468264,0.00009862858,0.022567522],"study_design_scores_gemma":[0.00007085726,0.000655829,0.0009883773,0.0005478309,0.0000028899535,0.000027994578,0.0015500364,0.00046385024,0.26648325,0.7271086,0.0019416896,0.00015881273],"about_ca_topic_score_codex":0.000045796543,"about_ca_topic_score_gemma":0.0000051585694,"teacher_disagreement_score":0.24660023,"about_ca_system_score_codex":0.000086697015,"about_ca_system_score_gemma":0.00006296147,"threshold_uncertainty_score":0.87131286},"labels":[],"label_agreement":null},{"id":"W2594446691","doi":"10.1613/jair.2890","title":"Predicting the Performance of IDA* using Conditional Distributions","year":2010,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Heuristic; Generalization; Null-move heuristic; Tree (set theory); Distribution (mathematics)","score_opus":0.159017779237055,"score_gpt":0.42872760505917656,"score_spread":0.26970982582212155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594446691","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58656424,0.000018783376,0.41233394,0.00076267304,0.00018442317,0.00005685218,0.000017549508,0.000004487702,0.00005707326],"genre_scores_gemma":[0.9648797,0.000021649974,0.034769148,0.0000065312593,0.00030602215,0.0000030667086,0.0000020555287,0.0000031562115,0.000008650673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835074,0.00008082106,0.00050135516,0.0001149154,0.0007175244,0.00023466801],"domain_scores_gemma":[0.99770623,0.00052340154,0.00023174615,0.0003295007,0.0011234428,0.00008569158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032009261,0.000054557077,0.0001020863,0.00015754331,0.0004994969,0.00015901886,0.0012498914,0.000040820843,0.000035916317],"category_scores_gemma":[0.000512138,0.000037516787,0.00006173891,0.0008058596,0.0004045167,0.0004891415,0.00020543636,0.0008048935,0.000014121187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023647175,0.00040863737,0.0027877712,0.00002490052,0.000048408154,0.000009856634,0.0013774725,0.0025902512,0.21964768,0.4978826,0.00045743422,0.27474132],"study_design_scores_gemma":[0.000015666545,0.0001669514,0.0013199848,0.00004138833,0.0000055808373,0.00014061248,0.00046705894,0.8216764,0.15758112,0.017772006,0.00075412914,0.000059143993],"about_ca_topic_score_codex":0.00004140543,"about_ca_topic_score_gemma":0.000011372247,"teacher_disagreement_score":0.81908613,"about_ca_system_score_codex":0.000028592836,"about_ca_system_score_gemma":0.00036688085,"threshold_uncertainty_score":0.38417765},"labels":[],"label_agreement":null},{"id":"W2602990746","doi":"10.1613/jair.5287","title":"Managing Different Sources of Uncertainty in a BDI Framework in a Principled Way with Tractable Fragments","year":2017,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Queen's University; Queen's University Belfast","keywords":"Computer science; Commensurability (mathematics); Implementation; Artificial intelligence; Semantics (computer science); Belief revision; Set (abstract data type); Theoretical computer science; Machine learning; Software engineering; Programming language; Mathematics","score_opus":0.1210226174125115,"score_gpt":0.3976935111396156,"score_spread":0.2766708937271041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2602990746","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9366569,0.00022526996,0.06029962,0.0008887658,0.0001651701,0.00021556627,4.0018128e-7,0.0000061340797,0.0015421961],"genre_scores_gemma":[0.99645364,0.00016950091,0.00316981,0.00000796349,0.00011076451,0.000007691176,9.310674e-8,0.000008934242,0.000071579256],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968009,0.00032686588,0.0007917368,0.00030115843,0.0011370645,0.0006422523],"domain_scores_gemma":[0.9974884,0.0006513882,0.00052675296,0.0006402517,0.00052184926,0.00017139727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003555155,0.00015340687,0.00045267865,0.0007199672,0.00027141024,0.00045967885,0.0023424383,0.00011068051,0.000042203716],"category_scores_gemma":[0.0013407577,0.00010484923,0.000090887785,0.00057006883,0.00030220312,0.00063615787,0.00045468213,0.0011849736,0.000011413333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017400788,0.004393495,0.26406962,0.00033826238,0.00017030285,0.0017214692,0.036432773,0.022600777,0.006284558,0.13458906,0.000037862024,0.52762175],"study_design_scores_gemma":[0.0006390996,0.0030842212,0.110687256,0.0051000253,0.000019213301,0.00009489145,0.0066622016,0.32161686,0.1399567,0.4112828,0.00016617012,0.00069053954],"about_ca_topic_score_codex":0.00040751495,"about_ca_topic_score_gemma":0.0010975082,"teacher_disagreement_score":0.5269312,"about_ca_system_score_codex":0.00021522929,"about_ca_system_score_gemma":0.00025939284,"threshold_uncertainty_score":0.51481867},"labels":[],"label_agreement":null},{"id":"W2737699254","doi":"10.1613/jair.5306","title":"Robots in Retirement Homes: Applying Off-the-Shelf Planning and Scheduling to a Team of Assistive Robots","year":2017,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Keck Institute for Space Studies; Natural Sciences and Engineering Research Council of Canada; Government of Canada; California Institute of Technology; Massachusetts Institute of Technology","keywords":"Computer science; Constraint programming; Scheduling (production processes); Automated planning and scheduling; Timeline; Robot; Solver; Constraint satisfaction; Operations research; Distributed computing; Mathematical optimization; Artificial intelligence; Programming language","score_opus":0.19464905447823935,"score_gpt":0.44034238049091196,"score_spread":0.2456933260126726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737699254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12691024,0.00025358915,0.86835235,0.0033413174,0.0002328562,0.00032753573,7.3320615e-7,0.0000060900165,0.00057530974],"genre_scores_gemma":[0.9594288,0.00010018724,0.040348977,0.000024115323,0.00006803563,0.0000074385543,9.108088e-8,0.000004839757,0.000017510269],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997994,0.00018096878,0.00060335494,0.00019700537,0.0007392049,0.00028546414],"domain_scores_gemma":[0.9982085,0.00038974403,0.00035442307,0.00032585644,0.0005865941,0.00013487785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00391376,0.00008556084,0.00020765868,0.00050766085,0.00046401695,0.00045636384,0.00080577057,0.00005116539,0.000010795614],"category_scores_gemma":[0.0015202655,0.00006735938,0.000049198992,0.00038572375,0.00021111552,0.0005260041,0.00032582393,0.0004972341,0.000005215164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012463822,0.00009087044,0.016987098,0.000028913639,0.000026911632,0.000044816235,0.00385809,0.16769335,0.0066358503,0.00977388,0.00004454393,0.794691],"study_design_scores_gemma":[0.00022284992,0.0009835041,0.11245522,0.001741539,0.00001302994,0.00009346867,0.0111224055,0.80840474,0.052951653,0.011318224,0.00032513484,0.00036823956],"about_ca_topic_score_codex":0.000069665904,"about_ca_topic_score_gemma":0.00008794104,"teacher_disagreement_score":0.8325186,"about_ca_system_score_codex":0.00011149396,"about_ca_system_score_gemma":0.00022487223,"threshold_uncertainty_score":0.4400727},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.49202711936732824,"score_gpt":0.5281472299857938,"score_spread":0.03612011061846554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754879180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028016062,0.00089895027,0.92830753,0.008870284,0.00075741415,0.032422516,0.000007447307,0.00003238358,0.00068739074],"genre_scores_gemma":[0.72156096,0.0024499423,0.23749515,0.00028589705,0.014444738,0.022401497,0.000019706795,0.00022555632,0.0011165865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9913915,0.0022887783,0.0019440417,0.0008708995,0.0026374743,0.00086735416],"domain_scores_gemma":[0.99311304,0.0015147041,0.0015199129,0.0009487123,0.0026492588,0.000254399],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.03811995,0.00034290698,0.00060558174,0.00050782115,0.0011658409,0.0035673347,0.0060819145,0.00031498907,0.00013450763],"category_scores_gemma":[0.0045937216,0.00025266895,0.00023720652,0.00047925208,0.00075925986,0.00089079305,0.0056330874,0.002619629,0.00006736234],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013812596,0.00011046908,0.00021442902,0.00020637792,0.00011104503,0.000010349765,0.005573101,0.039547093,0.0017674891,0.014782822,0.00046700652,0.9370717],"study_design_scores_gemma":[0.00003873285,0.0006111695,0.000082067774,0.0009582578,0.000029301578,0.000030394065,0.0008029807,0.62088555,0.021886542,0.34459877,0.009816111,0.00026010428],"about_ca_topic_score_codex":0.00010970743,"about_ca_topic_score_gemma":0.000012704727,"teacher_disagreement_score":0.93681157,"about_ca_system_score_codex":0.00048385482,"about_ca_system_score_gemma":0.0010537917,"threshold_uncertainty_score":0.99999255},"labels":[],"label_agreement":null},{"id":"W2759829967","doi":"10.1613/jair.5496","title":"Kernel Contraction and Base Dependence","year":2017,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Alberta; University of British Columbia","funders":"","keywords":"Belief revision; Intuition; Mathematics; Generalization; Contraction (grammar); Base (topology); Computer science; Artificial intelligence; Cognitive science; Psychology; Philosophy","score_opus":0.20579334039473401,"score_gpt":0.4328956141131965,"score_spread":0.22710227371846248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759829967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24426174,0.0010818864,0.7402972,0.0048301914,0.0014826693,0.00021180298,9.658112e-7,0.000025486634,0.0078080604],"genre_scores_gemma":[0.9946464,0.00050882646,0.0041458425,0.00001933642,0.00043648345,0.0000018812032,5.254711e-8,0.000005399003,0.00023578868],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791557,0.00021442959,0.00042478862,0.00024096922,0.000803192,0.00040107445],"domain_scores_gemma":[0.9971947,0.0005197458,0.00034835364,0.00053168106,0.0011388605,0.00026664516],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004773726,0.00009624077,0.00019542524,0.00024863952,0.0009315313,0.0012746305,0.0016030133,0.00008587791,0.00004144494],"category_scores_gemma":[0.0030617733,0.00007508593,0.00007764743,0.00016074299,0.00038192017,0.0014739374,0.00037829153,0.00070979923,0.000110314075],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001079748,0.00020742022,0.0021095027,0.000019752899,0.000026952623,0.00039034494,0.0013272484,0.000036572997,0.0126677165,0.19863941,0.0005361627,0.78393096],"study_design_scores_gemma":[0.00023399349,0.0018009361,0.01786634,0.0003303975,0.00002157155,0.0011029165,0.0020711552,0.1326633,0.29915252,0.53967744,0.0045497944,0.00052961544],"about_ca_topic_score_codex":0.00013800724,"about_ca_topic_score_gemma":0.000115194714,"teacher_disagreement_score":0.7834013,"about_ca_system_score_codex":0.000072159455,"about_ca_system_score_gemma":0.0002783254,"threshold_uncertainty_score":0.9997621},"labels":[],"label_agreement":null},{"id":"W2760195126","doi":"10.1613/jair.1.11478","title":"On Overfitting and Asymptotic Bias in Batch Reinforcement Learning with Partial Observability","year":2019,"lang":"en","type":"preprint","venue":"Journal of Artificial Intelligence Research","topic":"Smart Grid Energy Management","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Samsung; Institut de Valorisation des Données; Waalse Gewest","keywords":"Overfitting; Observability; Reinforcement learning; Observable; Context (archaeology); Representation (politics); Computer science; Partially observable Markov decision process; Mathematics; Artificial intelligence; Mathematical optimization; Machine learning; Applied mathematics; Artificial neural network; Markov chain","score_opus":0.17795176204256294,"score_gpt":0.3636504415212668,"score_spread":0.18569867947870386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760195126","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9687118,0.00020606304,0.028276486,0.00022328125,0.0009309433,0.00043483434,7.054676e-7,0.000032161162,0.0011837339],"genre_scores_gemma":[0.998395,0.0005529851,0.00052627997,0.000009959233,0.00037922952,0.000017328486,0.000002423935,0.00004857258,0.00006821288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959942,0.00039754622,0.0011414881,0.00036793802,0.0014377552,0.00066103437],"domain_scores_gemma":[0.9978883,0.0008967522,0.00023365984,0.0004211747,0.00038812243,0.00017193587],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0062451796,0.0002920459,0.000544154,0.0007931626,0.00008957107,0.00026354217,0.00047351408,0.00021332879,0.0000891049],"category_scores_gemma":[0.0010583363,0.00025080665,0.000101616024,0.00047910432,0.00014472056,0.00016930244,0.00048511373,0.0035508936,0.00003879971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029961037,0.000059376333,0.0037691586,0.00036099672,0.0000926962,0.0000741755,0.00067470426,0.98003775,0.00015985587,0.0011527018,0.00006447169,0.01325452],"study_design_scores_gemma":[0.00010702099,0.0011444797,0.0022639036,0.0016980639,0.000023201215,0.000009981639,0.0013798631,0.98006845,0.0086259805,0.003841248,0.000486025,0.00035175876],"about_ca_topic_score_codex":0.0002029948,"about_ca_topic_score_gemma":0.00009668822,"teacher_disagreement_score":0.029683217,"about_ca_system_score_codex":0.0006913983,"about_ca_system_score_gemma":0.00020660824,"threshold_uncertainty_score":0.9999944},"labels":[],"label_agreement":null},{"id":"W2767967947","doi":"10.1613/jair.5521","title":"Trust as a Precursor to Belief Revision","year":2018,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Access Control and Trust","field":"Social Sciences","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"British Columbia Institute of Technology","funders":"","keywords":"Belief revision; Class (philosophy); Partition (number theory); Computer science; Set (abstract data type); Representation (politics); Domain (mathematical analysis); Artificial intelligence; Mathematics; Political science","score_opus":0.20445393727733624,"score_gpt":0.518133020768067,"score_spread":0.31367908349073076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767967947","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7683447,0.000916871,0.023189923,0.046366204,0.0026265078,0.0012396376,0.0000054917255,0.00005474749,0.15725593],"genre_scores_gemma":[0.9925605,0.0003253203,0.0009840628,0.00018853798,0.0040691555,0.000003821424,1.4742393e-7,0.000012298792,0.0018561681],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99586785,0.0006570139,0.0006473613,0.00021289497,0.0019353316,0.0006795384],"domain_scores_gemma":[0.995422,0.0005727496,0.00017915717,0.00021158309,0.0030686446,0.00054583215],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.009057319,0.00009822613,0.0002457676,0.0005499901,0.0010498812,0.0004083306,0.0010013129,0.00012139836,0.0023459676],"category_scores_gemma":[0.0070882468,0.00007902204,0.00012911175,0.0014782815,0.00078893395,0.00048469935,0.00013664512,0.00058024423,0.0028825917],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006395269,0.00021410004,0.0002722841,0.000007918791,0.000027421103,0.000053311367,0.016393382,0.000014134813,0.0020868394,0.10909716,0.005921639,0.8652723],"study_design_scores_gemma":[0.00009742171,0.00437075,0.00038288833,0.0004189809,0.000026805536,0.00002574166,0.034805406,0.00042499116,0.043333188,0.17093134,0.7448279,0.00035457461],"about_ca_topic_score_codex":0.0010344707,"about_ca_topic_score_gemma":0.0010663706,"teacher_disagreement_score":0.8649177,"about_ca_system_score_codex":0.00019577873,"about_ca_system_score_gemma":0.0008010633,"threshold_uncertainty_score":0.99856603},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","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","score_opus":0.41054957748030213,"score_gpt":0.48030359708273684,"score_spread":0.06975401960243471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2778562959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17208348,0.0018176915,0.7877062,0.0025121463,0.0023104316,0.00032130137,0.0000036478757,0.000028325378,0.033216752],"genre_scores_gemma":[0.9889829,0.00015173109,0.009757167,0.000007901499,0.0006409513,0.0000024887222,9.27685e-8,0.0000101104115,0.00044663067],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9970733,0.00024309117,0.0008632033,0.00025543154,0.0009779854,0.00058697426],"domain_scores_gemma":[0.9946392,0.000681184,0.0007277282,0.00087346794,0.0028559759,0.0002224282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075551756,0.00013388792,0.0003611258,0.0004979016,0.0007794438,0.0006548726,0.0039686067,0.00011089823,0.000054716736],"category_scores_gemma":[0.0043374486,0.00010363205,0.0002225141,0.0004157458,0.00046848357,0.0011263926,0.0008984867,0.0007576357,0.00014318225],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070072056,0.00044993343,0.0012014393,0.000066284236,0.000050608094,0.000082618484,0.0050222175,0.000041166753,0.013874414,0.2413326,0.0013332211,0.7364754],"study_design_scores_gemma":[0.00017651629,0.0015490232,0.005422757,0.0006663657,0.000019506642,0.00018672177,0.0024359375,0.053691003,0.6115654,0.31497353,0.0088535575,0.00045964404],"about_ca_topic_score_codex":0.000096665455,"about_ca_topic_score_gemma":0.00012127054,"teacher_disagreement_score":0.8168994,"about_ca_system_score_codex":0.00011977398,"about_ca_system_score_gemma":0.0007604454,"threshold_uncertainty_score":0.7374725},"labels":[],"label_agreement":null},{"id":"W2817967199","doi":"10.1613/jair.1.12463","title":"The Bottleneck Simulator: A Model-Based Deep Reinforcement Learning Approach","year":2020,"lang":"en","type":"preprint","venue":"Journal of Artificial Intelligence Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Montréal; Polytechnique Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Compute Canada; Amazon Web Services; Nuance Foundation; Canadian Institute for Advanced Research; Nvidia","keywords":"Bottleneck; Reinforcement learning; Computer science; Variance (accounting); Task (project management); Obstacle; Artificial intelligence; State space; Engineering; Statistics; Mathematics","score_opus":0.20092186190179046,"score_gpt":0.4031124373316161,"score_spread":0.20219057542982566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2817967199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002832109,0.0005037952,0.9930928,0.003199608,0.0007393008,0.0005903254,3.4606236e-7,0.00006689233,0.0015237649],"genre_scores_gemma":[0.94157094,0.0005029519,0.056825433,0.00010666084,0.00063136395,0.00002669632,0.0000047623003,0.000050873266,0.0002803302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.990688,0.0010843669,0.0021119455,0.0006830533,0.004277774,0.0011548391],"domain_scores_gemma":[0.99260604,0.0017150459,0.0013387686,0.0012869543,0.002542421,0.00051076506],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.009576301,0.00042622758,0.00064780744,0.00064825284,0.0011144198,0.002265962,0.0063873534,0.0003762155,0.000018316354],"category_scores_gemma":[0.003551013,0.0003169867,0.0005456689,0.0010744453,0.00048928644,0.00038523393,0.0031347235,0.0073863952,0.00011111245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012239406,0.000056888824,0.000011370955,0.00011185782,0.00009779144,0.00003567083,0.0013947341,0.9499118,0.00022087057,0.024967832,0.00024108854,0.022827715],"study_design_scores_gemma":[0.000049030084,0.00058452855,0.0000013726246,0.00017309275,0.000019743964,0.000008514786,0.00048641616,0.9741672,0.0027465639,0.020302016,0.0011707651,0.00029070777],"about_ca_topic_score_codex":0.000018550885,"about_ca_topic_score_gemma":0.0000027128701,"teacher_disagreement_score":0.9412877,"about_ca_system_score_codex":0.00062920107,"about_ca_system_score_gemma":0.0024227023,"threshold_uncertainty_score":0.99992824},"labels":[],"label_agreement":null},{"id":"W2884092934","doi":"10.1613/jair.1.12105","title":"General Value Function Networks","year":2021,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alberta Machine Intelligence Institute; Institut de Valorisation des Données; Compute Canada; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Recurrent neural network; Computer science; Function (biology); Truncation (statistics); State (computer science); Observable; Artificial intelligence; Construct (python library); Domain (mathematical analysis); Machine learning; Algorithm; Artificial neural network; Mathematics","score_opus":0.17378483023513694,"score_gpt":0.41161470207466855,"score_spread":0.2378298718395316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884092934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008458901,0.00081426033,0.9844244,0.0016963304,0.002710748,0.00004711763,1.2720618e-7,0.000018511844,0.001829603],"genre_scores_gemma":[0.96165395,0.00044085085,0.031800278,0.00035823436,0.0040478758,0.0000028855525,0.0000011199509,0.000016276053,0.0016785318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968963,0.00066576386,0.0005856759,0.00022129212,0.0012063407,0.00042459083],"domain_scores_gemma":[0.9970327,0.00040546843,0.00016966193,0.0002903167,0.001885565,0.00021630313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042239833,0.00008607807,0.0001693769,0.0003162117,0.00029340293,0.0005362507,0.0006597702,0.0000908417,0.00017476974],"category_scores_gemma":[0.00067084155,0.000077813456,0.0001343202,0.001405301,0.00009819981,0.0005789847,0.00019366902,0.0010211177,0.00013473388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006261618,0.00013760444,0.000064108026,0.0000058470255,0.000033542045,0.00019739117,0.00057519594,0.07556501,0.009679525,0.42106214,0.0025522008,0.4900648],"study_design_scores_gemma":[0.00005721169,0.000491923,0.00030642972,0.000061983475,0.0000072323032,0.0002209656,0.0013899796,0.8624622,0.03454672,0.07393416,0.026345436,0.00017572363],"about_ca_topic_score_codex":0.000012909879,"about_ca_topic_score_gemma":0.000008733966,"teacher_disagreement_score":0.95319504,"about_ca_system_score_codex":0.00009553241,"about_ca_system_score_gemma":0.0004819508,"threshold_uncertainty_score":0.5171078},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.15032975293862594,"score_gpt":0.4297375410971567,"score_spread":0.27940778815853073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902729397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028658245,0.00007677845,0.96916276,0.00046251036,0.00044229568,0.00025943483,5.0301512e-8,0.000017163791,0.00092076766],"genre_scores_gemma":[0.9842557,0.000057663743,0.014801483,0.000035863344,0.00053203077,0.000008064632,4.8750303e-7,0.000013971968,0.00029479116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968134,0.0002717424,0.00091277604,0.0002266861,0.0010820848,0.00069331436],"domain_scores_gemma":[0.9976851,0.0007932528,0.00013697406,0.00026787378,0.0009700863,0.00014673245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067849164,0.0001218318,0.00023680703,0.0009064999,0.0003003027,0.0003595669,0.0012197223,0.00008679832,0.000083514584],"category_scores_gemma":[0.0014432075,0.00010873279,0.000121697485,0.0010851932,0.00020037443,0.000704085,0.0001497349,0.00087130733,0.00007713437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026246632,0.000088997076,0.00029001271,0.000058760117,0.000041356903,0.00007738389,0.0215409,0.64706117,0.01701873,0.11281687,0.00007751374,0.20066582],"study_design_scores_gemma":[0.00010186643,0.0020641594,0.000049279464,0.00013733759,0.0000039044,0.000025206738,0.004052348,0.92315626,0.06543958,0.0036480378,0.0011741504,0.00014784792],"about_ca_topic_score_codex":0.000036532798,"about_ca_topic_score_gemma":0.000044336197,"teacher_disagreement_score":0.9555974,"about_ca_system_score_codex":0.000260527,"about_ca_system_score_gemma":0.00020379259,"threshold_uncertainty_score":0.44339946},"labels":[],"label_agreement":null},{"id":"W2911930742","doi":"10.1613/jair.1.11337","title":"A Generalisation of AGM Contraction and Revision to Fragments of First-Order Logic","year":2019,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Griffith University","keywords":"Contraction (grammar); Logical equivalence; Propositional calculus; Horn clause; Classical logic; Mathematics; Non-monotonic logic; Many-valued logic; Intermediate logic; Equivalence (formal languages); Substructural logic; Expressive power; Description logic; Algorithm; Computer science; Discrete mathematics; Theoretical computer science; Prolog; Linguistics; Philosophy","score_opus":0.1294825634957763,"score_gpt":0.4023719552677477,"score_spread":0.2728893917719714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911930742","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6901786,0.00041048994,0.3072988,0.00091375824,0.00035287425,0.00025009355,6.7839625e-7,0.000004231261,0.0005905101],"genre_scores_gemma":[0.99029493,0.00037987644,0.009098165,0.000020484433,0.000109760054,0.0000011638956,2.334839e-7,0.000004232096,0.00009117628],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99798113,0.00021931849,0.00063116156,0.00018101204,0.0007609433,0.0002264352],"domain_scores_gemma":[0.9971669,0.00041031957,0.00032778233,0.0002351733,0.0017381218,0.00012172822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030595488,0.000077342964,0.00025557016,0.00041708615,0.00008413898,0.000076310855,0.0004788475,0.00007276034,0.000083770894],"category_scores_gemma":[0.00095158734,0.000059036356,0.000066175766,0.00072626903,0.00008180454,0.00041033755,0.00016077398,0.0002627237,0.000041449788],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006665458,0.0009372233,0.013297455,0.00035347074,0.000094843126,0.000029699891,0.010884862,0.004939908,0.22406143,0.15441105,0.0011099442,0.58921355],"study_design_scores_gemma":[0.0004155023,0.00781613,0.0099618025,0.0013672065,0.000029887407,0.00010988037,0.003219246,0.1974059,0.6516856,0.12159899,0.005900092,0.00048975303],"about_ca_topic_score_codex":0.000085990716,"about_ca_topic_score_gemma":0.000031024763,"teacher_disagreement_score":0.5887238,"about_ca_system_score_codex":0.000064368534,"about_ca_system_score_gemma":0.0001171232,"threshold_uncertainty_score":0.24074328},"labels":[],"label_agreement":null},{"id":"W2915727719","doi":"10.1613/jair.1.11361","title":"Level-0 Models for Predicting Human Behavior in Games","year":2019,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Sports Analytics and Performance","field":"Economics, Econometrics and Finance","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Microsoft Research","keywords":"Computer science; Weighting; Hierarchy; Action (physics); Game theory; Variance (accounting); Artificial intelligence; Construct (python library); Mathematical economics; Mathematics","score_opus":0.44269047371389897,"score_gpt":0.42565197131245536,"score_spread":0.01703850240144361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915727719","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98373663,0.0005499828,0.012494128,0.00024320888,0.0003577684,0.00032549718,0.000027029404,0.0000032778537,0.0022624992],"genre_scores_gemma":[0.9983213,0.00025583303,0.00051689864,0.000015617148,0.00026772654,0.000013200644,0.0000017798855,0.000016936485,0.00059070875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998005,0.000016031778,0.0011965603,0.00020828079,0.00016179233,0.00041238472],"domain_scores_gemma":[0.99885356,0.00014710354,0.0003793242,0.00019723705,0.0003327137,0.00009002766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047042873,0.000087773326,0.0003487885,0.0008620829,0.00010561689,0.00012289011,0.00037712784,0.00008842959,0.0004580444],"category_scores_gemma":[0.00016082567,0.000088431036,0.00015036299,0.00040910396,0.000068860616,0.00041210253,0.000049514703,0.0004854505,0.0001032527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002260744,0.00060887996,0.27395946,0.00009524715,0.000051714025,0.000031252745,0.0020768368,0.04323877,0.0012552743,0.6492605,0.00035379996,0.028842172],"study_design_scores_gemma":[0.00021090255,0.0013111738,0.016665427,0.0001706979,0.0000062491563,0.000018179173,0.0024134964,0.50225765,0.004722034,0.46719083,0.0047003548,0.0003330239],"about_ca_topic_score_codex":0.00026271015,"about_ca_topic_score_gemma":0.00012556493,"teacher_disagreement_score":0.4590189,"about_ca_system_score_codex":0.00013988372,"about_ca_system_score_gemma":0.00007107183,"threshold_uncertainty_score":0.50152653},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.20964206851014752,"score_gpt":0.4311779567163518,"score_spread":0.22153588820620426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2924816077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36278734,0.00010050133,0.6362987,0.00030767152,0.00013210576,0.000106173626,5.580359e-8,0.000009727021,0.0002577418],"genre_scores_gemma":[0.9662137,0.00016058079,0.033509724,0.000016236843,0.00005124862,0.0000013794031,1.1066834e-7,0.000007967464,0.00003903439],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978803,0.00017102473,0.0005053427,0.00018438071,0.000822575,0.00043638007],"domain_scores_gemma":[0.9987199,0.00030542834,0.00011269359,0.00022550022,0.0005032152,0.00013330425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018558255,0.000088824876,0.00018916817,0.0005993817,0.000113842994,0.00032907902,0.00058448134,0.00005387374,0.000025271758],"category_scores_gemma":[0.00022947647,0.00007097164,0.000033416298,0.00079452427,0.000057580277,0.00069117954,0.00014941422,0.0008143232,0.000034851117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080288046,0.000036098427,0.0027333284,0.000014194178,0.000014638573,0.000063933585,0.0021579328,0.97746897,0.0014558723,0.009273256,0.00000569837,0.006695802],"study_design_scores_gemma":[0.00006661425,0.00036394031,0.00018003826,0.00017279711,0.0000020491366,0.00007099236,0.0016895753,0.99303955,0.0019521796,0.002272105,0.000105936684,0.00008421562],"about_ca_topic_score_codex":0.000044577468,"about_ca_topic_score_gemma":0.000012790404,"teacher_disagreement_score":0.6034264,"about_ca_system_score_codex":0.00012291558,"about_ca_system_score_gemma":0.00023613962,"threshold_uncertainty_score":0.35378742},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Graph; Theoretical computer science; Data science","score_opus":0.2937579756576601,"score_gpt":0.4530306973098932,"score_spread":0.1592727216522331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942315111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059329897,0.0014847753,0.936141,0.0016016816,0.00096452096,0.0000914292,0.0000019643035,0.000024961455,0.00035974357],"genre_scores_gemma":[0.96978205,0.00091896503,0.028642768,0.00011109941,0.0003663133,0.0000024792387,8.875746e-7,0.000015208375,0.00016025337],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954671,0.0012297417,0.00082410686,0.00034506587,0.0014729406,0.0006610096],"domain_scores_gemma":[0.9936244,0.0018259643,0.00023073702,0.0005942302,0.0034167636,0.00030790313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005932336,0.00013130631,0.00029232373,0.0005245474,0.00024718078,0.00040113588,0.0016731912,0.0000953419,0.000072476134],"category_scores_gemma":[0.0024172936,0.00011376804,0.00019528136,0.0038840226,0.0002445156,0.00081787654,0.0004490283,0.0012522106,0.00009820436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019109604,0.00063070154,0.0021830015,0.00002463211,0.00010331111,0.0027953887,0.001025244,0.008257848,0.023881325,0.17598864,0.003962173,0.7809566],"study_design_scores_gemma":[0.00007061201,0.00073600997,0.0033807813,0.00016380758,0.0000060689545,0.0007620552,0.00070636364,0.030561144,0.28168735,0.6793451,0.0022101146,0.0003706135],"about_ca_topic_score_codex":0.000031824227,"about_ca_topic_score_gemma":0.00014895975,"teacher_disagreement_score":0.9104521,"about_ca_system_score_codex":0.00007678657,"about_ca_system_score_gemma":0.00050692214,"threshold_uncertainty_score":0.54403013},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS","keywords":"Computer science; Algorithm; Artificial intelligence","score_opus":0.13179899937845035,"score_gpt":0.43309781396368274,"score_spread":0.3012988145852324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950680102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006466527,0.000058693076,0.98937416,0.0031543614,0.0003754575,0.000127318,4.5530112e-7,0.000041301842,0.00040169933],"genre_scores_gemma":[0.7044448,0.00009123165,0.2950411,0.00013210559,0.00026637298,0.0000012720097,6.720128e-7,0.000004098448,0.000018308147],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974569,0.00037881732,0.00067554764,0.00018789757,0.0009853191,0.00031553878],"domain_scores_gemma":[0.9977697,0.00036220616,0.00022099205,0.00030853128,0.0011173037,0.00022126186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002695411,0.000093840885,0.00017200992,0.00051036954,0.00024118823,0.00055955333,0.00069289265,0.000105619365,0.00021520023],"category_scores_gemma":[0.00069983315,0.00008234097,0.00007489429,0.0009714768,0.00010691856,0.0012857876,0.000028599256,0.00064890576,0.000095776835],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072336425,0.000105951134,0.0000071972336,0.0000018572133,0.0000054138955,0.000025043566,0.0008360335,0.0016532827,0.00083429203,0.09942779,0.00006404477,0.89703184],"study_design_scores_gemma":[0.000019991923,0.00074337394,0.00056951947,0.000058839385,0.0000027423837,0.00008036155,0.0006867655,0.7412845,0.012791139,0.2435119,0.00015359254,0.00009727454],"about_ca_topic_score_codex":0.00000784536,"about_ca_topic_score_gemma":0.0000044904664,"teacher_disagreement_score":0.89693457,"about_ca_system_score_codex":0.000102983315,"about_ca_system_score_gemma":0.00031202912,"threshold_uncertainty_score":0.53957856},"labels":[],"label_agreement":null},{"id":"W2967250176","doi":"10.1613/jair.1.11635","title":"Autonomous Target Search with Multiple Coordinated UAVs","year":2019,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Royal Holloway, University of London; Engineering and Physical Sciences Research Council; Massachusetts Institute of Technology","keywords":"Submodular set function; Computer science; Greedy algorithm; Exploit; Scalability; Mathematical optimization; Constraint (computer-aided design); Heuristic; Limit (mathematics); Greedy randomized adaptive search procedure; Property (philosophy); Artificial intelligence; Algorithm; Mathematics","score_opus":0.07474897448577872,"score_gpt":0.35415188283743887,"score_spread":0.27940290835166015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967250176","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11149906,0.00004916711,0.8843252,0.0020643263,0.00034574926,0.00026619533,0.0000012306948,0.00003265559,0.0014164174],"genre_scores_gemma":[0.9498043,0.000031412146,0.04973138,0.000031715423,0.00008780883,0.0000020844093,7.2743495e-7,0.000010145379,0.00030042615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740344,0.00030749993,0.0005214972,0.00025191993,0.0010591834,0.00045644792],"domain_scores_gemma":[0.99699676,0.0005175643,0.00015387034,0.00033795115,0.0017788344,0.00021501163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027535239,0.000109894616,0.00021615614,0.00066909235,0.0001801228,0.00035899263,0.000834075,0.000076157165,0.00052174926],"category_scores_gemma":[0.00026288003,0.00008522745,0.000074869444,0.0013403732,0.00016901604,0.0007856794,0.00014374706,0.00077976094,0.00040913754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063856016,0.0005488784,0.0216779,0.00005898705,0.00013109886,0.00032638226,0.0037728667,0.17843701,0.022675095,0.08387392,0.00060723786,0.68725204],"study_design_scores_gemma":[0.00018199022,0.0015592726,0.0019028354,0.00010442617,0.0000039547836,0.00029563467,0.0019675458,0.89027697,0.096232556,0.0055246213,0.0016997178,0.00025047964],"about_ca_topic_score_codex":0.00005541185,"about_ca_topic_score_gemma":0.000026792937,"teacher_disagreement_score":0.83830523,"about_ca_system_score_codex":0.00016767885,"about_ca_system_score_gemma":0.00070505036,"threshold_uncertainty_score":0.57127887},"labels":[],"label_agreement":null},{"id":"W2972724272","doi":"10.1613/jair.1.11487","title":"From Support Propagation to Belief Propagation in Constraint Programming","year":2019,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Arity; Solver; Computer science; Local consistency; Belief propagation; Constraint (computer-aided design); Constraint programming; Inference; Mathematical optimization; Convergence (economics); Theoretical computer science; Variable (mathematics); Constraint logic programming; Boolean data type; Constraint satisfaction; Algorithm; Mathematics; Artificial intelligence; Stochastic programming; Discrete mathematics","score_opus":0.08579345085781687,"score_gpt":0.3838650013356858,"score_spread":0.29807155047786893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972724272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19820906,0.0000110474975,0.79688275,0.003300307,0.0004661659,0.0006518352,0.0000012160323,0.000020044334,0.00045755756],"genre_scores_gemma":[0.9521128,0.000012795817,0.04760198,0.00004891413,0.00015341985,0.000010063988,0.0000021709068,0.000006954919,0.000050898758],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972983,0.00026042428,0.00080936524,0.00027541598,0.0010032333,0.00035326977],"domain_scores_gemma":[0.998109,0.00024986558,0.00021334126,0.0002448701,0.0010111033,0.00017182715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032041713,0.00009784304,0.00019107047,0.00083746546,0.000081786086,0.0003520946,0.00052825134,0.00007788459,0.00029395678],"category_scores_gemma":[0.00055366097,0.00008846561,0.00006061448,0.0013269923,0.00008182457,0.0008213199,0.000110586625,0.00052169623,0.00035084548],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006256281,0.0001350209,0.0015148752,0.000011316788,0.0000086694,0.000031967378,0.0031965552,0.005850549,0.016341195,0.019226896,0.00005379315,0.9535666],"study_design_scores_gemma":[0.00048892107,0.004598605,0.01018512,0.00091502967,0.000013433358,0.00021865747,0.015091013,0.54909897,0.34814948,0.06531841,0.005001518,0.0009208529],"about_ca_topic_score_codex":0.000096455195,"about_ca_topic_score_gemma":0.0001179096,"teacher_disagreement_score":0.9526457,"about_ca_system_score_codex":0.00024707956,"about_ca_system_score_gemma":0.0005877,"threshold_uncertainty_score":0.4509526},"labels":[],"label_agreement":null},{"id":"W3011683765","doi":"10.1613/jair.1.11659","title":"Solving Delete Free Planning with Relaxed Decision Diagram Based Heuristics","year":2020,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Binary decision diagram; Computer science; Leverage (statistics); Task (project management); Heuristic; Representation (politics); Mathematical optimization; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.19278465288359,"score_gpt":0.3880335451590027,"score_spread":0.19524889227541267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011683765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03021815,0.0004755991,0.96394885,0.0047411416,0.00020592827,0.00013467178,0.000002442443,0.000051301762,0.00022192115],"genre_scores_gemma":[0.7827076,0.000023930355,0.2166831,0.00020761468,0.00034823266,0.000002398,7.312487e-7,0.000018735807,0.000007669335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99583757,0.0003937468,0.000854191,0.00037972743,0.0018458165,0.00068896357],"domain_scores_gemma":[0.99437386,0.0030009325,0.0003519157,0.0005050061,0.0012459424,0.0005223196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041449196,0.00018909405,0.00033723132,0.00043973222,0.00049765577,0.00063236535,0.0022316675,0.000118043594,0.000035096356],"category_scores_gemma":[0.0042825104,0.00014711982,0.00011726256,0.0015486609,0.00016135274,0.0005553955,0.00032972172,0.0016032071,0.000057625588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016471426,0.00028663262,0.00597448,0.00014449554,0.00010312648,0.003534084,0.008422214,0.34011626,0.0064761327,0.013545262,0.011413755,0.6083364],"study_design_scores_gemma":[0.0001438913,0.002469205,0.00015117356,0.00076494575,0.000012453318,0.00007332097,0.00059180305,0.95494974,0.021227514,0.01783551,0.001502096,0.00027837796],"about_ca_topic_score_codex":0.000024838138,"about_ca_topic_score_gemma":0.0000073899223,"teacher_disagreement_score":0.75248945,"about_ca_system_score_codex":0.000097401884,"about_ca_system_score_gemma":0.0007357866,"threshold_uncertainty_score":0.6965226},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.36177844501793327,"score_gpt":0.47704107015659264,"score_spread":0.11526262513865937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013772641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07475907,0.0015395497,0.5484348,0.37263712,0.00032251846,0.0017539096,0.000026552554,0.00006491874,0.00046158207],"genre_scores_gemma":[0.98702013,0.0010098804,0.0021152238,0.008074558,0.0016677165,0.0000435523,0.0000052692703,0.000038902843,0.000024781768],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9948307,0.00047777581,0.0017750264,0.00041196131,0.0018935231,0.0006109605],"domain_scores_gemma":[0.99263316,0.0033952566,0.0005929131,0.00057617365,0.0019322289,0.0008702387],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.005337292,0.00021621175,0.0005938638,0.00076930365,0.00045000398,0.0001448822,0.0010233235,0.0001643882,0.00049314176],"category_scores_gemma":[0.009598647,0.00015909986,0.00035259893,0.0032351995,0.0008610089,0.00016813428,0.0002598646,0.0016179909,0.00022275245],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020409739,0.0016108877,0.0014816122,0.0010951507,0.00036147702,0.0003838924,0.018841632,0.019369636,0.10589705,0.019723957,0.016897855,0.81229585],"study_design_scores_gemma":[0.00029127928,0.0048887907,0.00047173267,0.0012753136,0.0002768728,0.00033854123,0.09337025,0.13135964,0.4370712,0.06382374,0.26592603,0.00090660085],"about_ca_topic_score_codex":0.00008858205,"about_ca_topic_score_gemma":0.00003718227,"teacher_disagreement_score":0.91226107,"about_ca_system_score_codex":0.0003103053,"about_ca_system_score_gemma":0.0023524086,"threshold_uncertainty_score":0.99874395},"labels":[],"label_agreement":null},{"id":"W3043595943","doi":"10.1613/jair.1.11829","title":"Scalable Planning with Deep Neural Network Learned Transition Models","year":2020,"lang":"en","type":"preprint","venue":"Journal of Artificial Intelligence Research","topic":"Reservoir Engineering and Simulation Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Vector Institute; University of Toronto; Monash University","keywords":"Computer science; Deep learning; Leverage (statistics); Artificial intelligence; Artificial neural network; Scalability; Recurrent neural network; Planner; Mathematical optimization; Machine learning; Mathematics","score_opus":0.2785612983419177,"score_gpt":0.4209875949174548,"score_spread":0.14242629657553713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043595943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08958402,0.0015553857,0.9070055,0.0006164652,0.00054090866,0.00021139337,0.0000027981255,0.00009388143,0.0003896498],"genre_scores_gemma":[0.94556504,0.00030403334,0.052574977,0.000011019494,0.0014401737,0.000009477221,0.0000065104196,0.00007735836,0.000011393614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967134,0.00036814003,0.0008822412,0.00026239728,0.0011556575,0.000618169],"domain_scores_gemma":[0.9981247,0.00043472686,0.00012973882,0.0002851229,0.00070533727,0.00032037625],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0028259503,0.00026684644,0.00054639037,0.0004286943,0.00014093844,0.00032169654,0.0005761137,0.0002955591,0.00004401911],"category_scores_gemma":[0.00018330522,0.00023426165,0.0001840663,0.00072518946,0.00008102032,0.00028952232,0.00010631375,0.00365907,0.000013395104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027584034,0.000018873297,0.000009393181,0.00023600308,0.00010423828,0.00013508393,0.0014334056,0.9795134,0.00052211474,0.00030481885,0.00016280859,0.017283997],"study_design_scores_gemma":[0.000043818498,0.00022129693,0.000008521021,0.000408396,0.0000224823,0.000025405196,0.0005950912,0.96071583,0.0024018183,0.035260107,0.00008381698,0.00021343521],"about_ca_topic_score_codex":0.000014942505,"about_ca_topic_score_gemma":0.000005667419,"teacher_disagreement_score":0.85598105,"about_ca_system_score_codex":0.00016849149,"about_ca_system_score_gemma":0.00013283911,"threshold_uncertainty_score":0.9986395},"labels":[],"label_agreement":null},{"id":"W3091006519","doi":"10.1613/jair.1.12531","title":"MADRaS : Multi Agent Driving Simulator","year":2021,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Autonomous Vehicle Technology and Safety","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Microsoft (Canada); University of Alberta","funders":"Indian Institute of Technology Kharagpur; Eidgenössische Technische Hochschule Zürich","keywords":"Reinforcement learning; Computer science; Variety (cybernetics); Simulation; Track (disk drive); Interface (matter); Driving simulator; Generalization; Artificial intelligence; Operating system","score_opus":0.13556367506213882,"score_gpt":0.3935038671666261,"score_spread":0.25794019210448726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091006519","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8179413,0.0016127568,0.17824611,0.00072581344,0.0006508996,0.00009457984,0.0000017148035,0.00009623581,0.0006305869],"genre_scores_gemma":[0.9957659,0.00065187516,0.003183203,0.000012318096,0.00021619382,0.0000018130369,4.3839108e-7,0.00002233328,0.00014592358],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982003,0.00012424089,0.0006208255,0.00013271277,0.0004681049,0.00045381955],"domain_scores_gemma":[0.99865854,0.0002577576,0.00005823214,0.00024094994,0.0006327175,0.00015180801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016068808,0.000105509454,0.00022765323,0.00030264558,0.00016440389,0.0000631547,0.00035931636,0.00016900881,0.00039937272],"category_scores_gemma":[0.0006232449,0.0001003371,0.00012487412,0.0006078089,0.00016548877,0.0001665351,0.00009999365,0.0012085808,0.00024273884],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038607017,0.00033948215,0.0014431046,0.00006869947,0.00019790576,0.001591528,0.0012590635,0.16925214,0.19058672,0.010445738,0.00070397486,0.624073],"study_design_scores_gemma":[0.00005703571,0.00014353228,0.0012405744,0.0001161497,0.000013429576,0.00018709163,0.0024963145,0.2730862,0.7054213,0.011190775,0.005835745,0.00021184831],"about_ca_topic_score_codex":0.0000027730514,"about_ca_topic_score_gemma":0.00004185271,"teacher_disagreement_score":0.6238612,"about_ca_system_score_codex":0.00018962915,"about_ca_system_score_gemma":0.00019006217,"threshold_uncertainty_score":0.52507496},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.11135646365839093,"score_gpt":0.37456319042376984,"score_spread":0.26320672676537893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092156990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06806064,0.00015789071,0.92873454,0.001028922,0.001010319,0.00024387274,3.459332e-7,0.000037465066,0.00072603417],"genre_scores_gemma":[0.99426854,0.00007585859,0.004872578,0.000072218565,0.00029848824,0.000010804528,0.0000023579717,0.000020014844,0.00037911648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99373543,0.0011042604,0.0013322252,0.00034333527,0.0027351072,0.00074965606],"domain_scores_gemma":[0.9975918,0.00059155555,0.0005737434,0.00041055115,0.0006643192,0.000168032],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.007680622,0.00017345697,0.00030790365,0.0014290118,0.000805173,0.0003705154,0.0017137097,0.00007099303,0.0004823425],"category_scores_gemma":[0.001497566,0.00016676656,0.000117506665,0.0022836195,0.00009991034,0.00084128464,0.0010280012,0.003419774,0.00003401743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014681228,0.000035701716,0.0008341765,0.000019261199,0.000020086492,0.000106313535,0.0027744533,0.92033166,0.0039795213,0.011725918,0.00014596795,0.059880152],"study_design_scores_gemma":[0.00011376082,0.002815373,0.00019751508,0.00010261924,0.000006892068,0.00013793625,0.007290337,0.9629144,0.0040428042,0.016538832,0.0055752303,0.00026430975],"about_ca_topic_score_codex":0.00008558952,"about_ca_topic_score_gemma":0.000014398291,"teacher_disagreement_score":0.9262079,"about_ca_system_score_codex":0.00072259223,"about_ca_system_score_gemma":0.00042333384,"threshold_uncertainty_score":0.9988794},"labels":[],"label_agreement":null},{"id":"W3111378514","doi":"10.1613/jair.1.12087","title":"Adapting Behavior via Intrinsic Reward: A Survey and Empirical Study","year":2020,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alberta Machine Intelligence Institute; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Reinforcement learning; Computer science; Active learning (machine learning); Artificial intelligence; Introspection; Proactive learning; Representation (politics); Testbed; Machine learning; Cognitive psychology; Robot learning; Psychology","score_opus":0.32470343897132165,"score_gpt":0.4767867490410224,"score_spread":0.15208331006970077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111378514","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7148517,0.00014510711,0.28141162,0.0031333717,0.00019586991,0.0002008333,7.117567e-7,0.000024212693,0.000036619826],"genre_scores_gemma":[0.9929092,0.000024640169,0.0065160347,0.00008005897,0.0004404161,0.0000034929687,2.0785528e-7,0.000010439573,0.00001552236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956856,0.001572674,0.00072362873,0.0003441502,0.0012488926,0.00042508024],"domain_scores_gemma":[0.99727404,0.0009929162,0.00019463907,0.00023791032,0.0008752011,0.00042527856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0084314,0.00012571432,0.00030449845,0.00030892412,0.00028518398,0.00044039084,0.0010418564,0.000059093385,0.000030023599],"category_scores_gemma":[0.0026890133,0.000101643585,0.000069738875,0.0013409978,0.00013055094,0.0003570342,0.0005486701,0.0014769982,0.00005507907],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001300895,0.00053494057,0.083573125,0.00001136553,0.00003049358,0.0005404793,0.007847617,0.00023530332,0.00072812726,0.00026118482,0.00023639704,0.90587085],"study_design_scores_gemma":[0.00048635283,0.022160742,0.30649173,0.00014881979,0.00005130905,0.00074932375,0.012733023,0.63946176,0.007477134,0.007242729,0.0019297412,0.0010673028],"about_ca_topic_score_codex":0.00024457386,"about_ca_topic_score_gemma":0.00006116438,"teacher_disagreement_score":0.9048036,"about_ca_system_score_codex":0.0000443201,"about_ca_system_score_gemma":0.00023284531,"threshold_uncertainty_score":0.64169043},"labels":[],"label_agreement":null},{"id":"W3114166581","doi":"10.1613/jair.1.12013","title":"On the Complexity of Learning a Class Ratio from Unlabeled Data","year":2020,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mila - Quebec Artificial Intelligence Institute","funders":"National Science Foundation","keywords":"Learnability; VC dimension; Class (philosophy); Sample complexity; Axiom; Variety (cybernetics); Computer science; Artificial intelligence; Dimension (graph theory); Set (abstract data type); Machine learning; Concept class; Theoretical computer science; Mathematics; Combinatorics","score_opus":0.48521303872051297,"score_gpt":0.44851998283976285,"score_spread":0.036693055880750114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114166581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061993394,0.00012662748,0.8818092,0.055216923,0.00021958126,0.00013417032,0.000007858253,0.000021681157,0.0004705655],"genre_scores_gemma":[0.98937815,0.00004106811,0.009935169,0.00017348712,0.00043539895,7.4886947e-7,0.0000025567845,0.0000075896587,0.000025847266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962269,0.0012250926,0.00063997094,0.00028222907,0.001334241,0.00029157466],"domain_scores_gemma":[0.99602175,0.0022481023,0.00033885924,0.00059696817,0.0006249752,0.00016936798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004485387,0.00009873666,0.00025356608,0.00013991773,0.0002982193,0.0002639735,0.0034667738,0.000047586673,0.00019687483],"category_scores_gemma":[0.005338718,0.00006390448,0.000076782526,0.0009483756,0.00041237884,0.00032089197,0.0007709243,0.0018342567,0.00011272921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003614617,0.0003547665,0.00029067302,0.000028004815,0.0001368432,0.00011210981,0.006752402,0.020071136,0.026773322,0.5856059,0.004449014,0.35506436],"study_design_scores_gemma":[0.000032855623,0.0007199048,0.000066624314,0.000056837656,0.0000039739557,0.000004360308,0.000945403,0.91361505,0.02284399,0.060137227,0.0015034929,0.00007030754],"about_ca_topic_score_codex":0.0001552664,"about_ca_topic_score_gemma":0.000014679056,"teacher_disagreement_score":0.92738473,"about_ca_system_score_codex":0.000028822702,"about_ca_system_score_gemma":0.00027199296,"threshold_uncertainty_score":0.79690343},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.14740933450327634,"score_gpt":0.44267803961297403,"score_spread":0.2952687051096977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115320986","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9193776,0.00085504644,0.07257027,0.0064834533,0.000344686,0.00009405902,0.0000091521115,0.000014512169,0.00025118623],"genre_scores_gemma":[0.99552596,0.000048190093,0.0036979571,0.00010971932,0.0005119736,9.5253444e-7,0.00000191407,0.00000586707,0.000097454824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99677867,0.0013810426,0.00040690563,0.00026751275,0.0008488783,0.00031697765],"domain_scores_gemma":[0.9953158,0.0018692742,0.00014176058,0.0002973015,0.0022340969,0.00014175044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042758295,0.000091206675,0.00018677936,0.00012374899,0.000661343,0.00053282053,0.0006606026,0.00013483201,0.000057980204],"category_scores_gemma":[0.0019742618,0.00006209972,0.00007572509,0.00067788584,0.00025421337,0.00022072451,0.00025498384,0.0019089429,0.000025521347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034043487,0.00089128315,0.002065325,0.000020524278,0.00040934593,0.0034988825,0.07408594,0.00017826405,0.17661366,0.530917,0.003422489,0.20755683],"study_design_scores_gemma":[0.00024164496,0.0012632794,0.025929471,0.00045810873,0.000034328994,0.00064153015,0.06810538,0.015269164,0.4523756,0.43095773,0.0041433657,0.00058039645],"about_ca_topic_score_codex":0.0064742304,"about_ca_topic_score_gemma":0.0106806215,"teacher_disagreement_score":0.27576193,"about_ca_system_score_codex":0.00010181771,"about_ca_system_score_gemma":0.00025406037,"threshold_uncertainty_score":0.9787143},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.3537488428002021,"score_gpt":0.4758490705427069,"score_spread":0.12210022774250484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117215073","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.0065416e-7,0.77820694,0.21891998,0.00052476174,0.0002594229,0.0006263192,5.310488e-7,0.000022355927,0.0014395799],"genre_scores_gemma":[0.000022682036,0.9961339,0.0023335703,0.000035721077,0.00026991448,0.000038758735,0.0000027447945,0.00003634514,0.0011263136],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.991866,0.0020305645,0.0021806557,0.00054974464,0.0026036752,0.00076934847],"domain_scores_gemma":[0.994913,0.0014653233,0.0014997768,0.0006523895,0.0011390637,0.00033047862],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.011670991,0.00040194986,0.0019207925,0.0012123233,0.00054469967,0.0005758179,0.0028780478,0.00017370595,0.00082472817],"category_scores_gemma":[0.004848099,0.00032041266,0.00059954304,0.0020118703,0.00036375853,0.00055065117,0.0017772833,0.004585868,0.000089810805],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065930994,0.000044040913,1.5608255e-7,0.0066800583,0.00017054469,0.00011215822,0.0011332469,0.0029217277,2.7907194e-7,0.020102127,0.000697781,0.9681313],"study_design_scores_gemma":[0.00001913925,0.0012939177,1.0135547e-7,0.008857085,0.00021327876,0.00039244752,0.0010838101,0.0036426836,0.0000040186956,0.0005308807,0.983661,0.0003016187],"about_ca_topic_score_codex":0.000016946318,"about_ca_topic_score_gemma":7.451476e-7,"teacher_disagreement_score":0.98296326,"about_ca_system_score_codex":0.00067045697,"about_ca_system_score_gemma":0.0018342834,"threshold_uncertainty_score":0.9999248},"labels":[],"label_agreement":null},{"id":"W3135927772","doi":"10.1613/jair.1.12283","title":"Computational Complexity of Computing Symmetries in Finite-Domain Planning","year":2021,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Vetenskapsrådet; Israel Academy of Sciences and Humanities","keywords":"Graph automorphism; Graph isomorphism; Automorphism; Time complexity; Homogeneous space; Mathematics; Isomorphism (crystallography); PSPACE; Discrete mathematics; Pruning; Graph; Automorphism group; Computational complexity theory; Combinatorics; Theoretical computer science; Computer science; Algorithm; Voltage graph; Line graph","score_opus":0.2931864096118457,"score_gpt":0.43983974178309837,"score_spread":0.14665333217125265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135927772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18806371,0.00055782584,0.8091534,0.0015845966,0.00020334913,0.000057632154,0.0000026286993,0.000010043703,0.0003668091],"genre_scores_gemma":[0.84305054,0.000010784083,0.15677992,0.000043647753,0.0000978737,4.1388012e-7,0.0000020959785,0.000005947127,0.000008774326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996243,0.0007742003,0.0011049304,0.00023930494,0.0011853324,0.00045325488],"domain_scores_gemma":[0.9932536,0.004026923,0.0003631227,0.00022600702,0.0019984392,0.00013189706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065685557,0.000111804664,0.00035877572,0.00086191646,0.00022728807,0.00021072132,0.00085472653,0.00007852506,0.000030487889],"category_scores_gemma":[0.002261582,0.00010916508,0.000108549444,0.0023267886,0.00033185564,0.00035251066,0.00031384965,0.0009618261,0.000012425197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108491535,0.0003844688,0.010449864,0.00011668936,0.000050853996,0.00095764676,0.0124878865,0.69469833,0.0021075013,0.22142635,0.0003072971,0.056904584],"study_design_scores_gemma":[0.00008976316,0.00033670705,0.0023031689,0.00072609447,0.0000026391822,0.00012876155,0.0045599528,0.60439277,0.027063584,0.3601136,0.00012391567,0.00015908327],"about_ca_topic_score_codex":0.000054155047,"about_ca_topic_score_gemma":0.000016317563,"teacher_disagreement_score":0.65498686,"about_ca_system_score_codex":0.000103380364,"about_ca_system_score_gemma":0.0008233588,"threshold_uncertainty_score":0.44516227},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.14538255245648596,"score_gpt":0.42541428508142876,"score_spread":0.2800317326249428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3166631396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30348822,0.0015684558,0.6893972,0.0026294903,0.0022239236,0.000605649,0.000009059232,0.000028164406,0.000049817212],"genre_scores_gemma":[0.9947091,0.0000030521069,0.0043098936,0.00009109612,0.0007345512,0.000033921333,0.0000021226967,0.000011461839,0.0001048308],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965514,0.00044698507,0.0006419989,0.0002813986,0.0016177145,0.0004605365],"domain_scores_gemma":[0.9973093,0.0010317776,0.00031468997,0.0002906695,0.0009617555,0.00009180516],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0058845314,0.00011003335,0.00018546096,0.0003468843,0.0016297592,0.00067693234,0.001209215,0.000038218164,0.000012184423],"category_scores_gemma":[0.0010284978,0.000079447214,0.00011761111,0.0006539121,0.00020789808,0.00033758619,0.0003043529,0.0010684188,0.0000063926163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069127174,0.00045413763,0.00007756854,0.0000938889,0.00007828425,0.00014824425,0.060453482,0.15714528,0.022546267,0.06588822,0.00038255152,0.6920408],"study_design_scores_gemma":[0.00008480641,0.00032407552,0.000019200132,0.000057592733,0.000004434552,0.00008835339,0.0106018875,0.9774631,0.008208205,0.0014686572,0.0015772511,0.0001024304],"about_ca_topic_score_codex":0.00010674188,"about_ca_topic_score_gemma":0.000009771731,"teacher_disagreement_score":0.8203178,"about_ca_system_score_codex":0.0003066509,"about_ca_system_score_gemma":0.00090913207,"threshold_uncertainty_score":0.99966997},"labels":[],"label_agreement":null},{"id":"W3174309074","doi":"10.1613/jair.1.13768","title":"Classical Planning in Deep Latent Space","year":2022,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Bottleneck; Artificial intelligence; Domain (mathematical analysis); Representation (politics); Plan (archaeology); Automated planning and scheduling; Set (abstract data type); Space (punctuation); Rotation formalisms in three dimensions; Action (physics); Machine learning; Theoretical computer science; Mathematics; Programming language","score_opus":0.1989048434107749,"score_gpt":0.41514548535276874,"score_spread":0.21624064194199383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174309074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17988488,0.0014687234,0.8049047,0.011442247,0.00095887773,0.00019833252,0.0000014610557,0.000035591314,0.001105172],"genre_scores_gemma":[0.9861232,0.000020346115,0.0134828035,0.000062718886,0.0001796958,0.000007124053,4.4489545e-7,0.000009144942,0.00011453147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961543,0.0008360528,0.0006623026,0.00024837552,0.0014942411,0.0006047123],"domain_scores_gemma":[0.99819416,0.0008660844,0.00019269578,0.00026716886,0.0002958476,0.0001840543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008030459,0.00010069409,0.00021975941,0.0008884184,0.00046548716,0.00023063709,0.0014827733,0.000051017534,0.00012228117],"category_scores_gemma":[0.0004673168,0.00009338809,0.00009443615,0.001609752,0.00009153175,0.0003498457,0.0005682876,0.0021182557,0.00003813606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004162528,0.00065190886,0.008385977,0.00003248476,0.00003986483,0.0035554948,0.016982973,0.55771667,0.0049963393,0.14264737,0.003466131,0.26110852],"study_design_scores_gemma":[0.00009233355,0.0016527018,0.00071406993,0.0001606864,0.0000036634203,0.00037218438,0.004327847,0.9001729,0.009020496,0.07518905,0.008018638,0.00027544773],"about_ca_topic_score_codex":0.00005202907,"about_ca_topic_score_gemma":0.0000132035875,"teacher_disagreement_score":0.8062383,"about_ca_system_score_codex":0.00030666817,"about_ca_system_score_gemma":0.00042655223,"threshold_uncertainty_score":0.9202885},"labels":[],"label_agreement":null},{"id":"W3176848776","doi":"10.1613/jair.1.14117","title":"Contract Scheduling with Predictions","year":2023,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche","keywords":"Computer science; Imperfect; Scheduling (production processes); Robustness (evolution); Schedule; Binary number; Operations research; Mathematical optimization; Machine learning; Mathematics","score_opus":0.5279592051656413,"score_gpt":0.563474215626612,"score_spread":0.03551501046097072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176848776","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5193124,0.00006334111,0.46919113,0.008255021,0.00039539018,0.00021099618,0.000007858579,0.000043542466,0.0025203403],"genre_scores_gemma":[0.9973203,0.00006416976,0.0012256157,0.000020295833,0.00050711806,0.000008785843,4.9762866e-7,0.000008447082,0.00084475416],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995727,0.00042724455,0.00090234994,0.00020839386,0.0023919174,0.00034311428],"domain_scores_gemma":[0.99260527,0.003833698,0.00029841068,0.0003367075,0.002709522,0.00021641448],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.016717406,0.00007114876,0.00018991297,0.0011151934,0.0006191322,0.00034894573,0.00079398166,0.00006013542,0.00082243566],"category_scores_gemma":[0.0060828985,0.00004527161,0.00010481095,0.0045516966,0.00044153113,0.00046483122,0.000074194504,0.0007058076,0.0022216667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006796159,0.00036611783,0.0014667973,0.0000054605975,0.00008368884,0.00012580024,0.002715014,0.11755172,0.015128841,0.35804448,0.005933649,0.49789882],"study_design_scores_gemma":[0.00005752957,0.0006946812,0.0016055158,0.00006891254,0.000013185843,0.00018012375,0.02932223,0.058396418,0.03511104,0.856595,0.017812714,0.0001426976],"about_ca_topic_score_codex":0.000009616994,"about_ca_topic_score_gemma":0.000019998446,"teacher_disagreement_score":0.49855047,"about_ca_system_score_codex":0.00004949757,"about_ca_system_score_gemma":0.00032673468,"threshold_uncertainty_score":0.99855524},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.6323708808206586,"score_gpt":0.5702557216662416,"score_spread":0.06211515915441701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3192223999","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94792265,0.014338761,0.011262132,0.024066871,0.00069606147,0.00036979982,0.00009125107,0.000015235368,0.001237262],"genre_scores_gemma":[0.9621266,0.035665482,0.0015984875,0.000036210906,0.00037478333,0.0000016372669,0.0000028955833,0.000021588101,0.00017231371],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9833886,0.009325834,0.0016841847,0.000388393,0.0044124313,0.0008005537],"domain_scores_gemma":[0.95842195,0.026792718,0.0009024559,0.0003206605,0.013061794,0.0005004374],"candidate_categories":["metaresearch","sts","research_integrity"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.062051512,0.00017757343,0.00067362294,0.00031114445,0.0010381207,0.00038177898,0.0010091354,0.00053049735,0.0005237224],"category_scores_gemma":[0.21805139,0.00017112122,0.00020014314,0.0023943395,0.003437992,0.000819451,0.0003658503,0.0054376144,0.000014137606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023330688,0.0010857877,0.020819703,0.00033041832,0.00038805915,0.00030195573,0.23095615,0.0014004619,0.06431887,0.19310047,0.00024482503,0.48472023],"study_design_scores_gemma":[0.00009323226,0.0023523434,0.014129169,0.0035280364,0.00008188368,0.0000140570655,0.17837875,0.008441499,0.3519857,0.43879655,0.0015014482,0.0006973528],"about_ca_topic_score_codex":0.07017352,"about_ca_topic_score_gemma":0.058723196,"teacher_disagreement_score":0.4840229,"about_ca_system_score_codex":0.0002544941,"about_ca_system_score_gemma":0.0055028903,"threshold_uncertainty_score":0.9992741},"labels":[],"label_agreement":null},{"id":"W3210485068","doi":"10.1613/jair.1.13445","title":"Multi-Agent Advisor Q-Learning","year":2022,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo; Mitacs; University of Alberta; Alberta Machine Intelligence Institute; Compute Canada; Government of Canada; Vector Institute; Canadian Institute for Advanced Research","keywords":"Reinforcement learning; Computer science; Variety (cybernetics); Artificial intelligence; Action (physics); Heuristic; Sample complexity; Software deployment; Convergence (economics); Point (geometry); Operations research; Machine learning; Q-learning; Software engineering; Mathematics","score_opus":0.22346943620517123,"score_gpt":0.42782496434760386,"score_spread":0.20435552814243263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210485068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075390553,0.00019689451,0.9890347,0.0016980711,0.00087258755,0.0001564394,3.2451493e-7,0.000034202392,0.00046768694],"genre_scores_gemma":[0.94678664,0.00010719935,0.05139849,0.00006796445,0.00022872318,0.000011007739,5.640703e-7,0.00001834361,0.0013810524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99460304,0.0011299654,0.0008810347,0.00026122443,0.0024849516,0.0006397969],"domain_scores_gemma":[0.99746174,0.00065018144,0.00039519588,0.00039338178,0.00087737653,0.00022212193],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.008302711,0.00012171199,0.0002266124,0.00084399444,0.0010295742,0.00036335527,0.0024975038,0.000041746425,0.00047214126],"category_scores_gemma":[0.0014291055,0.00011504271,0.00016631388,0.0015809656,0.00013505958,0.00048779917,0.0013037536,0.0025129449,0.00020423015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004193715,0.00015513608,0.00018774015,0.000008887703,0.000026902999,0.00017599495,0.002229844,0.91258603,0.005488501,0.011089793,0.00057398743,0.06743524],"study_design_scores_gemma":[0.0000574792,0.0015615609,0.00009875592,0.000023083207,0.00000422585,0.00014799868,0.0039592474,0.95448047,0.007545207,0.0021306695,0.02982908,0.00016220409],"about_ca_topic_score_codex":0.00002254862,"about_ca_topic_score_gemma":0.0000018746015,"teacher_disagreement_score":0.9392476,"about_ca_system_score_codex":0.00038629,"about_ca_system_score_gemma":0.0004528772,"threshold_uncertainty_score":0.9997883},"labels":[],"label_agreement":null},{"id":"W3214959488","doi":"10.1613/jair.1.13219","title":"Teaching People by Justifying Tree Search Decisions: An Empirical Study in Curling","year":2021,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Sports Analytics and Performance","field":"Economics, Econometrics and Finance","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Canadian Institute for Advanced Research","keywords":"Curling; Outcome (game theory); Counterfactual thinking; Decision tree; Computer science; Action (physics); Tree (set theory); Decision tree learning; Machine learning; Artificial intelligence; Value (mathematics); Psychology; Cognitive psychology; Mathematics; Social psychology; Mathematical economics; Engineering","score_opus":0.4127187630247911,"score_gpt":0.48211493908378084,"score_spread":0.06939617605898973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214959488","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9844769,0.0014847151,0.011709566,0.0010942314,0.0002894883,0.00013824133,0.000008001939,0.000004600698,0.0007942331],"genre_scores_gemma":[0.99782205,0.0007358533,0.0007240174,0.000040719024,0.00042451054,0.0000035764062,0.0000029616647,0.000021413416,0.00022487801],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967526,0.00022028117,0.0016311442,0.00039455973,0.000423196,0.0005781953],"domain_scores_gemma":[0.9980666,0.0005890178,0.00025135462,0.00036165447,0.00048517878,0.00024616663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012784407,0.0001289833,0.0005081631,0.0009969571,0.00034523185,0.0003739678,0.0005523786,0.00010060103,0.0004338571],"category_scores_gemma":[0.001655843,0.00012982861,0.00012822327,0.0012536285,0.00007113931,0.0005547245,0.00016146152,0.001683176,0.000119328426],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023723223,0.004453843,0.7481876,0.00003521931,0.00008598712,0.0006099299,0.022966053,0.011971129,0.00072795374,0.011613172,0.00077639206,0.19833545],"study_design_scores_gemma":[0.0005859345,0.0032288122,0.090855844,0.00044825592,0.000025245714,0.0001853062,0.15760916,0.63198626,0.0050064176,0.09655152,0.012482796,0.0010344413],"about_ca_topic_score_codex":0.0010803374,"about_ca_topic_score_gemma":0.0022546693,"teacher_disagreement_score":0.65733176,"about_ca_system_score_codex":0.00023920687,"about_ca_system_score_gemma":0.000239735,"threshold_uncertainty_score":0.7312656},"labels":[],"label_agreement":null},{"id":"W340913344","doi":"10.1613/jair.4192","title":"Multiagent Only Knowing in Dynamic Systems","year":2014,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"RWTH Aachen University; Deutsche Forschungsgemeinschaft","keywords":"Computer science; Extension (predicate logic); Epistemic modal logic; Order (exchange); Artificial intelligence; Monotonic function; Modal logic; Modal; Theoretical computer science; Epistemology; Description logic; Multimodal logic; Mathematics; Programming language; Philosophy","score_opus":0.11776793154295662,"score_gpt":0.4046022042379217,"score_spread":0.2868342726949651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W340913344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12763865,0.0012323102,0.8643267,0.0007891065,0.0016105352,0.0002403788,3.7280353e-7,0.00002725307,0.0041346587],"genre_scores_gemma":[0.99578273,0.00015856266,0.0033920973,0.000015014657,0.00033025202,0.0000038605854,1.725823e-7,0.000010421687,0.0003069148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99623895,0.000838667,0.0008917236,0.00029459613,0.0010714903,0.000664554],"domain_scores_gemma":[0.9973171,0.000928401,0.00021769699,0.0004118577,0.0008793408,0.0002456189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008930427,0.0001343641,0.00032531464,0.0008569983,0.00018844644,0.00046442408,0.0016713943,0.000106379164,0.0000166499],"category_scores_gemma":[0.0016552428,0.000106667,0.00013011401,0.0011476636,0.00013813122,0.00054423406,0.00029514695,0.000926449,0.00027157442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006183568,0.0005006472,0.0011932154,0.000070045695,0.000027443888,0.00023165507,0.0043049413,0.0067230025,0.005844694,0.21081817,0.00038161594,0.76984274],"study_design_scores_gemma":[0.00008728135,0.0007457115,0.0010839542,0.00035057924,0.000003798792,0.00017153466,0.001275353,0.96061933,0.0061166924,0.024405371,0.004906479,0.00023390705],"about_ca_topic_score_codex":0.00015570574,"about_ca_topic_score_gemma":0.00024200956,"teacher_disagreement_score":0.95389634,"about_ca_system_score_codex":0.00030606947,"about_ca_system_score_gemma":0.00040583021,"threshold_uncertainty_score":0.44784522},"labels":[],"label_agreement":null},{"id":"W4225709049","doi":"10.1613/jair.1.14820","title":"Online Bin Packing with Predictions","year":2022,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; Fondation Mathématique Jacques Hadamard; Agence Nationale de la Recherche","keywords":"Bin; Bin packing problem; Computer science; Mathematics; Econometrics; Mathematical optimization; Operations research; Algorithm","score_opus":0.15218081344579817,"score_gpt":0.377014528607602,"score_spread":0.2248337151618038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225709049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30412358,0.0011891737,0.68244004,0.0029081136,0.0021418591,0.00053299044,0.00007352201,0.00023160818,0.00635914],"genre_scores_gemma":[0.9962563,0.00019078147,0.0031259214,0.000015112539,0.00024304166,0.000006366417,0.0000039760425,0.000024289375,0.00013423763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983382,0.0001349085,0.0003881273,0.00007918027,0.00079220126,0.00026736243],"domain_scores_gemma":[0.9991752,0.00015492296,0.00005998605,0.00012163959,0.00038208492,0.00010619014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014020725,0.00006932049,0.000120435165,0.0005184691,0.00032457273,0.000077657314,0.00026404439,0.000025770765,0.0008010016],"category_scores_gemma":[0.0000881457,0.000059783568,0.000046910853,0.0010701821,0.00007621853,0.00014181262,0.000053005995,0.0010014198,0.000015560146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044294768,0.00013093418,0.0001322723,0.000012829148,0.00003259322,0.000033400684,0.00081200537,0.9749563,0.0011372194,0.001245656,0.0010360897,0.02042646],"study_design_scores_gemma":[0.000099628516,0.0016462102,0.00014984206,0.00012416183,0.00002067624,0.00039391013,0.011986514,0.93537736,0.011493909,0.005413688,0.033029903,0.00026418094],"about_ca_topic_score_codex":0.000011020691,"about_ca_topic_score_gemma":0.000030099998,"teacher_disagreement_score":0.6921327,"about_ca_system_score_codex":0.00015839747,"about_ca_system_score_gemma":0.000120618126,"threshold_uncertainty_score":0.8770406},"labels":[],"label_agreement":null},{"id":"W4243794444","doi":"10.1613/jair.2251","title":"A Framework for Kernel-Based Multi-Category Classification","year":2007,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Benchmark (surveying); Computer science; Consistency (knowledge bases); Pairwise comparison; Kernel (algebra); Machine learning; Parallels; Binary classification; Binary number; Support vector machine; Focus (optics); Extension (predicate logic); Artificial intelligence; Algorithm; Data mining; Mathematics","score_opus":0.39400175163338985,"score_gpt":0.495229237634599,"score_spread":0.10122748600120912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243794444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014542757,0.00012237446,0.98225635,0.0021565736,0.00054859294,0.0002440204,0.00000113745,0.000021587866,0.0001066024],"genre_scores_gemma":[0.7063018,0.000032161774,0.29327106,0.00009337257,0.00024968944,0.000008905848,8.9374e-7,0.000008689798,0.00003337223],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975195,0.00016581244,0.0007310938,0.00023707737,0.00084736943,0.00049918337],"domain_scores_gemma":[0.9954408,0.0018757749,0.00027876455,0.0003173938,0.0018610295,0.00022625482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007545209,0.00009841806,0.00016879747,0.00066126237,0.0002741971,0.000246326,0.00096445216,0.00016300906,0.000038478513],"category_scores_gemma":[0.0019128945,0.00008157996,0.00015425443,0.00084364257,0.00014006966,0.00045760587,0.00006680425,0.00067810155,0.00012838743],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003736771,0.0006188975,0.000097452554,0.00004134308,0.00001797503,0.000032000604,0.0008778084,0.00043110806,0.07398701,0.14228012,0.00090252026,0.7803401],"study_design_scores_gemma":[0.000096989206,0.00066136423,0.00056482,0.00021699116,0.0000056138183,0.00001527719,0.0019794286,0.23515196,0.46140507,0.29747736,0.0022521063,0.00017303371],"about_ca_topic_score_codex":0.000009853525,"about_ca_topic_score_gemma":0.000011822684,"teacher_disagreement_score":0.78016704,"about_ca_system_score_codex":0.00011509787,"about_ca_system_score_gemma":0.0003317562,"threshold_uncertainty_score":0.33267343},"labels":[],"label_agreement":null},{"id":"W4281633131","doi":"10.1613/jair.1.12670","title":"Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem","year":2022,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Ciencia e Innovación","keywords":"Maximum satisfiability problem; Computer science; Answer set programming; Constraint programming; Scheduling (production processes); Mathematical optimization; Satisfiability; Job shop scheduling; Set (abstract data type); Theoretical computer science; Mathematics; Algorithm; Schedule; Stochastic programming; Programming language","score_opus":0.6624061415240893,"score_gpt":0.47780059357857924,"score_spread":0.18460554794551004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281633131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4074819,0.0005657808,0.47981754,0.10770027,0.0016877133,0.0007821784,0.000014957651,0.00003380581,0.0019158554],"genre_scores_gemma":[0.9547358,0.000013096192,0.04393078,0.00018193733,0.0008500713,0.000042061267,6.510776e-7,0.000022764443,0.00022280947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"qualitative","domain_scores_codex":[0.98952204,0.0015798205,0.001858452,0.000544825,0.005513966,0.000980873],"domain_scores_gemma":[0.988436,0.004505278,0.0005419374,0.0007164681,0.005336097,0.00046421654],"candidate_categories":["metaresearch","sts","scholarly_communication"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.06261413,0.00017995738,0.00042765096,0.0019074926,0.0029300596,0.0013031068,0.0028919086,0.000060358827,0.00042885588],"category_scores_gemma":[0.037637614,0.00011979592,0.00019360203,0.012132966,0.00028895366,0.00033708473,0.001164584,0.0016110069,0.000422069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016940663,0.00019924353,0.0004252985,0.0000071015784,0.0000345171,0.000035268302,0.0042742835,0.83725774,0.0033746415,0.011839632,0.0011299811,0.14125286],"study_design_scores_gemma":[0.00020904515,0.0012847834,0.0033987442,0.00065871247,0.00009060104,0.0010522717,0.33589327,0.2877712,0.014341719,0.29454616,0.05958728,0.0011662265],"about_ca_topic_score_codex":0.00018649753,"about_ca_topic_score_gemma":0.00009266419,"teacher_disagreement_score":0.5494866,"about_ca_system_score_codex":0.0002666551,"about_ca_system_score_gemma":0.0014232991,"threshold_uncertainty_score":0.9997336},"labels":[],"label_agreement":null},{"id":"W4283587045","doi":"10.1613/jair.1.13544","title":"Path Counting for Grid-Based Navigation","year":2022,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Autodesk (Canada)","funders":"","keywords":"Grid; Computer science; Vertex (graph theory); Traverse; Dijkstra's algorithm; Visibility; Any-angle path planning; Algorithm; Shortest path problem; Grid method multiplication; Theoretical computer science; Motion planning; Mathematics; Artificial intelligence; Graph; Geometry; Geography","score_opus":0.19304573332997296,"score_gpt":0.4236703514921283,"score_spread":0.23062461816215532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283587045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00804695,0.000080115315,0.987725,0.002711023,0.0010233601,0.00023999656,0.000011718856,0.000016300888,0.00014551541],"genre_scores_gemma":[0.92118335,0.000019459465,0.077352956,0.00017471818,0.0010274642,0.000050765895,0.000017108565,0.000016193442,0.00015798165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973619,0.00022607103,0.0004943218,0.00019317336,0.0013616158,0.0003629366],"domain_scores_gemma":[0.99822193,0.00049709674,0.00022899607,0.00026081013,0.0007110755,0.0000801087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008383004,0.00006847283,0.00012691678,0.00042988587,0.0006646231,0.00042278008,0.0015647564,0.00001848453,0.00005996568],"category_scores_gemma":[0.00032362432,0.00006384293,0.00009788247,0.0010145588,0.000062747575,0.00068189873,0.00038614095,0.00048048823,0.000017369399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016042014,0.0004697714,0.00010006064,0.000084979234,0.000035147594,0.00014103945,0.0007796942,0.014978965,0.0035339023,0.14289653,0.011713724,0.8251058],"study_design_scores_gemma":[0.000067579764,0.0009685333,0.00002144001,0.00004244893,0.0000051834877,0.000017359813,0.0013621482,0.8902517,0.014139067,0.06031915,0.032678742,0.00012663432],"about_ca_topic_score_codex":0.00001865753,"about_ca_topic_score_gemma":0.0000017986941,"teacher_disagreement_score":0.9131364,"about_ca_system_score_codex":0.00014964036,"about_ca_system_score_gemma":0.00026508016,"threshold_uncertainty_score":0.51118106},"labels":[],"label_agreement":null},{"id":"W4307490062","doi":"10.1613/jair.1.13854","title":"Low-Rank Representation of Reinforcement Learning Policies","year":2022,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Canadian Institute for Advanced Research; McGill University","funders":"Canadian Institute for Advanced Research","keywords":"Reproducing kernel Hilbert space; Reinforcement learning; Representation (politics); Computer science; Embedding; Rank (graph theory); Stability (learning theory); Kernel (algebra); Convergence (economics); Space (punctuation); Hilbert space; Hilbert curve; Mathematical optimization; Artificial intelligence; Theoretical computer science; Machine learning; Mathematics; Algorithm; Discrete mathematics; Economics; Pure mathematics","score_opus":0.15821192415856822,"score_gpt":0.4211595401058433,"score_spread":0.26294761594727506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307490062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041676976,0.00007808381,0.9548143,0.0011230313,0.00046684186,0.00018793554,2.6104482e-7,0.00001875455,0.0016338057],"genre_scores_gemma":[0.995194,0.00013093057,0.0038572138,0.000029693181,0.00014531569,0.0000073325427,0.0000010773911,0.000010948899,0.00062346837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945222,0.0008052091,0.001207599,0.0002023563,0.0027861602,0.00047647406],"domain_scores_gemma":[0.99679255,0.000771342,0.00072106486,0.0004157782,0.0011722029,0.00012707309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00537001,0.000107457876,0.00027702667,0.001012713,0.00056879903,0.00017705343,0.0017109187,0.000038649538,0.00029149832],"category_scores_gemma":[0.0014429269,0.0001038176,0.00016923904,0.0020779974,0.00019363489,0.0005507454,0.00092520955,0.0013207644,0.00002958772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075342505,0.00006900338,0.00023569251,0.0000195496,0.000030715084,0.000027142285,0.0038418176,0.92116916,0.011930412,0.035364304,0.00024159512,0.026995242],"study_design_scores_gemma":[0.00007576452,0.0025146042,0.00012040994,0.00006638232,0.000007987888,0.0000732461,0.008277825,0.7822275,0.19722131,0.0073095784,0.0019446373,0.00016073533],"about_ca_topic_score_codex":0.00010306546,"about_ca_topic_score_gemma":0.0000019070632,"teacher_disagreement_score":0.953517,"about_ca_system_score_codex":0.00026783234,"about_ca_system_score_gemma":0.00038944292,"threshold_uncertainty_score":0.5738138},"labels":[],"label_agreement":null},{"id":"W4311072863","doi":"10.1613/jair.1.13769","title":"Asymmetric Action Abstractions for Planning in Real-Time Strategy Games","year":2022,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de Minas Gerais; University of Alberta; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Universidade Federal de Viçosa; Canadian Institute for Advanced Research","keywords":"Computer science; Iterative deepening depth-first search; Action (physics); Search algorithm; Set (abstract data type); Context (archaeology); Theoretical computer science; Greedy algorithm; Combinatorial game theory; Tree (set theory); Abstraction; Search tree; Sequential game; Beam search; Game theory; Algorithm; Best-first search; Mathematics; Mathematical economics; Programming language","score_opus":0.33304306061782796,"score_gpt":0.48880815397746014,"score_spread":0.15576509335963218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311072863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34907788,0.00072699884,0.64007336,0.0030496612,0.0020731105,0.00105414,0.000012013303,0.00009857028,0.003834284],"genre_scores_gemma":[0.9891623,0.00024264454,0.009776947,0.000022922248,0.00041375868,0.00007568952,0.0000016638932,0.000022883205,0.0002811395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99522185,0.0006281779,0.0013472156,0.0004122528,0.0015975953,0.00079292397],"domain_scores_gemma":[0.99524826,0.0026387284,0.0004883106,0.0004165303,0.0010113138,0.00019683714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008409568,0.000168039,0.00034541165,0.0026948927,0.00073959766,0.00040486793,0.0018241024,0.00009260787,0.0002486211],"category_scores_gemma":[0.0012376743,0.00017120788,0.00020705983,0.0031668085,0.00016857064,0.0011156745,0.00035009254,0.0014790116,0.000103135055],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003507275,0.0007060769,0.00022328412,0.000020933214,0.00004014539,0.00018668115,0.0026603106,0.2041996,0.0279524,0.041264404,0.0023066236,0.72008884],"study_design_scores_gemma":[0.00009853886,0.0037916442,0.0009450343,0.00009787666,0.000012307139,0.0003454202,0.024985382,0.4772572,0.16658603,0.3155801,0.0097521385,0.00054834696],"about_ca_topic_score_codex":0.0002541284,"about_ca_topic_score_gemma":0.000049063852,"teacher_disagreement_score":0.7195405,"about_ca_system_score_codex":0.000706525,"about_ca_system_score_gemma":0.00078084436,"threshold_uncertainty_score":0.6981655},"labels":[],"label_agreement":null},{"id":"W4313395447","doi":"10.1613/jair.1.14034","title":"The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions","year":2022,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Agencia Nacional de Investigación y Desarrollo; Natural Sciences and Engineering Research Council of Canada; Israel Academy of Sciences and Humanities","keywords":"Heuristics; Heuristic; Simple (philosophy); Class (philosophy); Operator (biology); Mathematical optimization; Mathematics; Computer science; State (computer science); Algorithm; Artificial intelligence","score_opus":0.16950680794732287,"score_gpt":0.4241227748721553,"score_spread":0.2546159669248324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313395447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054898918,0.00062853034,0.9412744,0.0023021905,0.00034877402,0.0002658211,0.000016017528,0.00002492985,0.00024043763],"genre_scores_gemma":[0.9859956,0.000020384245,0.013449918,0.0000826364,0.00022635947,0.000052896146,0.0000037289362,0.000014891657,0.0001535772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970332,0.00044407943,0.00054044614,0.0002249906,0.0011379262,0.0006193565],"domain_scores_gemma":[0.9950717,0.0034511,0.0002710809,0.0003102383,0.000737602,0.00015828745],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0053372653,0.000111499794,0.00018204474,0.00030632762,0.002997565,0.00049969176,0.0015288439,0.000029426039,0.00003105832],"category_scores_gemma":[0.000502025,0.00007844438,0.00009916589,0.0010087071,0.00020230122,0.00028914673,0.00026030777,0.0010347847,0.000012540708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094017235,0.00027906595,0.00050425983,0.000038651586,0.0001518004,0.00043932095,0.006012856,0.78218013,0.0033129507,0.07771943,0.02711996,0.10130139],"study_design_scores_gemma":[0.00015942832,0.006101454,0.00019711268,0.00012766996,0.000024746663,0.0005329016,0.016881514,0.8186551,0.00578143,0.08944797,0.061700672,0.00039004383],"about_ca_topic_score_codex":0.00003604125,"about_ca_topic_score_gemma":0.0000048532493,"teacher_disagreement_score":0.9310967,"about_ca_system_score_codex":0.00013779059,"about_ca_system_score_gemma":0.000714365,"threshold_uncertainty_score":0.9983004},"labels":[],"label_agreement":null},{"id":"W4376223516","doi":"10.1613/jair.1.14580","title":"Exploiting Action Impact Regularity and Exogenous State Variables for Offline Reinforcement Learning","year":2023,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Reinforcement learning; Computer science; Component (thermodynamics); Exploit; Property (philosophy); Offline learning; Key (lock); Class (philosophy); Artificial intelligence; Machine learning; Action (physics); State (computer science); Reinforcement; Online and offline; State action; Online learning; Algorithm","score_opus":0.29473503459567824,"score_gpt":0.4630904091938908,"score_spread":0.16835537459821254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376223516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08895168,0.000060372946,0.909827,0.00045055256,0.0002783884,0.00027488184,5.42821e-7,0.000055948927,0.00010066561],"genre_scores_gemma":[0.97709894,0.00065085915,0.021256214,0.000013763521,0.00033915899,0.000011168623,0.0000035104674,0.000021876447,0.0006045336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99656534,0.0002922209,0.0009119301,0.00026427465,0.0012157178,0.00075054367],"domain_scores_gemma":[0.99638253,0.0013216896,0.00043235166,0.00027473803,0.001364103,0.00022456447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009659824,0.0001491343,0.00027532488,0.0008389419,0.00064455665,0.00059380225,0.0006919449,0.00007998419,0.000021098424],"category_scores_gemma":[0.0028116722,0.00012870737,0.00013215048,0.0012874973,0.00012565027,0.0008916739,0.00035871688,0.0008462504,0.00003262782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010682707,0.000021962538,0.00014240839,0.000053676507,0.000050347844,0.0000294422,0.0015965975,0.86498255,0.012835989,0.0055381223,0.00017335633,0.11446875],"study_design_scores_gemma":[0.00006768596,0.0014535914,0.00016628583,0.000102644444,0.000006904472,0.000049847466,0.0012709629,0.9528758,0.027663037,0.015359727,0.00084825465,0.00013525195],"about_ca_topic_score_codex":0.000066574874,"about_ca_topic_score_gemma":0.0000055576684,"teacher_disagreement_score":0.8885708,"about_ca_system_score_codex":0.00024202636,"about_ca_system_score_gemma":0.00035388695,"threshold_uncertainty_score":0.57260484},"labels":[],"label_agreement":null},{"id":"W4380355772","doi":"10.1613/jair.1.14157","title":"Your Prompt is My Command: On Assessing the Human-Centred Generality of Multimodal Models","year":2023,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Agencia Estatal de Investigación; Directorate-General for Communications Networks, Content and Technology; European Regional Development Fund; Generalitat Valenciana; Social Sciences and Humanities Research Council of Canada; Defense Advanced Research Projects Agency; European Commission; Universitat Politècnica de València; Future of Life Institute","keywords":"Generality; Computer science; Human–computer interaction; Cognition; Process (computing); Artificial intelligence; Cognitive science; Psychology; Programming language","score_opus":0.5477049452645087,"score_gpt":0.5082094541283876,"score_spread":0.039495491136121164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380355772","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8448665,0.00027753954,0.14239296,0.010919401,0.0005199401,0.0002750369,0.0000027538536,0.000045458586,0.0007003862],"genre_scores_gemma":[0.99634826,0.00014023721,0.0030849245,0.00008406084,0.0002467447,0.0000034805794,4.0992245e-7,0.00000823514,0.00008361838],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962688,0.00057756784,0.000806966,0.0002507193,0.0015581822,0.0005377275],"domain_scores_gemma":[0.9971399,0.0008902274,0.0003140108,0.00058062014,0.00096422504,0.00011106937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044794413,0.00012600938,0.00030201254,0.00044849238,0.00047782902,0.00040648918,0.0020100079,0.0000853181,0.000026140253],"category_scores_gemma":[0.00046139184,0.0000798277,0.00017756279,0.0011414118,0.0003558669,0.00058055937,0.00041138814,0.00073444203,0.000049767747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018805385,0.0013162761,0.0014718039,0.000121068035,0.00023416877,0.00036513398,0.038024798,0.043877862,0.08578143,0.24544741,0.009838687,0.5733333],"study_design_scores_gemma":[0.000069436144,0.00031556553,0.001564505,0.0001447077,0.0000058419882,0.000018283468,0.0052689337,0.6368305,0.16141574,0.19406268,0.00017539135,0.00012843306],"about_ca_topic_score_codex":0.00028961402,"about_ca_topic_score_gemma":0.000023580647,"teacher_disagreement_score":0.5929526,"about_ca_system_score_codex":0.00007615482,"about_ca_system_score_gemma":0.00027300598,"threshold_uncertainty_score":0.39197847},"labels":[],"label_agreement":null},{"id":"W4385519566","doi":"10.1613/jair.1.14394","title":"Program Synthesis with Best-First Bottom-Up Search","year":2023,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Software Engineering Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alliance de recherche numérique du Canada; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Search cost; Search algorithm; Beam search; Function (biology); Best-first search; String (physics); Theoretical computer science; Algorithm; Mathematics","score_opus":0.17891732954001874,"score_gpt":0.4215244089406741,"score_spread":0.24260707940065537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385519566","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60914826,0.00039932886,0.37483343,0.011966075,0.0011979123,0.0012731152,0.0000048710826,0.0007044523,0.00047252772],"genre_scores_gemma":[0.97038853,0.00046857886,0.028068531,0.0000085518195,0.00048355086,0.000088213455,4.9566603e-7,0.000049306636,0.0004442533],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99306303,0.0004164251,0.0007294819,0.0004703793,0.0038889728,0.0014317102],"domain_scores_gemma":[0.98955286,0.0064637633,0.0001127369,0.0008354828,0.002479778,0.0005553625],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0097838715,0.0002076944,0.00036596355,0.0022293637,0.00046751942,0.00089419907,0.0031570327,0.00013879695,0.00008146111],"category_scores_gemma":[0.005782929,0.00016024754,0.000154024,0.0071079945,0.00044842175,0.0007997975,0.0006498963,0.0019233383,0.0013374685],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002312064,0.00054567616,0.0023525686,0.00015646414,0.00013328536,0.0014889211,0.0022638526,0.00720544,0.0019217414,0.009766654,0.0026554333,0.9712788],"study_design_scores_gemma":[0.00031030484,0.012087482,0.0066761584,0.0020475003,0.0000499177,0.0013748745,0.008645613,0.41815126,0.5132866,0.019111093,0.01666966,0.0015895715],"about_ca_topic_score_codex":0.0001050807,"about_ca_topic_score_gemma":0.000037351943,"teacher_disagreement_score":0.9696892,"about_ca_system_score_codex":0.00027742298,"about_ca_system_score_gemma":0.0009599051,"threshold_uncertainty_score":0.99944013},"labels":[],"label_agreement":null},{"id":"W4385828179","doi":"10.1613/jair.1.14607","title":"Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams","year":2023,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Assembly Line Balancing Optimization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Influence diagram; Upper and lower bounds; Heuristic; Branch and bound; Sequence (biology); Mathematical optimization; Diagram; Scheme (mathematics); Travelling salesman problem; Algorithm; Theoretical computer science; Mathematics; Decision tree; Data mining; Artificial intelligence","score_opus":0.12464474488934056,"score_gpt":0.46155253043351935,"score_spread":0.3369077855441788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385828179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26182693,0.00016440419,0.73722476,0.000121908204,0.00031378717,0.00025625125,0.0000019657114,0.00005842356,0.00003156668],"genre_scores_gemma":[0.57536346,0.00024002796,0.4236541,0.000005610208,0.00060520566,0.000025559035,0.0000044066646,0.000056989164,0.000044633023],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979211,0.00018579038,0.000677904,0.00018945477,0.0005118972,0.0005138661],"domain_scores_gemma":[0.9964113,0.0021206073,0.0001437987,0.0001689132,0.0009863827,0.00016897927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062048174,0.00014846516,0.00029289996,0.0005600847,0.00031610875,0.00030176048,0.00020167496,0.00010975911,0.000011531625],"category_scores_gemma":[0.0030831418,0.000117688964,0.000077186945,0.0009846537,0.00011120754,0.00028755626,0.00006632075,0.000507157,0.000008445166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021758718,0.000030510959,0.00007428412,0.000055167286,0.00005630763,0.00001357643,0.00096335093,0.272256,0.17629996,0.0004563199,0.00018007922,0.5493969],"study_design_scores_gemma":[0.000085301865,0.00044431177,0.00007132339,0.00008831004,0.000012771034,0.000027641392,0.0010905178,0.89860123,0.095746934,0.0035123618,0.00019572875,0.00012355181],"about_ca_topic_score_codex":0.000018950228,"about_ca_topic_score_gemma":0.000060914426,"teacher_disagreement_score":0.6263453,"about_ca_system_score_codex":0.0001397149,"about_ca_system_score_gemma":0.00014119176,"threshold_uncertainty_score":0.47992164},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.4886989474982671,"score_gpt":0.45693764807136533,"score_spread":0.03176129942690176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391399751","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7477316,0.042496536,0.13808887,0.055915017,0.0016092836,0.0017825239,0.0000041522235,0.00016099011,0.012210985],"genre_scores_gemma":[0.98895484,0.010290089,0.0001776831,0.00010116445,0.00016963342,0.00001189565,0.0000012443251,0.000013489559,0.0002799479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99548125,0.0013487962,0.0008657393,0.00038601653,0.0013652565,0.0005529216],"domain_scores_gemma":[0.99739116,0.0013995982,0.00014059909,0.00032238764,0.0005749958,0.00017126661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016098406,0.00017477208,0.00024573502,0.0010403387,0.000399817,0.000978554,0.000853067,0.00009481851,0.000024843457],"category_scores_gemma":[0.00062151713,0.00013327651,0.000060629663,0.00063025573,0.000337882,0.0010269679,0.00024228731,0.0011571632,0.000037998685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074186835,0.00013097563,0.000025828316,0.00008239266,0.00002895186,0.00065817987,0.008379174,0.0007639015,0.0019025392,0.6098085,0.0002557014,0.37788963],"study_design_scores_gemma":[0.00020841233,0.018440457,0.003094118,0.003374224,0.000040516148,0.0012211674,0.06385919,0.26366472,0.066931054,0.5611815,0.016606592,0.0013780512],"about_ca_topic_score_codex":0.00017475673,"about_ca_topic_score_gemma":0.0002119761,"teacher_disagreement_score":0.37651157,"about_ca_system_score_codex":0.000164014,"about_ca_system_score_gemma":0.00021094031,"threshold_uncertainty_score":0.9436218},"labels":[],"label_agreement":null},{"id":"W4399552717","doi":"10.1613/jair.1.15155","title":"Mitigating Value Hallucination in Dyna-Style Planning via Multistep Predecessor Models","year":2024,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Hallucinating; Computer science; Reinforcement learning; Bootstrapping (finance); Artificial intelligence; Value (mathematics); Function (biology); Successor cardinal; Sample (material); Bellman equation; Machine learning; Algorithm; Mathematical optimization; Econometrics; Mathematics","score_opus":0.1987057900527737,"score_gpt":0.4453474910418657,"score_spread":0.24664170098909202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399552717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050352093,0.0019441413,0.94247717,0.0018950899,0.00096669997,0.00036296944,0.0000018885117,0.00008402641,0.001915903],"genre_scores_gemma":[0.95631075,0.00013852106,0.042860087,0.00003842357,0.0004738994,0.000021635246,0.0000010717757,0.000033785658,0.0001218312],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937815,0.00076476065,0.0017343761,0.0006438794,0.00203045,0.001045046],"domain_scores_gemma":[0.9956499,0.0019959111,0.00027296224,0.0005203468,0.001264336,0.0002965523],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.010032645,0.00025640425,0.00041138416,0.0020666001,0.00035621904,0.0013895925,0.0019873134,0.00020434882,0.000052483403],"category_scores_gemma":[0.0014179586,0.00023955024,0.00018735263,0.0033154693,0.00025806768,0.0036983583,0.00041606737,0.0017838042,0.0001961936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006659534,0.00024482803,0.000050364026,0.00012934576,0.000037990503,0.0011886855,0.013620905,0.2711004,0.018127918,0.1926791,0.00011036147,0.50264347],"study_design_scores_gemma":[0.000018745439,0.00027697123,0.00001824968,0.0006513834,0.0000040670056,0.00010055937,0.0021835829,0.73122627,0.07439232,0.19078285,0.00017234273,0.00017266402],"about_ca_topic_score_codex":0.0004407792,"about_ca_topic_score_gemma":0.00015799032,"teacher_disagreement_score":0.90595865,"about_ca_system_score_codex":0.00066737115,"about_ca_system_score_gemma":0.0006213395,"threshold_uncertainty_score":0.9996471},"labels":[],"label_agreement":null},{"id":"W4402531690","doi":"10.1613/jair.1.16653","title":"The State of Computer Vision Research in Africa","year":2024,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"ICT in Developing Communities","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; Queen's University; University of British Columbia","funders":"","keywords":"Computer science; Categorization; Field (mathematics); Parsing; Data science; Scopus; State (computer science); Taxonomy (biology); Listing (finance); Artificial intelligence; World Wide Web; Political science","score_opus":0.3472217178782154,"score_gpt":0.48926900132024925,"score_spread":0.14204728344203388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402531690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21770008,0.011952797,0.73243254,0.029046454,0.004135313,0.00070040347,0.0000030374633,0.00006839222,0.003961002],"genre_scores_gemma":[0.9882717,0.0014528825,0.0098124435,0.0000070141223,0.00021916175,0.0000046639234,9.333098e-8,0.000012273132,0.0002197686],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937032,0.001998453,0.0010123348,0.0001883564,0.002357967,0.00073970936],"domain_scores_gemma":[0.9892449,0.007813057,0.00009874431,0.0006072535,0.002136629,0.00009942768],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.030604405,0.000096211115,0.00020755392,0.0018066246,0.00039370733,0.0010480357,0.0033754574,0.00005619312,0.0000091876045],"category_scores_gemma":[0.00059637934,0.00006351262,0.00009439215,0.0038724646,0.00079829135,0.0006355024,0.0012115154,0.0021932786,0.00009885398],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000811875,0.00011429813,0.000009853671,0.00006937917,0.000023252454,0.00026290194,0.012852706,0.0014130595,0.0015286823,0.11359309,0.0026282242,0.86742336],"study_design_scores_gemma":[0.000021848438,0.0012851328,0.00014880068,0.0012561608,0.0000011282945,0.000084409716,0.0018980791,0.28212076,0.03170868,0.66449636,0.016856475,0.00012215717],"about_ca_topic_score_codex":0.00009820141,"about_ca_topic_score_gemma":0.00008489493,"teacher_disagreement_score":0.8673012,"about_ca_system_score_codex":0.00024917416,"about_ca_system_score_gemma":0.0009553738,"threshold_uncertainty_score":0.999989},"labels":[],"label_agreement":null},{"id":"W4404663741","doi":"10.1613/jair.1.15985","title":"Differentially Private Neural Tangent Kernels (DP-NTK) for Privacy-Preserving Data Generation","year":2024,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of British Columbia","funders":"Novo Nordisk; Natural Sciences and Engineering Research Council of Canada; Mitacs; Canadian Institute for Advanced Research","keywords":"Computer science; Generator (circuit theory); Metric (unit); Benchmark (surveying); Synthetic data; Tangent; Artificial intelligence; Differential privacy; Data mining; Quality (philosophy); Machine learning; Pattern recognition (psychology); Mathematics; Power (physics)","score_opus":0.3973325884084702,"score_gpt":0.4591663783214747,"score_spread":0.06183378991300453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404663741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050175566,0.0019878568,0.9073972,0.037243664,0.002345261,0.0005511678,0.000055877943,0.0001986902,0.000044723918],"genre_scores_gemma":[0.72746235,0.00090888893,0.26948264,0.000054781634,0.001897958,0.000030583713,0.00003818924,0.000050817573,0.00007377166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945415,0.00042039438,0.0012934213,0.00094215473,0.0018494935,0.0009529961],"domain_scores_gemma":[0.9883217,0.001397027,0.00029004883,0.008666562,0.0010781243,0.00024650915],"candidate_categories":["metaresearch","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.007860595,0.00025869143,0.000379774,0.0010214434,0.0004045192,0.0023973025,0.052243363,0.00020425621,0.00007426927],"category_scores_gemma":[0.04254904,0.00021513173,0.00017709985,0.001570684,0.00026634458,0.0032083653,0.073423594,0.0013520692,0.00006529779],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008543671,0.00022885093,0.000048466678,0.0002028365,0.00016727662,0.00023398561,0.00040174637,0.0003806452,0.10319884,0.033708163,0.15349779,0.707846],"study_design_scores_gemma":[0.000028106475,0.00027069426,0.000018919269,0.00014549014,0.00001244578,0.00005454151,0.000062069856,0.67213964,0.07245838,0.24826509,0.0063888812,0.00015572042],"about_ca_topic_score_codex":0.000036038826,"about_ca_topic_score_gemma":0.000041334413,"teacher_disagreement_score":0.70769024,"about_ca_system_score_codex":0.00028511428,"about_ca_system_score_gemma":0.00051924156,"threshold_uncertainty_score":0.99863833},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.21929592559695024,"score_gpt":0.49869199389354396,"score_spread":0.2793960682965937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409258158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38595536,0.00035380916,0.6127303,0.00035153626,0.0004148271,0.00011823363,1.9422707e-7,0.00002309378,0.000052621373],"genre_scores_gemma":[0.87240815,0.000027416065,0.12741467,0.000022537026,0.00010371281,0.0000041981625,6.919904e-8,0.000008009612,0.000011250755],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9957563,0.0011309272,0.0010354867,0.00042509584,0.0010137517,0.0006384068],"domain_scores_gemma":[0.9952238,0.0014249427,0.00026010294,0.0006019783,0.0022829666,0.00020618198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008975294,0.00017814021,0.00034856418,0.0009583941,0.00045076248,0.0005179428,0.0015295665,0.000095490366,0.000019473904],"category_scores_gemma":[0.002589159,0.00013062693,0.00012432029,0.002561848,0.0001803074,0.00072451326,0.0004093162,0.0017575872,0.0000074521304],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049445305,0.000096556025,0.0031481825,0.000050277056,0.000039062314,0.000016402915,0.0019307847,0.010410028,0.044319496,0.0070410254,0.00000938407,0.93288934],"study_design_scores_gemma":[0.000040029718,0.00030562066,0.0005420648,0.00026733728,0.000010326395,0.000019219931,0.0015890631,0.25781822,0.7080408,0.030876566,0.00031809666,0.00017270258],"about_ca_topic_score_codex":0.00013103998,"about_ca_topic_score_gemma":0.000102032,"teacher_disagreement_score":0.93271667,"about_ca_system_score_codex":0.00039559725,"about_ca_system_score_gemma":0.0011457462,"threshold_uncertainty_score":0.763594},"labels":[],"label_agreement":null},{"id":"W4413441258","doi":"10.1613/jair.1.19171","title":"An MRP Formulation for Supervised Learning: Generalized Temporal Difference Learning Models","year":2025,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Speech Recognition and Synthesis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Royal Academy of Engineering; UK Research and Innovation","keywords":"Computer science; Artificial intelligence; Supervised learning; Temporal difference learning; Machine learning; Artificial neural network","score_opus":0.30398104370192736,"score_gpt":0.4386553844920129,"score_spread":0.13467434079008556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413441258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16727781,0.000083197054,0.83074164,0.0010162375,0.00021826146,0.00022739657,7.210139e-7,0.00003851196,0.00039619213],"genre_scores_gemma":[0.9289361,0.00011138913,0.070235915,0.00004562367,0.00016858634,0.00001718525,0.0000038456415,0.000010616401,0.00047073426],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968988,0.00071483053,0.00078363245,0.00030508274,0.0008193708,0.00047831095],"domain_scores_gemma":[0.9964211,0.000980698,0.00020387645,0.00025978158,0.0019434534,0.00019107612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004473045,0.00013670791,0.0002997281,0.00092640024,0.0005681672,0.0006026554,0.0010788,0.0001237518,0.00007302209],"category_scores_gemma":[0.0013040028,0.000117797856,0.00019073869,0.0009670589,0.0000682543,0.00097538513,0.00010849336,0.00075643224,0.00002546778],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024616937,0.00021324537,0.00042018335,0.000027805017,0.000032610613,0.000010763599,0.0009859696,0.010607947,0.02596856,0.1288812,0.0000752419,0.8325303],"study_design_scores_gemma":[0.00007628693,0.0004746286,0.0000720478,0.00006417239,0.0000057608704,0.0000070328483,0.00073358795,0.76525235,0.07037262,0.16230457,0.0005375627,0.000099387544],"about_ca_topic_score_codex":0.0000492011,"about_ca_topic_score_gemma":0.000022099148,"teacher_disagreement_score":0.8324309,"about_ca_system_score_codex":0.0001237488,"about_ca_system_score_gemma":0.00041334843,"threshold_uncertainty_score":0.581142},"labels":[],"label_agreement":null},{"id":"W4414031611","doi":"10.1613/jair.1.18144","title":"Optimal Decision Trees for Interpretable and Constrained Clustering","year":2025,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"University of Toronto; Natural Sciences and Engineering Research Council of Canada; Government of Canada; Canadian Institute for Advanced Research","keywords":"Cluster analysis; Computer science; Artificial intelligence; Decision tree; Machine learning; Data mining","score_opus":0.11335411472548461,"score_gpt":0.44265946752776775,"score_spread":0.3293053528022831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414031611","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015502882,0.00018394098,0.9821101,0.0015904658,0.00019764525,0.00014348137,0.000004415941,0.000009129503,0.0002579551],"genre_scores_gemma":[0.4604657,0.0001106953,0.53918326,0.000029874493,0.00008412239,0.000011424872,3.3425863e-7,0.0000037052102,0.000110913825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987627,0.00005050936,0.00045578345,0.00018909432,0.0002879736,0.000253889],"domain_scores_gemma":[0.99759555,0.0014098552,0.00008519874,0.00022490068,0.0005931821,0.00009131108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024983971,0.0000659358,0.00015508453,0.0003994027,0.00024252177,0.00046031683,0.0007864407,0.000043421816,0.000007970101],"category_scores_gemma":[0.00091109704,0.00005486376,0.000054587155,0.00054992025,0.00016290584,0.00039776374,0.00032248945,0.0002509863,0.0000046119826],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052991298,0.000052981955,0.000009149874,0.000010462216,0.000014847357,0.0000040296645,0.00032793978,0.00076762406,0.003281912,0.04425559,0.00061255,0.9506099],"study_design_scores_gemma":[0.00005134961,0.00030853826,0.00004185872,0.00019622572,0.000004899438,0.00003112603,0.0009745793,0.9211384,0.014969371,0.0588286,0.0033884486,0.00006658491],"about_ca_topic_score_codex":0.0000140060765,"about_ca_topic_score_gemma":0.000020419939,"teacher_disagreement_score":0.95054334,"about_ca_system_score_codex":0.0000419924,"about_ca_system_score_gemma":0.00021257505,"threshold_uncertainty_score":0.44388458},"labels":[],"label_agreement":null},{"id":"W4414876758","doi":"10.1613/jair.1.19087","title":"Thousands of AI Authors on the Future of AI","year":2025,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Big Data and Business Intelligence","field":"Business, Management and Accounting","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Impact","funders":"Open Philanthropy Project","keywords":"Pessimism; Task (project management); Payment; Applications of artificial intelligence; Boosting (machine learning)","score_opus":0.18652627231969524,"score_gpt":0.4414091998803866,"score_spread":0.2548829275606914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414876758","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7087269,0.0030501778,0.07866249,0.16969399,0.0081077125,0.0012644221,0.000031258387,0.00005199821,0.03041107],"genre_scores_gemma":[0.9971141,0.00026164803,0.000077606564,0.0006591314,0.0015859106,0.0000034898426,0.000001868963,0.00001290475,0.00028330184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705297,0.000101478225,0.0010502199,0.00019620101,0.0012195087,0.00037961657],"domain_scores_gemma":[0.99541605,0.00061691855,0.00045706972,0.0004460492,0.003041181,0.000022766078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049737194,0.00015559013,0.0003665586,0.0011421941,0.00024904305,0.0002305159,0.0013310036,0.0001438136,0.00065584015],"category_scores_gemma":[0.001654602,0.00009606693,0.00020081061,0.0027426758,0.0005180692,0.00067277055,0.00029224937,0.0013176545,0.000078758785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006977047,0.0004269285,0.0021775244,0.00023681544,0.00007811916,0.00001509856,0.00014193826,0.00044783443,0.00676494,0.7344624,0.032671295,0.2218794],"study_design_scores_gemma":[0.000099947065,0.0003229637,0.002109139,0.0020891016,0.00010630259,0.000009947398,0.0077692973,0.00859441,0.31304538,0.47721526,0.18830776,0.00033050947],"about_ca_topic_score_codex":0.0001707078,"about_ca_topic_score_gemma":0.00008322054,"teacher_disagreement_score":0.30628043,"about_ca_system_score_codex":0.00003920204,"about_ca_system_score_gemma":0.00028862077,"threshold_uncertainty_score":0.71809894},"labels":[],"label_agreement":null},{"id":"W4415551573","doi":"10.70891/jair.2025.080018","title":"Blockchain Fraud Detection Using Ensemble Graph Neural Networks","year":2025,"lang":"","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Graph; Database transaction; Anonymity; Modular design; Cryptocurrency; Blockchain; Convolutional neural network; Artificial neural network","score_opus":0.1673559395360158,"score_gpt":0.43175027877153277,"score_spread":0.264394339235517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415551573","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03792794,0.0019006061,0.95434004,0.0019266739,0.0030566696,0.00053792546,0.000003856817,0.00005811314,0.00024819918],"genre_scores_gemma":[0.9806112,0.00083294144,0.017362118,0.00012554538,0.00088947004,0.000010212368,7.048861e-7,0.000028150655,0.00013964022],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99099904,0.0020051172,0.002665035,0.00079150626,0.0021168427,0.0014224539],"domain_scores_gemma":[0.99113744,0.0013050709,0.0010629436,0.0012991236,0.004809898,0.00038554522],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.012375265,0.00039193686,0.000688276,0.0034629798,0.0012494486,0.0014761486,0.003379049,0.00050768675,0.00006790055],"category_scores_gemma":[0.0021085073,0.00039062503,0.0004208053,0.007990291,0.0009464568,0.0009949462,0.00091634155,0.0036382545,0.000027964752],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031425507,0.0004051279,0.00008273429,0.000062495965,0.00009618626,0.00010057275,0.0005139499,0.05217779,0.06457905,0.022269284,0.00038764416,0.85901093],"study_design_scores_gemma":[0.000036358575,0.0004834433,0.000053077514,0.00032539028,0.000024557394,0.000087530505,0.00056581217,0.69261163,0.25762814,0.047662426,0.0003186475,0.00020299166],"about_ca_topic_score_codex":0.00021026123,"about_ca_topic_score_gemma":0.00009291821,"teacher_disagreement_score":0.9426833,"about_ca_system_score_codex":0.00080288417,"about_ca_system_score_gemma":0.0010928491,"threshold_uncertainty_score":0.99985456},"labels":[],"label_agreement":null},{"id":"W7117896362","doi":"10.1613/jair.1.19533","title":"Combining Constraint Programming and Machine Learning: From Current Progress to Future Opportunities","year":2025,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Constraint programming; Key (lock); Resource (disambiguation); Constraint (computer-aided design); Resource constraints; Open research","score_opus":0.21473514558467585,"score_gpt":0.41256032378544666,"score_spread":0.1978251782007708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117896362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01966806,0.0017339521,0.96556836,0.011661245,0.00085237355,0.0002487429,0.0000015446291,0.000035088597,0.00023062665],"genre_scores_gemma":[0.96514213,0.00063449907,0.033928096,0.000047345853,0.00019430267,0.000008226514,0.0000017252411,0.000005665416,0.000038032194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980698,0.0003063596,0.0005382764,0.00021424016,0.0005741988,0.00029709542],"domain_scores_gemma":[0.99826324,0.00032732822,0.00014903974,0.00014899539,0.0008957188,0.00021568972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018647469,0.00010544595,0.00019480301,0.0006714295,0.00031905196,0.00074174395,0.00043935957,0.000055483204,0.000039470033],"category_scores_gemma":[0.00027455584,0.00009237569,0.000054325374,0.00071371696,0.00026319554,0.00041480592,0.00023837529,0.0008203943,0.0000059572967],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032261894,0.00006028916,0.0010140778,0.000013420561,0.000018703424,0.000023661552,0.0018327886,0.00038523367,0.00016104976,0.08518232,0.000057634876,0.9112186],"study_design_scores_gemma":[0.00051163876,0.002743919,0.0040295646,0.0023934206,0.00006314746,0.00023999187,0.090367466,0.5655444,0.024450153,0.111990884,0.1965873,0.0010780906],"about_ca_topic_score_codex":0.000026185882,"about_ca_topic_score_gemma":0.0000366164,"teacher_disagreement_score":0.945474,"about_ca_system_score_codex":0.00007322568,"about_ca_system_score_gemma":0.00049321895,"threshold_uncertainty_score":0.7152654},"labels":[],"label_agreement":null}]}