{"meta":{"query_hash":"f944c05b5d1a","filters":{"venue":"International Joint Conference on Artificial Intelligence"},"cohort_total":82,"direct_labels_cover":0,"predictions_cover":82,"exported":82,"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/f944c05b5d1a","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Joint+Conference+on+Artificial+Intelligence"},"results":[{"id":"W105409620","doi":"","title":"Planning with loops","year":2005,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Planner; Computer science; Strengths and weaknesses; Iterative method; Work (physics); Automated theorem proving; Theoretical computer science; Algorithm; Artificial intelligence; Engineering","score_opus":0.11457126068263553,"score_gpt":0.31723246448689313,"score_spread":0.20266120380425762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W105409620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009655631,0.000025843963,0.94161993,0.012583862,0.00051562814,0.0001203268,0.0000058604596,0.00027313866,0.035199765],"genre_scores_gemma":[0.9509874,0.0000069692305,0.04705975,0.0011287017,0.00027719027,0.000018493389,0.000008928511,0.000011835784,0.00050071155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980563,0.000051401155,0.00041938468,0.0005382781,0.0005897627,0.00034489806],"domain_scores_gemma":[0.9988463,0.00014126298,0.00017571388,0.00039573925,0.0003071533,0.00013382718],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033726354,0.00022465442,0.0001723805,0.00023381971,0.00016602842,0.00048897776,0.0011023445,0.000071274975,0.0003461747],"category_scores_gemma":[0.00008729518,0.00019224238,0.00005863658,0.00023580843,0.00008780668,0.0005751471,0.0001310476,0.00034955877,0.0010144556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000533474,0.0001029643,0.0002277127,0.0000033154515,0.00002910293,0.0000565269,0.0010726128,0.028553262,0.0011303931,0.70878285,0.0003806533,0.2596073],"study_design_scores_gemma":[0.000084957486,0.0004064783,0.00041425147,0.00046919475,0.0000069564862,0.000082947045,0.0002793793,0.87244016,0.0683325,0.047918715,0.008938551,0.0006259196],"about_ca_topic_score_codex":0.000037123806,"about_ca_topic_score_gemma":0.000027016857,"teacher_disagreement_score":0.9413318,"about_ca_system_score_codex":0.00008953448,"about_ca_system_score_gemma":0.00014727771,"threshold_uncertainty_score":0.99976337},"labels":[],"label_agreement":null},{"id":"W110110163","doi":"","title":"An action description language for iterated belief change","year":2007,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","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":"Simon Fraser University","funders":"","keywords":"Ontic; Action (physics); Iterated function; Epistemology; Computer science; Semantics (computer science); Projection (relational algebra); Sequence (biology); Philosophy of language; Cognitive science; Mathematics; Algorithm; Philosophy; Programming language; Psychology; Metaphysics","score_opus":0.26246317474050784,"score_gpt":0.38866312096590383,"score_spread":0.126199946225396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W110110163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05211361,0.000020338215,0.9383733,0.000952777,0.0026370676,0.00038788625,0.000013478574,0.00025310396,0.0052483864],"genre_scores_gemma":[0.9896594,0.000022098046,0.008473966,0.00060545903,0.0008058987,0.0000696447,0.000054194614,0.000013369367,0.000295934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815744,0.000053476946,0.00046605707,0.000564086,0.00038622034,0.00037269515],"domain_scores_gemma":[0.99851227,0.00010336099,0.00019664686,0.00037044944,0.00066012616,0.00015712433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000756685,0.00021137236,0.00016804664,0.0003208972,0.0001681776,0.0005252429,0.0008562302,0.000120191165,0.00016526894],"category_scores_gemma":[0.00019366053,0.00019951921,0.000099842626,0.00025568483,0.00006650866,0.0010943242,0.00007505472,0.00018977118,0.00031138334],"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.00007336311,0.0002265867,0.00005449661,0.000005064205,0.000012134537,0.000012046744,0.0024909182,0.000024048595,0.038729087,0.5656414,0.000049665025,0.39268118],"study_design_scores_gemma":[0.00014786219,0.0009610161,0.0036925043,0.00013734386,0.000011300495,0.000032830834,0.0015895728,0.48182437,0.40457276,0.103855774,0.002519381,0.0006552726],"about_ca_topic_score_codex":0.00014075887,"about_ca_topic_score_gemma":0.0005579299,"teacher_disagreement_score":0.93754584,"about_ca_system_score_codex":0.0001613611,"about_ca_system_score_gemma":0.00006410913,"threshold_uncertainty_score":0.81361574},"labels":[],"label_agreement":null},{"id":"W11533555","doi":"","title":"Towards cooperative negotiation for decentralized resource allocation in autonomic computing systems","year":2003,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Autonomic computing; Negotiation; Computer science; Resource allocation; Distributed computing; Resource management (computing); Resource (disambiguation); Computer network; Cloud computing; Operating system","score_opus":0.15742293761651205,"score_gpt":0.3588051013070076,"score_spread":0.20138216369049555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W11533555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004775814,0.000034714783,0.9904801,0.0012257285,0.0017560124,0.0005173098,0.000006408807,0.00021459507,0.0009892768],"genre_scores_gemma":[0.8236631,0.000021176518,0.17599882,0.00012476757,0.0000537862,0.000066300374,0.000013044103,0.00001256606,0.000046430374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978895,0.0002555943,0.00068364403,0.0005486586,0.00029618994,0.0003264096],"domain_scores_gemma":[0.9983412,0.0006579849,0.00022361138,0.00030556638,0.00040321558,0.0000684133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010505028,0.00021565557,0.00026056988,0.0002807023,0.0000912162,0.00031059756,0.00066891505,0.00009296207,0.00001654085],"category_scores_gemma":[0.0027156295,0.00022416531,0.00006670748,0.0002811621,0.00005972145,0.00039690058,0.00007301471,0.00020705326,0.00003922152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016582244,0.00003825071,0.000011122817,0.000004538639,0.000008844029,0.0000018367036,0.00048360132,0.37388667,0.0015646829,0.59538996,0.000012958505,0.028580949],"study_design_scores_gemma":[0.00011047997,0.00010701713,0.00021342226,0.00013304788,0.0000026678179,0.000007872239,0.00042267167,0.857897,0.05363101,0.08617955,0.0009978438,0.00029744723],"about_ca_topic_score_codex":0.00004123968,"about_ca_topic_score_gemma":0.000019635809,"teacher_disagreement_score":0.8188873,"about_ca_system_score_codex":0.00042951532,"about_ca_system_score_gemma":0.00019780589,"threshold_uncertainty_score":0.9141196},"labels":[],"label_agreement":null},{"id":"W117603095","doi":"","title":"Context-driven predictions","year":2007,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","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":"McGill University","funders":"","keywords":"Observable; Computer science; Partially observable Markov decision process; Context (archaeology); Markov model; Markov process; Markov decision process; Hidden Markov model; Simple (philosophy); Markov chain; Abstraction; Hidden semi-Markov model; Context model; Maximum-entropy Markov model; Artificial intelligence; Theoretical computer science; Variable-order Markov model; Machine learning; Algorithm; Mathematics","score_opus":0.1336036417609611,"score_gpt":0.3360765873948148,"score_spread":0.20247294563385368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W117603095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035434563,0.000011865258,0.9496447,0.005731472,0.0022135216,0.00015805321,0.000012199876,0.0003592764,0.038325496],"genre_scores_gemma":[0.984145,0.00003321581,0.013875161,0.0011868455,0.00029228211,0.000018016564,0.000009081795,0.0000127032,0.00042767863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740326,0.00004972886,0.0007352735,0.0006532522,0.0007019011,0.00045655278],"domain_scores_gemma":[0.9982211,0.0001668848,0.00019255686,0.00053533,0.0006451613,0.00023894495],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006259864,0.00025124924,0.00020693275,0.00035306052,0.00019264579,0.0004296419,0.0014698112,0.00012799198,0.00036924594],"category_scores_gemma":[0.0002217687,0.00024586075,0.00013141913,0.0003448965,0.00016353624,0.0005142933,0.00022096536,0.0004229533,0.0013686916],"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.00002125263,0.00012753437,0.000028997347,0.0000015314005,0.000019919476,0.000026373913,0.00033754643,0.00071749295,0.0027192696,0.7793719,0.00019786002,0.21643032],"study_design_scores_gemma":[0.000059658214,0.00025715568,0.0005771582,0.00013745404,0.0000069255934,0.000046204877,0.000456522,0.65165854,0.057943672,0.28612593,0.0022573238,0.00047345235],"about_ca_topic_score_codex":0.00009251789,"about_ca_topic_score_gemma":0.00016057909,"teacher_disagreement_score":0.98060155,"about_ca_system_score_codex":0.00013254733,"about_ca_system_score_gemma":0.0001557756,"threshold_uncertainty_score":0.99999934},"labels":[],"label_agreement":null},{"id":"W119782953","doi":"10.5591/978-1-57735-516-8/ijcai11-099","title":"A uniform approach for generating proofs and strategies for both true and false QBF formulas","year":2011,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","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":"Correctness; Mathematical proof; Computer science; Conjunctive normal form; Falsity; True quantified Boolean formula; Simple (philosophy); Solver; Algorithm; Representation (politics); Computation; Theoretical computer science; Mathematics; Programming language","score_opus":0.266406923665083,"score_gpt":0.3559615866280027,"score_spread":0.0895546629629197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W119782953","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008031922,0.000021510004,0.98623,0.00022702865,0.00040649215,0.0008226845,0.000024643503,0.000087435976,0.004148242],"genre_scores_gemma":[0.47576168,0.000016269107,0.52373797,0.00010669328,0.00007157677,0.00024125278,0.000007869084,0.000008625979,0.000048076512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983508,0.000041443916,0.0005202749,0.00056953303,0.00023707472,0.000280886],"domain_scores_gemma":[0.99887294,0.00011579377,0.00023165374,0.00028408284,0.00039905903,0.000096478885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007351393,0.00021324714,0.00020127394,0.00017677966,0.0002004768,0.000513707,0.0005743617,0.0000942914,0.000012703755],"category_scores_gemma":[0.0002827257,0.00019569528,0.000061331506,0.000104307255,0.00015799934,0.0009459741,0.00013925589,0.00013036099,0.0000040062773],"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.00006523313,0.00006897729,0.00000916365,0.000027605716,0.000015673157,4.5991976e-7,0.0015087572,0.00015633233,0.0029332517,0.7947174,0.0000068426707,0.20049031],"study_design_scores_gemma":[0.000058103,0.00029663704,0.00006370813,0.000029077362,0.000005311598,0.00001096795,0.0007099372,0.6981547,0.034289964,0.2660585,0.00013647994,0.00018664011],"about_ca_topic_score_codex":0.000044544373,"about_ca_topic_score_gemma":0.000029097278,"teacher_disagreement_score":0.69799834,"about_ca_system_score_codex":0.000046799054,"about_ca_system_score_gemma":0.0001229337,"threshold_uncertainty_score":0.7980222},"labels":[],"label_agreement":null},{"id":"W126088545","doi":"","title":"Iterated belief change: a transition system approach","year":2005,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","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":"Simon Fraser University","funders":"","keywords":"Belief revision; Iterated function; Interpretation (philosophy); Computer science; Transition (genetics); Set (abstract data type); Operator (biology); Transition system; Artificial intelligence; Theoretical computer science; Mathematics; Programming language","score_opus":0.13737546099184317,"score_gpt":0.30236902475651123,"score_spread":0.16499356376466806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W126088545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004082895,0.0000450691,0.91888463,0.004769594,0.0012886424,0.00036712884,0.000014965165,0.00045252798,0.07009455],"genre_scores_gemma":[0.9870409,0.000029661376,0.010862775,0.0007687085,0.0008560142,0.00012363742,0.000030824634,0.000014160272,0.0002733569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757415,0.00011540471,0.0005995079,0.00071688835,0.0006091108,0.00038492735],"domain_scores_gemma":[0.99856496,0.00005593513,0.00018421233,0.00044047652,0.00059074396,0.00016366321],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00041865025,0.0002868521,0.00025870095,0.00030860858,0.00017484407,0.00057204167,0.001184152,0.00013218672,0.00018439279],"category_scores_gemma":[0.00006593342,0.00026077149,0.0001423255,0.00036761316,0.00009492396,0.0008323531,0.00013183363,0.0002976306,0.0015784883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025753858,0.00027199718,0.0000063662974,0.00001242889,0.00002244134,0.000014444734,0.0029624328,0.00045497337,0.0011380267,0.8207507,0.000094849485,0.17424555],"study_design_scores_gemma":[0.00007473996,0.00015860687,0.00014973906,0.00017281724,0.000007640177,0.00007117652,0.00048692033,0.96566033,0.021429304,0.009531489,0.0018590022,0.000398212],"about_ca_topic_score_codex":0.00006959348,"about_ca_topic_score_gemma":0.000041051808,"teacher_disagreement_score":0.98295796,"about_ca_system_score_codex":0.000247274,"about_ca_system_score_gemma":0.00009760571,"threshold_uncertainty_score":0.99998444},"labels":[],"label_agreement":null},{"id":"W131525165","doi":"","title":"Dual lookups in pattern databases","year":2005,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Lookup table; Protein Data Bank (RCSB PDB); Heuristic; Table (database); Cube (algebra); Extension (predicate logic); Dual (grammatical number); Tree (set theory); Database; Combinatorics; Programming language; Mathematics; Artificial intelligence","score_opus":0.15470392933671911,"score_gpt":0.33638119803484745,"score_spread":0.18167726869812834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W131525165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023031458,0.000032000084,0.94877255,0.015704138,0.0010010991,0.0001584277,0.00003256237,0.00018337414,0.011084408],"genre_scores_gemma":[0.9858645,0.000027564167,0.012165794,0.0013515201,0.00030026518,0.000022121803,0.000028916738,0.000010306489,0.00022900716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778295,0.00008775043,0.0006151254,0.00060051953,0.0005437492,0.00036991842],"domain_scores_gemma":[0.9988896,0.00019876115,0.00015816702,0.0004530542,0.00018823233,0.00011217679],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005036861,0.00022119626,0.000190991,0.00035436815,0.00008718351,0.00031299345,0.00094114547,0.00006063922,0.00062566705],"category_scores_gemma":[0.00018970897,0.00021983725,0.00006827995,0.00024753946,0.000074619595,0.0006901206,0.0002481731,0.00038161495,0.0015468928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018651763,0.00019280083,0.00072348217,0.000004162325,0.000011722534,0.00007870941,0.00070063357,0.0054590683,0.0011841807,0.42035085,0.00038182968,0.5708939],"study_design_scores_gemma":[0.00009093294,0.00013699141,0.0013933494,0.0003908076,0.0000033178426,0.000041681007,0.0001928955,0.9104501,0.052481294,0.027826563,0.0064377384,0.00055434526],"about_ca_topic_score_codex":0.00033622028,"about_ca_topic_score_gemma":0.000641763,"teacher_disagreement_score":0.96283305,"about_ca_system_score_codex":0.00012103708,"about_ca_system_score_gemma":0.00013706616,"threshold_uncertainty_score":0.9992305},"labels":[],"label_agreement":null},{"id":"W140552972","doi":"","title":"Solving 8x8 Hex.","year":2009,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Mathematics, Computing, and Information Processing","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Programming language","score_opus":0.11204493286008936,"score_gpt":0.32447366125751015,"score_spread":0.21242872839742077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W140552972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002468386,0.000009529139,0.8947545,0.006874005,0.0010762623,0.00011334504,0.0000016096706,0.00026142926,0.094440915],"genre_scores_gemma":[0.9629761,0.0000175804,0.03402587,0.0024279596,0.00020478811,0.000005356007,0.0000043115224,0.0000059659887,0.0003320828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779576,0.000034293127,0.00079274346,0.00039728236,0.0006556665,0.00032426842],"domain_scores_gemma":[0.99850816,0.00008220717,0.00034034307,0.00041882295,0.00052896206,0.00012151884],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00047182545,0.00021529286,0.00020215366,0.00029145388,0.00020435535,0.0009595422,0.0013754955,0.0000712437,0.00038353473],"category_scores_gemma":[0.00034273852,0.00020471207,0.00010170731,0.000254446,0.00006253551,0.0010798564,0.00015158308,0.00025668033,0.0010078705],"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.000003891742,0.00007491131,0.0000027963408,0.0000041654007,0.0000056606445,0.0000048692946,0.0010060587,0.00041552176,0.0009981247,0.7016649,0.00019625107,0.29562286],"study_design_scores_gemma":[0.000021697115,0.000079602956,0.00008654869,0.00012553274,0.0000015348395,0.00001661976,0.00015645649,0.566572,0.03340126,0.3986919,0.000633744,0.00021307841],"about_ca_topic_score_codex":0.000010236586,"about_ca_topic_score_gemma":0.0000042793886,"teacher_disagreement_score":0.9605077,"about_ca_system_score_codex":0.00008573746,"about_ca_system_score_gemma":0.00012549265,"threshold_uncertainty_score":0.99977},"labels":[],"label_agreement":null},{"id":"W143659154","doi":"","title":"Evaluating a decision-theoretic approach to Tailored example selection","year":2007,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Intelligent Tutoring Systems and Adaptive Learning","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 British Columbia","funders":"","keywords":"Computer science; Selection (genetic algorithm); Probabilistic logic; Mechanism (biology); Process (computing); Artificial intelligence; Machine learning; Management science; Engineering","score_opus":0.21542235496693063,"score_gpt":0.3802068011370155,"score_spread":0.16478444617008486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W143659154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03399796,0.000005680637,0.9418373,0.00046506952,0.0018301721,0.00038361308,0.0000015101324,0.00022019901,0.021258492],"genre_scores_gemma":[0.8711298,0.0000032444868,0.12707838,0.00035328418,0.0004027521,0.000037836217,0.0000041674953,0.000018951894,0.0009715863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628806,0.000120115685,0.00091218756,0.0009316928,0.0011947304,0.00055318786],"domain_scores_gemma":[0.9976916,0.00040300025,0.0002581154,0.00044981865,0.00095963886,0.00023788087],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00262566,0.00029485975,0.00026107157,0.0005918984,0.00027467674,0.0006208719,0.001283514,0.00010808641,0.00019333373],"category_scores_gemma":[0.00095211994,0.00028002015,0.00013315324,0.0006431278,0.00006196671,0.0003812329,0.00027087505,0.00040341503,0.0011852382],"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.00006463889,0.00012464146,0.000043850196,0.00000379892,0.000017407221,0.0000062158174,0.0010822666,0.007790595,0.009580261,0.7644732,0.000033052744,0.21678007],"study_design_scores_gemma":[0.000073434436,0.0006573177,0.0009287224,0.00033214604,0.0000077589,0.000062394196,0.0010308798,0.71874154,0.11287841,0.16065465,0.0039384426,0.0006942884],"about_ca_topic_score_codex":0.0002522844,"about_ca_topic_score_gemma":0.000042211006,"teacher_disagreement_score":0.83713186,"about_ca_system_score_codex":0.00030171324,"about_ca_system_score_gemma":0.0001276771,"threshold_uncertainty_score":0.9999652},"labels":[],"label_agreement":null},{"id":"W15018536","doi":"10.1021/ic035133a","title":"Compiling control knowledge into preconditions for planning in the situation calculus","year":2003,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Situation calculus; Computer science; Calculus (dental); Domain (mathematical analysis); Control (management); Action (physics); Plan (archaeology); Transformation (genetics); Domain knowledge; Mathematics; Artificial intelligence","score_opus":0.13885397239882438,"score_gpt":0.36079424045340885,"score_spread":0.22194026805458447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W15018536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076984125,0.000047977584,0.9790526,0.0036185044,0.0009327747,0.00043671447,0.000014311704,0.000073163756,0.008125515],"genre_scores_gemma":[0.9888145,0.0000038915405,0.010192036,0.00062428456,0.000104929124,0.00016321865,0.000025396532,0.000008202656,0.00006356457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981744,0.00023611764,0.00055365515,0.00043455148,0.00030691325,0.00029430675],"domain_scores_gemma":[0.9981292,0.0010030994,0.00017603584,0.00029774144,0.00033395062,0.000059983737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013018799,0.00018421882,0.00017701718,0.0002627145,0.00028725681,0.00040857782,0.0008670391,0.00007886625,0.00006455375],"category_scores_gemma":[0.0006647562,0.00015661982,0.00009284327,0.0002694157,0.000070950846,0.00034302156,0.000033939697,0.0003006695,0.00012882915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022093778,0.00014375086,0.00015547378,0.000007944912,0.000015891637,0.0000072296934,0.005330787,0.019912554,0.00095122546,0.94703627,0.00016816799,0.026248606],"study_design_scores_gemma":[0.00011909418,0.00014193243,0.00027400546,0.00018477281,0.0000058075398,0.0000119026545,0.00083629764,0.7362582,0.007382358,0.25331673,0.0012467321,0.00022218673],"about_ca_topic_score_codex":0.000048355574,"about_ca_topic_score_gemma":0.00011285571,"teacher_disagreement_score":0.98111606,"about_ca_system_score_codex":0.00010754552,"about_ca_system_score_gemma":0.0001899006,"threshold_uncertainty_score":0.6386771},"labels":[],"label_agreement":null},{"id":"W1540266240","doi":"","title":"Accelerated robust point cloud registration in natural environments through positive and unlabeled learning","year":2013,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Robotics and Sensor-Based Localization","field":"Engineering","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":"Université Laval","funders":"","keywords":"Robustness (evolution); Computer science; Artificial intelligence; Point cloud; Pairwise comparison; Computer vision; Image registration; Robot; Machine learning; Mobile robot; Pattern recognition (psychology); Image (mathematics)","score_opus":0.06487840364842372,"score_gpt":0.2634298915574278,"score_spread":0.19855148790900407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540266240","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6230611,0.000044867313,0.3660317,0.0017957235,0.0010694999,0.0004790842,0.000007630904,0.0001256016,0.007384729],"genre_scores_gemma":[0.9984008,0.0001899291,0.00090796046,0.00013058909,0.000085010906,0.000021955031,0.00007865496,0.000019023551,0.0001660924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987523,0.00005452276,0.00045228057,0.00027610257,0.00026042873,0.00020434025],"domain_scores_gemma":[0.9996003,0.000061191706,0.00007951282,0.00010163795,0.000106827065,0.00005051937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010713728,0.00018435848,0.00015474627,0.00012156569,0.0000605255,0.00022277018,0.00011830417,0.00008628823,0.00036784098],"category_scores_gemma":[0.00010013554,0.0001889302,0.000030817802,0.00012535359,0.000075243974,0.00037936863,0.0000284291,0.00033536187,0.0001933331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004395055,0.00010282679,0.00032183866,0.000010785941,0.000043374424,0.000017013295,0.0009585816,0.78685504,0.06503657,0.115693845,0.00009060483,0.030825535],"study_design_scores_gemma":[0.00006376513,0.000064729546,0.0027326709,0.00009889352,0.0000035984142,0.0000046476757,0.00042915446,0.9281756,0.0580483,0.0101045435,0.00005955399,0.00021448379],"about_ca_topic_score_codex":0.0002747201,"about_ca_topic_score_gemma":0.00009330165,"teacher_disagreement_score":0.37533963,"about_ca_system_score_codex":0.00014929367,"about_ca_system_score_gemma":0.000015793228,"threshold_uncertainty_score":0.770435},"labels":[],"label_agreement":null},{"id":"W1552684655","doi":"","title":"Using linear programming for Bayesian exploration in Markov decision processes","year":2007,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Markov decision process; Computer science; Bellman equation; Reinforcement learning; Mathematical optimization; Markov process; Linear programming; Machine learning; Representation (politics); Artificial intelligence; Markov chain; Key (lock); Bayesian probability; Partially observable Markov decision process; Markov model; Algorithm; Mathematics","score_opus":0.2143689443380605,"score_gpt":0.3942220206217933,"score_spread":0.1798530762837328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552684655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024075194,0.000006063945,0.99356043,0.0011579943,0.0010405645,0.0005269353,0.0000017504071,0.000104419494,0.0011943255],"genre_scores_gemma":[0.67148167,0.000014250851,0.32809162,0.00017321241,0.00014174794,0.000027050251,0.000008788706,0.0000117914715,0.00004987633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755514,0.00003150483,0.0008522841,0.0005238088,0.0006356875,0.00040155667],"domain_scores_gemma":[0.9981309,0.00041777772,0.0002841508,0.0002984485,0.0007758776,0.00009280629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010967144,0.00020631851,0.00018530758,0.00050986157,0.00012288651,0.0003920841,0.0008631855,0.00009992422,0.000039226634],"category_scores_gemma":[0.0013586597,0.00020889033,0.00006751872,0.0005514615,0.00006652463,0.0009552589,0.00014608375,0.00022444747,0.00004868241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015157065,0.00014344329,0.0001790877,0.000026308819,0.000012438278,0.000020255986,0.0009005344,0.27996916,0.0019709775,0.2238199,0.000015345346,0.49279097],"study_design_scores_gemma":[0.00006143513,0.00016743902,0.000054982844,0.00027081123,0.000002578771,0.0000057631146,0.00030532866,0.9341963,0.03173863,0.032327667,0.00063807383,0.000231001],"about_ca_topic_score_codex":0.000037258746,"about_ca_topic_score_gemma":0.00020878222,"teacher_disagreement_score":0.6690741,"about_ca_system_score_codex":0.00021091106,"about_ca_system_score_gemma":0.00021219518,"threshold_uncertainty_score":0.85183007},"labels":[],"label_agreement":null},{"id":"W1558653343","doi":"","title":"Real-time strategy gaines: a new AI research challenge","year":2003,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":127,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Domain (mathematical analysis); Operations research; Artificial intelligence; Human–computer interaction; Data science; Engineering","score_opus":0.28257455156000755,"score_gpt":0.41729197661527706,"score_spread":0.1347174250552695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558653343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007116401,0.000059119175,0.64777106,0.02305132,0.0027269006,0.00083188637,0.000014616655,0.0006636843,0.31776503],"genre_scores_gemma":[0.98287827,0.00039970077,0.010055198,0.00048288613,0.00051440723,0.000074666386,0.000008878534,0.000045746834,0.005540227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99360204,0.0005925188,0.0012766991,0.0014436988,0.0019996513,0.001085395],"domain_scores_gemma":[0.9954255,0.00063793187,0.00027421664,0.001319262,0.0018241118,0.0005189358],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0020886024,0.0004961211,0.00045009205,0.00086606224,0.00037961826,0.0012969344,0.0030346015,0.00026654443,0.0036564989],"category_scores_gemma":[0.0016411508,0.00048954954,0.00022526414,0.0010499633,0.0004680361,0.0011078019,0.0003864516,0.0010274877,0.012101767],"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.000033139648,0.0003114199,0.000008505881,0.0000044612866,0.000033574466,0.00008795116,0.0009965312,0.000975009,0.009780004,0.85489124,0.0018021909,0.131076],"study_design_scores_gemma":[0.000037514077,0.0004950916,0.000023695728,0.00014409231,0.000004341533,0.000035489724,0.0007804939,0.10297585,0.12851565,0.76099294,0.0054461723,0.00054866844],"about_ca_topic_score_codex":0.00065259374,"about_ca_topic_score_gemma":0.00019179183,"teacher_disagreement_score":0.9757619,"about_ca_system_score_codex":0.0003580123,"about_ca_system_score_gemma":0.0011784498,"threshold_uncertainty_score":0.9997556},"labels":[],"label_agreement":null},{"id":"W1563879233","doi":"","title":"Topological mapping through distributed, passive sensors","year":2007,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Probabilistic logic; Computer science; Wireless sensor network; Navigability; Maximization; Topology (electrical circuits); Graph; occam; Network topology; Theoretical computer science; Distributed computing; Artificial intelligence; Mathematical optimization; Mathematics; Computer network","score_opus":0.11088118332271106,"score_gpt":0.32002441807573817,"score_spread":0.2091432347530271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563879233","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03323322,0.000011250605,0.93836844,0.006820427,0.0022068156,0.00016619047,0.000017223527,0.00030524776,0.018871188],"genre_scores_gemma":[0.96550435,0.00004541803,0.032888144,0.00090564264,0.00040240944,0.000011882336,0.000031762105,0.000014013948,0.00019635679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966368,0.00009428094,0.000866398,0.00085126713,0.00087954674,0.0006716942],"domain_scores_gemma":[0.99796844,0.00040647318,0.00030833893,0.0005682328,0.0005675438,0.00018100455],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005189175,0.00032895137,0.0002868585,0.00022947589,0.00021639626,0.00039051202,0.0015669765,0.00019450138,0.00041121972],"category_scores_gemma":[0.0002923081,0.00030330356,0.00017091168,0.0005515988,0.00028404346,0.0004251932,0.00038159938,0.0005138424,0.00067238766],"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.000031025662,0.0001778518,0.000038877683,0.0000018363969,0.000026513366,0.00018536102,0.00043284148,0.020909872,0.0018642483,0.89650226,0.0001413971,0.079687916],"study_design_scores_gemma":[0.00011093933,0.00029705893,0.0011337951,0.00023466922,0.0000077226805,0.00012204147,0.0016044584,0.5788139,0.18446444,0.22171775,0.010461615,0.0010316187],"about_ca_topic_score_codex":0.00008687006,"about_ca_topic_score_gemma":0.00006299345,"teacher_disagreement_score":0.9322711,"about_ca_system_score_codex":0.00022702351,"about_ca_system_score_gemma":0.000071183415,"threshold_uncertainty_score":0.9999419},"labels":[],"label_agreement":null},{"id":"W157236388","doi":"10.5591/978-1-57735-516-8/ijcai11-180","title":"An assertion retrieval algebra for object queries over knowledge bases","year":2011,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Advanced Database Systems and Queries","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 Waterloo","funders":"","keywords":"Computer science; Assertion; Information retrieval; Knowledge base; Identifier; Rewriting; Context (archaeology); Object (grammar); Focus (optics); Generalization; Relational algebra; Theoretical computer science; Programming language; Artificial intelligence; Relational database; Mathematics","score_opus":0.1745760442987635,"score_gpt":0.3595382497468571,"score_spread":0.1849622054480936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W157236388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018360328,0.000021721095,0.97191304,0.00032829973,0.0022281278,0.00036659196,0.000089894354,0.00024503501,0.0064469436],"genre_scores_gemma":[0.94723696,0.000027381073,0.051808584,0.00024386733,0.00030133795,0.0000714306,0.00005400219,0.000019288522,0.00023717347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99777836,0.00009873352,0.00065199146,0.000725072,0.00039887868,0.00034698547],"domain_scores_gemma":[0.9980633,0.00014594347,0.00025332405,0.00064203294,0.0007392756,0.00015609484],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047622345,0.00027752222,0.00025674846,0.00024943403,0.00020358151,0.00021694959,0.0008743281,0.000096848264,0.00044361936],"category_scores_gemma":[0.00037566872,0.00025720673,0.0001321712,0.00023531001,0.00015861861,0.0017054005,0.00015267715,0.0001755844,0.00022645699],"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.00018544341,0.0002681156,0.00004306372,0.000010624928,0.000022210565,0.000007975174,0.0012671192,0.000027050997,0.012163055,0.9378263,0.00009005011,0.04808901],"study_design_scores_gemma":[0.000113505506,0.0010837476,0.001316873,0.00023036101,0.000011729706,0.00002156216,0.0009339396,0.163944,0.61208314,0.21085145,0.008666161,0.0007435501],"about_ca_topic_score_codex":0.00016616071,"about_ca_topic_score_gemma":0.00029745782,"teacher_disagreement_score":0.9288766,"about_ca_system_score_codex":0.00010127501,"about_ca_system_score_gemma":0.00020405342,"threshold_uncertainty_score":0.999988},"labels":[],"label_agreement":null},{"id":"W1581425933","doi":"","title":"A general framework for scheduling in a stochastic environment","year":2007,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scheduling (production processes); Schedule; Machine learning; Theoretical computer science; Artificial intelligence; Distributed computing; Industrial engineering; Mathematical optimization; Engineering","score_opus":0.0940925670022517,"score_gpt":0.3325678346717465,"score_spread":0.23847526766949478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581425933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0094894385,0.000005478242,0.9848375,0.0032721707,0.0010426146,0.0003133658,0.0000057939965,0.000070104994,0.0009635849],"genre_scores_gemma":[0.7426237,0.000009679706,0.256803,0.000354731,0.0001247292,0.000031708743,0.000005654241,0.000006798395,0.000039994593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982842,0.000025363252,0.00056066876,0.0004592153,0.00036863502,0.0003018806],"domain_scores_gemma":[0.99911183,0.00026005728,0.0001512169,0.00024493568,0.0001340456,0.00009789449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005625916,0.00016135175,0.0001457381,0.000357113,0.00007649515,0.0001939903,0.00048730097,0.00009545689,0.0002806712],"category_scores_gemma":[0.0003461442,0.00017152283,0.0000791467,0.0001811755,0.00007086791,0.0002533765,0.00008730528,0.00023092981,0.00015579975],"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.00003548926,0.00007399776,0.000042362462,0.000001285632,0.000006687847,0.0000053645263,0.0002653854,0.07786922,0.0008597723,0.7386476,0.0000022168954,0.18219063],"study_design_scores_gemma":[0.000045636156,0.000066000626,0.00064779713,0.00006584631,0.0000015646814,0.0000057585316,0.00013985073,0.7151018,0.0071285297,0.2765596,0.0000680414,0.00016960158],"about_ca_topic_score_codex":0.000022847069,"about_ca_topic_score_gemma":0.00006013638,"teacher_disagreement_score":0.73313427,"about_ca_system_score_codex":0.0001909702,"about_ca_system_score_gemma":0.00007811026,"threshold_uncertainty_score":0.6994498},"labels":[],"label_agreement":null},{"id":"W167512791","doi":"10.1519/jsc.0b013e31822600c9","title":"A Description Logic of Change.","year":2006,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Semantic Web and Ontologies","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 Waterloo","funders":"","keywords":"Undecidable problem; Computer science; Description logic; Dynamic logic (digital electronics); Modal logic; Decidability; Satisfiability; Linear temporal logic; Temporal logic; Multimodal logic; EXPTIME; Boolean satisfiability problem; Modal; Theoretical computer science; Artificial intelligence; Algorithm; Computational complexity theory","score_opus":0.3215270559872621,"score_gpt":0.33948767127185797,"score_spread":0.01796061528459586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W167512791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027277224,0.00003778347,0.94110644,0.0068618613,0.0016306147,0.00018724153,0.0000063892608,0.00015395637,0.022738464],"genre_scores_gemma":[0.9881561,0.000028921308,0.01108922,0.00034269493,0.00019381623,0.000026295354,0.0000058270157,0.0000047089598,0.00015240665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984631,0.000045631987,0.0004935923,0.00035427228,0.00043608103,0.00020735076],"domain_scores_gemma":[0.9989845,0.00006950988,0.00021128179,0.00032209515,0.0003756659,0.00003692647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022683847,0.000145747,0.00018038717,0.000235693,0.000049934682,0.000161682,0.0008813097,0.000068557696,0.0001662922],"category_scores_gemma":[0.00011299301,0.00012973743,0.00009084618,0.00020509996,0.00012734938,0.0004277451,0.00014206406,0.000117328535,0.00025917473],"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.0000139764725,0.00013557602,0.00016211864,0.0000036748527,0.000006840297,0.000011405406,0.00014514923,0.00010283104,0.0095069,0.9149134,0.00008860391,0.074909516],"study_design_scores_gemma":[0.000031763968,0.00015936812,0.005707459,0.00008561482,0.0000036377244,0.000013533057,0.00015349005,0.09880047,0.12697706,0.767556,0.000312412,0.00019915507],"about_ca_topic_score_codex":0.0005617222,"about_ca_topic_score_gemma":0.00017628405,"teacher_disagreement_score":0.9608789,"about_ca_system_score_codex":0.000049466184,"about_ca_system_score_gemma":0.000047715865,"threshold_uncertainty_score":0.52905387},"labels":[],"label_agreement":null},{"id":"W171561842","doi":"","title":"Solving 8&times8 Hex","year":2009,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Algorithms and Data Compression","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":"Computer science","score_opus":0.10282745820924619,"score_gpt":0.32720784558054083,"score_spread":0.22438038737129465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W171561842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016198653,0.000019049847,0.95226365,0.0109119825,0.0014562103,0.00013004345,0.000009282316,0.00023867708,0.03335124],"genre_scores_gemma":[0.9660809,0.000047477763,0.031563845,0.0016431772,0.00028317975,0.0000080845875,0.000014172052,0.000006818235,0.00035236162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783766,0.000050359333,0.0005083376,0.0006111516,0.0006614302,0.0003310322],"domain_scores_gemma":[0.9986796,0.00007385182,0.00016768048,0.0005941981,0.00033734585,0.00014732461],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00028969272,0.00022871996,0.00019728737,0.0002254799,0.00016487966,0.0006354399,0.001652908,0.00007875648,0.0005370819],"category_scores_gemma":[0.00015745145,0.00020358562,0.00010688524,0.00023037344,0.00006132049,0.0008131107,0.00025012033,0.000280169,0.0011993097],"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.000010860568,0.000106935666,0.0000026451219,6.516762e-7,0.0000057635857,0.000032152784,0.00012779616,0.00020583438,0.005243797,0.58527535,0.00045326896,0.40853497],"study_design_scores_gemma":[0.000036002053,0.00023195967,0.00057639525,0.000120039986,0.0000024691205,0.000022978375,0.00006986784,0.56506044,0.057795625,0.3729057,0.00284108,0.00033745778],"about_ca_topic_score_codex":0.000034981604,"about_ca_topic_score_gemma":0.000006726626,"teacher_disagreement_score":0.964461,"about_ca_system_score_codex":0.00007843058,"about_ca_system_score_gemma":0.00009914389,"threshold_uncertainty_score":0.99957836},"labels":[],"label_agreement":null},{"id":"W17380902","doi":"","title":"Symmetric component caching","year":2007,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decomposition; Overhead (engineering); Homogeneous space; Pruning; Computer science; Constraint (computer-aided design); Mathematical optimization; Component (thermodynamics); Decomposition method (queueing theory); Space (punctuation); Mathematics; Algorithm; Discrete mathematics","score_opus":0.09724514953681351,"score_gpt":0.32213709990082545,"score_spread":0.22489195036401194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W17380902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066642766,0.0000063517577,0.9398107,0.0042105922,0.002200481,0.00014789886,0.0000039232987,0.00021630348,0.046739466],"genre_scores_gemma":[0.9801382,0.000025359881,0.018761141,0.0007552139,0.00015106311,0.000006002117,0.000009367692,0.000008479404,0.00014521142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978946,0.000048126254,0.0006198316,0.0004735661,0.0006501209,0.00031377055],"domain_scores_gemma":[0.99872774,0.00018917889,0.00020061982,0.0003396821,0.0003854008,0.00015739673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073357666,0.00018791245,0.00015596484,0.0006567199,0.00015681615,0.00038007044,0.0007812475,0.00007664354,0.0005156772],"category_scores_gemma":[0.000255489,0.00018856228,0.00009739081,0.00050991966,0.00008387331,0.00045279542,0.00015460356,0.00028783036,0.0007516315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011402826,0.000064351785,0.00007880651,0.0000010832118,0.000010009391,0.000017221437,0.00013126973,0.0012424495,0.0018410928,0.612491,0.00002632641,0.384085],"study_design_scores_gemma":[0.00010363492,0.00018487932,0.009950401,0.00011683931,0.0000071425434,0.00008290058,0.00043425692,0.7706945,0.10118208,0.11428434,0.002261775,0.000697242],"about_ca_topic_score_codex":0.00007843808,"about_ca_topic_score_gemma":0.00008355697,"teacher_disagreement_score":0.9734739,"about_ca_system_score_codex":0.00017849955,"about_ca_system_score_gemma":0.00008337457,"threshold_uncertainty_score":0.9660953},"labels":[],"label_agreement":null},{"id":"W175472853","doi":"","title":"Coalitional bargaining with agent type uncertainty","year":2007,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Negotiation; Heuristic; Mathematical economics; Bayesian probability; Computer science; Bayesian game; Mathematical optimization; Type (biology); Game theory; Rational agent; Bargaining problem; Economics; Artificial intelligence; Mathematics; Repeated game","score_opus":0.19383407547535234,"score_gpt":0.31255340672183773,"score_spread":0.1187193312464854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W175472853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19332714,0.000056352128,0.41547355,0.0020620292,0.0033213976,0.00035151787,0.0001340658,0.00016766618,0.3851063],"genre_scores_gemma":[0.9972762,0.000012548882,0.0007438844,0.00049081043,0.0003409546,0.000009470256,0.000040298488,0.0000184636,0.0010673762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982097,0.000025442281,0.0008149109,0.00046303734,0.00016034012,0.00032653115],"domain_scores_gemma":[0.9988822,0.00014156412,0.0003561652,0.00023672295,0.00026437454,0.000118978125],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014455075,0.00018984044,0.00025900928,0.00027159092,0.00011856635,0.0001495672,0.0003485866,0.000083705425,0.002692282],"category_scores_gemma":[0.00029653477,0.00018826887,0.00007623143,0.00021097153,0.00014626828,0.00014970473,0.000045352586,0.00024326364,0.003037014],"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.0002151084,0.00010903002,0.0010411432,0.000004172495,0.00004895692,0.000022810553,0.0004052453,0.0012670498,0.00040333217,0.9920643,0.000060377824,0.004358465],"study_design_scores_gemma":[0.00015078878,0.0005723448,0.0037350503,0.00026260733,0.0000068301565,0.00004733483,0.0018313073,0.029375723,0.009320608,0.9442916,0.009701954,0.00070383324],"about_ca_topic_score_codex":0.00018648541,"about_ca_topic_score_gemma":0.000113248585,"teacher_disagreement_score":0.80394906,"about_ca_system_score_codex":0.00017087533,"about_ca_system_score_gemma":0.000046358033,"threshold_uncertainty_score":0.9982194},"labels":[],"label_agreement":null},{"id":"W182596629","doi":"","title":"Temporal difference learning applied to a high-performance game-playing program","year":2001,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Task (project management); Temporal difference learning; Artificial intelligence; Class (philosophy); Function (biology); Sequential game; Machine learning; Game design; Reinforcement learning; Game theory; Engineering; Mathematics","score_opus":0.09513926961760284,"score_gpt":0.3262099561051989,"score_spread":0.23107068648759604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W182596629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37120178,0.000006750897,0.60702413,0.0036461668,0.0016640135,0.00078110094,0.0000044227577,0.0008809793,0.014790645],"genre_scores_gemma":[0.9693337,0.000071571434,0.027932892,0.0009317478,0.00039513383,0.0003803303,0.00001763353,0.000042385844,0.0008946257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99482375,0.00012244885,0.0012675917,0.0014245922,0.0013802849,0.0009813416],"domain_scores_gemma":[0.9973082,0.00023436261,0.0003985288,0.0008981341,0.00073569175,0.00042508377],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006388062,0.00059362105,0.0005077993,0.00069479074,0.0003933024,0.0011885711,0.0029815058,0.00019505715,0.0006445402],"category_scores_gemma":[0.00046973565,0.0005846684,0.00014672762,0.0011071864,0.00025631613,0.0006565018,0.00071020675,0.0008644276,0.0040365946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011401113,0.0003175821,0.00094236666,0.0000062905783,0.000028007866,0.000042919044,0.0008677747,0.008346178,0.00984059,0.32999328,0.00003408394,0.64946693],"study_design_scores_gemma":[0.000088631634,0.0013811416,0.0064126975,0.00035666223,0.0000121713965,0.000073133306,0.0007697775,0.74925506,0.16175571,0.07353584,0.0048084087,0.0015507963],"about_ca_topic_score_codex":0.0002344312,"about_ca_topic_score_gemma":0.00014595504,"teacher_disagreement_score":0.74090886,"about_ca_system_score_codex":0.00028120374,"about_ca_system_score_gemma":0.00021237935,"threshold_uncertainty_score":0.9998483},"labels":[],"label_agreement":null},{"id":"W182621935","doi":"","title":"Flexible execution of partial order plans with temporal constraints","year":2013,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Plan (archaeology); Schedule; Executor; Generalization; Variety (cybernetics); State (computer science); Order (exchange); Distributed computing; Operations research; Artificial intelligence; Programming language; Operating system; Engineering","score_opus":0.08728091937032868,"score_gpt":0.2954974309334702,"score_spread":0.20821651156314153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W182621935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02431121,0.00000579394,0.9593503,0.0034154581,0.0005431604,0.00024437267,0.000021961088,0.00013973092,0.011968038],"genre_scores_gemma":[0.97565794,0.0000047589942,0.023726897,0.0002497293,0.00007825124,0.000037442183,0.000023692111,0.000008707246,0.00021261156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809957,0.00006759869,0.0005482032,0.0004383689,0.00055466295,0.00029160007],"domain_scores_gemma":[0.9984369,0.00012342677,0.000276761,0.00033653606,0.00071059953,0.00011574589],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027525143,0.00020229517,0.00021092262,0.000203372,0.000095900104,0.00026666254,0.00076063775,0.00008218486,0.0010979364],"category_scores_gemma":[0.000108123386,0.00017035258,0.000055526853,0.0002767022,0.0002738651,0.00051095884,0.00009725077,0.00024176243,0.0005248281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006589026,0.00019260385,0.001159595,0.00001161673,0.000050124443,0.000018378116,0.0007915349,0.0041271574,0.005410474,0.8365106,0.00037235703,0.15128969],"study_design_scores_gemma":[0.0001751905,0.00092897034,0.0014820698,0.0006299018,0.000012466505,0.000077416276,0.00072754774,0.55550134,0.3330284,0.10596422,0.0007680613,0.00070443586],"about_ca_topic_score_codex":0.00047089317,"about_ca_topic_score_gemma":0.000034457466,"teacher_disagreement_score":0.9513467,"about_ca_system_score_codex":0.000044407316,"about_ca_system_score_gemma":0.00024374804,"threshold_uncertainty_score":0.99981517},"labels":[],"label_agreement":null},{"id":"W184141742","doi":"","title":"Adaptive error-correcting output codes","year":2013,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning; Multiclass classification; Class (philosophy); Generalization; Subspace topology; Binary number; Set (abstract data type); External Data Representation; Pattern recognition (psychology); Support vector machine; Mathematics","score_opus":0.1593352712391407,"score_gpt":0.33395722350649226,"score_spread":0.17462195226735155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W184141742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008267308,0.000008309931,0.9389206,0.011240985,0.0015793056,0.00023734506,0.000008236283,0.00030089705,0.039436992],"genre_scores_gemma":[0.9825305,0.000012479347,0.015556529,0.0006387217,0.00019286602,0.00006880655,0.000022237755,0.00001133476,0.00096655695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978172,0.00012525788,0.0005363565,0.0006455019,0.00056634756,0.00030931845],"domain_scores_gemma":[0.99825925,0.00020412714,0.00026743644,0.00053386285,0.0005998994,0.00013544598],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003706691,0.00022284144,0.00018780967,0.00025642035,0.00017840054,0.00075053837,0.0013078467,0.0000809169,0.0007337134],"category_scores_gemma":[0.00053692824,0.00020592035,0.000087030414,0.0002488883,0.00010213374,0.00083146384,0.00024772988,0.00040055113,0.0051930747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007869997,0.000056515863,0.00008927961,0.0000014716504,0.00001326764,0.0000034667132,0.00035398276,0.00042031612,0.0013561873,0.5057963,0.000358707,0.4915426],"study_design_scores_gemma":[0.000027909848,0.00014826268,0.0022839066,0.00008114432,0.000003106529,0.000018606816,0.0006908451,0.8683043,0.016382033,0.11078622,0.00095787214,0.000315768],"about_ca_topic_score_codex":0.0006021186,"about_ca_topic_score_gemma":0.00006427063,"teacher_disagreement_score":0.97426313,"about_ca_system_score_codex":0.00009953812,"about_ca_system_score_gemma":0.00009725622,"threshold_uncertainty_score":0.9955815},"labels":[],"label_agreement":null},{"id":"W186506571","doi":"","title":"Using core beliefs for point-based value iteration","year":2005,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Complexity and Algorithms in Graphs","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":"McGill University","funders":"","keywords":"Simplex; Computer science; Mathematical optimization; Partially observable Markov decision process; Set (abstract data type); Heuristic; Core (optical fiber); Simplex algorithm; Bellman equation; Point (geometry); Value (mathematics); Function (biology); Algorithm; Artificial intelligence; Mathematics; Linear programming; Machine learning; Markov chain; Combinatorics; Markov model","score_opus":0.29352949057106004,"score_gpt":0.3825340826528269,"score_spread":0.08900459208176686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W186506571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004009743,0.000011093054,0.98294276,0.009032901,0.0014528427,0.00034930455,0.000037092104,0.00016221678,0.0020020318],"genre_scores_gemma":[0.74342346,0.0000052681053,0.25426874,0.0016397208,0.00049852853,0.00003994625,0.000024648196,0.000012105067,0.00008761346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997847,0.000046635676,0.00062348397,0.0006063021,0.00054370705,0.0003328382],"domain_scores_gemma":[0.99844426,0.00020926101,0.00021911267,0.00044744773,0.00056602614,0.000113914335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004334475,0.00024029674,0.00020230965,0.00034330765,0.0002542258,0.0005450162,0.0011038365,0.000088899746,0.0002330649],"category_scores_gemma":[0.00020802587,0.0002467603,0.00018353364,0.00024186545,0.00012394488,0.0006444494,0.00013224549,0.00020978153,0.00017013837],"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.000029337512,0.00016864775,0.0000070262745,0.0000047396834,0.000014282944,0.0000031323068,0.00021357523,0.019052472,0.0060397387,0.82213485,0.00008277533,0.15224944],"study_design_scores_gemma":[0.000056922647,0.00011611749,0.000026140386,0.00008345601,0.0000036195233,0.000007271732,0.000032033284,0.7385575,0.06264061,0.19686824,0.0013917467,0.00021629946],"about_ca_topic_score_codex":0.000044425182,"about_ca_topic_score_gemma":0.000057938774,"teacher_disagreement_score":0.7394137,"about_ca_system_score_codex":0.00017158702,"about_ca_system_score_gemma":0.0001873816,"threshold_uncertainty_score":0.99999845},"labels":[],"label_agreement":null},{"id":"W191106913","doi":"10.5591/978-1-57735-516-8/ijcai11-112","title":"The multi-inter-distance constraint","year":2011,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","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":"Université Laval","funders":"","keywords":"Scheduling (production processes); Constraint (computer-aided design); Computer science; Constraint programming; Propagator; Mathematical optimization; Algorithm; Local consistency; Constraint satisfaction; Mathematics; Probabilistic logic; Artificial intelligence; Stochastic programming","score_opus":0.17250492896936367,"score_gpt":0.3139362700267007,"score_spread":0.14143134105733704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W191106913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034465018,0.0000103077255,0.95450145,0.004435367,0.0023769098,0.00020670216,0.000009520907,0.00020028981,0.03791479],"genre_scores_gemma":[0.96376747,0.00008988456,0.034965154,0.0005335045,0.00007036611,0.00003796044,0.00000385353,0.000009870213,0.00052192825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801683,0.0000914161,0.0006285181,0.0005104499,0.0004303926,0.0003224152],"domain_scores_gemma":[0.9984405,0.00013562721,0.00024325209,0.0005410558,0.0005072403,0.0001323331],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00041610695,0.00022060351,0.00014741861,0.00014552244,0.00031536643,0.0004918325,0.0013374389,0.0000726067,0.0008490894],"category_scores_gemma":[0.00028044728,0.00017340593,0.00012102059,0.00022011205,0.00039177705,0.00042209835,0.00017981749,0.0002944054,0.0008406757],"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.000019723035,0.000074268166,0.00007968457,8.2897617e-7,0.000017597711,0.000011272146,0.0004901296,0.000057143396,0.00026733766,0.70124406,0.000060814044,0.29767713],"study_design_scores_gemma":[0.00013195511,0.0002065984,0.001861941,0.00012607398,0.000008076434,0.00007256969,0.0014300287,0.7343075,0.05406854,0.20016217,0.006965105,0.0006593964],"about_ca_topic_score_codex":0.00005947501,"about_ca_topic_score_gemma":0.00027747787,"teacher_disagreement_score":0.96342283,"about_ca_system_score_codex":0.00010518101,"about_ca_system_score_gemma":0.00014396015,"threshold_uncertainty_score":0.9999373},"labels":[],"label_agreement":null},{"id":"W1966910741","doi":"","title":"Semi-supervised learning of visual classifiers from web images and text","year":2009,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Discriminative model; Artificial intelligence; Generative model; Machine learning; Probabilistic logic; Object (grammar); Image (mathematics); Visualization; Generative grammar; Supervised learning; Information retrieval; Pattern recognition (psychology); Artificial neural network","score_opus":0.06446601243891999,"score_gpt":0.32042794207065767,"score_spread":0.2559619296317377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966910741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031062659,0.000045227316,0.9514324,0.0068724304,0.00031069032,0.0001555048,0.000014211377,0.00023257823,0.00987427],"genre_scores_gemma":[0.9912582,0.00025025156,0.0078095286,0.00034822072,0.000078407,0.0000072310245,0.0000106765865,0.000006540463,0.00023093176],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981703,0.00008751093,0.0005490849,0.0004911895,0.0004999442,0.00020196968],"domain_scores_gemma":[0.9988271,0.00014726807,0.00023876163,0.00024975184,0.00043609468,0.00010102449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025908835,0.00019172668,0.00022763984,0.00023090366,0.000092953924,0.00028540718,0.00070146774,0.00009369421,0.00022774586],"category_scores_gemma":[0.00026932493,0.00017993836,0.00008272263,0.00024312518,0.00017582998,0.0004478411,0.00011985324,0.00029764528,0.00009034667],"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.000030473107,0.00011825332,0.00006762072,0.0000021941914,0.000012379362,0.0000055295936,0.00023948208,0.0000130541885,0.24875824,0.27794006,0.000042305724,0.4727704],"study_design_scores_gemma":[0.00004090919,0.00029947405,0.0014809571,0.0000929468,0.000004449922,0.0000038952344,0.00027344393,0.30413318,0.61994886,0.07312359,0.00039338396,0.00020493011],"about_ca_topic_score_codex":0.00004555601,"about_ca_topic_score_gemma":0.0000032491787,"teacher_disagreement_score":0.96019554,"about_ca_system_score_codex":0.000050001046,"about_ca_system_score_gemma":0.000106038984,"threshold_uncertainty_score":0.7337674},"labels":[],"label_agreement":null},{"id":"W22480628","doi":"10.1016/j.pec.2012.03.005","title":"Belief change based on global minimisation","year":2007,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Bundesministerium für Bildung und Forschung","keywords":"Minimisation (clinical trials); Locality; Computer science; Mathematics; Theoretical computer science; Mathematical optimization","score_opus":0.16717372049550958,"score_gpt":0.344579529904238,"score_spread":0.17740580940872844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W22480628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056476407,0.000010378519,0.86388797,0.006238953,0.0029415747,0.00027480363,0.000014575261,0.00023127961,0.12075284],"genre_scores_gemma":[0.9909049,0.000012302788,0.005505493,0.0027870908,0.0005635616,0.000030261686,0.000017155178,0.000009342148,0.00016984642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974152,0.00006621016,0.00056124775,0.0006837253,0.000832991,0.00044066104],"domain_scores_gemma":[0.998362,0.00019640978,0.00022671543,0.00049621693,0.0005227006,0.00019597035],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007418838,0.00027484138,0.00020066834,0.00025509976,0.0001499759,0.00034726813,0.0012221404,0.00013314158,0.00039543898],"category_scores_gemma":[0.00037667403,0.00025481576,0.00013871903,0.00039769107,0.000117134994,0.00037653188,0.00014604944,0.00023580094,0.0016575019],"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.000059178376,0.00026479273,0.00022637295,0.0000027743324,0.000008555345,0.00003134916,0.00029739915,0.00012997919,0.00030060962,0.7130979,0.00013195374,0.28544915],"study_design_scores_gemma":[0.00016607296,0.00088954373,0.0140374955,0.0002576836,0.000009165922,0.000020750635,0.0002354219,0.69704235,0.06167292,0.2196566,0.0052199475,0.00079203496],"about_ca_topic_score_codex":0.00010732518,"about_ca_topic_score_gemma":0.0002401351,"teacher_disagreement_score":0.9852573,"about_ca_system_score_codex":0.0003134819,"about_ca_system_score_gemma":0.0001429497,"threshold_uncertainty_score":0.9999904},"labels":[],"label_agreement":null},{"id":"W2248999929","doi":"","title":"A reputation management approach for resource constrained trustee agents","year":2013,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Access Control and Trust","field":"Social Sciences","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Reputation; Reputation management; Computer science; Constraint (computer-aided design); Control (management); Work (physics); Trust management (information system); Resource (disambiguation); Computer security; Resource management (computing); Risk analysis (engineering); Multi-agent system; Business; Distributed computing; Law; Engineering; Computer network","score_opus":0.14504719264228824,"score_gpt":0.3607568540229891,"score_spread":0.21570966138070088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2248999929","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057624886,0.0000071342747,0.43576932,0.0091512725,0.00070840615,0.0017179104,0.000029446323,0.00015631417,0.54669774],"genre_scores_gemma":[0.98811907,0.000027787002,0.0065805325,0.0007875913,0.00035195393,0.0005089941,0.00006447635,0.000014238634,0.0035453795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978905,0.00010901154,0.0005229541,0.00046773464,0.000644657,0.00036519172],"domain_scores_gemma":[0.99877614,0.00014230076,0.00021900845,0.0001919161,0.00052654743,0.00014410555],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00055053935,0.00017649063,0.00018473726,0.00020252596,0.0004035771,0.0005408642,0.00056565396,0.00010155669,0.0022443845],"category_scores_gemma":[0.0003294468,0.00017157308,0.00012900744,0.00017532572,0.00031929548,0.00037380247,0.000061141,0.00014233227,0.00042244635],"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.000055932665,0.00014484985,0.000024750656,0.000007677401,0.000049584498,0.000002707344,0.0012529301,0.000453522,0.000092790324,0.75135386,0.0007573327,0.24580404],"study_design_scores_gemma":[0.00043591057,0.00025917165,0.0012069045,0.00016964898,0.00006630575,0.00000440072,0.046812735,0.3311746,0.0025561848,0.5745426,0.041841537,0.00093003665],"about_ca_topic_score_codex":0.00051777024,"about_ca_topic_score_gemma":0.00008406878,"teacher_disagreement_score":0.98235655,"about_ca_system_score_codex":0.00013972062,"about_ca_system_score_gemma":0.00008360676,"threshold_uncertainty_score":0.9986677},"labels":[],"label_agreement":null},{"id":"W2252001768","doi":"","title":"Decidable reasoning in a logic of limited belief with introspection and unknown individuals","year":2013,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decidability; Introspection; Semantics (computer science); Computer science; Identity (music); Artificial intelligence; Epistemology; Theoretical computer science; Programming language; Philosophy","score_opus":0.0531541692446631,"score_gpt":0.27813317067781607,"score_spread":0.22497900143315297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2252001768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44184026,0.00006891389,0.5230374,0.0027544377,0.00059808017,0.0006118528,0.0000047379112,0.00013905272,0.030945305],"genre_scores_gemma":[0.98609674,0.00006940783,0.013363728,0.00017010252,0.000060144976,0.00006228705,0.000004250152,0.000008249987,0.00016506373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981627,0.0000763924,0.0005332453,0.00051969656,0.00042142576,0.00028655853],"domain_scores_gemma":[0.99862677,0.00015841173,0.0002649706,0.0002859978,0.000562539,0.000101328835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003628388,0.00020570388,0.0002689308,0.00038558195,0.000073708026,0.00033828086,0.0006207709,0.00009262386,0.00026021033],"category_scores_gemma":[0.00036491375,0.00016670534,0.00004302531,0.00045167212,0.00017581166,0.0006013363,0.00021136258,0.00025394344,0.0001431117],"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.000021031019,0.00020736639,0.004141186,0.000006360149,0.000020367532,0.000007762031,0.0009901955,0.0002881999,0.0025120825,0.94110394,0.000027862492,0.05067367],"study_design_scores_gemma":[0.00027938778,0.001170341,0.056135222,0.0006869311,0.000011483066,0.00007063467,0.00071687,0.35062617,0.07656531,0.5127571,0.0003082844,0.0006722673],"about_ca_topic_score_codex":0.00040904077,"about_ca_topic_score_gemma":0.0004075158,"teacher_disagreement_score":0.5442565,"about_ca_system_score_codex":0.00007505698,"about_ca_system_score_gemma":0.00010952801,"threshold_uncertainty_score":0.6798047},"labels":[],"label_agreement":null},{"id":"W2259046930","doi":"","title":"Managing qualitative preferences and constraints in a dynamic environment","year":2013,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Mathematical optimization; Set (abstract data type); Preference; Constraint (computer-aided design); Optimization problem; Constraint satisfaction problem; Pareto principle; Current (fluid); Work (physics); Dynamic problem; Artificial intelligence; Mathematics; Engineering","score_opus":0.07761106500187302,"score_gpt":0.3239963777134457,"score_spread":0.24638531271157266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2259046930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033696152,0.0000113773995,0.9436737,0.011001692,0.00036216175,0.0003434465,0.0000063263187,0.00007281099,0.010832388],"genre_scores_gemma":[0.98500794,0.00018207952,0.014359382,0.00028278428,0.000013287309,0.000063975756,0.0000062667114,0.000005337765,0.00007895457],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983425,0.00012573748,0.00048026018,0.00048675723,0.00034565773,0.00021909755],"domain_scores_gemma":[0.99929917,0.0001509586,0.00014271495,0.00019806223,0.000115217656,0.000093867326],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00028761494,0.00017394764,0.00015802684,0.00031944484,0.00006456463,0.0003818624,0.00039056447,0.000057635043,0.0015342663],"category_scores_gemma":[0.00009423894,0.00017029337,0.000035697514,0.00013855803,0.00029677557,0.00062851503,0.00014116746,0.0002030302,0.00050596334],"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.0000048873944,0.00005093255,0.00009087025,0.0000027474457,0.000009693288,0.0000046706596,0.0027564655,0.00077219284,0.0009080418,0.40653622,0.000006336935,0.58885694],"study_design_scores_gemma":[0.000057796802,0.0000760671,0.0041594133,0.00009100187,0.0000016884502,0.000011596405,0.0040271436,0.56390905,0.0022590144,0.4251333,0.000027169659,0.00024677525],"about_ca_topic_score_codex":0.0001416967,"about_ca_topic_score_gemma":0.000106666586,"teacher_disagreement_score":0.95131177,"about_ca_system_score_codex":0.00010806624,"about_ca_system_score_gemma":0.00005217178,"threshold_uncertainty_score":0.99937844},"labels":[],"label_agreement":null},{"id":"W2263352300","doi":"10.5591/978-1-57735-516-8/ijcai11-110","title":"Real-time opponent modelling in trick-taking card games","year":2011,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","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":"Adversary; Computer science; Exploit; Adversarial system; Context (archaeology); Fictitious play; Combinatorial game theory; Simple (philosophy); Game play; Game theory; Artificial intelligence; Repeated game; Human–computer interaction; Computer security; Mathematical economics; Mathematics","score_opus":0.2449692563154638,"score_gpt":0.3325261987870742,"score_spread":0.08755694247161039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2263352300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062075824,0.000021692433,0.83459467,0.0015133353,0.0019527435,0.00047908735,0.0000113064825,0.00040110495,0.09895021],"genre_scores_gemma":[0.96146435,0.00023687613,0.03727798,0.00022822077,0.00019377348,0.000081761136,0.0000072771254,0.000033988374,0.0004757582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952331,0.00020329661,0.0015454288,0.0012087623,0.0010408878,0.000768533],"domain_scores_gemma":[0.9973853,0.00025337882,0.0006200561,0.00091072393,0.0005908036,0.00023970188],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009852044,0.00048039193,0.00049776444,0.00093666965,0.00014791293,0.00045804432,0.002619029,0.00020216838,0.0012077948],"category_scores_gemma":[0.00038863163,0.00048641663,0.00023408575,0.0007198203,0.000255443,0.0010206419,0.00047552018,0.00055509625,0.002619682],"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.000104335166,0.00042665075,0.0001659504,0.0000061642027,0.000036742553,0.0001645787,0.0049273977,0.01202999,0.007298515,0.7953526,0.000051998515,0.17943512],"study_design_scores_gemma":[0.000030282883,0.00015156876,0.0002867973,0.00018715358,0.000005422013,0.000016177244,0.0005324904,0.6917168,0.11344566,0.19300601,0.00013296025,0.0004887123],"about_ca_topic_score_codex":0.0018594611,"about_ca_topic_score_gemma":0.00016006695,"teacher_disagreement_score":0.89938855,"about_ca_system_score_codex":0.0003519108,"about_ca_system_score_gemma":0.00024947,"threshold_uncertainty_score":0.9997587},"labels":[],"label_agreement":null},{"id":"W2270172784","doi":"","title":"Reasoning about continuous uncertainty in the situation calculus","year":2013,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Formalism (music); Situation calculus; Computer science; Countable set; Action (physics); Theoretical computer science; Artificial intelligence; Calculus (dental); Algorithm; Mathematics; Discrete mathematics","score_opus":0.06629843824728475,"score_gpt":0.30250740203530324,"score_spread":0.23620896378801848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2270172784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09854816,0.00005937207,0.77595514,0.013651083,0.0022212344,0.00086126593,0.000005870737,0.00021892543,0.108478956],"genre_scores_gemma":[0.9966279,0.000038195943,0.0015179048,0.0010921542,0.00021891865,0.00013765007,0.000011321141,0.000008591591,0.00034731848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975001,0.00021392335,0.0006275567,0.0005734948,0.0006732631,0.0004116697],"domain_scores_gemma":[0.99827117,0.00028454865,0.00023038294,0.0005159221,0.0006046307,0.000093342285],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007886696,0.00024357838,0.00022707366,0.00022535886,0.00016309935,0.0009426313,0.0018025002,0.00010350204,0.000517251],"category_scores_gemma":[0.000717354,0.00017784645,0.00011314411,0.00039735084,0.0001451225,0.0006205116,0.00018837868,0.00040295118,0.0019081099],"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.00000892358,0.00014206873,0.00013556248,0.000002181813,0.000009647106,0.000018151955,0.0027662397,0.0007965435,0.0008800155,0.82345796,0.00031729962,0.17146543],"study_design_scores_gemma":[0.000078121775,0.00016232689,0.006314888,0.00014956847,0.000004263619,0.000030661355,0.0015228457,0.7642715,0.0047369944,0.22139332,0.00096719584,0.0003683133],"about_ca_topic_score_codex":0.0011514943,"about_ca_topic_score_gemma":0.0005943179,"teacher_disagreement_score":0.8980798,"about_ca_system_score_codex":0.00015344129,"about_ca_system_score_gemma":0.00014207953,"threshold_uncertainty_score":0.998869},"labels":[],"label_agreement":null},{"id":"W2294581381","doi":"10.5591/978-1-57735-516-8/ijcai11-027","title":"Social distance games","year":2011,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Closeness; Stability (learning theory); Computer science; Context (archaeology); Mathematical economics; Transferable utility; Perspective (graphical); Social Welfare; Measure (data warehouse); Microeconomics; Game theory; Economics; Mathematics; Artificial intelligence; Machine learning; Data mining","score_opus":0.29650249167878373,"score_gpt":0.30827838519997025,"score_spread":0.01177589352118652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294581381","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071178496,0.00006163119,0.1987492,0.0024728326,0.003150084,0.0002758963,0.00014865454,0.00019297002,0.72377026],"genre_scores_gemma":[0.9969404,0.00001757983,0.00038955305,0.00026929975,0.00032793885,0.00002981597,0.0000095195655,0.000018747292,0.0019971563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829566,0.00003322663,0.00082277996,0.0004712616,0.000100101664,0.0002769502],"domain_scores_gemma":[0.9991406,0.00003775931,0.00039702692,0.0002269748,0.00012497547,0.00007266312],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00056586,0.00018721462,0.00029167713,0.00020419074,0.00012979534,0.0001235534,0.0005274612,0.0000948631,0.004410337],"category_scores_gemma":[0.00019985971,0.00020897428,0.00014350971,0.00013924927,0.00018218343,0.00020311047,0.00006107517,0.00021854209,0.0058866628],"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.00006472734,0.00015041984,0.00066024764,0.000005514214,0.00003297793,0.000008158385,0.0020311137,0.0000076055226,0.00013220299,0.9886453,0.00017398784,0.008087745],"study_design_scores_gemma":[0.00003863238,0.00008824821,0.0022489326,0.000049921175,0.0000025852548,0.0000051972797,0.0005957379,0.0038785157,0.007577054,0.97955304,0.005640057,0.00032210108],"about_ca_topic_score_codex":0.00014871942,"about_ca_topic_score_gemma":0.000033025593,"teacher_disagreement_score":0.9257619,"about_ca_system_score_codex":0.00008358472,"about_ca_system_score_gemma":0.000019422565,"threshold_uncertainty_score":0.9964998},"labels":[],"label_agreement":null},{"id":"W2295501631","doi":"","title":"Inapproximability of Treewidth and Related Problems (Extended Abstract)","year":2015,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Treewidth; Partial k-tree; Pathwidth; Tree-depth; Tree decomposition; Graphical model; Combinatorics; Mathematics; 1-planar graph; Discrete mathematics; Computer science; Chordal graph; Graph; Artificial intelligence; Line graph","score_opus":0.16535067389067262,"score_gpt":0.35472622906176576,"score_spread":0.18937555517109314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295501631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21883625,0.000099808625,0.7023021,0.008250425,0.0015838965,0.0009709318,0.000032555305,0.00032011815,0.06760392],"genre_scores_gemma":[0.99310637,0.000029353001,0.006566548,0.000046693254,0.000025012336,0.000025658208,0.0000048090483,0.000009039332,0.00018652702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99757034,0.00010617359,0.0006978919,0.00058250787,0.00076384784,0.00027924255],"domain_scores_gemma":[0.99792737,0.0001779168,0.00025667468,0.0005239302,0.0009011194,0.00021299203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001124024,0.00018889137,0.00024487491,0.00029440477,0.00005463566,0.00015068126,0.0010366781,0.00008882886,0.00012697937],"category_scores_gemma":[0.0008228947,0.0001726524,0.000070155256,0.0003718101,0.00045577277,0.0005793126,0.00034434674,0.00033780953,0.00011548934],"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.000049753777,0.00022976918,0.00008987402,0.000009289079,0.000021296426,0.000009180439,0.0008797866,0.00043544458,0.0044847243,0.8289623,0.000013597639,0.16481493],"study_design_scores_gemma":[0.000074759635,0.0002740962,0.0012139172,0.000069840156,0.0000021225092,0.000018884974,0.00027118396,0.08130623,0.037701037,0.8788021,0.00009201463,0.00017382776],"about_ca_topic_score_codex":0.000059971127,"about_ca_topic_score_gemma":0.000028537308,"teacher_disagreement_score":0.7742701,"about_ca_system_score_codex":0.00009338659,"about_ca_system_score_gemma":0.00020279009,"threshold_uncertainty_score":0.7040561},"labels":[],"label_agreement":null},{"id":"W2296519941","doi":"","title":"Algorithm Runtime Prediction: Methods & Evaluation (Extended Abstract) .","year":2015,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Machine Learning and Data Classification","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 British Columbia","funders":"","keywords":"Computer science; Parameterized complexity; Generalization; Variety (cybernetics); Range (aeronautics); Machine learning; Function (biology); Theoretical computer science; Algorithm; Artificial intelligence; Mathematics","score_opus":0.2681916611656205,"score_gpt":0.43264301858162785,"score_spread":0.16445135741600736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296519941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043962305,0.000028274497,0.9565379,0.0069845137,0.0031217712,0.0002606417,0.000028203862,0.00028657741,0.032312475],"genre_scores_gemma":[0.72182304,0.000028834766,0.2765426,0.0003952766,0.00047013105,0.00009085424,0.0001591731,0.000014921432,0.000475142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966967,0.00031273303,0.0007045674,0.00072833383,0.0012880034,0.00026964964],"domain_scores_gemma":[0.99717796,0.00014222335,0.0003206203,0.00069387775,0.0014397582,0.00022555095],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0029767833,0.00023105173,0.00019718353,0.00031168546,0.00013076665,0.0006038336,0.0011924235,0.000113425405,0.00056803174],"category_scores_gemma":[0.0011825362,0.00022215869,0.000088181674,0.00032738436,0.000097508484,0.0008525073,0.00020420048,0.00039231076,0.0014494521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013732694,0.000101954465,0.000010356962,0.0000013300329,0.000019006378,0.0000038341755,0.0003244117,0.0006216734,0.0014693579,0.25424862,0.0003083937,0.7428773],"study_design_scores_gemma":[0.0000666844,0.00012955698,0.001479823,0.00003408179,0.00000911847,0.000017653241,0.00021344954,0.8051662,0.011247325,0.17668328,0.004755273,0.00019759116],"about_ca_topic_score_codex":0.000102512065,"about_ca_topic_score_gemma":0.000013371724,"teacher_disagreement_score":0.8045445,"about_ca_system_score_codex":0.00025197858,"about_ca_system_score_gemma":0.0003925968,"threshold_uncertainty_score":0.999328},"labels":[],"label_agreement":null},{"id":"W23186342","doi":"10.1021/ac3032146","title":"Exchanging reputation information between communities: a payment-function approach","year":2009,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","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 Waterloo","funders":"","keywords":"Reputation; Payment; Function (biology); Honesty; Information exchange; Business; Computer science; Multi-agent system; Focus (optics); Internet privacy; Finance; Telecommunications","score_opus":0.30990196919434077,"score_gpt":0.4082486194065966,"score_spread":0.09834665021225586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W23186342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024594205,0.0000030787726,0.91787064,0.005255137,0.0005481012,0.00030316025,0.0000422427,0.000137998,0.051245436],"genre_scores_gemma":[0.99640375,0.00001154288,0.0014207668,0.0012136847,0.00028143125,0.00004865642,0.00019809528,0.0000060819702,0.00041598055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99674934,0.00021125608,0.0011975734,0.00032053285,0.0012840789,0.00023723282],"domain_scores_gemma":[0.99742454,0.0003872836,0.00057273905,0.00052400713,0.0009800531,0.00011137257],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001858647,0.00020235668,0.00023438197,0.0006727452,0.00039808842,0.00082822394,0.00082826975,0.00010653637,0.0013250826],"category_scores_gemma":[0.0006865312,0.00017845121,0.00013324592,0.0006275989,0.00013832837,0.0014625397,0.00007424294,0.00031685855,0.0021638463],"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.000053718428,0.000078730714,0.00004883939,8.816321e-7,0.0000116222855,2.405897e-7,0.0015286288,0.0025659222,0.0002380804,0.567913,0.00022468259,0.42733565],"study_design_scores_gemma":[0.00005348863,0.00019995151,0.0024162568,0.00003780572,0.000012418307,0.000006195659,0.014167125,0.08572444,0.00455056,0.88680506,0.0057697003,0.00025696532],"about_ca_topic_score_codex":0.000044320983,"about_ca_topic_score_gemma":0.000007969428,"teacher_disagreement_score":0.97180957,"about_ca_system_score_codex":0.00011735485,"about_ca_system_score_gemma":0.000066770954,"threshold_uncertainty_score":0.99958783},"labels":[],"label_agreement":null},{"id":"W2397154267","doi":"","title":"User-centered programming by demonstration: stylistic elements of behavior","year":2013,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Interactive and Immersive Displays","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Manitoba","funders":"","keywords":"Computer science; Robot; Human–computer interaction; Style (visual arts); Programming by demonstration; User interface; Programming style; Space (punctuation); Event-driven programming; Programming language; Artificial intelligence; Multimedia; Inductive programming; Programming paradigm; Reactive programming","score_opus":0.08267086075308659,"score_gpt":0.32933027098529066,"score_spread":0.24665941023220406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397154267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09017196,0.000011040204,0.89644814,0.0018828438,0.0011870227,0.0007458137,0.00004692164,0.000047668902,0.009458613],"genre_scores_gemma":[0.9920086,0.00001264587,0.0071463264,0.00028888514,0.000045375204,0.0001508664,0.000042930944,0.000009642264,0.00029470774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978174,0.00006498588,0.0007735976,0.00046869658,0.00057242555,0.00030289544],"domain_scores_gemma":[0.9981634,0.00007675397,0.0003667675,0.00033991082,0.00094502425,0.000108132284],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015594557,0.0002155572,0.0002038024,0.00018488213,0.00008758638,0.00035649276,0.0010357762,0.000065577566,0.0012669825],"category_scores_gemma":[0.00013862879,0.00020880798,0.00011681732,0.00018637469,0.00012663145,0.00089002744,0.00016743454,0.00020406094,0.00075873866],"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.000026581525,0.0008081284,0.0008779806,0.000007824433,0.00006018381,0.000009842221,0.00028931015,0.000016867429,0.25760818,0.54893076,0.00090325176,0.1904611],"study_design_scores_gemma":[0.00016079072,0.00078537,0.006244988,0.0002684133,0.000025289719,0.000021633028,0.0013202926,0.071796484,0.90158933,0.0149196135,0.002199784,0.00066798116],"about_ca_topic_score_codex":0.00019160144,"about_ca_topic_score_gemma":0.000020348942,"teacher_disagreement_score":0.90183663,"about_ca_system_score_codex":0.00008913834,"about_ca_system_score_gemma":0.00008140307,"threshold_uncertainty_score":0.999646},"labels":[],"label_agreement":null},{"id":"W2397939602","doi":"","title":"Controlling the hypothesis space in probabilistic plan recognition","year":2013,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Université de Sherbrooke","funders":"","keywords":"Plan (archaeology); Computer science; Probabilistic logic; Heuristic; Sequence (biology); Artificial intelligence; Machine learning; Space (punctuation); Execution time; Combinatorial explosion; Theoretical computer science; Distributed computing; Mathematics","score_opus":0.15718557414285686,"score_gpt":0.2803320152353006,"score_spread":0.12314644109244374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397939602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14033565,0.000037821384,0.78517246,0.050670736,0.00171403,0.0011132064,0.000020873948,0.00027741652,0.020657783],"genre_scores_gemma":[0.9918261,0.000016777876,0.007022541,0.00074460375,0.000120496035,0.00013523742,0.000007173281,0.000009073153,0.00011799065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981062,0.00015958225,0.00052981783,0.00045582393,0.00042717427,0.00032142672],"domain_scores_gemma":[0.9982266,0.00082565605,0.00019294124,0.00034880533,0.00032833216,0.00007768502],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006136616,0.00019293402,0.00017943674,0.00021089667,0.00013896388,0.00063700805,0.0010059861,0.000076174416,0.0004665576],"category_scores_gemma":[0.00075267634,0.00014744853,0.000070757495,0.00025955235,0.00009902343,0.00042725372,0.0001024546,0.00036202435,0.0017370766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047038007,0.00017575402,0.00032314012,0.000010053693,0.000028148726,0.000024272633,0.0016682058,0.009021821,0.0032267938,0.5183826,0.0002785076,0.46681368],"study_design_scores_gemma":[0.000045498615,0.00008385615,0.0011528118,0.00021027274,0.0000029597468,0.000009911255,0.00024981977,0.5564623,0.008012949,0.43342683,0.00012463203,0.000218168],"about_ca_topic_score_codex":0.0006613657,"about_ca_topic_score_gemma":0.00015051638,"teacher_disagreement_score":0.85149044,"about_ca_system_score_codex":0.0000983351,"about_ca_system_score_gemma":0.00010378726,"threshold_uncertainty_score":0.9990402},"labels":[],"label_agreement":null},{"id":"W2403069539","doi":"","title":"Learning finite Beta-Liouville mixture models via variational bayes for proportional data clustering","year":2013,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Cluster analysis; Mixture model; Expectation–maximization algorithm; Computer science; Inference; Bayesian inference; Artificial intelligence; Data point; Algorithm; Pattern recognition (psychology); Mathematics; Bayesian probability; Statistics","score_opus":0.16449539141737493,"score_gpt":0.3381483742376632,"score_spread":0.17365298282028827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403069539","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000100272635,0.000019929545,0.98223567,0.010017593,0.001334659,0.00061687746,0.00006869724,0.00016846255,0.0054378533],"genre_scores_gemma":[0.47794962,0.00003418637,0.51994324,0.00065148104,0.0004151943,0.00017388207,0.0002042199,0.000021712613,0.00060645404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996754,0.00013921676,0.0008359174,0.0010594432,0.0007741168,0.00043731232],"domain_scores_gemma":[0.9972303,0.00042553415,0.0003643329,0.00076920487,0.0010350721,0.0001755645],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008707523,0.00032550437,0.0003017624,0.00027431978,0.000286276,0.0007748762,0.0021579207,0.0001597832,0.0006954233],"category_scores_gemma":[0.00033508817,0.00029981398,0.00013819637,0.00022402084,0.00009877857,0.0018108032,0.00070754386,0.00043404388,0.00027173755],"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.000022182328,0.00011126537,0.0000055145624,0.000009151901,0.000057055604,0.0000033966264,0.00027744833,0.020418456,0.001572972,0.70960426,0.0004646308,0.26745364],"study_design_scores_gemma":[0.00003651711,0.0000807416,0.000030019217,0.000038565035,0.000005747712,0.000008900915,0.000024180961,0.5929768,0.0017217826,0.404358,0.0005073812,0.00021132799],"about_ca_topic_score_codex":0.00010880064,"about_ca_topic_score_gemma":0.000034069155,"teacher_disagreement_score":0.5725584,"about_ca_system_score_codex":0.000087304354,"about_ca_system_score_gemma":0.00022459369,"threshold_uncertainty_score":0.9999454},"labels":[],"label_agreement":null},{"id":"W2403928778","doi":"","title":"A rational extension of stable model semantics to the full propositional language","year":2013,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","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":"Simon Fraser University","funders":"","keywords":"Semantics (computer science); Stable model semantics; Computer science; Extension (predicate logic); Answer set programming; Well-founded semantics; Rationality; Non-monotonic logic; Monotonic function; Operational semantics; Programming language; Theoretical computer science; Computational semantics; Circumscription; Set (abstract data type); Denotational semantics; Mathematics; Epistemology; Philosophy","score_opus":0.07772773533962261,"score_gpt":0.3044125092816972,"score_spread":0.2266847739420746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403928778","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035262365,0.000014560649,0.9412017,0.014989657,0.00061755005,0.0004084317,0.000018590637,0.00006380249,0.0074233385],"genre_scores_gemma":[0.97747546,0.000010039287,0.020761376,0.0007166153,0.00015536275,0.000068818306,0.000013999669,0.00000801322,0.00079028565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980678,0.00006202807,0.0004883164,0.00042489872,0.0007082763,0.00024868784],"domain_scores_gemma":[0.9980241,0.00011526687,0.00017490365,0.0004333326,0.0011430171,0.0001093441],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000340742,0.00017476198,0.00016999048,0.00016595585,0.00013942449,0.00030716273,0.0011002077,0.00005932721,0.00055296917],"category_scores_gemma":[0.00027568638,0.00012492388,0.000094143186,0.00023801465,0.000103468985,0.00040299844,0.00030009827,0.00018681631,0.0012574784],"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.000022214528,0.0001818607,0.000009048803,0.00000447522,0.000016382734,0.0000036133317,0.0014781869,0.011753139,0.05158342,0.91012275,0.0010091787,0.023815718],"study_design_scores_gemma":[0.0000237147,0.00012051696,0.00020382433,0.000059044778,0.0000030974113,0.000011501245,0.00023500736,0.82640016,0.059401583,0.11327677,0.00011633788,0.00014842807],"about_ca_topic_score_codex":0.00011214361,"about_ca_topic_score_gemma":0.00009035621,"teacher_disagreement_score":0.9422131,"about_ca_system_score_codex":0.00006828467,"about_ca_system_score_gemma":0.0002212288,"threshold_uncertainty_score":0.9995202},"labels":[],"label_agreement":null},{"id":"W2463032555","doi":"","title":"A characterization of voting power for discrete weight distributions","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Voting; Shapley value; Power index; Mathematical economics; Power (physics); Value (mathematics); Weighted voting; Mathematical optimization; Game theory; Mathematics; Computer science; Statistics","score_opus":0.10296346771578477,"score_gpt":0.28766885548812776,"score_spread":0.184705387772343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2463032555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18295673,0.0000051860293,0.80680317,0.0030406162,0.001190253,0.00022571847,0.0011341955,0.000032694614,0.0046114717],"genre_scores_gemma":[0.9987535,0.0000127714775,0.0002775246,0.00005118835,0.00015217086,0.000031286916,0.000050334493,0.000012813457,0.0006584262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853784,0.000021260126,0.0008568454,0.00032451388,0.000068351845,0.00019119591],"domain_scores_gemma":[0.9988352,0.00015882013,0.0005554012,0.00017754329,0.00022155783,0.000051491264],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000514103,0.00012861821,0.0002468209,0.00016782816,0.00007024599,0.000050945528,0.00027822168,0.000067237655,0.00096880744],"category_scores_gemma":[0.0007327356,0.000110172994,0.00013256195,0.00009494438,0.00010807869,0.00019180361,0.00003807433,0.00006151639,0.00041407932],"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.000056805296,0.000055074055,0.00048430913,0.0000068484974,0.00002844204,4.4695526e-7,0.00013927724,0.0000037050472,0.056928214,0.9362942,0.000009582681,0.005993109],"study_design_scores_gemma":[0.00014456426,0.00025391957,0.0031597402,0.00043012647,0.0000064216324,0.00000438595,0.000107462765,0.009359915,0.30802697,0.6734083,0.0047037923,0.00039438132],"about_ca_topic_score_codex":0.00001784712,"about_ca_topic_score_gemma":0.0000074363766,"teacher_disagreement_score":0.8157968,"about_ca_system_score_codex":0.000072711424,"about_ca_system_score_gemma":0.000020631334,"threshold_uncertainty_score":0.99994445},"labels":[],"label_agreement":null},{"id":"W2464078358","doi":"","title":"Misrepresentation in district voting","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Misrepresentation; Probabilistic logic; Voting; Representation (politics); Computer science; Accountability; Political science; Law; Artificial intelligence; Politics","score_opus":0.18653050512844216,"score_gpt":0.3116819358125312,"score_spread":0.12515143068408902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2464078358","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61327446,0.000042371375,0.2360239,0.015272405,0.0038053566,0.00037340625,0.00014764651,0.00012654196,0.13093391],"genre_scores_gemma":[0.99706405,0.000025075895,0.00011012206,0.00012473481,0.00018871814,0.000024754447,0.000004516953,0.000011508119,0.0024465434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831426,0.000042075513,0.0008643875,0.0004272041,0.000101530815,0.000250558],"domain_scores_gemma":[0.9990827,0.0002107112,0.0003753851,0.00018539054,0.00008776997,0.000058088128],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008510279,0.00013449593,0.00022101418,0.00030965227,0.000041343377,0.00010872031,0.00033203932,0.00007569629,0.0020142954],"category_scores_gemma":[0.001039816,0.00012022652,0.00008104258,0.00016395809,0.000053733915,0.00022595169,0.000048671125,0.00012716526,0.004469774],"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.000037419257,0.00008212128,0.01737784,0.0000035994153,0.000013595065,0.000007533857,0.00017470015,0.000096308504,0.0016084913,0.95462567,0.00005555581,0.025917172],"study_design_scores_gemma":[0.00020348982,0.0001313705,0.021226212,0.00045372924,0.000002591526,0.000009644879,0.00040357272,0.019118268,0.033406246,0.92107683,0.0033962973,0.0005717242],"about_ca_topic_score_codex":0.0002211153,"about_ca_topic_score_gemma":0.00008587714,"teacher_disagreement_score":0.38378957,"about_ca_system_score_codex":0.0002520532,"about_ca_system_score_gemma":0.000016673363,"threshold_uncertainty_score":0.99889797},"labels":[],"label_agreement":null},{"id":"W2571941834","doi":"","title":"Generalized dictionary for multitask learning with boosting","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Multi-task learning; Artificial intelligence; Computer science; Boosting (machine learning); Machine learning; Gradient boosting; Feature learning; Task (project management)","score_opus":0.09497000881405422,"score_gpt":0.2954169608255133,"score_spread":0.20044695201145907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571941834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08366203,0.000015615511,0.90768754,0.0011120059,0.0006756835,0.0002458238,0.000022109347,0.00076454517,0.0058146487],"genre_scores_gemma":[0.9902973,0.00007009537,0.00895857,0.00008041173,0.00022674685,0.00006445299,0.000010786457,0.000029163768,0.00026244114],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99903554,0.000019738454,0.00028236667,0.00024322372,0.00021603594,0.00020309494],"domain_scores_gemma":[0.9993133,0.00014744255,0.00006460074,0.0001335714,0.00028716394,0.000053902448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001017745,0.00016501633,0.00013707731,0.00013117194,0.00008556837,0.0000722499,0.00018546204,0.000056035213,0.0001934104],"category_scores_gemma":[0.00013042103,0.00011862265,0.000059855025,0.00006048206,0.000072877236,0.00014025668,0.000026543084,0.00011980191,0.00008723859],"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.00022533808,0.000061976476,0.00021091884,0.000007204769,0.00011116199,0.000017843848,0.0001541791,0.023578515,0.33633664,0.24504094,0.00058554235,0.39366972],"study_design_scores_gemma":[0.000106525185,0.0002284003,0.00013925757,0.000470355,0.000011426189,0.000017166503,0.000118116994,0.31527758,0.6440959,0.03521937,0.003956771,0.0003591313],"about_ca_topic_score_codex":0.000021119482,"about_ca_topic_score_gemma":0.000027462234,"teacher_disagreement_score":0.9066353,"about_ca_system_score_codex":0.00007865428,"about_ca_system_score_gemma":0.000022384142,"threshold_uncertainty_score":0.48372915},"labels":[],"label_agreement":null},{"id":"W2572009727","doi":"","title":"Bias in algorithm portfolio performance evaluation","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","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 British Columbia","funders":"","keywords":"Solver; Computer science; Portfolio; Measure (data warehouse); Algorithm; Data mining","score_opus":0.17519415168197777,"score_gpt":0.33823255301065713,"score_spread":0.16303840132867936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572009727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028561095,0.0000050657904,0.94711185,0.0062776553,0.001549397,0.0002776771,0.00000785618,0.00011856781,0.016090838],"genre_scores_gemma":[0.9868424,0.00013011915,0.012304599,0.00029225962,0.000095195704,0.000054157183,0.0000068555746,0.000007913838,0.00026653084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976629,0.00011164324,0.0006214669,0.0005208,0.00082393974,0.00025927357],"domain_scores_gemma":[0.9986564,0.00011763447,0.00020438322,0.00034947545,0.00058315595,0.000088978566],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00087113975,0.00018240724,0.00015382092,0.00050709175,0.00006708644,0.00019912305,0.00061740074,0.000079268706,0.0019926638],"category_scores_gemma":[0.0003402191,0.00014436877,0.00006436353,0.00036553232,0.00009369105,0.00088064664,0.00010643717,0.00014543961,0.00080886146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010231851,0.000059778125,0.00054999115,7.454846e-7,0.0000060634015,0.000005272578,0.00010177889,0.00076988037,0.00091168354,0.1836926,0.000032330532,0.81385964],"study_design_scores_gemma":[0.00012842647,0.00009744522,0.009628385,0.00017656143,0.000002857879,0.000017786593,0.00007107798,0.9181352,0.03321419,0.037882235,0.0003664859,0.0002792939],"about_ca_topic_score_codex":0.000032037584,"about_ca_topic_score_gemma":0.00006112862,"teacher_disagreement_score":0.9582813,"about_ca_system_score_codex":0.00028377853,"about_ca_system_score_gemma":0.00023981497,"threshold_uncertainty_score":0.9999691},"labels":[],"label_agreement":null},{"id":"W2572180797","doi":"","title":"Location-based activity recognition with hierarchical dirichlet process","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Human Mobility and Location-Based Analysis","field":"Social Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Hierarchical Dirichlet process; Latent Dirichlet allocation; Probabilistic logic; Construct (python library); Cluster analysis; Data mining; Process (computing); Mobility model; Hierarchical clustering; Artificial intelligence; Machine learning; Dirichlet process; Topic model; Pattern recognition (psychology); Distributed computing; Bayesian probability; Computer network","score_opus":0.12675467097117354,"score_gpt":0.36219032971900494,"score_spread":0.2354356587478314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572180797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23856513,0.000003850681,0.6953053,0.046167985,0.00036761086,0.00044584283,0.000043640895,0.00020043348,0.018900197],"genre_scores_gemma":[0.99845,0.000017356257,0.00024590644,0.00045024703,0.00029499238,0.00011318235,0.000019781266,0.000012203965,0.00039636294],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759775,0.00027035887,0.00037020133,0.0005212344,0.00093492534,0.00030549758],"domain_scores_gemma":[0.9974602,0.0004936414,0.00020428094,0.0002491906,0.0014148697,0.00017782724],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007341249,0.0001815056,0.00018309869,0.00026431412,0.00040155803,0.00019915981,0.00043633653,0.000109862944,0.003561274],"category_scores_gemma":[0.0011223397,0.0001329915,0.00008309577,0.00046596935,0.0007600514,0.00033502435,0.000017102151,0.00020018921,0.00085166196],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004659751,0.00073317304,0.00077953644,0.000017384811,0.00006015845,0.000008771368,0.001824175,0.0009814554,0.0019780286,0.16089998,0.000041635445,0.8322097],"study_design_scores_gemma":[0.00061976316,0.0012544857,0.00788914,0.0027038772,0.00015402818,0.0000044363933,0.007763486,0.0967832,0.2421166,0.63392216,0.004417611,0.0023712274],"about_ca_topic_score_codex":0.0013440598,"about_ca_topic_score_gemma":0.00897121,"teacher_disagreement_score":0.8298385,"about_ca_system_score_codex":0.00028260992,"about_ca_system_score_gemma":0.00089093705,"threshold_uncertainty_score":0.99992627},"labels":[],"label_agreement":null},{"id":"W2572497595","doi":"","title":"Grammar Induction as Automated Transformation between Constraint Solving Models of Language.","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Transformation (genetics); Programming language; Grammar; Natural language processing; Model transformation; Constraint (computer-aided design); Artificial intelligence; Linguistics; Mathematics; Philosophy; Chemistry","score_opus":0.08747857146460501,"score_gpt":0.3393896233222696,"score_spread":0.25191105185766455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572497595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031617846,0.00002361314,0.9597941,0.004483047,0.0003885872,0.00020345353,0.000022826442,0.000817447,0.0026490944],"genre_scores_gemma":[0.9554491,0.000025272146,0.044267815,0.00009701099,0.00008105086,0.000017476308,0.000009967709,0.000009826668,0.000042493484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99800175,0.00007524278,0.000693248,0.0003880239,0.00060225086,0.00023948913],"domain_scores_gemma":[0.99857944,0.00013629414,0.00032511976,0.00032116025,0.0005555433,0.00008242111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004386167,0.00019482388,0.00022118683,0.00036294712,0.0000698996,0.00016548015,0.00094390905,0.00012692591,0.0001227428],"category_scores_gemma":[0.00026368932,0.00014654374,0.00009256931,0.0002494306,0.00017766679,0.0012398342,0.000111452006,0.0001906477,0.000104692925],"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.000011302802,0.000029831128,0.0000044714825,0.0000058880782,0.000014499373,0.0000043821474,0.0009551819,0.000038062706,0.07213301,0.5623885,0.0000113148435,0.3644036],"study_design_scores_gemma":[0.0000320838,0.00008966259,0.000020050973,0.00025716468,0.0000039581764,0.000011791459,0.00020243225,0.08362626,0.52031255,0.39527926,0.000011751355,0.00015300204],"about_ca_topic_score_codex":0.00015095096,"about_ca_topic_score_gemma":0.000016182963,"teacher_disagreement_score":0.9238312,"about_ca_system_score_codex":0.00013163227,"about_ca_system_score_gemma":0.00014724901,"threshold_uncertainty_score":0.597588},"labels":[],"label_agreement":null},{"id":"W2573425638","doi":"","title":"Distraction-based neural networks for modeling documents","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Automatic summarization; Computer science; Distraction; GRASP; Artificial neural network; Representation (politics); Artificial intelligence; Natural language processing; Traverse; Information retrieval; Machine learning; Programming language","score_opus":0.1398677867114096,"score_gpt":0.34046305885792866,"score_spread":0.20059527214651907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573425638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054573175,0.000005052526,0.97992796,0.010933317,0.0023865735,0.0002496396,0.000011819025,0.00015588416,0.0008724429],"genre_scores_gemma":[0.9827872,0.000009129488,0.016085437,0.0005505535,0.0003199113,0.000082704275,0.000006687403,0.000012411239,0.00014595148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797136,0.00004021625,0.00057466084,0.0006239751,0.00044597135,0.00034380585],"domain_scores_gemma":[0.99857914,0.0002374888,0.00016611248,0.0004440826,0.00045710435,0.000116073395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031154373,0.00020305566,0.00016299587,0.0001580984,0.0001299348,0.00034286792,0.0010436467,0.00008102733,0.00015316268],"category_scores_gemma":[0.00024223379,0.00015769558,0.00013607238,0.00010435103,0.000052729218,0.0005691026,0.00010630106,0.00014050721,0.00009468026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042271262,0.00006573751,0.000022939736,0.0000021949375,0.000012459286,0.000003574144,0.000029264049,0.21246387,0.0015308531,0.47315297,0.000022910777,0.31265098],"study_design_scores_gemma":[0.00006358532,0.00006938197,0.000010979529,0.00007660041,0.0000028629624,0.0000025636693,0.000017785651,0.9050566,0.00663205,0.08776002,0.00011478019,0.00019282232],"about_ca_topic_score_codex":0.00004760019,"about_ca_topic_score_gemma":0.000031732096,"teacher_disagreement_score":0.9773299,"about_ca_system_score_codex":0.00014957736,"about_ca_system_score_gemma":0.00008880372,"threshold_uncertainty_score":0.6430639},"labels":[],"label_agreement":null},{"id":"W2573939812","doi":"","title":"Object-relational queries over CFDI ∀- nc knowledge bases: OBDA for the SQL-literate","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"SQL; Computer science; Relational database; Conjunctive query; Relational calculus; Object (grammar); Description logic; Ontology; Programming language; Encoding (memory); Data access; Relational model; Theoretical computer science; Information retrieval; Artificial intelligence","score_opus":0.15778310146096042,"score_gpt":0.3445189898753088,"score_spread":0.1867358884143484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2573939812","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048883976,0.000088498025,0.96379596,0.017484795,0.0034511173,0.0003728262,0.000052085943,0.00017007039,0.009696261],"genre_scores_gemma":[0.99109656,0.00008487215,0.005385738,0.00079722924,0.00041915572,0.00014911458,0.0000066132616,0.000012781602,0.0020479192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785113,0.00008544521,0.00060853147,0.0006064519,0.00048030895,0.00036812626],"domain_scores_gemma":[0.99670357,0.0017380528,0.00021530181,0.0005437741,0.00071486505,0.00008444641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000534865,0.00026242624,0.00021592325,0.00017683311,0.00026997674,0.00043512936,0.0014197932,0.00009528284,0.00055997685],"category_scores_gemma":[0.00095671293,0.00015435851,0.00018540659,0.00019726287,0.00031463723,0.0006734377,0.00027211287,0.00015259428,0.00066776865],"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.00005655643,0.0000801306,0.00015395737,0.0000037925831,0.000040276627,0.000003862683,0.00046298603,0.000056682562,0.00245041,0.8221001,0.000795544,0.17379569],"study_design_scores_gemma":[0.00022950463,0.00033861471,0.0068024606,0.00038755368,0.00002075221,0.000024849374,0.0003939867,0.16194773,0.08758257,0.7059473,0.03564197,0.00068274274],"about_ca_topic_score_codex":0.00006374519,"about_ca_topic_score_gemma":0.00023105592,"teacher_disagreement_score":0.9862082,"about_ca_system_score_codex":0.00011986263,"about_ca_system_score_gemma":0.00027065337,"threshold_uncertainty_score":0.8583038},"labels":[],"label_agreement":null},{"id":"W2574075402","doi":"","title":"Predicting confusion in information visualization from eye tracking and interaction data","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":43,"is_retracted":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":"Confusion; Visualization; Computer science; Focus (optics); Human–computer interaction; Information visualization; Data visualization; Eye tracking; Random forest; User satisfaction; Tracking (education); Data science; Artificial intelligence; Psychology","score_opus":0.15658463720611557,"score_gpt":0.38932103142448754,"score_spread":0.23273639421837197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574075402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04679868,0.0000044704093,0.94706583,0.0037194972,0.0008735662,0.00013649804,0.000090960355,0.000107021566,0.0012034717],"genre_scores_gemma":[0.9973936,0.00016377578,0.0015910051,0.0004712204,0.0001001005,0.000006328521,0.00023921432,0.0000062336026,0.000028519547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981412,0.000083914296,0.00069708575,0.00045364883,0.00045277897,0.00017136137],"domain_scores_gemma":[0.99868923,0.00017050514,0.0002927083,0.0004662681,0.00030729792,0.00007398229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004431077,0.0001543582,0.00014455144,0.00037717787,0.000075624186,0.00063252554,0.0008946952,0.000074051066,0.00020899196],"category_scores_gemma":[0.00082499813,0.000126851,0.00002181222,0.00024176539,0.00006270061,0.004431931,0.00048259026,0.000119569006,0.0001892423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029666777,0.000079470796,0.0024198215,0.0000040028126,0.0000121658095,0.0000038217786,0.0008844788,0.0001109268,0.005402787,0.509456,0.000057370566,0.48153952],"study_design_scores_gemma":[0.000102556165,0.000049681767,0.0035980812,0.00039064488,0.0000037700902,0.0000026888874,0.00046630218,0.95390475,0.014160055,0.025739944,0.0013784325,0.00020312384],"about_ca_topic_score_codex":0.0002488962,"about_ca_topic_score_gemma":0.0002601773,"teacher_disagreement_score":0.9537938,"about_ca_system_score_codex":0.00009293894,"about_ca_system_score_gemma":0.00006629489,"threshold_uncertainty_score":0.60994583},"labels":[],"label_agreement":null},{"id":"W2574090101","doi":"","title":"Distance-preserving probabilistic embeddings with side information: variational Bayesian multidimensional scaling Gaussian process","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Gaussian Processes and Bayesian Inference","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Embedding; Markov chain Monte Carlo; Probabilistic logic; Leverage (statistics); Gaussian process; Dimensionality reduction; Bayesian probability; Artificial intelligence; Posterior probability; Nonlinear dimensionality reduction; Bayesian inference; Gaussian; Algorithm; Machine learning; Theoretical computer science","score_opus":0.0351644273836407,"score_gpt":0.2815418654416019,"score_spread":0.24637743805796122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574090101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024848308,0.00000459016,0.9704209,0.015452658,0.00065349817,0.00033946565,0.00003722179,0.00023518961,0.010371661],"genre_scores_gemma":[0.96038693,0.000011709496,0.038551856,0.0005783873,0.00017010771,0.00011171948,0.000018485189,0.000017078963,0.00015373067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99629927,0.00006718829,0.0009610059,0.00078259484,0.0013432704,0.000546693],"domain_scores_gemma":[0.9970297,0.0002675631,0.00051114225,0.00057957007,0.001346562,0.0002654121],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040099196,0.00041161405,0.0003045568,0.0003566334,0.00030401174,0.00077263947,0.0015785375,0.00012347891,0.00063398114],"category_scores_gemma":[0.0005691685,0.0002793027,0.00009631376,0.00051993656,0.00024805262,0.003125705,0.00026638128,0.0002836332,0.0004624376],"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.00010649062,0.00012958358,0.0001282508,0.000030274372,0.000034361314,0.000021619446,0.00072432816,0.0015823729,0.00068542,0.91205305,0.00004259109,0.08446164],"study_design_scores_gemma":[0.00023678107,0.0002688258,0.0013043743,0.0012924599,0.000012938401,0.000087764965,0.00035475596,0.4961033,0.017712943,0.48087484,0.0009022151,0.0008488018],"about_ca_topic_score_codex":0.000043468845,"about_ca_topic_score_gemma":0.000064735024,"teacher_disagreement_score":0.9579021,"about_ca_system_score_codex":0.00021504803,"about_ca_system_score_gemma":0.0005560268,"threshold_uncertainty_score":0.9999659},"labels":[],"label_agreement":null},{"id":"W2574227367","doi":"","title":"Monte Carlo tree search in continuous action spaces with execution uncertainty","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Monte Carlo tree search; Computer science; Set (abstract data type); Fidelity; Machine learning; Tree (set theory); Action (physics); Artificial intelligence; Monte Carlo method; Kernel (algebra); Domain (mathematical analysis); Mathematics","score_opus":0.1274409482000282,"score_gpt":0.3388143823562566,"score_spread":0.21137343415622842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574227367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3718368,0.0000178476,0.601288,0.017891854,0.0014635195,0.00054804585,0.000019009842,0.00029780157,0.006637093],"genre_scores_gemma":[0.9956497,0.00012334857,0.0029300272,0.00021790431,0.00020631216,0.00008645521,0.00000243487,0.000023482513,0.0007603215],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9960181,0.0002190041,0.0008817129,0.0010667698,0.0011495725,0.00066482887],"domain_scores_gemma":[0.99759185,0.00038198516,0.00028360565,0.0007176228,0.0008311545,0.00019377311],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007291627,0.000401137,0.00038125992,0.0006601332,0.00014001846,0.0005470954,0.0015783858,0.00016500337,0.00032415416],"category_scores_gemma":[0.00036307742,0.00028600477,0.00012204343,0.0006064886,0.00042074744,0.0012310094,0.00025155456,0.0003949125,0.00083562447],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002853809,0.00025823564,0.0007406359,0.00000517758,0.000032745975,0.000092534225,0.0010630996,0.0062762513,0.021385461,0.39940143,0.00006966415,0.5703894],"study_design_scores_gemma":[0.00025301625,0.0013431924,0.003553318,0.0011427678,0.000013847953,0.00008605075,0.003920529,0.39757094,0.49160445,0.09766763,0.0014981624,0.0013460903],"about_ca_topic_score_codex":0.0012228381,"about_ca_topic_score_gemma":0.003800967,"teacher_disagreement_score":0.6238129,"about_ca_system_score_codex":0.0005361977,"about_ca_system_score_gemma":0.0002856308,"threshold_uncertainty_score":0.99995923},"labels":[],"label_agreement":null},{"id":"W2574782009","doi":"","title":"Learning multi-step predictive state representations","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","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":"McGill University","funders":"","keywords":"Computer science; Exploit; Observable; Dynamical systems theory; Variety (cybernetics); Representation (politics); Artificial intelligence; Class (philosophy); Machine learning; State (computer science); Theoretical computer science; Algorithm","score_opus":0.12193993464212904,"score_gpt":0.3447195660178371,"score_spread":0.22277963137570805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574782009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014776732,0.0000026480466,0.97953874,0.0057551214,0.0013149991,0.0002265037,0.0000086412765,0.00032278194,0.011352892],"genre_scores_gemma":[0.9710233,0.000072644034,0.02271799,0.00021360413,0.000107029024,0.00004423832,0.0000064200926,0.00001659323,0.0057981396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736017,0.00015100921,0.00066644273,0.00066920556,0.00077471643,0.00037845015],"domain_scores_gemma":[0.9980032,0.00033422958,0.0003281471,0.0005048373,0.00068110204,0.00014850334],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038857656,0.00023441631,0.00018490564,0.0003049737,0.00018834912,0.0003983823,0.001265121,0.000068495654,0.00060145924],"category_scores_gemma":[0.0010625619,0.00018394043,0.000109439905,0.00025472112,0.00018624982,0.000796593,0.00036594478,0.0003201067,0.002005688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004867071,0.00012007224,0.0005680625,0.0000032769856,0.00007040185,0.00003267021,0.0011573411,0.1703261,0.00882121,0.5415319,0.00015504616,0.27716523],"study_design_scores_gemma":[0.00009579534,0.0003160192,0.0011195623,0.0001571621,0.0000044049993,0.000009683787,0.00027246133,0.9432174,0.034552436,0.018916197,0.0010360875,0.00030280827],"about_ca_topic_score_codex":0.00005760345,"about_ca_topic_score_gemma":0.000024945906,"teacher_disagreement_score":0.96954566,"about_ca_system_score_codex":0.00018392692,"about_ca_system_score_gemma":0.00013583172,"threshold_uncertainty_score":0.99877137},"labels":[],"label_agreement":null},{"id":"W2575147726","doi":"","title":"EBEK: exemplar-based kernel preserving embedding","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Advanced Image and Video Retrieval 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":"University of Waterloo","funders":"","keywords":"Computer science; Embedding; Kernel (algebra); Interpretability; Artificial intelligence; Basis (linear algebra); GRASP; Machine learning; Data mining; Kernel method; Data point; Pattern recognition (psychology); Mathematics; Support vector machine","score_opus":0.12628955933372882,"score_gpt":0.3661918640977583,"score_spread":0.23990230476402946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575147726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011958459,0.0000141034125,0.9742437,0.011984448,0.0008991044,0.00020331678,0.000011425565,0.00047974175,0.010968286],"genre_scores_gemma":[0.9535485,0.000052309057,0.04471779,0.00078753836,0.00017488349,0.0000454818,0.0000026951657,0.000018330049,0.00065250916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99746114,0.00007874784,0.0006030709,0.00072765,0.00071219204,0.00041720585],"domain_scores_gemma":[0.9980338,0.00029881945,0.00023936601,0.0006968902,0.0005800907,0.00015099139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041544312,0.00027108725,0.00022321337,0.00030975923,0.00013749438,0.00038922176,0.0018646256,0.00009634531,0.00067679776],"category_scores_gemma":[0.0008588936,0.00020343807,0.00013928687,0.00027672827,0.000113986294,0.0011000481,0.00037854374,0.00021110874,0.0006952381],"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.0000385061,0.000094419935,0.00003730418,0.0000040759755,0.000012522083,0.000032995646,0.0000747003,0.00009506386,0.060180042,0.5010055,0.00030716675,0.4381177],"study_design_scores_gemma":[0.000047642287,0.00014066887,0.00008029185,0.00033052545,0.0000023689965,0.000007789687,0.00003158798,0.060761925,0.71722025,0.21771386,0.0033665074,0.00029658104],"about_ca_topic_score_codex":0.000025383211,"about_ca_topic_score_gemma":0.000012557121,"teacher_disagreement_score":0.95235264,"about_ca_system_score_codex":0.00016905634,"about_ca_system_score_gemma":0.00014159891,"threshold_uncertainty_score":0.89361113},"labels":[],"label_agreement":null},{"id":"W2575334674","doi":"","title":"Improved heuristic and tie-breaking for optimally solving Sokoban","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Heuristic; Computer science; Mathematical optimization; Consistent heuristic; Domain (mathematical analysis); Mathematics; Algorithm; Incremental heuristic search; Theoretical computer science; Search algorithm; Beam search","score_opus":0.09008996914440243,"score_gpt":0.3091966442554555,"score_spread":0.21910667511105308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575334674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054170066,0.000025914711,0.9807499,0.004146882,0.0013250198,0.00027334687,0.000014534588,0.00015066232,0.007896708],"genre_scores_gemma":[0.97871655,0.000050486644,0.019976785,0.00026256999,0.00027659963,0.00006153857,0.0000028169766,0.00001416115,0.00063849485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998112,0.000044193246,0.00048606328,0.0006793524,0.0002888039,0.000389555],"domain_scores_gemma":[0.99832207,0.00042161092,0.00021499711,0.00033707038,0.0005582222,0.00014601706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043388116,0.00023730924,0.0002213526,0.00018070788,0.00017990737,0.0004918657,0.0009246992,0.00008748363,0.00012601502],"category_scores_gemma":[0.0008575016,0.00017480168,0.00010283502,0.00010418041,0.00016268456,0.0004810037,0.00029268506,0.0001244908,0.000139383],"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.000031726024,0.000054430475,0.000032678498,0.0000057949974,0.000017744205,0.000005204884,0.0002454041,0.000007662789,0.019099697,0.65866387,0.00005416713,0.3217816],"study_design_scores_gemma":[0.00019171096,0.0005227968,0.00040208275,0.00036579042,0.000012875304,0.000042237803,0.00013081776,0.50451064,0.09490099,0.39584595,0.0024420368,0.00063204573],"about_ca_topic_score_codex":0.000032741806,"about_ca_topic_score_gemma":0.00006786021,"teacher_disagreement_score":0.97329956,"about_ca_system_score_codex":0.00010192782,"about_ca_system_score_gemma":0.00014537819,"threshold_uncertainty_score":0.71282053},"labels":[],"label_agreement":null},{"id":"W2575405755","doi":"","title":"The complexity of learning acyclic CP-nets","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Dimension (graph theory); Concept class; Theoretical computer science; Tree (set theory); Computational complexity theory; Core (optical fiber); Mistake; Upper and lower bounds; VC dimension; Artificial intelligence; Algorithm; Mathematics; Machine learning; Combinatorics","score_opus":0.14089382871735673,"score_gpt":0.3353116497484666,"score_spread":0.19441782103110988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575405755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010156958,0.000015632426,0.93532807,0.039107777,0.0014574638,0.00011638508,0.0000054726083,0.0001447194,0.013667517],"genre_scores_gemma":[0.99522585,0.00008020768,0.0032932602,0.0001291385,0.00012900222,0.00001138426,0.0000015518435,0.000007742869,0.0011218513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802905,0.00017275709,0.0005340531,0.00039080708,0.0005953471,0.00027801024],"domain_scores_gemma":[0.9983842,0.00042814584,0.00030323825,0.00041444288,0.00038636866,0.00008360271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060330034,0.00016377182,0.00016822528,0.000118481614,0.00024256985,0.00022283991,0.0015124124,0.00004883449,0.00023885276],"category_scores_gemma":[0.0007580284,0.000096006144,0.00010876844,0.0001767264,0.0005268257,0.00023026424,0.0002926045,0.0002759081,0.00048218],"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.000012589532,0.000034960394,0.00008280458,9.649914e-7,0.000012204502,0.0000027633948,0.000121391735,0.00012893324,0.0056140856,0.6068393,0.00004099325,0.387109],"study_design_scores_gemma":[0.00007748022,0.00031649557,0.0019400573,0.000223381,0.0000037299974,0.000017696937,0.00018458709,0.26754445,0.12580225,0.5935677,0.009984616,0.00033750385],"about_ca_topic_score_codex":0.00007901213,"about_ca_topic_score_gemma":0.000040683746,"teacher_disagreement_score":0.9850689,"about_ca_system_score_codex":0.000050723178,"about_ca_system_score_gemma":0.00007922391,"threshold_uncertainty_score":0.61976093},"labels":[],"label_agreement":null},{"id":"W2576239431","doi":"","title":"Action selection for hammer shots in curling","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Gaussian Processes and Bayesian Inference","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Delaunay triangulation; Curling; Hammer; Computer science; Action (physics); Selection (genetic algorithm); Artificial intelligence; State space; Triangulation; Computer vision; Mathematical optimization; Algorithm; Mathematics; Engineering; Geometry; Statistics; Structural engineering; Mechanical engineering; Physics","score_opus":0.17443978938971277,"score_gpt":0.359484580898046,"score_spread":0.18504479150833325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576239431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008219464,0.0000045668335,0.9761778,0.011261648,0.0013488205,0.00024267478,0.000007795823,0.00011059197,0.0026266244],"genre_scores_gemma":[0.9871933,0.000054694072,0.011811567,0.00030184214,0.00019450512,0.000100810015,0.000002667587,0.000010735417,0.00032989267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810225,0.000039201477,0.0005392948,0.00061140384,0.00036340408,0.0003444385],"domain_scores_gemma":[0.9988975,0.00017031375,0.00018711452,0.00023282884,0.00042715305,0.00008508457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033610847,0.00019516407,0.00017294385,0.00036352852,0.00009368579,0.0002907247,0.0007606802,0.000097131924,0.00024159117],"category_scores_gemma":[0.00029054246,0.00015093664,0.0000858426,0.00030796163,0.00006359111,0.0008362359,0.00008793987,0.00014844396,0.00026907155],"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.000036577996,0.000076834825,0.00014060961,0.0000051272223,0.0000064501332,0.0000018927972,0.000107924694,0.00008195061,0.017852873,0.5899582,0.000047303853,0.3916843],"study_design_scores_gemma":[0.00011084197,0.00022771073,0.0008452256,0.00032605542,0.0000029745793,0.000014824021,0.000091112255,0.21482764,0.24951582,0.5321574,0.0015153434,0.0003650164],"about_ca_topic_score_codex":0.000064506545,"about_ca_topic_score_gemma":0.0003666283,"teacher_disagreement_score":0.9789738,"about_ca_system_score_codex":0.00018660376,"about_ca_system_score_gemma":0.00015920428,"threshold_uncertainty_score":0.61550176},"labels":[],"label_agreement":null},{"id":"W25763866","doi":"10.1371/journal.pone.0115657","title":"Regret-based utility elicitation in constraint-based decision problems","year":2005,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","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 Alberta; University of Toronto","funders":"","keywords":"Regret; Preference elicitation; Mathematical optimization; Computer science; Preference; Heuristic; Constraint (computer-aided design); Minimax; Binary decision diagram; Optimization problem; Product (mathematics); Artificial intelligence; Machine learning; Mathematics; Theoretical computer science","score_opus":0.10050128863106629,"score_gpt":0.3222350740173838,"score_spread":0.22173378538631755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W25763866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009845957,0.0000061762353,0.96670544,0.014295229,0.0007074375,0.0003751332,0.000014116721,0.00018992496,0.007860587],"genre_scores_gemma":[0.92090863,0.00000820427,0.07760141,0.0013032228,0.000069147754,0.000045716664,0.000025747882,0.000009876737,0.00002805528],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972034,0.00012390019,0.0009202197,0.0006941757,0.0007407755,0.00031751933],"domain_scores_gemma":[0.99825007,0.00034214603,0.00026732893,0.0004512287,0.00055779674,0.00013140382],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006891488,0.0002563807,0.00022177803,0.00064483494,0.00010898047,0.00038406317,0.0007297554,0.00013218564,0.0012041829],"category_scores_gemma":[0.0005467143,0.00026129343,0.000113629525,0.0005104582,0.00020790155,0.00060456037,0.000049857463,0.00033600797,0.00046433386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049959486,0.00021914407,0.00044911838,0.0000040805107,0.0000047691356,0.0000063376233,0.00015867027,0.075823635,0.0009781494,0.24685189,0.000037428214,0.6754168],"study_design_scores_gemma":[0.00015752992,0.00008523933,0.002578448,0.0001895856,0.0000020990126,0.000004246266,0.00008774938,0.9500656,0.020958535,0.024969772,0.00063780363,0.00026340247],"about_ca_topic_score_codex":0.00007204872,"about_ca_topic_score_gemma":0.0007772833,"teacher_disagreement_score":0.91106266,"about_ca_system_score_codex":0.00026765993,"about_ca_system_score_gemma":0.00039582982,"threshold_uncertainty_score":0.9999839},"labels":[],"label_agreement":null},{"id":"W2576517076","doi":"","title":"Strong-Cyclic Planning when Fairness is Not a Valid Assumption.","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Fairness measure; Max-min fairness; Mathematical optimization; Microeconomics; Economics; Mathematics; Computer network; Resource allocation","score_opus":0.1960748712451184,"score_gpt":0.3507000163299686,"score_spread":0.1546251450848502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576517076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011867456,0.000020269948,0.9413316,0.010282439,0.002312581,0.00019568353,0.000031038686,0.00027512794,0.03368377],"genre_scores_gemma":[0.9927718,0.000035556433,0.0035170633,0.00081606826,0.00040684626,0.0000469432,0.0000058502105,0.000017406417,0.0023824424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99697226,0.0001103219,0.0006875374,0.000893199,0.00083579763,0.0005008517],"domain_scores_gemma":[0.9980238,0.0002820677,0.0003014041,0.00059904123,0.00058871,0.00020493976],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00046094097,0.00033251612,0.00029202946,0.00030810176,0.0001858323,0.0005744196,0.0018721182,0.00013952293,0.001684514],"category_scores_gemma":[0.00038235085,0.00024632298,0.00018186313,0.00017968274,0.00018430968,0.000825423,0.00039743911,0.0002512761,0.0044522113],"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.00004059616,0.0001539102,0.00026611955,0.000004242407,0.00004043286,0.000034167133,0.0014260581,0.000046581143,0.010273469,0.8178059,0.00071303913,0.16919547],"study_design_scores_gemma":[0.00023672408,0.000453958,0.002076067,0.0007283276,0.000017898954,0.00007584866,0.0003658098,0.089920916,0.36255074,0.5334772,0.008943805,0.0011527477],"about_ca_topic_score_codex":0.000055522854,"about_ca_topic_score_gemma":0.000023908173,"teacher_disagreement_score":0.98090434,"about_ca_system_score_codex":0.00020366692,"about_ca_system_score_gemma":0.00017868393,"threshold_uncertainty_score":0.9999989},"labels":[],"label_agreement":null},{"id":"W2577151854","doi":"","title":"Generalizing the edge-finder rule for the cumulative constraint","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Generalization; Constraint (computer-aided design); Relaxation (psychology); Enhanced Data Rates for GSM Evolution; Set (abstract data type); Function (biology); Algorithm; State (computer science); Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.14977090632350665,"score_gpt":0.3310947304544353,"score_spread":0.18132382413092868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577151854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066012195,0.000021952412,0.90489084,0.08073247,0.0018361527,0.00038374783,0.000009063669,0.00009850209,0.00542607],"genre_scores_gemma":[0.99362123,0.000016599688,0.002863489,0.0016578102,0.00046322745,0.00008193217,9.005396e-7,0.0000097410875,0.0012850752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998166,0.00008841931,0.00045101758,0.00047605135,0.0004978246,0.0003206628],"domain_scores_gemma":[0.99776495,0.0010289567,0.00020219361,0.0005630057,0.00038086815,0.00006003352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076682516,0.00019297867,0.0001351928,0.000089913694,0.00041139647,0.0004170543,0.0018032356,0.000046534053,0.00013358978],"category_scores_gemma":[0.0003281326,0.00008998558,0.0001609717,0.0001479529,0.0003132547,0.00005377865,0.0003944277,0.0001531849,0.00023972176],"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.000010781138,0.000030856678,0.0000058572223,0.0000010776208,0.000039736115,0.0000019334045,0.0003765587,0.0027024834,0.0008840673,0.620574,0.0003802251,0.37499243],"study_design_scores_gemma":[0.000080146354,0.000093146155,0.00027628514,0.00012294106,0.000010777332,0.000010522471,0.0005119909,0.70210254,0.020218339,0.26289862,0.013420875,0.0002538176],"about_ca_topic_score_codex":0.000051494975,"about_ca_topic_score_gemma":0.000026022339,"teacher_disagreement_score":0.98702,"about_ca_system_score_codex":0.000093975905,"about_ca_system_score_gemma":0.00007926001,"threshold_uncertainty_score":0.40216643},"labels":[],"label_agreement":null},{"id":"W2577388749","doi":"","title":"Numeric Planning via Search Space Abstraction.","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Abstraction; Computer science; Space (punctuation); Theoretical computer science","score_opus":0.13603735342430087,"score_gpt":0.3368425459419655,"score_spread":0.20080519251766463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577388749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007259525,0.000017732944,0.95846933,0.016255047,0.0015059017,0.00012085677,0.00000929874,0.0002544912,0.016107844],"genre_scores_gemma":[0.98634535,0.000017759314,0.01223858,0.00034754002,0.00024651992,0.000018102182,0.0000046265227,0.000013971237,0.00076754007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976369,0.000092904025,0.0004999112,0.00063736015,0.0007062472,0.00042663523],"domain_scores_gemma":[0.9984164,0.00038117776,0.00018642258,0.00045194296,0.00039465807,0.00016935552],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00053636555,0.00023511672,0.00018555767,0.0003074881,0.00019763995,0.0003734551,0.0011484858,0.00009757032,0.0007488047],"category_scores_gemma":[0.00019201558,0.00018263327,0.000096421354,0.00026281137,0.00011348375,0.0006668384,0.00018500673,0.00031237453,0.0025848085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004538196,0.00009371347,0.00036266263,0.0000046600617,0.000031962085,0.00006807729,0.00056251185,0.0030999742,0.029024264,0.54483366,0.0003424622,0.4215307],"study_design_scores_gemma":[0.0001376466,0.00040450704,0.002527701,0.00094909617,0.00000862781,0.00012265629,0.0003584841,0.38369542,0.33964857,0.26607105,0.005060761,0.0010154666],"about_ca_topic_score_codex":0.00010943931,"about_ca_topic_score_gemma":0.000008243654,"teacher_disagreement_score":0.97908586,"about_ca_system_score_codex":0.00014762711,"about_ca_system_score_gemma":0.00015699741,"threshold_uncertainty_score":0.9981918},"labels":[],"label_agreement":null},{"id":"W2577869884","doi":"","title":"Belief State Estimation for Planning via Approximate Logical Filtering and Smoothing.","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Smoothing; Estimation; Computer science; State (computer science); Algorithm; Mathematical optimization; Artificial intelligence; Mathematics; Computer vision; Engineering","score_opus":0.1218737559416283,"score_gpt":0.32514029380844184,"score_spread":0.20326653786681353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577869884","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007870536,0.000016473827,0.98556256,0.0046298886,0.0005797553,0.00021256608,0.000022671229,0.00018020652,0.0009253525],"genre_scores_gemma":[0.9126938,0.00001282352,0.08676059,0.00026198686,0.00006770584,0.000048920872,0.000008409711,0.000010703411,0.00013506613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982829,0.000048151822,0.00047420888,0.0005491226,0.00032545073,0.00032014758],"domain_scores_gemma":[0.99877936,0.00043954185,0.00020450694,0.00023766638,0.00022667769,0.00011225064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005363385,0.00020471773,0.00018164414,0.0001794006,0.00018711339,0.00039034002,0.0005642006,0.00007069338,0.000056660676],"category_scores_gemma":[0.00031456334,0.00015571344,0.000057193425,0.000092001224,0.00009701763,0.0005236575,0.00017526245,0.00014195521,0.000067462846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007391293,0.000050161158,0.00007568171,0.000015736847,0.000021267379,0.000014747929,0.00089457055,0.0046036365,0.01991519,0.31582257,0.000054589156,0.65845793],"study_design_scores_gemma":[0.000057364858,0.00017665164,0.00014000127,0.0003314368,0.0000026053785,0.000015656744,0.000031155705,0.7078829,0.03959696,0.25135848,0.00018882033,0.00021797082],"about_ca_topic_score_codex":0.000021305044,"about_ca_topic_score_gemma":0.000004037235,"teacher_disagreement_score":0.90482324,"about_ca_system_score_codex":0.00006483378,"about_ca_system_score_gemma":0.000052658746,"threshold_uncertainty_score":0.634981},"labels":[],"label_agreement":null},{"id":"W2578463151","doi":"","title":"Linear arithmetic satisfiability via strategy improvement","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Satisfiability modulo theories; Quantifier elimination; Satisfiability; Fragment (logic); Computer science; Modulo; Intuition; Automated theorem proving; Computability; Algorithm; Theoretical computer science; Arithmetic; Mathematics; Programming language; Discrete mathematics","score_opus":0.10216671447824249,"score_gpt":0.3182398034035272,"score_spread":0.2160730889252847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578463151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045260875,0.000008723468,0.9798967,0.004453306,0.001927679,0.0003284926,0.0000058678033,0.00020317528,0.008649922],"genre_scores_gemma":[0.9959137,0.000021892132,0.0028686062,0.00025808145,0.000275826,0.000060780076,0.0000034023276,0.000010928394,0.00058681646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730027,0.00009822718,0.0007408585,0.00075804524,0.0007025578,0.0004000176],"domain_scores_gemma":[0.9982219,0.00015155306,0.0002516996,0.0006525606,0.0005554853,0.00016681037],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00063079613,0.00025822903,0.00023966769,0.00017174231,0.00010929656,0.00031249653,0.0012435693,0.000103720886,0.0005896741],"category_scores_gemma":[0.00023064729,0.00017769185,0.00013229554,0.00019436439,0.0001841989,0.00043976214,0.00025201298,0.00017729762,0.0017498793],"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.000010191246,0.00010937837,0.000061519066,0.0000033623742,0.000015855077,0.000009334544,0.00007308326,0.000026540893,0.010424373,0.53653747,0.000021351694,0.45270756],"study_design_scores_gemma":[0.00007651656,0.0006031779,0.0004876331,0.00003155822,0.0000046884634,0.000015586256,0.000073404066,0.0576358,0.13106799,0.8081581,0.0014619788,0.00038356823],"about_ca_topic_score_codex":0.00024645595,"about_ca_topic_score_gemma":0.00012955455,"teacher_disagreement_score":0.9913876,"about_ca_system_score_codex":0.00018136138,"about_ca_system_score_gemma":0.00015884583,"threshold_uncertainty_score":0.9990274},"labels":[],"label_agreement":null},{"id":"W2578864413","doi":"","title":"An approximation algorithm for the subpath planning problem","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Waterloo","funders":"","keywords":"Shortest path problem; Motion planning; Computer science; Mathematical optimization; Routing (electronic design automation); Approximation algorithm; Robot; Graph; Algorithm; Artificial intelligence; Theoretical computer science; Mathematics","score_opus":0.10361960595376998,"score_gpt":0.3155399262039841,"score_spread":0.2119203202502141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578864413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072800694,0.000013111704,0.992576,0.0013302488,0.0009981298,0.0003578692,0.000050122886,0.00024063115,0.0037058778],"genre_scores_gemma":[0.9710719,0.00006475572,0.02800925,0.00014139466,0.0002933462,0.00016325523,0.000030658928,0.000028987826,0.00019644687],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989513,0.000022888487,0.00035938068,0.00022618784,0.00023844639,0.00020180547],"domain_scores_gemma":[0.9992643,0.000143797,0.00007312437,0.00019826989,0.00026010044,0.000060385104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028555098,0.0001532229,0.0001064388,0.00010978225,0.00010781426,0.00018038084,0.0003469759,0.000066052504,0.0003382255],"category_scores_gemma":[0.00004604763,0.000098116965,0.000055803208,0.00008797301,0.000068776084,0.00026073807,0.00001617201,0.00007938786,0.00013645868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015923359,0.000040346207,0.000013699771,0.0000060391626,0.000029201667,9.025794e-7,0.00040864918,0.067782395,0.00688725,0.18986115,0.00016087669,0.73479354],"study_design_scores_gemma":[0.000044084994,0.00007671219,0.00003820216,0.00010694984,0.000005443716,0.000003148792,0.00015576373,0.93336403,0.03515688,0.02942692,0.001458709,0.00016317236],"about_ca_topic_score_codex":0.00000725302,"about_ca_topic_score_gemma":0.000009747672,"teacher_disagreement_score":0.9703439,"about_ca_system_score_codex":0.00006768814,"about_ca_system_score_gemma":0.00002729704,"threshold_uncertainty_score":0.40010935},"labels":[],"label_agreement":null},{"id":"W2579521186","doi":"","title":"Non-Deterministic Planning with Temporally Extended Goals: Completing the Story for Finite and Infinite LTL (Amended Version).","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Theoretical computer science","score_opus":0.1005374627704798,"score_gpt":0.311975726419039,"score_spread":0.21143826364855917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579521186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017825603,0.000018982386,0.96693337,0.012014579,0.0005613764,0.00033965416,0.00004237338,0.00011442873,0.0021496112],"genre_scores_gemma":[0.98543394,0.000010561437,0.013225203,0.00082877575,0.00012939729,0.00006120164,0.000009992144,0.000014965011,0.00028594915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998108,0.00009445539,0.00043676404,0.00056892127,0.00044559434,0.00034622612],"domain_scores_gemma":[0.99699247,0.0018175951,0.00032230015,0.0003693031,0.00038579252,0.00011253974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083376816,0.00025042737,0.00021750067,0.0001831145,0.00042661157,0.00039314074,0.0008901944,0.000068093505,0.000060153532],"category_scores_gemma":[0.00047886837,0.00015427751,0.00006224478,0.0001297896,0.0002351898,0.00034124925,0.00019002764,0.0002470479,0.00009394298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000782667,0.00016986922,0.0012569407,0.000048402086,0.00016425113,0.000113320624,0.004382245,0.0036959685,0.011781037,0.5489087,0.0011662788,0.4275303],"study_design_scores_gemma":[0.00060995587,0.0019283417,0.0029980794,0.002854058,0.000037232367,0.00007997967,0.0013967245,0.8383015,0.020142945,0.11978313,0.010682442,0.0011856499],"about_ca_topic_score_codex":0.000016632577,"about_ca_topic_score_gemma":0.000011594573,"teacher_disagreement_score":0.96760833,"about_ca_system_score_codex":0.00006618978,"about_ca_system_score_gemma":0.00018799368,"threshold_uncertainty_score":0.6291254},"labels":[],"label_agreement":null},{"id":"W2579792020","doi":"","title":"Dynamic task allocation algorithm for hiring workers that learn","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Crowdsourcing; Computer science; Task (project management); Automation; Competence (human resources); Machine learning; Work (physics); Artificial intelligence; Engineering","score_opus":0.07856348913146355,"score_gpt":0.3072318620184597,"score_spread":0.22866837288699615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579792020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058051418,0.000011759667,0.9812655,0.009010093,0.0018835595,0.00026865996,0.0000139427175,0.00022355161,0.0015177798],"genre_scores_gemma":[0.9445249,0.000032196556,0.053755786,0.00027705677,0.00013206953,0.00006390147,0.000007741779,0.000018869905,0.0011875011],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978719,0.0000615186,0.00046361293,0.00070640666,0.00050433585,0.00039224894],"domain_scores_gemma":[0.99843043,0.0002850321,0.00022681737,0.00048766108,0.00044768333,0.00012236995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052332337,0.00023714636,0.00019568851,0.00024704207,0.00018590862,0.0004412157,0.0009441689,0.00009707779,0.00008877722],"category_scores_gemma":[0.0002268887,0.00018960157,0.00014154788,0.00016545627,0.00013222295,0.00049842097,0.00015544987,0.00015034633,0.00038875247],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015635289,0.000052516472,0.000023456989,0.0000028318868,0.000023006987,0.000005252201,0.00018544952,0.00030631616,0.017625201,0.1217892,0.00009395248,0.85987717],"study_design_scores_gemma":[0.000089941655,0.00013803931,0.00022808305,0.00038651965,0.0000066510315,0.000014924248,0.00027492663,0.8138487,0.10566238,0.077100046,0.0018527895,0.00039701152],"about_ca_topic_score_codex":0.000041609466,"about_ca_topic_score_gemma":0.000044314995,"teacher_disagreement_score":0.93871975,"about_ca_system_score_codex":0.0002219115,"about_ca_system_score_gemma":0.00012528924,"threshold_uncertainty_score":0.77317274},"labels":[],"label_agreement":null},{"id":"W26274488","doi":"10.1111/vcp.12275","title":"Lambda depth-first proof number search and its application to go","year":2007,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Depth-first search; Computer science; Search algorithm; Proof of concept; Search tree; Iterative deepening depth-first search; Theoretical computer science; Space (punctuation); Beam stack search; Combinatorial search; Breadth-first search; Algorithm; Search problem; Mathematics; Beam search; Best-first search","score_opus":0.11102970326903157,"score_gpt":0.3652190956948882,"score_spread":0.25418939242585664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W26274488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04967362,0.000016114745,0.9158943,0.010919791,0.0010276198,0.0007564267,0.000009008111,0.00021623178,0.021486877],"genre_scores_gemma":[0.98851585,0.000035586043,0.009386129,0.00096037716,0.0003257241,0.00008466064,0.0000065516347,0.000025849251,0.00065924233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9961627,0.00006645239,0.0009479497,0.0010866993,0.0010651045,0.00067107007],"domain_scores_gemma":[0.9974682,0.00030887505,0.0001632652,0.0006307667,0.0010155706,0.00041335588],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012616994,0.00035366364,0.0002840591,0.00040971942,0.0002580044,0.0005230651,0.0017110816,0.00016015781,0.00029027966],"category_scores_gemma":[0.00047455073,0.00035815733,0.00009554522,0.0006659995,0.00016463848,0.00065703865,0.00058143964,0.0004230823,0.005968035],"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.000057426747,0.00015228605,0.00029912413,0.000007527186,0.000017313461,0.000021406953,0.0011385606,0.0009981468,0.0073424582,0.68525994,0.000076064,0.30462974],"study_design_scores_gemma":[0.00002929858,0.00019821465,0.0014526435,0.00013240552,0.0000056196463,0.00004603138,0.0004473856,0.25262094,0.65978,0.08104368,0.0036737858,0.0005699739],"about_ca_topic_score_codex":0.00017713537,"about_ca_topic_score_gemma":0.0014861148,"teacher_disagreement_score":0.93884224,"about_ca_system_score_codex":0.0001839906,"about_ca_system_score_gemma":0.00012803245,"threshold_uncertainty_score":0.99988705},"labels":[],"label_agreement":null},{"id":"W26296001","doi":"10.1097/01.mpg.0000471451.55494.e4","title":"Leaf-value tables for pruning non-zero-sum games","year":2005,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Pruning; Zero-sum game; Zero (linguistics); Heuristics; Constant (computer programming); Tree (set theory); Computer science; Monotonic function; Mathematics; Game tree; Node (physics); Value (mathematics); Algorithm; Combinatorics; Discrete mathematics; Game theory; Mathematical optimization; Sequential game; Nash equilibrium; Machine learning; Mathematical economics","score_opus":0.10886125189251629,"score_gpt":0.3444431392907666,"score_spread":0.2355818873982503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W26296001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069310907,0.00004212965,0.9593497,0.016401831,0.0025710792,0.00070460525,0.000046799738,0.0003270782,0.01362571],"genre_scores_gemma":[0.9111679,0.00006551291,0.08451652,0.0016258215,0.00081707386,0.0002173856,0.0000281841,0.000041453994,0.001520124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995522,0.00009114131,0.0013129098,0.0012366563,0.0009898064,0.0008474855],"domain_scores_gemma":[0.99680424,0.00048517334,0.00046077272,0.00094496226,0.0010378554,0.00026697246],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00088947965,0.0005194788,0.00046368816,0.0005283408,0.00036472944,0.0010412155,0.0028812243,0.00020960068,0.0006431601],"category_scores_gemma":[0.0008613036,0.00051781704,0.0003059766,0.00044451482,0.00032952303,0.0013964724,0.00045356294,0.00046042615,0.0018408059],"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.000051361374,0.00020559321,0.000025802756,0.000008900915,0.000034992187,0.0000072697853,0.0008777478,0.010382137,0.009374597,0.65284616,0.0008981826,0.32528725],"study_design_scores_gemma":[0.000037793234,0.0001989359,0.000035519406,0.00012872387,0.0000085926595,0.000012803225,0.00030146408,0.53437465,0.2756962,0.17474307,0.014001412,0.00046085025],"about_ca_topic_score_codex":0.00016904021,"about_ca_topic_score_gemma":0.00020451554,"teacher_disagreement_score":0.90423685,"about_ca_system_score_codex":0.0003018043,"about_ca_system_score_gemma":0.00031620008,"threshold_uncertainty_score":0.9999958},"labels":[],"label_agreement":null},{"id":"W2889093876","doi":"","title":"Predicting Glycemia in Type 1 Diabetes Patients: Experiments with XG-Boost.","year":2018,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Diabetes Management and Research","field":"Medicine","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Diabetes mellitus; Type 2 diabetes; Medicine; Computer science; Intensive care medicine; Endocrinology","score_opus":0.09958495237028905,"score_gpt":0.3561212640888013,"score_spread":0.2565363117185122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889093876","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94645655,0.000010509424,0.0007159746,0.001268644,0.0007675216,0.00044306868,0.0000058539617,0.000059341797,0.050272528],"genre_scores_gemma":[0.9978165,0.00001534592,0.00037411854,0.00045986814,0.0002851832,0.000035354533,0.000045116063,0.000019777013,0.0009487196],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99807036,0.00003521187,0.00040524025,0.0004066024,0.00071608776,0.00036647334],"domain_scores_gemma":[0.998716,0.000053288673,0.000103859544,0.0002329514,0.0007784235,0.00011549309],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002037312,0.00017882575,0.00021466798,0.00035929526,0.000067060486,0.00011223978,0.0002566006,0.00006629524,0.0017846173],"category_scores_gemma":[0.00031893625,0.00014203042,0.00004140596,0.00031601312,0.00026676583,0.00017461536,0.000119444376,0.00022600315,0.00067776634],"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.005787132,0.0035215882,0.45150042,0.000100004145,0.0004326445,0.00009847711,0.002387507,0.00010046717,0.020758703,0.11768704,0.0012126938,0.39641333],"study_design_scores_gemma":[0.0020996751,0.014443256,0.13228256,0.004452247,0.00008683592,0.0000033823874,0.003067506,0.17111354,0.6403052,0.025412522,0.0053210044,0.0014122529],"about_ca_topic_score_codex":0.000032015247,"about_ca_topic_score_gemma":0.000075557575,"teacher_disagreement_score":0.61954653,"about_ca_system_score_codex":0.0001447641,"about_ca_system_score_gemma":0.00009106998,"threshold_uncertainty_score":0.99912786},"labels":[],"label_agreement":null},{"id":"W2912387951","doi":"","title":"Solving checkers","year":2005,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","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 Alberta","funders":"","keywords":"Computer science; Value (mathematics); Simple (philosophy); Space (punctuation); Artificial intelligence; Theoretical computer science; Machine learning","score_opus":0.12737641878613642,"score_gpt":0.33874866211450416,"score_spread":0.21137224332836774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912387951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00710079,0.00003007685,0.8857418,0.03354484,0.00248794,0.0002786227,0.000008221014,0.0005365015,0.070271224],"genre_scores_gemma":[0.95563924,0.00007334553,0.040576924,0.0020090598,0.0007196667,0.000047855367,0.0000060683024,0.000024504267,0.00090331415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962464,0.00009259931,0.0010342047,0.00095830305,0.0010331435,0.00063537236],"domain_scores_gemma":[0.99773705,0.0001965947,0.00030476123,0.0008700014,0.00064078544,0.0002508241],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006217316,0.00038713525,0.00030416137,0.00045263465,0.00023991679,0.0008476148,0.0026905395,0.00015162781,0.001617485],"category_scores_gemma":[0.0005334717,0.0003853845,0.00021438648,0.00044396677,0.00026366624,0.0013092608,0.00045714062,0.00050012156,0.007807428],"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.000015176814,0.00013622397,0.000018550238,0.0000016180519,0.000020248473,0.0000146040575,0.00062061584,0.0018756661,0.0052182307,0.5968045,0.00037772654,0.3948968],"study_design_scores_gemma":[0.000023367249,0.00012574655,0.00009496399,0.00009160557,0.0000048709694,0.000026448757,0.0004211501,0.5241276,0.30617607,0.15812957,0.010257584,0.0005209943],"about_ca_topic_score_codex":0.0000755375,"about_ca_topic_score_gemma":0.00014059119,"teacher_disagreement_score":0.9485385,"about_ca_system_score_codex":0.0002903492,"about_ca_system_score_gemma":0.00019606581,"threshold_uncertainty_score":0.9998598},"labels":[],"label_agreement":null},{"id":"W2914998942","doi":"","title":"Goal change","year":2005,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; York University","funders":"","keywords":"Situation calculus; Action (physics); Belief revision; Computer science; Calculus (dental); Contraction (grammar); Mathematical economics; Artificial intelligence; Epistemology; Mathematics; Philosophy; Linguistics; Physics","score_opus":0.1718701374104723,"score_gpt":0.3329877338590056,"score_spread":0.1611175964485333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914998942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074391966,0.000072437404,0.79750425,0.023938702,0.0035125585,0.00034931017,0.00001187283,0.00045315042,0.16671853],"genre_scores_gemma":[0.98827785,0.00007629304,0.0076656532,0.0016922428,0.0011917969,0.00006178173,0.0000070154606,0.00001143551,0.0010159477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997871,0.000061430655,0.00048613845,0.0006157952,0.00057441846,0.0003912286],"domain_scores_gemma":[0.99867314,0.00008622643,0.00016663231,0.00047834366,0.00042555633,0.00017012286],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003316235,0.00024430893,0.00020203672,0.00024207999,0.00013572288,0.00045269917,0.0015866949,0.00009960107,0.0010175781],"category_scores_gemma":[0.00019150713,0.00022173143,0.00013405835,0.00024095816,0.00011658073,0.0007941241,0.00030906528,0.00028361139,0.005882373],"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.000009627407,0.00013077767,0.00002880206,0.0000013307202,0.000010232376,0.00001099546,0.0006935626,0.000041539533,0.0007935556,0.6383772,0.00023968499,0.3596627],"study_design_scores_gemma":[0.00010931321,0.00036797347,0.0015987187,0.00015490153,0.000008520612,0.0000632806,0.00024480428,0.59504575,0.10169911,0.2515027,0.04831318,0.00089178164],"about_ca_topic_score_codex":0.00006245802,"about_ca_topic_score_gemma":0.00016108625,"teacher_disagreement_score":0.98083866,"about_ca_system_score_codex":0.00014714191,"about_ca_system_score_gemma":0.00010047374,"threshold_uncertainty_score":0.99989563},"labels":[],"label_agreement":null},{"id":"W29265412","doi":"10.1111/1346-8138.14192","title":"Multiple agents moving target search","year":2003,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Domain (mathematical analysis); Search problem; Search algorithm; Bidirectional search; State (computer science); Multi-agent system; Incremental heuristic search; Artificial intelligence; Mathematical optimization; Beam search; Algorithm; Mathematics","score_opus":0.1572151320510519,"score_gpt":0.3316735627996419,"score_spread":0.17445843074859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W29265412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011332305,0.000019232628,0.9521996,0.002473633,0.0016134747,0.00017443093,0.000012455371,0.00019937543,0.031975485],"genre_scores_gemma":[0.9480729,0.000014089065,0.050557453,0.0006301357,0.000092414484,0.000019252091,0.0000120058985,0.0000134574475,0.0005883078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974644,0.00018662261,0.0005230724,0.0006388255,0.00073168235,0.00045540015],"domain_scores_gemma":[0.99854183,0.0002765937,0.00013872358,0.0004686921,0.00039633518,0.00017780882],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00079618127,0.00023657232,0.00019176315,0.00027705956,0.00023391315,0.00053531805,0.0011818114,0.0000936172,0.0009262673],"category_scores_gemma":[0.00065232476,0.00023518865,0.0001054619,0.00029666172,0.0000841414,0.00044771953,0.00016558597,0.0004086577,0.001347376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018982832,0.00015618086,0.0010695186,0.000006593131,0.000030231664,0.00005773974,0.00096616114,0.013158412,0.00324608,0.9322715,0.00037280036,0.048645817],"study_design_scores_gemma":[0.00005797454,0.00012379084,0.00033195887,0.0001410225,0.0000025633365,0.000021576938,0.00026336327,0.76469636,0.13008535,0.10009167,0.0037892542,0.00039510673],"about_ca_topic_score_codex":0.00010383568,"about_ca_topic_score_gemma":0.000015253354,"teacher_disagreement_score":0.9367406,"about_ca_system_score_codex":0.00011414157,"about_ca_system_score_gemma":0.00021568833,"threshold_uncertainty_score":0.999987},"labels":[],"label_agreement":null},{"id":"W2963256079","doi":"","title":"Highly accurate gaze estimation using a consumer RGB-D sensor","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Gaze Tracking and Assistive Technology","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Artificial intelligence; Gaze; Rendering (computer graphics); Computer vision; Normalization (sociology); Pose; RGB color model; Face (sociological concept)","score_opus":0.1571272691481265,"score_gpt":0.3472728779864402,"score_spread":0.1901456088383137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963256079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06424735,0.0000067056044,0.9212631,0.0110081965,0.0012450328,0.00013854726,0.00001774058,0.00035149156,0.0017218457],"genre_scores_gemma":[0.96548074,0.000028268747,0.033851966,0.0002833018,0.00008288469,0.000017047381,0.0000027034891,0.000012306943,0.00024079693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788535,0.00008393767,0.0005688799,0.00063698064,0.000469791,0.00035506423],"domain_scores_gemma":[0.9983662,0.00022076414,0.0002795039,0.00049409835,0.0005385294,0.00010094579],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029663288,0.00024401616,0.000218778,0.00034967813,0.000128751,0.00027807936,0.0010123211,0.00012020383,0.00024366807],"category_scores_gemma":[0.00051560916,0.00018393286,0.00009346416,0.00025391532,0.00025665032,0.0005286939,0.00020263708,0.00019702999,0.0014321216],"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.000019724504,0.00008143157,0.00006156752,0.0000021224548,0.000023417646,0.000028052322,0.000077124925,0.00040999518,0.05937929,0.63217324,0.0000501232,0.30769387],"study_design_scores_gemma":[0.00008794496,0.00012909966,0.00054944324,0.00031634184,0.000008705088,0.00005959529,0.00006523893,0.52542496,0.2939445,0.17838606,0.0006080351,0.00042007858],"about_ca_topic_score_codex":0.000048046368,"about_ca_topic_score_gemma":0.00001917576,"teacher_disagreement_score":0.9012334,"about_ca_system_score_codex":0.00016680034,"about_ca_system_score_gemma":0.00013903482,"threshold_uncertainty_score":0.99934536},"labels":[],"label_agreement":null},{"id":"W2966266863","doi":"","title":"Integrating Factorization Ranked Features in MCTS: An Experimental Study.","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","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":"Ranking (information retrieval); Factorization; Computer science; Factor (programming language); Feature (linguistics); Tree (set theory); Artificial intelligence; Monte Carlo tree search; Machine learning; Monte Carlo method; Open source; State (computer science); Data mining; Algorithm; Statistics; Software; Mathematics; Programming language","score_opus":0.11557657437519758,"score_gpt":0.3635510990341819,"score_spread":0.24797452465898434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966266863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32773447,0.000015615928,0.6611191,0.0032838082,0.0025109164,0.00069861,0.000012197794,0.00032097445,0.0043042763],"genre_scores_gemma":[0.9950317,0.000015984057,0.0040891254,0.00027049164,0.00025161874,0.00011943169,0.0000065279773,0.000025918895,0.00018921545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99587315,0.0003237248,0.0011343935,0.0011356139,0.0010140601,0.00051906484],"domain_scores_gemma":[0.99789345,0.00029490681,0.00031610607,0.00079229515,0.000511234,0.0001919807],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065910583,0.00041858965,0.0003524404,0.0006227194,0.0001594264,0.00065256696,0.002148338,0.00014364143,0.00059462053],"category_scores_gemma":[0.0007018613,0.00031774357,0.00011035183,0.00050918595,0.00020095539,0.0019297246,0.00033391957,0.0003459617,0.0005244374],"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.000116079194,0.0017491643,0.0013887265,0.0000017436989,0.000027323902,0.00006315906,0.006002237,0.00025276997,0.082346395,0.683867,0.00003358371,0.22415186],"study_design_scores_gemma":[0.00017229262,0.0016717091,0.0031563828,0.00032085314,0.000005443903,0.000019390216,0.009842928,0.04757351,0.8002218,0.13597712,0.00015052027,0.00088803994],"about_ca_topic_score_codex":0.00036721863,"about_ca_topic_score_gemma":0.00093482854,"teacher_disagreement_score":0.7178754,"about_ca_system_score_codex":0.00040537675,"about_ca_system_score_gemma":0.00015585238,"threshold_uncertainty_score":0.99992746},"labels":[],"label_agreement":null},{"id":"W2970245835","doi":"","title":"Learning Reliable Policies in the Bandit Setting with Application to Adaptive Clinical Trials.","year":2019,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning","score_opus":0.44409328734001935,"score_gpt":0.5419922742734516,"score_spread":0.0978989869334323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970245835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16495103,0.000009589048,0.795641,0.019598624,0.00091663765,0.0018305739,0.000024670106,0.00006491925,0.016962966],"genre_scores_gemma":[0.9956114,0.000018676612,0.0020687517,0.00073992484,0.00033061812,0.0001282749,0.000008879069,0.000014954544,0.0010785076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930583,0.0012472859,0.0018436974,0.0008766131,0.00256191,0.0004121953],"domain_scores_gemma":[0.9908229,0.0066252914,0.00062331295,0.0006279367,0.0011660195,0.00013454231],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.017921032,0.00021829575,0.00050592073,0.00059253257,0.0001499768,0.0006279714,0.0016375167,0.0001038251,0.00088580983],"category_scores_gemma":[0.0139992125,0.00013145668,0.00014583422,0.0010299673,0.00019224004,0.00037060218,0.00020199608,0.00090633304,0.0046868287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011748166,0.0002853914,0.0062386203,0.0000024754613,0.000036073816,0.00002140651,0.0030870645,0.14533226,0.0011094551,0.14681987,0.00047947458,0.69541305],"study_design_scores_gemma":[0.00028606688,0.0022083588,0.017786909,0.00026339464,0.000010310436,0.000021811351,0.028094012,0.7145491,0.008568477,0.21422982,0.0133814085,0.0006003323],"about_ca_topic_score_codex":0.00023772768,"about_ca_topic_score_gemma":0.00034792253,"teacher_disagreement_score":0.8306604,"about_ca_system_score_codex":0.00013775866,"about_ca_system_score_gemma":0.0002203892,"threshold_uncertainty_score":0.99608815},"labels":[],"label_agreement":null},{"id":"W301099071","doi":"","title":"Phase transitions of dominating clique problem and their implications to heuristics in satisfiability search","year":2005,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Clique problem; Satisfiability; Monotone polygon; Clique; Computer science; Time complexity; Random graph; Local search (optimization); Mathematics; Boolean satisfiability problem; Graph; Theoretical computer science; Mathematical optimization; Algorithm; Combinatorics; Line graph; Pathwidth","score_opus":0.09141986618334437,"score_gpt":0.35647440367216593,"score_spread":0.2650545374888216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W301099071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073686555,0.0000031092457,0.90246624,0.019815972,0.00009042734,0.00034336996,0.000048614176,0.000043129414,0.003502589],"genre_scores_gemma":[0.94518733,0.000017602946,0.05443461,0.0002599064,0.000033481312,0.000040645853,0.000008315342,0.0000051109414,0.0000129846685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985495,0.00008789967,0.000628841,0.0003836068,0.00017641539,0.00017373188],"domain_scores_gemma":[0.9989244,0.00017764668,0.000104548795,0.00025183885,0.00043716066,0.00010441575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045244733,0.00013351355,0.00016581961,0.00034446953,0.000075898184,0.00012238862,0.0003482124,0.00005305394,0.000110119036],"category_scores_gemma":[0.00018000332,0.00013168732,0.000044451015,0.00035434347,0.000116151416,0.00029721126,0.00008740664,0.00018848844,0.000024310328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015512145,0.00025975585,0.0001546583,0.000004507134,0.000004814066,4.216086e-7,0.0019092065,0.005792379,0.009029129,0.5308443,0.0000050233207,0.45198035],"study_design_scores_gemma":[0.00017513061,0.00025772062,0.0038919877,0.0001297086,0.0000025328784,0.000014124948,0.0005673896,0.8173297,0.06507365,0.11220253,0.0001116389,0.00024389499],"about_ca_topic_score_codex":0.000051040566,"about_ca_topic_score_gemma":0.00041187566,"teacher_disagreement_score":0.8715008,"about_ca_system_score_codex":0.00010256647,"about_ca_system_score_gemma":0.0001295617,"threshold_uncertainty_score":0.53700536},"labels":[],"label_agreement":null},{"id":"W3013357622","doi":"","title":"Rhetorical Figure Annotation with XML.","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Annotation; XML; Rhetorical question; Streaming XML; Document Structure Description; Information retrieval; World Wide Web; Programming language; Artificial intelligence; Linguistics","score_opus":0.08496063314218631,"score_gpt":0.3292529870922604,"score_spread":0.2442923539500741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013357622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021815076,0.000022565724,0.97385484,0.018540785,0.000542981,0.00014018721,0.000007061217,0.0004421207,0.0042679333],"genre_scores_gemma":[0.9036002,0.000020257858,0.09518048,0.00046359998,0.00014841232,0.000033084147,0.0000034828724,0.00001069013,0.0005397682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980943,0.00005212862,0.00036866442,0.00055240165,0.00066943787,0.00026304598],"domain_scores_gemma":[0.99854493,0.00013476887,0.00018265199,0.0003992771,0.00063712295,0.000101236525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021917598,0.00020366417,0.00015516994,0.00022279817,0.00008868588,0.00031924623,0.0011597109,0.000088084285,0.00030727507],"category_scores_gemma":[0.0002827221,0.00012495549,0.000055862292,0.00027486484,0.00012339963,0.00076317973,0.00014642075,0.00019250998,0.00052427297],"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.000032887667,0.000052089537,0.000022022226,0.000001793329,0.000008921389,0.000025884116,0.00010565733,0.0000066893285,0.015689757,0.6797784,0.00015187055,0.30412403],"study_design_scores_gemma":[0.00005363515,0.000316858,0.00010601754,0.00032360246,0.0000035508524,0.000035172416,0.000037627906,0.013345619,0.43127555,0.553001,0.0011420362,0.00035937442],"about_ca_topic_score_codex":0.000023463137,"about_ca_topic_score_gemma":0.00002050787,"teacher_disagreement_score":0.90141875,"about_ca_system_score_codex":0.00015363304,"about_ca_system_score_gemma":0.000121364625,"threshold_uncertainty_score":0.6738643},"labels":[],"label_agreement":null},{"id":"W3196468539","doi":"","title":"Towards a Safety Case for Hardware Fault Tolerance in Convolutional Neural Networks Using Activation Range Supervision.","year":2021,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Convolutional neural network; Robustness (evolution); Classifier (UML); Deep learning; Implementation; Artificial intelligence; Fault tolerance; Floating point; Embedded system; Computer hardware; Real-time computing; Computer engineering; Distributed computing; Algorithm; Software engineering","score_opus":0.11602436251585312,"score_gpt":0.34684251110278225,"score_spread":0.23081814858692912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196468539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03966611,0.000027617178,0.95267993,0.0045567737,0.0020086274,0.00032580088,0.000029516677,0.000089287736,0.000616322],"genre_scores_gemma":[0.95661694,0.00001718724,0.04212828,0.0006719664,0.00040251276,0.000044005246,0.000048977967,0.000018478631,0.000051648305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971747,0.00020614451,0.00081471744,0.00081191014,0.0005728612,0.0004196666],"domain_scores_gemma":[0.99782735,0.00036467548,0.00024078815,0.00039773714,0.0010594362,0.0001100391],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055582577,0.00028197764,0.00031876657,0.000246993,0.0002671517,0.00038974758,0.00074413774,0.0001528164,0.00031533683],"category_scores_gemma":[0.0010135699,0.00030448198,0.00016135529,0.00050044357,0.000100793506,0.0008797415,0.00033446233,0.00051967474,0.000017019358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012290297,0.0001033349,0.00009084624,0.000008094822,0.00001571442,0.00032501796,0.00035297958,0.6313317,0.0009440716,0.27389273,0.000010776547,0.092801884],"study_design_scores_gemma":[0.00018062405,0.000052688927,0.00032727924,0.00016533038,0.0000049397995,0.0002857588,0.00032853807,0.97956467,0.004652467,0.013968396,0.00015818642,0.00031113706],"about_ca_topic_score_codex":0.0003506581,"about_ca_topic_score_gemma":0.00025809434,"teacher_disagreement_score":0.9169508,"about_ca_system_score_codex":0.00038615335,"about_ca_system_score_gemma":0.0003277436,"threshold_uncertainty_score":0.99994075},"labels":[],"label_agreement":null},{"id":"W46433006","doi":"","title":"Learning algorithms for software agents in uncertain and untrusted market environments","year":2003,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Reputation; Reinforcement learning; Order (exchange); Software; Software agent; Multi-agent system; Intelligent agent; Algorithm; Artificial intelligence; Computer security; Business","score_opus":0.08983223663751178,"score_gpt":0.3175322691727702,"score_spread":0.22770003253525845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W46433006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017021943,0.000018205501,0.97825325,0.0021929333,0.00031125278,0.00038203062,0.000009433771,0.000087283464,0.0017236883],"genre_scores_gemma":[0.9497398,0.00008602735,0.04936585,0.00023857073,0.000020042155,0.00016008438,0.000007647145,0.000008696637,0.0003732867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849534,0.00008220808,0.0003890693,0.0005395536,0.00023403528,0.00025978175],"domain_scores_gemma":[0.9992922,0.00017137844,0.00012804056,0.00026346924,0.00007807666,0.00006683142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004886672,0.00016359884,0.00015916707,0.0002343415,0.00012919224,0.00012731658,0.00054692366,0.000121815756,0.00016072152],"category_scores_gemma":[0.00044745373,0.00017088278,0.000042805485,0.00019614508,0.00012519407,0.00015107599,0.000118196665,0.00027551033,0.00004201548],"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.000013525782,0.00014148731,0.00049758377,0.0000038589337,0.000013247245,0.0000071274753,0.00024987006,0.00039520822,0.00030769463,0.7612489,0.000052513355,0.237069],"study_design_scores_gemma":[0.00012181881,0.00016315165,0.0014214901,0.000054783635,0.0000033028662,0.000014355836,0.00031088997,0.55624443,0.015657915,0.41834357,0.0073708035,0.00029345707],"about_ca_topic_score_codex":0.000030624367,"about_ca_topic_score_gemma":0.000028359085,"teacher_disagreement_score":0.93271786,"about_ca_system_score_codex":0.000093346,"about_ca_system_score_gemma":0.000047620924,"threshold_uncertainty_score":0.6968397},"labels":[],"label_agreement":null},{"id":"W49333804","doi":"","title":"Value-centric trust model with improved familiarity measurement","year":2005,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Access Control and Trust","field":"Social Sciences","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 New Brunswick","funders":"","keywords":"Stability (learning theory); Value (mathematics); Computer science; Similarity (geometry); Artificial intelligence; Psychology; Machine learning","score_opus":0.1498043408213178,"score_gpt":0.33864863065531786,"score_spread":0.18884428983400006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W49333804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05895935,0.0000769898,0.5061735,0.05253792,0.0016291322,0.0014389958,0.00006353189,0.00045645697,0.37866414],"genre_scores_gemma":[0.9951762,0.000108227636,0.0020744163,0.0008840111,0.0005684472,0.00006632031,0.000005540305,0.000016253689,0.0011005603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968316,0.000115820265,0.00052811025,0.00052044383,0.0015222012,0.00048184162],"domain_scores_gemma":[0.99807835,0.000060787654,0.0002213157,0.0002570013,0.0011553335,0.00022722424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009341028,0.00024374796,0.0002456409,0.00019517585,0.00046641598,0.00039213142,0.00074593857,0.00012177977,0.000841788],"category_scores_gemma":[0.00043212596,0.00021115306,0.00010996519,0.00027888708,0.00035613016,0.0005006703,0.0000714963,0.00033662826,0.0004534906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022240158,0.00039041057,0.00020518224,0.000002858497,0.00005675069,0.000005800053,0.0014333747,0.008451099,0.0013346309,0.8180878,0.0001110213,0.16969869],"study_design_scores_gemma":[0.00017494426,0.0001419205,0.0004954355,0.00009175854,0.000033129563,0.0000019491279,0.001769959,0.9237647,0.008733065,0.058509514,0.005784775,0.0004988476],"about_ca_topic_score_codex":0.0012499759,"about_ca_topic_score_gemma":0.004475857,"teacher_disagreement_score":0.9362169,"about_ca_system_score_codex":0.0005709933,"about_ca_system_score_gemma":0.00066913554,"threshold_uncertainty_score":0.92169887},"labels":[],"label_agreement":null},{"id":"W49807964","doi":"","title":"A simple feature selection method for text classification","year":2001,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Feature selection; Computer science; Information gain; Feature (linguistics); Simple (philosophy); Set (abstract data type); Artificial intelligence; Selection (genetic algorithm); Pattern recognition (psychology); Data mining; Feature extraction; Machine learning","score_opus":0.15109002272713962,"score_gpt":0.3835078255874474,"score_spread":0.23241780286030778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W49807964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009265626,0.000008568831,0.9591491,0.031551596,0.00069880916,0.0004118876,0.000010648868,0.00055733,0.0066854446],"genre_scores_gemma":[0.88985574,0.00006470622,0.107603684,0.00061597605,0.0001813968,0.0002411114,0.000034887238,0.000013623856,0.0013888587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980019,0.00006280678,0.00047365576,0.0006989729,0.00044942248,0.0003132412],"domain_scores_gemma":[0.9982961,0.00020626643,0.00028495866,0.0004565737,0.00067544426,0.000080688966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004294358,0.00022435487,0.00018981552,0.00038905191,0.00021607046,0.0005579018,0.0012116655,0.00016628916,0.00025087938],"category_scores_gemma":[0.0004357975,0.00021307572,0.00013106807,0.00051856745,0.00007544675,0.000615337,0.000118989905,0.0002535256,0.00034962772],"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.000031861502,0.00008534625,0.00005186684,0.0000020362638,0.000013373991,0.0000010705024,0.00007666352,0.00011686237,0.015769899,0.6268655,0.0011893922,0.3557961],"study_design_scores_gemma":[0.000046451183,0.00014925508,0.00076830946,0.000019488514,0.000004662375,0.000014132434,0.0002564202,0.54619604,0.06476967,0.36147606,0.026074676,0.0002247993],"about_ca_topic_score_codex":0.00003000382,"about_ca_topic_score_gemma":0.000058875423,"teacher_disagreement_score":0.8889292,"about_ca_system_score_codex":0.00017631352,"about_ca_system_score_gemma":0.00010817624,"threshold_uncertainty_score":0.86889756},"labels":[],"label_agreement":null},{"id":"W70833783","doi":"","title":"Central clustering of categorical data with automated feature weighting","year":2013,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Categorical variable; Cluster analysis; Computer science; Weighting; Artificial intelligence; Data mining; Kernel (algebra); Pattern recognition (psychology); Feature (linguistics); Clustering high-dimensional data; Machine learning; Mathematics","score_opus":0.12553371645470476,"score_gpt":0.35394447805044793,"score_spread":0.22841076159574317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W70833783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029916172,0.000008706082,0.9873973,0.0055941655,0.000586588,0.00029580444,0.000015031932,0.00034687103,0.0027638911],"genre_scores_gemma":[0.8759317,0.00001790449,0.12355095,0.00012721088,0.000115245246,0.000026110178,0.00002958971,0.000016279724,0.00018503348],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720204,0.000076505974,0.0005123416,0.00075997843,0.0009387027,0.00051040953],"domain_scores_gemma":[0.9976496,0.00015727241,0.00023941425,0.0010414243,0.00072857353,0.00018370042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024533915,0.00023967875,0.000258221,0.00024203495,0.00010127968,0.00042007677,0.0029891813,0.0000879519,0.0002297644],"category_scores_gemma":[0.00024700345,0.0001965759,0.0000447906,0.00041319584,0.00017839759,0.0014701353,0.0012096242,0.00042044072,0.00020191519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103684346,0.0004135435,0.0001179716,0.000046781977,0.00013402803,0.00013466491,0.0010009921,0.026280345,0.021456758,0.28895134,0.0006255986,0.6607343],"study_design_scores_gemma":[0.000046414967,0.0001490548,0.0005011721,0.00010999586,0.0000026043929,0.000047063135,0.00015682775,0.9700027,0.019674145,0.008955808,0.00013427863,0.00021994892],"about_ca_topic_score_codex":0.00031782806,"about_ca_topic_score_gemma":0.00005266486,"teacher_disagreement_score":0.94372237,"about_ca_system_score_codex":0.0001332399,"about_ca_system_score_gemma":0.00018719814,"threshold_uncertainty_score":0.8016133},"labels":[],"label_agreement":null},{"id":"W96574868","doi":"","title":"Inferring complex agent motions from partial trajectory observations","year":2007,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Alberta","funders":"","keywords":"Computer science; Probabilistic logic; Trajectory; Path (computing); Inference; Heuristic; Graph; Artificial intelligence; Motion planning; Markov chain; Motion (physics); Machine learning; Algorithm; Theoretical computer science; Robot","score_opus":0.32826783356866834,"score_gpt":0.35597281970753303,"score_spread":0.027704986138864685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W96574868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044943232,0.000012346329,0.9411419,0.003451359,0.0019432394,0.0001743285,0.000039719125,0.00037791676,0.007915975],"genre_scores_gemma":[0.9595144,0.000031238393,0.038746864,0.0010709108,0.00040709085,0.00002454641,0.00005725236,0.000015995895,0.0001317253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969272,0.00007917627,0.0009499506,0.0007628169,0.00077829626,0.0005025409],"domain_scores_gemma":[0.9980822,0.00021383486,0.00024360656,0.00062957883,0.0005654215,0.00026534186],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005947829,0.00030639538,0.00025653152,0.0003157712,0.00027628586,0.00053789205,0.0014799376,0.00013338022,0.00064142747],"category_scores_gemma":[0.00025179496,0.00031879323,0.00016232562,0.00037750247,0.0001584446,0.0005946023,0.0002584084,0.000445634,0.00082047016],"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.000018126118,0.0002543797,0.00017681751,0.0000020124874,0.000040000017,0.000028200617,0.0007511064,0.0031855619,0.025866538,0.85112846,0.00016882195,0.118379965],"study_design_scores_gemma":[0.000078346304,0.00014049059,0.017583959,0.00013646265,0.000012894214,0.000009799478,0.00033467627,0.74561805,0.05028567,0.18378472,0.0014048574,0.00061007525],"about_ca_topic_score_codex":0.0006293643,"about_ca_topic_score_gemma":0.000535504,"teacher_disagreement_score":0.91457117,"about_ca_system_score_codex":0.00018866902,"about_ca_system_score_gemma":0.00018023289,"threshold_uncertainty_score":0.9999575},"labels":[],"label_agreement":null}]}