{"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008564669,0.00032008605,0.95722276,0.00050414697,0.00008683288,0.00019103188,0.00015898477,0.0018107565,0.031140745],"genre_scores_gemma":[0.3406239,0.0007292545,0.63723445,0.0003582545,0.000082355786,0.00042118234,0.0005525838,0.00057574676,0.019422298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789524,0.0007729509,0.00012560675,0.00048172404,0.0004971203,0.00022727749],"domain_scores_gemma":[0.99611276,0.0024207765,0.00021909598,0.00078939303,0.0003163472,0.00014162165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021349755,0.000994784,0.0005261264,0.0005113715,0.0013920028,0.0022295765,0.0014522887,0.0010502832,0.014214371],"category_scores_gemma":[0.009068165,0.000609598,0.0012845424,0.000654681,0.0030499857,0.0039018958,0.0031083908,0.0018224317,0.0018440034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024053061,0.000094487616,0.00078241195,0.0004284656,0.00009699067,0.00030198705,0.001221392,0.07915681,0.0034286422,0.7964796,0.006287631,0.11148103],"study_design_scores_gemma":[0.00006477032,0.0001154744,0.00014624183,0.00010187402,0.00006884476,0.00018617252,0.00026098682,0.108158536,0.007199164,0.8116021,0.07205733,0.000038550374],"about_ca_topic_score_codex":0.0027324765,"about_ca_topic_score_gemma":0.003510878,"teacher_disagreement_score":0.014214371,"about_ca_system_score_codex":0.0010247392,"about_ca_system_score_gemma":0.0022356862,"threshold_uncertainty_score":0.04755181},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017978869,0.00017212662,0.98962295,0.0007956519,0.00014424957,0.00014574965,0.00049388286,0.0019739938,0.0048535774],"genre_scores_gemma":[0.12747273,0.00047164262,0.85875887,0.00094586913,0.00018825723,0.00094721693,0.0013607715,0.00069306575,0.009161743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996219,0.0012678782,0.0006686029,0.00061219785,0.0009339507,0.00029845448],"domain_scores_gemma":[0.99589866,0.0020738805,0.00037197632,0.0006615243,0.0007735246,0.00022034161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005160301,0.0012195022,0.0010096298,0.0014529529,0.001452304,0.0040654955,0.0033878605,0.0024652937,0.0089277895],"category_scores_gemma":[0.005856892,0.0011699337,0.0030708131,0.0013005338,0.0037660934,0.008060764,0.0033636813,0.004871239,0.0018135563],"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.00006129149,0.00004058138,0.00013698608,0.00017285462,0.00002315137,0.00029119427,0.00085449655,0.009980111,0.001600392,0.9675216,0.0036021306,0.01571515],"study_design_scores_gemma":[0.00021412467,0.00010950988,0.00012033353,0.00020331968,0.00010293477,0.0005639497,0.00031417576,0.17859179,0.005750131,0.68266016,0.13122897,0.00014052082],"about_ca_topic_score_codex":0.0060228966,"about_ca_topic_score_gemma":0.0060663247,"teacher_disagreement_score":0.0089277895,"about_ca_system_score_codex":0.0026793364,"about_ca_system_score_gemma":0.0036023878,"threshold_uncertainty_score":0.029866457},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013577093,0.00037895745,0.97970164,0.0009632858,0.000108126646,0.00011640546,0.000014527257,0.00022879543,0.00491117],"genre_scores_gemma":[0.68399817,0.0005126146,0.30976316,0.00034090845,0.00024754004,0.0004341783,0.000078049714,0.00011941578,0.0045059873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960091,0.0021071106,0.0002626693,0.0004242691,0.0008252984,0.00037156232],"domain_scores_gemma":[0.9958413,0.0023196335,0.00029312138,0.0006007604,0.0005783211,0.0003667438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00801875,0.00061119697,0.0012994418,0.0005957096,0.0016594258,0.0041545783,0.002400954,0.0018599418,0.0027386423],"category_scores_gemma":[0.0119885905,0.0006725644,0.00069423765,0.0007089569,0.0019117958,0.004059989,0.005223653,0.0027542806,0.0005801473],"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.0004271404,0.00014807508,0.0011045736,0.0002047714,0.00013466633,0.00037122617,0.0012129765,0.47202244,0.0056521106,0.42113835,0.005246479,0.0923373],"study_design_scores_gemma":[0.000050863135,0.000043164673,0.00006958096,0.000018141413,0.000014236329,0.000041224528,0.00012157386,0.85984313,0.00062147767,0.13555305,0.0036101968,0.0000134470365],"about_ca_topic_score_codex":0.0014986398,"about_ca_topic_score_gemma":0.001784535,"teacher_disagreement_score":0.00801875,"about_ca_system_score_codex":0.00095835846,"about_ca_system_score_gemma":0.0017649503,"threshold_uncertainty_score":0.04240769},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03681626,0.0010941852,0.94349104,0.0014988044,0.00031363493,0.00018131002,0.0011254736,0.0021078123,0.013371405],"genre_scores_gemma":[0.80280674,0.0009775108,0.18835433,0.0004277804,0.00021745283,0.00021189637,0.001432652,0.00022547305,0.005346203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900997,0.0003055655,0.00004918797,0.00024708075,0.00028774235,0.00010043383],"domain_scores_gemma":[0.9953311,0.0033919702,0.00018094033,0.00046441614,0.0004754938,0.00015611337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017081016,0.0008953038,0.00092050125,0.0013088998,0.000726536,0.0015917524,0.0019423226,0.0015419503,0.008875599],"category_scores_gemma":[0.013293195,0.00052652124,0.0008591867,0.0010969912,0.0006398332,0.0033139973,0.0015648172,0.0018334917,0.0015621032],"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.00030035744,0.00014137899,0.005686581,0.00024311675,0.00012079231,0.00053680583,0.00033693062,0.60097027,0.0020014036,0.18251765,0.012557959,0.19458677],"study_design_scores_gemma":[0.000014042668,0.000014935575,0.00033074443,0.000027359347,0.000018668596,0.000046359044,0.00003008874,0.8877036,0.00055632676,0.10917576,0.0020660262,0.000016031328],"about_ca_topic_score_codex":0.0053693457,"about_ca_topic_score_gemma":0.008428254,"teacher_disagreement_score":0.008875599,"about_ca_system_score_codex":0.00084943586,"about_ca_system_score_gemma":0.0013225757,"threshold_uncertainty_score":0.029691875},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007654755,0.000063311054,0.996552,0.00012258755,0.000027725257,0.0001845505,0.00007888743,0.0008720887,0.001333357],"genre_scores_gemma":[0.033478636,0.0002279925,0.96232754,0.00020382283,0.000045844463,0.0005616678,0.0003327531,0.00047023495,0.002351508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9887707,0.0035407024,0.0014074972,0.002367571,0.0032225705,0.00069095806],"domain_scores_gemma":[0.984362,0.0065811393,0.0006768356,0.0059229685,0.0021413174,0.00031567723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008239971,0.001756355,0.0014362746,0.0022825631,0.0011635998,0.0046413722,0.0054619033,0.002355279,0.012170147],"category_scores_gemma":[0.028760754,0.001958324,0.0038823574,0.0019144908,0.0032427607,0.0075767534,0.0057032946,0.005563302,0.0049616024],"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.00018108726,0.00017674296,0.0003515302,0.00063187315,0.00012377836,0.00025474516,0.0004731421,0.012871312,0.01110811,0.8194651,0.0042791185,0.15008342],"study_design_scores_gemma":[0.00038291956,0.00029019034,0.00026062678,0.00037301797,0.00030230757,0.0010515887,0.00015577614,0.16289859,0.04756993,0.7146046,0.071962565,0.00014795641],"about_ca_topic_score_codex":0.0011572642,"about_ca_topic_score_gemma":0.0013365969,"teacher_disagreement_score":0.012170147,"about_ca_system_score_codex":0.002018836,"about_ca_system_score_gemma":0.0034168602,"threshold_uncertainty_score":0.04357767},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006406759,0.00024848952,0.9851896,0.0006264342,0.00008022116,0.00006455191,0.00006043745,0.0003080619,0.0070153587],"genre_scores_gemma":[0.61073,0.0005607928,0.3806014,0.00030657297,0.000211586,0.00032563577,0.00011508465,0.00012553336,0.0070232963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998231,0.00067300274,0.00011507879,0.00037535522,0.00043315956,0.00017243392],"domain_scores_gemma":[0.9959313,0.002835429,0.0003033778,0.0003216745,0.000424378,0.00018388356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028398267,0.000705613,0.00075258006,0.0014458693,0.0009541116,0.00262227,0.0023338476,0.001873218,0.006562362],"category_scores_gemma":[0.007862786,0.0005633112,0.002144105,0.00087831734,0.0034254377,0.0053210887,0.0019929581,0.0028732915,0.0006778377],"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.000051459163,0.000036788133,0.00065523264,0.00008256988,0.00008749735,0.0003513875,0.0006735473,0.06116478,0.0010953395,0.9188983,0.0006962269,0.016206782],"study_design_scores_gemma":[0.00004055063,0.000054061806,0.00017795901,0.000028657842,0.00006548069,0.00012439297,0.00007758588,0.2632168,0.0009214421,0.73123175,0.0040265964,0.00003475545],"about_ca_topic_score_codex":0.004539431,"about_ca_topic_score_gemma":0.003065516,"teacher_disagreement_score":0.006562362,"about_ca_system_score_codex":0.0019838475,"about_ca_system_score_gemma":0.0012889532,"threshold_uncertainty_score":0.021953285},"labels":[],"label_agreement":null},{"id":"W131525165","doi":"","title":"Dual lookups in pattern databases","year":2005,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Lookup table; Protein Data Bank (RCSB PDB); Heuristic; Table (database); Cube (algebra); Extension (predicate logic); Dual (grammatical number); Tree (set theory); Database; Combinatorics; Programming language; Mathematics; Artificial intelligence","score_opus":0.15470392933671911,"score_gpt":0.33638119803484745,"score_spread":0.18167726869812834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W131525165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028230757,0.0012861505,0.9528341,0.0007298267,0.00020993306,0.00018214513,0.0007771069,0.004490729,0.011259075],"genre_scores_gemma":[0.2698196,0.0006833739,0.71875995,0.0005069316,0.000071403745,0.00029401187,0.001500733,0.0007785303,0.0075854184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99502474,0.0011688625,0.0006757648,0.0009823294,0.0016695053,0.00047877786],"domain_scores_gemma":[0.9890205,0.003616489,0.0006273764,0.005537575,0.0009206475,0.00027735223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035172093,0.0006234614,0.0012845815,0.0022469684,0.0016006473,0.005067876,0.0038861448,0.0019804093,0.00907429],"category_scores_gemma":[0.017367102,0.0016483904,0.0013416378,0.0042668,0.0025038132,0.012357405,0.0065206825,0.002561436,0.0030030152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006752257,0.0002140125,0.0034763194,0.0005488742,0.00008178623,0.0007046603,0.0006619213,0.030783106,0.007126013,0.41533047,0.015808316,0.52458936],"study_design_scores_gemma":[0.00015599924,0.00021481134,0.00045902046,0.00018778934,0.00010975979,0.0014698197,0.0004843506,0.24793787,0.026043741,0.6537391,0.06908078,0.00011704636],"about_ca_topic_score_codex":0.00252023,"about_ca_topic_score_gemma":0.0025472727,"teacher_disagreement_score":0.00907429,"about_ca_system_score_codex":0.001415504,"about_ca_system_score_gemma":0.0018363975,"threshold_uncertainty_score":0.030356586},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2272914,0.0005376583,0.57497597,0.001619596,0.0006755732,0.00038425694,0.0040521133,0.0057245633,0.18473895],"genre_scores_gemma":[0.47159058,0.0001701818,0.4546833,0.00043231685,0.000044025786,0.0003287073,0.0039232746,0.001018699,0.06780899],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976724,0.000040867042,0.000011706303,0.000070860035,0.000057991016,0.000051281633],"domain_scores_gemma":[0.99975246,0.00011491364,0.000015681691,0.000038703816,0.00005804709,0.000020149773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023665962,0.00081833935,0.0006967769,0.00025556673,0.0006545949,0.000855156,0.0010200862,0.0009931684,0.0758862],"category_scores_gemma":[0.00080697134,0.0003120477,0.00050868234,0.0005244471,0.0004376086,0.00087557035,0.0012785266,0.000801655,0.0067628487],"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.0013573859,0.0004044134,0.004669159,0.0012356907,0.00017651463,0.0014359609,0.0006900587,0.3106918,0.013829808,0.07446554,0.08480679,0.5062369],"study_design_scores_gemma":[0.00047890423,0.00031566396,0.0014620736,0.00012428247,0.00006142837,0.00059305056,0.0014511836,0.7228637,0.01784012,0.12788874,0.12687859,0.000042385513],"about_ca_topic_score_codex":0.0023732733,"about_ca_topic_score_gemma":0.005496016,"teacher_disagreement_score":0.0758862,"about_ca_system_score_codex":0.00037270752,"about_ca_system_score_gemma":0.0006475822,"threshold_uncertainty_score":0.2538646},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11555943,0.00055626186,0.8606196,0.0015622375,0.00007251608,0.00072774396,0.00012375439,0.0003979809,0.020380475],"genre_scores_gemma":[0.7266972,0.00017132249,0.27082664,0.00021805185,0.000045547975,0.0004581967,0.00011082624,0.00005393185,0.0014183318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9647982,0.024369583,0.00083860726,0.0018508264,0.0073084594,0.00083431037],"domain_scores_gemma":[0.8963098,0.08754286,0.0035767537,0.0050279014,0.0058490387,0.0016937688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026372379,0.0014440193,0.0010114141,0.0018498271,0.0008377495,0.003542714,0.0031198007,0.0024685794,0.006932339],"category_scores_gemma":[0.10116883,0.00053720316,0.0010496761,0.00097571436,0.0042991266,0.0038118095,0.0029497591,0.0021748089,0.00046810557],"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.0013289416,0.0012082133,0.004584776,0.0005090533,0.0002208663,0.000108439235,0.00072053197,0.45519054,0.0032857382,0.42680523,0.0015426035,0.10449512],"study_design_scores_gemma":[0.00018218764,0.00066534977,0.00074189174,0.00006006238,0.000067991605,0.00004675549,0.00009579643,0.8951968,0.002149918,0.098947436,0.0018002948,0.00004560494],"about_ca_topic_score_codex":0.0031344108,"about_ca_topic_score_gemma":0.0024528052,"teacher_disagreement_score":0.026372379,"about_ca_system_score_codex":0.00503259,"about_ca_system_score_gemma":0.0038953866,"threshold_uncertainty_score":0.13947213},"labels":[],"label_agreement":null},{"id":"W15018536","doi":"10.1021/ic035133a","title":"Compiling control knowledge into preconditions for planning in the situation calculus","year":2003,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Situation calculus; Computer science; Calculus (dental); Domain (mathematical analysis); Control (management); Action (physics); Plan (archaeology); Transformation (genetics); Domain knowledge; Mathematics; Artificial intelligence","score_opus":0.13885397239882438,"score_gpt":0.36079424045340885,"score_spread":0.22194026805458447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W15018536","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009008159,0.00015159849,0.98039114,0.0005585103,0.00007423961,0.00024604797,0.0005568398,0.0020874932,0.006925877],"genre_scores_gemma":[0.28718534,0.00051785994,0.70507556,0.00024497317,0.00012179858,0.00068417384,0.0015413598,0.00033745018,0.0042915135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998553,0.0003395793,0.00016556453,0.0003206618,0.0003518746,0.00026930397],"domain_scores_gemma":[0.99763036,0.0015477341,0.00014935154,0.00031018278,0.00026216812,0.00010025439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027549684,0.0010768976,0.00082322216,0.0015314529,0.001081056,0.0027592108,0.0017010901,0.0011124972,0.0108340075],"category_scores_gemma":[0.00726318,0.00096430915,0.0025268353,0.0010941499,0.0033870926,0.0038515748,0.0032207952,0.0021603978,0.0014780711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029661457,0.00013896757,0.0011449042,0.00066293165,0.00012180457,0.00080713286,0.0009797481,0.36819375,0.002503723,0.4938719,0.0052006147,0.12607801],"study_design_scores_gemma":[0.00010177916,0.000055325443,0.0002078464,0.00016615934,0.00009817903,0.00006171245,0.00022195498,0.41955993,0.0039124982,0.563113,0.01246076,0.0000408847],"about_ca_topic_score_codex":0.015709642,"about_ca_topic_score_gemma":0.025664799,"teacher_disagreement_score":0.015709642,"about_ca_system_score_codex":0.0022187415,"about_ca_system_score_gemma":0.0033036955,"threshold_uncertainty_score":0.03624338},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06109751,0.00010650629,0.93671316,0.00008410273,0.000025269586,0.000052500658,0.00004469709,0.0013194396,0.0005569429],"genre_scores_gemma":[0.6186655,0.00010934417,0.37871826,0.00008026721,0.000051441606,0.00010422057,0.00046103867,0.00022731413,0.0015825074],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987249,0.00032099633,0.00004853073,0.00037179296,0.00040837616,0.00012538479],"domain_scores_gemma":[0.9968451,0.0011213426,0.00037480655,0.001008089,0.0005637494,0.000086912696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016074246,0.0007565543,0.0012452281,0.0009620805,0.00084373384,0.0007825606,0.00187574,0.0011677908,0.0010196388],"category_scores_gemma":[0.0060809916,0.00055163726,0.0007220564,0.0010241971,0.0013949018,0.0022769093,0.0023679626,0.0012560956,0.0007385679],"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.00056077004,0.00032575842,0.0039774925,0.00009750643,0.00006587801,0.000177883,0.00015679059,0.47165078,0.04298292,0.0059835124,0.0016883905,0.4723322],"study_design_scores_gemma":[0.000010520046,0.00005720924,0.00062067475,0.0000036490771,0.0000059496333,0.000073886564,0.000019447985,0.9887116,0.0076873987,0.0024181586,0.00038166984,0.000009809456],"about_ca_topic_score_codex":0.005144329,"about_ca_topic_score_gemma":0.0076076584,"teacher_disagreement_score":0.005144329,"about_ca_system_score_codex":0.0005665227,"about_ca_system_score_gemma":0.0011319461,"threshold_uncertainty_score":0.010228753},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034999752,0.0004855718,0.9937435,0.00046067682,0.000016774407,0.000030407105,0.000035031353,0.00013075247,0.0015972736],"genre_scores_gemma":[0.45711496,0.0020444638,0.5301758,0.00061985856,0.00026521643,0.0011767809,0.0003608175,0.00032834,0.007913793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997115,0.0019290268,0.000077979166,0.00028391212,0.00037714824,0.00021692262],"domain_scores_gemma":[0.98595864,0.012835914,0.00051731814,0.00019203762,0.0003100446,0.0001860604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054294486,0.0017465275,0.0024312125,0.0011694283,0.0007312061,0.0020017351,0.0019286126,0.0021008032,0.00510543],"category_scores_gemma":[0.019224178,0.0012300144,0.0012715044,0.001840999,0.0027305214,0.0028836026,0.0024246064,0.0038770903,0.0007216192],"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.000054432283,0.000060576913,0.00036294642,0.0001034416,0.00004078874,0.000046715355,0.00010031881,0.8628524,0.00015966497,0.11833105,0.0007718895,0.017115746],"study_design_scores_gemma":[0.00001130209,0.000011046827,0.000024809278,0.00001110201,0.000003652657,0.0000041737494,0.0000059935883,0.9287184,0.000046599896,0.070894994,0.0002624415,0.00000545611],"about_ca_topic_score_codex":0.008297607,"about_ca_topic_score_gemma":0.008343421,"teacher_disagreement_score":0.008297607,"about_ca_system_score_codex":0.0029588805,"about_ca_system_score_gemma":0.0025166066,"threshold_uncertainty_score":0.028714001},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04062356,0.0601929,0.2308291,0.43587255,0.0045616445,0.000097175405,0.00028204144,0.0007968363,0.22674409],"genre_scores_gemma":[0.7511286,0.043364264,0.11843472,0.015982203,0.008176663,0.00031660593,0.0003052684,0.000660578,0.06163109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683654,0.0011639952,0.00009960191,0.00044502842,0.0012167636,0.00023806916],"domain_scores_gemma":[0.9841283,0.010944152,0.00045241578,0.0009304196,0.0017943614,0.0017504239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008167002,0.00065164233,0.0012247628,0.001074536,0.0013717401,0.00921444,0.0020811558,0.003764237,0.011139101],"category_scores_gemma":[0.016823258,0.00030934685,0.000651997,0.0010690994,0.007227493,0.026452793,0.0027041193,0.008311839,0.0022330543],"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.00012248142,0.00011468587,0.0004728251,0.00022567048,0.000026018108,0.0000663296,0.00090128626,0.00182964,0.00071043114,0.8726541,0.017629642,0.10524688],"study_design_scores_gemma":[0.000034407145,0.00010497304,0.00027813006,0.00011255575,0.000011951147,0.00012317042,0.0013871371,0.00906658,0.00044324927,0.89537424,0.09304126,0.000022492137],"about_ca_topic_score_codex":0.0009483669,"about_ca_topic_score_gemma":0.0012396477,"teacher_disagreement_score":0.011139101,"about_ca_system_score_codex":0.001823539,"about_ca_system_score_gemma":0.0021280807,"threshold_uncertainty_score":0.04319173},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014186876,0.00012904644,0.98422086,0.0001059828,0.000018981422,0.000017868948,0.000040448842,0.00019616059,0.001083825],"genre_scores_gemma":[0.69349027,0.00047958043,0.30307397,0.00008356787,0.00006121109,0.000115803945,0.00016331505,0.000067568464,0.002464807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999376,0.00019136362,0.000023007637,0.00016889808,0.00020980215,0.000031014242],"domain_scores_gemma":[0.99850464,0.0008682296,0.0001861187,0.0002525545,0.0001415953,0.00004679066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001015008,0.00053204235,0.00045789347,0.0010523469,0.00043194887,0.0010698319,0.0013699275,0.0007457763,0.0011117497],"category_scores_gemma":[0.0070709395,0.00044310652,0.0005156956,0.00089254155,0.001228308,0.00366468,0.0016280783,0.0007074198,0.00021398586],"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.00017704038,0.0000665822,0.0019802044,0.00019404052,0.00006693759,0.00022029776,0.0003383649,0.6653271,0.013300037,0.15969804,0.00088688737,0.15774456],"study_design_scores_gemma":[0.000016758446,0.00006073332,0.0004587635,0.000014615443,0.000016609078,0.00011374376,0.000051262363,0.90347534,0.0029148702,0.09075034,0.0021108917,0.00001602201],"about_ca_topic_score_codex":0.0009839291,"about_ca_topic_score_gemma":0.00096530194,"teacher_disagreement_score":0.0013699275,"about_ca_system_score_codex":0.00047996631,"about_ca_system_score_gemma":0.00042445288,"threshold_uncertainty_score":0.0053679347},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008357261,0.00028605774,0.9817926,0.0008044158,0.00007378771,0.00023394558,0.0004897132,0.0014255091,0.006536653],"genre_scores_gemma":[0.19255102,0.0008522472,0.7928554,0.0007384915,0.00042540574,0.0005279686,0.0017869414,0.00040522643,0.009857358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99582314,0.0009643166,0.00055313716,0.00074393564,0.0015801487,0.00033521603],"domain_scores_gemma":[0.997083,0.00095691514,0.0003443354,0.00072013366,0.0006473126,0.00024828978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004844584,0.0006526202,0.0010329516,0.0017303093,0.0018027785,0.0055995523,0.0025077034,0.001295322,0.0068570557],"category_scores_gemma":[0.007082767,0.00061898853,0.0031090968,0.0028526618,0.0028373757,0.011264336,0.0030938848,0.0029710187,0.0020915652],"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.000085619955,0.000119218035,0.00031048036,0.00020644636,0.000050735885,0.00020394585,0.0004353694,0.011241037,0.0043034526,0.9526763,0.0030990057,0.027268423],"study_design_scores_gemma":[0.000074211,0.0001276799,0.00025896006,0.00008321372,0.000173472,0.00045573994,0.00025891856,0.12724943,0.00822098,0.8285866,0.034391675,0.000119053075],"about_ca_topic_score_codex":0.00608053,"about_ca_topic_score_gemma":0.005436776,"teacher_disagreement_score":0.0068570557,"about_ca_system_score_codex":0.0017302056,"about_ca_system_score_gemma":0.0033706983,"threshold_uncertainty_score":0.025620937},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005499438,0.0002846175,0.9930184,0.00047741484,0.000055022818,0.00006057615,0.00012006998,0.00018931662,0.0052447165],"genre_scores_gemma":[0.06786254,0.0015125332,0.92071056,0.00043810633,0.0003493738,0.0008561279,0.0004285786,0.0002793266,0.0075628716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974597,0.00086224894,0.00022355982,0.00043351328,0.000760993,0.00025997282],"domain_scores_gemma":[0.9984316,0.0006507344,0.00017303695,0.00033489813,0.000274911,0.00013470002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034912475,0.0014496938,0.0010003047,0.0019081542,0.0015338201,0.004160497,0.004119766,0.0023416993,0.009343317],"category_scores_gemma":[0.0046033496,0.00085358636,0.0028311266,0.0033565164,0.003567026,0.0046469225,0.0025393157,0.003683591,0.0027507464],"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.0000075651647,0.000010108201,0.00006307826,0.000059412254,0.000011451439,0.000041458843,0.00010693003,0.0356819,0.000354039,0.9563344,0.0012274664,0.0061020753],"study_design_scores_gemma":[0.000022517253,0.00004113361,0.00010954704,0.00006412373,0.000014982026,0.00011677604,0.00007323585,0.16466296,0.0002890699,0.78321046,0.051369276,0.000025861396],"about_ca_topic_score_codex":0.010421771,"about_ca_topic_score_gemma":0.009238135,"teacher_disagreement_score":0.010421771,"about_ca_system_score_codex":0.0030805024,"about_ca_system_score_gemma":0.0045717913,"threshold_uncertainty_score":0.031256557},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002807497,0.015015295,0.03226451,0.11288999,0.033464957,0.00047111273,0.0017639297,0.001734004,0.7995887],"genre_scores_gemma":[0.126315,0.018393368,0.0597296,0.053262547,0.0131172165,0.001481459,0.003222551,0.0020556608,0.72242266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940064,0.0029385597,0.00046088814,0.0008673705,0.001302555,0.00042406138],"domain_scores_gemma":[0.99333864,0.0017409218,0.00041792385,0.0015633095,0.0021477432,0.0007914972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060396222,0.0008631221,0.00051512354,0.002419819,0.002962178,0.009886458,0.0023630115,0.002864033,0.097596444],"category_scores_gemma":[0.015342553,0.0003787854,0.0007054819,0.0022880035,0.007260935,0.010945878,0.0060430067,0.004902723,0.047431797],"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.000080853264,0.000038045,0.00059749593,0.00029943007,0.000013668316,0.00023709312,0.0031905707,0.00012596244,0.00027644314,0.51336646,0.33624908,0.14552487],"study_design_scores_gemma":[0.000004625002,0.000012696306,0.00014548996,0.00020416695,0.0000032636863,0.00013724386,0.00081708573,0.00009611266,0.00006579703,0.030596038,0.9679078,0.000009700306],"about_ca_topic_score_codex":0.0040430436,"about_ca_topic_score_gemma":0.0044700284,"teacher_disagreement_score":0.097596444,"about_ca_system_score_codex":0.00423905,"about_ca_system_score_gemma":0.005175137,"threshold_uncertainty_score":0.3264926},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039625168,0.00018645814,0.9299639,0.00039780408,0.0002580679,0.00016083878,0.0005425801,0.0020300646,0.026835214],"genre_scores_gemma":[0.16734323,0.00015640157,0.80195385,0.00021840897,0.000074136056,0.00032434537,0.0009428633,0.0009817991,0.028004922],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999546,0.00006304159,0.000032278644,0.000129292,0.00013324257,0.00009609559],"domain_scores_gemma":[0.9993924,0.000294751,0.00005844388,0.0001047427,0.00010791074,0.00004163477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048402877,0.0010826662,0.0011402805,0.000459609,0.0007191169,0.0011680969,0.0010354946,0.0010683867,0.050689094],"category_scores_gemma":[0.0014798963,0.0005848815,0.0009315326,0.0007638173,0.0006858145,0.0017726329,0.0019089499,0.0014403255,0.006044347],"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.00061043375,0.00024847974,0.0020497441,0.00097134965,0.00009139856,0.000759259,0.00036135424,0.26073834,0.015670747,0.0905359,0.035328973,0.592634],"study_design_scores_gemma":[0.00018627523,0.0002606422,0.0006441452,0.000079419086,0.000030254045,0.0005922073,0.00060359394,0.81775653,0.018985795,0.10923983,0.051572517,0.000048765127],"about_ca_topic_score_codex":0.001158105,"about_ca_topic_score_gemma":0.0018081416,"teacher_disagreement_score":0.050689094,"about_ca_system_score_codex":0.0003908424,"about_ca_system_score_gemma":0.0009987872,"threshold_uncertainty_score":0.16957194},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039468568,0.002487466,0.8300396,0.0012694082,0.00071354926,0.0008370632,0.009652562,0.034331404,0.08120041],"genre_scores_gemma":[0.36010063,0.0016252004,0.5356037,0.0008639358,0.0002789601,0.0009980904,0.024825433,0.004700308,0.07100376],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855,0.00023346957,0.00015320655,0.00025256144,0.00046374634,0.00034693338],"domain_scores_gemma":[0.99640536,0.00049933325,0.00010185722,0.0021904074,0.0006465711,0.00015646215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009974331,0.0014483533,0.0019168678,0.0018413013,0.0018367252,0.0042176303,0.004385925,0.0015452744,0.056572407],"category_scores_gemma":[0.0055978475,0.0006064178,0.0012734472,0.005051785,0.0009020108,0.006325726,0.0048199245,0.0013284986,0.018483113],"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.0021254038,0.00045129808,0.0020267388,0.0009503055,0.00025324267,0.0005602602,0.0002909179,0.039814945,0.010771706,0.26792398,0.19228138,0.48254985],"study_design_scores_gemma":[0.00041958856,0.00019156131,0.0006841999,0.00015805551,0.00017800817,0.00074075634,0.00024056867,0.3778116,0.022890585,0.45577767,0.1407909,0.00011651425],"about_ca_topic_score_codex":0.0073115253,"about_ca_topic_score_gemma":0.011810222,"teacher_disagreement_score":0.056572407,"about_ca_system_score_codex":0.0018910286,"about_ca_system_score_gemma":0.003278983,"threshold_uncertainty_score":0.18925357},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034522165,0.00016164589,0.95676005,0.00032134374,0.000040538274,0.00007901573,0.000072949064,0.0000829733,0.00795932],"genre_scores_gemma":[0.7326419,0.0003487906,0.25882706,0.00012303784,0.00007339494,0.0002256381,0.00017006771,0.00005826358,0.00753193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951806,0.002437187,0.00018852456,0.00070517935,0.00096787646,0.0005206685],"domain_scores_gemma":[0.98573655,0.011082097,0.0009000037,0.0012362087,0.00061298494,0.0004322857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073481593,0.0008421459,0.0020622802,0.0009180449,0.0014090382,0.0035393995,0.0031831446,0.0025150103,0.0038461413],"category_scores_gemma":[0.025391117,0.0007054748,0.0013229891,0.0021537726,0.0025272786,0.0043805433,0.0026337174,0.002573163,0.0005849896],"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.0001440436,0.00005273694,0.0005819963,0.00003838557,0.00006565016,0.00014809848,0.00026612033,0.5981445,0.0004854291,0.3823184,0.0007851273,0.01696952],"study_design_scores_gemma":[0.000033244407,0.000016325585,0.00007559492,0.000007852158,0.000012541373,0.0000315795,0.00005377205,0.8045505,0.00029694618,0.19369762,0.0012113617,0.000012568312],"about_ca_topic_score_codex":0.0037808698,"about_ca_topic_score_gemma":0.003590034,"teacher_disagreement_score":0.0073481593,"about_ca_system_score_codex":0.0029171172,"about_ca_system_score_gemma":0.0019744704,"threshold_uncertainty_score":0.038861275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39588812,0.00014182886,0.5965433,0.0002692558,0.000117753734,0.00019043396,0.00004752661,0.0013176333,0.005484221],"genre_scores_gemma":[0.9020336,0.00004033743,0.09561543,0.00005378752,0.000010471373,0.000057007415,0.00004522207,0.000030873853,0.0021131644],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997354,0.000086194064,0.000016301825,0.00006571497,0.000061703606,0.00003462384],"domain_scores_gemma":[0.9988356,0.0007981456,0.00004607752,0.00005202717,0.0002056406,0.00006247238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010681933,0.0003176638,0.0002938543,0.00029101415,0.00031313603,0.0005104452,0.00058267923,0.0005154941,0.0024370516],"category_scores_gemma":[0.004540688,0.00013769402,0.0002518251,0.0003196397,0.0003291003,0.00047698256,0.00049664057,0.0007153176,0.00018024149],"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.0013738514,0.0007404227,0.0044635474,0.00017648442,0.00006653828,0.00028504815,0.00039879893,0.34272385,0.028756699,0.009289369,0.0014197197,0.6103056],"study_design_scores_gemma":[0.000015856996,0.00013607487,0.00044925502,0.0000022020859,0.0000057464044,0.000018170484,0.0000154419,0.9941221,0.0036733719,0.0012358133,0.00032129322,0.0000046850987],"about_ca_topic_score_codex":0.009023246,"about_ca_topic_score_gemma":0.006922875,"teacher_disagreement_score":0.009023246,"about_ca_system_score_codex":0.00067505945,"about_ca_system_score_gemma":0.0006071572,"threshold_uncertainty_score":0.017941475},"labels":[],"label_agreement":null},{"id":"W182621935","doi":"","title":"Flexible execution of partial order plans with temporal constraints","year":2013,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Plan (archaeology); Schedule; Executor; Generalization; Variety (cybernetics); State (computer science); Order (exchange); Distributed computing; Operations research; Artificial intelligence; Programming language; Operating system; Engineering","score_opus":0.08728091937032868,"score_gpt":0.2954974309334702,"score_spread":0.20821651156314153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W182621935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03203443,0.00014184984,0.9626186,0.00019800871,0.000034147073,0.00016280236,0.00014778592,0.0019569597,0.0027054234],"genre_scores_gemma":[0.3686346,0.00024036376,0.62847286,0.0000896488,0.000027987557,0.00029851726,0.0003249065,0.0002664974,0.0016446289],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988171,0.0003821236,0.00009012369,0.0001694569,0.00041789503,0.00012329157],"domain_scores_gemma":[0.9984022,0.00086158334,0.00017806333,0.00034407523,0.00013474822,0.00007933293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018573622,0.00067608996,0.00053465436,0.00049243105,0.00050377095,0.0009376429,0.00112962,0.00050851144,0.0013338501],"category_scores_gemma":[0.0036160785,0.00047279266,0.0008879136,0.00063289196,0.000977606,0.0014905533,0.0012231452,0.001261345,0.00021701325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022944053,0.00013335257,0.0009497963,0.00017519605,0.000080417245,0.00050085556,0.00047467198,0.78551704,0.015500666,0.06455894,0.002199921,0.12967978],"study_design_scores_gemma":[0.000044790326,0.000075413656,0.00020549567,0.000022161172,0.000026455671,0.000056302266,0.00006196299,0.9524493,0.0070864777,0.034256555,0.00569358,0.000021590678],"about_ca_topic_score_codex":0.005875618,"about_ca_topic_score_gemma":0.008688425,"teacher_disagreement_score":0.005875618,"about_ca_system_score_codex":0.00068174134,"about_ca_system_score_gemma":0.0018425313,"threshold_uncertainty_score":0.011682808},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010024186,0.00055505167,0.98361164,0.0003207118,0.0002452858,0.00011075421,0.00028857443,0.0018214133,0.003022398],"genre_scores_gemma":[0.45590544,0.00073476776,0.52821416,0.0006182811,0.00035040287,0.0005094293,0.0012379646,0.0005170725,0.011912507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935889,0.0013374145,0.0004511235,0.0012716867,0.0027242329,0.00062662014],"domain_scores_gemma":[0.98280567,0.0043186015,0.0013090133,0.004646892,0.0066236136,0.00029617027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039361473,0.0012793835,0.0017072026,0.0019036306,0.0010772614,0.0019162374,0.003511959,0.0019693626,0.0038145124],"category_scores_gemma":[0.028052345,0.0003695042,0.0009713794,0.002766284,0.0017235613,0.0027307486,0.00259077,0.0028113588,0.0027912438],"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.00086863386,0.0002394596,0.004196491,0.00030832682,0.00018287761,0.0003729165,0.00026279534,0.21628317,0.013089695,0.098902814,0.016337305,0.64895546],"study_design_scores_gemma":[0.00005475741,0.000120313205,0.0007594611,0.00009177454,0.00005552246,0.0003537777,0.000045571334,0.9054305,0.025964601,0.054824993,0.012228959,0.00006981839],"about_ca_topic_score_codex":0.0040063146,"about_ca_topic_score_gemma":0.0039246706,"teacher_disagreement_score":0.0040063146,"about_ca_system_score_codex":0.0012309725,"about_ca_system_score_gemma":0.002855802,"threshold_uncertainty_score":0.020816565},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003824142,0.000067795525,0.99433976,0.000048645266,0.000011398675,0.000042533073,0.000014556704,0.00019628795,0.0014548682],"genre_scores_gemma":[0.3108754,0.00024122697,0.68624747,0.00011745823,0.00003814576,0.0004212005,0.00012584015,0.00019871697,0.001734617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974948,0.0010417593,0.00012677978,0.00033540878,0.0007965818,0.00020465172],"domain_scores_gemma":[0.9950606,0.0030650853,0.00034701388,0.0006747434,0.0006993707,0.00015314746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033980461,0.0013040054,0.0014674342,0.0011251898,0.0007280046,0.0017771518,0.0022228516,0.001431184,0.0040503815],"category_scores_gemma":[0.013433164,0.0008955863,0.0010855658,0.0008868449,0.0020726556,0.002911749,0.0032591561,0.002606089,0.00095653767],"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.00024373404,0.000108671324,0.00081239414,0.00022032812,0.00009199502,0.000107930784,0.0004192802,0.66230327,0.003304459,0.21408738,0.0015118934,0.116788685],"study_design_scores_gemma":[0.000031311072,0.00005106386,0.000042338557,0.000025805452,0.000011544037,0.000020929763,0.000023395378,0.9130246,0.0015009012,0.08408537,0.0011710068,0.000011724868],"about_ca_topic_score_codex":0.0023825273,"about_ca_topic_score_gemma":0.002719816,"teacher_disagreement_score":0.0040503815,"about_ca_system_score_codex":0.0013340134,"about_ca_system_score_gemma":0.0015500445,"threshold_uncertainty_score":0.0179708},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016051572,0.00045678052,0.97431004,0.0006056806,0.0002523651,0.000092897506,0.00046886396,0.0006766315,0.007085102],"genre_scores_gemma":[0.30980158,0.0006296884,0.6765552,0.0009843362,0.00027646057,0.00039318364,0.0009669062,0.00077056285,0.009622007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922565,0.0018714648,0.00060032686,0.0018952811,0.0025175747,0.000858825],"domain_scores_gemma":[0.98145294,0.008934176,0.0016617201,0.0046399115,0.0025846583,0.00072665676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033608146,0.001003467,0.0013444985,0.001096636,0.0016150036,0.0025952219,0.0039790315,0.0019402254,0.007190499],"category_scores_gemma":[0.0180649,0.00075856847,0.0011590039,0.0018156344,0.00228391,0.006567568,0.0039135814,0.004945207,0.0017216565],"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.0007175521,0.0004417204,0.005054868,0.0008632714,0.0001879879,0.001047899,0.00078047626,0.18681377,0.03895848,0.5287186,0.017095959,0.2193195],"study_design_scores_gemma":[0.00015203864,0.00040476918,0.0019712949,0.0001773223,0.00012727143,0.0013854945,0.00021223816,0.51996726,0.05921041,0.2747688,0.14140089,0.00022221991],"about_ca_topic_score_codex":0.0030814311,"about_ca_topic_score_gemma":0.0030010326,"teacher_disagreement_score":0.007190499,"about_ca_system_score_codex":0.00083292543,"about_ca_system_score_gemma":0.0025022798,"threshold_uncertainty_score":0.024054587},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13453928,0.00049352297,0.85806865,0.00032806318,0.000068758105,0.00022664038,0.000515766,0.0035231353,0.002236275],"genre_scores_gemma":[0.73319167,0.00022071318,0.2600894,0.00024919384,0.0001670001,0.00039947513,0.0029852444,0.00015113656,0.0025461745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984485,0.0005131047,0.00011889069,0.00046408366,0.00033837813,0.00011704635],"domain_scores_gemma":[0.99098516,0.004901567,0.0009947445,0.0013622426,0.0015584474,0.0001979164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023443867,0.0010041241,0.00145532,0.0018528636,0.0005316467,0.0013529403,0.0021469644,0.0013413465,0.00089899794],"category_scores_gemma":[0.008923959,0.00048554232,0.0009786726,0.0010802957,0.0010196315,0.002348223,0.0009887057,0.0016235126,0.0011586788],"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.0005585126,0.0010675488,0.008769918,0.0003574405,0.00020014697,0.00026111308,0.00030160253,0.1599033,0.017013969,0.0038481103,0.010339344,0.797379],"study_design_scores_gemma":[0.000016921067,0.0000699547,0.0009479388,0.00001649157,0.000019714515,0.00007760579,0.00004167855,0.9868189,0.0070482125,0.004384414,0.00054695137,0.0000111899235],"about_ca_topic_score_codex":0.0018062657,"about_ca_topic_score_gemma":0.0030789447,"teacher_disagreement_score":0.0023443867,"about_ca_system_score_codex":0.000713863,"about_ca_system_score_gemma":0.0009623478,"threshold_uncertainty_score":0.012398422},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01280611,0.00021433634,0.9830944,0.00044232258,0.000067726614,0.00019566252,0.00006149471,0.00021772036,0.0029001143],"genre_scores_gemma":[0.5568302,0.00026947932,0.43641928,0.00034328087,0.00008839262,0.0012332739,0.0002897122,0.0001955712,0.0043308116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950447,0.002712234,0.00027576328,0.0008831434,0.00082747964,0.00025658656],"domain_scores_gemma":[0.98640126,0.010575134,0.0007277071,0.0006537473,0.0014135008,0.00022856737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0099020135,0.0015790473,0.0023489504,0.0016520639,0.000540406,0.0022883313,0.0021497377,0.0017404949,0.004934554],"category_scores_gemma":[0.03504909,0.0005846396,0.0015075317,0.0012919933,0.0018847235,0.0027201702,0.0028918558,0.0029818267,0.00048223473],"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.00035433116,0.00020194148,0.0031258122,0.00044430836,0.0005648281,0.000086445325,0.00070227863,0.7324294,0.0013935185,0.08542945,0.002192325,0.17307545],"study_design_scores_gemma":[0.00007427382,0.00025963798,0.00065378455,0.00006603593,0.00008085339,0.000035944573,0.00008855854,0.93509364,0.0007830733,0.061842535,0.0009893302,0.00003236127],"about_ca_topic_score_codex":0.0035488717,"about_ca_topic_score_gemma":0.0029789358,"teacher_disagreement_score":0.0099020135,"about_ca_system_score_codex":0.0020545078,"about_ca_system_score_gemma":0.0018822083,"threshold_uncertainty_score":0.05236751},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013398778,0.00038082898,0.9775622,0.00069976796,0.00007299069,0.0000936858,0.000030762465,0.00021827391,0.0075426907],"genre_scores_gemma":[0.8254225,0.0003764073,0.16676551,0.00012942629,0.00012812427,0.00017216869,0.000051051727,0.00005504343,0.0068997247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981932,0.0006799329,0.00009992655,0.00033281287,0.00048137733,0.00021280834],"domain_scores_gemma":[0.99675924,0.0011948994,0.0005138684,0.00040816152,0.00077253825,0.00035117954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024080996,0.00067014963,0.0008853877,0.00070621615,0.0013548292,0.0023349393,0.0023638806,0.0011417505,0.0026475466],"category_scores_gemma":[0.0071614324,0.00042211416,0.00071494654,0.00075827143,0.0010985553,0.0027431936,0.0019725545,0.00148538,0.00052869454],"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.00019143021,0.00017838545,0.0016962794,0.00018705173,0.0001483202,0.0006047316,0.00073198386,0.62104934,0.00693277,0.2589914,0.006422624,0.10286566],"study_design_scores_gemma":[0.000017850545,0.000047376816,0.00014456661,0.000009309639,0.000030692332,0.000092013666,0.00005725842,0.9747422,0.00059608335,0.021430697,0.002808407,0.000023512617],"about_ca_topic_score_codex":0.005013965,"about_ca_topic_score_gemma":0.0056430725,"teacher_disagreement_score":0.005013965,"about_ca_system_score_codex":0.0018203106,"about_ca_system_score_gemma":0.0019472797,"threshold_uncertainty_score":0.013207316},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055263765,0.0009040458,0.91885597,0.0051563103,0.000102516424,0.00013770316,0.0005607486,0.0008907754,0.018128276],"genre_scores_gemma":[0.64241683,0.000679557,0.34688944,0.0014183263,0.0003819061,0.00027208394,0.0007905754,0.00011480189,0.0070364936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947377,0.0020640276,0.0004038985,0.00097505614,0.0011381096,0.00068115187],"domain_scores_gemma":[0.986021,0.011116091,0.00075713935,0.0009916275,0.0007340574,0.00038018764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007911269,0.0007884454,0.0009400786,0.0016051831,0.0021285869,0.005558042,0.0030020745,0.0018532606,0.002359674],"category_scores_gemma":[0.013432191,0.0010249662,0.003973198,0.0017053538,0.006324818,0.010986704,0.0052178605,0.004797416,0.00032420983],"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.00008115809,0.00005224163,0.00041273417,0.000118686534,0.00005968515,0.000535457,0.0012719105,0.012441897,0.0011083652,0.97338843,0.0013156228,0.0092137195],"study_design_scores_gemma":[0.000050928167,0.000021669812,0.00013725163,0.000035571633,0.00005773053,0.00017577801,0.00018109079,0.048015118,0.0013905464,0.94650054,0.0034065973,0.000027258195],"about_ca_topic_score_codex":0.008338917,"about_ca_topic_score_gemma":0.008104579,"teacher_disagreement_score":0.008338917,"about_ca_system_score_codex":0.0034952776,"about_ca_system_score_gemma":0.0024713813,"threshold_uncertainty_score":0.041839242},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042926013,0.00025707434,0.9470994,0.0009474836,0.00003324079,0.00009208587,0.00009742035,0.00013740553,0.00840978],"genre_scores_gemma":[0.6068449,0.0007703101,0.3852534,0.00028613015,0.0000586042,0.00027214526,0.0001885646,0.00010625986,0.0062196665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99643975,0.0017914518,0.0001276699,0.00045900652,0.0007730415,0.00040903647],"domain_scores_gemma":[0.99383014,0.0040709563,0.0006582307,0.0004452945,0.0005314523,0.00046390202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035234552,0.0009360406,0.00097355444,0.00077098864,0.0013924403,0.0037563397,0.0020965491,0.0015727752,0.00271919],"category_scores_gemma":[0.009619368,0.0007194891,0.0008998758,0.0018930734,0.001978404,0.0052894712,0.0041161934,0.0022878707,0.0003462115],"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.00016741476,0.00015297023,0.0016374206,0.00029196704,0.00011392028,0.00067741453,0.0009078295,0.647276,0.0052497843,0.28220573,0.0017409335,0.05957865],"study_design_scores_gemma":[0.000040766176,0.000099136516,0.0004709995,0.000055825323,0.000045359964,0.0002843755,0.0011613861,0.70292836,0.0024680279,0.2830175,0.00936305,0.00006523014],"about_ca_topic_score_codex":0.0035932732,"about_ca_topic_score_gemma":0.00543029,"teacher_disagreement_score":0.0037563397,"about_ca_system_score_codex":0.0014626539,"about_ca_system_score_gemma":0.0021374922,"threshold_uncertainty_score":0.018634021},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100317895,0.000056514375,0.89722633,0.00010408541,0.000028447066,0.00004761316,0.000028749031,0.00057716557,0.0016131238],"genre_scores_gemma":[0.89216894,0.000038963182,0.10558772,0.000037779937,0.000012736503,0.00004768436,0.000038097278,0.000095671385,0.0019723354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994259,0.0002102619,0.000025422205,0.00011152121,0.00013649826,0.000090385955],"domain_scores_gemma":[0.99757653,0.0015002162,0.00033769239,0.00028573096,0.00016964522,0.0001300663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019277664,0.0008250952,0.00068100594,0.00040751934,0.00046800074,0.0010802761,0.0019631397,0.00092710624,0.0020944702],"category_scores_gemma":[0.006417607,0.0005399555,0.0004394754,0.00017563434,0.001387703,0.0016968393,0.0012962822,0.0015629653,0.00034809715],"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.00045942987,0.00006054508,0.002068459,0.000053375483,0.000038081875,0.00025842857,0.0002603273,0.9339762,0.0076702717,0.026810165,0.00053457124,0.027810276],"study_design_scores_gemma":[0.000005164106,0.000018561293,0.000093216186,0.0000016405368,0.000002473718,0.00001438935,0.000007981621,0.99508166,0.0008619271,0.0037838724,0.00012436206,0.000004727394],"about_ca_topic_score_codex":0.0031507772,"about_ca_topic_score_gemma":0.003052079,"teacher_disagreement_score":0.0031507772,"about_ca_system_score_codex":0.00070113264,"about_ca_system_score_gemma":0.00074639916,"threshold_uncertainty_score":0.010195136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024925627,0.0011367624,0.95051247,0.0036630563,0.00012801646,0.00007162202,0.00029191354,0.00045984707,0.018810773],"genre_scores_gemma":[0.7429689,0.0011543824,0.24982616,0.0006362957,0.00034459349,0.00023035081,0.00035474615,0.00009994725,0.0043846117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921296,0.0030153212,0.0005626122,0.000974296,0.0025475982,0.0007705207],"domain_scores_gemma":[0.9924775,0.0052397633,0.00047614472,0.0007820656,0.00064284226,0.00038186726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009367282,0.0010117997,0.0012740011,0.0021774636,0.0028260641,0.0072918283,0.0027603353,0.0022076312,0.0030145296],"category_scores_gemma":[0.015745925,0.0010953748,0.0025831787,0.0023828084,0.008093439,0.012958147,0.0060834386,0.004715714,0.00044794887],"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.000025401165,0.000013346596,0.0001918018,0.000036452624,0.000025658266,0.00017993727,0.00039471657,0.011929376,0.00023505987,0.98280764,0.0004730112,0.003687504],"study_design_scores_gemma":[0.000014100113,0.0000070302267,0.0000466541,0.00001547952,0.00001830569,0.000051590778,0.00008638281,0.03443318,0.00018557109,0.96317756,0.0019500883,0.000014136816],"about_ca_topic_score_codex":0.0076452694,"about_ca_topic_score_gemma":0.00573117,"teacher_disagreement_score":0.009367282,"about_ca_system_score_codex":0.0043791775,"about_ca_system_score_gemma":0.0024490734,"threshold_uncertainty_score":0.049539566},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03780582,0.0013778303,0.84853745,0.004301146,0.00031487682,0.0004858626,0.0004954447,0.00013700948,0.106544524],"genre_scores_gemma":[0.7830514,0.0018740181,0.17335142,0.0012814892,0.0003403535,0.0009327003,0.000604367,0.00009862106,0.03846566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99534506,0.0021925548,0.0002681681,0.0007619738,0.0010938159,0.0003384119],"domain_scores_gemma":[0.9955929,0.002708562,0.00035104403,0.00041257511,0.0005165776,0.00041820668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024748459,0.0012530198,0.001256375,0.0011268648,0.0018346163,0.0036936302,0.002153578,0.0022750825,0.0077251573],"category_scores_gemma":[0.0089404555,0.0003810944,0.0008845949,0.0013362736,0.003839736,0.005852429,0.0035398754,0.002479,0.0011497863],"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.0000094046145,0.000015940706,0.00009420633,0.00003256575,0.000012023112,0.000037611106,0.00012121103,0.0049877632,0.00014547251,0.9888194,0.0008226816,0.004901705],"study_design_scores_gemma":[0.000018906663,0.00002361767,0.00006551992,0.000019071456,0.000009250842,0.0000719855,0.00011284286,0.025706252,0.00013868992,0.9593342,0.014490002,0.000009722612],"about_ca_topic_score_codex":0.0018127718,"about_ca_topic_score_gemma":0.0012920605,"teacher_disagreement_score":0.0077251573,"about_ca_system_score_codex":0.0026058608,"about_ca_system_score_gemma":0.0012457863,"threshold_uncertainty_score":0.025843203},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26406837,0.0074863406,0.6588402,0.018902233,0.0006045329,0.0004591101,0.0046167597,0.0020659994,0.04295653],"genre_scores_gemma":[0.75072277,0.005518791,0.21729258,0.0029172138,0.001365607,0.00075030426,0.00459942,0.0009666825,0.015866674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964954,0.0011396096,0.00013915672,0.0009264599,0.00068357313,0.0006159388],"domain_scores_gemma":[0.9526215,0.04138625,0.0020745494,0.0020745355,0.0010445396,0.0007985989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033145424,0.0017616164,0.002029904,0.0014872596,0.001631541,0.005221198,0.0034599216,0.0025874784,0.012234288],"category_scores_gemma":[0.027209744,0.0012991466,0.0029904153,0.0034103503,0.003199416,0.009260004,0.0028553784,0.006915293,0.0013740669],"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.001098714,0.00093079556,0.0051650493,0.0019220386,0.00039440359,0.0005367409,0.0011369915,0.5312829,0.005691001,0.31210718,0.054335482,0.085398704],"study_design_scores_gemma":[0.00012013408,0.00010554382,0.0006746975,0.00010316961,0.000087511835,0.00030077074,0.00020176565,0.35600188,0.0016594715,0.6367345,0.0039803586,0.000030294894],"about_ca_topic_score_codex":0.005043775,"about_ca_topic_score_gemma":0.00473605,"teacher_disagreement_score":0.012234288,"about_ca_system_score_codex":0.0037219066,"about_ca_system_score_gemma":0.00208773,"threshold_uncertainty_score":0.040927827},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04133887,0.012980592,0.85263324,0.0032309154,0.0042511607,0.0015761789,0.018296616,0.048185077,0.017507372],"genre_scores_gemma":[0.25980106,0.0034213997,0.68047017,0.0015969591,0.0012284872,0.0041086897,0.031266224,0.006768447,0.011338551],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99094397,0.0030371803,0.00059063005,0.0015706185,0.0032664025,0.0005911629],"domain_scores_gemma":[0.96465343,0.018457705,0.0018518092,0.0084615005,0.0058632004,0.0007123724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01026262,0.0029222297,0.0014599062,0.0026332112,0.00067665265,0.0028872574,0.0044769705,0.0028128845,0.03368981],"category_scores_gemma":[0.07388594,0.0009565016,0.0014809277,0.0033774886,0.0009091929,0.004270681,0.0023294983,0.0029057637,0.016291829],"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.0015381166,0.0016557496,0.011371995,0.0011697046,0.00041391255,0.000096782554,0.00010048708,0.1214623,0.0018209062,0.009660696,0.3310579,0.5196514],"study_design_scores_gemma":[0.0004599142,0.00043893757,0.004883332,0.00018723197,0.00016714825,0.0001951686,0.00006874781,0.9469383,0.00601372,0.017412556,0.023158096,0.00007692783],"about_ca_topic_score_codex":0.00804385,"about_ca_topic_score_gemma":0.010067892,"teacher_disagreement_score":0.03368981,"about_ca_system_score_codex":0.0024715236,"about_ca_system_score_gemma":0.004092611,"threshold_uncertainty_score":0.11270368},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044195164,0.00065570604,0.91264445,0.0061928406,0.00026972583,0.0008380839,0.0003655423,0.0011771139,0.03366137],"genre_scores_gemma":[0.75392187,0.0006107462,0.2214834,0.0005482201,0.00027382385,0.0005400343,0.0003249516,0.00016865664,0.02212825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9848622,0.008058155,0.00061549596,0.0021916328,0.003038631,0.0012338496],"domain_scores_gemma":[0.9693563,0.014035422,0.0023109184,0.006061761,0.006054491,0.0021811023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017475333,0.0011082719,0.0022471126,0.0030384173,0.0034302657,0.0066694114,0.006113349,0.00569322,0.0145699335],"category_scores_gemma":[0.054353196,0.00087973615,0.0014976627,0.004176594,0.0027927402,0.013981036,0.0072897915,0.0022028836,0.0032925883],"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.0006563947,0.0007097688,0.011136897,0.0003539325,0.0002214841,0.0012272252,0.0013486894,0.085261784,0.0032905736,0.5661098,0.019485928,0.31019756],"study_design_scores_gemma":[0.00012208057,0.00032320674,0.0015644885,0.000079586534,0.00012465304,0.00096544635,0.0007295571,0.6232021,0.0016909421,0.34893757,0.022149496,0.00011091779],"about_ca_topic_score_codex":0.00440611,"about_ca_topic_score_gemma":0.0026805573,"teacher_disagreement_score":0.017475333,"about_ca_system_score_codex":0.0036491826,"about_ca_system_score_gemma":0.0042171436,"threshold_uncertainty_score":0.092419505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00824587,0.00008268343,0.979156,0.00029427148,0.000046119996,0.0002041686,0.00009659485,0.0032853868,0.008588768],"genre_scores_gemma":[0.16945083,0.0002701669,0.8135831,0.00033835982,0.00003535835,0.0011162793,0.00026098115,0.0019522845,0.012992651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768376,0.0012538502,0.00013155113,0.00026959353,0.00054145925,0.0001197323],"domain_scores_gemma":[0.9935262,0.0037302256,0.00021081381,0.0015934262,0.00061630335,0.00032293188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031954343,0.0010575065,0.00042747942,0.0005463314,0.00058631226,0.0024689739,0.0018824663,0.0013632702,0.0071390835],"category_scores_gemma":[0.009188466,0.0005195561,0.0005148111,0.00036658414,0.0026785147,0.002715742,0.0026913045,0.00214411,0.0019852794],"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.00082464254,0.00045136636,0.003712596,0.0017558984,0.00007349881,0.0010927792,0.015534835,0.0290886,0.24966323,0.35557815,0.025692027,0.3165324],"study_design_scores_gemma":[0.00028968923,0.0010673691,0.0032914728,0.00045211185,0.00009824928,0.0034244363,0.001421565,0.2840867,0.12999554,0.12665369,0.44898537,0.00023388621],"about_ca_topic_score_codex":0.0005203134,"about_ca_topic_score_gemma":0.00091302895,"teacher_disagreement_score":0.0071390835,"about_ca_system_score_codex":0.0004251704,"about_ca_system_score_gemma":0.00055284554,"threshold_uncertainty_score":0.023882627},"labels":[],"label_agreement":null},{"id":"W2397939602","doi":"","title":"Controlling the hypothesis space in probabilistic plan recognition","year":2013,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Université de Sherbrooke","funders":"","keywords":"Plan (archaeology); Computer science; Probabilistic logic; Heuristic; Sequence (biology); Artificial intelligence; Machine learning; Space (punctuation); Execution time; Combinatorial explosion; Theoretical computer science; Distributed computing; Mathematics","score_opus":0.15718557414285686,"score_gpt":0.2803320152353006,"score_spread":0.12314644109244374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397939602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037210573,0.00020963275,0.96001244,0.00029258523,0.000017545875,0.00007115493,0.00006885019,0.001097471,0.0010196249],"genre_scores_gemma":[0.62157,0.00019799714,0.37575927,0.00029534227,0.000049043167,0.00032310633,0.00032099066,0.00024904584,0.0012351193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99571,0.0019654962,0.00024482093,0.0008355378,0.00086361426,0.00038039763],"domain_scores_gemma":[0.96268535,0.032387454,0.0015765376,0.0018717073,0.00095348107,0.0005254301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069295526,0.0010014985,0.0018521529,0.0016339957,0.00089264585,0.0025381385,0.003318579,0.0016392384,0.0030287073],"category_scores_gemma":[0.034050986,0.0012915301,0.0011651575,0.0013923323,0.0035438335,0.005941638,0.0027928702,0.002838169,0.00047117303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004789125,0.00016995681,0.0026427675,0.00014335007,0.00009830185,0.00011371525,0.00027116525,0.8203815,0.0022879166,0.040431682,0.0010771165,0.13190351],"study_design_scores_gemma":[0.000016287302,0.000032267715,0.00012175664,0.000008280209,0.000008990465,0.000016085225,0.000017943887,0.97250235,0.0007738268,0.02632942,0.00016306208,0.000009786477],"about_ca_topic_score_codex":0.0074196835,"about_ca_topic_score_gemma":0.007155793,"teacher_disagreement_score":0.0074196835,"about_ca_system_score_codex":0.0020948679,"about_ca_system_score_gemma":0.002683755,"threshold_uncertainty_score":0.03664738},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009377686,0.00008728806,0.9986205,0.000054582073,0.0000070350115,0.00001534346,0.000014415316,0.0000702455,0.00019283325],"genre_scores_gemma":[0.11894339,0.0005271435,0.8761837,0.00023810207,0.00009145034,0.00045416848,0.00044898447,0.00028516146,0.0028278737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954412,0.0024664542,0.00018461731,0.0008200782,0.00089151185,0.00019603201],"domain_scores_gemma":[0.9926052,0.005776136,0.0003444117,0.0004889509,0.0006018275,0.00018336857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008426469,0.0012898528,0.0024892846,0.0022383365,0.0011716065,0.0027244189,0.0042376053,0.00257254,0.0025095313],"category_scores_gemma":[0.022131145,0.0017052087,0.0024444505,0.001959756,0.0025135477,0.0034179937,0.0038786654,0.0040117563,0.000858694],"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.00010325412,0.00008228776,0.0010286858,0.00017328985,0.000143952,0.00008624653,0.00036941067,0.7033736,0.0019714467,0.20337924,0.0019468097,0.08734181],"study_design_scores_gemma":[0.0000048664742,0.000006417916,0.000051447314,0.000008580246,0.0000056110607,0.000015919148,0.000008669192,0.9581406,0.00021833154,0.041027278,0.0005023747,0.0000099220315],"about_ca_topic_score_codex":0.0068577905,"about_ca_topic_score_gemma":0.0071093687,"teacher_disagreement_score":0.008426469,"about_ca_system_score_codex":0.002498228,"about_ca_system_score_gemma":0.002234473,"threshold_uncertainty_score":0.04456395},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010532861,0.0002874892,0.9663115,0.0017416893,0.00011744871,0.000086336215,0.00019644252,0.0007099741,0.020016389],"genre_scores_gemma":[0.58532816,0.0005964968,0.40234727,0.00094851,0.0003592942,0.00033512458,0.0005458132,0.00035310505,0.009186193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99694186,0.0010243693,0.00018277517,0.00052635605,0.0010243518,0.0003003357],"domain_scores_gemma":[0.9978339,0.0008514977,0.00020531469,0.0005399024,0.00044802914,0.000121380486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032753216,0.0007687389,0.0006509133,0.0015366334,0.0012898933,0.0031043964,0.0023408039,0.0014590793,0.0055870367],"category_scores_gemma":[0.004372729,0.0006218982,0.0027046134,0.0009975248,0.004560872,0.008747166,0.003848566,0.0031184293,0.0010419958],"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.000011295091,0.000014172773,0.000045866433,0.00004207311,0.000011908714,0.00006954872,0.0002263411,0.0016989139,0.00069690146,0.9899794,0.00062356604,0.0065801595],"study_design_scores_gemma":[0.00001588842,0.0000315903,0.000043254164,0.000023365894,0.000013701378,0.000086639484,0.000051933417,0.016111663,0.0008717714,0.97318,0.009556966,0.00001322049],"about_ca_topic_score_codex":0.0016680752,"about_ca_topic_score_gemma":0.0016475627,"teacher_disagreement_score":0.0055870367,"about_ca_system_score_codex":0.0018284406,"about_ca_system_score_gemma":0.002055663,"threshold_uncertainty_score":0.018690526},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18904641,0.00028962287,0.79077005,0.0006383977,0.00004396167,0.00016593223,0.00031575264,0.00012163479,0.018608198],"genre_scores_gemma":[0.9620994,0.0002706067,0.032855265,0.00011596347,0.00008700956,0.00019814212,0.00021713767,0.000078374615,0.004078095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951721,0.0019195132,0.00025477834,0.000928993,0.000981253,0.00074339396],"domain_scores_gemma":[0.96973175,0.022297882,0.003391806,0.0022306761,0.0013832472,0.0009646432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064097247,0.00084953615,0.0012864143,0.0020374176,0.0009240514,0.0033053383,0.0029426978,0.0016017336,0.007931812],"category_scores_gemma":[0.04953845,0.000640436,0.001085949,0.002367055,0.0044397996,0.00729306,0.0018632315,0.002358904,0.0006850978],"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.00009598403,0.00006613037,0.0022583546,0.0000817402,0.00004666357,0.00012040783,0.00041691118,0.08997986,0.0021824,0.8898451,0.0006690859,0.014237403],"study_design_scores_gemma":[0.000031657164,0.000070795744,0.0010495418,0.000031719603,0.000013649952,0.00014571087,0.00011155486,0.4367729,0.0007065535,0.5596999,0.0013347678,0.00003120729],"about_ca_topic_score_codex":0.0012527632,"about_ca_topic_score_gemma":0.0005890993,"teacher_disagreement_score":0.007931812,"about_ca_system_score_codex":0.0022390278,"about_ca_system_score_gemma":0.00085134857,"threshold_uncertainty_score":0.033898234},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41076505,0.0010091502,0.53831875,0.002543241,0.00021747728,0.00026808618,0.00048262556,0.00050009065,0.045895513],"genre_scores_gemma":[0.97912437,0.00012476959,0.016771037,0.00014120717,0.000058666297,0.00007631989,0.0001286563,0.000051065672,0.0035239581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96959203,0.019840851,0.0011981286,0.0030454665,0.0041164323,0.0022070839],"domain_scores_gemma":[0.9183812,0.046143606,0.011572835,0.017414598,0.0047577694,0.0017299434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015122587,0.0003995651,0.0013678207,0.0014668886,0.0020310374,0.004173529,0.002212024,0.0016563556,0.0070526367],"category_scores_gemma":[0.10882427,0.0005162253,0.00072662154,0.002208209,0.0027792288,0.0047741253,0.0039488543,0.002258289,0.0010441059],"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.000979237,0.00013790892,0.038291864,0.00022344025,0.0001813401,0.0004226991,0.0016886017,0.11726418,0.0017218202,0.7091271,0.0063390546,0.1236228],"study_design_scores_gemma":[0.00012687828,0.00030650262,0.013309199,0.00009631233,0.00013292508,0.0007499299,0.0011217608,0.30693683,0.004707103,0.6594908,0.012920209,0.000101488],"about_ca_topic_score_codex":0.0012869413,"about_ca_topic_score_gemma":0.0015045789,"teacher_disagreement_score":0.015122587,"about_ca_system_score_codex":0.0026561776,"about_ca_system_score_gemma":0.0013637221,"threshold_uncertainty_score":0.07997686},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021021902,0.00017532364,0.9968458,0.00008602989,0.000043442145,0.000033237327,0.000040367107,0.00023996673,0.0004336921],"genre_scores_gemma":[0.31924137,0.000712058,0.67388576,0.0005289235,0.00034765177,0.0006738243,0.0008205143,0.00026385539,0.003526034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984428,0.0007186025,0.00007923998,0.00026564696,0.00036296062,0.00013071891],"domain_scores_gemma":[0.99795234,0.0008001297,0.00015212745,0.0004957275,0.00046706107,0.00013251518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026070026,0.0011913702,0.0022209415,0.0008245616,0.0005513844,0.0010050965,0.002003214,0.0014285783,0.0028426542],"category_scores_gemma":[0.0070199575,0.000554653,0.0011605285,0.0012839528,0.000901041,0.0016166592,0.0023722087,0.002045176,0.0016848393],"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.00029878612,0.0002102345,0.0014139833,0.00038689256,0.00027663808,0.00017524823,0.00021055776,0.50505733,0.0069616456,0.08692726,0.016004877,0.3820766],"study_design_scores_gemma":[0.00001683834,0.00003753727,0.00007938368,0.00000795959,0.000009261772,0.00002731556,0.000008207118,0.9660088,0.00058,0.031478453,0.0017387633,0.00000749798],"about_ca_topic_score_codex":0.001683655,"about_ca_topic_score_gemma":0.001913794,"teacher_disagreement_score":0.0028426542,"about_ca_system_score_codex":0.00068104843,"about_ca_system_score_gemma":0.0011976617,"threshold_uncertainty_score":0.013787329},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5174592,0.012614079,0.4264037,0.00433194,0.0011855725,0.0009747125,0.003434411,0.0066573094,0.026939139],"genre_scores_gemma":[0.9121903,0.0006467567,0.08055582,0.00082850055,0.0002593557,0.00046275475,0.0027749268,0.0010383116,0.001243263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.88347596,0.06706894,0.008451598,0.010624017,0.0276237,0.002755785],"domain_scores_gemma":[0.71935904,0.20843413,0.01463038,0.035753056,0.020080222,0.0017432036],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.06784707,0.0018584782,0.002403643,0.003977875,0.0010797487,0.005443977,0.0026309432,0.0022650925,0.0025830495],"category_scores_gemma":[0.3010881,0.0007302806,0.001276846,0.0054004653,0.0024883328,0.0056064255,0.003376229,0.002448966,0.001256475],"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.0039065755,0.0007021968,0.1187666,0.001593141,0.002453315,0.0002500455,0.0009942913,0.3880457,0.0064596096,0.052447688,0.023828857,0.40055197],"study_design_scores_gemma":[0.00052945287,0.0020022287,0.028958485,0.0005539659,0.0005207946,0.0006445718,0.00060671486,0.83595693,0.024440223,0.084201425,0.02134246,0.0002427939],"about_ca_topic_score_codex":0.0018953534,"about_ca_topic_score_gemma":0.0017166489,"teacher_disagreement_score":0.9321529,"about_ca_system_score_codex":0.002971931,"about_ca_system_score_gemma":0.0026628294,"threshold_uncertainty_score":0.35881388},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075731236,0.00017260693,0.9911493,0.00014164056,0.000036379217,0.000039173516,0.00013975723,0.0004216714,0.0003263462],"genre_scores_gemma":[0.50500846,0.00054484786,0.4880208,0.00032755497,0.00036092507,0.00047563258,0.0019333627,0.00019441763,0.0031339733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99591124,0.0017837116,0.00024527474,0.001248627,0.00048998115,0.00032116962],"domain_scores_gemma":[0.995887,0.0027643163,0.00031317954,0.00055795425,0.00033747524,0.00014010676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003426605,0.0011376343,0.0026013176,0.00225103,0.0008515916,0.0015138715,0.0039107236,0.001764867,0.0013644282],"category_scores_gemma":[0.010150111,0.0008900685,0.0026006002,0.003616666,0.0012890637,0.0027831711,0.0024488496,0.0028578872,0.0012120375],"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.00039996416,0.00036362302,0.005261322,0.0002126344,0.00030759047,0.00022339048,0.0007555545,0.6924422,0.00457897,0.031058377,0.0040816427,0.2603148],"study_design_scores_gemma":[0.000008220324,0.000014325416,0.0002447555,0.0000049585087,0.000009851547,0.000023044753,0.000020492831,0.98548615,0.00052439363,0.013278513,0.00037408932,0.0000111076815],"about_ca_topic_score_codex":0.009490383,"about_ca_topic_score_gemma":0.00992163,"teacher_disagreement_score":0.009490383,"about_ca_system_score_codex":0.0012135156,"about_ca_system_score_gemma":0.0013033858,"threshold_uncertainty_score":0.018870234},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009015708,0.00011715292,0.9684019,0.00035361134,0.00008920484,0.0001965913,0.00088693533,0.012951272,0.007987593],"genre_scores_gemma":[0.20555142,0.00017131703,0.780556,0.00028783784,0.000053899792,0.00026613424,0.004186119,0.0021448755,0.0067823757],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983494,0.00055973936,0.00008817462,0.00031912402,0.0005509098,0.00013263834],"domain_scores_gemma":[0.99645424,0.0022347723,0.00015763704,0.00062312064,0.0004609152,0.00006930598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011210621,0.0005722389,0.00049583573,0.0009526028,0.00056146644,0.001905508,0.0022448355,0.0008053738,0.008968469],"category_scores_gemma":[0.007705161,0.0005829225,0.0015365887,0.0010810395,0.0009981617,0.0020244797,0.0025113355,0.0023399754,0.0029518213],"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.00035864874,0.00044914504,0.0020502813,0.0005710957,0.00019301685,0.0008372724,0.0008769085,0.15039921,0.022020537,0.36300227,0.034425333,0.42481622],"study_design_scores_gemma":[0.00007274206,0.000047488167,0.00025796975,0.000049881633,0.00005102429,0.00012932724,0.00016616337,0.73525596,0.013382759,0.23251078,0.01805364,0.000022273605],"about_ca_topic_score_codex":0.0042187,"about_ca_topic_score_gemma":0.0079962285,"teacher_disagreement_score":0.008968469,"about_ca_system_score_codex":0.0008996706,"about_ca_system_score_gemma":0.0020881472,"threshold_uncertainty_score":0.030002534},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12772131,0.0031662274,0.8617611,0.0010597501,0.00023233042,0.00013941083,0.0008907966,0.0018947797,0.0031344066],"genre_scores_gemma":[0.862803,0.0012490064,0.12544505,0.00034613136,0.00022665909,0.00041089382,0.0018426032,0.000112878304,0.007563742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996195,0.00013487264,0.000024256535,0.0001268029,0.000053709955,0.000040711133],"domain_scores_gemma":[0.99886847,0.0007273203,0.00012297425,0.0000871127,0.00015579152,0.000038368154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011335253,0.0010051597,0.0007083417,0.001234916,0.00036108715,0.00085485214,0.001705898,0.0013670373,0.0017060611],"category_scores_gemma":[0.004334306,0.00038357527,0.0007674712,0.0016251914,0.00048569418,0.0018009157,0.0006992488,0.0022247636,0.00056633784],"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.00017885055,0.000106439955,0.0016602885,0.000104762876,0.00006743332,0.0000801744,0.00014181367,0.9070443,0.0023107973,0.010588394,0.0021603347,0.07555647],"study_design_scores_gemma":[0.000004975131,0.00001118073,0.00010162774,0.0000040220507,0.00000500141,0.00000647212,0.000004694368,0.99548304,0.00025474982,0.0038269819,0.00029405532,0.0000032501248],"about_ca_topic_score_codex":0.0075603854,"about_ca_topic_score_gemma":0.009002744,"teacher_disagreement_score":0.0075603854,"about_ca_system_score_codex":0.0015077385,"about_ca_system_score_gemma":0.000487492,"threshold_uncertainty_score":0.015032709},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008040648,0.00029206084,0.98474956,0.00078307826,0.000050745304,0.00010354095,0.00041023124,0.001589649,0.003980453],"genre_scores_gemma":[0.17447944,0.00048212384,0.81907845,0.00053137756,0.00009515039,0.0001742998,0.0011007203,0.0003387666,0.0037196884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970908,0.0008418037,0.0003999755,0.0005879139,0.00079046737,0.00028904103],"domain_scores_gemma":[0.99492776,0.0021762243,0.00033958233,0.0017079856,0.0006083506,0.00024019832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040895124,0.0005753307,0.0008543211,0.0012547539,0.0011860535,0.007801802,0.0023366963,0.0010773513,0.0047653206],"category_scores_gemma":[0.011181448,0.00051560445,0.0016845865,0.0020823139,0.002231093,0.008164516,0.0041949986,0.002411677,0.001257798],"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.00015757466,0.00011303132,0.0012334101,0.00030340336,0.000048999376,0.0002880864,0.0009272621,0.013969885,0.003602253,0.87195045,0.0049566375,0.10244902],"study_design_scores_gemma":[0.000037677128,0.000057073517,0.00033724974,0.00019067463,0.00008651021,0.00040881115,0.00082816905,0.25752607,0.013543103,0.66897625,0.05794287,0.00006565044],"about_ca_topic_score_codex":0.0055508963,"about_ca_topic_score_gemma":0.006757566,"teacher_disagreement_score":0.007801802,"about_ca_system_score_codex":0.0024390751,"about_ca_system_score_gemma":0.0021505735,"threshold_uncertainty_score":0.021627724},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96916705,0.0005995333,0.027641697,0.00008125525,0.000037258495,0.00012629811,0.00082404487,0.000777533,0.00074529287],"genre_scores_gemma":[0.9810939,0.0001906456,0.017465701,0.000027278722,0.000019384803,0.00007867237,0.00079123187,0.00004685482,0.0002862281],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9974842,0.00081958395,0.00030235696,0.0004526885,0.0007104694,0.00023058178],"domain_scores_gemma":[0.9620067,0.029187363,0.0039139558,0.0011367581,0.0029180683,0.00083719904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031806417,0.0013301205,0.0010153591,0.0040630773,0.00042943397,0.0016901192,0.00035348962,0.0010380627,0.0008499969],"category_scores_gemma":[0.03403416,0.0003136936,0.000788651,0.0015318701,0.00032620586,0.0018273349,0.0009810546,0.0008341653,0.00044757093],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0044600093,0.00094110274,0.5924256,0.0010695476,0.0005287295,0.00061284937,0.0051528453,0.012275793,0.10091889,0.0003102757,0.0024064616,0.27889785],"study_design_scores_gemma":[0.000059813538,0.0024292674,0.7795416,0.00015916026,0.00023219181,0.0010354301,0.0014939003,0.18543562,0.026612857,0.0013878427,0.0013662649,0.00024602748],"about_ca_topic_score_codex":0.0040184,"about_ca_topic_score_gemma":0.005431735,"teacher_disagreement_score":0.0040630773,"about_ca_system_score_codex":0.00051086285,"about_ca_system_score_gemma":0.00044107673,"threshold_uncertainty_score":0.016821027},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005152295,0.00018626318,0.99372596,0.00023595865,0.000021506818,0.000022042153,0.000050234423,0.000075068536,0.0005307083],"genre_scores_gemma":[0.45589253,0.001381183,0.53552705,0.0005738961,0.00030542404,0.00042903505,0.0008216956,0.0003861343,0.0046830634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981912,0.0009564761,0.00008186187,0.00028006893,0.00037278514,0.00011755442],"domain_scores_gemma":[0.99416226,0.0040108487,0.00044066625,0.0006542799,0.00051409507,0.00021784687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004918378,0.0013033592,0.0016775244,0.0010894637,0.0006603858,0.0019220775,0.0025366382,0.0021188345,0.0017531201],"category_scores_gemma":[0.015956149,0.0014016158,0.0016513648,0.0014983767,0.0025624218,0.0040579094,0.0033757493,0.003842785,0.0005526014],"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.000072405965,0.000058194255,0.0014140571,0.00012470223,0.00009720901,0.000104830106,0.00021847886,0.7375299,0.0010416972,0.22011176,0.0025932577,0.03663356],"study_design_scores_gemma":[0.000005805924,0.0000068610307,0.000058541485,0.0000067375017,0.0000036255533,0.000009943186,0.0000075090907,0.95481694,0.000085776504,0.044647608,0.00034315544,0.0000075283215],"about_ca_topic_score_codex":0.006396086,"about_ca_topic_score_gemma":0.0055135367,"teacher_disagreement_score":0.006396086,"about_ca_system_score_codex":0.0017354351,"about_ca_system_score_gemma":0.0016581425,"threshold_uncertainty_score":0.026011229},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06569245,0.0005481931,0.93052214,0.00033579633,0.000032009273,0.000052480464,0.00007413647,0.0003441707,0.0023986588],"genre_scores_gemma":[0.80883527,0.00026707663,0.18831754,0.00013876052,0.000034130073,0.00017288503,0.00019403703,0.00010727635,0.0019329928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928397,0.0003506508,0.000035046192,0.00010635606,0.00014387189,0.0000800983],"domain_scores_gemma":[0.9935209,0.005526104,0.000327226,0.00017384064,0.00027145716,0.00018047042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020475043,0.00061573007,0.0012123152,0.00067344593,0.00046307276,0.0007626329,0.0010623048,0.001342961,0.0017689562],"category_scores_gemma":[0.008587288,0.0005909461,0.0006600482,0.00078839285,0.0014367234,0.0011826515,0.0009241236,0.0012595839,0.00021505868],"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.00003303061,0.000011230246,0.00032250828,0.000015760013,0.00001027455,0.000020488491,0.00001592606,0.9880079,0.0001163809,0.0067912806,0.0001355556,0.0045196647],"study_design_scores_gemma":[0.0000040399023,0.000004602573,0.000034602985,0.0000017218465,0.0000012617762,0.0000024224612,0.0000016793474,0.9972844,0.00003068319,0.0025807105,0.00005271592,0.0000011812283],"about_ca_topic_score_codex":0.014260924,"about_ca_topic_score_gemma":0.011639163,"teacher_disagreement_score":0.014260924,"about_ca_system_score_codex":0.0012718176,"about_ca_system_score_gemma":0.0018849103,"threshold_uncertainty_score":0.028355837},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023757825,0.00016295852,0.9742882,0.00012006196,0.000022448558,0.000026930074,0.00008517526,0.0007734102,0.000762929],"genre_scores_gemma":[0.84657204,0.00017519708,0.15089175,0.00012666151,0.000045056644,0.00017414082,0.0003872814,0.00007705214,0.0015508406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993864,0.0001821788,0.000037515532,0.00017390902,0.00015798245,0.000061957035],"domain_scores_gemma":[0.99700385,0.002030876,0.0002711647,0.00037082093,0.00025596542,0.000067270346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013715083,0.0006202491,0.0010931159,0.00062161055,0.0002788276,0.0009595517,0.0015903072,0.0011004647,0.0016751295],"category_scores_gemma":[0.0067141424,0.00053773774,0.00063298515,0.00071937323,0.00073032867,0.0017057916,0.0011951779,0.0015636978,0.00041958233],"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.00007008969,0.00004094753,0.0006183952,0.000042959284,0.00003166302,0.000043305965,0.000050156137,0.92359906,0.000848186,0.0097566275,0.00052004313,0.064378604],"study_design_scores_gemma":[0.0000020186326,0.000006433286,0.000029993165,0.0000017520028,0.0000015326953,0.000003255527,0.0000015351937,0.9977883,0.00013857501,0.0019826712,0.000042268835,0.0000017307659],"about_ca_topic_score_codex":0.0027493264,"about_ca_topic_score_gemma":0.0028809234,"teacher_disagreement_score":0.0027493264,"about_ca_system_score_codex":0.00060509884,"about_ca_system_score_gemma":0.0007250327,"threshold_uncertainty_score":0.007253289},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013023911,0.00025221676,0.98502743,0.000075287986,0.000027245642,0.00004015884,0.0001676486,0.0008364946,0.0005495733],"genre_scores_gemma":[0.3266903,0.00072693336,0.66412735,0.000144148,0.00006118425,0.00018752401,0.0017805158,0.0003549984,0.005927024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906415,0.00019643575,0.000069306036,0.00022219594,0.00037952227,0.0000684038],"domain_scores_gemma":[0.9987092,0.00034187373,0.00015452795,0.00044726685,0.0002993218,0.000047770565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006964928,0.0007910659,0.0009430947,0.0010088942,0.00028450222,0.0010201707,0.0012982164,0.00066947297,0.0021088328],"category_scores_gemma":[0.0034040243,0.00032070375,0.00088192115,0.0014024162,0.0007626902,0.0021802753,0.0016563296,0.0015274645,0.0014503263],"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.0003452411,0.00020682323,0.0014181881,0.00031187106,0.0001367186,0.00021776493,0.0002924387,0.13240755,0.03592935,0.02764551,0.008373229,0.79271543],"study_design_scores_gemma":[0.000018837769,0.00015834828,0.00088770286,0.000021853528,0.000021408352,0.00032374813,0.00008113387,0.9552699,0.01805797,0.018090673,0.007023252,0.000045188684],"about_ca_topic_score_codex":0.001705746,"about_ca_topic_score_gemma":0.0016292878,"teacher_disagreement_score":0.0021088328,"about_ca_system_score_codex":0.00034678497,"about_ca_system_score_gemma":0.00052893016,"threshold_uncertainty_score":0.0070548058},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1219388,0.00052553794,0.85365254,0.0006755603,0.00021724108,0.0006258192,0.00035566185,0.001273789,0.020735016],"genre_scores_gemma":[0.41287518,0.00029145874,0.58031374,0.00037620447,0.000041910265,0.0006963909,0.0008300461,0.00032967617,0.0042454144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987035,0.0003772037,0.000103522994,0.00023817907,0.0003395107,0.00023800672],"domain_scores_gemma":[0.9982224,0.0009328257,0.00015301541,0.0003794608,0.00017444555,0.00013778791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013333395,0.0009896981,0.0013958765,0.0012231522,0.00097269355,0.0014085666,0.0026540363,0.0017343285,0.0064909654],"category_scores_gemma":[0.005390212,0.00066081074,0.0014294916,0.001394911,0.0011039776,0.0023261772,0.0023338508,0.002171002,0.000888292],"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.0006308485,0.0008911445,0.0023270994,0.0005752103,0.00016028146,0.00052230543,0.0004349106,0.6180687,0.009527273,0.102494344,0.0079454575,0.2564225],"study_design_scores_gemma":[0.00016739174,0.00023207285,0.00027049778,0.00006513441,0.000047518657,0.00017140612,0.00020665332,0.91704935,0.004737068,0.06982055,0.007194684,0.000037602258],"about_ca_topic_score_codex":0.0020903451,"about_ca_topic_score_gemma":0.0023638795,"teacher_disagreement_score":0.0064909654,"about_ca_system_score_codex":0.00075598137,"about_ca_system_score_gemma":0.0019082633,"threshold_uncertainty_score":0.021714449},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.196543,0.00043435761,0.7947289,0.0023938455,0.000044228924,0.0002484353,0.0007850475,0.00080986327,0.004012394],"genre_scores_gemma":[0.81150573,0.0005221021,0.1816221,0.0005538567,0.00010377799,0.00035925224,0.0016862948,0.00019454572,0.0034523588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949018,0.0017958347,0.00046774515,0.0011342743,0.00128156,0.00041871463],"domain_scores_gemma":[0.9333236,0.058357246,0.0021962395,0.0033332098,0.0019063336,0.000883259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050704903,0.000658229,0.0013187759,0.0009779712,0.00096048234,0.0031762347,0.0027845043,0.0021558572,0.0035750263],"category_scores_gemma":[0.048929933,0.0006942999,0.0012795433,0.0014431394,0.001994687,0.009250753,0.0028602185,0.0038150742,0.0003338531],"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.0006580078,0.00027335144,0.00813208,0.0004511622,0.00015637284,0.0002746424,0.00046506163,0.6731289,0.0024351387,0.1689668,0.0035646718,0.14149375],"study_design_scores_gemma":[0.000019440868,0.00003226809,0.00037587713,0.000012443756,0.000016292712,0.000055280718,0.00003926197,0.8380538,0.0007239682,0.16030078,0.00035926135,0.000011224898],"about_ca_topic_score_codex":0.0048559657,"about_ca_topic_score_gemma":0.0046807006,"teacher_disagreement_score":0.0050704903,"about_ca_system_score_codex":0.0035881754,"about_ca_system_score_gemma":0.002520236,"threshold_uncertainty_score":0.026815653},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07726198,0.00026959414,0.91687554,0.00024434392,0.000058605077,0.00016981941,0.000095821604,0.00070344907,0.0043207426],"genre_scores_gemma":[0.8525579,0.00011159925,0.14312573,0.00017075473,0.000021903596,0.00016493267,0.00020651495,0.00013209609,0.0035084833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987739,0.00037637,0.000046891735,0.00033332707,0.00030364396,0.00016585924],"domain_scores_gemma":[0.99791116,0.0014128817,0.00016296469,0.00012616171,0.00014435918,0.00024233643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016027602,0.0010320904,0.0014763086,0.00068890146,0.00076292467,0.0008147392,0.002033127,0.0017457113,0.00336624],"category_scores_gemma":[0.005781261,0.00059865706,0.00067705096,0.00037306725,0.0016742208,0.0013178398,0.0022922875,0.0014802248,0.0004276113],"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.00036173558,0.0001250814,0.0015282378,0.00013604171,0.0000649666,0.00031914318,0.00030412976,0.9171799,0.005247197,0.020079574,0.0014680271,0.053186044],"study_design_scores_gemma":[0.000027423946,0.0001052957,0.00024348077,0.00001270515,0.000007820088,0.000052989493,0.0000584292,0.9826385,0.0012179281,0.015010176,0.00060977164,0.000015573623],"about_ca_topic_score_codex":0.0062277755,"about_ca_topic_score_gemma":0.008105392,"teacher_disagreement_score":0.0062277755,"about_ca_system_score_codex":0.0010785403,"about_ca_system_score_gemma":0.0015774852,"threshold_uncertainty_score":0.012383044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03715936,0.0023605977,0.90996015,0.0069357343,0.00024438548,0.0035288397,0.0022652813,0.0006631856,0.036882486],"genre_scores_gemma":[0.6162268,0.001398932,0.37117797,0.0012307948,0.00016554836,0.0031635528,0.0020485693,0.00014979772,0.004438032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9710868,0.025178334,0.00053861574,0.0007490534,0.0020241055,0.00042304833],"domain_scores_gemma":[0.9340677,0.05977726,0.0017904345,0.0015290492,0.0020519143,0.0007836926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01712432,0.0013834283,0.0017011394,0.001358456,0.0005632221,0.0019431406,0.0015960019,0.0016524153,0.011998416],"category_scores_gemma":[0.06537531,0.00047512347,0.00089740223,0.0017304915,0.0009777038,0.0013792674,0.0018719835,0.0032320542,0.00094830414],"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.0044955513,0.0011691445,0.0026180402,0.0020582743,0.0005890458,0.00032796615,0.0006468215,0.46211296,0.0015343672,0.08143871,0.047660965,0.39534825],"study_design_scores_gemma":[0.001041906,0.00058544177,0.0009738561,0.0002940492,0.00010241507,0.00009555953,0.00016190646,0.8637533,0.0010638571,0.12490089,0.0069718966,0.00005486329],"about_ca_topic_score_codex":0.0032242765,"about_ca_topic_score_gemma":0.006984306,"teacher_disagreement_score":0.01712432,"about_ca_system_score_codex":0.0022891262,"about_ca_system_score_gemma":0.003805584,"threshold_uncertainty_score":0.09056318},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066736735,0.00046979875,0.8373501,0.0067082704,0.0008799432,0.00067135185,0.001370616,0.0016589002,0.08415429],"genre_scores_gemma":[0.8082754,0.00021761602,0.17754267,0.0013873908,0.00028440816,0.0004301489,0.00091062055,0.00033603254,0.0106156645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9920203,0.003177346,0.0005395261,0.0016465362,0.0013041437,0.001312145],"domain_scores_gemma":[0.95808184,0.025481699,0.0020385492,0.009069076,0.0034998297,0.0018290795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010757624,0.0006904438,0.00081680465,0.00089738384,0.0024345904,0.0031370972,0.0026990564,0.002128745,0.011730463],"category_scores_gemma":[0.055490404,0.0009325938,0.0013148711,0.0010174032,0.0034460202,0.0083688665,0.0049648313,0.003889443,0.0011634461],"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.0007198939,0.00014883971,0.002607645,0.00029552163,0.00014591384,0.0006656759,0.0005664562,0.02825738,0.0014884151,0.9248283,0.010478841,0.029797174],"study_design_scores_gemma":[0.000052200132,0.000039895185,0.00019083638,0.000039360515,0.000038892824,0.000118851545,0.00012064077,0.058034983,0.0009534355,0.93632597,0.004062372,0.000022521635],"about_ca_topic_score_codex":0.010210452,"about_ca_topic_score_gemma":0.014675869,"teacher_disagreement_score":0.011730463,"about_ca_system_score_codex":0.0024684644,"about_ca_system_score_gemma":0.008238727,"threshold_uncertainty_score":0.056892455},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037309355,0.0000712504,0.99397826,0.00008412684,0.00006504149,0.000049468592,0.00009437272,0.0005872062,0.0013394302],"genre_scores_gemma":[0.091706865,0.00016471243,0.9028434,0.00021834238,0.00015831948,0.00016490938,0.0005022279,0.000634281,0.0036069313],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99766576,0.00024300852,0.0002258697,0.0006378939,0.0009519279,0.00027560617],"domain_scores_gemma":[0.99278086,0.0030322615,0.0007164517,0.0022248295,0.0009738028,0.00027184075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002673759,0.0012554246,0.0017352651,0.002080216,0.0008878857,0.002617461,0.0042925673,0.0020521746,0.0054956116],"category_scores_gemma":[0.01338999,0.00065357663,0.0017045544,0.0022789564,0.0013201494,0.0041693356,0.0020156088,0.0035900392,0.0015173849],"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.00040797508,0.00035566543,0.0022149712,0.0003255665,0.00013435294,0.00030035613,0.00023553491,0.37051588,0.021092938,0.16551068,0.009090693,0.4298153],"study_design_scores_gemma":[0.000046036486,0.000062360166,0.0003305118,0.00003454016,0.00002458658,0.00016829252,0.000021118729,0.9300479,0.008971836,0.052871514,0.007372964,0.000048347985],"about_ca_topic_score_codex":0.005642374,"about_ca_topic_score_gemma":0.005753317,"teacher_disagreement_score":0.005642374,"about_ca_system_score_codex":0.0011208417,"about_ca_system_score_gemma":0.0028734736,"threshold_uncertainty_score":0.018384635},"labels":[],"label_agreement":null},{"id":"W2577388749","doi":"","title":"Numeric Planning via Search Space Abstraction.","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Abstraction; Computer science; Space (punctuation); Theoretical computer science","score_opus":0.13603735342430087,"score_gpt":0.3368425459419655,"score_spread":0.20080519251766463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577388749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060067866,0.00044202924,0.980648,0.00024489473,0.000056929224,0.00006190852,0.00025931542,0.0008438123,0.011436285],"genre_scores_gemma":[0.3552021,0.00070996577,0.63581634,0.00014541352,0.000060223134,0.00023338232,0.0009392266,0.00029624693,0.0065970514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992192,0.00025756742,0.00004951212,0.00011219746,0.00026998474,0.000091401365],"domain_scores_gemma":[0.99888974,0.0006338958,0.00006690334,0.0002502828,0.00011223536,0.000046889665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008718964,0.0006615155,0.00072345213,0.00088683906,0.0005231413,0.0014132438,0.001316267,0.00058340025,0.0074533345],"category_scores_gemma":[0.0053490577,0.0004357672,0.0011841666,0.0012616592,0.0010145622,0.002297879,0.0027258964,0.0019745945,0.0010883497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021113524,0.00007360441,0.000847557,0.00040404708,0.00009416607,0.00015692123,0.00031143829,0.48261294,0.002855197,0.2898096,0.008451074,0.21417232],"study_design_scores_gemma":[0.00003447309,0.00003300673,0.00016269632,0.00005043395,0.000036728274,0.00004804627,0.000060027374,0.74339426,0.0010272687,0.24752668,0.0076152557,0.000011108313],"about_ca_topic_score_codex":0.0058713444,"about_ca_topic_score_gemma":0.009499796,"teacher_disagreement_score":0.0074533345,"about_ca_system_score_codex":0.00089506194,"about_ca_system_score_gemma":0.0012990908,"threshold_uncertainty_score":0.024933875},"labels":[],"label_agreement":null},{"id":"W2577869884","doi":"","title":"Belief State Estimation for Planning via Approximate Logical Filtering and Smoothing.","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Smoothing; Estimation; Computer science; State (computer science); Algorithm; Mathematical optimization; Artificial intelligence; Mathematics; Computer vision; Engineering","score_opus":0.1218737559416283,"score_gpt":0.32514029380844184,"score_spread":0.20326653786681353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577869884","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028205097,0.0001405615,0.9960824,0.00007863129,0.00001864082,0.00001831402,0.000056154855,0.00028433767,0.0005003885],"genre_scores_gemma":[0.42571533,0.00038246828,0.5702494,0.00014311886,0.00007806233,0.0002632537,0.00055366044,0.00015756472,0.0024571405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989792,0.00036917184,0.00008239679,0.0002001029,0.000270749,0.00009829136],"domain_scores_gemma":[0.9929261,0.0054644067,0.00034776668,0.00052331475,0.0006139715,0.0001245028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025145663,0.0006454047,0.0013050833,0.0014081937,0.00079744274,0.0016928859,0.0019731752,0.0011964724,0.003550494],"category_scores_gemma":[0.017413171,0.0008891819,0.0010471172,0.001538218,0.001224792,0.0030761298,0.0015268822,0.0021698652,0.00064986787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037989073,0.0000987118,0.0012342406,0.00019131294,0.00012686285,0.000072871015,0.00018654586,0.7599772,0.0014507779,0.06928126,0.0026087204,0.16439167],"study_design_scores_gemma":[0.000009656885,0.000014266861,0.00010409731,0.000010559486,0.000013659038,0.000006575727,0.000012312557,0.97611314,0.00053483085,0.022745717,0.00042901913,0.000006218712],"about_ca_topic_score_codex":0.02791331,"about_ca_topic_score_gemma":0.030982893,"teacher_disagreement_score":0.02791331,"about_ca_system_score_codex":0.0018834576,"about_ca_system_score_gemma":0.0028807742,"threshold_uncertainty_score":0.05550164},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05832394,0.00039691807,0.91705835,0.0007336283,0.000072192735,0.0003001463,0.00012137744,0.0034376602,0.019555813],"genre_scores_gemma":[0.53006446,0.00026112437,0.46436372,0.00026901363,0.000058501577,0.00020883695,0.00030304104,0.00028609135,0.0041852896],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781847,0.0006140978,0.00013440437,0.00044403446,0.000702171,0.00028679412],"domain_scores_gemma":[0.9969416,0.0019827578,0.00023914721,0.0004112615,0.00034884558,0.00007640047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020207297,0.00094393885,0.0007961027,0.0009648201,0.00056106684,0.0013684449,0.001980743,0.0009021337,0.0044204514],"category_scores_gemma":[0.0072332844,0.00047759156,0.0012667272,0.00086619024,0.0012658758,0.0016019341,0.0017942914,0.0016112324,0.0010011242],"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.0003586741,0.00055783225,0.002638136,0.00047472407,0.00015368394,0.00036370792,0.0004466569,0.29987735,0.020803377,0.20803037,0.0073279147,0.45896763],"study_design_scores_gemma":[0.0001107728,0.00011068126,0.00022539582,0.000037953985,0.000066384666,0.00008418725,0.000046997386,0.9043654,0.008017227,0.082944766,0.0039705266,0.000019565172],"about_ca_topic_score_codex":0.0023239914,"about_ca_topic_score_gemma":0.0034488183,"teacher_disagreement_score":0.0044204514,"about_ca_system_score_codex":0.0013469676,"about_ca_system_score_gemma":0.002294414,"threshold_uncertainty_score":0.014787912},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012166305,0.00067782303,0.9744186,0.0005927442,0.00016009648,0.00017967133,0.00041418627,0.0018974642,0.0094930045],"genre_scores_gemma":[0.12430852,0.00058735156,0.8675343,0.00029792223,0.00010417798,0.00038644555,0.0012338263,0.00033712183,0.0052104075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984768,0.00030482805,0.00007705466,0.0003415518,0.000494266,0.00030547148],"domain_scores_gemma":[0.998425,0.00084959314,0.00012667214,0.00031471273,0.00019324776,0.00009081005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009355369,0.0016851962,0.0015225122,0.0011744513,0.0009819228,0.0017807405,0.0025297562,0.0019301,0.010273018],"category_scores_gemma":[0.004425442,0.00069120945,0.0014016558,0.0022385216,0.0007591054,0.0028521505,0.0019018857,0.0025527487,0.0023512219],"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.00043945538,0.0003018651,0.0007764512,0.00029084148,0.00008228226,0.00016640252,0.00019631856,0.56840295,0.0031450896,0.065102644,0.027432915,0.3336628],"study_design_scores_gemma":[0.00009708538,0.000062987565,0.00012693416,0.000020966192,0.000021375003,0.00011199723,0.000038173952,0.95965487,0.0007433855,0.03235126,0.006756014,0.000014900997],"about_ca_topic_score_codex":0.0072289472,"about_ca_topic_score_gemma":0.008702375,"teacher_disagreement_score":0.010273018,"about_ca_system_score_codex":0.0022408874,"about_ca_system_score_gemma":0.0031730854,"threshold_uncertainty_score":0.034366667},"labels":[],"label_agreement":null},{"id":"W2579521186","doi":"","title":"Non-Deterministic Planning with Temporally Extended Goals: Completing the Story for Finite and Infinite LTL (Amended Version).","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Theoretical computer science","score_opus":0.1005374627704798,"score_gpt":0.311975726419039,"score_spread":0.21143826364855917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579521186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00409277,0.041275524,0.3759185,0.13317749,0.12541425,0.00041623655,0.009513245,0.0041304287,0.30606154],"genre_scores_gemma":[0.2193494,0.023218185,0.28772086,0.03742399,0.051639363,0.0024240937,0.00937676,0.0027294913,0.36611786],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984397,0.00045654536,0.00014178567,0.00026130828,0.0005885981,0.000112063],"domain_scores_gemma":[0.993208,0.0046011787,0.00027501208,0.00048709742,0.0012770438,0.00015159334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028655462,0.0011984999,0.0009406937,0.0013685107,0.0018326419,0.0032138422,0.0038025465,0.0047277925,0.037520956],"category_scores_gemma":[0.017988632,0.0011047812,0.0017117694,0.001358291,0.0038468994,0.008983319,0.002473302,0.007310148,0.010946781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025138576,0.000049821898,0.00019128926,0.0006641444,0.00006347928,0.0006920758,0.00052590604,0.004823726,0.00065209356,0.35102528,0.5847892,0.056271575],"study_design_scores_gemma":[0.000118324926,0.00008282704,0.0011082779,0.00069650647,0.00009395527,0.0005976733,0.00018062195,0.010543763,0.0014538157,0.3771297,0.6078811,0.0001133211],"about_ca_topic_score_codex":0.01848735,"about_ca_topic_score_gemma":0.023835892,"teacher_disagreement_score":0.037520956,"about_ca_system_score_codex":0.0037767552,"about_ca_system_score_gemma":0.0019370883,"threshold_uncertainty_score":0.12552005},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027980747,0.0005129835,0.9650284,0.00066352845,0.00017747216,0.00030647364,0.00008966052,0.0015015291,0.0037392364],"genre_scores_gemma":[0.5722953,0.00029801813,0.4145455,0.00057214894,0.0002572156,0.0009556172,0.00031377634,0.00024282878,0.010519638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888116,0.00032877224,0.000071756345,0.00034134893,0.00016859308,0.00020833264],"domain_scores_gemma":[0.99693346,0.0017529218,0.00027589442,0.00036633038,0.00036388417,0.00030751256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028666365,0.0013169968,0.0022409821,0.0010257189,0.0011085834,0.0011075347,0.0029433023,0.002622724,0.0063083777],"category_scores_gemma":[0.007710317,0.00074982113,0.00089543004,0.0010041709,0.001188618,0.001600405,0.0020158812,0.0020411205,0.0025478932],"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.00068186864,0.00051360455,0.002215357,0.00023956405,0.000108747874,0.00013634341,0.00041346226,0.5406399,0.005168017,0.011205042,0.009439889,0.42923823],"study_design_scores_gemma":[0.000075648524,0.00009096828,0.00027709873,0.0000137737825,0.000013921731,0.00003521061,0.000049187096,0.9867907,0.00080202473,0.010521099,0.0013159321,0.00001440261],"about_ca_topic_score_codex":0.0036395697,"about_ca_topic_score_gemma":0.0036079786,"teacher_disagreement_score":0.0063083777,"about_ca_system_score_codex":0.001436475,"about_ca_system_score_gemma":0.0021007834,"threshold_uncertainty_score":0.02110362},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004541024,0.0008334263,0.9707227,0.0008129264,0.00030357405,0.00034720913,0.00032994463,0.009265513,0.01284364],"genre_scores_gemma":[0.07973493,0.00074453856,0.9060145,0.0006168999,0.00021039684,0.0005547965,0.0005151885,0.0012664014,0.010342362],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975846,0.0006870075,0.00020950078,0.00040476795,0.0007941336,0.00031998014],"domain_scores_gemma":[0.992184,0.0056734364,0.00034167655,0.0009183016,0.00072382647,0.00015875872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003898789,0.0016678737,0.0017360392,0.003909977,0.0012479668,0.0024702942,0.0027217774,0.0017535457,0.024038361],"category_scores_gemma":[0.01833704,0.00083069154,0.0018576204,0.0034383486,0.002104335,0.003614897,0.0034988932,0.002289125,0.007867255],"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.00078452873,0.00024513042,0.00072955666,0.001445145,0.00014464294,0.0005154859,0.0003025046,0.038607724,0.006769,0.200953,0.041248996,0.70825434],"study_design_scores_gemma":[0.00037036455,0.00035494112,0.00037116508,0.00024103253,0.00013186727,0.0007189234,0.000098094075,0.31558496,0.0106317615,0.61447275,0.056883942,0.00014014244],"about_ca_topic_score_codex":0.003752767,"about_ca_topic_score_gemma":0.0042912327,"teacher_disagreement_score":0.024038361,"about_ca_system_score_codex":0.0012445623,"about_ca_system_score_gemma":0.0031257817,"threshold_uncertainty_score":0.08041638},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018830566,0.00055010617,0.96512824,0.00029037005,0.00012065114,0.00029455987,0.0015897028,0.0040325597,0.0091633275],"genre_scores_gemma":[0.17408131,0.00044288492,0.8162345,0.0003084493,0.00005761308,0.00059136533,0.002542103,0.000775825,0.0049658124],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979225,0.00065726903,0.00023492375,0.00023842943,0.0007682121,0.0001785972],"domain_scores_gemma":[0.99198544,0.0045661703,0.0005489855,0.0016335781,0.0009917687,0.0002740459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021988614,0.000978709,0.0009175136,0.0021780957,0.001039219,0.0027778125,0.0023305204,0.00097613916,0.010587888],"category_scores_gemma":[0.014755736,0.00064754824,0.0008366386,0.0023991503,0.00086853816,0.0048957323,0.0016202774,0.0020986123,0.0027631603],"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.00056457554,0.00031826698,0.002071173,0.0005443281,0.00008564533,0.0002765008,0.0004935693,0.116156295,0.0066490495,0.33625436,0.029882655,0.5067036],"study_design_scores_gemma":[0.00013909175,0.00018382537,0.0005276425,0.00018424113,0.000071154485,0.00025762693,0.00012494088,0.5120767,0.010588955,0.43567958,0.04008982,0.00007656363],"about_ca_topic_score_codex":0.001608373,"about_ca_topic_score_gemma":0.004213789,"teacher_disagreement_score":0.010587888,"about_ca_system_score_codex":0.0013796824,"about_ca_system_score_gemma":0.0020695028,"threshold_uncertainty_score":0.03542006},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9802581,0.003125754,0.00770075,0.0017076798,0.00067340955,0.00010100618,0.0019576496,0.0015968855,0.0028787558],"genre_scores_gemma":[0.9854902,0.00056163606,0.009666434,0.00034536977,0.000089685396,0.000039051803,0.0023315873,0.000031269727,0.0014447976],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973184,0.00012256377,0.000016070213,0.00005063669,0.000033751578,0.00004513541],"domain_scores_gemma":[0.9984964,0.0010050792,0.00005277178,0.00014040651,0.00012260543,0.00018281139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018891826,0.0009408708,0.0010284886,0.00024111208,0.00025594176,0.00038694128,0.000813002,0.00092324876,0.0014738406],"category_scores_gemma":[0.0031486393,0.00017832758,0.0005301966,0.00038305216,0.00020732786,0.00042260377,0.00037417677,0.0013982913,0.00044172956],"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.037709646,0.015280944,0.109582946,0.000921687,0.0014601193,0.00085838477,0.00040048937,0.32785293,0.0086260205,0.00088255835,0.051763985,0.4446603],"study_design_scores_gemma":[0.0018381315,0.0054092966,0.041755825,0.000096751246,0.00046127907,0.00022900723,0.00024088744,0.9378715,0.006474538,0.0021958805,0.0033693248,0.000057535988],"about_ca_topic_score_codex":0.00971648,"about_ca_topic_score_gemma":0.0063828416,"teacher_disagreement_score":0.00971648,"about_ca_system_score_codex":0.0003159555,"about_ca_system_score_gemma":0.0006627928,"threshold_uncertainty_score":0.019319832},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2450215,0.00086566684,0.6165301,0.005433858,0.0006741743,0.00074321235,0.00075240206,0.002480557,0.12749861],"genre_scores_gemma":[0.6376697,0.0004846628,0.33208612,0.00072363287,0.000120175326,0.0002520659,0.00089929637,0.00039222548,0.027372058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972319,0.00086061284,0.00015440125,0.00072718336,0.0005512605,0.00047469346],"domain_scores_gemma":[0.99450594,0.003629749,0.00042840786,0.000576747,0.0004613694,0.00039768397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020396265,0.001262956,0.0010333458,0.0008678359,0.0021706903,0.0031459208,0.0018786455,0.002410403,0.014696961],"category_scores_gemma":[0.013114061,0.00075170276,0.0016330602,0.00059257186,0.0037749938,0.004153038,0.004323009,0.002632515,0.0013928536],"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.00053532067,0.0004099188,0.0063374513,0.00072641246,0.00021846082,0.000568452,0.0014030532,0.10950278,0.007732676,0.7197859,0.022521188,0.1302584],"study_design_scores_gemma":[0.00028022027,0.00033968798,0.0015705156,0.00020505517,0.00012443883,0.0005982683,0.0012349075,0.3179394,0.008702919,0.61245716,0.056454822,0.00009262468],"about_ca_topic_score_codex":0.0049314853,"about_ca_topic_score_gemma":0.006482091,"teacher_disagreement_score":0.014696961,"about_ca_system_score_codex":0.0017526178,"about_ca_system_score_gemma":0.003029354,"threshold_uncertainty_score":0.049166203},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014710581,0.0006537697,0.7868192,0.0039942786,0.0004673866,0.00063813204,0.000263287,0.0016479245,0.19080546],"genre_scores_gemma":[0.5748085,0.0006311265,0.35583705,0.0024495365,0.00018586688,0.0011952082,0.00062270585,0.0009046563,0.063365445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99369353,0.002185727,0.00031798365,0.0017228833,0.001594638,0.00048523402],"domain_scores_gemma":[0.99046564,0.0032342605,0.0007361978,0.003108155,0.0019476229,0.00050815596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057918658,0.0011017155,0.000576684,0.0010884125,0.0017075154,0.0030669752,0.002439798,0.002362263,0.014386291],"category_scores_gemma":[0.021123447,0.00046385988,0.0019668739,0.0008034904,0.0036243587,0.006284754,0.005918403,0.0034110232,0.0033785948],"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.00009459555,0.00010572236,0.0011384581,0.00023598142,0.00005661809,0.00012763795,0.0027537225,0.0018794792,0.0019679929,0.892814,0.0062848907,0.09254097],"study_design_scores_gemma":[0.00007847019,0.00016844369,0.0011919668,0.00018082971,0.00009502485,0.000344182,0.0013136428,0.011312771,0.00512962,0.82945263,0.15068264,0.000049702994],"about_ca_topic_score_codex":0.0018059778,"about_ca_topic_score_gemma":0.0015789218,"teacher_disagreement_score":0.014386291,"about_ca_system_score_codex":0.0020328504,"about_ca_system_score_gemma":0.0020237013,"threshold_uncertainty_score":0.048126936},"labels":[],"label_agreement":null},{"id":"W29265412","doi":"10.1111/1346-8138.14192","title":"Multiple agents moving target search","year":2003,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Domain (mathematical analysis); Search problem; Search algorithm; Bidirectional search; State (computer science); Multi-agent system; Incremental heuristic search; Artificial intelligence; Mathematical optimization; Beam search; Algorithm; Mathematics","score_opus":0.1572151320510519,"score_gpt":0.3316735627996419,"score_spread":0.17445843074859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W29265412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14996357,0.013471802,0.77477247,0.0057048043,0.0009491903,0.0006046825,0.0008445668,0.0024179332,0.051270973],"genre_scores_gemma":[0.8311945,0.0019931493,0.14112733,0.0010102205,0.0003772586,0.0004901753,0.0008735921,0.0001861266,0.022747649],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990126,0.00029542483,0.000057426092,0.00021128368,0.00027043032,0.00015282271],"domain_scores_gemma":[0.99820375,0.001133034,0.00017019182,0.0001363061,0.0002700594,0.00008673022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011982329,0.00088659266,0.0021934884,0.001744878,0.00082495995,0.0013005486,0.0016536076,0.002130336,0.0073048286],"category_scores_gemma":[0.0056648967,0.00036911428,0.000893235,0.0017339959,0.00064852834,0.0017306523,0.0012304058,0.0009975143,0.0014931109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067886506,0.0003391431,0.0032691385,0.00043967596,0.00029576413,0.0004996532,0.00013382378,0.45324606,0.0029318596,0.02690717,0.012961932,0.4982969],"study_design_scores_gemma":[0.00015237973,0.00030720874,0.0006690947,0.000029060973,0.00009660264,0.0002585549,0.00006506794,0.9642668,0.0015893604,0.02491831,0.007626558,0.000021094897],"about_ca_topic_score_codex":0.004070888,"about_ca_topic_score_gemma":0.0037160534,"teacher_disagreement_score":0.0073048286,"about_ca_system_score_codex":0.0008692515,"about_ca_system_score_gemma":0.0012878439,"threshold_uncertainty_score":0.02443707},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07877972,0.0010810358,0.89853907,0.00027220658,0.00018321192,0.00020599875,0.0038727617,0.0106732035,0.0063928613],"genre_scores_gemma":[0.490957,0.0013628886,0.49280983,0.00025669183,0.000080864156,0.00025064443,0.0039607408,0.00049882266,0.009822522],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995327,0.000039478535,0.000017538485,0.000117429176,0.00025767897,0.000035193254],"domain_scores_gemma":[0.99966383,0.000038629292,0.0000420354,0.00006809524,0.00016772057,0.00001975307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026219833,0.00073736673,0.000636752,0.001154918,0.00027664728,0.00064349454,0.0005290267,0.00064075895,0.0051611704],"category_scores_gemma":[0.0012042227,0.00033154467,0.00042531214,0.0008234199,0.00012477562,0.00081699144,0.00084547175,0.0005342932,0.0031653845],"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.0003112579,0.00015015306,0.010300064,0.00046938498,0.00013633301,0.0002551755,0.000250134,0.012068269,0.41843253,0.0014300015,0.02189067,0.534306],"study_design_scores_gemma":[0.00006889531,0.00033925142,0.1041042,0.00018788975,0.0000884069,0.0019486446,0.0003573524,0.55159426,0.3017329,0.003553238,0.035851456,0.0001734183],"about_ca_topic_score_codex":0.006875424,"about_ca_topic_score_gemma":0.012831496,"teacher_disagreement_score":0.006875424,"about_ca_system_score_codex":0.00043239875,"about_ca_system_score_gemma":0.0005414573,"threshold_uncertainty_score":0.017265797},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71660554,0.0048837517,0.23600428,0.0010738369,0.0009826726,0.0013971735,0.006661596,0.017262954,0.015128212],"genre_scores_gemma":[0.82156515,0.00029655013,0.16612566,0.00018397611,0.000062131774,0.00024104549,0.0067177815,0.00026236477,0.0045453785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987472,0.00044541777,0.00006071304,0.0003000821,0.0003054525,0.00014106368],"domain_scores_gemma":[0.99657863,0.0020910837,0.0001484259,0.000489944,0.00044663972,0.0002452388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022175638,0.0013666527,0.0012095298,0.0014448417,0.0006162578,0.00080669066,0.0017641061,0.0014907732,0.0059664845],"category_scores_gemma":[0.011206766,0.0003011057,0.00080580486,0.001386411,0.00034253646,0.0018246962,0.00093826576,0.0013039067,0.0016905046],"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.0048488057,0.003945291,0.02191384,0.0007039261,0.00056052476,0.00044364994,0.00021293013,0.24091502,0.008125221,0.0035602152,0.039502975,0.6752676],"study_design_scores_gemma":[0.0001382603,0.00041055123,0.0021901508,0.000016573167,0.00006909248,0.000067054025,0.00004886507,0.9914709,0.002163481,0.0013730254,0.002036338,0.000015738202],"about_ca_topic_score_codex":0.031406928,"about_ca_topic_score_gemma":0.039779548,"teacher_disagreement_score":0.031406928,"about_ca_system_score_codex":0.0012070833,"about_ca_system_score_gemma":0.0015171545,"threshold_uncertainty_score":0.062448263},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041898333,0.0035200424,0.9474921,0.0030528896,0.0002636751,0.00045975923,0.00023319073,0.0007642297,0.002315717],"genre_scores_gemma":[0.79914975,0.0016777153,0.19299825,0.0010920106,0.00032456743,0.0012321676,0.00033961653,0.00013525378,0.0030507275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9800332,0.016865054,0.00068010064,0.001125501,0.00076314603,0.0005330385],"domain_scores_gemma":[0.78776026,0.19818518,0.005720254,0.0033761638,0.003242233,0.0017158178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.046792407,0.001707726,0.0045065335,0.0016399513,0.0008381659,0.0032793076,0.0024407138,0.0038536184,0.0038522372],"category_scores_gemma":[0.17705362,0.0013506724,0.0010047547,0.0015511897,0.0027235472,0.0031270415,0.002462611,0.005553229,0.00075383973],"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.002369605,0.00031979216,0.0046766335,0.00045010375,0.0004985978,0.0002856993,0.00030409283,0.8491476,0.00034492687,0.04633938,0.0034610424,0.091802455],"study_design_scores_gemma":[0.00025930462,0.00019973767,0.00045466263,0.0000738011,0.00007440128,0.000041701558,0.000037038317,0.95300484,0.00023930377,0.04500024,0.0005942747,0.000020639636],"about_ca_topic_score_codex":0.0049662776,"about_ca_topic_score_gemma":0.0032404726,"teacher_disagreement_score":0.046792407,"about_ca_system_score_codex":0.001817098,"about_ca_system_score_gemma":0.0036734566,"threshold_uncertainty_score":0.24746484},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24148974,0.0013590107,0.7398196,0.002895364,0.0000993203,0.0003031958,0.0003505366,0.00067800004,0.013005173],"genre_scores_gemma":[0.87519914,0.0007387729,0.12027109,0.0004634304,0.00014326218,0.0003510046,0.0003402329,0.00020492963,0.0022882582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812764,0.00094554585,0.000059567952,0.00029124905,0.00032268808,0.00025325545],"domain_scores_gemma":[0.96140075,0.033999804,0.0019919304,0.0012505321,0.0007166909,0.0006404183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043102633,0.00054488255,0.0008590982,0.001714507,0.0012001342,0.002457466,0.001444533,0.0015903314,0.004065123],"category_scores_gemma":[0.04500169,0.00081544294,0.0010631877,0.0016161343,0.0026151787,0.004864305,0.001519423,0.002774193,0.00031328655],"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.00038204124,0.00026469558,0.006034265,0.00023230816,0.00008938875,0.00029047206,0.000572378,0.3381151,0.0030329458,0.61037886,0.004867972,0.035739616],"study_design_scores_gemma":[0.00007539867,0.00006448999,0.00080842647,0.000030556577,0.000018611006,0.00009937932,0.000095626776,0.5840801,0.0011341966,0.412316,0.0012560149,0.000021171716],"about_ca_topic_score_codex":0.0020070835,"about_ca_topic_score_gemma":0.0018359178,"teacher_disagreement_score":0.0043102633,"about_ca_system_score_codex":0.001740416,"about_ca_system_score_gemma":0.0012353708,"threshold_uncertainty_score":0.02279514},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005568987,0.0009264815,0.7845275,0.0024458985,0.0012022778,0.0003978953,0.032315563,0.055610735,0.11700466],"genre_scores_gemma":[0.10364737,0.0017567262,0.7084883,0.0012286595,0.0005263925,0.00058017566,0.08611539,0.01451819,0.083138876],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979824,0.000732423,0.00025119673,0.000325909,0.00060763385,0.00010047414],"domain_scores_gemma":[0.99549,0.0021736396,0.0002003504,0.0010078148,0.0010178909,0.000110344634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002425462,0.00095476676,0.000673824,0.004340659,0.0014644216,0.004006345,0.0019863672,0.0018644761,0.058255114],"category_scores_gemma":[0.009934767,0.00088458194,0.00093744363,0.0031436607,0.0008993333,0.006431383,0.0037124483,0.0021885773,0.026597133],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004137303,0.00013923332,0.0015505109,0.0022863974,0.0000872793,0.0010771469,0.0035540406,0.0032769614,0.012177415,0.32204023,0.33804533,0.31535167],"study_design_scores_gemma":[0.000032477907,0.000022813783,0.00045171918,0.0005188955,0.000043783064,0.00029870743,0.00045632423,0.013993874,0.0127130505,0.06223851,0.9091906,0.000039224655],"about_ca_topic_score_codex":0.004503469,"about_ca_topic_score_gemma":0.006193157,"teacher_disagreement_score":0.058255114,"about_ca_system_score_codex":0.0010864539,"about_ca_system_score_gemma":0.0020986532,"threshold_uncertainty_score":0.19488275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07548168,0.0007094046,0.9120107,0.0026275676,0.0001275682,0.00008069392,0.00010371251,0.0008798785,0.00797879],"genre_scores_gemma":[0.9397677,0.00031872222,0.05688891,0.0004340533,0.00009321075,0.00008179057,0.00011860552,0.00013670772,0.0021602958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979856,0.0006773721,0.000084436135,0.00025248682,0.000799248,0.00020085611],"domain_scores_gemma":[0.990524,0.0056776507,0.00096631545,0.001481524,0.0010976702,0.0002528277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037988506,0.00087000505,0.0004777145,0.0006851661,0.0006406833,0.0013352602,0.0016984087,0.0024763956,0.0023534768],"category_scores_gemma":[0.020505557,0.00038064053,0.000541156,0.00025197282,0.003575388,0.0034112628,0.0030350275,0.0036178124,0.00042881726],"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.0006892115,0.00016308189,0.004187291,0.00031640855,0.000070350536,0.0007485059,0.00038239933,0.6554035,0.027578104,0.22196014,0.005273099,0.083227985],"study_design_scores_gemma":[0.00001735054,0.0001335243,0.0003056253,0.00004107454,0.000014607164,0.00016517605,0.00004697503,0.8920352,0.017820463,0.087972865,0.0014345621,0.000012485521],"about_ca_topic_score_codex":0.0010534574,"about_ca_topic_score_gemma":0.0010816931,"teacher_disagreement_score":0.0037988506,"about_ca_system_score_codex":0.0013768977,"about_ca_system_score_gemma":0.0011195238,"threshold_uncertainty_score":0.02009052},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013689524,0.00035631092,0.9839633,0.00043123224,0.000029082234,0.000051830644,0.000018292603,0.00022682393,0.0012334932],"genre_scores_gemma":[0.5436005,0.0007481944,0.45077163,0.00022066475,0.00013651249,0.000506084,0.00014105301,0.00010815693,0.003767231],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987153,0.00055321964,0.000103792714,0.00023178253,0.0002258877,0.00017001065],"domain_scores_gemma":[0.99121875,0.0067643565,0.0007616886,0.00036405594,0.00065454125,0.00023659928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036021478,0.001106574,0.0014258233,0.00085388124,0.00087086024,0.0016166276,0.0021695069,0.0023196572,0.0018565031],"category_scores_gemma":[0.01525852,0.0006004949,0.00061410543,0.0009368901,0.002324015,0.0035309622,0.002261085,0.00213072,0.0004522167],"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.000038252703,0.000032076387,0.00046609092,0.000053018848,0.00003085659,0.000025601492,0.000088131834,0.94614005,0.00018371001,0.028423639,0.00047280607,0.024045901],"study_design_scores_gemma":[0.00001415956,0.000010973878,0.000025286814,0.0000055948467,0.0000031692475,0.0000046474256,0.000008925681,0.9785251,0.00007503999,0.02115927,0.00016511325,0.0000027225349],"about_ca_topic_score_codex":0.003878151,"about_ca_topic_score_gemma":0.0032379709,"teacher_disagreement_score":0.003878151,"about_ca_system_score_codex":0.0015377619,"about_ca_system_score_gemma":0.0016557676,"threshold_uncertainty_score":0.01905018},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07651087,0.00009166223,0.91947585,0.00043546868,0.000040305757,0.000115784096,0.00006744359,0.00045954582,0.0028030567],"genre_scores_gemma":[0.88848555,0.000053291813,0.110154375,0.00006648568,0.000042608775,0.00014502321,0.000082139806,0.000024573463,0.00094595365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9914621,0.0035527584,0.0008166552,0.0013423975,0.0023836195,0.00044243218],"domain_scores_gemma":[0.9807084,0.0058387727,0.0035060477,0.0045635863,0.004657371,0.0007259636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00534034,0.00060564553,0.0009795444,0.00089713244,0.0007343695,0.0024465653,0.0014826152,0.001323949,0.001736321],"category_scores_gemma":[0.024843575,0.00040306037,0.00090881134,0.0009772168,0.0016867797,0.007882668,0.002258423,0.002060594,0.00041939595],"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.0008814827,0.0005039397,0.016207924,0.00034796767,0.00033886623,0.0005688909,0.0027743047,0.25550905,0.026086383,0.516945,0.0030247916,0.17681135],"study_design_scores_gemma":[0.00008417399,0.000356854,0.0022734846,0.000023000346,0.00008292322,0.0002418589,0.00014326631,0.9000992,0.0047172117,0.089748435,0.0021483782,0.0000811753],"about_ca_topic_score_codex":0.0022687735,"about_ca_topic_score_gemma":0.0016312692,"teacher_disagreement_score":0.00534034,"about_ca_system_score_codex":0.0016506332,"about_ca_system_score_gemma":0.0015419885,"threshold_uncertainty_score":0.028242767},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008176571,0.00060472277,0.98605484,0.00016260719,0.00020293069,0.000689494,0.00061469054,0.002649612,0.00084469677],"genre_scores_gemma":[0.07247215,0.00043118387,0.9202034,0.0001619129,0.00024637708,0.0014105403,0.0016183472,0.00018871839,0.0032673497],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710065,0.000722519,0.00023653159,0.0005252296,0.0012921275,0.00012290938],"domain_scores_gemma":[0.99792826,0.0010511316,0.000115721276,0.00022873624,0.00062509783,0.000051019608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022784034,0.0016513726,0.0020193376,0.0030226258,0.0009101505,0.0010760096,0.001194247,0.0013325766,0.0048206407],"category_scores_gemma":[0.0061564106,0.00031937924,0.0015829742,0.0039250413,0.0005095998,0.0014698151,0.00079559116,0.0009734111,0.0031602941],"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.00024898522,0.00016609926,0.0011294059,0.00028500814,0.00015984704,0.00014472411,0.00007858877,0.009971893,0.020315398,0.0020036877,0.0086727,0.9568236],"study_design_scores_gemma":[0.0005533823,0.001512734,0.014455852,0.00018226558,0.00048310476,0.0026629488,0.00018050514,0.7893302,0.082134776,0.026977953,0.08112256,0.00040375962],"about_ca_topic_score_codex":0.0014705411,"about_ca_topic_score_gemma":0.0013946374,"teacher_disagreement_score":0.0048206407,"about_ca_system_score_codex":0.0004149337,"about_ca_system_score_gemma":0.00075730233,"threshold_uncertainty_score":0.016126692},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008407294,0.000078734716,0.99095494,0.000028098479,0.000014380192,0.00003105683,0.00002185071,0.0003554534,0.00010825529],"genre_scores_gemma":[0.1754855,0.000099424986,0.8231546,0.000047426653,0.000037833248,0.00014732324,0.00031467827,0.0001507962,0.00056230894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958813,0.0013127421,0.0003728524,0.0010755209,0.0011028593,0.0002546083],"domain_scores_gemma":[0.99282444,0.0020487767,0.0007751234,0.0015522166,0.0025859436,0.00021360195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052353586,0.00069042074,0.0017461069,0.0029871515,0.0012399205,0.001645401,0.0026034575,0.0011392995,0.00072693493],"category_scores_gemma":[0.0148013355,0.0006166576,0.0012988565,0.0027857996,0.001401549,0.0025616358,0.0028833654,0.0015456171,0.0007105593],"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.0004938879,0.00024602495,0.007271534,0.00022586317,0.00022688671,0.00013148275,0.0008277399,0.11880648,0.023282127,0.032352813,0.003906422,0.81222874],"study_design_scores_gemma":[0.000033515636,0.000088425644,0.0018200938,0.000022066075,0.000035727466,0.00017513071,0.00013899557,0.9422653,0.012625783,0.040202994,0.0025187517,0.00007325795],"about_ca_topic_score_codex":0.0025438755,"about_ca_topic_score_gemma":0.002387199,"teacher_disagreement_score":0.0052353586,"about_ca_system_score_codex":0.0009766532,"about_ca_system_score_gemma":0.0017102186,"threshold_uncertainty_score":0.02768755},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06319579,0.00009492964,0.93540394,0.00013329515,0.000010582993,0.000019878058,0.00023731834,0.00045919928,0.00044504786],"genre_scores_gemma":[0.79158574,0.00037478303,0.20627938,0.000050108985,0.00002653797,0.000051936724,0.00068698864,0.000077995785,0.0008665322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997166,0.00008384364,0.000019096049,0.000094334755,0.00006245919,0.000023713346],"domain_scores_gemma":[0.99748755,0.0016803289,0.00031480426,0.0003295878,0.000115359406,0.00007246287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000763177,0.0006888118,0.0006430096,0.0010972583,0.00039616655,0.0008368296,0.0007518905,0.0007451323,0.00090669445],"category_scores_gemma":[0.0056541767,0.0008034644,0.0006741327,0.0008339607,0.00075531675,0.0018585975,0.0010047288,0.0011627853,0.00021285894],"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.00007781372,0.00003530535,0.006976824,0.00006936073,0.000072837705,0.00016351251,0.00014722718,0.91533744,0.0023898787,0.018349472,0.0006598805,0.055720385],"study_design_scores_gemma":[0.0000044725557,0.000006047871,0.00081384374,0.000005404747,0.000008055078,0.000016215532,0.000016028467,0.9816428,0.00046627995,0.016705312,0.0003099958,0.000005603329],"about_ca_topic_score_codex":0.011495766,"about_ca_topic_score_gemma":0.015875885,"teacher_disagreement_score":0.011495766,"about_ca_system_score_codex":0.00068550115,"about_ca_system_score_gemma":0.0009998388,"threshold_uncertainty_score":0.022857726},"labels":[],"label_agreement":null}]}