{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023307381,0.00010963394,0.97524047,0.00007882988,0.000015903513,0.00003171539,0.000023963239,0.00018310429,0.0010089512],"genre_scores_gemma":[0.6523781,0.00012899234,0.34528714,0.00008075738,0.000018404517,0.00019317986,0.00009320434,0.000078354366,0.0017419141],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902487,0.00043882508,0.000060578543,0.00016352619,0.00022099637,0.000091161965],"domain_scores_gemma":[0.99639976,0.0026177156,0.00030308947,0.0003036343,0.00025695658,0.00011882021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018194399,0.0007013217,0.00090059725,0.00043142666,0.0003636199,0.00082343246,0.0012103941,0.0010735953,0.0021879298],"category_scores_gemma":[0.009021895,0.00046516428,0.00068642,0.0005604375,0.0015451089,0.0018808014,0.0015289307,0.0014715805,0.00025917825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001933607,0.000033911187,0.0009379204,0.000059709622,0.00003402476,0.00007814893,0.00015236891,0.9063586,0.0015002812,0.047256634,0.00035015238,0.04304481],"study_design_scores_gemma":[0.000014064965,0.000038539274,0.00005273847,0.000008295465,0.000004173721,0.000015208622,0.0000110135015,0.981024,0.0005599939,0.017954,0.0003122049,0.0000057746784],"about_ca_topic_score_codex":0.0026511108,"about_ca_topic_score_gemma":0.0029556297,"teacher_disagreement_score":0.0026511108,"about_ca_system_score_codex":0.0008666422,"about_ca_system_score_gemma":0.0011035926,"threshold_uncertainty_score":0.009622276},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082927555,0.0009295441,0.90266484,0.0024104838,0.00008823172,0.00009436345,0.0003526796,0.00027990554,0.010252258],"genre_scores_gemma":[0.90704787,0.00039738603,0.0869281,0.000230815,0.0001316826,0.00016462618,0.00023149334,0.000039092898,0.0048289015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99647444,0.0014383461,0.00017853272,0.0008098142,0.0007512094,0.00034761667],"domain_scores_gemma":[0.9739952,0.020264152,0.0022616743,0.0016734356,0.0011010007,0.000704496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00612537,0.00087103783,0.0010105299,0.0016261006,0.0010122196,0.0029532926,0.0024758065,0.0027705557,0.0041252375],"category_scores_gemma":[0.036039785,0.00068797474,0.0016064139,0.0013141505,0.0035095036,0.0061722873,0.0024764226,0.0028250217,0.0003822172],"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.0002338937,0.000091672795,0.0035154412,0.00015314911,0.00017200816,0.001268734,0.001268642,0.30989602,0.0009343217,0.6563142,0.0011202759,0.025031587],"study_design_scores_gemma":[0.000044401757,0.00006084747,0.0005073068,0.000022502425,0.000051529198,0.00014169901,0.00010602215,0.5645119,0.00040148073,0.43235758,0.0017558206,0.000038955157],"about_ca_topic_score_codex":0.006749735,"about_ca_topic_score_gemma":0.0041520814,"teacher_disagreement_score":0.006749735,"about_ca_system_score_codex":0.002658551,"about_ca_system_score_gemma":0.0009053887,"threshold_uncertainty_score":0.03239447},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08745124,0.0014415063,0.54571545,0.0008603614,0.00044335658,0.00075719313,0.0028778277,0.33968267,0.020770453],"genre_scores_gemma":[0.435146,0.00064013776,0.52563334,0.0012148183,0.0001242787,0.0014584308,0.007016465,0.020382384,0.008384137],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971789,0.0008534029,0.00025488294,0.000657174,0.0007907815,0.00026489582],"domain_scores_gemma":[0.99426985,0.0032554243,0.0004347561,0.0011465455,0.0006417581,0.00025173443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040007457,0.0022832886,0.000916618,0.0015468813,0.00057600363,0.0019953563,0.0037845767,0.001503434,0.010754858],"category_scores_gemma":[0.012599071,0.0010223916,0.0011162694,0.0010519244,0.0011381172,0.002835284,0.0020215067,0.0019203657,0.0055161496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034406297,0.0009244869,0.016084293,0.0023252384,0.00035751067,0.0007785499,0.0006699829,0.14984035,0.045962863,0.016930036,0.11985157,0.6428345],"study_design_scores_gemma":[0.000945139,0.0008008033,0.00207014,0.00018442195,0.000100809055,0.0006055683,0.00020998533,0.8306456,0.079653285,0.014175753,0.070448436,0.00016011446],"about_ca_topic_score_codex":0.0013484327,"about_ca_topic_score_gemma":0.001945941,"teacher_disagreement_score":0.010754858,"about_ca_system_score_codex":0.0012685534,"about_ca_system_score_gemma":0.0020464251,"threshold_uncertainty_score":0.035978556},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015365782,0.0005718336,0.98059833,0.0007504803,0.000044773795,0.000039399696,0.00010496991,0.0002761683,0.002248248],"genre_scores_gemma":[0.43334636,0.0010823457,0.5557263,0.0007501463,0.00022236722,0.0005387963,0.00069139316,0.0003672495,0.0072751134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984452,0.00089153356,0.000059610094,0.00022318629,0.00025960652,0.000120872704],"domain_scores_gemma":[0.9950942,0.0037941174,0.00031484992,0.0003053202,0.00033102647,0.00016043859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002731885,0.0013997697,0.001816618,0.0008989803,0.000630802,0.0017448458,0.001330915,0.0018359735,0.003212527],"category_scores_gemma":[0.011413706,0.0012573285,0.0013712086,0.00090020604,0.0021755055,0.0030860135,0.0030404846,0.0031417636,0.00074224186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001175928,0.00007875368,0.00080848334,0.00012975425,0.00008775517,0.00005969438,0.00007822097,0.8638356,0.00056174106,0.09266441,0.0031041466,0.038473852],"study_design_scores_gemma":[0.000012238497,0.000014344172,0.00007254497,0.000011979816,0.000004668891,0.000007736205,0.00000820812,0.95958406,0.00008631104,0.03963663,0.0005544522,0.000006847599],"about_ca_topic_score_codex":0.0045329155,"about_ca_topic_score_gemma":0.005641275,"teacher_disagreement_score":0.0045329155,"about_ca_system_score_codex":0.0012603926,"about_ca_system_score_gemma":0.0013909208,"threshold_uncertainty_score":0.014447808},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012574961,0.00037602326,0.97044957,0.000696197,0.00014625676,0.0001591058,0.000096611024,0.0006309685,0.0148702655],"genre_scores_gemma":[0.4145225,0.00048514918,0.57177204,0.0005753874,0.0003000202,0.00033350984,0.00023415386,0.00016374412,0.0116135385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99621236,0.0012641163,0.00022814312,0.00078658614,0.0012773959,0.00023150656],"domain_scores_gemma":[0.99419653,0.0030324387,0.00039595022,0.0011382945,0.0010374371,0.00019934517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00428034,0.00083476765,0.0006692883,0.0012564451,0.0011069509,0.002212001,0.001769271,0.0011429541,0.0062883343],"category_scores_gemma":[0.013646966,0.0003832936,0.0012315712,0.00080447947,0.0030033647,0.006624643,0.0028750163,0.0020187537,0.000846021],"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.00009551124,0.00006501001,0.00047583572,0.0002113901,0.000062538114,0.00015132992,0.000981892,0.007348304,0.003007941,0.8940115,0.0024247726,0.09116401],"study_design_scores_gemma":[0.00005228888,0.0001292862,0.00028300117,0.00007065912,0.00010144046,0.00029092625,0.00025128192,0.12166121,0.006223639,0.8438657,0.027017485,0.000053152948],"about_ca_topic_score_codex":0.0014837274,"about_ca_topic_score_gemma":0.0017080194,"teacher_disagreement_score":0.0062883343,"about_ca_system_score_codex":0.0011700941,"about_ca_system_score_gemma":0.001247085,"threshold_uncertainty_score":0.02263689},"labels":[],"label_agreement":null},{"id":"W1557519121","doi":"10.1613/jair.2293","title":"Graph Abstraction in Real-time Heuristic Search","year":2007,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"University of Alberta; Western Canada Research Grid","keywords":"Computer science; Abstraction; Incremental heuristic search; Heuristic; Graph; Maxima and minima; Theoretical computer science; Pathfinding; Class (philosophy); Situated; Beam search; Artificial intelligence; Search algorithm; Algorithm; Mathematics","score_opus":0.15994001886198067,"score_gpt":0.4311293688593298,"score_spread":0.2711893499973491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557519121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053449266,0.00065695704,0.94244564,0.00027081705,0.000023770308,0.0000622859,0.00006023758,0.0006141726,0.002416802],"genre_scores_gemma":[0.7175075,0.0007073586,0.27939638,0.000113232636,0.000034414363,0.00017811089,0.00017392822,0.00013117002,0.001757961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839586,0.00086036924,0.000065487126,0.00022634045,0.0003255981,0.00012634246],"domain_scores_gemma":[0.98812485,0.008507265,0.0007897236,0.0018183071,0.00051902793,0.00024082072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025261405,0.00060456677,0.0009087593,0.0011404792,0.000608115,0.001433952,0.0013404059,0.0010504203,0.002016126],"category_scores_gemma":[0.013946987,0.0006140378,0.0009819224,0.0015814962,0.002899691,0.0040706326,0.0016858291,0.001960537,0.00029945155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014718897,0.0000594166,0.0007875434,0.000143975,0.000042789725,0.00007252827,0.00023574625,0.82927996,0.0013930383,0.120023035,0.0005408597,0.047273893],"study_design_scores_gemma":[0.000029440565,0.00006262549,0.0002541703,0.000016916745,0.000018956809,0.000038072336,0.000032059328,0.83681434,0.00080803747,0.1605801,0.0013305943,0.000014703439],"about_ca_topic_score_codex":0.0039176657,"about_ca_topic_score_gemma":0.0028690663,"teacher_disagreement_score":0.0039176657,"about_ca_system_score_codex":0.0016650535,"about_ca_system_score_gemma":0.0014214781,"threshold_uncertainty_score":0.013359606},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082835175,0.007856597,0.88847655,0.0021359487,0.00038522645,0.00029884986,0.00023894517,0.0039195525,0.01385315],"genre_scores_gemma":[0.4612482,0.0028410892,0.5271543,0.0011136503,0.00016591417,0.00018919211,0.00041461518,0.00062504417,0.0062479894],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963959,0.0011105128,0.00019414604,0.0005969481,0.0013343431,0.00036812312],"domain_scores_gemma":[0.990699,0.0047565475,0.00058250263,0.0024264788,0.0012728488,0.00026267068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029964508,0.0010848591,0.0014526519,0.0011443644,0.0013928083,0.0017544366,0.0040422776,0.0015753829,0.0041456213],"category_scores_gemma":[0.011240119,0.0009769218,0.0015287203,0.0032416913,0.0025691336,0.0030698297,0.0021958922,0.0039893254,0.00075697043],"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.00057436636,0.0005006729,0.0065696775,0.0015924142,0.0003276474,0.0008201448,0.0013147927,0.22403783,0.015139672,0.15391637,0.014547879,0.5806585],"study_design_scores_gemma":[0.00023059873,0.00029690473,0.0020423105,0.0001629315,0.00030927578,0.0014666087,0.00033691427,0.78485715,0.03418275,0.13385019,0.04212702,0.000137292],"about_ca_topic_score_codex":0.007300815,"about_ca_topic_score_gemma":0.006748482,"teacher_disagreement_score":0.007300815,"about_ca_system_score_codex":0.0014769026,"about_ca_system_score_gemma":0.0020728281,"threshold_uncertainty_score":0.015846908},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21872748,0.0004652318,0.75675464,0.0009425604,0.000101484984,0.00025426073,0.00066062703,0.0012118659,0.020881902],"genre_scores_gemma":[0.46599755,0.000279672,0.5260551,0.00031605575,0.00007500696,0.00040672,0.0012548137,0.00034770096,0.005267362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912924,0.00031497405,0.000036241658,0.00020599611,0.00016541869,0.00014818662],"domain_scores_gemma":[0.9975497,0.0016448756,0.00024687164,0.00031598765,0.00014411887,0.00009841888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011623983,0.0011176112,0.00081470626,0.00044349063,0.00044264973,0.0009311536,0.0013478282,0.0010018861,0.0050430642],"category_scores_gemma":[0.005434456,0.00048812228,0.0012120652,0.0009203846,0.00063187635,0.0014560693,0.0012675244,0.0017016715,0.0005816724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024361744,0.00017700861,0.0008088305,0.00019927575,0.000042823915,0.00014635814,0.00012244226,0.9222564,0.0034022038,0.019377545,0.004432506,0.04879097],"study_design_scores_gemma":[0.00006488798,0.00010181478,0.00015921751,0.000012062823,0.000011446759,0.000059264075,0.00006472383,0.98171186,0.0010659668,0.014894228,0.0018482583,0.00000619161],"about_ca_topic_score_codex":0.0024663014,"about_ca_topic_score_gemma":0.0029501745,"teacher_disagreement_score":0.0050430642,"about_ca_system_score_codex":0.0009944803,"about_ca_system_score_gemma":0.001142228,"threshold_uncertainty_score":0.016870737},"labels":[],"label_agreement":null},{"id":"W1621585639","doi":"10.1613/jair.740","title":"Partial-Order Planning with Concurrent Interacting Actions","year":2001,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":115,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia","keywords":"Planner; Computer science; Order (exchange); Plan (archaeology); Representation (politics); Task (project management); Action (physics); Simple (philosophy); Control (management); Distributed computing; Artificial intelligence; Engineering; Systems engineering; Economics","score_opus":0.328713626214809,"score_gpt":0.4722555756749504,"score_spread":0.14354194946014143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1621585639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007944752,0.00020248338,0.9847835,0.00024635563,0.000032933487,0.000122976,0.000094133895,0.00068314624,0.005889746],"genre_scores_gemma":[0.2155594,0.00052693486,0.77851623,0.00012815012,0.000034682544,0.00043807237,0.0004350371,0.00012375486,0.0042377394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984617,0.00052717084,0.00013113455,0.00024080931,0.00052066275,0.00011846987],"domain_scores_gemma":[0.99783164,0.0014040023,0.00016024572,0.00028883398,0.00020854428,0.000106828025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00181086,0.00095004,0.00065476994,0.00059411203,0.00088391,0.0014964945,0.0013250503,0.0008691508,0.0032384035],"category_scores_gemma":[0.004596287,0.00072232855,0.0013980723,0.00083185034,0.0027890257,0.0023002634,0.0024255337,0.0015046778,0.00055858213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013908118,0.000084868436,0.0005241311,0.0003004492,0.00008618677,0.00067129644,0.000617283,0.5553519,0.003473209,0.36944056,0.0023519024,0.06695913],"study_design_scores_gemma":[0.00007879989,0.000066311426,0.00010509001,0.000036647758,0.00004436118,0.0001301682,0.000098126984,0.67243636,0.0035417485,0.31155723,0.011874442,0.000030671028],"about_ca_topic_score_codex":0.0060364967,"about_ca_topic_score_gemma":0.010082398,"teacher_disagreement_score":0.0060364967,"about_ca_system_score_codex":0.0011543493,"about_ca_system_score_gemma":0.0024340032,"threshold_uncertainty_score":0.0120027065},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002782991,0.00006071873,0.98968214,0.00011491104,0.00002106624,0.00014069972,0.0007570587,0.0050140796,0.0014262964],"genre_scores_gemma":[0.06049835,0.00016504813,0.9317976,0.00012515337,0.00005327643,0.0002621663,0.0046602986,0.0010063753,0.0014316012],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965564,0.0007941349,0.00040444446,0.0008660828,0.0011970456,0.00018204428],"domain_scores_gemma":[0.9927672,0.0046567875,0.0003437273,0.0010596141,0.0010650089,0.0001076642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00264024,0.0012558372,0.0011306017,0.0039298786,0.001402543,0.003101728,0.0032214643,0.001394953,0.0073282258],"category_scores_gemma":[0.020018164,0.0010477798,0.002843345,0.0035709466,0.0017397004,0.005539873,0.003441072,0.0028931445,0.004500958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035498443,0.00033486955,0.00234296,0.00089867477,0.00020587994,0.0008790349,0.0013631675,0.08641733,0.019926695,0.23600797,0.027658263,0.62361014],"study_design_scores_gemma":[0.00007249496,0.00003732073,0.0005316376,0.00008172255,0.00009033585,0.00022685321,0.00017572573,0.63248426,0.021351136,0.3251635,0.019729434,0.000055605757],"about_ca_topic_score_codex":0.0036052656,"about_ca_topic_score_gemma":0.0060021277,"teacher_disagreement_score":0.0073282258,"about_ca_system_score_codex":0.0012536186,"about_ca_system_score_gemma":0.0025201354,"threshold_uncertainty_score":0.02451533},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03187528,0.005143562,0.9355267,0.0052976403,0.00025376538,0.00011212847,0.0010666334,0.00047443938,0.020249868],"genre_scores_gemma":[0.7229849,0.0054058842,0.258254,0.0008200248,0.0010487897,0.0005380917,0.0014796007,0.00023994483,0.009228783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975967,0.0013430915,0.00014431299,0.00035091175,0.00043023215,0.00013462025],"domain_scores_gemma":[0.9927769,0.00515273,0.00053813757,0.00070886395,0.00062103686,0.00020228051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028091045,0.000881384,0.00095164933,0.0044672242,0.00092080265,0.0058356994,0.001745973,0.0013750126,0.0053647794],"category_scores_gemma":[0.018301178,0.00041647107,0.0015363912,0.005264552,0.0038302012,0.01662653,0.002092414,0.0022276328,0.0010126512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006323949,0.000025757972,0.0011666202,0.00009833342,0.0000396696,0.000048510527,0.0009852167,0.010375412,0.00017360049,0.9436175,0.0022763766,0.04112974],"study_design_scores_gemma":[0.000007608036,0.000013824832,0.00019851633,0.000024517338,0.000008953666,0.000045042925,0.00014986271,0.0341371,0.000044009954,0.9621933,0.0031675901,0.000009558034],"about_ca_topic_score_codex":0.004393936,"about_ca_topic_score_gemma":0.0028052628,"teacher_disagreement_score":0.0058356994,"about_ca_system_score_codex":0.0018440483,"about_ca_system_score_gemma":0.0011461966,"threshold_uncertainty_score":0.017946959},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007114289,0.0006826852,0.98311317,0.0016948021,0.000100532365,0.000054359385,0.00020544973,0.00013380847,0.0069009145],"genre_scores_gemma":[0.44430116,0.004614296,0.53538597,0.004589047,0.0014163941,0.0006227141,0.0014639512,0.00045880995,0.0071476614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99496067,0.0023630185,0.00025507814,0.0011805558,0.00094160234,0.0002990202],"domain_scores_gemma":[0.92396224,0.064743534,0.003096896,0.0037000359,0.003214132,0.0012830629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009477746,0.0015278276,0.0018431118,0.0026645344,0.0018462851,0.0020887991,0.0016771435,0.0025660929,0.0074798125],"category_scores_gemma":[0.062409353,0.0015041727,0.003961305,0.0031817788,0.006512576,0.009251128,0.00592639,0.0077617257,0.0012879604],"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.000095824216,0.000066580214,0.0011140835,0.0002576219,0.000103577484,0.00022203967,0.00052309124,0.03013129,0.0008392462,0.9364376,0.0032210401,0.02698804],"study_design_scores_gemma":[0.000020066602,0.000016537802,0.00028784914,0.000039851147,0.00001817856,0.00006697651,0.000024461973,0.034974784,0.00026321184,0.9622414,0.0020243411,0.00002233203],"about_ca_topic_score_codex":0.0058380347,"about_ca_topic_score_gemma":0.0033794104,"teacher_disagreement_score":0.009477746,"about_ca_system_score_codex":0.0024157313,"about_ca_system_score_gemma":0.0022019437,"threshold_uncertainty_score":0.05012375},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09591879,0.00008921867,0.89621115,0.0000960365,0.00004728784,0.00025450962,0.000025407078,0.004415188,0.002942406],"genre_scores_gemma":[0.5686299,0.00009953748,0.42710024,0.00008123036,0.000029740942,0.00031292843,0.000116182266,0.0002664943,0.0033636314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995541,0.000107465086,0.000032047476,0.00012647721,0.00012871446,0.000051188283],"domain_scores_gemma":[0.99844235,0.00079346384,0.00018890125,0.00028410708,0.00019159587,0.00009956884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011456525,0.00093502674,0.0007912785,0.00046153084,0.0003441231,0.0005655198,0.0015439946,0.00071445,0.0036160012],"category_scores_gemma":[0.0046338225,0.00046985666,0.00043597078,0.00029795733,0.00060593535,0.0012424581,0.0012177264,0.0011714023,0.0010704844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005961486,0.000903324,0.00233347,0.00019335368,0.00010751874,0.00018838246,0.00033131673,0.31322524,0.06351679,0.0066761123,0.0016915315,0.6102368],"study_design_scores_gemma":[0.00009314164,0.00027275653,0.0004715872,0.000014517252,0.000036111374,0.00009134388,0.000026896467,0.96743083,0.023522757,0.0055514593,0.0024683003,0.000020313966],"about_ca_topic_score_codex":0.0014857153,"about_ca_topic_score_gemma":0.0012978375,"teacher_disagreement_score":0.0036160012,"about_ca_system_score_codex":0.00044604554,"about_ca_system_score_gemma":0.0006759282,"threshold_uncertainty_score":0.012096763},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11907723,0.00008316888,0.87716705,0.00017519505,0.00002136296,0.00005266925,0.000016486618,0.00073772244,0.0026690932],"genre_scores_gemma":[0.9457831,0.00004690671,0.052645832,0.000033660657,0.0000081672315,0.00006776935,0.000019388435,0.00002341401,0.0013719057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938524,0.00023551816,0.000028106324,0.00010860332,0.00015554958,0.00008695967],"domain_scores_gemma":[0.9958956,0.002361286,0.00047243264,0.00084554614,0.00027995728,0.00014525086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014046049,0.00065310026,0.00065463484,0.00024137936,0.0002388503,0.00050026865,0.0013743608,0.0007705024,0.0013653109],"category_scores_gemma":[0.006951879,0.00033900738,0.00030973874,0.00021462707,0.0012728894,0.0013757927,0.001438488,0.0012365663,0.00022306474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021967253,0.00015043486,0.0016646644,0.00008514465,0.00003645266,0.00013549013,0.00018259142,0.9001032,0.009209661,0.03314264,0.00039072844,0.05467931],"study_design_scores_gemma":[0.000024732211,0.00006284487,0.00009283708,0.0000030322615,0.0000040610134,0.000016029959,0.000004221215,0.99240136,0.0010912344,0.006090937,0.00020483858,0.0000039156275],"about_ca_topic_score_codex":0.0016659484,"about_ca_topic_score_gemma":0.0013328297,"teacher_disagreement_score":0.0016659484,"about_ca_system_score_codex":0.0005211018,"about_ca_system_score_gemma":0.00078687817,"threshold_uncertainty_score":0.0074282885},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37186256,0.00034708614,0.60180956,0.0017203317,0.000027767592,0.00018708293,0.0001740203,0.00018145,0.02369013],"genre_scores_gemma":[0.941676,0.00014060437,0.055641145,0.00010842758,0.000017913231,0.00022663578,0.000060479364,0.000018850084,0.0021099872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99684453,0.0013649743,0.00025338377,0.00057454384,0.0006127968,0.00034980636],"domain_scores_gemma":[0.9719312,0.019595042,0.0034243374,0.0026276335,0.0015220459,0.0008996659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042461734,0.00051576714,0.00083547755,0.00062555977,0.0010091364,0.0023585798,0.0016111272,0.0015919466,0.0030833154],"category_scores_gemma":[0.030236768,0.0004407434,0.0007160345,0.00057654,0.0025052296,0.005905238,0.002574283,0.0019000914,0.00036572057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000242025,0.0001853636,0.008217545,0.00024498676,0.0001297884,0.00065768766,0.0009628307,0.15022181,0.0043734238,0.8092673,0.0011405635,0.024356859],"study_design_scores_gemma":[0.000087146065,0.00010425841,0.0011339152,0.00005805788,0.00002828091,0.00023125095,0.00040395837,0.36755657,0.0028300094,0.62413806,0.0033963693,0.000032224892],"about_ca_topic_score_codex":0.0012327443,"about_ca_topic_score_gemma":0.0010806276,"teacher_disagreement_score":0.0042461734,"about_ca_system_score_codex":0.001293121,"about_ca_system_score_gemma":0.001005973,"threshold_uncertainty_score":0.02245617},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038843937,0.00011791207,0.9535618,0.00087250076,0.000029885088,0.0001356959,0.00020597756,0.0003681207,0.0058642025],"genre_scores_gemma":[0.7040501,0.00024777194,0.2888987,0.00054205715,0.000106473046,0.0006412487,0.0006942186,0.00025506213,0.0045643505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9923253,0.0034129436,0.00037547929,0.0012846583,0.0019945984,0.0006071115],"domain_scores_gemma":[0.97579896,0.016071755,0.0018534765,0.0044467556,0.001317721,0.00051126734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004732098,0.0007103413,0.0010370337,0.0009797399,0.0012765889,0.0023715792,0.003044533,0.0017321339,0.0057245875],"category_scores_gemma":[0.027648399,0.0008801591,0.0014765481,0.0016747573,0.0035814033,0.0060597127,0.0025622146,0.0029705353,0.0005272062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007372761,0.00008562951,0.0007212636,0.00010684361,0.000055467124,0.00014414036,0.00020424832,0.17603819,0.0014815304,0.81047356,0.0012987506,0.0093166595],"study_design_scores_gemma":[0.000052550917,0.000043020875,0.00016613516,0.000014343321,0.000015982236,0.000105736464,0.00005335008,0.4164213,0.0014961599,0.57894295,0.0026683856,0.000020066162],"about_ca_topic_score_codex":0.0018049489,"about_ca_topic_score_gemma":0.00207395,"teacher_disagreement_score":0.0057245875,"about_ca_system_score_codex":0.0015334439,"about_ca_system_score_gemma":0.001793482,"threshold_uncertainty_score":0.025026023},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01947948,0.0007971837,0.9714541,0.00045522008,0.00005580708,0.00013513232,0.00014145278,0.0007788165,0.006702901],"genre_scores_gemma":[0.4292706,0.0005799503,0.5614495,0.00048286896,0.00014129328,0.0006730146,0.0008916016,0.00047618724,0.006035013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987953,0.0005842615,0.000030395655,0.00022152517,0.00025513786,0.00011343494],"domain_scores_gemma":[0.9982374,0.0012188478,0.00012308845,0.00013475885,0.00015943586,0.00012654331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017257844,0.00080714165,0.0015520494,0.0011795469,0.00094516104,0.0009807298,0.0021341953,0.0014057343,0.0053288],"category_scores_gemma":[0.0056507383,0.00047877853,0.0007046427,0.0015179522,0.0011166561,0.0019163952,0.0021893138,0.0016494439,0.0009444337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001472696,0.00014212068,0.00045426603,0.0002536058,0.0000692423,0.000111174675,0.000089716414,0.86239964,0.0014146324,0.06645794,0.008497393,0.059962988],"study_design_scores_gemma":[0.0000389607,0.00003372491,0.000046981364,0.000009594865,0.0000071600907,0.00002959401,0.000015475358,0.9752516,0.0003503914,0.022386145,0.0018231645,0.0000071301497],"about_ca_topic_score_codex":0.0027071263,"about_ca_topic_score_gemma":0.004472312,"teacher_disagreement_score":0.0053288,"about_ca_system_score_codex":0.001339119,"about_ca_system_score_gemma":0.0015623991,"threshold_uncertainty_score":0.017826617},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006249705,0.00010485728,0.99183685,0.000059796555,0.000013956565,0.000028773888,0.00004198347,0.00019030545,0.0014737931],"genre_scores_gemma":[0.48157418,0.0003619051,0.5151876,0.000057645902,0.000031890395,0.0003315104,0.00026000882,0.00016264713,0.0020326057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990777,0.0003568742,0.00004609062,0.000104319886,0.00032559497,0.00008939272],"domain_scores_gemma":[0.9959572,0.0029563878,0.0003012829,0.00035090803,0.00029906322,0.00013505906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021450366,0.0009475613,0.0012485987,0.0007497215,0.0006603666,0.0014174066,0.0018183101,0.0009319307,0.003713108],"category_scores_gemma":[0.008311304,0.00067735335,0.0010331317,0.00074238045,0.0012413852,0.0017627766,0.0017992468,0.0024725127,0.00054714934],"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.000041462517,0.000015337446,0.00023693664,0.00004922326,0.0000134503225,0.000031491174,0.000061588726,0.94572294,0.00022059474,0.0442944,0.0002493987,0.009063159],"study_design_scores_gemma":[0.0000066584184,0.000009211825,0.000017260612,0.0000071719187,0.0000023735165,0.0000043908844,0.000009627853,0.9823615,0.00013492533,0.017103994,0.00034056866,0.0000023007103],"about_ca_topic_score_codex":0.0063932748,"about_ca_topic_score_gemma":0.007936267,"teacher_disagreement_score":0.0063932748,"about_ca_system_score_codex":0.0017999575,"about_ca_system_score_gemma":0.0017536266,"threshold_uncertainty_score":0.013059676},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7591165,0.0021453598,0.21022129,0.00090575154,0.00029287944,0.0029320642,0.0055439156,0.005009597,0.01383272],"genre_scores_gemma":[0.7684226,0.0006208124,0.21160853,0.00056642847,0.00016206446,0.0020772046,0.012088141,0.00045138106,0.0040029394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99306715,0.0037110113,0.00050669,0.0012603789,0.0011357432,0.0003190203],"domain_scores_gemma":[0.9679272,0.024277663,0.00095005025,0.0040332507,0.00219508,0.0006166896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007609872,0.0013053673,0.0013219637,0.001293766,0.0010236192,0.0011280854,0.002311356,0.0022194923,0.0037268784],"category_scores_gemma":[0.024734033,0.0004371383,0.0009391369,0.0019255403,0.0014577362,0.0024910388,0.0017798879,0.002207145,0.001511545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0044598193,0.015839985,0.022639483,0.0028209556,0.0010336356,0.00082663354,0.0024632295,0.401255,0.018496336,0.009668214,0.032425214,0.4880715],"study_design_scores_gemma":[0.00061585795,0.001282715,0.009758797,0.00009425888,0.00011657504,0.00045330427,0.00061781716,0.94869447,0.015228538,0.014619494,0.008398741,0.00011933897],"about_ca_topic_score_codex":0.005965608,"about_ca_topic_score_gemma":0.0051007816,"teacher_disagreement_score":0.007609872,"about_ca_system_score_codex":0.0012040398,"about_ca_system_score_gemma":0.0010850427,"threshold_uncertainty_score":0.040245354},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075534405,0.00008846814,0.99334997,0.00021972008,0.000053231368,0.00012717927,0.00087154197,0.0027535837,0.0017809952],"genre_scores_gemma":[0.030118238,0.00039546017,0.963713,0.00028166806,0.00006756966,0.0006121541,0.0019319252,0.00037284225,0.0025071201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775213,0.00075987575,0.0002961987,0.00035954695,0.00071762095,0.000114714996],"domain_scores_gemma":[0.9924452,0.0053756493,0.00058673456,0.00073893263,0.0005982162,0.0002553538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047768247,0.0016152813,0.0010688056,0.003025199,0.0015405304,0.0046622297,0.003473893,0.0022845338,0.012635843],"category_scores_gemma":[0.019922443,0.0013246981,0.0021326463,0.0029349476,0.0019603278,0.0066453107,0.0032633566,0.0045308545,0.002852042],"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.00033006925,0.00017903332,0.0016121883,0.00091829686,0.00019352064,0.0006519752,0.00052850705,0.13821486,0.0025984845,0.6596987,0.023547726,0.17152666],"study_design_scores_gemma":[0.00006504894,0.00003646118,0.00014014813,0.0001487767,0.00006288696,0.00021906562,0.000074197735,0.42488253,0.0026136402,0.5245216,0.047184963,0.000050738006],"about_ca_topic_score_codex":0.0102061825,"about_ca_topic_score_gemma":0.017988311,"teacher_disagreement_score":0.012635843,"about_ca_system_score_codex":0.0016696333,"about_ca_system_score_gemma":0.0032020176,"threshold_uncertainty_score":0.042271137},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12660308,0.0003472233,0.8620867,0.0012013835,0.00009216568,0.00012592041,0.00011798292,0.0005209127,0.008904617],"genre_scores_gemma":[0.88917106,0.00017274021,0.107621916,0.00019974183,0.000068091475,0.00010239371,0.00008116611,0.00005274714,0.002530144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99400663,0.0020632101,0.0003537843,0.0012902075,0.0017819736,0.000504138],"domain_scores_gemma":[0.97084695,0.020853443,0.0027380597,0.00309331,0.0018129495,0.00065525254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069193165,0.00062391226,0.000600638,0.0012068518,0.0008418285,0.0029355462,0.0016035166,0.0015661571,0.0026029674],"category_scores_gemma":[0.033132,0.00056306855,0.0016670846,0.00064114196,0.004833991,0.006638172,0.0024525286,0.0026594035,0.00019099428],"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.00057373126,0.00016122773,0.01062315,0.00038068762,0.00037784595,0.0022761736,0.0054984232,0.09029905,0.012882672,0.80304456,0.0011597618,0.07272271],"study_design_scores_gemma":[0.00008248456,0.00014969394,0.0025688992,0.000067005974,0.00018407208,0.00040382883,0.00051097746,0.23945558,0.0082784705,0.74466395,0.0035428856,0.00009223703],"about_ca_topic_score_codex":0.0039724526,"about_ca_topic_score_gemma":0.0031713182,"teacher_disagreement_score":0.0069193165,"about_ca_system_score_codex":0.001771629,"about_ca_system_score_gemma":0.0012858766,"threshold_uncertainty_score":0.03659326},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29200453,0.00073954347,0.6831886,0.0016046993,0.00007349757,0.00015273747,0.00021229516,0.00028016896,0.021743817],"genre_scores_gemma":[0.96271205,0.00033270035,0.03190973,0.0002616206,0.00005148791,0.00014881721,0.00018292735,0.00007640994,0.004324198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992211,0.0002187667,0.000029838437,0.00016406368,0.00023333011,0.00013294279],"domain_scores_gemma":[0.99649054,0.0022990282,0.0003910887,0.0002767192,0.00028246886,0.0002601982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012012263,0.00029818155,0.0007491562,0.0008057077,0.00062904623,0.0014315874,0.0014742475,0.0010788143,0.0065172887],"category_scores_gemma":[0.0100517,0.0002867737,0.0007190696,0.00061653485,0.0017634756,0.004381355,0.0012928064,0.0014835917,0.00036347503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014423407,0.00010832116,0.0017528259,0.00014458664,0.000037505724,0.00022247649,0.00023928752,0.23688893,0.0052925814,0.74154776,0.0017763873,0.011845045],"study_design_scores_gemma":[0.000028829261,0.000048471753,0.00045268866,0.000013021237,0.000011476503,0.00009292746,0.000057358662,0.7413581,0.0010971325,0.25527066,0.0015557561,0.000013561653],"about_ca_topic_score_codex":0.0015147771,"about_ca_topic_score_gemma":0.000668718,"teacher_disagreement_score":0.0065172887,"about_ca_system_score_codex":0.0012866638,"about_ca_system_score_gemma":0.0006216238,"threshold_uncertainty_score":0.021802485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09296086,0.0012956898,0.8946701,0.0024148617,0.0002946137,0.00009322297,0.00014204941,0.0016443231,0.006484263],"genre_scores_gemma":[0.7328204,0.00041038918,0.25925183,0.0010325294,0.00023330883,0.00011476817,0.0003403554,0.00017893783,0.0056175278],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994522,0.00012141929,0.00004017654,0.0001760404,0.00012887365,0.000081344806],"domain_scores_gemma":[0.9976126,0.0014087205,0.0003109476,0.00019072159,0.00030072525,0.0001762027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016821591,0.00071125646,0.00091836555,0.00085689867,0.00048447648,0.001311887,0.0014053568,0.0019484181,0.004053406],"category_scores_gemma":[0.010272257,0.00032657117,0.00033954546,0.0005808826,0.0010500981,0.0028774708,0.00094348035,0.00126527,0.0011326295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000676846,0.0002873026,0.009524322,0.00016134224,0.00020317311,0.00013488621,0.00025118145,0.17270334,0.003927195,0.0386159,0.017888105,0.75562644],"study_design_scores_gemma":[0.00008599567,0.00014585284,0.00062599435,0.000032909797,0.000038360777,0.00009514088,0.00004986963,0.93272597,0.0023479941,0.06087775,0.0029501843,0.000023985469],"about_ca_topic_score_codex":0.0017205414,"about_ca_topic_score_gemma":0.0019390575,"teacher_disagreement_score":0.004053406,"about_ca_system_score_codex":0.0005319397,"about_ca_system_score_gemma":0.0009249102,"threshold_uncertainty_score":0.013559997},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007834559,0.00059739756,0.98836726,0.0004502537,0.000084024134,0.000059687758,0.000021236121,0.00011217046,0.002473431],"genre_scores_gemma":[0.48754722,0.0018566932,0.5073157,0.0003108645,0.00041242223,0.00021668152,0.00012521623,0.0001331695,0.0020820438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959531,0.001799815,0.00025255838,0.00048159505,0.0011759342,0.00033698598],"domain_scores_gemma":[0.9895257,0.008286697,0.0005098211,0.00060216436,0.00076779805,0.00030787685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064355773,0.0014522272,0.0014591661,0.0015497995,0.0011420584,0.0028245396,0.0020265924,0.0014516797,0.0018921907],"category_scores_gemma":[0.015402394,0.00075636216,0.0011883876,0.0021428873,0.0019115818,0.0039028856,0.0021959634,0.002642799,0.00033638935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004457059,0.00010307765,0.0006196233,0.00012709736,0.000052755175,0.00006253454,0.00010679566,0.833649,0.0009532784,0.12368965,0.0007857489,0.039805833],"study_design_scores_gemma":[0.000008441081,0.000026783473,0.000068335445,0.000009773559,0.00001173945,0.000014097312,0.000022093973,0.94810987,0.00022615449,0.05049564,0.0009987425,0.000008333745],"about_ca_topic_score_codex":0.0050838604,"about_ca_topic_score_gemma":0.0047770874,"teacher_disagreement_score":0.0064355773,"about_ca_system_score_codex":0.003059749,"about_ca_system_score_gemma":0.004660579,"threshold_uncertainty_score":0.034034967},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026415426,0.0016166964,0.99139845,0.00042699874,0.00005137541,0.000028609562,0.000026973823,0.00015879466,0.0036505486],"genre_scores_gemma":[0.40890184,0.0053397454,0.579154,0.0003976249,0.00069555856,0.0003225902,0.00014884466,0.00023583799,0.0048039425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979101,0.0006689448,0.0001443809,0.0004256431,0.00065076613,0.0002002043],"domain_scores_gemma":[0.997131,0.001434635,0.000261027,0.00061145774,0.0003447295,0.00021715002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028845035,0.0011413118,0.0014734005,0.0017225302,0.0006713306,0.0036461654,0.0033638987,0.0019395127,0.0025684263],"category_scores_gemma":[0.006080213,0.00054745685,0.0016360818,0.0019844936,0.004815147,0.0069089467,0.0028165178,0.0030891001,0.0006487027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058260284,0.000047386642,0.0003876394,0.00020071458,0.000047276455,0.000069691334,0.00019865789,0.34215295,0.00085170584,0.59739923,0.00100643,0.057580102],"study_design_scores_gemma":[0.000026974376,0.000066986904,0.00016397299,0.000055446828,0.000018859402,0.000049204893,0.000047483212,0.6893959,0.00051685405,0.30158013,0.008054414,0.000023805436],"about_ca_topic_score_codex":0.004034313,"about_ca_topic_score_gemma":0.0021588544,"teacher_disagreement_score":0.004034313,"about_ca_system_score_codex":0.0024713627,"about_ca_system_score_gemma":0.0021843733,"threshold_uncertainty_score":0.017931044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021532038,0.0013953716,0.9594408,0.00057756266,0.00012130583,0.00007636135,0.00003513585,0.0005493908,0.016272029],"genre_scores_gemma":[0.7625882,0.0012091359,0.22927044,0.00032509438,0.00013204932,0.00036691112,0.00008285041,0.0001614613,0.00586383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987207,0.0004943867,0.000058811387,0.00024592958,0.0003553396,0.00012477995],"domain_scores_gemma":[0.9960867,0.002785562,0.0003242839,0.00040036577,0.00029528525,0.00010774352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019906652,0.0008131384,0.0007367433,0.0006983082,0.00047445451,0.0017598841,0.0015614154,0.0011229492,0.0034524372],"category_scores_gemma":[0.009126629,0.000543997,0.00044543896,0.0008389702,0.0031927652,0.0025729316,0.0013434516,0.001477891,0.00041495488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014014261,0.00008202504,0.00033649965,0.00018091855,0.000037802383,0.00009041041,0.00013575538,0.74125946,0.001836428,0.18540332,0.0013026608,0.06919452],"study_design_scores_gemma":[0.00005233318,0.00004732352,0.000083509025,0.000018803954,0.000010645533,0.000029745666,0.000022222728,0.9146658,0.0007984615,0.080444194,0.0038149087,0.0000119341485],"about_ca_topic_score_codex":0.004558701,"about_ca_topic_score_gemma":0.002517963,"teacher_disagreement_score":0.004558701,"about_ca_system_score_codex":0.0018039098,"about_ca_system_score_gemma":0.001408303,"threshold_uncertainty_score":0.013088286},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8431463,0.024526648,0.11092412,0.0034388534,0.0002914163,0.0008704404,0.0015181032,0.00034396572,0.0149401575],"genre_scores_gemma":[0.91961807,0.0063589723,0.06752194,0.00080596923,0.0002885,0.0004767551,0.0034263441,0.00024634367,0.0012571048],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.90215313,0.070044555,0.0046604383,0.0076723453,0.014593883,0.0008755882],"domain_scores_gemma":[0.32411367,0.6103453,0.01903173,0.026870593,0.017848212,0.0017904995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.074623875,0.001142854,0.0012487824,0.006404977,0.0020423615,0.0031646625,0.0023214547,0.002626695,0.0011182341],"category_scores_gemma":[0.30052343,0.0006709936,0.0015618481,0.0075555923,0.0047700265,0.007988516,0.0032505672,0.0031535882,0.00060378964],"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.0020649876,0.0027294566,0.4093144,0.0038751175,0.0025195677,0.00045551633,0.006322849,0.057681084,0.0020244098,0.019075269,0.01400519,0.47993225],"study_design_scores_gemma":[0.0006475797,0.005757357,0.44480547,0.006130484,0.0020206291,0.0067730965,0.023266708,0.33723357,0.01271522,0.085435234,0.07455759,0.0006569715],"about_ca_topic_score_codex":0.0019960287,"about_ca_topic_score_gemma":0.0030701389,"teacher_disagreement_score":0.074623875,"about_ca_system_score_codex":0.0016579933,"about_ca_system_score_gemma":0.0010185122,"threshold_uncertainty_score":0.3946535},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028031357,0.0005969387,0.96707594,0.00014955382,0.000031462143,0.00009030434,0.000040180526,0.0010602531,0.0029240197],"genre_scores_gemma":[0.42207575,0.0003151981,0.57599396,0.00012654746,0.000034904086,0.00022687823,0.00014402861,0.00016494893,0.0009177587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813324,0.0011485216,0.000048184418,0.00008766725,0.0005026787,0.000079734134],"domain_scores_gemma":[0.9961351,0.002831735,0.00028794503,0.00023777325,0.000428692,0.000078747566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024076838,0.0008445374,0.001051066,0.0012746267,0.00055431,0.00064372947,0.0015420258,0.0009891032,0.0013025115],"category_scores_gemma":[0.007716751,0.00057765143,0.00062263064,0.0017985043,0.0012227695,0.00089617044,0.00087896193,0.0010440865,0.0004064274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013973034,0.00009160882,0.0004790182,0.00016838837,0.00004495222,0.00007285243,0.00010802086,0.90732765,0.0036445854,0.012182542,0.0010581418,0.07468255],"study_design_scores_gemma":[0.00003571209,0.000094408264,0.00006811258,0.00001098462,0.000009986379,0.000038400907,0.000012953221,0.9934162,0.0018261386,0.0038473473,0.0006319569,0.000007889057],"about_ca_topic_score_codex":0.0015210304,"about_ca_topic_score_gemma":0.0015174766,"teacher_disagreement_score":0.0024076838,"about_ca_system_score_codex":0.00062773976,"about_ca_system_score_gemma":0.0012221513,"threshold_uncertainty_score":0.012733221},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026208661,0.00033588882,0.96077335,0.0009132229,0.000068789,0.00007744969,0.00042829252,0.00094762625,0.0102468245],"genre_scores_gemma":[0.5696641,0.00048552785,0.412068,0.00038332978,0.00011248186,0.00035220425,0.0016196955,0.00030104004,0.015013579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998131,0.00064909825,0.000109261884,0.0005528546,0.00038362393,0.00017423305],"domain_scores_gemma":[0.99837947,0.00052762486,0.0001567539,0.00044105627,0.00030068733,0.00019451065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016360328,0.0012936125,0.0008249615,0.0025310607,0.00087775674,0.004288218,0.0024870858,0.0020385464,0.007792963],"category_scores_gemma":[0.0046732,0.00069865404,0.002504205,0.0016981022,0.0031464354,0.012830608,0.0029979954,0.00251552,0.0023043193],"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.00048205684,0.0001476008,0.0028644956,0.00018193982,0.000094578,0.00021865699,0.00134655,0.10452635,0.0040743337,0.75976294,0.003539844,0.122760706],"study_design_scores_gemma":[0.000036997022,0.000081053055,0.0005599054,0.0000332649,0.00003340771,0.00017839028,0.00018565317,0.57954806,0.0011318967,0.4091628,0.009014539,0.000034074936],"about_ca_topic_score_codex":0.008792302,"about_ca_topic_score_gemma":0.00441421,"teacher_disagreement_score":0.008792302,"about_ca_system_score_codex":0.0018821302,"about_ca_system_score_gemma":0.0016406383,"threshold_uncertainty_score":0.026069999},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21020073,0.00032150955,0.779496,0.00044991737,0.00005131587,0.0002381341,0.000093735514,0.0004831079,0.008665527],"genre_scores_gemma":[0.6809807,0.00021181582,0.31627485,0.00009556925,0.000034423014,0.00029097247,0.00023628725,0.00014007222,0.0017353299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968677,0.001297665,0.00019470832,0.00047700902,0.0007162116,0.00044668364],"domain_scores_gemma":[0.9914723,0.005099679,0.00079248246,0.0014211091,0.00067713734,0.0005373661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039980104,0.0006505,0.00094209344,0.0005138306,0.0006864484,0.0012456586,0.0019381526,0.00075913395,0.0026613707],"category_scores_gemma":[0.018252674,0.0005276876,0.0006326866,0.0010448502,0.001488133,0.0021006884,0.001087332,0.0014635873,0.0003630437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007493928,0.00033536772,0.0019053649,0.00016000918,0.000056847894,0.00006327499,0.00028515173,0.8087904,0.0033577126,0.12058194,0.0017798764,0.06193465],"study_design_scores_gemma":[0.000056854667,0.00008613116,0.00020715377,0.0000057178936,0.000009354991,0.000014892428,0.00002654875,0.9585398,0.0012506661,0.039063506,0.0007331275,0.000006318215],"about_ca_topic_score_codex":0.00294739,"about_ca_topic_score_gemma":0.003226121,"teacher_disagreement_score":0.0039980104,"about_ca_system_score_codex":0.0022538772,"about_ca_system_score_gemma":0.003800858,"threshold_uncertainty_score":0.021143734},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26250678,0.0004103116,0.73225635,0.00030434437,0.00005065365,0.00014749229,0.0003437973,0.00042603037,0.0035542678],"genre_scores_gemma":[0.8474843,0.00037017482,0.1474343,0.00005910392,0.000038243936,0.00014493526,0.00040277766,0.00007568516,0.003990388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946755,0.0001659276,0.00002863287,0.0001382134,0.00008178173,0.00011796364],"domain_scores_gemma":[0.99889094,0.00069564703,0.00016203224,0.000069621514,0.00008118183,0.00010057722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094657054,0.00088173425,0.0011080074,0.0004957077,0.0004939759,0.00076797814,0.00108799,0.0008723219,0.0024555859],"category_scores_gemma":[0.0015130909,0.00071774353,0.00093584886,0.0005334515,0.00071401644,0.0009732085,0.0005657673,0.00067945296,0.0002292222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015712777,0.000073059564,0.00029878927,0.00010077788,0.000030187093,0.00016165085,0.00006428217,0.97806203,0.0047057355,0.0054950356,0.00030890098,0.010542392],"study_design_scores_gemma":[0.00004775106,0.00013745336,0.00016713138,0.000006631294,0.000017863222,0.000040415875,0.000027714315,0.99366426,0.0010571061,0.0043720366,0.00045321576,0.00000845039],"about_ca_topic_score_codex":0.0038330804,"about_ca_topic_score_gemma":0.0027243893,"teacher_disagreement_score":0.0038330804,"about_ca_system_score_codex":0.00070813345,"about_ca_system_score_gemma":0.0012290142,"threshold_uncertainty_score":0.008214772},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014457676,0.00030571732,0.9816736,0.00049620285,0.000029128172,0.00018868441,0.0003481299,0.0006346855,0.0018662531],"genre_scores_gemma":[0.25146827,0.0006314441,0.74008316,0.0005175274,0.00013162717,0.00091300026,0.002506955,0.00032816612,0.0034197848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996345,0.0018993417,0.00014928434,0.0005772756,0.0007845608,0.00024444028],"domain_scores_gemma":[0.99122155,0.0064728805,0.0005700621,0.0008441869,0.00072741887,0.00016392083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005185345,0.0011559222,0.001549672,0.0017391465,0.00096189906,0.0018300514,0.0026833187,0.0018078232,0.004354397],"category_scores_gemma":[0.021735054,0.0012990215,0.0020541013,0.003025041,0.0013982694,0.0047177537,0.0032923534,0.0027762295,0.00069133926],"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.00044457937,0.000194897,0.003602764,0.00063700817,0.0002878661,0.00020278803,0.00042373865,0.5567967,0.0029752657,0.1791232,0.013788951,0.24152227],"study_design_scores_gemma":[0.000047902227,0.00006207273,0.00036013458,0.000028645742,0.00003200088,0.00007287789,0.00004618501,0.9043718,0.0008691851,0.09118349,0.0029083265,0.000017375613],"about_ca_topic_score_codex":0.004376833,"about_ca_topic_score_gemma":0.0062855906,"teacher_disagreement_score":0.005185345,"about_ca_system_score_codex":0.0016372631,"about_ca_system_score_gemma":0.0025608172,"threshold_uncertainty_score":0.027423084},"labels":[],"label_agreement":null},{"id":"W2133180954","doi":"10.1613/jair.1676","title":"Decision-Theoretic Planning with non-Markovian Rewards","year":2006,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Australian Government; National ICT Australia","keywords":"Markov decision process; Computer science; Markov process; Partially observable Markov decision process; Heuristic; Probabilistic logic; Planner; Mathematical optimization; Decision problem; Process (computing); Function (biology); Artificial intelligence; Mathematics; Algorithm","score_opus":0.06525791475197834,"score_gpt":0.37882640252474176,"score_spread":0.3135684877727634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133180954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077821757,0.00023089313,0.9855924,0.00027983455,0.00003197437,0.00009580952,0.000097429736,0.00032095035,0.0055684927],"genre_scores_gemma":[0.32033676,0.00066255056,0.6739384,0.000134517,0.0000437077,0.0003502244,0.0002984238,0.00012097258,0.004114474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997491,0.0010445572,0.0001601229,0.00038452735,0.0007447887,0.0001749783],"domain_scores_gemma":[0.99510384,0.003737218,0.00035509557,0.0003795446,0.00026705125,0.00015730335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028528462,0.0008560957,0.00061892776,0.0005622145,0.00057309744,0.0017473432,0.0013383368,0.00087509747,0.0033503359],"category_scores_gemma":[0.008090721,0.0005173255,0.0011229102,0.00075384113,0.0020940017,0.0026659477,0.0017032624,0.0018466057,0.00043415016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013145298,0.00007196478,0.00049296767,0.00022960179,0.000051519863,0.00014949453,0.00025629008,0.39067957,0.001979043,0.545961,0.0015701841,0.058426823],"study_design_scores_gemma":[0.000053274583,0.00006680785,0.00014303457,0.00004036877,0.00002300312,0.000062522886,0.000036473382,0.7106074,0.0023098825,0.27842423,0.008210194,0.000022863693],"about_ca_topic_score_codex":0.003037399,"about_ca_topic_score_gemma":0.004189306,"teacher_disagreement_score":0.0033503359,"about_ca_system_score_codex":0.0015865527,"about_ca_system_score_gemma":0.003620665,"threshold_uncertainty_score":0.015087426},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71796685,0.0020932674,0.23722978,0.0013592895,0.00016106626,0.0005303103,0.0046502464,0.009054026,0.026955083],"genre_scores_gemma":[0.85259753,0.0009419585,0.13515854,0.00019575424,0.00008811302,0.000100998084,0.005573151,0.0004129701,0.004930913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976319,0.0004894241,0.0004039923,0.00046916917,0.0008557641,0.00014969028],"domain_scores_gemma":[0.9879423,0.0058048167,0.0022536293,0.0018473099,0.0018428264,0.00030918492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014311022,0.00061720685,0.0006830677,0.008239803,0.00096915115,0.002770104,0.0007859239,0.0010300992,0.0020949286],"category_scores_gemma":[0.010361373,0.00032192262,0.00043828823,0.0036895615,0.0005795054,0.004634425,0.0018095598,0.00076469965,0.0016320003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059734145,0.00039791063,0.15585458,0.00092386594,0.00011730067,0.009321836,0.006666495,0.0025725563,0.07672131,0.013523076,0.01631648,0.7169873],"study_design_scores_gemma":[0.00008790018,0.0002818805,0.15740696,0.0007337132,0.00038430642,0.025037078,0.021038776,0.29700983,0.24475232,0.055534292,0.19739944,0.0003334791],"about_ca_topic_score_codex":0.002013772,"about_ca_topic_score_gemma":0.0026061495,"teacher_disagreement_score":0.008239803,"about_ca_system_score_codex":0.0004985394,"about_ca_system_score_gemma":0.0008047823,"threshold_uncertainty_score":0.007568538},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009922077,0.0002416133,0.9839115,0.00027807214,0.000046200126,0.00009671562,0.00023734628,0.0005993187,0.0046671405],"genre_scores_gemma":[0.3975696,0.00074148166,0.5933116,0.0005922919,0.000160772,0.0011083608,0.0008769404,0.0002562948,0.0053826184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99477214,0.0011144301,0.0006381673,0.0012939919,0.0015290468,0.0006522334],"domain_scores_gemma":[0.99138254,0.004386978,0.0008628855,0.0023098735,0.00075684645,0.0003009686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033325425,0.0013527322,0.0011358839,0.0022262777,0.001325355,0.004986197,0.0030794058,0.0016474185,0.0071319523],"category_scores_gemma":[0.014945112,0.0012345373,0.0031866662,0.0025911224,0.0053805592,0.0079540815,0.0053593344,0.004385013,0.0011368721],"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.000057609534,0.000039566785,0.0005547292,0.00014680557,0.000045173845,0.00010098318,0.00026290547,0.07043266,0.0015579473,0.90496767,0.00095003226,0.020883814],"study_design_scores_gemma":[0.0000317487,0.0001228897,0.00023009873,0.00007472378,0.0000537062,0.00016676747,0.00010264432,0.18053634,0.0029200672,0.80573845,0.009983605,0.000039038165],"about_ca_topic_score_codex":0.0020734062,"about_ca_topic_score_gemma":0.0013742985,"teacher_disagreement_score":0.0071319523,"about_ca_system_score_codex":0.0021171665,"about_ca_system_score_gemma":0.00244456,"threshold_uncertainty_score":0.023858786},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057533022,0.00006830904,0.93515867,0.00021212728,0.00003600059,0.000049507096,0.000025875312,0.0001882497,0.0067282435],"genre_scores_gemma":[0.95945543,0.00013630744,0.03681026,0.00009725608,0.000030608382,0.000120856406,0.000039668448,0.00009546015,0.003214194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906105,0.00037081967,0.000045854857,0.00014818189,0.0002320433,0.00014209055],"domain_scores_gemma":[0.99685645,0.00201453,0.0003708869,0.0003008242,0.00025586266,0.00020146501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018298083,0.0005914665,0.0006600526,0.0004161766,0.0004549478,0.0010996074,0.0007873988,0.0007123808,0.0024574834],"category_scores_gemma":[0.010950774,0.00029939105,0.00078481436,0.00028421078,0.0018226712,0.0015855386,0.0018819843,0.0016288063,0.00033370004],"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.00013498898,0.00009390394,0.00053533405,0.00006977589,0.000045498182,0.00019227719,0.0002511871,0.5403879,0.00791953,0.42229164,0.0006125887,0.027465349],"study_design_scores_gemma":[0.000015957434,0.000058389527,0.00011021314,0.0000061738683,0.000005541545,0.000028623845,0.000016739014,0.8426661,0.0011682233,0.1555754,0.0003383801,0.000010236433],"about_ca_topic_score_codex":0.0012823879,"about_ca_topic_score_gemma":0.00060613925,"teacher_disagreement_score":0.0024574834,"about_ca_system_score_codex":0.00081883895,"about_ca_system_score_gemma":0.0009253809,"threshold_uncertainty_score":0.0096770525},"labels":[],"label_agreement":null},{"id":"W2140994944","doi":"10.1613/jair.2241","title":"Compressed Pattern Databases","year":2007,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation; National Science Foundation","keywords":"Computer science; Table (database); Set (abstract data type); Uncompressed video; Database; Heuristic; Merge (version control); Domain (mathematical analysis); Algorithm; Data mining; Theoretical computer science; Information retrieval; Programming language; Artificial intelligence; Mathematics","score_opus":0.30467648472560893,"score_gpt":0.46082037062180975,"score_spread":0.15614388589620082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140994944","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075114176,0.003947719,0.8339663,0.002390162,0.0007491993,0.0010392044,0.03338121,0.018238233,0.03117372],"genre_scores_gemma":[0.2953318,0.0025888085,0.62672067,0.00076541415,0.00020911754,0.0011989706,0.05889077,0.00088728947,0.0134072015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819094,0.00026422134,0.00024114292,0.00031809954,0.0008204862,0.00016510453],"domain_scores_gemma":[0.9944019,0.0012333967,0.00033097857,0.002886095,0.0010103353,0.00013738862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084590854,0.00076155947,0.0011381898,0.002548054,0.0007847829,0.0027188163,0.0032007743,0.0010785933,0.017150631],"category_scores_gemma":[0.008260282,0.0005725381,0.0007058225,0.0070051155,0.00057119894,0.0055996347,0.0023070376,0.0012136729,0.0042056097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014590456,0.0003539084,0.0019829427,0.0007867489,0.00011465195,0.0006620953,0.00034995106,0.042849027,0.016838921,0.0620344,0.075070016,0.7974983],"study_design_scores_gemma":[0.0006640779,0.00068026414,0.0027124225,0.00038326802,0.00015071314,0.0031703552,0.0010465516,0.42641464,0.062939145,0.25634468,0.2453478,0.00014597604],"about_ca_topic_score_codex":0.0023605565,"about_ca_topic_score_gemma":0.0031120009,"teacher_disagreement_score":0.017150631,"about_ca_system_score_codex":0.0009098246,"about_ca_system_score_gemma":0.0015142607,"threshold_uncertainty_score":0.057374597},"labels":[],"label_agreement":null},{"id":"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048485622,0.0013930831,0.030693548,0.95306754,0.0044614575,0.000018504179,0.00006446661,0.00015335025,0.009663161],"genre_scores_gemma":[0.064137295,0.0030636028,0.046601698,0.85181004,0.010773156,0.0004187452,0.00014869137,0.0007560618,0.022290671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9483519,0.027219566,0.0030065537,0.0056034885,0.013996488,0.0018221207],"domain_scores_gemma":[0.8568026,0.10895333,0.0034639465,0.010346632,0.017410701,0.0030228165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.055920407,0.0014361906,0.0013533058,0.001886726,0.0062737693,0.013676994,0.0073588733,0.02453704,0.0062740454],"category_scores_gemma":[0.085036546,0.0011563336,0.0026867534,0.0026184868,0.030730953,0.023026016,0.01199416,0.0489723,0.0031785711],"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.000037989368,0.000022716007,0.00018690429,0.00017153444,0.000016172371,0.000114522845,0.003194215,0.0010283624,0.00012878752,0.749957,0.23226747,0.012874399],"study_design_scores_gemma":[0.00003018391,0.000034037683,0.00010343961,0.00040567783,0.000013720396,0.00019430474,0.0014816391,0.0029702156,0.00047704967,0.3209274,0.67328006,0.000082229635],"about_ca_topic_score_codex":0.01575395,"about_ca_topic_score_gemma":0.011343871,"teacher_disagreement_score":0.055920407,"about_ca_system_score_codex":0.016298587,"about_ca_system_score_gemma":0.015773365,"threshold_uncertainty_score":0.29573894},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019812072,0.00024649326,0.9942082,0.00027781806,0.000046146688,0.00010188824,0.00011026542,0.000113196686,0.002914756],"genre_scores_gemma":[0.11411898,0.001147985,0.8790588,0.00026857256,0.00015141795,0.0008857437,0.00039436782,0.0001141157,0.0038601768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978393,0.0008489984,0.000121399426,0.00042845614,0.000547497,0.00021427874],"domain_scores_gemma":[0.9961248,0.003214032,0.00014253348,0.000096263604,0.00031903054,0.00010335323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002507738,0.0021115327,0.0012621051,0.0011196326,0.0012132712,0.0023229956,0.0025393772,0.0021797223,0.004740131],"category_scores_gemma":[0.0061009675,0.001090228,0.0015866184,0.0030979791,0.0016462408,0.0017166268,0.0013865312,0.0032805437,0.00055770646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046367655,0.000061467304,0.00013288719,0.00017666651,0.000047233727,0.000106190586,0.0000668858,0.9166957,0.0006476197,0.051781744,0.0019102906,0.028326964],"study_design_scores_gemma":[0.000024641822,0.000022418732,0.000029594816,0.000014443237,0.000012982753,0.000021570064,0.000017613385,0.98457956,0.00027355584,0.013107428,0.0018862566,0.000009920748],"about_ca_topic_score_codex":0.026149286,"about_ca_topic_score_gemma":0.017368127,"teacher_disagreement_score":0.026149286,"about_ca_system_score_codex":0.002435816,"about_ca_system_score_gemma":0.004838301,"threshold_uncertainty_score":0.051994145},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004665816,0.0005017859,0.99028075,0.00016238393,0.000044511995,0.00008982225,0.0000942896,0.00073446374,0.0034260848],"genre_scores_gemma":[0.38101903,0.001102506,0.61224765,0.00021318793,0.00009034325,0.0007896485,0.0005325382,0.000298679,0.0037064687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988386,0.00040386117,0.00008412098,0.00024773387,0.00028267983,0.00014309569],"domain_scores_gemma":[0.99599034,0.0031983657,0.00027098515,0.00023390428,0.00018391655,0.00012249533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018225992,0.0016927464,0.001766019,0.0008094936,0.0009390407,0.0014686141,0.0019484607,0.0015342613,0.0077229794],"category_scores_gemma":[0.00600829,0.00084955327,0.0011746348,0.0009942529,0.0014031102,0.0022789033,0.0021088899,0.0025227293,0.00083902973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077285054,0.000077930286,0.00024940525,0.00017988037,0.000042349,0.00005522608,0.00006714846,0.9046542,0.0003635836,0.046032075,0.0015248854,0.046676066],"study_design_scores_gemma":[0.000034775385,0.00002201183,0.000027405404,0.000017140494,0.000009255294,0.000013063463,0.000014349184,0.9623732,0.00022694943,0.0362148,0.0010414385,0.0000055623955],"about_ca_topic_score_codex":0.0064112013,"about_ca_topic_score_gemma":0.007155139,"teacher_disagreement_score":0.0077229794,"about_ca_system_score_codex":0.0016613695,"about_ca_system_score_gemma":0.0026899343,"threshold_uncertainty_score":0.025835931},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02139261,0.000907001,0.95071995,0.0006951679,0.00019547802,0.0007775427,0.00095186563,0.015837014,0.008523314],"genre_scores_gemma":[0.18787,0.0003715409,0.8007858,0.0005309802,0.00020479651,0.0014140788,0.003272606,0.001965727,0.0035846017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9917258,0.0042639743,0.0004296505,0.0009375994,0.0021105101,0.0005324443],"domain_scores_gemma":[0.98871094,0.007056963,0.00069307594,0.0022937066,0.0009198337,0.0003255747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008243506,0.0023428213,0.0021803903,0.0037397223,0.0010551699,0.0026779186,0.0038699221,0.0021479465,0.009380968],"category_scores_gemma":[0.023801146,0.0012823695,0.0022981807,0.0033787955,0.0011285357,0.003167713,0.003297297,0.0031854631,0.0039702067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059291197,0.0005672815,0.0063455193,0.0004394731,0.0004090352,0.00014387655,0.00017088419,0.31257036,0.0033306077,0.028456455,0.051761817,0.59521174],"study_design_scores_gemma":[0.00018816102,0.00012209939,0.00039664088,0.000024128864,0.000036299072,0.00007503811,0.000023333252,0.97054976,0.0017413164,0.02159689,0.0052303025,0.000016007969],"about_ca_topic_score_codex":0.0019646464,"about_ca_topic_score_gemma":0.0042532925,"teacher_disagreement_score":0.009380968,"about_ca_system_score_codex":0.0019318508,"about_ca_system_score_gemma":0.0036881315,"threshold_uncertainty_score":0.043596327},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0108155515,0.00018212954,0.98611635,0.00017237695,0.00002482189,0.00006026662,0.00003358808,0.00059852994,0.0019963046],"genre_scores_gemma":[0.6410341,0.00020209915,0.35623515,0.00019020581,0.000046593093,0.00030668985,0.00014835056,0.00014845926,0.0016882974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882764,0.00045421819,0.00004834862,0.00015082721,0.00040418195,0.000114712006],"domain_scores_gemma":[0.9960204,0.003024276,0.00025300603,0.00026495164,0.00027938018,0.00015805483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019268566,0.00075084256,0.0017972225,0.0005669168,0.0004505221,0.0008539415,0.0019407878,0.0011824883,0.002998225],"category_scores_gemma":[0.00971664,0.00058291474,0.0005686133,0.0006918503,0.0012391879,0.0014785441,0.0015748439,0.0020575214,0.00053894636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011667205,0.000086725384,0.00075426575,0.00006337798,0.000040152863,0.000054620647,0.00007465323,0.90034837,0.0007350576,0.02501696,0.0014431366,0.07126589],"study_design_scores_gemma":[0.0000110572755,0.000009978257,0.0000296098,0.0000032515927,0.00000262589,0.0000058580094,0.000002460069,0.9931479,0.000085801206,0.0065672677,0.00013184991,0.0000022895927],"about_ca_topic_score_codex":0.0068948865,"about_ca_topic_score_gemma":0.008601874,"teacher_disagreement_score":0.0068948865,"about_ca_system_score_codex":0.0011651064,"about_ca_system_score_gemma":0.0026343225,"threshold_uncertainty_score":0.0137094855},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07411522,0.0013576704,0.79534334,0.0016742568,0.0007121144,0.0049086013,0.008251042,0.08102206,0.03261568],"genre_scores_gemma":[0.27565315,0.000527038,0.6941121,0.0006190911,0.000090828566,0.007379126,0.009865311,0.0069187954,0.004834517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98879224,0.0073316116,0.00080970867,0.00082199235,0.0018166933,0.00042776004],"domain_scores_gemma":[0.9787911,0.0133022545,0.0009883412,0.0029910083,0.0028807265,0.0010465299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013376182,0.0019080254,0.0010788306,0.0022869513,0.00058522413,0.001953681,0.0038308182,0.0017376447,0.0084892195],"category_scores_gemma":[0.034813408,0.0007657617,0.0009738894,0.0013274633,0.0012555573,0.0028622579,0.003909424,0.0031130782,0.0029362289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035493956,0.003639912,0.0098472,0.0033191657,0.00091482897,0.000463411,0.0011178679,0.43748447,0.007879542,0.050999735,0.14447126,0.33631325],"study_design_scores_gemma":[0.0014943657,0.0020208918,0.0023269684,0.00025040036,0.00012467943,0.00018657433,0.00023847545,0.8897074,0.00915134,0.023755107,0.07060668,0.00013715627],"about_ca_topic_score_codex":0.0047468194,"about_ca_topic_score_gemma":0.004241815,"teacher_disagreement_score":0.013376182,"about_ca_system_score_codex":0.001480088,"about_ca_system_score_gemma":0.0023186465,"threshold_uncertainty_score":0.07074082},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038742542,0.00032630545,0.9541334,0.00018636747,0.00003989644,0.0001919789,0.00006605294,0.0016441274,0.0046693026],"genre_scores_gemma":[0.32469416,0.00023544733,0.6715762,0.00011667922,0.000030702424,0.00037105978,0.00027523446,0.0001539947,0.00254648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992569,0.00020419352,0.00006016845,0.00015076618,0.00023078258,0.0000971966],"domain_scores_gemma":[0.9988084,0.0006376016,0.000107502754,0.00019241187,0.00017457658,0.000079572106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011188206,0.0007425988,0.0008473538,0.0013245108,0.000401597,0.0012689583,0.0021660733,0.000942172,0.0042250743],"category_scores_gemma":[0.0043401355,0.00055093394,0.0007351913,0.0012510146,0.0012202878,0.0018316775,0.0015475265,0.0010281164,0.00072321435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034825757,0.00038806634,0.0019033732,0.00019838379,0.000073843396,0.00019374065,0.0004144762,0.51084024,0.005068672,0.041379455,0.0036631995,0.4355283],"study_design_scores_gemma":[0.00006026129,0.00008081173,0.0002723134,0.000014275169,0.000017578646,0.000045242563,0.000048292506,0.9829609,0.0016168354,0.012609363,0.0022613583,0.000012819924],"about_ca_topic_score_codex":0.0124316625,"about_ca_topic_score_gemma":0.00945476,"teacher_disagreement_score":0.0124316625,"about_ca_system_score_codex":0.0013389622,"about_ca_system_score_gemma":0.001429218,"threshold_uncertainty_score":0.024718583},"labels":[],"label_agreement":null},{"id":"W2155992093","doi":"10.1613/jair.4171","title":"Enhanced Partial Expansion A*","year":2014,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":151,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Computer science; A priori and a posteriori; Heuristic; Benchmark (surveying); Node (physics); Domain (mathematical analysis); Mathematical optimization; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.14836674078168158,"score_gpt":0.40885550094117146,"score_spread":0.26048876015948985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155992093","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060523376,0.0007247113,0.9160752,0.00072889955,0.00016612212,0.00046439283,0.00040479147,0.002286022,0.018626438],"genre_scores_gemma":[0.24899246,0.00032668948,0.7410996,0.0005447757,0.00006862775,0.00047772855,0.00074862957,0.00026056453,0.0074808616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938,0.0001811577,0.00004587286,0.0001362263,0.00015681272,0.00009995799],"domain_scores_gemma":[0.99842095,0.00090606563,0.000112275695,0.0002484454,0.00024359382,0.00006868836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000822834,0.0008333661,0.00070871913,0.0008462842,0.0006544658,0.00080904056,0.0016373814,0.00091098086,0.0064831227],"category_scores_gemma":[0.0034676278,0.00039251315,0.0010469726,0.0012252143,0.00072983676,0.0019140127,0.001950395,0.0013827822,0.0009120587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003639775,0.0004379787,0.0025624398,0.0005518775,0.00011881432,0.00046117534,0.00031315317,0.2500034,0.017282778,0.051832974,0.015595059,0.6604764],"study_design_scores_gemma":[0.00010875547,0.00034758152,0.00065989426,0.00006143635,0.000070612674,0.00052454096,0.000120631186,0.91548306,0.008858732,0.052674845,0.021061955,0.000027948838],"about_ca_topic_score_codex":0.002276213,"about_ca_topic_score_gemma":0.003620641,"teacher_disagreement_score":0.0064831227,"about_ca_system_score_codex":0.00052218477,"about_ca_system_score_gemma":0.0016725123,"threshold_uncertainty_score":0.021688163},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43652833,0.0031576273,0.48434526,0.0012373655,0.0010752162,0.0015941818,0.022678223,0.013285969,0.036097877],"genre_scores_gemma":[0.7146364,0.0016473386,0.22799759,0.00040470882,0.0010231466,0.0010297158,0.034921143,0.0007610975,0.017578801],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988631,0.0002494388,0.00013107111,0.0001997902,0.00047172257,0.00008483694],"domain_scores_gemma":[0.9974105,0.00083759404,0.0003894728,0.00019824166,0.001066459,0.00009781727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084725366,0.0008502281,0.00055427756,0.0018553106,0.00039918892,0.0010547624,0.0003945854,0.00034961503,0.0049460963],"category_scores_gemma":[0.00449419,0.00016530958,0.0005781113,0.001020459,0.00022263723,0.0010147347,0.0006578276,0.00041295672,0.0043669306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007428139,0.00024569922,0.017206151,0.0015356012,0.00021593446,0.0006995876,0.001047214,0.0030341588,0.21458212,0.003283647,0.04082642,0.71658075],"study_design_scores_gemma":[0.00020053957,0.0012854254,0.16202071,0.00052899675,0.00039043662,0.002338798,0.0025714564,0.32343575,0.23591574,0.022921655,0.24813122,0.0002593223],"about_ca_topic_score_codex":0.0006610026,"about_ca_topic_score_gemma":0.0012771362,"teacher_disagreement_score":0.0049460963,"about_ca_system_score_codex":0.00029384758,"about_ca_system_score_gemma":0.0003167928,"threshold_uncertainty_score":0.016546309},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016476763,0.00058779155,0.97556835,0.0008987068,0.00006614573,0.000099711,0.00017523205,0.0012598324,0.004867474],"genre_scores_gemma":[0.17710948,0.00058547757,0.8164379,0.00036845895,0.0001243444,0.0002391958,0.0005513368,0.00021541596,0.0043684226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767524,0.0011457534,0.00013524907,0.00036095595,0.0004825695,0.00020016251],"domain_scores_gemma":[0.99027455,0.008358434,0.00034297837,0.0005812189,0.00033081375,0.0001120528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003536192,0.0010470224,0.0012571705,0.0013852068,0.00093861576,0.0021962319,0.0026063172,0.0022993586,0.0069107395],"category_scores_gemma":[0.013097311,0.0011633665,0.0017220876,0.0031029284,0.0019477829,0.0034606187,0.0023287914,0.0024418323,0.0010477598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003547978,0.00022239384,0.0023185199,0.0005471465,0.0002959148,0.00029067157,0.00032468932,0.5050041,0.0020346052,0.22365572,0.011726564,0.25322488],"study_design_scores_gemma":[0.00008065563,0.000027071781,0.00018612987,0.000029638573,0.000044578475,0.0000694111,0.000039261882,0.82589287,0.0012611412,0.16999505,0.002359595,0.0000145246395],"about_ca_topic_score_codex":0.011508865,"about_ca_topic_score_gemma":0.01722627,"teacher_disagreement_score":0.011508865,"about_ca_system_score_codex":0.0016835924,"about_ca_system_score_gemma":0.0029338454,"threshold_uncertainty_score":0.023118734},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027043002,0.0003180952,0.9706632,0.00031529574,0.0000303063,0.00005109408,0.000057237557,0.00020862345,0.0013131668],"genre_scores_gemma":[0.7207313,0.0007359307,0.27583215,0.00016276893,0.000057685444,0.00032162698,0.00016319187,0.000062688414,0.0019326775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998049,0.0010928058,0.00011156658,0.00028293274,0.00028947028,0.00017420678],"domain_scores_gemma":[0.9877359,0.010646513,0.0007132209,0.00033097388,0.00034397547,0.00022951925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003230904,0.00085937744,0.0011229401,0.0006196319,0.0006915096,0.0012782357,0.00106405,0.001238697,0.0020451439],"category_scores_gemma":[0.0132912,0.00067547295,0.00088141795,0.00068593014,0.0023293055,0.00176019,0.0011574021,0.0021018572,0.00026421694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007895296,0.000035834473,0.0007764323,0.000060119663,0.00002531848,0.00007138998,0.00009798063,0.90993994,0.00031188733,0.078020915,0.0002451852,0.010336074],"study_design_scores_gemma":[0.000027510205,0.000021455928,0.00010289695,0.00000970425,0.0000060513103,0.000012417974,0.000009376994,0.92748207,0.00023541263,0.07175067,0.00033456474,0.000007914088],"about_ca_topic_score_codex":0.007624727,"about_ca_topic_score_gemma":0.006490117,"teacher_disagreement_score":0.007624727,"about_ca_system_score_codex":0.0018486847,"about_ca_system_score_gemma":0.0018195119,"threshold_uncertainty_score":0.017086864},"labels":[],"label_agreement":null},{"id":"W2160927913","doi":"10.1613/jair.1696","title":"Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators","year":2005,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":195,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Macro; Computer science; Artificial intelligence; Software engineering; Programming language","score_opus":0.1124290222437872,"score_gpt":0.40916905857847136,"score_spread":0.29674003633468415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160927913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03971592,0.00054082146,0.91313004,0.00041041165,0.00009114315,0.00036319424,0.0009935062,0.036037542,0.008717348],"genre_scores_gemma":[0.1455543,0.00021285497,0.84937024,0.00018412949,0.000028200302,0.00024166876,0.001247275,0.00096967444,0.0021917173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919254,0.00021649656,0.000060573453,0.0001987749,0.00026544943,0.00006610496],"domain_scores_gemma":[0.9977308,0.0014995519,0.00013853333,0.00034168444,0.00021600178,0.0000734682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015043555,0.0012723488,0.0006737557,0.001064122,0.00045909602,0.0010169656,0.0016375553,0.00097150484,0.0069410405],"category_scores_gemma":[0.0062549203,0.00045538667,0.0007004981,0.000782357,0.0008984653,0.0021040235,0.0017757196,0.001109788,0.0012556363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040749324,0.0002420496,0.0023102118,0.00046870322,0.000055669287,0.00014728351,0.000268393,0.19084297,0.010279919,0.012257819,0.01977813,0.7629414],"study_design_scores_gemma":[0.00010022509,0.00017212097,0.0005459768,0.000039993174,0.000032250085,0.00009628777,0.000060346036,0.9649232,0.009903042,0.011757882,0.012338089,0.000030676933],"about_ca_topic_score_codex":0.009403066,"about_ca_topic_score_gemma":0.01429329,"teacher_disagreement_score":0.009403066,"about_ca_system_score_codex":0.0008221842,"about_ca_system_score_gemma":0.002589931,"threshold_uncertainty_score":0.023220122},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004992682,0.0003968151,0.9926872,0.0002195184,0.00001501523,0.000023457314,0.000073651434,0.00031677887,0.0012749096],"genre_scores_gemma":[0.24367782,0.0017132536,0.7518401,0.0002865341,0.00017557255,0.00022461983,0.00054426136,0.00021310696,0.0013247334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99397427,0.0029163205,0.0002923749,0.0008907475,0.0016243523,0.0003019918],"domain_scores_gemma":[0.9793966,0.01699242,0.0006995947,0.0019161428,0.00079959986,0.00019560607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056040836,0.0010215859,0.0014918816,0.0026291444,0.0012704434,0.0023076963,0.0016821169,0.0014148065,0.0031756624],"category_scores_gemma":[0.035804097,0.0016417768,0.001913517,0.003163823,0.0026524034,0.007781737,0.0042138607,0.0031045144,0.00064507505],"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.00020083107,0.00006463236,0.002854656,0.00034230755,0.00021563748,0.00029021694,0.0006079757,0.20138235,0.001479271,0.519567,0.0032554779,0.26973963],"study_design_scores_gemma":[0.000022083741,0.000024918041,0.0004823671,0.000054762764,0.000069453235,0.000099167,0.000041507046,0.36484674,0.0012789491,0.6287295,0.0043149735,0.00003558224],"about_ca_topic_score_codex":0.0071809534,"about_ca_topic_score_gemma":0.007870225,"teacher_disagreement_score":0.0071809534,"about_ca_system_score_codex":0.0012406104,"about_ca_system_score_gemma":0.0018866684,"threshold_uncertainty_score":0.029637635},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6400386,0.0039928067,0.29723212,0.0020848343,0.0006197609,0.0027311041,0.003175063,0.02346424,0.026661405],"genre_scores_gemma":[0.5441714,0.00068977085,0.44427156,0.00045485646,0.000072593575,0.0017166692,0.0036584975,0.00084728404,0.004117365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975247,0.0009866931,0.00022722928,0.0005137013,0.0005357959,0.00021183207],"domain_scores_gemma":[0.98255324,0.013557429,0.00028293114,0.0017174182,0.0015889863,0.00030001704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00528759,0.0014546667,0.0015576272,0.0011973641,0.0008447156,0.0014513964,0.003178008,0.002974618,0.0092215],"category_scores_gemma":[0.026849702,0.00062417425,0.000673834,0.0021303196,0.00072160264,0.0044035483,0.001823387,0.002008102,0.0027628278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0045126015,0.005467864,0.009874507,0.001242687,0.00043812863,0.00035341334,0.0006001504,0.2317805,0.0064299204,0.010807319,0.031049863,0.69744307],"study_design_scores_gemma":[0.0009780178,0.00042546878,0.0014247017,0.00004688253,0.000082380175,0.00009551922,0.00018036248,0.9816638,0.0044041267,0.007859108,0.002805456,0.000034166693],"about_ca_topic_score_codex":0.01001203,"about_ca_topic_score_gemma":0.0071391347,"teacher_disagreement_score":0.01001203,"about_ca_system_score_codex":0.001328083,"about_ca_system_score_gemma":0.0020665948,"threshold_uncertainty_score":0.03084898},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20048682,0.0009937906,0.7877063,0.0006492131,0.00017709467,0.0003308395,0.0013712787,0.0027800666,0.0055046426],"genre_scores_gemma":[0.77800834,0.00037590263,0.2129153,0.00018747503,0.00025954362,0.00052520557,0.0035939857,0.0005529955,0.0035813113],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99184847,0.0045374283,0.00035620743,0.0020923137,0.00084014464,0.0003254047],"domain_scores_gemma":[0.9691306,0.022606453,0.001983828,0.0029485552,0.0026201531,0.0007104086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005408508,0.0010153779,0.0010349472,0.0024022565,0.00209882,0.0025906332,0.0016323879,0.0017663252,0.0018189559],"category_scores_gemma":[0.029277477,0.0006232549,0.0009398351,0.0018323228,0.00122094,0.0038674322,0.0023274356,0.0017402727,0.0015505193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0049327784,0.00070071244,0.053772256,0.001993169,0.0004754022,0.0014616782,0.022759428,0.16416532,0.09098533,0.05478608,0.026906628,0.57706124],"study_design_scores_gemma":[0.00009919636,0.0001399109,0.012678887,0.00009963029,0.0001345451,0.00033942674,0.0016913769,0.8910539,0.023743302,0.052916232,0.016974473,0.00012922268],"about_ca_topic_score_codex":0.0052136322,"about_ca_topic_score_gemma":0.007229337,"teacher_disagreement_score":0.005408508,"about_ca_system_score_codex":0.0012299822,"about_ca_system_score_gemma":0.00148746,"threshold_uncertainty_score":0.028603256},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030800728,0.00068214623,0.89401793,0.0013710337,0.00023055909,0.00034117122,0.00061629125,0.0010436499,0.07089642],"genre_scores_gemma":[0.4984809,0.0011208616,0.41768557,0.0016925039,0.00047697264,0.0009956921,0.0022670159,0.0009410029,0.07633941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763393,0.00066245295,0.0001463536,0.00041478616,0.00084211404,0.00030032388],"domain_scores_gemma":[0.9960884,0.0022475575,0.00018009327,0.0006634147,0.00066635245,0.00015414009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037952035,0.00085288635,0.0006443549,0.0017808634,0.0010805905,0.0021625832,0.0022060783,0.0012674181,0.018469969],"category_scores_gemma":[0.009777119,0.00043204645,0.0015636933,0.0017730074,0.0022329595,0.006637732,0.003106293,0.0030625402,0.0034908394],"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.00005535772,0.00003876847,0.00025930267,0.00008831926,0.000013635645,0.00010274371,0.00023993768,0.0022698862,0.0022271725,0.93373644,0.003762792,0.057205662],"study_design_scores_gemma":[0.000039179045,0.00007329864,0.00039805003,0.000053448748,0.00003075075,0.00037661576,0.00019808345,0.04889252,0.006269176,0.9064236,0.0372116,0.000033796387],"about_ca_topic_score_codex":0.00089394546,"about_ca_topic_score_gemma":0.0007607061,"teacher_disagreement_score":0.018469969,"about_ca_system_score_codex":0.0016817149,"about_ca_system_score_gemma":0.0009964553,"threshold_uncertainty_score":0.06178814},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011793224,0.00057742395,0.98469675,0.00017816613,0.000028308676,0.00016959988,0.00009236686,0.0007648567,0.0016993566],"genre_scores_gemma":[0.18423022,0.0004908977,0.8130314,0.00023320151,0.00005121106,0.00038556973,0.000441888,0.00026143395,0.0008741705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971411,0.001466381,0.00020673677,0.0003305251,0.0006261749,0.00022904197],"domain_scores_gemma":[0.9915023,0.006203283,0.0006743075,0.00087286846,0.00055055646,0.00019674268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044170236,0.0012779331,0.0015884701,0.002082513,0.0007643208,0.0014913745,0.002523106,0.0015527693,0.0023525343],"category_scores_gemma":[0.018763328,0.00060763967,0.0010102027,0.0042246995,0.0016219467,0.0022846523,0.0015497472,0.002073417,0.00041329977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024134321,0.00019122215,0.0019004481,0.00039849518,0.00010643664,0.000109571345,0.00022224506,0.64616597,0.003650113,0.054685637,0.0042397613,0.28808877],"study_design_scores_gemma":[0.0000730566,0.00006495733,0.0001777633,0.0000344029,0.000024009192,0.000056923243,0.000035613266,0.9634135,0.0015473099,0.032622233,0.0019343072,0.00001590946],"about_ca_topic_score_codex":0.0038066742,"about_ca_topic_score_gemma":0.005127515,"teacher_disagreement_score":0.0044170236,"about_ca_system_score_codex":0.001796906,"about_ca_system_score_gemma":0.0019519392,"threshold_uncertainty_score":0.023359716},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058714757,0.00006615995,0.99257267,0.00007912912,0.000021979293,0.000039237108,0.000016844187,0.00017396764,0.0011584837],"genre_scores_gemma":[0.55748194,0.00024281237,0.4389271,0.00013374416,0.000055106,0.00033462743,0.00014222295,0.00009561291,0.002586831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988035,0.0004441836,0.0000665467,0.00022260283,0.00031235637,0.00015079006],"domain_scores_gemma":[0.9972832,0.0019513549,0.00020391872,0.0001756597,0.0002864528,0.00009949982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017025069,0.0009004488,0.001511597,0.00059927366,0.0005271062,0.00092552765,0.0008708689,0.0010659427,0.0025940163],"category_scores_gemma":[0.0059756604,0.00052158954,0.000722343,0.00053267466,0.0013798566,0.0012849359,0.0012639824,0.0015067712,0.00039737084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009184562,0.00003669708,0.00044533523,0.0000694734,0.000029773637,0.000073348725,0.0000816694,0.90189177,0.0014725075,0.04735608,0.00071319955,0.04773841],"study_design_scores_gemma":[0.000008803598,0.00001901004,0.000019331626,0.000005059947,0.000002517949,0.0000136368135,0.0000034707625,0.9889543,0.0003645056,0.010305468,0.00030053136,0.0000033939757],"about_ca_topic_score_codex":0.0054687923,"about_ca_topic_score_gemma":0.003335363,"teacher_disagreement_score":0.0054687923,"about_ca_system_score_codex":0.0012446536,"about_ca_system_score_gemma":0.002549771,"threshold_uncertainty_score":0.010873914},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45776272,0.0023747021,0.115009256,0.02060382,0.0052713063,0.00047829672,0.0031214633,0.004523551,0.39085498],"genre_scores_gemma":[0.91668046,0.0017842898,0.031918477,0.0030713438,0.00064894935,0.00021309369,0.0022067423,0.0024727567,0.041003805],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9977748,0.0010680503,0.0001317173,0.00033062792,0.0005039575,0.00019087817],"domain_scores_gemma":[0.9953225,0.001418985,0.00033592418,0.0007901826,0.0019994613,0.00013283936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023941374,0.0006790144,0.00035522843,0.0009247794,0.0011730717,0.0047710454,0.00042636736,0.00070977997,0.01702052],"category_scores_gemma":[0.014749013,0.00042874945,0.0005320505,0.0012545019,0.0014630515,0.0035189162,0.0015298941,0.0012963761,0.0127033405],"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.00083097944,0.0002845692,0.023545807,0.0013873908,0.00021177216,0.001993182,0.029778084,0.0036643576,0.11334377,0.0991704,0.10189084,0.6238989],"study_design_scores_gemma":[0.00019872656,0.00040353538,0.050124668,0.0006311639,0.0003306621,0.0020713017,0.024971815,0.034844875,0.08888031,0.1564288,0.6408977,0.00021646854],"about_ca_topic_score_codex":0.0023195138,"about_ca_topic_score_gemma":0.002002365,"teacher_disagreement_score":0.01702052,"about_ca_system_score_codex":0.001279678,"about_ca_system_score_gemma":0.00090314,"threshold_uncertainty_score":0.056939304},"labels":[],"label_agreement":null},{"id":"W2540405007","doi":"10.1613/jair.5128","title":"Optimal Partial-Order Plan Relaxation via MaxSAT","year":2016,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Flexibility (engineering); Computer science; Plan (archaeology); Encoding (memory); Mathematical optimization; Heuristic; Metric (unit); Order (exchange); Algorithm; Artificial intelligence; Mathematics; Operations management","score_opus":0.15473498814575595,"score_gpt":0.3874821599405522,"score_spread":0.23274717179479623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2540405007","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034105375,0.0002689569,0.95345664,0.0003078934,0.00003108608,0.00020172416,0.0004711987,0.0010529849,0.010104092],"genre_scores_gemma":[0.32983556,0.00028780458,0.6649839,0.00015161753,0.00002445359,0.00034204556,0.00085527054,0.000259807,0.0032595228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946374,0.00019735965,0.000023091436,0.00009759572,0.00014967339,0.00006861139],"domain_scores_gemma":[0.999014,0.0007039748,0.000097646196,0.000080352445,0.00007754475,0.000026451016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008612095,0.0010235466,0.0005209737,0.0004801233,0.00034573738,0.0007141525,0.000681792,0.000494368,0.0034198493],"category_scores_gemma":[0.0025355853,0.0005180563,0.0008606386,0.0007299049,0.0007100124,0.0011177118,0.00093011174,0.0012335911,0.00040936156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010877472,0.0000579339,0.00034673428,0.00018583598,0.00003150773,0.00011125913,0.00008582317,0.89846253,0.002674011,0.035805494,0.0025894307,0.05954062],"study_design_scores_gemma":[0.000041950687,0.00007875955,0.000115394054,0.000026860578,0.00001754739,0.00003853174,0.000058820046,0.9462395,0.0025327578,0.048183385,0.0026579145,0.000008669009],"about_ca_topic_score_codex":0.0028963028,"about_ca_topic_score_gemma":0.0062071546,"teacher_disagreement_score":0.0034198493,"about_ca_system_score_codex":0.00083201646,"about_ca_system_score_gemma":0.001608962,"threshold_uncertainty_score":0.0114405155},"labels":[],"label_agreement":null},{"id":"W2548985425","doi":"10.1613/jair.4908","title":"Scrubbing During Learning In Real-time Heuristic Search","year":2016,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristic; Computer science; Incremental heuristic search; Bounded function; State (computer science); Computation; Simple (philosophy); Mathematical optimization; Data scrubbing; State space; Algorithm; Beam search; Search algorithm; Mathematics; Artificial intelligence","score_opus":0.12913082411398621,"score_gpt":0.39175393480266063,"score_spread":0.2626231106886744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548985425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14237659,0.0006874851,0.8493845,0.0004074934,0.00004310114,0.00011293237,0.00003436231,0.0017000247,0.0052535213],"genre_scores_gemma":[0.87094665,0.00017820626,0.12697408,0.00012620674,0.000015356882,0.00013067624,0.00006953014,0.0001800725,0.0013792524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738675,0.0011218251,0.00010447797,0.00037249643,0.00054400985,0.00047048528],"domain_scores_gemma":[0.9859235,0.009873094,0.0009781049,0.0019200222,0.00085438916,0.00045090413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035729087,0.00084191555,0.0013617086,0.0005222868,0.0007989145,0.0014208015,0.0020284285,0.0013738575,0.0022554004],"category_scores_gemma":[0.02596865,0.00068038056,0.0005316617,0.0006841766,0.0021009073,0.0029799927,0.0017077551,0.0018573542,0.000698957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044465144,0.00022053446,0.0016484678,0.00015130322,0.000048535076,0.00014547496,0.00041233495,0.8588634,0.0050860397,0.023164717,0.00094652537,0.10886806],"study_design_scores_gemma":[0.00002112678,0.000097384225,0.00017117237,0.000013361496,0.00000964951,0.000038206832,0.00005517784,0.98321265,0.0026080578,0.013265353,0.00049963564,0.000008198342],"about_ca_topic_score_codex":0.0040808367,"about_ca_topic_score_gemma":0.0038010944,"teacher_disagreement_score":0.0040808367,"about_ca_system_score_codex":0.0014406301,"about_ca_system_score_gemma":0.0024959785,"threshold_uncertainty_score":0.018895566},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17839244,0.0050433557,0.7775353,0.012547435,0.00030538588,0.0002903121,0.0031079687,0.0018701892,0.020907575],"genre_scores_gemma":[0.68789864,0.0053770095,0.2867139,0.0027387515,0.0010825626,0.0006975748,0.0039853766,0.0011689211,0.01033732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994436,0.0017955248,0.00022726269,0.0014485987,0.0012500533,0.0008425108],"domain_scores_gemma":[0.93213403,0.060353965,0.0023318066,0.0029155435,0.0012361675,0.0010283797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047389637,0.0021447968,0.0030244512,0.0018008385,0.0017760668,0.005373297,0.005851966,0.003536266,0.00929116],"category_scores_gemma":[0.0429528,0.0017985489,0.0036019355,0.0037268237,0.003947707,0.013563579,0.003090178,0.009104516,0.0011541586],"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.0008520202,0.00077719096,0.0040077334,0.0013698821,0.0003317998,0.00039942432,0.0013263096,0.4502202,0.004709152,0.43240938,0.026219942,0.077377],"study_design_scores_gemma":[0.0000864168,0.000051898638,0.0003397724,0.0000655293,0.000058352212,0.00016571999,0.00014199487,0.34323627,0.0010165802,0.6524714,0.002341804,0.000024166662],"about_ca_topic_score_codex":0.003890474,"about_ca_topic_score_gemma":0.0037231888,"teacher_disagreement_score":0.00929116,"about_ca_system_score_codex":0.003988109,"about_ca_system_score_gemma":0.0023406066,"threshold_uncertainty_score":0.031082094},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032780834,0.00026245066,0.9525408,0.00029155915,0.00009018817,0.00038219502,0.000082082974,0.00034535356,0.013224453],"genre_scores_gemma":[0.4849329,0.0004892784,0.49928403,0.00037722432,0.00011905533,0.0015144504,0.0004214796,0.00044353397,0.012418051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98800534,0.0054841484,0.0009538968,0.0017167261,0.0028567987,0.0009830146],"domain_scores_gemma":[0.94324213,0.038260236,0.002844868,0.0057107247,0.00892694,0.0010151372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013649496,0.0014522633,0.0020411848,0.0023740206,0.0019091526,0.0031113708,0.0033783526,0.0024491525,0.0054338323],"category_scores_gemma":[0.100014545,0.0010212702,0.0019095533,0.001307908,0.0032500713,0.003751154,0.0042256103,0.0036167332,0.0022732746],"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.00022647316,0.00020810825,0.006431676,0.00033136475,0.000252254,0.00034064148,0.0015027871,0.3112554,0.0033865508,0.5135826,0.004213867,0.15826842],"study_design_scores_gemma":[0.000049473696,0.0001034633,0.00036755757,0.0001093667,0.000031760366,0.00015197175,0.0001373774,0.7401203,0.0021205992,0.2533115,0.0034494314,0.00004719589],"about_ca_topic_score_codex":0.0033824265,"about_ca_topic_score_gemma":0.002918478,"teacher_disagreement_score":0.013649496,"about_ca_system_score_codex":0.0016295771,"about_ca_system_score_gemma":0.0028983005,"threshold_uncertainty_score":0.07218629},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4059825,0.0005814948,0.58344334,0.000542986,0.00006371285,0.00012936998,0.000505764,0.004807322,0.0039435807],"genre_scores_gemma":[0.8464265,0.00012096097,0.15195414,0.00007524826,0.000018833336,0.00013167871,0.00046047123,0.00016006794,0.0006520289],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984894,0.0004027772,0.00009502587,0.0003412959,0.00047854037,0.00019304617],"domain_scores_gemma":[0.9785296,0.016204424,0.0011369336,0.0020591556,0.0016673587,0.0004024643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037117063,0.0008334094,0.0009332098,0.002009729,0.0006824193,0.0012333979,0.0020231477,0.0012497933,0.0013761858],"category_scores_gemma":[0.024461584,0.0006220393,0.0006130026,0.0011504409,0.001013431,0.0027005405,0.0011972471,0.0019485265,0.00058110745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048498006,0.00018165518,0.027866526,0.00010265819,0.000081809565,0.00005942199,0.000147989,0.76881874,0.0037296782,0.011615282,0.0025748734,0.18433638],"study_design_scores_gemma":[0.0000079301935,0.00002577548,0.00056608295,0.00000392724,0.000005448347,0.000011122505,0.000007428083,0.9952781,0.0014562022,0.0025130527,0.000118860095,0.000005995434],"about_ca_topic_score_codex":0.006913771,"about_ca_topic_score_gemma":0.0063533033,"teacher_disagreement_score":0.006913771,"about_ca_system_score_codex":0.0018024319,"about_ca_system_score_gemma":0.002093738,"threshold_uncertainty_score":0.019629598},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005117936,0.00022953835,0.9903527,0.00041006852,0.000029532575,0.00015010042,0.00013458342,0.00062022096,0.0029552805],"genre_scores_gemma":[0.23380615,0.00067808374,0.7600631,0.00041292314,0.000100611156,0.00062402803,0.00061950134,0.00038218623,0.0033135086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99540496,0.001158235,0.0003667406,0.00069729774,0.001981587,0.00039114876],"domain_scores_gemma":[0.99394566,0.0036475214,0.0004413078,0.0011646011,0.00063419674,0.00016672382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00542762,0.0017132742,0.0013545416,0.0015633026,0.0019293525,0.005855146,0.003099666,0.0017834515,0.0037636326],"category_scores_gemma":[0.0134417685,0.00145933,0.0039583296,0.0014499796,0.004724798,0.0077158865,0.0057564764,0.0057015913,0.0008086868],"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.0002151679,0.00007991382,0.00094688777,0.00039547365,0.00015756198,0.0004375689,0.0011267203,0.28606123,0.0042237896,0.633262,0.0026654406,0.07042829],"study_design_scores_gemma":[0.00008195284,0.00005738055,0.000106266256,0.000092915136,0.00013491035,0.00014779351,0.00012640629,0.48032537,0.0036474604,0.5046187,0.010615927,0.00004487229],"about_ca_topic_score_codex":0.007547534,"about_ca_topic_score_gemma":0.008742879,"teacher_disagreement_score":0.007547534,"about_ca_system_score_codex":0.0029665173,"about_ca_system_score_gemma":0.003932511,"threshold_uncertainty_score":0.028704286},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2305324,0.0001972515,0.75660735,0.00058041554,0.00007072338,0.00034131334,0.00010651805,0.0013782285,0.0101858275],"genre_scores_gemma":[0.5780514,0.00018867601,0.41822076,0.000108997956,0.000015834572,0.00017784917,0.00011179419,0.00012808322,0.0029966936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992434,0.00032550583,0.000033514785,0.00014639746,0.00014242582,0.00010876068],"domain_scores_gemma":[0.9985273,0.0008964275,0.0001223239,0.000183524,0.00014644735,0.00012392715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011754155,0.0007346982,0.00040097232,0.0003303076,0.0007734207,0.0009143301,0.0013717376,0.0011161083,0.00275784],"category_scores_gemma":[0.003845531,0.00039473549,0.00060734205,0.0004370877,0.0010322335,0.001029879,0.001261664,0.0008844302,0.00036399497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002899397,0.000291285,0.0018855936,0.00018748143,0.000040555136,0.00038070753,0.0010636945,0.8899295,0.0057544718,0.014353064,0.001337676,0.08448612],"study_design_scores_gemma":[0.00006208935,0.00022535051,0.00040305755,0.000016890122,0.000023670296,0.000064563195,0.0005279893,0.9820578,0.004745679,0.007096956,0.0047577145,0.000018255543],"about_ca_topic_score_codex":0.019202046,"about_ca_topic_score_gemma":0.019533448,"teacher_disagreement_score":0.019202046,"about_ca_system_score_codex":0.0013735121,"about_ca_system_score_gemma":0.0022162695,"threshold_uncertainty_score":0.03818059},"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":"methods","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0226384,0.00090480474,0.94355875,0.009530804,0.000414702,0.0009384098,0.0006010251,0.004081619,0.017331548],"genre_scores_gemma":[0.27907112,0.0005345293,0.70796525,0.0023155762,0.00023088715,0.002501197,0.0008710578,0.0015404877,0.004969928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.85086155,0.11935372,0.005649713,0.0068768966,0.015631622,0.0016265175],"domain_scores_gemma":[0.7420573,0.1925093,0.0065828827,0.028892618,0.026182925,0.0037749142],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.10923592,0.0015761099,0.0020311747,0.0024305335,0.0019751743,0.008701421,0.0051527256,0.0040629786,0.008125558],"category_scores_gemma":[0.3080233,0.0011850151,0.0012572375,0.0021368524,0.0062460788,0.015336964,0.01014672,0.0097046085,0.0024858876],"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.001562071,0.0007472308,0.0047251303,0.0011170008,0.00043644273,0.00018145624,0.0025967346,0.13082339,0.0014671118,0.5359082,0.03554575,0.28488958],"study_design_scores_gemma":[0.000585775,0.0006794519,0.0008370691,0.00060340256,0.00010919046,0.00012476926,0.0007289476,0.5693612,0.0039512413,0.3831101,0.03976535,0.00014363785],"about_ca_topic_score_codex":0.0058226613,"about_ca_topic_score_gemma":0.0065632327,"teacher_disagreement_score":0.89076406,"about_ca_system_score_codex":0.005616248,"about_ca_system_score_gemma":0.00810021,"threshold_uncertainty_score":0.5777017},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26308388,0.00060479325,0.70774937,0.0010617682,0.000054346583,0.000101214144,0.00031506273,0.0005472174,0.026482385],"genre_scores_gemma":[0.9344654,0.0002365274,0.059213486,0.00025561833,0.00006565391,0.00013607142,0.00027981403,0.00014550395,0.005201921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738544,0.00056623697,0.00019400258,0.0006813691,0.0008115566,0.0003613188],"domain_scores_gemma":[0.9911187,0.0042882157,0.00063400524,0.0021438717,0.0014838866,0.00033132033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025156324,0.00048427703,0.0006774763,0.0014012627,0.0009492949,0.0015812869,0.0014856594,0.00097419927,0.0040121414],"category_scores_gemma":[0.012896024,0.00046576015,0.0011677687,0.0010265167,0.0033333583,0.0069961385,0.00337938,0.0026362212,0.00043674553],"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.00010420662,0.000054320913,0.0020612301,0.00010672573,0.000035264697,0.00027734792,0.0010272674,0.0077425754,0.00512977,0.9533692,0.0006889796,0.029403191],"study_design_scores_gemma":[0.000025653311,0.00007864442,0.0017416283,0.000031238258,0.00003470022,0.0003519486,0.00021490626,0.08037929,0.0055137626,0.9070092,0.00458784,0.000031210864],"about_ca_topic_score_codex":0.0017367632,"about_ca_topic_score_gemma":0.0008847922,"teacher_disagreement_score":0.0040121414,"about_ca_system_score_codex":0.0018861899,"about_ca_system_score_gemma":0.0008895692,"threshold_uncertainty_score":0.013685346},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040219735,0.0012323519,0.9535852,0.0016560089,0.00006628797,0.00007012865,0.00006668165,0.00040123734,0.002702342],"genre_scores_gemma":[0.89404565,0.001089695,0.09997935,0.0012345188,0.0002885227,0.00028954973,0.00020038744,0.00036905185,0.0025031907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9910678,0.004626104,0.00044216958,0.0012747728,0.0019600557,0.0006290739],"domain_scores_gemma":[0.83561075,0.14704531,0.005741118,0.0057010166,0.0046770894,0.0012247117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02382284,0.0018160526,0.0028134729,0.001269107,0.00085403584,0.0024130107,0.0025609976,0.0027917668,0.0021972938],"category_scores_gemma":[0.16478752,0.0010753957,0.0012544899,0.0010373312,0.0059466986,0.005498552,0.0044169854,0.005262859,0.00027995222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000349365,0.000122015095,0.004518362,0.0002787921,0.00016748159,0.00023441078,0.00024396935,0.8904447,0.0014586322,0.07706246,0.0008180702,0.02430166],"study_design_scores_gemma":[0.00003526324,0.0001103705,0.00059672387,0.00006481957,0.000028117205,0.000060833558,0.000022616177,0.92931813,0.00058385683,0.06891898,0.00023749779,0.000022783604],"about_ca_topic_score_codex":0.0047306316,"about_ca_topic_score_gemma":0.003180675,"teacher_disagreement_score":0.02382284,"about_ca_system_score_codex":0.003802431,"about_ca_system_score_gemma":0.0022761542,"threshold_uncertainty_score":0.12598872},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07151244,0.00071834034,0.878687,0.005025184,0.00022022327,0.00021168569,0.000115185394,0.00039020713,0.043119673],"genre_scores_gemma":[0.90587467,0.00026282936,0.08772141,0.00032781094,0.00012934169,0.00015505173,0.000052537453,0.000054355554,0.005421937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99086225,0.0041494337,0.00065955776,0.001739182,0.0019928166,0.000596763],"domain_scores_gemma":[0.96854246,0.017991012,0.0028094032,0.005689747,0.0038789643,0.0010885061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009958542,0.0005812149,0.0008299193,0.0014457646,0.0014384367,0.004474024,0.001581686,0.0022309483,0.004304482],"category_scores_gemma":[0.03568843,0.00060561433,0.0013532953,0.00082259404,0.008444753,0.008935822,0.0031780622,0.0045819934,0.0004411709],"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.000034194876,0.000021262658,0.00041118488,0.00006121319,0.00003514558,0.00015600047,0.0011803574,0.004044755,0.0010472527,0.98347384,0.000403128,0.009131666],"study_design_scores_gemma":[0.000028898836,0.00007534446,0.00033763456,0.000043487176,0.000027821545,0.00015749072,0.00017088105,0.032019846,0.001144901,0.96287686,0.0030836659,0.00003327787],"about_ca_topic_score_codex":0.0018597338,"about_ca_topic_score_gemma":0.0009667976,"teacher_disagreement_score":0.009958542,"about_ca_system_score_codex":0.0026198355,"about_ca_system_score_gemma":0.0018342781,"threshold_uncertainty_score":0.052666426},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04636739,0.003998628,0.7970407,0.0077329185,0.00035163993,0.00008378811,0.00035809423,0.00040662385,0.14366023],"genre_scores_gemma":[0.90317285,0.0017079561,0.0750961,0.0015862115,0.00062541047,0.00010831355,0.000378992,0.00012512051,0.017199038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979976,0.00042488266,0.00015406511,0.00046358217,0.00064341084,0.0003165012],"domain_scores_gemma":[0.9954312,0.0018477734,0.0003402866,0.0015183846,0.000687544,0.00017483257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025489295,0.0005854493,0.0004910877,0.0024683764,0.0019547364,0.004994651,0.002398315,0.002257235,0.005231712],"category_scores_gemma":[0.005031308,0.00044963165,0.001642707,0.0018870789,0.010444047,0.017318726,0.0041999896,0.0036859752,0.00057236676],"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.0000065445233,0.000005459035,0.00011127392,0.000021992091,0.00000646581,0.00009687175,0.0004475779,0.0010382682,0.000161624,0.99432474,0.00034558016,0.003433539],"study_design_scores_gemma":[0.000005854375,0.00001079194,0.00013195712,0.000024949464,0.000015700176,0.0001252855,0.00007521186,0.004296965,0.0004025371,0.98858297,0.006318596,0.000009157866],"about_ca_topic_score_codex":0.0024776445,"about_ca_topic_score_gemma":0.0016178964,"teacher_disagreement_score":0.005231712,"about_ca_system_score_codex":0.0024856026,"about_ca_system_score_gemma":0.0013717964,"threshold_uncertainty_score":0.018034399},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019271424,0.00009373725,0.9785452,0.00016791065,0.000029012095,0.000052724747,0.000045002485,0.0009110093,0.00088387355],"genre_scores_gemma":[0.78490114,0.00012531837,0.21186893,0.00020366162,0.00003769122,0.0002822304,0.0001892908,0.00021963897,0.0021720424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943346,0.00026708597,0.000022897782,0.00008923807,0.00012347911,0.0000639436],"domain_scores_gemma":[0.9977538,0.0014163131,0.00018484796,0.00021272016,0.00026852035,0.00016380167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022205336,0.00082570704,0.0011725331,0.0005155936,0.00031285672,0.00067542144,0.0024616227,0.0011944871,0.0020295987],"category_scores_gemma":[0.0054210527,0.0006536679,0.00060761307,0.00032959422,0.00095688127,0.0013800813,0.0016066043,0.002274984,0.00035017292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073274496,0.000046230438,0.00039628556,0.000025423506,0.00003113765,0.000024771698,0.000021413802,0.9791047,0.000841835,0.004663364,0.00037797645,0.014393648],"study_design_scores_gemma":[0.000003890369,0.000010502766,0.000010553448,9.832464e-7,0.0000011818338,0.0000016244854,6.2483446e-7,0.9987715,0.00011599105,0.0010397619,0.000042082756,0.0000012229419],"about_ca_topic_score_codex":0.0052162223,"about_ca_topic_score_gemma":0.004409615,"teacher_disagreement_score":0.0052162223,"about_ca_system_score_codex":0.0011686512,"about_ca_system_score_gemma":0.0020602695,"threshold_uncertainty_score":0.011743426},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048456145,0.0007034108,0.9903195,0.0003285339,0.000056060613,0.000032734904,0.00013260407,0.00024809875,0.0033334992],"genre_scores_gemma":[0.5139069,0.0023074402,0.46672583,0.0005092653,0.00021907051,0.0004567803,0.0010545171,0.0002660844,0.014554148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915683,0.00030314946,0.000049690865,0.00026153162,0.00014257098,0.000086245374],"domain_scores_gemma":[0.99843866,0.0009833758,0.00013120408,0.00014824147,0.00023736861,0.00006125607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015492603,0.0012000232,0.0011448277,0.00075038086,0.00050113583,0.0014855985,0.0022303348,0.0021903368,0.0050246576],"category_scores_gemma":[0.008255697,0.000639345,0.0010300928,0.000946185,0.0014079892,0.0034383785,0.001701999,0.0023383931,0.0013170049],"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.000053097287,0.000036401536,0.0008621249,0.00013352818,0.000052924534,0.00012507655,0.00009267275,0.70223784,0.00097548554,0.21310517,0.0030955488,0.07923016],"study_design_scores_gemma":[0.000004469489,0.000009906749,0.0000661751,0.000013698708,0.000004674768,0.000021923377,0.000006113997,0.9055785,0.00021369774,0.09249068,0.0015829462,0.0000072707235],"about_ca_topic_score_codex":0.003776746,"about_ca_topic_score_gemma":0.0033932049,"teacher_disagreement_score":0.0050246576,"about_ca_system_score_codex":0.001440309,"about_ca_system_score_gemma":0.00093045837,"threshold_uncertainty_score":0.016809225},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01679389,0.00012598523,0.97966504,0.00036858118,0.0000445777,0.000046462927,0.000053484568,0.0007189062,0.0021831589],"genre_scores_gemma":[0.88727224,0.00013462562,0.108654164,0.0002729237,0.000039132243,0.00024876758,0.00013108856,0.00014372896,0.0031033184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937683,0.00027128306,0.00003212376,0.00015730904,0.000105930856,0.000056572742],"domain_scores_gemma":[0.99786633,0.0014664843,0.00019536001,0.00025755673,0.00014568826,0.00006858312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015387996,0.00082286296,0.0006731302,0.0003128105,0.00031874835,0.0009020603,0.0014552514,0.0009878164,0.0038699256],"category_scores_gemma":[0.008419376,0.00037676233,0.00046458046,0.00032371905,0.0016158243,0.002792707,0.0016389193,0.0022858505,0.0006117422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010574236,0.00011970233,0.00055122864,0.0001001776,0.00002803802,0.0001357105,0.00022033199,0.859905,0.00339498,0.077627555,0.0012254252,0.05658612],"study_design_scores_gemma":[0.000009332321,0.000029290677,0.000028814573,0.000007184947,0.0000033413874,0.000008356428,0.000008064091,0.9723651,0.00069735834,0.026296433,0.0005424908,0.0000042166407],"about_ca_topic_score_codex":0.0021774222,"about_ca_topic_score_gemma":0.0020205623,"teacher_disagreement_score":0.0038699256,"about_ca_system_score_codex":0.0011664757,"about_ca_system_score_gemma":0.0010010636,"threshold_uncertainty_score":0.012946188},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030709248,0.00045326725,0.93535,0.001152464,0.00010321083,0.00017956308,0.0001494575,0.00043883262,0.031463973],"genre_scores_gemma":[0.6446765,0.00042229364,0.33989465,0.0006750866,0.00028444946,0.00028805452,0.0002120607,0.00017051959,0.013376455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996849,0.0009399248,0.00018251881,0.00066135597,0.0010828449,0.00028431858],"domain_scores_gemma":[0.9953903,0.0017481532,0.00035830744,0.0016044847,0.0006933952,0.00020527063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004510775,0.00059781724,0.0005001902,0.0013806656,0.0010227379,0.0021522269,0.0021262455,0.0013155155,0.0040757316],"category_scores_gemma":[0.010060462,0.00039418292,0.0017427049,0.0011730007,0.004587142,0.0057952194,0.0029255382,0.003372946,0.00057838054],"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.000033708155,0.000020015927,0.00030993365,0.000045080782,0.00001532016,0.00011591795,0.0007968029,0.004077212,0.0019751505,0.95812124,0.0008225252,0.033667192],"study_design_scores_gemma":[0.00003693821,0.00010507586,0.0006400463,0.000040489842,0.000030407735,0.0004988713,0.00018958224,0.053609885,0.004086105,0.91727066,0.023444967,0.000046927707],"about_ca_topic_score_codex":0.001923755,"about_ca_topic_score_gemma":0.0013266666,"teacher_disagreement_score":0.004510775,"about_ca_system_score_codex":0.0023036113,"about_ca_system_score_gemma":0.0014927144,"threshold_uncertainty_score":0.023855567},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04718435,0.00029036147,0.9447637,0.0006416303,0.000045258974,0.00018434788,0.0006476539,0.0007627015,0.005479967],"genre_scores_gemma":[0.650321,0.00069249776,0.3406288,0.00036139882,0.00010019759,0.0007947571,0.0011544727,0.0002937206,0.005653239],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983364,0.0008257651,0.00008613585,0.0002877151,0.00032226194,0.00014178315],"domain_scores_gemma":[0.99406993,0.0041876673,0.00051311596,0.0004617185,0.0005027873,0.00026474718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029518295,0.0014990809,0.0010660808,0.0012561824,0.00065981236,0.0022737202,0.0027113906,0.0013312198,0.0044014608],"category_scores_gemma":[0.016328115,0.0008931039,0.0016553806,0.0009146124,0.0013576575,0.0037396087,0.0015480084,0.0031066134,0.0013643145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007693407,0.000063301326,0.00326168,0.00006440151,0.00005023642,0.000033890898,0.00014103645,0.9091968,0.00033884388,0.07499521,0.0012162746,0.010561471],"study_design_scores_gemma":[0.000006975942,0.0000116211995,0.00014533462,0.0000061328024,0.000005516293,0.0000040608084,0.0000088936085,0.96171904,0.000055157652,0.03767117,0.0003594111,0.0000066683533],"about_ca_topic_score_codex":0.011886297,"about_ca_topic_score_gemma":0.012668342,"teacher_disagreement_score":0.011886297,"about_ca_system_score_codex":0.0023168381,"about_ca_system_score_gemma":0.0014238612,"threshold_uncertainty_score":0.023634255},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020108098,0.0001562998,0.97708225,0.00015275179,0.000021293994,0.000055647615,0.00012351862,0.00028625564,0.0020138917],"genre_scores_gemma":[0.67246115,0.0004029033,0.32424262,0.000093236595,0.000035010406,0.00034660927,0.00027133565,0.00007795761,0.0020691608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993474,0.0002297257,0.000044490043,0.00014457383,0.00014822533,0.00008562833],"domain_scores_gemma":[0.9986859,0.0008383844,0.00017907865,0.00011758889,0.00010250467,0.00007652195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001276598,0.0007442669,0.0007625017,0.00037669926,0.00052034564,0.0011725494,0.0010290835,0.0008020538,0.001733584],"category_scores_gemma":[0.0029430045,0.0005720668,0.0007816371,0.00051418215,0.0012037026,0.0012813654,0.0013460508,0.0015182246,0.00020224067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022989452,0.000012561754,0.00029191346,0.00003246828,0.000009994695,0.000047077545,0.000037343758,0.9762113,0.00037265813,0.017381912,0.0001785192,0.0054012984],"study_design_scores_gemma":[0.000009949988,0.000011027895,0.00006496305,0.000004597137,0.000003593588,0.000007650508,0.000010849337,0.98498523,0.00023766533,0.014133676,0.00052763923,0.0000031986551],"about_ca_topic_score_codex":0.0057927417,"about_ca_topic_score_gemma":0.0073644486,"teacher_disagreement_score":0.0057927417,"about_ca_system_score_codex":0.0010735804,"about_ca_system_score_gemma":0.0013823872,"threshold_uncertainty_score":0.011518061},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04465134,0.3770944,0.52945924,0.00410561,0.001490799,0.00027914176,0.0027158195,0.003212214,0.0369914],"genre_scores_gemma":[0.3505426,0.44288376,0.175054,0.0016864998,0.0027932324,0.00028132543,0.008448797,0.0011861346,0.017123625],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989674,0.0001735386,0.00009860905,0.00021637842,0.00045780826,0.00008628389],"domain_scores_gemma":[0.99701023,0.001664363,0.00021284379,0.0003489508,0.00063234026,0.00013130972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010757609,0.0012708138,0.0013747187,0.004352909,0.00058485277,0.0025386855,0.0013743397,0.0012238526,0.0041213096],"category_scores_gemma":[0.0062115947,0.00047963174,0.0012666085,0.0061699594,0.0007984134,0.005312099,0.0012254671,0.001617221,0.002272471],"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.00015275776,0.00022072432,0.005071874,0.0026773198,0.00020180261,0.00024017184,0.00020905031,0.022855721,0.0027378649,0.0808486,0.04046718,0.84431696],"study_design_scores_gemma":[0.000045382785,0.00035937683,0.0103140455,0.0012484969,0.00029033335,0.0043210625,0.00045511185,0.25728038,0.006516989,0.28407714,0.4348915,0.00020017046],"about_ca_topic_score_codex":0.003256988,"about_ca_topic_score_gemma":0.002320815,"teacher_disagreement_score":0.004352909,"about_ca_system_score_codex":0.001074099,"about_ca_system_score_gemma":0.0009823631,"threshold_uncertainty_score":0.01378715},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002245158,0.00016209629,0.93354607,0.0001436788,0.000044084383,0.00030865255,0.00055876415,0.060364284,0.0026271646],"genre_scores_gemma":[0.06390143,0.00016399584,0.9239173,0.00021559212,0.000060636703,0.0012175811,0.001818835,0.0071221134,0.0015825408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99385417,0.0021205787,0.000562782,0.00095255335,0.00203448,0.00047552734],"domain_scores_gemma":[0.99212074,0.003754105,0.0005655599,0.0021690116,0.0011412689,0.0002492581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006468293,0.002075024,0.0016195856,0.0025352754,0.0010001765,0.003973432,0.006449062,0.0015739549,0.013778768],"category_scores_gemma":[0.021535153,0.0018218949,0.0018240112,0.0015717931,0.0014480388,0.004779598,0.0044563375,0.004476169,0.005830805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010825511,0.00052252365,0.002177864,0.0011267916,0.00021858427,0.00043992515,0.0004207735,0.21227483,0.01805091,0.076521054,0.0643884,0.6227758],"study_design_scores_gemma":[0.00028195122,0.00015994105,0.00041292532,0.00012424425,0.00005136942,0.000249839,0.0000691782,0.88800496,0.021242192,0.045840893,0.04343589,0.00012667192],"about_ca_topic_score_codex":0.0018041106,"about_ca_topic_score_gemma":0.0027227974,"teacher_disagreement_score":0.013778768,"about_ca_system_score_codex":0.0017065526,"about_ca_system_score_gemma":0.0037474853,"threshold_uncertainty_score":0.046094596},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15424353,0.00034079142,0.8367048,0.00036827856,0.000044680753,0.00008393428,0.0001256203,0.00056185666,0.007526551],"genre_scores_gemma":[0.86020225,0.00017343233,0.1369547,0.00008290458,0.00001785341,0.00011562685,0.00010713824,0.000034966684,0.0023111126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995647,0.00014119918,0.00002008826,0.000109525114,0.0000916472,0.00007279737],"domain_scores_gemma":[0.99931407,0.00039225313,0.000091351125,0.000068307345,0.000071207454,0.000062721454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005207937,0.000540499,0.0007144453,0.00040878347,0.00053192145,0.0008471964,0.0009809168,0.00081616506,0.0014083273],"category_scores_gemma":[0.0015936102,0.00035144298,0.00046800566,0.0008623937,0.0005830453,0.00089465355,0.000998333,0.00061084697,0.0002191884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009024136,0.000033219603,0.0005155345,0.000031681382,0.000033980217,0.00012937456,0.000045878613,0.9696456,0.0027756006,0.007030921,0.0005853005,0.019082688],"study_design_scores_gemma":[0.00001546707,0.000036927526,0.0000915352,0.0000022479196,0.0000052644887,0.000021009471,0.000024710156,0.995981,0.0006373547,0.002678308,0.000502752,0.0000034298132],"about_ca_topic_score_codex":0.009322102,"about_ca_topic_score_gemma":0.0060397163,"teacher_disagreement_score":0.009322102,"about_ca_system_score_codex":0.00068269344,"about_ca_system_score_gemma":0.0010770578,"threshold_uncertainty_score":0.018535674},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004046077,0.0004696686,0.992261,0.0006796714,0.000047924423,0.00004722802,0.000061250576,0.0002548097,0.0021324144],"genre_scores_gemma":[0.30112502,0.0013487568,0.6926191,0.0004856641,0.0003095149,0.000350815,0.00032092325,0.00029545103,0.003144829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943262,0.0030316296,0.00019553213,0.0005732517,0.0016122159,0.00026121808],"domain_scores_gemma":[0.9694298,0.026529701,0.00079111033,0.0013087912,0.0015799733,0.00036056034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006280714,0.0017211739,0.0012379816,0.002290575,0.0010185393,0.00392913,0.0029306405,0.0026253897,0.0037777475],"category_scores_gemma":[0.038549434,0.0011212011,0.0011962348,0.0036838148,0.003038205,0.005180322,0.0040992675,0.005923419,0.0007205204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021835085,0.00012191699,0.0011277721,0.00036988207,0.00014450855,0.000100754376,0.00042529643,0.59430647,0.0007556979,0.21761663,0.0048176963,0.17999499],"study_design_scores_gemma":[0.000017759514,0.000018095876,0.000057489764,0.000031321037,0.000011736543,0.000012934215,0.000020673688,0.8867447,0.00039059407,0.111320674,0.0013623312,0.000011707891],"about_ca_topic_score_codex":0.011245817,"about_ca_topic_score_gemma":0.010557983,"teacher_disagreement_score":0.011245817,"about_ca_system_score_codex":0.0024070125,"about_ca_system_score_gemma":0.002253026,"threshold_uncertainty_score":0.033216},"labels":[],"label_agreement":null},{"id":"W3011683765","doi":"10.1613/jair.1.11659","title":"Solving Delete Free Planning with Relaxed Decision Diagram Based Heuristics","year":2020,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Binary decision diagram; Computer science; Leverage (statistics); Task (project management); Heuristic; Representation (politics); Mathematical optimization; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.19278465288359,"score_gpt":0.3880335451590027,"score_spread":0.19524889227541267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011683765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03120492,0.00023920156,0.963845,0.00022823662,0.000034416404,0.00015685517,0.0002210125,0.0007367041,0.0033336077],"genre_scores_gemma":[0.28621817,0.0002184073,0.71098924,0.00011347972,0.00001542164,0.00029350113,0.0006362898,0.00018898043,0.0013265612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769825,0.0012303788,0.00012755278,0.00033639572,0.00039620904,0.0002112961],"domain_scores_gemma":[0.9914009,0.006726029,0.0004470978,0.0007704601,0.00044019643,0.00021525373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002744821,0.0010187955,0.00094284496,0.001165908,0.0005325424,0.0014648673,0.001560523,0.0010866113,0.004508391],"category_scores_gemma":[0.011987811,0.0008433774,0.0013187068,0.001093297,0.0012965526,0.0025010614,0.0018436752,0.002156767,0.00050559297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026273832,0.00015925494,0.0009935984,0.00036757533,0.000063773245,0.00009829375,0.00026346068,0.8412388,0.0026192477,0.059357397,0.0015169056,0.09305895],"study_design_scores_gemma":[0.00008302943,0.00012921588,0.0001562174,0.000045079163,0.00002935501,0.000036591548,0.000073012336,0.9290968,0.0024242739,0.06575855,0.0021472243,0.000020692372],"about_ca_topic_score_codex":0.0047081513,"about_ca_topic_score_gemma":0.008581103,"teacher_disagreement_score":0.0047081513,"about_ca_system_score_codex":0.001361612,"about_ca_system_score_gemma":0.003093579,"threshold_uncertainty_score":0.015082121},"labels":[],"label_agreement":null},{"id":"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03492989,0.6013572,0.064691104,0.15158229,0.0017211392,0.00036963925,0.001137423,0.0013089437,0.14290236],"genre_scores_gemma":[0.31771368,0.53068584,0.12330438,0.015309417,0.0024599533,0.0005301119,0.0037414741,0.0003477419,0.005907484],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99075025,0.004594809,0.00076934,0.00082012557,0.0025429719,0.0005225008],"domain_scores_gemma":[0.9471158,0.040028118,0.0016730264,0.0018730218,0.008094075,0.001216018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016068168,0.0009661526,0.0008657809,0.0062670894,0.0011988888,0.00938952,0.002896569,0.00263132,0.004325838],"category_scores_gemma":[0.04656734,0.000468333,0.000996462,0.006516016,0.002799377,0.009138815,0.0031912543,0.0035304117,0.0015614325],"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.0002563893,0.00015899318,0.011125149,0.006479935,0.00020765315,0.00028094184,0.00066066906,0.011187571,0.0019564247,0.12988614,0.034073226,0.8037269],"study_design_scores_gemma":[0.000070298825,0.000620374,0.010906917,0.014612992,0.00025580887,0.00094434444,0.002923203,0.051402524,0.00470876,0.1771308,0.7362823,0.00014162099],"about_ca_topic_score_codex":0.0029576162,"about_ca_topic_score_gemma":0.0026564025,"teacher_disagreement_score":0.016068168,"about_ca_system_score_codex":0.0026088692,"about_ca_system_score_gemma":0.004449649,"threshold_uncertainty_score":0.08497763},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020863006,0.00029705503,0.9721256,0.00039404022,0.000049328148,0.000056393696,0.00026078869,0.0018341218,0.004119665],"genre_scores_gemma":[0.68728644,0.00028267584,0.3054839,0.00028023007,0.000041372703,0.00026475196,0.0009672461,0.00033344413,0.00505987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997142,0.00005646962,0.000014813127,0.00008484276,0.00007501649,0.000054702803],"domain_scores_gemma":[0.99922144,0.00050449814,0.00006981572,0.000067600246,0.00008945471,0.00004722661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053818023,0.0011981763,0.000761872,0.00030450936,0.00031599737,0.0007755554,0.0011810963,0.00092334335,0.0041892063],"category_scores_gemma":[0.0019358653,0.0006668284,0.000679966,0.00042836132,0.00090785755,0.0014576635,0.0011699209,0.0020355918,0.0005471219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029004741,0.000013649798,0.00012522886,0.000024906074,0.0000062194267,0.000019558996,0.000013931872,0.984585,0.00027104229,0.0036796248,0.00056852924,0.010663358],"study_design_scores_gemma":[0.0000030524843,0.0000045898664,0.00000774938,0.0000018666689,9.64888e-7,0.0000016003785,0.0000021395304,0.99731404,0.000104439176,0.00244048,0.000118253476,8.9425146e-7],"about_ca_topic_score_codex":0.015763285,"about_ca_topic_score_gemma":0.023250071,"teacher_disagreement_score":0.015763285,"about_ca_system_score_codex":0.0015251559,"about_ca_system_score_gemma":0.0020564476,"threshold_uncertainty_score":0.031343043},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17828019,0.0011194927,0.64607376,0.0013294419,0.0007098787,0.002115611,0.02354344,0.092024475,0.054803655],"genre_scores_gemma":[0.72709686,0.0006579609,0.23006967,0.0003663127,0.000049129605,0.0022774905,0.020114273,0.0027204985,0.016647732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998337,0.000040797677,0.000014579665,0.000026070724,0.00005803764,0.000026759162],"domain_scores_gemma":[0.9996252,0.00017253942,0.000027735772,0.000032732445,0.0000860041,0.000055731398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035179814,0.00091899926,0.0005238865,0.000377181,0.00027404784,0.0005578734,0.0019819112,0.0010084142,0.010203866],"category_scores_gemma":[0.0012734649,0.00040562658,0.0006719326,0.0002342354,0.000289517,0.00057159725,0.0009897075,0.0013120683,0.0017361897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036427798,0.00024302759,0.0026136404,0.00044166384,0.00012051432,0.00029696253,0.00018379062,0.91938496,0.007471755,0.008092735,0.031199109,0.029587597],"study_design_scores_gemma":[0.00015369993,0.00006985058,0.00036450961,0.000014153108,0.00001591796,0.00003816241,0.000018767856,0.97564596,0.0019628792,0.00207643,0.019620797,0.000018934765],"about_ca_topic_score_codex":0.009364827,"about_ca_topic_score_gemma":0.009874087,"teacher_disagreement_score":0.010203866,"about_ca_system_score_codex":0.00042783882,"about_ca_system_score_gemma":0.0010919715,"threshold_uncertainty_score":0.03413534},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004660038,0.000083340376,0.9937045,0.00012505492,0.000016769913,0.000035022433,0.000025299774,0.0005355071,0.0008144121],"genre_scores_gemma":[0.46039012,0.0002563169,0.53626007,0.00023039775,0.000057161713,0.00037578453,0.00010568738,0.0002951884,0.0020293863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832875,0.0009114333,0.00007595006,0.00026667985,0.0003147154,0.000102588776],"domain_scores_gemma":[0.99436694,0.004296996,0.00036621792,0.00060422654,0.00023191313,0.00013379952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028778268,0.00085950684,0.00084210734,0.00050753955,0.00042145877,0.0013702131,0.0014309264,0.0012633456,0.003297319],"category_scores_gemma":[0.011167706,0.0005888832,0.0008212834,0.0004891472,0.0027385745,0.0028015117,0.001508486,0.0027153548,0.00056111097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002764249,0.0001254525,0.0010268751,0.0001839499,0.000060965758,0.00014881467,0.00028181385,0.61844987,0.005538596,0.27920255,0.0014100142,0.09329476],"study_design_scores_gemma":[0.000028042406,0.00005976033,0.00006505713,0.000021201784,0.000009422978,0.000022670678,0.000007260441,0.896973,0.0020857381,0.099312134,0.0014023357,0.000013287377],"about_ca_topic_score_codex":0.0014488079,"about_ca_topic_score_gemma":0.0013539484,"teacher_disagreement_score":0.003297319,"about_ca_system_score_codex":0.0010353817,"about_ca_system_score_gemma":0.0011840691,"threshold_uncertainty_score":0.015219629},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17518575,0.24987008,0.52469933,0.0077625103,0.0003454538,0.000286406,0.0007028383,0.0012468739,0.039900746],"genre_scores_gemma":[0.85482806,0.08804004,0.05250425,0.0007324736,0.00053197274,0.0002182049,0.00039076735,0.00027668572,0.0024775448],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9970482,0.001200976,0.00018324149,0.0007356035,0.0006543045,0.000177672],"domain_scores_gemma":[0.9565618,0.03671146,0.002077174,0.0022014203,0.0019013643,0.00054674334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00465734,0.0012613396,0.0014882394,0.0015906101,0.0004923088,0.002857871,0.0017758412,0.0017743204,0.0031832324],"category_scores_gemma":[0.030457813,0.0007237415,0.0009662239,0.0023361593,0.002735879,0.0048782732,0.0012781571,0.0024950325,0.0007883376],"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.00045050294,0.0007826675,0.03729085,0.0049723024,0.0004976688,0.00013930931,0.00062020967,0.16616753,0.0021154264,0.119003825,0.0052510817,0.6627086],"study_design_scores_gemma":[0.00012984814,0.0013508658,0.042508118,0.0021151653,0.0004883515,0.00081595936,0.0012784986,0.6285122,0.0050699785,0.25182948,0.06558669,0.00031488543],"about_ca_topic_score_codex":0.002041447,"about_ca_topic_score_gemma":0.0012450123,"teacher_disagreement_score":0.00465734,"about_ca_system_score_codex":0.0016746497,"about_ca_system_score_gemma":0.0012873668,"threshold_uncertainty_score":0.024630666},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12193941,0.0022524646,0.84174013,0.016771082,0.0001987795,0.00033001965,0.00197577,0.0012372877,0.013555088],"genre_scores_gemma":[0.7774211,0.0021573405,0.2051524,0.0025603932,0.00089965685,0.00075396046,0.0035235635,0.00050265226,0.0070288745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98839754,0.0055814767,0.0006563245,0.002323095,0.0022800274,0.00076153886],"domain_scores_gemma":[0.8579969,0.13015832,0.0023851853,0.0062269038,0.0022267257,0.0010059422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011273964,0.0012124834,0.00257301,0.0016070658,0.0015773192,0.006032078,0.0033176234,0.0026783338,0.005112143],"category_scores_gemma":[0.07292976,0.0008485423,0.0016509545,0.0024059755,0.0043458487,0.015362485,0.005424172,0.0062124864,0.00070929684],"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.0015916812,0.00041744963,0.008738392,0.00073772826,0.00026188296,0.0002791276,0.00086246664,0.39522028,0.0019804079,0.42373735,0.0140713835,0.15210184],"study_design_scores_gemma":[0.00006988526,0.000064299034,0.00072190526,0.00004264031,0.00003105736,0.00009900979,0.00009827948,0.62564814,0.00073960435,0.37118655,0.0012708029,0.000027727981],"about_ca_topic_score_codex":0.0060214093,"about_ca_topic_score_gemma":0.0040076105,"teacher_disagreement_score":0.011273964,"about_ca_system_score_codex":0.004993861,"about_ca_system_score_gemma":0.0031609326,"threshold_uncertainty_score":0.059623122},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9604198,0.01618596,0.0022396347,0.010757528,0.00019042152,0.00013487502,0.0005369636,0.00003956811,0.009495174],"genre_scores_gemma":[0.9613071,0.026727378,0.001585643,0.0075937617,0.00016829582,0.00016793766,0.00045716215,0.00006621884,0.0019264296],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.99033725,0.0049174405,0.0010567938,0.0005404059,0.0022576118,0.00089044275],"domain_scores_gemma":[0.9653189,0.020640366,0.006531169,0.0008042003,0.004762816,0.0019424424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0101445215,0.00030770228,0.00066655583,0.0027212466,0.0013796116,0.003552408,0.0006985885,0.0016995756,0.0027129953],"category_scores_gemma":[0.036628857,0.00046197476,0.0006635677,0.0024134654,0.0025762452,0.007821193,0.0030417296,0.002820992,0.0010185664],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015293235,0.00036200878,0.5712671,0.0027057426,0.00015132717,0.001981202,0.21146058,0.00020395822,0.0014305776,0.0049449983,0.020163938,0.1851756],"study_design_scores_gemma":[0.000013796314,0.00046760612,0.35246518,0.0042299135,0.00008464019,0.0073252292,0.5045439,0.0010417233,0.0006456196,0.002437768,0.12663305,0.0001115479],"about_ca_topic_score_codex":0.0026852805,"about_ca_topic_score_gemma":0.003046143,"teacher_disagreement_score":0.0101445215,"about_ca_system_score_codex":0.0009411062,"about_ca_system_score_gemma":0.0016352845,"threshold_uncertainty_score":0.053649962},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017915067,0.9949846,0.002204542,0.0006094696,0.00016892086,0.0000070957703,0.000010057894,0.000017184027,0.001819003],"genre_scores_gemma":[0.0026374736,0.99425995,0.001881602,0.00036712998,0.00034713798,0.000016084212,0.000025349571,0.000008224983,0.0004569902],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994215,0.00013821546,0.00008101267,0.00014846,0.00017720074,0.000033736982],"domain_scores_gemma":[0.99679595,0.002390386,0.00016800096,0.000075192016,0.000472509,0.00009806215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017961604,0.0011545583,0.0014095568,0.0026751643,0.00040747793,0.0021655406,0.0015585924,0.001961206,0.0038969803],"category_scores_gemma":[0.003938644,0.0006143135,0.0007157455,0.0044232197,0.0011327696,0.003142055,0.0010512057,0.002958983,0.0019911646],"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.000076871984,0.00014495711,0.0003916822,0.02293243,0.00012412561,0.0001457375,0.00023026246,0.0036418312,0.0005828555,0.0431855,0.015768971,0.91277486],"study_design_scores_gemma":[0.00003041949,0.0002574795,0.0011063331,0.015094548,0.00019056148,0.0009705718,0.00029368172,0.0025591739,0.0006364376,0.03512603,0.94364387,0.0000908437],"about_ca_topic_score_codex":0.0021053215,"about_ca_topic_score_gemma":0.0018657171,"teacher_disagreement_score":0.0038969803,"about_ca_system_score_codex":0.0013300007,"about_ca_system_score_gemma":0.002184543,"threshold_uncertainty_score":0.013036728},"labels":[],"label_agreement":null},{"id":"W3135927772","doi":"10.1613/jair.1.12283","title":"Computational Complexity of Computing Symmetries in Finite-Domain Planning","year":2021,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Vetenskapsrådet; Israel Academy of Sciences and Humanities","keywords":"Graph automorphism; Graph isomorphism; Automorphism; Time complexity; Homogeneous space; Mathematics; Isomorphism (crystallography); PSPACE; Discrete mathematics; Pruning; Graph; Automorphism group; Computational complexity theory; Combinatorics; Theoretical computer science; Computer science; Algorithm; Voltage graph; Line graph","score_opus":0.2931864096118457,"score_gpt":0.43983974178309837,"score_spread":0.14665333217125265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135927772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47495225,0.0007419289,0.49493852,0.006535955,0.000107610445,0.000377483,0.001488002,0.002364367,0.018493872],"genre_scores_gemma":[0.83576274,0.00032866356,0.15935802,0.0002894706,0.00007499348,0.00020511393,0.0014408829,0.0002361811,0.0023038324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974119,0.0011349167,0.000135726,0.0004929809,0.0004502988,0.00037413748],"domain_scores_gemma":[0.97369224,0.023417026,0.0007733536,0.0014871993,0.00033578137,0.00029432075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002729788,0.000640947,0.0010620609,0.00067522156,0.0010868588,0.002600672,0.0021411006,0.00135988,0.0059299283],"category_scores_gemma":[0.01639002,0.0006766275,0.0018896024,0.0012548275,0.0024915398,0.0053754817,0.00206712,0.0026899623,0.00046537095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075293594,0.00031805926,0.005499708,0.0007899096,0.0002099021,0.0003601271,0.00064241805,0.7255532,0.005024202,0.15166764,0.00615074,0.103031255],"study_design_scores_gemma":[0.00009650977,0.00005254647,0.00067403953,0.00002569546,0.00004153946,0.00006335178,0.00015554875,0.7342358,0.0021250597,0.26145053,0.0010626742,0.000016649135],"about_ca_topic_score_codex":0.009087777,"about_ca_topic_score_gemma":0.01214626,"teacher_disagreement_score":0.009087777,"about_ca_system_score_codex":0.0024852857,"about_ca_system_score_gemma":0.0035506175,"threshold_uncertainty_score":0.019837558},"labels":[],"label_agreement":null},{"id":"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010303635,0.12335644,0.83736426,0.012583675,0.0017451718,0.0002745742,0.00018661993,0.0014149994,0.022043804],"genre_scores_gemma":[0.04158784,0.12780799,0.7991263,0.0077922805,0.0057705706,0.0016817976,0.0008354019,0.0014697626,0.0139281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9949768,0.0023065924,0.0005306732,0.00090776524,0.0010645633,0.00021356545],"domain_scores_gemma":[0.99333006,0.0048831785,0.00023451082,0.00060742383,0.0007249819,0.00021992406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008202052,0.0015189709,0.0015912373,0.005153244,0.0013648416,0.00888267,0.004828205,0.005335535,0.0068444167],"category_scores_gemma":[0.009718705,0.0020170559,0.001681662,0.003801266,0.007246613,0.021604666,0.0061055054,0.008615621,0.0046448056],"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.00012797925,0.00018503795,0.0004001303,0.0033385365,0.00008577416,0.00044834908,0.0053986716,0.0046779294,0.0035695634,0.55025667,0.031970397,0.39954093],"study_design_scores_gemma":[0.000019209476,0.00010648696,0.0002825656,0.0022078988,0.0000272516,0.0005361754,0.0009357925,0.018197995,0.0019941386,0.3680974,0.6074804,0.00011472017],"about_ca_topic_score_codex":0.0019256163,"about_ca_topic_score_gemma":0.0013110053,"teacher_disagreement_score":0.00888267,"about_ca_system_score_codex":0.00273982,"about_ca_system_score_gemma":0.0019121926,"threshold_uncertainty_score":0.0433771},"labels":[],"label_agreement":null},{"id":"W3174309074","doi":"10.1613/jair.1.13768","title":"Classical Planning in Deep Latent Space","year":2022,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Bottleneck; Artificial intelligence; Domain (mathematical analysis); Representation (politics); Plan (archaeology); Automated planning and scheduling; Set (abstract data type); Space (punctuation); Rotation formalisms in three dimensions; Action (physics); Machine learning; Theoretical computer science; Mathematics; Programming language","score_opus":0.1989048434107749,"score_gpt":0.41514548535276874,"score_spread":0.21624064194199383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174309074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04483442,0.00089697505,0.9403488,0.00088923716,0.000050371797,0.00008798261,0.00067058194,0.0051511377,0.00707059],"genre_scores_gemma":[0.7041638,0.0006280914,0.28726536,0.0003554156,0.000042526623,0.0002252679,0.001630412,0.00034265788,0.0053465217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995203,0.00015892817,0.000021693291,0.00013405373,0.00010008183,0.00006496078],"domain_scores_gemma":[0.99873286,0.0008669683,0.00007946213,0.00016189324,0.00009458003,0.00006432886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082353357,0.0008544319,0.0007524069,0.00058657076,0.0004530831,0.0011760965,0.0012564821,0.001056002,0.0045467373],"category_scores_gemma":[0.0029327478,0.0005205376,0.0007418416,0.0007492372,0.0017278354,0.0025000337,0.0017059912,0.0020985543,0.00057296176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013958973,0.000059334863,0.0006735415,0.00016435272,0.00004105512,0.00006981807,0.00009225253,0.86672014,0.0010223078,0.057441853,0.0027776028,0.07079807],"study_design_scores_gemma":[0.000013967183,0.000014618999,0.00006294809,0.000009197568,0.000004074019,0.0000074501654,0.000008845401,0.9496291,0.00054165744,0.049008675,0.00069551053,0.0000038981966],"about_ca_topic_score_codex":0.018076118,"about_ca_topic_score_gemma":0.027362915,"teacher_disagreement_score":0.018076118,"about_ca_system_score_codex":0.0022402317,"about_ca_system_score_gemma":0.0021645813,"threshold_uncertainty_score":0.03594184},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0602324,0.00035465354,0.9327376,0.0005099234,0.00015309946,0.00019333884,0.0002809361,0.0005925711,0.004945485],"genre_scores_gemma":[0.91730154,0.00023717139,0.07796504,0.0001307107,0.0001332778,0.00014330073,0.00024513912,0.00011175076,0.003732011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962942,0.0012921419,0.00022463012,0.0007189418,0.0009742731,0.00049586146],"domain_scores_gemma":[0.9825822,0.00988666,0.001837657,0.0036231799,0.0012443664,0.0008258486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064981435,0.0010976718,0.0014644545,0.00047879608,0.0008369026,0.0018193471,0.0020333622,0.0011505986,0.0042877477],"category_scores_gemma":[0.027873183,0.0005929874,0.0006727644,0.0008281711,0.0020377308,0.003046023,0.0017820827,0.0024843651,0.0006142843],"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.00068165537,0.00011988533,0.0014977346,0.000120771,0.000053306358,0.00019814064,0.00022328897,0.8304723,0.0027642767,0.122868516,0.0024262362,0.038573954],"study_design_scores_gemma":[0.000033788914,0.00007149438,0.00013342382,0.000008723364,0.000008507223,0.000029599516,0.000015621476,0.9553723,0.00087355607,0.0424116,0.0010292928,0.000012108974],"about_ca_topic_score_codex":0.0029244106,"about_ca_topic_score_gemma":0.0019167245,"teacher_disagreement_score":0.0064981435,"about_ca_system_score_codex":0.001588281,"about_ca_system_score_gemma":0.0030981852,"threshold_uncertainty_score":0.034365892},"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":"incentives","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"incentives","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96247923,0.0067258673,0.0009237199,0.01549402,0.0001263256,0.00010169189,0.00036399555,0.000011690914,0.013773505],"genre_scores_gemma":[0.99363315,0.0029015734,0.00027877386,0.002556028,0.00008312794,0.00008322773,0.00013391122,0.000013715148,0.000316552],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.90304166,0.06732813,0.009091209,0.003870042,0.01351499,0.0031538864],"domain_scores_gemma":[0.40630645,0.3577053,0.15921001,0.019265987,0.039714392,0.017797885],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.069734864,0.00020768201,0.0006843673,0.004700627,0.0032822527,0.006986076,0.0012112522,0.002124597,0.0033047632],"category_scores_gemma":[0.28028363,0.0007257115,0.00046001576,0.006986526,0.0057075927,0.0074012903,0.0042401915,0.0028078437,0.000683124],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002593786,0.00023773877,0.8879679,0.00085277134,0.00019567444,0.00028362064,0.0645217,0.00011395231,0.00014548004,0.004476618,0.006970118,0.03397502],"study_design_scores_gemma":[0.0001457528,0.00036066532,0.7535929,0.0036112033,0.00017797513,0.0007647392,0.19517422,0.00096896023,0.0003669922,0.0056835636,0.039018843,0.00013415192],"about_ca_topic_score_codex":0.006621029,"about_ca_topic_score_gemma":0.0068206787,"teacher_disagreement_score":0.9302651,"about_ca_system_score_codex":0.0025994861,"about_ca_system_score_gemma":0.00572749,"threshold_uncertainty_score":0.3687976},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018823637,0.00051168824,0.9764914,0.0005341831,0.00007576031,0.00015091716,0.000054582626,0.00074769603,0.0026101489],"genre_scores_gemma":[0.73883665,0.00029518967,0.25437722,0.0006875502,0.000101722064,0.0003318769,0.0002175454,0.00012956267,0.005022632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831235,0.0007972575,0.00007962548,0.00034624102,0.00027480948,0.00018980079],"domain_scores_gemma":[0.99219066,0.005717582,0.0004724927,0.00040631148,0.00079477456,0.00041811398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004377762,0.001350266,0.0021309867,0.0006381302,0.00059779553,0.0010418752,0.0026305402,0.002106128,0.004974888],"category_scores_gemma":[0.012086235,0.000575283,0.00056389516,0.00069764006,0.0014126766,0.0015368382,0.0016925917,0.0025893336,0.00076517666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024671902,0.00020851631,0.0017573845,0.00013278521,0.00006988092,0.00006862577,0.00009783855,0.8564205,0.0004480262,0.018699136,0.0025305515,0.11932002],"study_design_scores_gemma":[0.000029785155,0.000040485407,0.000047270663,0.00000701002,0.0000048790102,0.000009918282,0.0000056722765,0.9946773,0.00016010793,0.0046129557,0.00040090978,0.000003777016],"about_ca_topic_score_codex":0.0044673746,"about_ca_topic_score_gemma":0.0044348156,"teacher_disagreement_score":0.004974888,"about_ca_system_score_codex":0.0013072098,"about_ca_system_score_gemma":0.0022696014,"threshold_uncertainty_score":0.023152113},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99225134,0.00017701075,0.003409862,0.00028759448,0.000021393671,0.00017454487,0.0000916944,0.000084436106,0.0035020548],"genre_scores_gemma":[0.9911582,0.00013802899,0.006147746,0.00028043534,0.000020233652,0.00019475343,0.00023564517,0.000070239534,0.0017548049],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9921239,0.005496526,0.00038137953,0.0006281817,0.0010561539,0.0003138308],"domain_scores_gemma":[0.83129936,0.14941347,0.0063887723,0.007020077,0.003897098,0.0019812596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010654989,0.0005976395,0.00057268277,0.0010887878,0.0012085198,0.0020175627,0.0012479168,0.0019135381,0.0070226905],"category_scores_gemma":[0.12730089,0.00042453114,0.00041683568,0.00070466276,0.0018881839,0.0038319975,0.0012070179,0.0029587215,0.0014422423],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0050139506,0.029799232,0.42427194,0.0032809994,0.0004207155,0.0029278807,0.13811141,0.014270762,0.011607259,0.021447714,0.022929879,0.3259183],"study_design_scores_gemma":[0.0021357748,0.016512282,0.46541193,0.001639909,0.00042416804,0.0034148858,0.10631859,0.24847361,0.01491369,0.04631735,0.09370417,0.00073356373],"about_ca_topic_score_codex":0.0027789976,"about_ca_topic_score_gemma":0.0039164955,"teacher_disagreement_score":0.010654989,"about_ca_system_score_codex":0.0007307234,"about_ca_system_score_gemma":0.0005822573,"threshold_uncertainty_score":0.056349635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040511746,0.0013925784,0.9037042,0.0037000328,0.0001160566,0.00012627462,0.00015785368,0.0003817304,0.049909484],"genre_scores_gemma":[0.84309417,0.0006996908,0.14623782,0.0005199457,0.00018067751,0.0002746121,0.00019381577,0.00008111389,0.0087181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973139,0.0010161148,0.00014810216,0.0004766872,0.0007635269,0.00028167185],"domain_scores_gemma":[0.99672323,0.0020422242,0.00022772589,0.0005166714,0.0002931625,0.00019698807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031422474,0.00059840153,0.0007223003,0.0011163041,0.0016405337,0.0033485976,0.0012531423,0.0016687679,0.0021326593],"category_scores_gemma":[0.0052324417,0.00054661214,0.001433066,0.00077675475,0.005437065,0.0065813456,0.0038929565,0.0028868401,0.00034890234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074029026,0.000010692201,0.00009706329,0.000024520763,0.000010044182,0.00007882465,0.00025998708,0.007028939,0.00023209471,0.98925436,0.00029117195,0.0027049065],"study_design_scores_gemma":[0.000010711015,0.000011958588,0.000086231914,0.0000123201,0.000012881344,0.000045683053,0.000069447604,0.05558309,0.00044918866,0.9394766,0.0042298,0.000012003791],"about_ca_topic_score_codex":0.0034059144,"about_ca_topic_score_gemma":0.0027074006,"teacher_disagreement_score":0.0034059144,"about_ca_system_score_codex":0.002891233,"about_ca_system_score_gemma":0.0015606916,"threshold_uncertainty_score":0.020977437},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120427355,0.00090757705,0.8718731,0.0006017358,0.00014217313,0.00013858914,0.00039872222,0.0016055196,0.0039053378],"genre_scores_gemma":[0.89034474,0.00037490606,0.105789214,0.00024275765,0.00012678483,0.00010592763,0.00045983127,0.00013517015,0.00242072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742717,0.00073965115,0.00011991094,0.000637624,0.000679904,0.00039576256],"domain_scores_gemma":[0.9871122,0.009262458,0.0010846616,0.0016584364,0.0005962695,0.00028587176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002388201,0.0010787213,0.0018473513,0.00041886256,0.00069097924,0.0017856446,0.002037763,0.0016715808,0.0025230006],"category_scores_gemma":[0.014609092,0.00074681605,0.0005031109,0.0013817409,0.0014550276,0.0038042555,0.0015938818,0.0020030225,0.0005729033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063126703,0.0001479049,0.0012228623,0.00011697585,0.00003415342,0.000102348284,0.00007505305,0.92463464,0.001912883,0.017244559,0.0020974146,0.05177993],"study_design_scores_gemma":[0.000013102731,0.000047699716,0.00014624439,0.000006608629,0.000004947308,0.000032457418,0.000012038681,0.98676676,0.0011351826,0.011481372,0.00034800664,0.0000055049013],"about_ca_topic_score_codex":0.0026715,"about_ca_topic_score_gemma":0.0017188429,"teacher_disagreement_score":0.0026715,"about_ca_system_score_codex":0.001346867,"about_ca_system_score_gemma":0.0014599374,"threshold_uncertainty_score":0.012630105},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042317872,0.00014094001,0.9982639,0.00009130597,0.000023188455,0.00003613603,0.00004029451,0.00029519974,0.0006858228],"genre_scores_gemma":[0.070771284,0.0003774093,0.9245781,0.00018814372,0.000100404104,0.00042493385,0.00047986192,0.0002404319,0.002839466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970151,0.0009708019,0.00020381354,0.0005938076,0.0009664382,0.00025002498],"domain_scores_gemma":[0.99776363,0.000690394,0.00019984797,0.0006409019,0.00058961567,0.00011567725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003440614,0.0008921008,0.0016214472,0.0028726535,0.0011537195,0.003384798,0.004978371,0.001994351,0.0072918455],"category_scores_gemma":[0.008465264,0.00058373535,0.0018148412,0.0030747894,0.0018825147,0.0038163392,0.004257129,0.0031871642,0.004350886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007884762,0.00013796047,0.0009199058,0.00037923467,0.00016018919,0.00015347803,0.00032899296,0.12628159,0.00477062,0.4268898,0.010995149,0.42890427],"study_design_scores_gemma":[0.000010623329,0.0000661333,0.00047991402,0.0000626039,0.00002576615,0.00025173553,0.000097681186,0.5958493,0.0018569375,0.38209525,0.019154087,0.00004996352],"about_ca_topic_score_codex":0.0028023112,"about_ca_topic_score_gemma":0.002404207,"teacher_disagreement_score":0.0072918455,"about_ca_system_score_codex":0.0014974973,"about_ca_system_score_gemma":0.0015522194,"threshold_uncertainty_score":0.024393678},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074383994,0.0008817066,0.9800348,0.000933059,0.0000714477,0.00029634446,0.00057488156,0.00029755596,0.009471743],"genre_scores_gemma":[0.067248076,0.001673707,0.9269895,0.00023339048,0.000094874595,0.00040011446,0.00081033964,0.00013306778,0.002416919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981281,0.00090768107,0.00010620549,0.0003018878,0.00040610504,0.00014999101],"domain_scores_gemma":[0.9967056,0.0025848318,0.00018030283,0.00019139289,0.00025587835,0.000082045255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020680546,0.0013596591,0.0006500705,0.0010956571,0.0007843994,0.0021432003,0.002174181,0.001137092,0.007584602],"category_scores_gemma":[0.0061674546,0.00062960706,0.001314997,0.00354915,0.00086845836,0.0021601769,0.0012049983,0.0026330235,0.0007724598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015666593,0.00022629775,0.0004184381,0.0010056033,0.000117301344,0.00019341143,0.00022852374,0.6432159,0.002457579,0.17913984,0.007798849,0.16504163],"study_design_scores_gemma":[0.000096952834,0.000102761056,0.00023178793,0.00013407016,0.000052979303,0.00017340887,0.00016886943,0.85612184,0.0028868685,0.11567772,0.02432509,0.000027721666],"about_ca_topic_score_codex":0.0069997944,"about_ca_topic_score_gemma":0.007905425,"teacher_disagreement_score":0.007584602,"about_ca_system_score_codex":0.0016000774,"about_ca_system_score_gemma":0.0033076701,"threshold_uncertainty_score":0.025373042},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00501192,0.00019243413,0.99230886,0.000089558576,0.000047663827,0.000029546693,0.00010743206,0.00040001064,0.0018125627],"genre_scores_gemma":[0.22307032,0.00054554886,0.772406,0.00012722971,0.00008886962,0.00032083705,0.000568601,0.00024948263,0.0026232009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828714,0.0005166724,0.0001226093,0.00045697368,0.0004831594,0.00013340743],"domain_scores_gemma":[0.9894188,0.005602315,0.0008617925,0.0020085506,0.0017694102,0.00033909973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018442736,0.0005828086,0.0008944085,0.0023246815,0.0011438897,0.0020449054,0.002038947,0.00090607314,0.0037578244],"category_scores_gemma":[0.023989573,0.0004824729,0.0007331923,0.0035644406,0.0016803098,0.0036624903,0.002474773,0.0018861747,0.0008491506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013508832,0.000045451678,0.0024075864,0.00020461869,0.00005252382,0.00010141925,0.00020982977,0.37812963,0.0022174653,0.46160975,0.005462361,0.14942428],"study_design_scores_gemma":[0.000014093119,0.00003018397,0.00024976933,0.000025751939,0.000010557634,0.00007440252,0.00002918909,0.8003203,0.00082718197,0.19382098,0.0045791664,0.000018382416],"about_ca_topic_score_codex":0.008857652,"about_ca_topic_score_gemma":0.006271236,"teacher_disagreement_score":0.008857652,"about_ca_system_score_codex":0.0015137497,"about_ca_system_score_gemma":0.0023685687,"threshold_uncertainty_score":0.01761216},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045972276,0.00007607558,0.99440765,0.00011103896,0.000014325825,0.000023247321,0.000044965782,0.00018951407,0.0005359949],"genre_scores_gemma":[0.6688945,0.00044802148,0.32402563,0.00021661766,0.00010388086,0.00042651474,0.0004526389,0.0001605632,0.0052716006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887115,0.00047521765,0.00007158433,0.00019404027,0.00027357857,0.000114346614],"domain_scores_gemma":[0.99759007,0.0012047291,0.00037398507,0.00035474022,0.0003543945,0.00012211471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018072934,0.0009563294,0.0012795092,0.000571706,0.00026487853,0.0013941176,0.0011732717,0.001272023,0.0035402353],"category_scores_gemma":[0.0073978268,0.0003510018,0.0006306767,0.00052483194,0.0011565568,0.0018235822,0.0012145616,0.0020349757,0.0007472243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007883414,0.000056396348,0.00023693829,0.000096255535,0.00002245873,0.00005208532,0.000049393784,0.8987291,0.0025123435,0.06353839,0.00073504564,0.03389273],"study_design_scores_gemma":[0.0000044398707,0.000022217313,0.00002580938,0.0000032633814,0.0000015790648,0.0000054098987,0.0000021661656,0.9864956,0.0003082547,0.012949492,0.00017787747,0.0000038743046],"about_ca_topic_score_codex":0.0019442267,"about_ca_topic_score_gemma":0.0013384726,"teacher_disagreement_score":0.0035402353,"about_ca_system_score_codex":0.00095477625,"about_ca_system_score_gemma":0.0013255046,"threshold_uncertainty_score":0.011843324},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049079947,0.00019699757,0.9461004,0.00020576136,0.000027606968,0.00013006137,0.000080423306,0.0003813126,0.0037975027],"genre_scores_gemma":[0.69310987,0.00023413813,0.3041637,0.000115242154,0.000019146035,0.00028178204,0.0001905166,0.000068767135,0.0018168542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841166,0.00065077853,0.00009965755,0.00019101548,0.0004588792,0.00018812403],"domain_scores_gemma":[0.9968252,0.0019550242,0.00034791982,0.00043009958,0.0002044923,0.00023718423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021990174,0.00085838477,0.0009301915,0.00073082506,0.0005689421,0.0014552522,0.0013218662,0.0007252103,0.0024935056],"category_scores_gemma":[0.0071714544,0.00039538534,0.0009708248,0.00081202143,0.0016851496,0.0027416055,0.001979093,0.0024265538,0.00025461818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017836592,0.0001010253,0.00086183636,0.00008782648,0.00003649415,0.0000640289,0.00021872512,0.8355477,0.0017795857,0.12014717,0.00059472694,0.040382467],"study_design_scores_gemma":[0.000031086318,0.0000611204,0.00013023222,0.000015604164,0.000011271783,0.000019466535,0.000026780812,0.9230773,0.0009215691,0.07483321,0.00086332567,0.000009069699],"about_ca_topic_score_codex":0.004192201,"about_ca_topic_score_gemma":0.0046876767,"teacher_disagreement_score":0.004192201,"about_ca_system_score_codex":0.0020397506,"about_ca_system_score_gemma":0.0025102547,"threshold_uncertainty_score":0.014799476},"labels":[],"label_agreement":null},{"id":"W4313395447","doi":"10.1613/jair.1.14034","title":"The LM-Cut Heuristic Family for Optimal Numeric Planning with Simple Conditions","year":2022,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Agencia Nacional de Investigación y Desarrollo; Natural Sciences and Engineering Research Council of Canada; Israel Academy of Sciences and Humanities","keywords":"Heuristics; Heuristic; Simple (philosophy); Class (philosophy); Operator (biology); Mathematical optimization; Mathematics; Computer science; State (computer science); Algorithm; Artificial intelligence","score_opus":0.16950680794732287,"score_gpt":0.4241227748721553,"score_spread":0.2546159669248324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313395447","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008051309,0.0006584417,0.9779708,0.00025512747,0.000049469432,0.0001823615,0.00023730227,0.00081792846,0.011777343],"genre_scores_gemma":[0.12404715,0.00038809326,0.8714659,0.00025310708,0.000036633068,0.0004476889,0.0005516691,0.00028764558,0.0025221447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821365,0.0006794166,0.00011169613,0.00027815977,0.0005691901,0.00014791971],"domain_scores_gemma":[0.9970784,0.002032489,0.00021425201,0.0003645234,0.00020962366,0.00010060472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021196937,0.0011325943,0.00083646725,0.0012660066,0.0007131987,0.0013617818,0.0015947691,0.0010353388,0.0070839277],"category_scores_gemma":[0.008119631,0.0005881641,0.0010933273,0.0014892699,0.0016444048,0.0018062452,0.0013344074,0.0025284041,0.0009917261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032783597,0.00014817336,0.0009654767,0.00088817166,0.000078886726,0.00019690192,0.00026616934,0.4452037,0.0051566567,0.21799372,0.012067724,0.3167066],"study_design_scores_gemma":[0.000078921636,0.0001867463,0.0003679135,0.00019381302,0.000039986877,0.0002380338,0.00007962388,0.76448053,0.005015055,0.21086419,0.018411657,0.000043456956],"about_ca_topic_score_codex":0.002200673,"about_ca_topic_score_gemma":0.0035417494,"teacher_disagreement_score":0.0070839277,"about_ca_system_score_codex":0.0019489977,"about_ca_system_score_gemma":0.0024903575,"threshold_uncertainty_score":0.023698092},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026665404,0.000091942304,0.97110176,0.00021219953,0.000019933492,0.000077193086,0.00004024864,0.00042729816,0.0013640393],"genre_scores_gemma":[0.8793874,0.00010318866,0.11859851,0.00018723976,0.000036865615,0.00019903341,0.00013409181,0.000117632815,0.0012360499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988194,0.00043074507,0.00007712655,0.0002884094,0.00022592525,0.00015832315],"domain_scores_gemma":[0.9845781,0.012079989,0.0010659931,0.0013223892,0.0005153754,0.00043826696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036541633,0.0010889128,0.0016060722,0.0005058318,0.00048757446,0.0010144482,0.0015122066,0.0013156427,0.002520514],"category_scores_gemma":[0.018113796,0.0007169983,0.0006300849,0.00047161605,0.0021672929,0.0023414341,0.0018981466,0.003248899,0.00039274522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014581661,0.000119279975,0.0015529818,0.000060641687,0.000029296874,0.000070271504,0.000067467656,0.9516208,0.0009576736,0.020273777,0.00046393438,0.024637902],"study_design_scores_gemma":[0.000013771538,0.000029792713,0.00007534039,0.0000048291085,0.0000026081736,0.000008989831,0.0000040038453,0.9908174,0.00029890315,0.008624328,0.00011686321,0.0000032378923],"about_ca_topic_score_codex":0.0035553055,"about_ca_topic_score_gemma":0.0032931813,"teacher_disagreement_score":0.0036541633,"about_ca_system_score_codex":0.0011636984,"about_ca_system_score_gemma":0.0025856872,"threshold_uncertainty_score":0.019325316},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8465572,0.0017894603,0.11406737,0.0025671807,0.00009175559,0.00073400163,0.00026086788,0.00063965895,0.03329261],"genre_scores_gemma":[0.97643,0.00028052193,0.022342976,0.00019692151,0.000022019602,0.00011377277,0.00011579291,0.000069360314,0.0004285987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97315174,0.019023217,0.0011926229,0.0023549136,0.0037275036,0.0005500514],"domain_scores_gemma":[0.6783847,0.2810946,0.009728445,0.018935397,0.007948028,0.0039087213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.051521476,0.0007838203,0.00057118415,0.0023316615,0.0012348066,0.006615697,0.001196363,0.002039442,0.003152858],"category_scores_gemma":[0.27822107,0.00051121064,0.00079317257,0.0012414574,0.0066346577,0.014223977,0.0069035273,0.002331261,0.0004400025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007466722,0.0012802812,0.23837689,0.0029582123,0.0009939843,0.0006033153,0.07660978,0.071756594,0.017736513,0.07008133,0.00521477,0.50692165],"study_design_scores_gemma":[0.0006285766,0.007821455,0.3218131,0.0023533301,0.0009689876,0.0020523742,0.06102499,0.31726784,0.027100172,0.23263682,0.025293138,0.0010392835],"about_ca_topic_score_codex":0.0026047556,"about_ca_topic_score_gemma":0.0025207838,"teacher_disagreement_score":0.051521476,"about_ca_system_score_codex":0.0023050988,"about_ca_system_score_gemma":0.0009678712,"threshold_uncertainty_score":0.27247488},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032601073,0.00044039896,0.95771486,0.00017304024,0.00004189783,0.00013493003,0.00011736135,0.0029884023,0.005788141],"genre_scores_gemma":[0.34520823,0.0002525775,0.6488467,0.00028306525,0.000021671318,0.00035935736,0.00043954828,0.00075208285,0.0038367363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948406,0.00012150888,0.00003269644,0.00009722722,0.000191421,0.000073077084],"domain_scores_gemma":[0.9990062,0.00060478726,0.00006710285,0.00014758114,0.00014286088,0.000031541484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061360025,0.0012338574,0.00088902604,0.0011834528,0.00049661833,0.0009818607,0.0011909452,0.0011097408,0.0043013687],"category_scores_gemma":[0.002520327,0.00058676564,0.0008889972,0.0008367196,0.0007649879,0.0012209115,0.0012154197,0.0011104859,0.00076905766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020488116,0.00016745881,0.0010291826,0.00025493154,0.0000795517,0.00013078836,0.00012498612,0.67574185,0.014099319,0.023484703,0.0039319703,0.28075033],"study_design_scores_gemma":[0.000028795112,0.00006372988,0.00007902101,0.000015089956,0.00002351148,0.000028864615,0.000018070494,0.98528755,0.0031425238,0.0098305885,0.0014729591,0.000009242136],"about_ca_topic_score_codex":0.0029962754,"about_ca_topic_score_gemma":0.004430018,"teacher_disagreement_score":0.0043013687,"about_ca_system_score_codex":0.00093779335,"about_ca_system_score_gemma":0.001800865,"threshold_uncertainty_score":0.014389515},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010245262,0.00010320621,0.9972971,0.00004884032,0.000027969496,0.00003453528,0.000033928405,0.00038435383,0.0010456217],"genre_scores_gemma":[0.048846792,0.00019850394,0.9477146,0.00011541578,0.00003890458,0.00021640872,0.00017963634,0.00060576375,0.0020839798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970805,0.0012486401,0.0001724319,0.00041854606,0.00085634727,0.00022343094],"domain_scores_gemma":[0.99007833,0.0071829003,0.00042792776,0.0010101214,0.0010509723,0.0002497097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005379167,0.0018845093,0.0013172759,0.0024607927,0.00085403834,0.002301009,0.0027981608,0.0015753531,0.01212251],"category_scores_gemma":[0.021373574,0.0014020897,0.002161492,0.002148296,0.0019791874,0.0038704295,0.0030618238,0.004455102,0.0023919188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025301246,0.00012850069,0.0007085537,0.00041638632,0.00011692982,0.00010535096,0.000297581,0.5295582,0.003630491,0.20770681,0.005975347,0.25110286],"study_design_scores_gemma":[0.00007365907,0.00003702613,0.00005291613,0.0000745808,0.000027399248,0.000034326295,0.000025352128,0.9029583,0.0029896873,0.08577356,0.007928553,0.000024612535],"about_ca_topic_score_codex":0.0039675995,"about_ca_topic_score_gemma":0.004645551,"teacher_disagreement_score":0.01212251,"about_ca_system_score_codex":0.0020921773,"about_ca_system_score_gemma":0.0027379743,"threshold_uncertainty_score":0.040553868},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062328926,0.8435751,0.10949615,0.011617688,0.00069098925,0.00013049829,0.00010276969,0.00040662562,0.027747257],"genre_scores_gemma":[0.11102748,0.82676953,0.049850687,0.0026183962,0.0020948476,0.00022293926,0.00026544568,0.00016190972,0.0069887354],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983942,0.0004878294,0.00016953543,0.00030530815,0.0005459243,0.00009718847],"domain_scores_gemma":[0.99308527,0.0054514306,0.0002390788,0.00024324424,0.0008108486,0.00017007311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003583313,0.0008258613,0.001137092,0.0015226477,0.00044609228,0.003093082,0.001996574,0.0020841695,0.0033539825],"category_scores_gemma":[0.0057972586,0.00063499605,0.0007480102,0.0023506607,0.0015215955,0.0043342914,0.0013768047,0.0025718107,0.0013412328],"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.00008981721,0.00022320596,0.0019191792,0.0059404746,0.0000780673,0.00011487162,0.00038322428,0.019505791,0.00079454324,0.103202075,0.010556432,0.8571924],"study_design_scores_gemma":[0.000060303126,0.00084019866,0.0030378702,0.006986271,0.00015458874,0.0008980132,0.0014695813,0.11546595,0.0025776206,0.17380705,0.694502,0.00020061934],"about_ca_topic_score_codex":0.0026327155,"about_ca_topic_score_gemma":0.001618935,"teacher_disagreement_score":0.003583313,"about_ca_system_score_codex":0.001644091,"about_ca_system_score_gemma":0.0019188283,"threshold_uncertainty_score":0.018950582},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12390661,0.00021822866,0.8723093,0.00039768775,0.000050799208,0.00006188005,0.000033255477,0.0008486332,0.0021735225],"genre_scores_gemma":[0.91966665,0.00007904239,0.07873042,0.000108757435,0.000017137372,0.0000632394,0.000031947347,0.000055740176,0.0012470962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861395,0.00072302367,0.00006754394,0.00020180865,0.00027918495,0.000114495124],"domain_scores_gemma":[0.9897579,0.007634704,0.0008915383,0.00090610626,0.00050192693,0.00030780313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032014453,0.0008164245,0.0008886348,0.00044918054,0.00047606777,0.0012190517,0.0017720102,0.0009733555,0.0014435056],"category_scores_gemma":[0.0145362755,0.0006988541,0.0004763179,0.00031553736,0.001533966,0.0023499506,0.0021117688,0.0020791139,0.00018298687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033005717,0.00009556548,0.002306578,0.0000820345,0.00007522167,0.000158998,0.00037655595,0.9217743,0.0026239464,0.023273947,0.00053009717,0.048372824],"study_design_scores_gemma":[0.000016558397,0.000050311988,0.00007159872,0.000004725849,0.0000065701956,0.000015998916,0.000012472346,0.99108243,0.001053825,0.0074630817,0.00021520408,0.000007153869],"about_ca_topic_score_codex":0.003296653,"about_ca_topic_score_gemma":0.0033843126,"teacher_disagreement_score":0.003296653,"about_ca_system_score_codex":0.00089228863,"about_ca_system_score_gemma":0.0013935169,"threshold_uncertainty_score":0.016931057},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27905688,0.4891991,0.009489594,0.06726247,0.0011756688,0.00015775191,0.009699225,0.00030531947,0.14365408],"genre_scores_gemma":[0.67470205,0.3023129,0.011096184,0.0025570325,0.00078269735,0.00015074712,0.003677012,0.00015981658,0.004561593],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9942941,0.0017560961,0.00073022785,0.0010983455,0.0014512001,0.0006700571],"domain_scores_gemma":[0.9548349,0.026607895,0.006359682,0.0024478629,0.008459867,0.0012898649],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.008837338,0.0004168675,0.000600841,0.022562528,0.0024211013,0.01031688,0.0012132325,0.0010207604,0.008444241],"category_scores_gemma":[0.031241225,0.00048830913,0.00049950747,0.039031245,0.0033160627,0.011777821,0.0023817115,0.0011385645,0.0016960099],"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.000210863,0.00009652704,0.052218754,0.010096397,0.0001558895,0.0008242615,0.012789957,0.0009977276,0.003478002,0.087122165,0.027074063,0.80493546],"study_design_scores_gemma":[0.000025490928,0.00011042742,0.10484606,0.015854854,0.00019860128,0.0018575995,0.04095074,0.0017047747,0.0032182036,0.029698424,0.80142313,0.00011173709],"about_ca_topic_score_codex":0.012391928,"about_ca_topic_score_gemma":0.01077204,"teacher_disagreement_score":0.9774375,"about_ca_system_score_codex":0.0041975155,"about_ca_system_score_gemma":0.010394032,"threshold_uncertainty_score":0.046736896},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02764164,0.00028777443,0.9694007,0.00032249655,0.000040304323,0.00007716244,0.0002978427,0.0007927769,0.0011393157],"genre_scores_gemma":[0.80858517,0.00025842292,0.18678086,0.00026325334,0.00005547109,0.00018732638,0.000818779,0.00019882285,0.002851879],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681467,0.0011626218,0.00026235325,0.00060229975,0.0009571322,0.00020090073],"domain_scores_gemma":[0.99123925,0.003158966,0.00066063163,0.0040550726,0.0006661967,0.00021979355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036086058,0.0005347777,0.00082837784,0.00053215295,0.0004897549,0.0015090369,0.0017332293,0.0012203889,0.0018562212],"category_scores_gemma":[0.020346506,0.00029591366,0.0006563206,0.0009216383,0.0014356388,0.0038296063,0.0034052734,0.002332266,0.00070727116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010372415,0.0002611368,0.0046237707,0.0003082309,0.00011461175,0.0003863557,0.00042235208,0.36123592,0.0178741,0.18153031,0.0062698475,0.42593616],"study_design_scores_gemma":[0.000034749602,0.00013117028,0.00047149416,0.000025160372,0.000015384321,0.00032880425,0.000043609925,0.9039662,0.012550134,0.079281196,0.0031211032,0.000030988278],"about_ca_topic_score_codex":0.0006195156,"about_ca_topic_score_gemma":0.0006440317,"teacher_disagreement_score":0.0036086058,"about_ca_system_score_codex":0.0012371943,"about_ca_system_score_gemma":0.0014399154,"threshold_uncertainty_score":0.019084334},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51312244,0.030633083,0.39471453,0.01596719,0.0017184159,0.0012763097,0.009720131,0.007247591,0.025600307],"genre_scores_gemma":[0.899339,0.003534572,0.08482188,0.00092937384,0.0010851311,0.0003628375,0.006872129,0.0005274373,0.0025275303],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9726078,0.014207584,0.0030549897,0.0043269694,0.0050525153,0.0007501737],"domain_scores_gemma":[0.63956136,0.30719298,0.0131320665,0.026097022,0.012191284,0.0018252778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03233095,0.0014580908,0.0013896669,0.006893528,0.0021172261,0.008502508,0.0028195463,0.0029712033,0.0028554655],"category_scores_gemma":[0.23836783,0.00058817695,0.0011867638,0.0048800143,0.0022661013,0.014758926,0.0030547192,0.0038259393,0.0038357181],"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.0017453433,0.0006932091,0.37044615,0.0022705938,0.00072095584,0.00047706702,0.004773808,0.019026505,0.007965226,0.012726883,0.040452875,0.5387014],"study_design_scores_gemma":[0.00022830436,0.0005967573,0.13821816,0.0012844198,0.0006804547,0.0025937285,0.0063814926,0.6894081,0.025108917,0.07747814,0.057681806,0.00033959327],"about_ca_topic_score_codex":0.0043298593,"about_ca_topic_score_gemma":0.004582524,"teacher_disagreement_score":0.03233095,"about_ca_system_score_codex":0.0014423748,"about_ca_system_score_gemma":0.0016111541,"threshold_uncertainty_score":0.17098445},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037791415,0.00037132046,0.99361765,0.0006933476,0.00004477389,0.00004401664,0.000103101745,0.00009839304,0.001248341],"genre_scores_gemma":[0.53499955,0.0015126272,0.45015228,0.0011546232,0.00042622464,0.0010476174,0.0008838505,0.00024830483,0.009574862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965959,0.0016394975,0.0001829515,0.00084472564,0.00056527695,0.00017166506],"domain_scores_gemma":[0.98343843,0.012731031,0.0011089097,0.00076316576,0.0016510749,0.00030739052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007375999,0.0012500981,0.0014129147,0.0009888578,0.0004764364,0.0018148981,0.0040231007,0.002779751,0.0043208646],"category_scores_gemma":[0.018940087,0.0007757232,0.0013488599,0.0016076326,0.0021676258,0.003425047,0.0022359118,0.0044326773,0.00081470277],"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.000056383455,0.000058883918,0.0010001329,0.00018729355,0.000074650794,0.00011101741,0.00012806963,0.8040009,0.0004347867,0.15511242,0.0026605316,0.036174934],"study_design_scores_gemma":[0.0000055954165,0.000016406007,0.00005148743,0.000008208845,0.0000053337485,0.000011924953,0.000004200881,0.9711322,0.00007025816,0.028236447,0.00045308465,0.0000048534885],"about_ca_topic_score_codex":0.004817617,"about_ca_topic_score_gemma":0.004132867,"teacher_disagreement_score":0.007375999,"about_ca_system_score_codex":0.0023951342,"about_ca_system_score_gemma":0.002222806,"threshold_uncertainty_score":0.0390085},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007387942,0.00021795885,0.99013513,0.00031681356,0.000030761355,0.00007468793,0.00021943485,0.00020702099,0.0014102783],"genre_scores_gemma":[0.19404201,0.00039695812,0.8015698,0.0003095106,0.00008040686,0.000402727,0.0013561266,0.00021407138,0.0016283805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965425,0.0016806775,0.00020905971,0.000582343,0.0007716624,0.00021361021],"domain_scores_gemma":[0.99294734,0.005130474,0.0004094226,0.00056191016,0.0007754375,0.00017543757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034899602,0.0012067845,0.0014222147,0.0015971609,0.0010065017,0.0019297143,0.0017910218,0.0019643726,0.004510456],"category_scores_gemma":[0.017435728,0.000644221,0.0015129591,0.0025637385,0.0016074813,0.0027375186,0.0019482096,0.003010674,0.0008240878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015798013,0.00011639341,0.0010321887,0.00031271073,0.000071543756,0.00016733515,0.00037738896,0.718653,0.0020995827,0.15269397,0.006573679,0.11774423],"study_design_scores_gemma":[0.000021837333,0.0000281003,0.000111847075,0.000035538913,0.000011303601,0.00003728117,0.00004762426,0.8680327,0.0005904954,0.12946802,0.0016042776,0.000010877225],"about_ca_topic_score_codex":0.0024362528,"about_ca_topic_score_gemma":0.004326637,"teacher_disagreement_score":0.004510456,"about_ca_system_score_codex":0.0017877257,"about_ca_system_score_gemma":0.0022916857,"threshold_uncertainty_score":0.018456876},"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03144971,0.11566394,0.005940132,0.45822406,0.03641446,0.000060230217,0.0009848586,0.0005052679,0.35075736],"genre_scores_gemma":[0.38190007,0.14243814,0.010624809,0.1459037,0.058832638,0.0001821321,0.0011793895,0.00080736814,0.2581316],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9924737,0.0026565352,0.00046955183,0.00059288886,0.0033622272,0.00044515627],"domain_scores_gemma":[0.944409,0.030608946,0.0042075966,0.003668405,0.011267115,0.0058389343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010426837,0.00054600945,0.0004313144,0.0033587902,0.0039498485,0.0113258995,0.0007850298,0.0036693697,0.03386835],"category_scores_gemma":[0.042232983,0.00052228855,0.00052028167,0.005038085,0.0035303764,0.012840928,0.0033217096,0.005550412,0.011786576],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019263782,0.000056974375,0.012256974,0.0005156755,0.00005946882,0.00040499622,0.0063383696,0.0006567076,0.00073570147,0.08535201,0.6897729,0.20365761],"study_design_scores_gemma":[0.000008405283,0.000020566105,0.0023102432,0.00039870167,0.000009528376,0.00024890673,0.0027671407,0.00026800844,0.00014808867,0.014955306,0.9788336,0.000031530108],"about_ca_topic_score_codex":0.00092499616,"about_ca_topic_score_gemma":0.0018874948,"teacher_disagreement_score":0.03386835,"about_ca_system_score_codex":0.002421818,"about_ca_system_score_gemma":0.0025806145,"threshold_uncertainty_score":0.11330092},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8215178,0.00100949,0.16860564,0.0012344967,0.00012385717,0.00011668729,0.0008675065,0.0025002265,0.0040241973],"genre_scores_gemma":[0.9817199,0.00012517313,0.016227353,0.00008870375,0.000034703946,0.000018315723,0.0008366635,0.000020510604,0.00092867255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993679,0.00019459723,0.000031610245,0.00014961652,0.00014837676,0.0001079716],"domain_scores_gemma":[0.99814653,0.0006492817,0.00031482213,0.00030530756,0.00046440325,0.00011961455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012668492,0.0009550214,0.00072136405,0.0026215208,0.0005563579,0.0010146048,0.0010918124,0.00094528036,0.0005482435],"category_scores_gemma":[0.0036394105,0.00025280568,0.000504847,0.0014347285,0.00041869047,0.0018423024,0.0010686452,0.0011560533,0.00026453604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005489115,0.00061544304,0.061426166,0.00008183075,0.00032970938,0.00027301512,0.00016069504,0.563819,0.0062548076,0.0050984984,0.0067631495,0.35462877],"study_design_scores_gemma":[0.0000034665245,0.000014071878,0.0011368514,0.00000269532,0.000007666458,0.000012098886,0.000012889715,0.99624974,0.00076897617,0.0015669932,0.00022174377,0.0000027943784],"about_ca_topic_score_codex":0.010424691,"about_ca_topic_score_gemma":0.013964027,"teacher_disagreement_score":0.010424691,"about_ca_system_score_codex":0.0013797454,"about_ca_system_score_gemma":0.00071739196,"threshold_uncertainty_score":0.020728052},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020072556,0.81283826,0.14215028,0.024711331,0.0010909007,0.000051564257,0.00014255036,0.00030771564,0.016700197],"genre_scores_gemma":[0.026872622,0.826269,0.1330435,0.0046101464,0.005829539,0.00013056981,0.0003591939,0.00029409604,0.002591336],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99109113,0.004101295,0.0005382877,0.0009606853,0.0029141381,0.00039447923],"domain_scores_gemma":[0.9612495,0.03216452,0.00077787455,0.0017449281,0.0032799612,0.000783294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015466283,0.0020195413,0.0027763073,0.004567009,0.0011448708,0.010251944,0.0044536786,0.0039390423,0.007549338],"category_scores_gemma":[0.024931395,0.0016597772,0.001806423,0.015514919,0.004889225,0.025771236,0.0063805375,0.009932193,0.0024014155],"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.000093714494,0.00012911182,0.0010111923,0.006944271,0.00023606668,0.00012627596,0.0005483917,0.007995124,0.00039605395,0.28433007,0.025099136,0.6730905],"study_design_scores_gemma":[0.000031584,0.00011969936,0.0007531536,0.0060133,0.00011460987,0.00042714717,0.001113778,0.03756401,0.00087373675,0.5298343,0.4230014,0.00015329609],"about_ca_topic_score_codex":0.004158449,"about_ca_topic_score_gemma":0.004251909,"teacher_disagreement_score":0.015466283,"about_ca_system_score_codex":0.0032355308,"about_ca_system_score_gemma":0.005942097,"threshold_uncertainty_score":0.0817945},"labels":[],"label_agreement":null}]}