{"meta":{"query_hash":"56e7e8f3cb6f","filters":{"venue":"Proceedings of the AAAI Conference on Artificial Intelligence"},"cohort_total":1046,"direct_labels_cover":0,"predictions_cover":1046,"exported":1046,"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/56e7e8f3cb6f","api":"https://metacan.xera.ac/api/v1/cohort?venue=Proceedings+of+the+AAAI+Conference+on+Artificial+Intelligence"},"results":[{"id":"W1027077394","doi":"10.1609/aaai.v29i1.9294","title":"Conventional Machine Learning for Social Choice","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":13,"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":"Voting; Computer science; Conceptualization; Machine learning; Missing data; Outcome (game theory); Artificial intelligence; Social choice theory; Majority rule; Data mining; Political science","score_opus":0.23728863668513883,"score_gpt":0.31389335682755715,"score_spread":0.07660472014241831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1027077394","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.006902853,0.0054305056,0.9657701,0.0051596127,0.00035464793,0.00012419597,0.00074561016,0.00023587569,0.015276562],"genre_scores_gemma":[0.61692244,0.00988427,0.34820703,0.0016355984,0.0023870233,0.0010594241,0.0016241674,0.00014406085,0.018135872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694973,0.0017579644,0.00011030996,0.00048029784,0.00058361865,0.000118122945],"domain_scores_gemma":[0.99090636,0.007188808,0.00037939788,0.00093842746,0.00046673435,0.000120237564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051110396,0.0012950345,0.0013675797,0.0017267253,0.0007313758,0.0022122914,0.0017708468,0.001965678,0.007789914],"category_scores_gemma":[0.021391625,0.00042326516,0.0010078541,0.0027604785,0.0027998576,0.003513498,0.0017054457,0.0042478167,0.0020222343],"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.00004289013,0.000054164764,0.0010621146,0.00023887018,0.00007872814,0.000050258925,0.000100207784,0.05912683,0.00015052903,0.8606613,0.007528992,0.07090507],"study_design_scores_gemma":[0.000011991169,0.000013389062,0.00019775762,0.00003289002,0.0000063686257,0.000015545129,0.0000147663495,0.22143486,0.000052108826,0.7723841,0.0058278088,0.0000085147785],"about_ca_topic_score_codex":0.00281301,"about_ca_topic_score_gemma":0.0023836235,"teacher_disagreement_score":0.007789914,"about_ca_system_score_codex":0.0022051926,"about_ca_system_score_gemma":0.0014628508,"threshold_uncertainty_score":0.02703005},"labels":[],"label_agreement":null},{"id":"W11034078","doi":"10.1609/aaai.v25i1.7813","title":"Block A*: Database-Driven Search with Applications in Any-Angle Path-Planning","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Block (permutation group theory); Grid; Path (computing); Any-angle path planning; Computer science; Boundary (topology); Variety (cybernetics); Motion planning; Algorithm; City block; Database; Mathematics; Artificial intelligence; Geometry; Geography","score_opus":0.148062709564316,"score_gpt":0.3223104162119302,"score_spread":0.1742477066476142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W11034078","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.004719942,0.00033522682,0.98930943,0.000107589825,0.000051539722,0.000060229206,0.00015698734,0.0029099942,0.0023491231],"genre_scores_gemma":[0.08568652,0.0003788876,0.9108675,0.000101818885,0.000028638353,0.00026493054,0.0003602997,0.0003424159,0.0019690238],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993981,0.00016494203,0.000046818863,0.00010635756,0.00024177441,0.000042048887],"domain_scores_gemma":[0.9984596,0.0007422355,0.000104076345,0.0003517068,0.00024027315,0.00010212398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086280797,0.00066186173,0.000890945,0.0009396309,0.00045854363,0.0013055358,0.0024589566,0.00091821497,0.007041259],"category_scores_gemma":[0.0039499537,0.0005553455,0.0005533709,0.002068472,0.00058247487,0.002168514,0.0021147563,0.0013093762,0.002585719],"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.0006359355,0.00023143868,0.0016525743,0.00045976057,0.00008439577,0.00012112851,0.00020801362,0.27434805,0.010882552,0.07436684,0.014681776,0.62232757],"study_design_scores_gemma":[0.0001056707,0.00014431067,0.00017117256,0.000025565725,0.000018388033,0.000093743765,0.000026765401,0.95466816,0.0051639145,0.02574186,0.013817578,0.000022874694],"about_ca_topic_score_codex":0.0056256647,"about_ca_topic_score_gemma":0.0041517895,"teacher_disagreement_score":0.007041259,"about_ca_system_score_codex":0.00049904984,"about_ca_system_score_gemma":0.0012876452,"threshold_uncertainty_score":0.023555338},"labels":[],"label_agreement":null},{"id":"W1128302166","doi":"10.1609/aaai.v28i1.8706","title":"Who Also Likes It? Generating the Most Persuasive Social Explanations in Recommender Systems","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Recommender Systems and Techniques","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":"Simon Fraser University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China; National Science Foundation","keywords":"Recommender system; Computer science; Statement (logic); Set (abstract data type); Persuasive technology; Social network (sociolinguistics); Persuasion; Information retrieval; World Wide Web; Social media; Psychology; Social psychology","score_opus":0.0958385672770619,"score_gpt":0.30962575817214144,"score_spread":0.21378719089507953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1128302166","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.19828545,0.0015226336,0.79063857,0.0027266622,0.0001554682,0.0005255821,0.000442021,0.0015981217,0.004105435],"genre_scores_gemma":[0.57936674,0.00036873648,0.4164485,0.0004182761,0.00014243035,0.0003100131,0.0008017754,0.00009267802,0.0020509392],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981818,0.0008437437,0.00010995129,0.00039052707,0.00036653224,0.000107528074],"domain_scores_gemma":[0.9906764,0.0074484684,0.00044306836,0.0004754246,0.00080546056,0.00015118632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020610893,0.001054259,0.0011173327,0.0022610074,0.000967857,0.0009869824,0.0014733494,0.0027409834,0.0022050405],"category_scores_gemma":[0.015878173,0.00072246697,0.0009788008,0.0012757661,0.0007647095,0.0020998418,0.0011344872,0.0011630374,0.0007612391],"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.001053678,0.00079931994,0.027666502,0.0009168746,0.00046846483,0.0005268513,0.0027849777,0.12129133,0.008119075,0.016324982,0.016475167,0.8035728],"study_design_scores_gemma":[0.00026763737,0.00034057262,0.0050249966,0.00016553763,0.00026959865,0.00047757884,0.00080115214,0.9372692,0.006300387,0.043335784,0.005657199,0.00009034454],"about_ca_topic_score_codex":0.0034197632,"about_ca_topic_score_gemma":0.0076496084,"teacher_disagreement_score":0.0034197632,"about_ca_system_score_codex":0.00053916476,"about_ca_system_score_gemma":0.0012396962,"threshold_uncertainty_score":0.010900199},"labels":[],"label_agreement":null},{"id":"W1178556121","doi":"10.1609/aaai.v29i1.9613","title":"Policy Tree: Adaptive Representation for Policy Gradient","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","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":"University of Alberta","funders":"","keywords":"Softmax function; Representation (politics); Computer science; Tree (set theory); Decision tree; Reinforcement learning; Tree structure; Mathematical optimization; Focus (optics); Base (topology); Artificial intelligence; Machine learning; Mathematics; Algorithm; Political science; Binary tree; Law; Artificial neural network","score_opus":0.18186388199228115,"score_gpt":0.36106959719988463,"score_spread":0.17920571520760348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1178556121","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.004235291,0.00017685095,0.9929471,0.00021597263,0.000055404293,0.000068583446,0.00007753186,0.00097609527,0.0012472209],"genre_scores_gemma":[0.39393458,0.0005309758,0.5991588,0.0005081113,0.00012263212,0.00081128813,0.0005536909,0.0006819793,0.0036979336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888366,0.00048822036,0.00006932088,0.00020670815,0.0002508586,0.00010123336],"domain_scores_gemma":[0.9968689,0.0020195402,0.00023637695,0.0002987019,0.00043557218,0.00014090302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026632433,0.0010954087,0.0012882217,0.00094122445,0.0005456338,0.0014492971,0.0019571232,0.002004304,0.0064142602],"category_scores_gemma":[0.014049374,0.0006796563,0.00078053033,0.0008970893,0.0011945883,0.002800903,0.0017435555,0.0030600356,0.001450454],"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.00023344843,0.00013205784,0.0009803402,0.00014897446,0.00004800091,0.00009896752,0.00015835233,0.6915336,0.0021076596,0.07980519,0.007705629,0.21704769],"study_design_scores_gemma":[0.000015936072,0.00002494218,0.00003497278,0.0000136214485,0.0000047827866,0.000015566822,0.0000055196415,0.97838384,0.00044454387,0.019985303,0.0010647052,0.0000063213274],"about_ca_topic_score_codex":0.0030421328,"about_ca_topic_score_gemma":0.0025676899,"teacher_disagreement_score":0.0064142602,"about_ca_system_score_codex":0.0012132261,"about_ca_system_score_gemma":0.0021731053,"threshold_uncertainty_score":0.021457851},"labels":[],"label_agreement":null},{"id":"W123800271","doi":"10.1609/aaai.v25i1.7880","title":"Automated Action Abstraction of Imperfect Information Extensive-Form Games","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Perfect information; Limit (mathematics); Action (physics); Computer science; Bayesian game; Imperfect; Extensive-form game; Mathematical economics; Nash equilibrium; Space (punctuation); Focus (optics); Repeated game; Game theory; Mathematics","score_opus":0.10849922984711761,"score_gpt":0.3142262882419854,"score_spread":0.20572705839486777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W123800271","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.053971265,0.000056058056,0.94028693,0.00015451724,0.00002298151,0.00012474798,0.00014240065,0.001260565,0.003980656],"genre_scores_gemma":[0.7179795,0.000094146926,0.27864492,0.00008441239,0.000017303202,0.00021315814,0.00035352178,0.00013659227,0.002476456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859875,0.0005393049,0.00008173676,0.00019064957,0.0003873987,0.00020219991],"domain_scores_gemma":[0.99693274,0.0020804626,0.00020695334,0.00045972833,0.0002014395,0.00011863925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001784737,0.0010112018,0.0012093724,0.00073081633,0.00063564937,0.0016578711,0.001835175,0.0008705275,0.0036839934],"category_scores_gemma":[0.0064582247,0.00053957145,0.0014060383,0.00057214266,0.0013896642,0.002646493,0.0022855166,0.0021598912,0.00042276672],"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.00015531728,0.00009464324,0.0012607804,0.0000780965,0.00004463239,0.00017463524,0.0002833429,0.8548276,0.0016749426,0.08513085,0.0010144567,0.055260673],"study_design_scores_gemma":[0.000016827687,0.000013393345,0.00007398749,0.000006967866,0.0000057803163,0.000011015847,0.000020294874,0.9529374,0.0007573544,0.04566195,0.0004904124,0.0000046113805],"about_ca_topic_score_codex":0.00395948,"about_ca_topic_score_gemma":0.006046338,"teacher_disagreement_score":0.00395948,"about_ca_system_score_codex":0.0016805778,"about_ca_system_score_gemma":0.0016599622,"threshold_uncertainty_score":0.012324154},"labels":[],"label_agreement":null},{"id":"W128321172","doi":"10.1609/aaai.v25i1.8045","title":"Heuristic Planning in Adversarial Dynamic Domains","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Adversarial system; Planner; Adversary; Heuristic; Computer science; Nondeterministic algorithm; Domain (mathematical analysis); Context (archaeology); Artificial intelligence; Heuristics; Automated planning and scheduling; Process (computing); Plan (archaeology); Theoretical computer science; Computer security; Mathematics","score_opus":0.08358768588845844,"score_gpt":0.29032386772501445,"score_spread":0.206736181836556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W128321172","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.04622546,0.0006310987,0.94149154,0.00070026476,0.000038017857,0.00012684903,0.00016176699,0.0006223733,0.010002588],"genre_scores_gemma":[0.7148836,0.0007533962,0.2796739,0.00021332955,0.000048809154,0.0002417428,0.00030831774,0.0001132599,0.0037637134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883,0.0005474574,0.00007089508,0.00016531427,0.00021623852,0.00017016663],"domain_scores_gemma":[0.99616444,0.002958491,0.0002625001,0.0002943217,0.0001531525,0.0001670952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018304529,0.00068920583,0.0007730813,0.0008477423,0.00067071285,0.0015796857,0.0012666803,0.0010198822,0.0021155444],"category_scores_gemma":[0.005957021,0.0005592198,0.00089333626,0.00071445445,0.00302674,0.00199186,0.0019934373,0.0012905772,0.00027990766],"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.00008850964,0.000027937887,0.00050328375,0.00013814181,0.000051630366,0.00026296815,0.00022119508,0.8494293,0.00086208526,0.13111511,0.0007572901,0.016542472],"study_design_scores_gemma":[0.000023697541,0.000023835528,0.00010834735,0.00002428136,0.000013900689,0.00004946359,0.000086970904,0.85017115,0.00092416594,0.14676496,0.001793758,0.0000154624],"about_ca_topic_score_codex":0.005618156,"about_ca_topic_score_gemma":0.0066042626,"teacher_disagreement_score":0.005618156,"about_ca_system_score_codex":0.0017133532,"about_ca_system_score_gemma":0.0013362283,"threshold_uncertainty_score":0.012431264},"labels":[],"label_agreement":null},{"id":"W129935311","doi":"10.1609/aaai.v24i1.7548","title":"Exploiting QBF Duality on a Circuit Representation","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":33,"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":"Unit cube; Representation (politics); Cube (algebra); Duality (order theory); Dual (grammatical number); Solver; Computer science; Unit (ring theory); Value (mathematics); Truth value; Conjunctive normal form; Algorithm; Theoretical computer science; Mathematics; Discrete mathematics; Combinatorics; Programming language; Machine learning; Law; Linguistics","score_opus":0.1997012440612117,"score_gpt":0.3678475354696475,"score_spread":0.1681462914084358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W129935311","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.013058462,0.00010473558,0.9804586,0.00032918036,0.00002464951,0.000058224683,0.000120344994,0.00058834744,0.0052574384],"genre_scores_gemma":[0.44059074,0.00028920663,0.553815,0.00033061992,0.000048808877,0.00022022439,0.00043434766,0.00016405253,0.004106932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990127,0.00035838847,0.000043092397,0.00014644228,0.00034018114,0.000099249046],"domain_scores_gemma":[0.99866664,0.0007418738,0.00009045737,0.00027000636,0.0001923378,0.00003863657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088006683,0.0005044105,0.0005052451,0.00093624933,0.0004297839,0.0015425825,0.0011298099,0.0007902559,0.0050993245],"category_scores_gemma":[0.0044499086,0.00034426883,0.00074508647,0.0009746811,0.0013072249,0.0028184312,0.0016510896,0.0019448207,0.00071978814],"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.00017246102,0.00013313595,0.00045884858,0.00018985951,0.000028913739,0.0001859974,0.00014927804,0.20190322,0.014205786,0.5835615,0.00313419,0.19587676],"study_design_scores_gemma":[0.000038215498,0.00008134528,0.00008719945,0.000026855285,0.00002625243,0.000121081874,0.000033805365,0.6142397,0.0077869887,0.3696545,0.007889878,0.000014203688],"about_ca_topic_score_codex":0.0010449816,"about_ca_topic_score_gemma":0.0014274347,"teacher_disagreement_score":0.0050993245,"about_ca_system_score_codex":0.00092489476,"about_ca_system_score_gemma":0.0010458062,"threshold_uncertainty_score":0.017058969},"labels":[],"label_agreement":null},{"id":"W130885469","doi":"10.1609/aaai.v28i1.8829","title":"Preference Elicitation and Interview Minimization in Stable Matchings","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Microsoft Research","keywords":"Preference; Matching (statistics); Minification; Preference elicitation; Computer science; Work (physics); Machine learning; Scheme (mathematics); Artificial intelligence; Mathematics; Statistics; Engineering","score_opus":0.13783264841163043,"score_gpt":0.2620666541801558,"score_spread":0.12423400576852536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W130885469","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.016032413,0.000070306465,0.98149866,0.00027234404,0.000009061043,0.00022558527,0.00013193153,0.00015728758,0.0016023035],"genre_scores_gemma":[0.23611234,0.00012873867,0.75913686,0.0002227026,0.00003941408,0.00080624246,0.0006500121,0.000110584224,0.0027930501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9666954,0.025052184,0.0013148879,0.0029360177,0.00300273,0.0009987388],"domain_scores_gemma":[0.92915076,0.056608614,0.0035373862,0.0062517202,0.003412067,0.0010394899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020861616,0.001317732,0.002115487,0.0022910438,0.0018659916,0.0025405346,0.0033965558,0.0026509394,0.0078633325],"category_scores_gemma":[0.09554497,0.0011312589,0.0022514071,0.0036963776,0.0030838489,0.007350404,0.0050296043,0.0028534092,0.001337401],"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.001067552,0.00038027985,0.004443734,0.0005369622,0.00019459105,0.00023532397,0.0032625666,0.21364728,0.0042165555,0.5160231,0.0044595124,0.25153255],"study_design_scores_gemma":[0.00013080555,0.00018563562,0.0005022145,0.000056216824,0.00003839761,0.00009988347,0.00040670435,0.51332325,0.0025826222,0.47911754,0.0035109576,0.00004588284],"about_ca_topic_score_codex":0.0028049387,"about_ca_topic_score_gemma":0.0033307313,"teacher_disagreement_score":0.020861616,"about_ca_system_score_codex":0.0029476634,"about_ca_system_score_gemma":0.0029236432,"threshold_uncertainty_score":0.11032808},"labels":[],"label_agreement":null},{"id":"W131676301","doi":"10.1609/aaai.v24i1.7676","title":"Conformal Mapping by Computationally Efficient Methods","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Robotics and Sensor-Based Localization","field":"Engineering","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":"Conformal map; Embedding; Dimensionality reduction; Data point; Invariant (physics); Mathematics; Curse of dimensionality; Computer science; Nonlinear dimensionality reduction; Algorithm; Artificial intelligence; Geometry","score_opus":0.04022714362415721,"score_gpt":0.2904839122789726,"score_spread":0.2502567686548154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W131676301","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.0012539127,0.00018618295,0.9943737,0.00013425034,0.000059065052,0.00006498129,0.00004489496,0.0002530702,0.0036299347],"genre_scores_gemma":[0.056863487,0.00062760036,0.9341046,0.00011441504,0.00014901742,0.00051712483,0.0002789375,0.00037366583,0.0069711073],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99881005,0.00032370884,0.00006263664,0.0001761158,0.00055341434,0.00007405131],"domain_scores_gemma":[0.9984157,0.00080312055,0.000084461244,0.00038082866,0.00027278988,0.000042977612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014968201,0.0011361712,0.0011053802,0.0016474122,0.00071239274,0.0020477478,0.0014126571,0.0009927015,0.009614164],"category_scores_gemma":[0.007342496,0.0007143459,0.0014055187,0.0015355634,0.0011145655,0.0019674571,0.002971469,0.0020610206,0.002865729],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053944186,0.00006899053,0.00046145546,0.00028364235,0.000073934265,0.00013429031,0.00019358248,0.25293595,0.004241637,0.34728888,0.011859103,0.38240454],"study_design_scores_gemma":[0.00003399975,0.000023490735,0.00015205302,0.000029709543,0.000013436144,0.000098191646,0.000041878557,0.7862565,0.0012479376,0.1892597,0.022826632,0.000016541908],"about_ca_topic_score_codex":0.002060246,"about_ca_topic_score_gemma":0.0019715352,"teacher_disagreement_score":0.009614164,"about_ca_system_score_codex":0.00091058604,"about_ca_system_score_gemma":0.0011515005,"threshold_uncertainty_score":0.032162607},"labels":[],"label_agreement":null},{"id":"W131788687","doi":"10.1609/aaai.v25i1.8039","title":"A Local Monte Carlo Tree Search Approach in Deterministic Planning","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","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":"Monte Carlo tree search; Satisficing; Planner; Computer science; Monte Carlo method; Random walk; Mathematical optimization; Scaling; Tree (set theory); Quality (philosophy); Plan (archaeology); Mathematics; Artificial intelligence; Statistics","score_opus":0.16540684520601592,"score_gpt":0.2982410021422671,"score_spread":0.1328341569362512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W131788687","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.0059850016,0.00041184694,0.99006397,0.0001518307,0.00001989385,0.00004910542,0.000041381485,0.0004247842,0.0028521982],"genre_scores_gemma":[0.3374224,0.00065967365,0.6578289,0.00018971223,0.00006113701,0.0004594663,0.00018546962,0.00025748467,0.0029357844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985958,0.000767994,0.000044046512,0.00018288329,0.0003502525,0.00005904826],"domain_scores_gemma":[0.9968003,0.002587891,0.00014819905,0.00020540463,0.00018151704,0.00007662005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002381691,0.0005847265,0.0009746784,0.0012203128,0.00057687564,0.00086322933,0.0015873822,0.0011926147,0.003551392],"category_scores_gemma":[0.008632434,0.00073489954,0.0008403727,0.001647842,0.0013204457,0.0014503932,0.0010270111,0.0013025859,0.00063242915],"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.000035830286,0.00002546106,0.00025621543,0.000048301168,0.00002509043,0.000033648048,0.000049371112,0.93920195,0.0003327764,0.033859838,0.00071175565,0.0254197],"study_design_scores_gemma":[0.000007713273,0.000014139268,0.00002796013,0.000005417693,0.000004700169,0.000009317053,0.0000030092842,0.9875995,0.0000944881,0.011770651,0.00045882782,0.000004309236],"about_ca_topic_score_codex":0.0073188036,"about_ca_topic_score_gemma":0.01094548,"teacher_disagreement_score":0.0073188036,"about_ca_system_score_codex":0.0013413918,"about_ca_system_score_gemma":0.0014023228,"threshold_uncertainty_score":0.014552414},"labels":[],"label_agreement":null},{"id":"W132575962","doi":"10.1609/aaai.v28i2.19025","title":"The Quest Draft: an Automated Course Allocation Algorithm","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Quest University Canada","funders":"","keywords":"Impartiality; Course (navigation); Transparency (behavior); Computer science; Liberal arts education; Operations research; Matching (statistics); Integer programming; Hull; Mathematics education; Management science; Algorithm; Political science; Engineering; Mathematics; Law; Computer security; Higher education","score_opus":0.12176083041922468,"score_gpt":0.4119766386927538,"score_spread":0.2902158082735291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W132575962","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.014938199,0.00031241428,0.9288946,0.0026007972,0.0005298577,0.0010035064,0.0031105254,0.0128278965,0.035782374],"genre_scores_gemma":[0.09368888,0.00016288993,0.87737566,0.00046503986,0.00016115059,0.0005378648,0.00503838,0.00092502614,0.021645186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987577,0.00037314562,0.00009170429,0.00026518723,0.00040233732,0.00010994749],"domain_scores_gemma":[0.996908,0.0013586323,0.00009178814,0.000517854,0.000982271,0.00014150173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022318156,0.00080726127,0.0007819642,0.0012696426,0.0015281637,0.0027026874,0.0020694635,0.0017668887,0.042143542],"category_scores_gemma":[0.01102858,0.0007500448,0.0009325538,0.001463048,0.00083223765,0.0024009107,0.0022493706,0.0014519085,0.01099604],"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.00046412207,0.0002511269,0.0014257095,0.00027482526,0.00006113038,0.00024029956,0.00023586489,0.058025323,0.0036847338,0.06263868,0.21813262,0.6545655],"study_design_scores_gemma":[0.0006861001,0.00021203596,0.00065035274,0.00005878499,0.00004169462,0.000196035,0.0001620042,0.8165249,0.0039742794,0.081012055,0.09644253,0.000039178703],"about_ca_topic_score_codex":0.0052512214,"about_ca_topic_score_gemma":0.0077991006,"teacher_disagreement_score":0.042143542,"about_ca_system_score_codex":0.0015536264,"about_ca_system_score_gemma":0.0047289883,"threshold_uncertainty_score":0.14098424},"labels":[],"label_agreement":null},{"id":"W132606982","doi":"10.1609/aaai.v26i1.8309","title":"Hierarchical Double Dirichlet Process Mixture of Gaussian Processes","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Gaussian Processes and Bayesian Inference","field":"Computer Science","cited_by":15,"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":"Hierarchical Dirichlet process; Dirichlet process; Mixture model; Gaussian process; Latent Dirichlet allocation; Computer science; Gaussian; Dirichlet distribution; Process (computing); Mathematics; Algorithm; Statistical physics; Applied mathematics; Artificial intelligence; Topic model; Mathematical analysis; Physics","score_opus":0.047686789340410374,"score_gpt":0.2969526604201138,"score_spread":0.24926587107970344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W132606982","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.011641894,0.00037646943,0.98480487,0.00039652953,0.000055777742,0.00006149904,0.0003070937,0.00025141347,0.0021044118],"genre_scores_gemma":[0.6181156,0.0010882849,0.3638671,0.0006281602,0.00035868355,0.0007377896,0.0017372592,0.00027056143,0.013196462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949956,0.00239258,0.00019138659,0.0011534538,0.0007724595,0.0004944582],"domain_scores_gemma":[0.99327856,0.0043514455,0.00051936717,0.0009064794,0.0006821994,0.00026202362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069687376,0.0013551202,0.0025358577,0.0023738218,0.0011661757,0.0035748375,0.0047429577,0.0032785377,0.0054193255],"category_scores_gemma":[0.01900108,0.0011143846,0.0024370342,0.0028811344,0.0024485048,0.004587638,0.0033275653,0.0038831965,0.0016159443],"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.0002355882,0.000080502105,0.002418502,0.00018417453,0.00013088009,0.00031373498,0.00067557493,0.49650723,0.0014752978,0.4616387,0.0035918336,0.03274787],"study_design_scores_gemma":[0.000024506178,0.000019034245,0.0003400612,0.000028291193,0.000022334376,0.00007332651,0.00004958095,0.85829973,0.00035479793,0.13850391,0.0022545857,0.000029870002],"about_ca_topic_score_codex":0.00911148,"about_ca_topic_score_gemma":0.008514499,"teacher_disagreement_score":0.00911148,"about_ca_system_score_codex":0.0027172458,"about_ca_system_score_gemma":0.0015022604,"threshold_uncertainty_score":0.036854625},"labels":[],"label_agreement":null},{"id":"W135686785","doi":"10.1609/aaai.v28i1.9035","title":"Adding Local Exploration to Greedy Best-First Search in Satisficing Planning","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates; Alberta Innovates - Technology Futures","keywords":"Satisficing; Local search (optimization); Guided Local Search; Best-first search; Mathematical optimization; Beam search; Incremental heuristic search; Heuristic; Greedy algorithm; Mathematics; Hill climbing; Search algorithm; Computer science; Artificial intelligence","score_opus":0.1138181047269164,"score_gpt":0.3124380235152062,"score_spread":0.19861991878828983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W135686785","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.026231773,0.0007534036,0.9653505,0.0003312525,0.000036284593,0.00012307939,0.00004066329,0.0023027903,0.0048303623],"genre_scores_gemma":[0.47476435,0.0004216861,0.52191085,0.0002595371,0.00004066696,0.00027746175,0.000121936035,0.0003594627,0.0018440199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788374,0.001205792,0.00008823844,0.00022540815,0.00041399262,0.0001828003],"domain_scores_gemma":[0.9962663,0.0027685147,0.00021293218,0.0004078564,0.00022010868,0.00012437967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029481861,0.0010747208,0.0012080236,0.0011208182,0.00070821174,0.0011625455,0.0016043963,0.0012349085,0.0024102586],"category_scores_gemma":[0.009413754,0.0007924043,0.0009224899,0.0011943431,0.0020640474,0.0023929998,0.002653409,0.0018201283,0.00054767],"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.00029626352,0.00013749416,0.0013396598,0.0002272142,0.00007281578,0.00013874579,0.0003728842,0.7947907,0.0031741606,0.032075536,0.0022702406,0.16510434],"study_design_scores_gemma":[0.000058349102,0.00015508325,0.00013070881,0.000032573007,0.000029755203,0.00005666246,0.00004757898,0.9693653,0.0019436742,0.026372496,0.0017854434,0.000022456616],"about_ca_topic_score_codex":0.005099509,"about_ca_topic_score_gemma":0.009135818,"teacher_disagreement_score":0.005099509,"about_ca_system_score_codex":0.0012032911,"about_ca_system_score_gemma":0.002391823,"threshold_uncertainty_score":0.015591681},"labels":[],"label_agreement":null},{"id":"W137325057","doi":"10.1609/aaai.v26i1.8319","title":"Approximate Policy Iteration with Linear Action Models","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - Technology Futures","keywords":"Benchmark (surveying); Computer science; Action (physics); Mathematical optimization; Linear model; Machine learning; Mathematics","score_opus":0.12002286483175004,"score_gpt":0.3180867896487678,"score_spread":0.19806392481701776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W137325057","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.012190749,0.00032723424,0.9851608,0.0002207296,0.000036042427,0.000051707386,0.000051227307,0.0006756426,0.0012859429],"genre_scores_gemma":[0.6353007,0.0002787504,0.35825124,0.0003608423,0.00007999519,0.00045982064,0.00039480734,0.00022041803,0.004653445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980427,0.0008632961,0.0001032745,0.00038789128,0.00041909324,0.00018365863],"domain_scores_gemma":[0.9928606,0.0056468286,0.00044415132,0.00042368646,0.00044217342,0.00018242178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003064049,0.0012763245,0.0024172647,0.0007341575,0.00043508483,0.0014461137,0.0023124602,0.0022189706,0.0028295454],"category_scores_gemma":[0.012621276,0.0010622208,0.0007671948,0.0009814098,0.0017496962,0.0024523034,0.001783129,0.0030633237,0.00073472795],"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.00011239167,0.000059263144,0.00039184673,0.00006920936,0.00003638746,0.000034193352,0.000040163097,0.96673757,0.00032451915,0.0071176337,0.00046400295,0.02461289],"study_design_scores_gemma":[0.000008104369,0.00001860051,0.000017580574,0.00000321405,0.0000021015128,0.000004716902,0.0000027940746,0.9954425,0.000154559,0.0042130672,0.00012999072,0.0000027435835],"about_ca_topic_score_codex":0.0073694726,"about_ca_topic_score_gemma":0.006346474,"teacher_disagreement_score":0.0073694726,"about_ca_system_score_codex":0.001608278,"about_ca_system_score_gemma":0.0028605938,"threshold_uncertainty_score":0.016204417},"labels":[],"label_agreement":null},{"id":"W1460409707","doi":"10.1609/aaai.v29i1.9337","title":"Efficient Task Sub-Delegation for Crowdsourcing","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Research Foundation","keywords":"Delegate; Crowdsourcing; Delegation; Reputation; Computer science; Workload; Task (project management); Outsourcing; Bridge (graph theory); Crowds; Computer security; Knowledge management; Business; Economics; World Wide Web","score_opus":0.12249598277600394,"score_gpt":0.31320414135557895,"score_spread":0.19070815857957502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1460409707","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.042019524,0.0004879219,0.94928825,0.00038831308,0.00011462727,0.00026009587,0.00010256462,0.0013433237,0.0059953383],"genre_scores_gemma":[0.8662236,0.00021169786,0.12657917,0.00009766836,0.00006269371,0.00024046394,0.00013799532,0.00014388433,0.0063029313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702007,0.0007874612,0.00016848386,0.000716224,0.0008329552,0.00047475967],"domain_scores_gemma":[0.99557024,0.0014293895,0.0005403553,0.0013558584,0.0005819319,0.00052224717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031532925,0.0013295284,0.0013705356,0.00082330336,0.001988338,0.0015039057,0.0029797035,0.0012631863,0.0035388279],"category_scores_gemma":[0.008974429,0.00063117093,0.0008996294,0.00084977056,0.0012039628,0.0023880247,0.0039508357,0.0013443539,0.0011038523],"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.0010533608,0.00037221838,0.0023161443,0.00042196675,0.00015457101,0.0005584061,0.0012684223,0.66889733,0.030288534,0.04012818,0.00938583,0.24515505],"study_design_scores_gemma":[0.00004030657,0.00008289623,0.00037743204,0.000013430558,0.000027468559,0.000079045916,0.00012268432,0.9688891,0.0038788537,0.022344735,0.0041148807,0.00002922262],"about_ca_topic_score_codex":0.006441962,"about_ca_topic_score_gemma":0.006970932,"teacher_disagreement_score":0.006441962,"about_ca_system_score_codex":0.0018517458,"about_ca_system_score_gemma":0.002607738,"threshold_uncertainty_score":0.016676426},"labels":[],"label_agreement":null},{"id":"W148231196","doi":"10.1609/aaai.v29i1.9752","title":"SAT-Based Strategy Extraction in Reachability Games","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, programming, and type systems","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":"Australian Government; Australian Research Council; Intel Corporation","keywords":"Reachability; Computer science; Counterexample; Formalism (music); Game tree; Sequential game; Tree traversal; Combinatorial game theory; Theoretical computer science; Tree (set theory); Game theory; Algorithm; Mathematics; Mathematical economics","score_opus":0.14760945046476223,"score_gpt":0.32976955996541985,"score_spread":0.1821601095006576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W148231196","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.019086923,0.00013911651,0.9747123,0.0001545883,0.00002296418,0.00019340627,0.00040768986,0.002226565,0.0030563795],"genre_scores_gemma":[0.20269541,0.00019868456,0.7928107,0.00014584605,0.000018001778,0.00027623633,0.0016519139,0.00041014524,0.0017929835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806076,0.0007300233,0.00017232017,0.00026225921,0.00057934306,0.00019537128],"domain_scores_gemma":[0.9969597,0.0022451035,0.00015250228,0.00028710585,0.00030487907,0.000050780043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014803708,0.0012599317,0.0010841932,0.0017661067,0.0007567021,0.001758731,0.0016027732,0.0010029337,0.004798199],"category_scores_gemma":[0.0063380147,0.00086735014,0.0023556198,0.0015338185,0.0013987515,0.0031326995,0.0017547156,0.0017452842,0.0011024899],"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.0003764968,0.00021141805,0.0024023256,0.0008583435,0.00021842081,0.00050676597,0.0004781558,0.49890983,0.01913373,0.21214178,0.0059075737,0.2588552],"study_design_scores_gemma":[0.000048546826,0.00004914617,0.00020516117,0.000054894314,0.000046303656,0.0000877299,0.00008184028,0.8935536,0.010625295,0.09098275,0.004242685,0.000022050532],"about_ca_topic_score_codex":0.0043605724,"about_ca_topic_score_gemma":0.008596272,"teacher_disagreement_score":0.004798199,"about_ca_system_score_codex":0.0013216712,"about_ca_system_score_gemma":0.0019084085,"threshold_uncertainty_score":0.01605159},"labels":[],"label_agreement":null},{"id":"W149016448","doi":"10.1609/aaai.v28i1.9036","title":"Type-Based Exploration with Multiple Search Queues for Satisficing Planning","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Satisficing; Heuristics; Queue; Heuristic; Local search (optimization); Mathematical optimization; Computer science; Mathematics; Artificial intelligence","score_opus":0.1257566293352239,"score_gpt":0.3106312486616953,"score_spread":0.18487461932647137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W149016448","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.028889738,0.00048876216,0.9640725,0.0003279661,0.00008988371,0.00020449546,0.00009462499,0.0013613879,0.0044706506],"genre_scores_gemma":[0.29635975,0.00029063533,0.6997255,0.00019487728,0.00004074621,0.00032393998,0.00017153371,0.00020858011,0.002684461],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865,0.0006180953,0.00011278325,0.00015239649,0.00030829065,0.00015847936],"domain_scores_gemma":[0.99661404,0.0021953636,0.0002445602,0.0004150867,0.00034898278,0.0001820918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026805075,0.0006132313,0.0008144078,0.0011726292,0.0010124983,0.0018279117,0.0019102413,0.0010428752,0.0040865694],"category_scores_gemma":[0.008442393,0.00067600486,0.0012895494,0.0013715494,0.0011551584,0.0030507834,0.0020960593,0.0016325659,0.00056450145],"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.0007364764,0.00028244033,0.003587438,0.00030707405,0.00012453049,0.00018200338,0.00066568644,0.548221,0.004819663,0.13564633,0.005539573,0.29988772],"study_design_scores_gemma":[0.000074107564,0.00012969792,0.00020185274,0.000027061582,0.000033293807,0.00005591644,0.00006292199,0.9465514,0.0019028723,0.04707531,0.0038581244,0.000027447717],"about_ca_topic_score_codex":0.006545516,"about_ca_topic_score_gemma":0.009817217,"teacher_disagreement_score":0.006545516,"about_ca_system_score_codex":0.0020353824,"about_ca_system_score_gemma":0.0037296042,"threshold_uncertainty_score":0.014767766},"labels":[],"label_agreement":null},{"id":"W1490176645","doi":"10.1609/aaai.v24i1.7565","title":"Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":178,"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; Set (abstract data type); Algorithm; Domain (mathematical analysis); Exploit; Solver; Selection (genetic algorithm); Process (computing); Portfolio; Machine learning; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.04901435405641711,"score_gpt":0.29536991143746544,"score_spread":0.24635555738104833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490176645","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.032907967,0.00058110466,0.9365918,0.0002741457,0.00010249822,0.00032999198,0.00034271087,0.024123557,0.004746257],"genre_scores_gemma":[0.2028433,0.00022557401,0.79275525,0.00022349418,0.000061699924,0.00053603726,0.00084866,0.001147115,0.001358882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973537,0.0011890322,0.00019741441,0.00043921507,0.00063135,0.00018941557],"domain_scores_gemma":[0.9941983,0.0035090067,0.0003399906,0.0012479426,0.0005175533,0.00018718137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004367223,0.0016234561,0.001432405,0.0015476067,0.0006126007,0.0018470815,0.0033188201,0.0015046434,0.004961977],"category_scores_gemma":[0.0118811615,0.0010080746,0.0012316399,0.0013855459,0.0011193708,0.0023087887,0.0022216728,0.0018678077,0.0023453583],"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.0005201997,0.00034651815,0.0047930432,0.00042336292,0.00027119086,0.00019168056,0.00019034931,0.5167754,0.009987707,0.018109197,0.018828467,0.4295628],"study_design_scores_gemma":[0.000114251714,0.00007261443,0.00024646125,0.000014743725,0.000024482082,0.000049374725,0.00002253357,0.9845547,0.0047554746,0.0061744787,0.003954714,0.00001614529],"about_ca_topic_score_codex":0.0019879746,"about_ca_topic_score_gemma":0.0028011573,"teacher_disagreement_score":0.004961977,"about_ca_system_score_codex":0.0010082177,"about_ca_system_score_gemma":0.0026825212,"threshold_uncertainty_score":0.023096323},"labels":[],"label_agreement":null},{"id":"W1490582271","doi":"10.1609/aaai.v24i1.7623","title":"An Approximate Subgame-Perfect Equilibrium Computation Technique for Repeated Games","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Hypercube; Subgame perfect equilibrium; Discounting; Set (abstract data type); Stochastic game; Mathematical optimization; Computer science; Computation; Integer (computer science); Point (geometry); Mathematical economics; Mathematics; Algorithm; Nash equilibrium; Parallel computing","score_opus":0.15214642404434298,"score_gpt":0.40870097926832477,"score_spread":0.2565545552239818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1490582271","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.003996752,0.000030293428,0.99469405,0.000026504193,0.000007249776,0.00004523818,0.000022962528,0.00018354812,0.0009933866],"genre_scores_gemma":[0.13479613,0.00011457255,0.86254686,0.000046619472,0.000015896761,0.0002976284,0.0001237894,0.00015362588,0.0019049536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989243,0.00035078495,0.00005392277,0.00019646314,0.00036592723,0.00010855448],"domain_scores_gemma":[0.998314,0.00097285217,0.00014117296,0.0003481395,0.00017704541,0.000046731962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001463475,0.00090782554,0.0013407232,0.00083496183,0.00077095337,0.00113721,0.0021435553,0.00078227243,0.005185092],"category_scores_gemma":[0.005996634,0.0006252627,0.0016693225,0.0008256867,0.0010948824,0.0024739325,0.0014081434,0.002396676,0.0009776899],"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.00018338114,0.00008980181,0.00074768474,0.00019192263,0.00011381304,0.00014836602,0.00049552735,0.6597254,0.006521335,0.23015688,0.0011372895,0.100488566],"study_design_scores_gemma":[0.000019330464,0.00004234921,0.0000623446,0.000018747329,0.000019476633,0.000043568896,0.000026488295,0.9230718,0.0021102817,0.072597854,0.001976464,0.000011312929],"about_ca_topic_score_codex":0.0041118893,"about_ca_topic_score_gemma":0.003887557,"teacher_disagreement_score":0.005185092,"about_ca_system_score_codex":0.0012682213,"about_ca_system_score_gemma":0.0012999115,"threshold_uncertainty_score":0.017345905},"labels":[],"label_agreement":null},{"id":"W1504069565","doi":"10.1609/aaai.v24i1.7685","title":"Structure Learning for Markov Logic Networks with Many Descriptive Attributes","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Statistical relational learning; Computer science; Artificial intelligence; Benchmark (surveying); Relational database; Markov chain; Machine learning; Inductive logic programming; Bayesian network; Theoretical computer science; Data mining","score_opus":0.055824140211250525,"score_gpt":0.27158492372592974,"score_spread":0.2157607835146792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504069565","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.022150451,0.00035933213,0.97404104,0.0006415251,0.000021355965,0.0000580564,0.0004408118,0.00048787927,0.0017996195],"genre_scores_gemma":[0.54371125,0.0008328937,0.4469777,0.0005811794,0.00012379819,0.00039441144,0.0027600254,0.0001778832,0.004440916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989201,0.0004430024,0.000051396357,0.00030984858,0.00020374933,0.00007192521],"domain_scores_gemma":[0.9919763,0.006852329,0.00040377455,0.00031802262,0.00031123566,0.00013826852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002456947,0.00071783515,0.00086850347,0.0016046896,0.0008181737,0.0014021691,0.0015614369,0.0012258354,0.0036970237],"category_scores_gemma":[0.013298286,0.0007902605,0.0012438892,0.0012469122,0.0011023161,0.004330725,0.0014276142,0.0023207522,0.00049802626],"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.00012376497,0.00009343696,0.0026506144,0.00015151454,0.00008398062,0.00012912722,0.00016797398,0.75846314,0.0007772722,0.14144613,0.002720299,0.09319272],"study_design_scores_gemma":[0.000008183505,0.000007664281,0.00009229758,0.000009079642,0.000007208761,0.000011452868,0.00000813163,0.8886117,0.00014233419,0.11074982,0.0003481185,0.000004026447],"about_ca_topic_score_codex":0.0075427094,"about_ca_topic_score_gemma":0.015344182,"teacher_disagreement_score":0.0075427094,"about_ca_system_score_codex":0.0028486985,"about_ca_system_score_gemma":0.001728323,"threshold_uncertainty_score":0.020668864},"labels":[],"label_agreement":null},{"id":"W1504915502","doi":"10.1609/aaai.v24i1.7751","title":"Using Bisimulation for Policy Transfer in MDPs","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Bisimulation; Computer science; Pessimism; Task (project management); Metric (unit); Markov decision process; Transfer (computing); Action (physics); Quality (philosophy); Theoretical computer science; Artificial intelligence; Markov process; Mathematics; Economics","score_opus":0.13511302919804696,"score_gpt":0.35650515512498543,"score_spread":0.22139212592693847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504915502","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.029525306,0.00015076745,0.9683262,0.00021839363,0.000023531713,0.0000957544,0.000033373715,0.00047365378,0.0011529662],"genre_scores_gemma":[0.70917064,0.0002102614,0.28872,0.00017556442,0.00002850704,0.0006063104,0.00015676123,0.00022041869,0.0007114673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99570197,0.0023183436,0.00034140126,0.00063330383,0.00071108143,0.00029388364],"domain_scores_gemma":[0.982463,0.012710504,0.0016039856,0.001627289,0.00091084145,0.00068438414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007882175,0.0022380573,0.001968806,0.0018686543,0.0010471073,0.0019568652,0.0022738413,0.0021740298,0.0026720439],"category_scores_gemma":[0.03515433,0.0010643506,0.001294177,0.0010713486,0.0027746402,0.005382282,0.0049357507,0.003635802,0.00041400443],"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.00016198438,0.00008569885,0.00055977475,0.000090176116,0.000053860997,0.00003425929,0.00014491413,0.90996313,0.0013816479,0.059368514,0.00020390884,0.027952034],"study_design_scores_gemma":[0.000026101245,0.00008366796,0.000055125805,0.000015537355,0.00000860264,0.000009179269,0.000014492672,0.9539768,0.0014092617,0.04409033,0.0002992935,0.000011650144],"about_ca_topic_score_codex":0.0024259456,"about_ca_topic_score_gemma":0.0015877155,"teacher_disagreement_score":0.007882175,"about_ca_system_score_codex":0.003690415,"about_ca_system_score_gemma":0.0027235004,"threshold_uncertainty_score":0.041685462},"labels":[],"label_agreement":null},{"id":"W1505083629","doi":"10.1609/aaai.v24i1.7563","title":"Searching Without a Heuristic: Efficient Use of Abstraction","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Heuristics; Heuristic; Incremental heuristic search; Null-move heuristic; Computer science; Abstraction; Consistent heuristic; Bidirectional search; Beam search; Search algorithm; Path (computing); Node (physics); Algorithm; Theoretical computer science; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.09218876173904127,"score_gpt":0.3059573326956114,"score_spread":0.2137685709565701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505083629","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.036379233,0.00049724674,0.95618826,0.000234496,0.000028596543,0.00021922917,0.000105373256,0.0018793246,0.0044683106],"genre_scores_gemma":[0.29273716,0.00031308387,0.7046966,0.00014016568,0.00002222651,0.0003208363,0.00032727548,0.00024998435,0.0011926814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770063,0.00087235647,0.00017916132,0.0003043951,0.0006838688,0.00025964406],"domain_scores_gemma":[0.99525297,0.00246965,0.00035728255,0.0014739403,0.0003043673,0.00014192973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029407428,0.0016059467,0.0021260404,0.0014937766,0.0009131561,0.0022209203,0.0027538785,0.0014678185,0.0025619783],"category_scores_gemma":[0.010470549,0.00092030043,0.0015371828,0.0021944197,0.0016286201,0.0038133853,0.003303069,0.0019909458,0.0007237356],"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.00047650412,0.0003125628,0.0022695146,0.0003984526,0.00016368883,0.00026997752,0.00044799506,0.54491013,0.008592351,0.06430178,0.004366121,0.37349087],"study_design_scores_gemma":[0.00006844138,0.000119147255,0.00019979267,0.00003211622,0.00005008382,0.00006286648,0.00006691878,0.94390696,0.002785941,0.05023553,0.0024510014,0.000021268579],"about_ca_topic_score_codex":0.004439928,"about_ca_topic_score_gemma":0.0049004387,"teacher_disagreement_score":0.004439928,"about_ca_system_score_codex":0.0011700082,"about_ca_system_score_gemma":0.0032330332,"threshold_uncertainty_score":0.015552342},"labels":[],"label_agreement":null},{"id":"W1512866498","doi":"10.1609/aaai.v26i1.8321","title":"Investigating Contingency Awareness Using Atari 2600 Games","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"University of Alberta; Alberta Innovates; Western Canada Research Grid; Compute Canada","keywords":"Contingency; Reinforcement learning; Exploit; Computer science; Function (biology); Control (management); Value (mathematics); Reinforcement; Artificial intelligence; Contingency management; Bellman equation; Human–computer interaction; Machine learning; Psychology; Social psychology; Computer security","score_opus":0.13878597859183864,"score_gpt":0.32726220209429063,"score_spread":0.188476223502452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512866498","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.93271923,0.00012339704,0.06183095,0.00022078754,0.000024216284,0.00014562024,0.00018040839,0.00022374639,0.0045317183],"genre_scores_gemma":[0.978865,0.000028794248,0.02011225,0.00003834449,0.000004557876,0.00005627756,0.00013404885,0.000017610855,0.0007431327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989699,0.00057016045,0.000032243865,0.00016341398,0.00017907766,0.000085165404],"domain_scores_gemma":[0.9949379,0.003808554,0.00036190596,0.00032478248,0.00027364065,0.00029328951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018589629,0.0007595566,0.0006256036,0.00047799308,0.0004931751,0.0009255846,0.0012602984,0.0006194917,0.0016279907],"category_scores_gemma":[0.011444485,0.00029352307,0.0004782608,0.00028682838,0.0011109541,0.0015827655,0.0012760662,0.0016778759,0.00012900293],"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.0010811877,0.0011010434,0.017340956,0.00024817305,0.00025209322,0.00041105863,0.001276351,0.879957,0.0077755973,0.030537589,0.0022133328,0.057805568],"study_design_scores_gemma":[0.000046108067,0.00028210293,0.0021418536,0.0000096304575,0.000012138991,0.00003159877,0.00014539734,0.9865964,0.0013048786,0.008717217,0.000695378,0.000017272183],"about_ca_topic_score_codex":0.008297101,"about_ca_topic_score_gemma":0.009641239,"teacher_disagreement_score":0.008297101,"about_ca_system_score_codex":0.0011875355,"about_ca_system_score_gemma":0.0006866451,"threshold_uncertainty_score":0.016497612},"labels":[],"label_agreement":null},{"id":"W1516079915","doi":"10.1609/aaai.v24i1.7774","title":"Team Formation with Heterogeneous Agents in Computer Games","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Multi-Agent Systems and Negotiation","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 Windsor","funders":"","keywords":"Task (project management); Computer science; Human–computer interaction; Engineering; Systems engineering","score_opus":0.06497554769171661,"score_gpt":0.28576637603564603,"score_spread":0.22079082834392944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516079915","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.14605509,0.0013641961,0.8089278,0.0019498261,0.0002762866,0.00036739957,0.00007030894,0.00021404083,0.040775057],"genre_scores_gemma":[0.88668954,0.00052285567,0.10349052,0.00019233687,0.00010487505,0.0004276124,0.000071829985,0.000049022397,0.008451483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967122,0.0019348883,0.00015318207,0.00041880144,0.0004300906,0.00035084697],"domain_scores_gemma":[0.99598444,0.0021836075,0.00047818507,0.00027490305,0.00024824502,0.0008306655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027334627,0.00085624127,0.001196591,0.00093831186,0.0022308612,0.0028508054,0.00169692,0.0020024716,0.0032202993],"category_scores_gemma":[0.0089281695,0.00078101805,0.0009059583,0.00074020016,0.0029335746,0.0033685828,0.0046825404,0.0017090581,0.0004571028],"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.00021276377,0.00015054167,0.0017262554,0.00017781707,0.00012107951,0.00050321355,0.001744785,0.34045833,0.0014956172,0.6288273,0.0025861217,0.021996245],"study_design_scores_gemma":[0.0001473904,0.00012965097,0.00039951844,0.00004452933,0.00004020918,0.000110053814,0.00059542636,0.57167155,0.000501269,0.41892105,0.0074058985,0.000033478842],"about_ca_topic_score_codex":0.0036258965,"about_ca_topic_score_gemma":0.0030505732,"teacher_disagreement_score":0.0036258965,"about_ca_system_score_codex":0.0015138577,"about_ca_system_score_gemma":0.0011909753,"threshold_uncertainty_score":0.014456153},"labels":[],"label_agreement":null},{"id":"W1517186652","doi":"10.1609/aaai.v28i1.8719","title":"Compact Aspect Embedding for Diversified Query Expansions","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":14,"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 Montréal","funders":"","keywords":"Query expansion; Computer science; Query optimization; Embedding; Mathematics; Algorithm; Information retrieval; Artificial intelligence","score_opus":0.09190406747836932,"score_gpt":0.34246559585884045,"score_spread":0.25056152838047113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517186652","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.08279878,0.0011212339,0.9117624,0.0002106796,0.00003101872,0.00014556808,0.0002902608,0.0012854189,0.002354567],"genre_scores_gemma":[0.6063257,0.0007690593,0.38674748,0.00026552708,0.00010543259,0.0002461572,0.0015413815,0.0002637546,0.0037355062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991381,0.00027339527,0.000063417676,0.00014989427,0.0003042029,0.00007095808],"domain_scores_gemma":[0.99893624,0.00047602633,0.000114403476,0.00022526683,0.00020006413,0.00004798582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008535791,0.00077292736,0.00088741543,0.0015937823,0.00025562206,0.0006738488,0.0006695396,0.00067705644,0.0011152246],"category_scores_gemma":[0.0035326334,0.00027072243,0.00061701157,0.0014893706,0.00058263366,0.0017560516,0.0011675283,0.00093701726,0.00046202188],"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.00044062024,0.0003300194,0.0041146576,0.00035849444,0.00009485659,0.0003569109,0.0003696997,0.159978,0.07010652,0.029817926,0.008879426,0.7251529],"study_design_scores_gemma":[0.000035435645,0.00015149699,0.0009267571,0.000016140579,0.000022922652,0.000336409,0.00006755125,0.96995914,0.008707257,0.015428397,0.004327739,0.000020731575],"about_ca_topic_score_codex":0.0009714895,"about_ca_topic_score_gemma":0.0016218625,"teacher_disagreement_score":0.0015937823,"about_ca_system_score_codex":0.00033606353,"about_ca_system_score_gemma":0.00044779474,"threshold_uncertainty_score":0.0045142174},"labels":[],"label_agreement":null},{"id":"W152472178","doi":"10.1609/aaai.v26i1.8373","title":"MAXSAT Heuristics for Cost Optimal Planning","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Nanjing University; Government of Jiangsu Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Maximum satisfiability problem; Heuristics; Heuristic; Computation; Encoding (memory); Set (abstract data type); Computer science; Mathematical optimization; Algorithm; Mathematics; Artificial intelligence; Boolean function","score_opus":0.11989317767544434,"score_gpt":0.3230394606003565,"score_spread":0.20314628292491216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W152472178","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.010572825,0.0010974089,0.97325855,0.0005252075,0.000086993154,0.00020433287,0.0005286079,0.0016484511,0.012077642],"genre_scores_gemma":[0.17610708,0.0008422498,0.8176608,0.0003021615,0.000095966345,0.00038039387,0.00095023273,0.00039407783,0.0032669832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985191,0.00068393134,0.0000815311,0.00017676996,0.0003906799,0.00014800366],"domain_scores_gemma":[0.9977962,0.0015970065,0.00015198822,0.00025007053,0.0001512544,0.000053397984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017140957,0.0011485897,0.0008640552,0.0014750874,0.0006359069,0.0021026025,0.0014891834,0.0008419609,0.00597491],"category_scores_gemma":[0.0050332183,0.0007913562,0.0010914042,0.0022684918,0.0012799638,0.0019479407,0.0013480817,0.0021873158,0.00090508035],"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.00020955715,0.000074552205,0.0003145026,0.00031018924,0.00005419998,0.000088616216,0.00012989147,0.6653908,0.0015793346,0.20796327,0.009004406,0.11488068],"study_design_scores_gemma":[0.00006829778,0.000052636144,0.00012808423,0.000090306065,0.000025263264,0.0000360435,0.000048019403,0.79562855,0.0020218901,0.1934494,0.008432323,0.000019124074],"about_ca_topic_score_codex":0.0050233873,"about_ca_topic_score_gemma":0.009838878,"teacher_disagreement_score":0.00597491,"about_ca_system_score_codex":0.0031229714,"about_ca_system_score_gemma":0.0022846947,"threshold_uncertainty_score":0.022658825},"labels":[],"label_agreement":null},{"id":"W1527745059","doi":"10.1609/aaai.v24i1.7559","title":"Using Lookaheads with Optimal Best-First Search","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Speedup; Heuristics; Exploit; Breadth-first search; Distributed File System; Computer science; Search algorithm; Depth-first search; Algorithm; Search problem; Beam search; Best-first search; Parallel computing; Theoretical computer science; Operating system","score_opus":0.11117290488117013,"score_gpt":0.3144024564566372,"score_spread":0.2032295515754671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527745059","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.024401322,0.00069487427,0.9632505,0.00034163333,0.00007620009,0.00010720674,0.00016033126,0.0034249912,0.007542958],"genre_scores_gemma":[0.2793384,0.000267963,0.71713334,0.00013213365,0.000021506918,0.00013539694,0.00032198045,0.00034698774,0.0023023046],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999086,0.00030170844,0.00007038845,0.00019786276,0.00023405247,0.00010992901],"domain_scores_gemma":[0.99815553,0.0010413935,0.00016447621,0.0003839165,0.0001659182,0.00008885366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013637403,0.0010701244,0.0009269808,0.0012077097,0.0010327386,0.0015153484,0.001882865,0.0010391789,0.005329437],"category_scores_gemma":[0.0058669513,0.0008983253,0.00064793834,0.0014811716,0.0010297196,0.0033517675,0.0025030691,0.001250194,0.0011320922],"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.0009812712,0.000275995,0.0015965775,0.00034953063,0.00013033637,0.00019273456,0.00034245203,0.437361,0.008814006,0.079912186,0.007587215,0.46245673],"study_design_scores_gemma":[0.00011253392,0.00015412296,0.00015840794,0.00005496183,0.000058586353,0.00010017788,0.00007332484,0.8889832,0.008441039,0.09484697,0.0069720475,0.00004470616],"about_ca_topic_score_codex":0.0051560537,"about_ca_topic_score_gemma":0.005691331,"teacher_disagreement_score":0.005329437,"about_ca_system_score_codex":0.00094073097,"about_ca_system_score_gemma":0.0023196794,"threshold_uncertainty_score":0.017828703},"labels":[],"label_agreement":null},{"id":"W1537258144","doi":"10.1609/aaai.v24i1.7542","title":"High-Quality Policies for the Canadian Traveler's Problem","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"FP7 Information and Communication Technologies; Deutsche Forschungsgemeinschaft; European Commission","keywords":"Computer science; Quality (philosophy); Adverse weather; Path (computing); Property (philosophy); Operations research; Distribution (mathematics); Mathematical optimization; Mathematics; Geography; Meteorology","score_opus":0.2497342761916848,"score_gpt":0.42072734767578107,"score_spread":0.17099307148409626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537258144","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.32702467,0.0017538024,0.6374983,0.0034020483,0.00015566994,0.0005976922,0.0010086119,0.0012997343,0.027259443],"genre_scores_gemma":[0.90866804,0.0007108456,0.08696552,0.00021374284,0.000031917996,0.00011689934,0.0004890085,0.00007692798,0.0027269593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979023,0.0005961045,0.00008246369,0.00022208998,0.000799198,0.00039794872],"domain_scores_gemma":[0.992482,0.005006183,0.0006083287,0.00041969636,0.00078992586,0.0006937748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036223927,0.0010843301,0.0012599265,0.0011378337,0.0017008471,0.0019521697,0.0018908171,0.0017049351,0.0033718387],"category_scores_gemma":[0.014331694,0.0005985735,0.0005581707,0.0017206707,0.0016853942,0.0017683628,0.0013072436,0.0019858982,0.00017442089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015089054,0.00005978583,0.0005721182,0.00006556103,0.000021948028,0.000036261317,0.000067905086,0.9589204,0.0002972196,0.02576508,0.0018058133,0.012237047],"study_design_scores_gemma":[0.00007975963,0.0000402429,0.00045664172,0.000010596744,0.000009383459,0.0000218689,0.00004187933,0.98102677,0.00031098918,0.016869793,0.0011167896,0.000015213989],"about_ca_topic_score_codex":0.25354078,"about_ca_topic_score_gemma":0.20587498,"teacher_disagreement_score":0.74645925,"about_ca_system_score_codex":0.010193907,"about_ca_system_score_gemma":0.0135772135,"threshold_uncertainty_score":0.50413},"labels":[],"label_agreement":null},{"id":"W1541317966","doi":"10.1609/aaai.v24i1.7740","title":"Robust Policy Computation in Reward-Uncertain MDPs Using Nondominated Policies","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":47,"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":"Regret; Markov decision process; Minimax; Computer science; Mathematical optimization; Set (abstract data type); Computation; Parallels; Exploit; Mathematics; Markov process; Algorithm; Machine learning; Economics","score_opus":0.12308326003183422,"score_gpt":0.3346686475142595,"score_spread":0.21158538748242528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541317966","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.029321834,0.00010550763,0.9688779,0.00018890522,0.000020296544,0.000057951853,0.00007805253,0.00034377587,0.0010058031],"genre_scores_gemma":[0.5715406,0.000221616,0.42643264,0.0001175901,0.000026676817,0.0002756169,0.00026502597,0.00017008491,0.0009501011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809796,0.00073306344,0.00014855212,0.0004614026,0.00036416991,0.00019472005],"domain_scores_gemma":[0.98623544,0.010962852,0.0008195315,0.0012085261,0.00046480703,0.00030874115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047403607,0.0012870333,0.0018473363,0.00084165373,0.0006756426,0.002160882,0.0015345132,0.001471088,0.003252332],"category_scores_gemma":[0.02550971,0.0010835233,0.0013797343,0.0009105396,0.0020811774,0.0038843418,0.0029484464,0.003078257,0.0003093014],"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.00010914462,0.00003081679,0.00036287252,0.000060130358,0.000022972665,0.000040550924,0.000054735734,0.95705956,0.0005735706,0.028576836,0.00020954676,0.012899287],"study_design_scores_gemma":[0.000015658296,0.00002456796,0.00004190389,0.000011571994,0.0000040810546,0.0000071089034,0.000009541075,0.97399205,0.0006280937,0.025123218,0.00013732055,0.00000494349],"about_ca_topic_score_codex":0.0030080718,"about_ca_topic_score_gemma":0.0032602113,"teacher_disagreement_score":0.0047403607,"about_ca_system_score_codex":0.0019259691,"about_ca_system_score_gemma":0.002689141,"threshold_uncertainty_score":0.025069714},"labels":[],"label_agreement":null},{"id":"W1545756310","doi":"10.1609/aaai.v24i1.7620","title":"Coalitional Structure Generation in Skill Games","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Ministry of Education, Science and Technology; National Research Foundation of Korea; National Research Foundation","keywords":"Bounded function; Partition (number theory); Graph; Computer science; Mathematical optimization; Representation (politics); Constraint (computer-aided design); Function (biology); Mathematics; Mathematical economics; Theoretical computer science; Combinatorics","score_opus":0.08195544025917015,"score_gpt":0.2679893737776672,"score_spread":0.18603393351849704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545756310","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.056487117,0.00019761985,0.9316742,0.0008150591,0.000043999844,0.00029181485,0.00033634837,0.00026657153,0.009887332],"genre_scores_gemma":[0.5962413,0.00036008525,0.3929932,0.0003787237,0.00006700824,0.00051358313,0.0008416179,0.00018099196,0.00842351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848264,0.0007420141,0.000057972757,0.00025126227,0.00025178015,0.00021434901],"domain_scores_gemma":[0.9975199,0.0016979292,0.00018104084,0.00023876208,0.00015820118,0.00020427896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015436382,0.00090928294,0.0009889563,0.0006379496,0.00074280053,0.001332378,0.0016728975,0.0012718812,0.0048006703],"category_scores_gemma":[0.008475296,0.0004476287,0.0008782692,0.0012154637,0.0013763058,0.003035967,0.0018270174,0.0018364192,0.0005377977],"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.000137847,0.00018906663,0.00083897775,0.00021487426,0.00005935514,0.00018494371,0.0003424211,0.62433076,0.0016788429,0.32118198,0.004328753,0.046512187],"study_design_scores_gemma":[0.000052904197,0.000044174456,0.00011398702,0.000016510756,0.000012986214,0.00003677822,0.00007160491,0.74561656,0.0007874134,0.2505924,0.0026441028,0.00001060196],"about_ca_topic_score_codex":0.004467623,"about_ca_topic_score_gemma":0.0061657154,"teacher_disagreement_score":0.0048006703,"about_ca_system_score_codex":0.001725235,"about_ca_system_score_gemma":0.0016668593,"threshold_uncertainty_score":0.016059875},"labels":[],"label_agreement":null},{"id":"W1546791496","doi":"10.1609/aaai.v25i1.7975","title":"Using Semantic Cues to Learn Syntax","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","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":"Artificial Intelligence in Medicine (Canada)","funders":"Army Research Laboratory; Air Force Research Laboratory; Army Research Office; Advanced Research Projects Agency; Defense Advanced Research Projects Agency","keywords":"Computer science; Natural language processing; Artificial intelligence; Syntactic predicate; Intuition; Predicate (mathematical logic); Exploit; Syntax; Programming language; Cognitive science","score_opus":0.2479244645014024,"score_gpt":0.32588280797772073,"score_spread":0.07795834347631833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546791496","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.011311899,0.0001613979,0.97857976,0.0003308382,0.000058047524,0.00007642299,0.00087933434,0.0053714453,0.0032308314],"genre_scores_gemma":[0.305199,0.00036865484,0.68049073,0.00036809716,0.00010633598,0.00032349408,0.0075035905,0.0012632174,0.0043768706],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988714,0.00040530012,0.00005342219,0.0004066905,0.00019364934,0.00006950147],"domain_scores_gemma":[0.99622464,0.0024851125,0.0001985053,0.0006141106,0.0003724506,0.00010520622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011966309,0.0012873681,0.00066924776,0.0025675665,0.0008400528,0.001283072,0.0016842786,0.0011210729,0.006390004],"category_scores_gemma":[0.0077811256,0.0008763324,0.0011783099,0.0015860006,0.0008805181,0.004449567,0.0022576968,0.002671608,0.0035652097],"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.00020073615,0.00031029127,0.0050665163,0.00049194344,0.00016613147,0.00042560897,0.0007049536,0.072430536,0.028660413,0.07343585,0.027470212,0.79063684],"study_design_scores_gemma":[0.000049257877,0.000056395314,0.0010966522,0.00006578583,0.00006525166,0.00015652328,0.000115182906,0.8317744,0.014512255,0.13564815,0.01639563,0.00006438705],"about_ca_topic_score_codex":0.0030448444,"about_ca_topic_score_gemma":0.0075828223,"teacher_disagreement_score":0.006390004,"about_ca_system_score_codex":0.00091384235,"about_ca_system_score_gemma":0.001705065,"threshold_uncertainty_score":0.02137667},"labels":[],"label_agreement":null},{"id":"W1549466950","doi":"10.1609/aaai.v24i1.7754","title":"Simultaneous Elicitation of Preference Features and Utility","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","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 Toronto","funders":"","keywords":"Regret; Preference elicitation; Computer science; Heuristic; Set (abstract data type); Preference; Expected utility hypothesis; Focus (optics); Minimax; Feature (linguistics); Machine learning; Artificial intelligence; Utility theory; Mathematical optimization; Mathematics; Mathematical economics","score_opus":0.043598398824235475,"score_gpt":0.29006350051815694,"score_spread":0.24646510169392147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549466950","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.035610978,0.00029099206,0.9553388,0.0010393284,0.00003061969,0.0005133042,0.00020336793,0.00021312531,0.006759442],"genre_scores_gemma":[0.6288834,0.0002917886,0.36741543,0.00035626796,0.0000714713,0.0011198837,0.00027705787,0.000059377937,0.0015254258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9633097,0.026353972,0.0017735733,0.0024622488,0.0051602484,0.00094033644],"domain_scores_gemma":[0.93189484,0.05369841,0.0030411007,0.007173925,0.0033323423,0.00085933955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020746222,0.0015377839,0.0019617418,0.0011642628,0.00076732895,0.0031562515,0.002123437,0.002089143,0.0047524297],"category_scores_gemma":[0.07563871,0.00081232213,0.0012536693,0.0020435406,0.001862477,0.006510392,0.004600914,0.0036582383,0.00057391217],"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.0017680561,0.00082951563,0.0040904223,0.0015425398,0.00041597447,0.00039836043,0.0033753032,0.10199647,0.016404968,0.4750785,0.00592104,0.38817888],"study_design_scores_gemma":[0.0003196148,0.00070673693,0.0022085644,0.00018736222,0.00015725354,0.00026838144,0.0008413079,0.37350202,0.012188823,0.6006153,0.008824668,0.00017992227],"about_ca_topic_score_codex":0.00070120784,"about_ca_topic_score_gemma":0.0010649464,"teacher_disagreement_score":0.020746222,"about_ca_system_score_codex":0.0020202834,"about_ca_system_score_gemma":0.0017776019,"threshold_uncertainty_score":0.10971779},"labels":[],"label_agreement":null},{"id":"W1556393817","doi":"10.1609/aaai.v24i1.7516","title":"On the Reputation of Agent-Based Web Services","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Access Control and Trust","field":"Social Sciences","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reputation; Reputation management; Computer science; Web service; Game theory; Control (management); Mechanism (biology); World Wide Web; WS-Policy; Reputation system; Internet privacy; Business; Web development; Web application security; Microeconomics; Artificial intelligence; Economics","score_opus":0.05718982290935891,"score_gpt":0.32092260690084523,"score_spread":0.2637327839914863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556393817","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.09033426,0.00205656,0.8652082,0.0057787104,0.0001700463,0.00010431187,0.0000685736,0.00022328962,0.036055993],"genre_scores_gemma":[0.9713443,0.0005450392,0.02559046,0.00013197308,0.00009895551,0.00003516821,0.000012615888,0.000028111797,0.0022133838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99506,0.0024361142,0.00018535639,0.0004494253,0.0014095786,0.00045942917],"domain_scores_gemma":[0.98655266,0.007998383,0.0015653921,0.0013142233,0.0018816962,0.0006876309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051416373,0.0005335156,0.0008222555,0.0013545771,0.0010410304,0.0042523993,0.0016529802,0.0017057906,0.0016705046],"category_scores_gemma":[0.020202916,0.00037746623,0.0005815692,0.0007740514,0.003687033,0.005738645,0.0016506441,0.0015087194,0.00029288098],"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.000071982155,0.00004493441,0.00078123336,0.00006005542,0.00004752755,0.00012842072,0.00019470764,0.1211123,0.0015693953,0.86102587,0.001054002,0.013909649],"study_design_scores_gemma":[0.000021025939,0.00006488098,0.00046684264,0.000031187465,0.000030175366,0.00007818493,0.000077188684,0.6477855,0.0005538588,0.34828144,0.0025763891,0.000033362052],"about_ca_topic_score_codex":0.0051925844,"about_ca_topic_score_gemma":0.0024630667,"teacher_disagreement_score":0.0051925844,"about_ca_system_score_codex":0.003551854,"about_ca_system_score_gemma":0.0017351287,"threshold_uncertainty_score":0.027191877},"labels":[],"label_agreement":null},{"id":"W1565409700","doi":"10.1609/aaai.v26i1.8378","title":"Parsing Outdoor Scenes from Streamed 3D Laser Data Using Online Clustering and Incremental Belief Updates","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Remote Sensing and LiDAR Applications","field":"Environmental 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":"Artificial Intelligence in Medicine (Canada)","funders":"Engineering and Physical Sciences Research Council; Office of Naval Research; Multidisciplinary University Research Initiative","keywords":"Computer science; Parsing; Cluster analysis; Artificial intelligence; Computer vision","score_opus":0.11842088435846825,"score_gpt":0.31548920466179237,"score_spread":0.1970683203033241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565409700","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.014200183,0.0000783988,0.98372597,0.0001192426,0.000012574767,0.000032735134,0.00006678183,0.0014855162,0.0002787001],"genre_scores_gemma":[0.30167928,0.00014300787,0.69559366,0.00019196486,0.000053546235,0.000116196294,0.0007005509,0.00031721755,0.0012045831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991043,0.00012606104,0.000049664188,0.00035186263,0.00027260132,0.00009544872],"domain_scores_gemma":[0.99773717,0.001086731,0.00026890336,0.00037665552,0.00044044352,0.00009009505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012091582,0.0011889451,0.0012447383,0.0017081936,0.00070055394,0.0016805145,0.0035524617,0.0014072928,0.0011222188],"category_scores_gemma":[0.0042326665,0.0012681169,0.0013126826,0.0016602206,0.0010708179,0.003717042,0.0018821831,0.0017108968,0.00056405854],"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.00014689652,0.00015646883,0.0023167562,0.00010324349,0.000110585934,0.0001461474,0.0003416404,0.72833025,0.008501309,0.0064711287,0.0019625656,0.25141302],"study_design_scores_gemma":[0.0000049857185,0.000012430767,0.00016433695,0.000002482396,0.0000068100176,0.000015946329,0.000022015505,0.99332374,0.0016048409,0.0045193783,0.00031564897,0.0000073381625],"about_ca_topic_score_codex":0.015447568,"about_ca_topic_score_gemma":0.022247868,"teacher_disagreement_score":0.015447568,"about_ca_system_score_codex":0.0014435044,"about_ca_system_score_gemma":0.0014839048,"threshold_uncertainty_score":0.030715287},"labels":[],"label_agreement":null},{"id":"W1566916977","doi":"10.1609/aaai.v26i1.8173","title":"Prediction and Fault Detection of Environmental Signals with Uncharacterised Faults","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Fault Detection and Control Systems","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Toronto","funders":"","keywords":"Classification of discontinuities; Fault detection and isolation; Fault (geology); Computer science; A priori and a posteriori; Nonlinear system; Domain (mathematical analysis); Algorithm; Data mining; Real-time computing; Artificial intelligence; Geology; Seismology; Mathematics","score_opus":0.023246591658431726,"score_gpt":0.2115662548659166,"score_spread":0.18831966320748486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1566916977","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.23799035,0.00017094986,0.76081055,0.00020094734,0.000038660266,0.000016493364,0.000096504926,0.00034312252,0.00033240882],"genre_scores_gemma":[0.94653344,0.00009618388,0.052605283,0.000028136057,0.000030376988,0.000009840469,0.00012510025,0.000014096842,0.000557471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958104,0.0000997973,0.000028076358,0.000112419766,0.00010595978,0.00007272833],"domain_scores_gemma":[0.9981654,0.0011760617,0.00023044631,0.00014960802,0.00020943432,0.000069029935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009726996,0.0005355916,0.0005857311,0.000576742,0.0002350827,0.00062197854,0.00068822654,0.0007653707,0.00041700082],"category_scores_gemma":[0.0048425337,0.00032449712,0.0003105489,0.00051563146,0.00062573596,0.0009910899,0.0006164044,0.000975659,0.00011583625],"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.00043993324,0.00008598172,0.014732791,0.00007641533,0.000056702196,0.00022969999,0.00013175937,0.85217893,0.016946372,0.004904736,0.00074242597,0.10947432],"study_design_scores_gemma":[0.0000037852546,0.000013770983,0.0012526312,0.0000016262425,0.0000029779708,0.000015902358,0.000008725232,0.99506134,0.0023935814,0.0011740053,0.00006707131,0.0000046745713],"about_ca_topic_score_codex":0.0034351267,"about_ca_topic_score_gemma":0.0034870065,"teacher_disagreement_score":0.0034351267,"about_ca_system_score_codex":0.00034659015,"about_ca_system_score_gemma":0.0005965809,"threshold_uncertainty_score":0.006830275},"labels":[],"label_agreement":null},{"id":"W1572369853","doi":"10.1609/aaai.v24i1.7724","title":"Activity and Gait Recognition with Time-Delay Embeddings","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Gait Recognition and Analysis","field":"Engineering","cited_by":152,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Wearable computer; Gait; Activity recognition; Set (abstract data type); Embedding; Feature extraction; Mobile phone; Wearable technology; Artificial intelligence; Feature (linguistics); Data set; Stairs; Pattern recognition (psychology); Machine learning; Real-time computing; Embedded system; Engineering","score_opus":0.02953149173377507,"score_gpt":0.24164902886297693,"score_spread":0.21211753712920187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572369853","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.11040185,0.0005148548,0.88576096,0.00016607397,0.00016815585,0.000064444095,0.00072350726,0.0011391625,0.001060959],"genre_scores_gemma":[0.7021886,0.00043780726,0.2918625,0.00008584018,0.0001241403,0.00013420181,0.0020702563,0.00008465584,0.0030119882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965775,0.0000750207,0.000032989108,0.00011002066,0.00009222442,0.000032002386],"domain_scores_gemma":[0.9993967,0.0002165511,0.000109529356,0.00011194353,0.00013646134,0.000028879813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034882914,0.00057263364,0.00048087654,0.00071176904,0.00010327324,0.0005018866,0.00042479998,0.00052127516,0.0012849896],"category_scores_gemma":[0.0022693542,0.00020408908,0.00036611684,0.0010459437,0.00021991521,0.00086988194,0.00044355786,0.0005168885,0.00085445185],"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.00063324533,0.0004288194,0.011302106,0.00020071604,0.00016341971,0.000271156,0.00010586769,0.112557635,0.052963108,0.0039805574,0.004231517,0.8131618],"study_design_scores_gemma":[0.00001735602,0.0001486828,0.0057028327,0.000014220334,0.000021908974,0.00025105462,0.000028033657,0.9757519,0.011937718,0.003920634,0.0021850935,0.000020573078],"about_ca_topic_score_codex":0.0010049035,"about_ca_topic_score_gemma":0.0013991792,"teacher_disagreement_score":0.0012849896,"about_ca_system_score_codex":0.00018408167,"about_ca_system_score_gemma":0.00020287705,"threshold_uncertainty_score":0.004298687},"labels":[],"label_agreement":null},{"id":"W1573412864","doi":"10.1609/aaai.v26i1.8303","title":"Compressed Least-Squares Regression on Sparse Spaces","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","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":"McGill University","funders":"","keywords":"Random projection; Compressed sensing; Estimator; Computer science; Curse of dimensionality; Projection (relational algebra); Range (aeronautics); Regression; Variance (accounting); Dimensionality reduction; Mathematics; Sampling (signal processing); Scale (ratio); Algorithm; Pattern recognition (psychology); Artificial intelligence; Statistics; Computer vision","score_opus":0.08049837298639498,"score_gpt":0.28570507450900046,"score_spread":0.20520670152260548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573412864","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.006614099,0.00033101067,0.99191344,0.00028230017,0.000031031566,0.000022455572,0.00007161373,0.00019424182,0.0005398149],"genre_scores_gemma":[0.35337067,0.001930464,0.6391634,0.00038958548,0.0003193455,0.0002231084,0.0008988748,0.0002664946,0.003438108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753076,0.0011876924,0.00009908556,0.00034752116,0.00072007166,0.00011500092],"domain_scores_gemma":[0.99183476,0.0060488055,0.00053927343,0.00071718363,0.00076885975,0.00009106361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028639855,0.00097244105,0.0012323621,0.00071064493,0.00032943115,0.0010373237,0.0010602302,0.0010945888,0.0014111821],"category_scores_gemma":[0.016323926,0.00047443304,0.0005640255,0.001094546,0.0013491092,0.0019527883,0.0013881074,0.0021707655,0.0005622148],"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.00020076573,0.00007738231,0.0008683215,0.0003268573,0.00010929716,0.00017140254,0.00011826567,0.77080643,0.012190933,0.10572367,0.0033075984,0.106099024],"study_design_scores_gemma":[0.000009025052,0.000023080107,0.00014551952,0.000013842023,0.0000050986246,0.000034710905,0.000010267985,0.97751814,0.0020005805,0.019480636,0.000750611,0.000008447479],"about_ca_topic_score_codex":0.0023249558,"about_ca_topic_score_gemma":0.0016942524,"teacher_disagreement_score":0.0028639855,"about_ca_system_score_codex":0.0006358696,"about_ca_system_score_gemma":0.00090952555,"threshold_uncertainty_score":0.015146375},"labels":[],"label_agreement":null},{"id":"W1579694900","doi":"10.1609/aaai.v26i1.8254","title":"Eliminating the Weakest Link: Making Manipulation Intractable?","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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":"Australian Research Council; Asian Office of Aerospace Research and Development; Australian Government","keywords":"Voting; Veto; Computer science; Computational complexity theory; Class (philosophy); Link (geometry); Anti-plurality voting; Theoretical computer science; Condorcet method; Algorithm; Artificial intelligence; Law; Political science","score_opus":0.14306801433395716,"score_gpt":0.28666344977243496,"score_spread":0.1435954354384778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579694900","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.11424267,0.0007679653,0.8297955,0.014349733,0.0003655315,0.00039277828,0.0005441513,0.0017501944,0.037791565],"genre_scores_gemma":[0.70712465,0.00091933686,0.26828817,0.0020858394,0.00057928794,0.00064221263,0.0008657916,0.0009729739,0.018521748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9883782,0.0046474114,0.00061918487,0.0022919467,0.002473409,0.0015899368],"domain_scores_gemma":[0.9483663,0.031507216,0.0025280467,0.014562973,0.0020156286,0.0010198726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008423131,0.0010043461,0.003245536,0.0011231042,0.0037934282,0.0065740794,0.004125931,0.0038056963,0.018879268],"category_scores_gemma":[0.060435668,0.0012433898,0.0030753755,0.0018412468,0.0057144975,0.016739232,0.0067120763,0.0066090506,0.0038620518],"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.00070930476,0.00030332667,0.0022611017,0.00058923446,0.00020713863,0.0006619125,0.0008322247,0.051398896,0.0063943174,0.7750755,0.02188993,0.13967709],"study_design_scores_gemma":[0.00013109174,0.000084176245,0.00032368625,0.000058206795,0.0000621167,0.00024878737,0.00015290132,0.10075417,0.0027486198,0.88729215,0.0081047835,0.00003936463],"about_ca_topic_score_codex":0.0022391384,"about_ca_topic_score_gemma":0.0025712142,"teacher_disagreement_score":0.018879268,"about_ca_system_score_codex":0.0020547465,"about_ca_system_score_gemma":0.0033059919,"threshold_uncertainty_score":0.06315744},"labels":[],"label_agreement":null},{"id":"W1580924750","doi":"10.1609/aaai.v24i1.7502","title":"News Recommendation in Forum-Based Social Media","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Web Data Mining and Analysis","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":"Memorial University of Newfoundland","funders":"National Natural Science Foundation of China","keywords":"Computer science; World Wide Web; Moderation; Social media; Recommender system; Generalization; Information retrieval; Internet privacy","score_opus":0.07718165713992965,"score_gpt":0.3018259944924312,"score_spread":0.22464433735250156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580924750","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.34525052,0.0026041917,0.6310601,0.0014075147,0.00045514642,0.00081399817,0.0005238589,0.005805697,0.012078909],"genre_scores_gemma":[0.83534336,0.00058954075,0.15595272,0.00013605213,0.00037880449,0.00022395699,0.0005167166,0.00010345139,0.0067554293],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754614,0.0012606435,0.000116223666,0.00030698575,0.000574007,0.00019600002],"domain_scores_gemma":[0.99117345,0.0047947015,0.0006072654,0.0010192215,0.0018174534,0.00058790436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005265141,0.00059784856,0.0009004913,0.002133228,0.0015724861,0.0023603512,0.0014305033,0.0016567522,0.0021168655],"category_scores_gemma":[0.011766215,0.0005464491,0.00092641177,0.0014013649,0.0005599334,0.0033321057,0.0011491467,0.0009860994,0.0012234645],"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.0028391532,0.0033749107,0.042294424,0.0009408934,0.0005571112,0.0018551283,0.0032714435,0.104070686,0.034086607,0.041120343,0.020904478,0.7446848],"study_design_scores_gemma":[0.0002580914,0.0004977138,0.0053974725,0.0000499262,0.0001735373,0.0002875483,0.0005229455,0.95687836,0.008111044,0.016486451,0.011242929,0.00009403574],"about_ca_topic_score_codex":0.008091269,"about_ca_topic_score_gemma":0.008448914,"teacher_disagreement_score":0.008091269,"about_ca_system_score_codex":0.000841511,"about_ca_system_score_gemma":0.0007114063,"threshold_uncertainty_score":0.027845085},"labels":[],"label_agreement":null},{"id":"W158786181","doi":"10.1609/aaai.v24i1.7710","title":"Comparing Position Auctions Computationally","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","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":"Common value auction; Position (finance); Nash equilibrium; Computer science; Point (geometry); Mathematical economics; Preference; Selection (genetic algorithm); Equilibrium selection; Mathematical optimization; Microeconomics; Economics; Econometrics; Game theory; Mathematics; Artificial intelligence; Repeated game","score_opus":0.2159908938356147,"score_gpt":0.39873275492953464,"score_spread":0.18274186109391993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W158786181","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.3492442,0.0016593784,0.52499855,0.0035714793,0.0003025618,0.00029302764,0.0006813967,0.00065843936,0.11859095],"genre_scores_gemma":[0.86190724,0.0007258024,0.12511255,0.00031538136,0.00021935909,0.00032660918,0.0007752305,0.00028760912,0.010330194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942918,0.0030777375,0.00025311502,0.0005144703,0.0014248894,0.00043807598],"domain_scores_gemma":[0.97378707,0.021335527,0.0007820997,0.002711361,0.0011230715,0.00026088735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005817386,0.0007809648,0.0013406058,0.0019272408,0.0010638239,0.005322225,0.00223378,0.0016256177,0.016791016],"category_scores_gemma":[0.042714827,0.00045804278,0.0012361923,0.0030979791,0.0017008812,0.009942983,0.0026503052,0.00215287,0.0012229908],"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.00043256785,0.00026297165,0.0014332476,0.00016053625,0.000065863715,0.000098579585,0.00027805183,0.13530931,0.0006494078,0.77003676,0.0043077753,0.08696488],"study_design_scores_gemma":[0.00011475866,0.00015336575,0.0011711514,0.000033892036,0.00003683759,0.00012876111,0.00029395075,0.35800445,0.0006523737,0.63479507,0.0045924354,0.00002292629],"about_ca_topic_score_codex":0.0015760837,"about_ca_topic_score_gemma":0.0020761893,"teacher_disagreement_score":0.016791016,"about_ca_system_score_codex":0.0024142312,"about_ca_system_score_gemma":0.0021257286,"threshold_uncertainty_score":0.056171536},"labels":[],"label_agreement":null},{"id":"W1592436817","doi":"10.1609/aaai.v24i1.7555","title":"Single-Frontier Bidirectional Search","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","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":"University of Alberta","funders":"Israel Science Foundation","keywords":"Frontier; Node (physics); Computer science; Tree (set theory); Shortest path problem; Path (computing); Task (project management); Current (fluid); Search algorithm; Range (aeronautics); Bidirectional search; Mathematical optimization; Algorithm; Theoretical computer science; Incremental heuristic search; Mathematics; Beam search; Engineering; Graph; Computer network; Geography","score_opus":0.09925960070521146,"score_gpt":0.3189109092959158,"score_spread":0.21965130859070436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592436817","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.023850359,0.0008491463,0.9511526,0.00033482802,0.000089463516,0.00011379235,0.00015419761,0.0011091407,0.022346362],"genre_scores_gemma":[0.38393933,0.00075529004,0.60055596,0.00030442252,0.000043483113,0.0003433906,0.00041696418,0.00036149414,0.013279695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950516,0.00012816432,0.000021457763,0.00009594295,0.00017407455,0.00007525731],"domain_scores_gemma":[0.9993444,0.00028773028,0.000049248985,0.00013628812,0.00013082784,0.000051500636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083953515,0.0007482116,0.00095385837,0.00075615646,0.0007213569,0.0011728191,0.0013885101,0.0010952705,0.008919152],"category_scores_gemma":[0.002531376,0.0003994971,0.0006537931,0.00094873516,0.0008302124,0.0018971052,0.0020024364,0.00091667345,0.0017643706],"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.00042106552,0.00017070783,0.0017019092,0.0004773464,0.00009892719,0.00018869793,0.00031628154,0.27503562,0.0122086955,0.18807827,0.009847488,0.51145494],"study_design_scores_gemma":[0.00009313229,0.00020063041,0.0002824511,0.00007752767,0.00004192296,0.00021261445,0.00013248915,0.85661125,0.0044496823,0.11589178,0.02197375,0.00003277989],"about_ca_topic_score_codex":0.0021876425,"about_ca_topic_score_gemma":0.003057305,"teacher_disagreement_score":0.008919152,"about_ca_system_score_codex":0.0005564611,"about_ca_system_score_gemma":0.0014437952,"threshold_uncertainty_score":0.029837549},"labels":[],"label_agreement":null},{"id":"W1611901023","doi":"10.1609/aaai.v25i1.7823","title":"The Compressed Differential Heuristic","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Uncompressed video; Heuristic; Computer science; Differential (mechanical device); Compression (physics); State (computer science); Algorithm; Computer engineering; Parallel computing; Computer hardware; Artificial intelligence; Materials science; Engineering","score_opus":0.13452609741838098,"score_gpt":0.3040097206926812,"score_spread":0.1694836232743002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1611901023","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.078435004,0.002122658,0.87969077,0.0010128262,0.00044825752,0.00052500353,0.00058134156,0.0017315132,0.035452582],"genre_scores_gemma":[0.62653244,0.00092641445,0.35937834,0.00071081077,0.00015418934,0.0005539991,0.0008507827,0.00022744003,0.0106657315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999313,0.0001825353,0.000036121124,0.000092114395,0.0002785455,0.00009772945],"domain_scores_gemma":[0.9986865,0.00079880434,0.00008876454,0.00020083392,0.00016224245,0.00006273218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007327645,0.00070712896,0.0009476123,0.0011526803,0.00048219453,0.0009183664,0.0019092943,0.0010906787,0.0077261482],"category_scores_gemma":[0.003907805,0.00035461108,0.0005013059,0.0011579385,0.0008936045,0.0017189851,0.0017871718,0.0009913179,0.00060221605],"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.00050751894,0.00025380062,0.0009213051,0.0004525989,0.00008376207,0.0003759541,0.00020894867,0.55153674,0.005272427,0.059622653,0.009315427,0.3714489],"study_design_scores_gemma":[0.00015616069,0.0002180728,0.00027773526,0.00007130941,0.000042796764,0.00020705794,0.000061874205,0.9558531,0.004124237,0.029930808,0.00902728,0.00002952871],"about_ca_topic_score_codex":0.003034002,"about_ca_topic_score_gemma":0.0028320341,"teacher_disagreement_score":0.0077261482,"about_ca_system_score_codex":0.0011018709,"about_ca_system_score_gemma":0.0017119504,"threshold_uncertainty_score":0.0258466},"labels":[],"label_agreement":null},{"id":"W1626677565","doi":"10.1609/aaai.v24i1.7554","title":"Propagating Conjunctions of AllDifferent Constraints","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","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":"Université Laval","funders":"Agence Nationale de la Recherche; Australian Government","keywords":"Bipartite graph; Matching (statistics); Mathematics; Propagator; Combinatorics; 3-dimensional matching; Constraint (computer-aided design); Time complexity; Graph; Discrete mathematics","score_opus":0.04567041664019401,"score_gpt":0.2747648551204846,"score_spread":0.2290944384802906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1626677565","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.026836911,0.00033403104,0.9652075,0.0011129335,0.0001955821,0.00027835654,0.00026857198,0.0007591799,0.0050068973],"genre_scores_gemma":[0.25570124,0.00039949382,0.73635834,0.00069947715,0.00025625995,0.00023837127,0.0007489031,0.00043854272,0.005159358],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9918167,0.0023805844,0.00047724767,0.0017710465,0.0027887113,0.00076585053],"domain_scores_gemma":[0.9602875,0.029291714,0.0028650805,0.003616746,0.0031274771,0.00081147475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006722483,0.0014949178,0.0014739381,0.002528183,0.002368465,0.0024392677,0.0030816833,0.0019111828,0.008887435],"category_scores_gemma":[0.04117874,0.0013451484,0.0021462047,0.0039156512,0.0026244286,0.009113693,0.0052113943,0.0048068436,0.0012474266],"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.00075984997,0.0005532786,0.005891946,0.0016260326,0.00047012934,0.0015174616,0.0010739673,0.14061369,0.018569803,0.3983358,0.017528664,0.4130593],"study_design_scores_gemma":[0.00012974141,0.00015969595,0.0006667113,0.00012306042,0.00016425317,0.0005990544,0.00039546378,0.55195934,0.0183109,0.41288543,0.014508791,0.00009764374],"about_ca_topic_score_codex":0.0035685333,"about_ca_topic_score_gemma":0.0055530784,"teacher_disagreement_score":0.008887435,"about_ca_system_score_codex":0.0015520806,"about_ca_system_score_gemma":0.0029116191,"threshold_uncertainty_score":0.035552323},"labels":[],"label_agreement":null},{"id":"W1646839507","doi":"10.1609/aaai.v24i1.7562","title":"Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monte Carlo tree search; Perfect information; Computer science; Set (abstract data type); A priori and a posteriori; Monte Carlo method; Variety (cybernetics); Search algorithm; Imperfect; Algorithm; Mathematical economics; Artificial intelligence; Mathematics; Statistics","score_opus":0.1901535286000289,"score_gpt":0.33377888505309056,"score_spread":0.14362535645306165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1646839507","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.30355516,0.0012053236,0.67369854,0.0024658248,0.00006520126,0.00017406297,0.00018875355,0.00027581386,0.018371316],"genre_scores_gemma":[0.9624686,0.00034173366,0.036203366,0.00015979401,0.00004089012,0.000102874845,0.000080224825,0.000044853157,0.00055762264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945933,0.0036486054,0.00018894952,0.00052607124,0.00064950687,0.0003935538],"domain_scores_gemma":[0.87158555,0.116776675,0.004496633,0.0033936333,0.0020992933,0.0016482711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013354074,0.0009028104,0.0014530877,0.0018606262,0.0010544836,0.0030803606,0.0021400545,0.002660055,0.0021075788],"category_scores_gemma":[0.1386604,0.0007884886,0.0005330947,0.0011268132,0.0043702032,0.007522608,0.0023238866,0.0024847894,0.0002794389],"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.00019052766,0.00009558174,0.0067423033,0.00016811265,0.00007499042,0.00008690542,0.00047898194,0.6262693,0.00068739033,0.35159495,0.00089383847,0.0127172135],"study_design_scores_gemma":[0.000018651379,0.000049975646,0.0005643851,0.000025378356,0.00000895293,0.000025363866,0.00005182836,0.8919989,0.00024448094,0.10673746,0.00025848747,0.000016070015],"about_ca_topic_score_codex":0.0047032875,"about_ca_topic_score_gemma":0.0035766163,"teacher_disagreement_score":0.013354074,"about_ca_system_score_codex":0.002395117,"about_ca_system_score_gemma":0.0022875562,"threshold_uncertainty_score":0.070623934},"labels":[],"label_agreement":null},{"id":"W171890969","doi":"10.1609/aaai.v27i1.8674","title":"Automating Collusion Detection in Sequential Games","year":2013,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alberta Gambling Research Institute, University of Calgary; Alberta Innovates; University of Alberta","keywords":"Collusion; Computer science; Table (database); Computer security; Object (grammar); Domain (mathematical analysis); Artificial intelligence; Microeconomics; Data mining; Economics; Mathematics","score_opus":0.06158317069983366,"score_gpt":0.2953911625888893,"score_spread":0.23380799188905566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W171890969","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.08119228,0.00012067236,0.9135093,0.00017662218,0.00004378118,0.0002909304,0.000109641376,0.0027690083,0.0017877241],"genre_scores_gemma":[0.61697453,0.000085372325,0.38103047,0.00008934903,0.00002575997,0.00016041328,0.00022424321,0.00018294247,0.0012268967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938269,0.0020189874,0.00048213877,0.0010435493,0.0021750368,0.0004532887],"domain_scores_gemma":[0.9789717,0.013493763,0.0028325415,0.0019877334,0.0020592785,0.00065493723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037195699,0.0012810212,0.0019186849,0.002088334,0.000999246,0.0019582682,0.0021527524,0.0011185239,0.0015146977],"category_scores_gemma":[0.022397215,0.0008191484,0.00089784956,0.00077934196,0.0014238445,0.002669829,0.0036598048,0.0022397053,0.0005556758],"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.0017915927,0.0009310767,0.03807762,0.00081249233,0.00042522355,0.0010144868,0.0023435855,0.22252204,0.08226396,0.06525373,0.0060265204,0.5785377],"study_design_scores_gemma":[0.000043175423,0.000084862935,0.0013395242,0.000019500447,0.000020339772,0.00017252557,0.00008569329,0.9651016,0.012206303,0.01976844,0.0011273407,0.00003082926],"about_ca_topic_score_codex":0.0035935652,"about_ca_topic_score_gemma":0.004400094,"teacher_disagreement_score":0.0037195699,"about_ca_system_score_codex":0.001092854,"about_ca_system_score_gemma":0.0020164223,"threshold_uncertainty_score":0.019671202},"labels":[],"label_agreement":null},{"id":"W1726776292","doi":"10.1609/aaai.v29i1.9445","title":"Solving Games with Functional Regret Estimation","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates - Technology Futures; Office of Naval Research; Multidisciplinary University Research Initiative; Compute Canada","keywords":"Regret; Abstraction; Generalization; Computer science; Function (biology); Nash equilibrium; Corollary; Mathematical optimization; Sequence (biology); Theoretical computer science; Artificial intelligence; Machine learning; Mathematics; Discrete mathematics","score_opus":0.12537478614474104,"score_gpt":0.29959157432591466,"score_spread":0.17421678818117362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1726776292","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.008042659,0.000092173614,0.9899365,0.00023009705,0.00001853388,0.000038864557,0.000015403213,0.00023091768,0.0013947431],"genre_scores_gemma":[0.59849995,0.00026323285,0.39493454,0.0003150357,0.00011927612,0.00037527087,0.00014702376,0.00022770792,0.005117927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978933,0.0011177093,0.00007988201,0.00030569034,0.00041863963,0.00018474637],"domain_scores_gemma":[0.9957397,0.0029670235,0.00033624368,0.00047204414,0.00028008968,0.00020478085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037156013,0.001631034,0.0014669815,0.00066826434,0.00054930116,0.0016426953,0.0021169703,0.0018551704,0.0025687672],"category_scores_gemma":[0.012069319,0.0008449297,0.0012063535,0.00046474877,0.0017133483,0.003301578,0.0029923595,0.0029494897,0.00045733227],"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.000115702904,0.00011179979,0.00062468153,0.00010586222,0.00006081331,0.000055547218,0.00014056776,0.8845324,0.0010667302,0.07548194,0.0011512361,0.036552712],"study_design_scores_gemma":[0.0000125258075,0.000023645793,0.000048483234,0.0000072130656,0.0000044621606,0.000008819783,0.000005417722,0.9746449,0.00026267016,0.024687277,0.00029014854,0.000004419126],"about_ca_topic_score_codex":0.0026064955,"about_ca_topic_score_gemma":0.0025540933,"teacher_disagreement_score":0.0037156013,"about_ca_system_score_codex":0.0016002724,"about_ca_system_score_gemma":0.001851484,"threshold_uncertainty_score":0.01965022},"labels":[],"label_agreement":null},{"id":"W173696064","doi":"10.1609/aaai.v25i1.8061","title":"Learning Compact Representations of Time-Varying Processes","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Time Series Analysis and Forecasting","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":"McGill University","funders":"","keywords":"Dimension (graph theory); Dimensionality reduction; Reduction (mathematics); Point (geometry); Computer science; Series (stratigraphy); Space time; Estimation; Algorithm; Space (punctuation); Time point; Time series; Spacetime; Mathematics; Artificial intelligence; Machine learning","score_opus":0.10790900749159807,"score_gpt":0.29320159408072527,"score_spread":0.1852925865891272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W173696064","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.027120562,0.00032028015,0.9711391,0.00030658467,0.000039327617,0.000018775356,0.00020982682,0.00027666966,0.00056895753],"genre_scores_gemma":[0.7251755,0.0020090532,0.26640564,0.0003208699,0.00032058347,0.00024474904,0.0016837388,0.00014697964,0.0036929173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937916,0.00020414217,0.00004155092,0.00019364138,0.00012318365,0.000058238802],"domain_scores_gemma":[0.99667406,0.0019151337,0.0005404735,0.0005859543,0.00019515713,0.00008915555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013781709,0.00085889566,0.0011053086,0.001029216,0.0002530649,0.0020968874,0.0012320986,0.0015290114,0.0016982824],"category_scores_gemma":[0.009556248,0.0005191784,0.00074159174,0.0014062966,0.0007699347,0.0042063566,0.0017222335,0.0028714724,0.00054463337],"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.00015391083,0.00014089253,0.002151108,0.00024543557,0.00013712527,0.00020210525,0.00039148986,0.65800846,0.007874089,0.15451552,0.0036289496,0.17255092],"study_design_scores_gemma":[0.000007471607,0.000023452982,0.00018188311,0.0000118389435,0.00000785053,0.000019947403,0.000016356651,0.94620246,0.0004928062,0.05253422,0.0004922819,0.000009312036],"about_ca_topic_score_codex":0.0010244888,"about_ca_topic_score_gemma":0.0011846924,"teacher_disagreement_score":0.0020968874,"about_ca_system_score_codex":0.0005533881,"about_ca_system_score_gemma":0.00046361715,"threshold_uncertainty_score":0.0072885156},"labels":[],"label_agreement":null},{"id":"W1762216642","doi":"10.1609/aaai.v30i1.10268","title":"Conservativeness of Untied Auto-Encoders","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","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":"HEC Montréal; Université de Montréal","funders":"","keywords":"Encoder; Component (thermodynamics); Field (mathematics); Computer science; Function (biology); Algorithm; Unit vector; Mathematics; Pattern recognition (psychology); Control theory (sociology); Applied mathematics; Artificial intelligence; Pure mathematics; Mathematical analysis","score_opus":0.06925652489997468,"score_gpt":0.2969894329996154,"score_spread":0.2277329080996407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1762216642","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.075950205,0.00017658681,0.91707593,0.00039643975,0.000044738757,0.000032593613,0.00011087499,0.00028890293,0.005923764],"genre_scores_gemma":[0.92690337,0.00019360427,0.06424758,0.00031038444,0.00005962615,0.000112647846,0.00024179772,0.00017768447,0.0077532604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875474,0.00032093556,0.00008909866,0.00025653085,0.0004363383,0.00014242911],"domain_scores_gemma":[0.994181,0.0032865244,0.00060423044,0.00088941015,0.0007108326,0.00032802258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003266527,0.00086240313,0.0007735106,0.00067963044,0.00056419324,0.001387547,0.0013949889,0.001086748,0.0028807498],"category_scores_gemma":[0.014130922,0.00068690424,0.00047697418,0.0003036825,0.0025135034,0.0032192052,0.0024009414,0.0019764737,0.0005277573],"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.0001905985,0.00008871197,0.00196193,0.00012915445,0.000055611814,0.0005666263,0.0003595872,0.29692027,0.020955473,0.64751357,0.0011419753,0.030116467],"study_design_scores_gemma":[0.000016562753,0.00006181849,0.00045364007,0.000035165587,0.00000945492,0.0001428212,0.000035570305,0.7474727,0.00707402,0.2437791,0.0008964873,0.000022690778],"about_ca_topic_score_codex":0.00086506974,"about_ca_topic_score_gemma":0.0010216954,"teacher_disagreement_score":0.003266527,"about_ca_system_score_codex":0.0007573178,"about_ca_system_score_gemma":0.0008705591,"threshold_uncertainty_score":0.017275274},"labels":[],"label_agreement":null},{"id":"W178133203","doi":"10.1609/aaai.v25i1.7796","title":"Policy Gradient Planning for Environmental Decision Making with Existing Simulators","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Forest Management and Policy","field":"Environmental 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 British Columbia","funders":"","keywords":"Parameterized complexity; Computer science; Markov chain; Markov decision process; Domain (mathematical analysis); Operations research; Mathematical optimization; Markov process; Machine learning; Algorithm; Mathematics","score_opus":0.10545005354851585,"score_gpt":0.315841546250156,"score_spread":0.21039149270164015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W178133203","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.0182205,0.00014983356,0.9763815,0.00022392195,0.000028250792,0.00009403908,0.00005335474,0.0007658539,0.0040827547],"genre_scores_gemma":[0.67024523,0.0002858413,0.32588395,0.0001644405,0.000030812505,0.00046627637,0.00018511637,0.00018161452,0.0025567047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992606,0.00032843323,0.000036034973,0.000109006054,0.00019477797,0.000071146096],"domain_scores_gemma":[0.99757224,0.0018370386,0.00012267163,0.00019391756,0.00019339343,0.000080747945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019040048,0.0008754935,0.0009868024,0.000573274,0.0005254887,0.0010152177,0.0013783048,0.0010403557,0.002913807],"category_scores_gemma":[0.008112629,0.00064453983,0.00062633207,0.0004721178,0.0013957003,0.0016083722,0.0012372584,0.0016729732,0.000424851],"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.00002556456,0.000022921125,0.00017858288,0.000016569596,0.000009028085,0.000015195216,0.000026117177,0.979648,0.00012807967,0.012606116,0.00015828402,0.0071655656],"study_design_scores_gemma":[0.0000050627286,0.0000045605098,0.000008856322,0.0000021734877,0.0000014359179,0.0000013027569,0.0000016143074,0.9955843,0.00007635024,0.0041371356,0.00017614337,0.0000011805761],"about_ca_topic_score_codex":0.009369384,"about_ca_topic_score_gemma":0.008571077,"teacher_disagreement_score":0.009369384,"about_ca_system_score_codex":0.0018960536,"about_ca_system_score_gemma":0.002239037,"threshold_uncertainty_score":0.01862967},"labels":[],"label_agreement":null},{"id":"W1815770371","doi":"10.1609/aaai.v26i1.8262","title":"Optimizing Payments in Dominant-Strategy Mechanisms for Multi-Parameter Domains","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision 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 Waterloo","funders":"","keywords":"Mechanism design; Payment; Computer science; Context (archaeology); Mathematical optimization; Mechanism (biology); Function (biology); Class (philosophy); Private information retrieval; Work (physics); Mathematical economics; Mathematics; Artificial intelligence; Computer security","score_opus":0.29463985427901274,"score_gpt":0.42196809358395715,"score_spread":0.1273282393049444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1815770371","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.027811844,0.000713361,0.96770537,0.00038728752,0.000030056144,0.00014442987,0.00006109669,0.00011074751,0.0030357528],"genre_scores_gemma":[0.5908321,0.0014209966,0.40015814,0.00025573658,0.00009163037,0.0008487902,0.00015292705,0.00016268868,0.006076983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.991956,0.0054743197,0.00034603412,0.00091204466,0.00076234597,0.0005492439],"domain_scores_gemma":[0.9896304,0.0075748744,0.0010021492,0.00086768164,0.00044234717,0.00048248668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014399162,0.0022449275,0.0040150997,0.0021185232,0.001227488,0.005324644,0.0030966233,0.0032251717,0.002783359],"category_scores_gemma":[0.020682074,0.0016525728,0.0021911834,0.0029119346,0.0042993613,0.008550254,0.0039436608,0.003784512,0.0005008715],"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.00017961065,0.00012044536,0.00037514808,0.0002413215,0.00010781332,0.0001227906,0.00023885022,0.5913157,0.0013302844,0.3814089,0.0006468047,0.023912292],"study_design_scores_gemma":[0.00011360392,0.00016330674,0.00015259621,0.00006918154,0.00003657423,0.00008808771,0.000109603614,0.5478152,0.0008201115,0.44865587,0.0019352777,0.000040473944],"about_ca_topic_score_codex":0.0009785878,"about_ca_topic_score_gemma":0.0008030488,"teacher_disagreement_score":0.014399162,"about_ca_system_score_codex":0.0035957065,"about_ca_system_score_gemma":0.0021582032,"threshold_uncertainty_score":0.076150954},"labels":[],"label_agreement":null},{"id":"W1822698205","doi":"10.1609/aaai.v24i3.18828","title":"Leveraging Mixed Reality Infrastructure for Robotics and Applied AI Instruction","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Teaching and Learning Programming","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 Manitoba","funders":"","keywords":"Robotics; Artificial intelligence; Computer science; Mixed reality; Set (abstract data type); Educational robotics; Perception; Human–computer interaction; Robot; Augmented reality; Psychology","score_opus":0.05016068691775693,"score_gpt":0.29225636166319857,"score_spread":0.24209567474544164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1822698205","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.058793753,0.00036771293,0.90607613,0.0010216319,0.00012615924,0.00038856542,0.000059447644,0.0026538905,0.030512786],"genre_scores_gemma":[0.24895708,0.00048373087,0.738548,0.00023580353,0.00007105079,0.00058382197,0.00015770839,0.00027890533,0.010683997],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99801195,0.0007502919,0.0000859133,0.0002683804,0.0006456335,0.00023774509],"domain_scores_gemma":[0.99722725,0.000979478,0.000208882,0.0006275146,0.00043634398,0.00052057626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002228465,0.0010619117,0.00052762195,0.0010696505,0.00081287423,0.0033680208,0.0022758197,0.0012531381,0.012037714],"category_scores_gemma":[0.005113734,0.00059116294,0.0008605657,0.00065174856,0.00097248686,0.0038109983,0.0068666614,0.0018015502,0.0032551603],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044587272,0.0016462081,0.0028499889,0.000791225,0.00009725552,0.00053143926,0.0046016076,0.017764108,0.11525263,0.08438848,0.007641614,0.76398957],"study_design_scores_gemma":[0.00031963026,0.0054224217,0.014545618,0.00096960244,0.00027269498,0.0036779908,0.004131301,0.17614704,0.15745689,0.13018855,0.50637823,0.00049001095],"about_ca_topic_score_codex":0.000496982,"about_ca_topic_score_gemma":0.0011470431,"teacher_disagreement_score":0.012037714,"about_ca_system_score_codex":0.00068580406,"about_ca_system_score_gemma":0.0013397972,"threshold_uncertainty_score":0.04027021},"labels":[],"label_agreement":null},{"id":"W182887017","doi":"10.1609/aaai.v25i1.7811","title":"Modeling and Monitoring Crop Disease in Developing Countries","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Smart Agriculture and AI","field":"Agricultural and Biological Sciences","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Mobile phone; Data collection; Data science; Survey data collection; Process (computing); Phone; Developing country; Work (physics); Representation (politics); Plant disease; Statistics; Telecommunications; Engineering","score_opus":0.12349737545679279,"score_gpt":0.26646922168761616,"score_spread":0.14297184623082337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W182887017","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.75004435,0.0013278404,0.23885345,0.0014299473,0.000042354994,0.0001468154,0.0014312749,0.00028513707,0.006438689],"genre_scores_gemma":[0.96144074,0.000979373,0.035394557,0.000067307046,0.000018478328,0.00010774506,0.0004400119,0.0000236215,0.0015281631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939835,0.00032653144,0.000035731897,0.000120338154,0.000040626855,0.000078392506],"domain_scores_gemma":[0.99874854,0.0008389953,0.00020442119,0.000066890054,0.000098592995,0.000042544998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017328275,0.000578809,0.00064843654,0.0009529115,0.00032436193,0.0012776618,0.000724154,0.0011163912,0.00095044327],"category_scores_gemma":[0.003950428,0.00057921134,0.0006095509,0.0012632133,0.0006442978,0.0011211743,0.00087886106,0.00062047795,0.00017110935],"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.000023802153,0.000023312992,0.013902947,0.0000254683,0.00002888431,0.00006234628,0.00006721082,0.97836256,0.00019443275,0.0022694897,0.00022165588,0.0048179235],"study_design_scores_gemma":[0.000009025411,0.000020323896,0.002800261,0.000008194877,0.0000099034505,0.00001758764,0.00008420832,0.9939896,0.00012785492,0.002431995,0.0004939573,0.000007244621],"about_ca_topic_score_codex":0.03821863,"about_ca_topic_score_gemma":0.01937386,"teacher_disagreement_score":0.03821863,"about_ca_system_score_codex":0.00097133784,"about_ca_system_score_gemma":0.00090789306,"threshold_uncertainty_score":0.075992346},"labels":[],"label_agreement":null},{"id":"W1852280707","doi":"10.1609/aaai.v29i1.9404","title":"Existential Rule Languages with Finite Chase: Complexity and Expressiveness","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Data Quality and Management","field":"Decision Sciences","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 Alberta","funders":"","keywords":"Decidability; Computer science; Chase; Ontology language; Existentialism; Regular language; Property (philosophy); Mathematics; Discrete mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.45711114531969094,"score_gpt":0.42983730638237017,"score_spread":0.02727383893732077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1852280707","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.20280996,0.0006025751,0.78879523,0.0011889042,0.0000352739,0.00022822975,0.0004329371,0.00058764615,0.005319256],"genre_scores_gemma":[0.79016185,0.00042408347,0.20585135,0.00034037867,0.00012105839,0.0004094864,0.00065525045,0.00016557738,0.0018709477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9926288,0.001362302,0.001191477,0.0014935799,0.0025210343,0.0008028182],"domain_scores_gemma":[0.9490072,0.038493387,0.0037186022,0.005476259,0.002337288,0.0009673006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050313156,0.00063421734,0.0010424983,0.0016221583,0.0011925919,0.0051479638,0.0022912463,0.0013966186,0.0019903698],"category_scores_gemma":[0.024687009,0.00082180585,0.0035571759,0.0013516376,0.0058945604,0.0102466,0.0040131207,0.0046163024,0.00023078514],"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.00022627028,0.00021336615,0.0076476675,0.00045729437,0.00018640197,0.00093698996,0.0026778972,0.04790823,0.01563263,0.873542,0.0009473629,0.04962388],"study_design_scores_gemma":[0.000059211183,0.000090184294,0.0012380312,0.000086479624,0.0001149733,0.00085065595,0.00036765938,0.18526885,0.0133471815,0.79462165,0.0038615693,0.000093550305],"about_ca_topic_score_codex":0.001607733,"about_ca_topic_score_gemma":0.001241811,"teacher_disagreement_score":0.0051479638,"about_ca_system_score_codex":0.0015322443,"about_ca_system_score_gemma":0.001986094,"threshold_uncertainty_score":0.026608467},"labels":[],"label_agreement":null},{"id":"W1859306681","doi":"10.1609/aaai.v25i1.8078","title":"CCRank: Parallel Learning to Rank with Cooperative Coevolution","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Data Stream Mining Techniques","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":"Simon Fraser University","funders":"Texas State University","keywords":"Computer science; Rank (graph theory); Coevolution; Context (archaeology); Divide and conquer algorithms; Learning to rank; Function (biology); Space (punctuation); Artificial intelligence; Function optimization; Machine learning; Theoretical computer science; Algorithm; Ranking (information retrieval); Mathematics; Genetic algorithm; Combinatorics","score_opus":0.09218986205550374,"score_gpt":0.2857508085373353,"score_spread":0.1935609464818316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1859306681","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.0144538805,0.0003900784,0.97907466,0.00035108664,0.00014249391,0.00015406014,0.00006922552,0.0019308587,0.0034335544],"genre_scores_gemma":[0.28047347,0.0003280807,0.7097917,0.00058301655,0.00020458466,0.0005418207,0.000449829,0.0004784922,0.007149064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980262,0.00055417843,0.000116796175,0.00033554732,0.00071611727,0.00025109257],"domain_scores_gemma":[0.99610484,0.0014594343,0.0002808617,0.00087198964,0.0010413617,0.00024154807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035337228,0.0014334489,0.0022927718,0.0013726406,0.00093120546,0.0021110303,0.0029113519,0.0020569095,0.0046518543],"category_scores_gemma":[0.011441135,0.0006318956,0.0009911252,0.0016881219,0.0017112201,0.002514112,0.0026741591,0.0022144502,0.0019076947],"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.00031290896,0.00029198636,0.0016378467,0.00020369473,0.00015634626,0.00014806294,0.00014077897,0.59143716,0.0045428383,0.030774549,0.010781044,0.3595728],"study_design_scores_gemma":[0.00004874637,0.00006874091,0.00006407412,0.00000711197,0.000012718373,0.000040884588,0.000011320675,0.98785585,0.0010602952,0.009204544,0.0016148523,0.000010902468],"about_ca_topic_score_codex":0.0043424563,"about_ca_topic_score_gemma":0.0060990388,"teacher_disagreement_score":0.0046518543,"about_ca_system_score_codex":0.000863097,"about_ca_system_score_gemma":0.0030182938,"threshold_uncertainty_score":0.018688321},"labels":[],"label_agreement":null},{"id":"W190498140","doi":"10.1609/aaai.v26i1.8269","title":"Finding Optimal Abstract Strategies in Extensive-Form Games","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta; Alberta Innovates; Western Canada Research Grid; Compute Canada","keywords":"Nash equilibrium; Extensive-form game; Computer science; Sequential game; Mathematical economics; Limit (mathematics); Normal-form game; Solution concept; Repeated game; Best response; State space; Epsilon-equilibrium; Symmetric game; Computation; Mathematical optimization; Combinatorial game theory; Strategy; Equilibrium selection; Game theory; Mathematics; Algorithm","score_opus":0.09497848147463588,"score_gpt":0.32779302477373623,"score_spread":0.23281454329910034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W190498140","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.068055406,0.00012093993,0.9260751,0.00019156426,0.00000869225,0.00011603469,0.00007968432,0.00031362698,0.005038849],"genre_scores_gemma":[0.5787667,0.0002597227,0.4175436,0.000101728605,0.000011284135,0.00028435275,0.0002418573,0.0000928472,0.0026978906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931526,0.00026013324,0.000051679497,0.00012764963,0.00014742702,0.00009773499],"domain_scores_gemma":[0.99836916,0.0012691179,0.00011838593,0.000103625316,0.000074776304,0.00006500111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011252831,0.0009665176,0.0010847838,0.0008258644,0.0005352553,0.0017042536,0.0008500852,0.0009705783,0.0025482834],"category_scores_gemma":[0.0048795254,0.00062226696,0.0007350329,0.0006530141,0.0013550894,0.0026374727,0.0013648239,0.0010906865,0.00038861678],"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.00012943067,0.000111589514,0.0013078892,0.0001756174,0.000066080116,0.00012724356,0.0003663556,0.74113166,0.0029702613,0.1736315,0.0011772804,0.07880505],"study_design_scores_gemma":[0.00003320107,0.000052560612,0.0001331966,0.000021849886,0.000014548348,0.000029338233,0.00008350642,0.8310333,0.0015860515,0.16608083,0.0009194019,0.000012254746],"about_ca_topic_score_codex":0.0019460253,"about_ca_topic_score_gemma":0.0025181067,"teacher_disagreement_score":0.0025482834,"about_ca_system_score_codex":0.00121614,"about_ca_system_score_gemma":0.0015202805,"threshold_uncertainty_score":0.008823752},"labels":[],"label_agreement":null},{"id":"W1943755952","doi":"10.1609/aaai.v26i1.8148","title":"Alpha-Beta Pruning for Games with Simultaneous Moves","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pruning; Minimax; BETA (programming language); Computer science; Alpha (finance); Computation; Class (philosophy); Monte Carlo tree search; Action (physics); Mathematical optimization; Mathematics; Algorithm; Artificial intelligence; Statistics","score_opus":0.06542046453595184,"score_gpt":0.3008025722434135,"score_spread":0.23538210770746165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1943755952","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.029908087,0.00033278254,0.96072084,0.00024235254,0.00004915827,0.00008717513,0.000080742626,0.0003744341,0.008204469],"genre_scores_gemma":[0.4356161,0.00044419043,0.55536765,0.00037922163,0.00008745944,0.00038209202,0.00035674212,0.00027148658,0.007095108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985519,0.0005075399,0.00006097682,0.00019839793,0.00046588475,0.0002153006],"domain_scores_gemma":[0.9974859,0.0016572777,0.00016177548,0.00032678762,0.00025425624,0.00011405493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020126894,0.0011542784,0.0011027902,0.0009825274,0.0008755648,0.0011131555,0.0015970287,0.00088785443,0.00323716],"category_scores_gemma":[0.007427905,0.00065392494,0.0010780914,0.0006769648,0.0010198748,0.0023153652,0.0019534652,0.002838864,0.00070983986],"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.0004730419,0.00027675106,0.001762659,0.00032761233,0.00014867367,0.00035906074,0.00034627848,0.35982615,0.0145989,0.35992765,0.008742092,0.2532112],"study_design_scores_gemma":[0.00004735808,0.00009625402,0.00028359945,0.000044002074,0.000026558886,0.0001005233,0.000029277366,0.8223032,0.0034285786,0.17004411,0.0035839921,0.000012521052],"about_ca_topic_score_codex":0.0019398902,"about_ca_topic_score_gemma":0.002945639,"teacher_disagreement_score":0.00323716,"about_ca_system_score_codex":0.00094366376,"about_ca_system_score_gemma":0.001393955,"threshold_uncertainty_score":0.010829389},"labels":[],"label_agreement":null},{"id":"W1950803081","doi":"10.1609/aaai.v28i1.8904","title":"Automatic Construction and Natural-Language Description of Nonparametric Regression Models","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Gaussian Processes and Bayesian Inference","field":"Computer Science","cited_by":127,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Smoothness; Extrapolation; Nonparametric regression; Computer science; Nonparametric statistics; Regression; Natural language; Statistician; Regression analysis; Set (abstract data type); Artificial intelligence; Machine learning; Econometrics; Mathematics; Statistics; Programming language","score_opus":0.035485039362256734,"score_gpt":0.2663903902323852,"score_spread":0.23090535087012848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1950803081","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.0012190302,0.000054485005,0.99308515,0.0002082192,0.000026426722,0.00004811565,0.0007618089,0.003927695,0.0006690394],"genre_scores_gemma":[0.048184507,0.0001684605,0.9438801,0.00024397447,0.00008023495,0.000443075,0.0038867586,0.0018875411,0.0012252579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9923205,0.0030988073,0.00095656345,0.0011356942,0.002266628,0.00022182586],"domain_scores_gemma":[0.9865959,0.0077264775,0.00082464254,0.002518353,0.002155919,0.00017859916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007156399,0.0016396333,0.0011332683,0.0029900598,0.0011018257,0.004577311,0.0035007459,0.0016652048,0.0061996058],"category_scores_gemma":[0.027846877,0.0013874328,0.003637794,0.0017396808,0.0018320446,0.006780992,0.0037204553,0.0040334966,0.0038502153],"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.00021072941,0.00025338805,0.002351905,0.0011576973,0.00017551343,0.001157317,0.0027552648,0.054648187,0.013829704,0.6835332,0.028735042,0.21119201],"study_design_scores_gemma":[0.000040596267,0.00004745854,0.00031286755,0.0001972529,0.000054999033,0.0004573889,0.00027781105,0.5785019,0.009356815,0.3462697,0.06438849,0.00009474132],"about_ca_topic_score_codex":0.0019315436,"about_ca_topic_score_gemma":0.0025183978,"teacher_disagreement_score":0.007156399,"about_ca_system_score_codex":0.0013020377,"about_ca_system_score_gemma":0.0027587845,"threshold_uncertainty_score":0.0378471},"labels":[],"label_agreement":null},{"id":"W1953722872","doi":"10.1609/aaai.v26i1.8240","title":"A Dynamic Rationalization of Distance Rationalizability","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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":"University of Toronto","funders":"","keywords":"Rationalizability; Voting; Social choice theory; Mathematical economics; Condorcet method; Majority rule; Mathematics; Mathematical optimization; Preference; Computer science; Economics; Microeconomics; Artificial intelligence; Nash equilibrium","score_opus":0.07806209102858844,"score_gpt":0.27495162629295317,"score_spread":0.19688953526436473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1953722872","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.052916337,0.00026726752,0.8888759,0.003907044,0.000105468855,0.00017486459,0.00018471443,0.00019824828,0.053370174],"genre_scores_gemma":[0.8912944,0.00023723504,0.09889712,0.0005266388,0.00012127302,0.00034962167,0.00015131496,0.00010414036,0.0083182175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99234855,0.002700861,0.000514337,0.0020445841,0.0017669118,0.0006247419],"domain_scores_gemma":[0.9897932,0.0046379627,0.001371779,0.0021649364,0.0015455114,0.00048667815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006055312,0.0007480301,0.0008770353,0.0013166374,0.0012739088,0.0034287646,0.0017301678,0.0020971578,0.0064617293],"category_scores_gemma":[0.02109764,0.00038381666,0.0014083345,0.0009482467,0.007996573,0.0066826036,0.003502077,0.0032860474,0.0005892495],"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.000011326208,0.000015855952,0.00019876588,0.000020682704,0.00001480262,0.00003164057,0.0001459614,0.010208302,0.00038052857,0.98543984,0.00025169723,0.0032805693],"study_design_scores_gemma":[0.000021111558,0.000027349428,0.00011737232,0.000014261955,0.000008637181,0.000022321656,0.0000624164,0.033112627,0.00038273496,0.964172,0.0020476666,0.000011519585],"about_ca_topic_score_codex":0.002295744,"about_ca_topic_score_gemma":0.0013426373,"teacher_disagreement_score":0.0064617293,"about_ca_system_score_codex":0.0028535258,"about_ca_system_score_gemma":0.0021064568,"threshold_uncertainty_score":0.032023907},"labels":[],"label_agreement":null},{"id":"W2107131020","doi":"10.1609/aaai.v24i1.7641","title":"Automated Channel Abstraction for Advertising Auctions","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","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":"Computer science; Common value auction; Budget constraint; Mathematical optimization; Revenue; Abstraction; Simple (philosophy); Rendering (computer graphics); Column generation; Channel (broadcasting); Quality (philosophy); Online advertising; Artificial intelligence; The Internet; Microeconomics; Mathematics; Economics","score_opus":0.17811614827193736,"score_gpt":0.41460882392883824,"score_spread":0.23649267565690088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107131020","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.013265448,0.0001320228,0.979182,0.00023785871,0.000036088793,0.00010124007,0.0002205442,0.0016758273,0.005149006],"genre_scores_gemma":[0.36654663,0.00033586434,0.62694883,0.00013665795,0.000056924066,0.00032465754,0.00068556063,0.0005025194,0.0044622943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852437,0.0006061333,0.00008117464,0.00017517425,0.00039625284,0.00021688145],"domain_scores_gemma":[0.99795306,0.0010869532,0.00013728149,0.00057605776,0.00014739,0.0000992115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015091434,0.000811124,0.0009148895,0.00093829574,0.0009790373,0.002829042,0.0015072749,0.0010590254,0.0077547487],"category_scores_gemma":[0.005327127,0.0006655884,0.0018099947,0.0012614381,0.0013358607,0.0034514167,0.0030894289,0.002918725,0.001155417],"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.00021002085,0.00014632777,0.0008032481,0.0002503436,0.00004771762,0.00023872343,0.00031316179,0.56344116,0.005594075,0.31130847,0.0070553767,0.11059126],"study_design_scores_gemma":[0.000031521973,0.00001659253,0.00006884526,0.000017926779,0.000013759784,0.00005221696,0.00004201817,0.8423684,0.0017063955,0.15007584,0.005593345,0.00001311396],"about_ca_topic_score_codex":0.002483467,"about_ca_topic_score_gemma":0.003527836,"teacher_disagreement_score":0.0077547487,"about_ca_system_score_codex":0.0013713196,"about_ca_system_score_gemma":0.00212274,"threshold_uncertainty_score":0.025942206},"labels":[],"label_agreement":null},{"id":"W2108005621","doi":"10.1609/aaai.v26i1.8260","title":"Sample Bounded Distributed Reinforcement Learning for Decentralized POMDPs","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","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":"Toronto Metropolitan University","funders":"","keywords":"Reinforcement learning; Computer science; Partially observable Markov decision process; Benchmark (surveying); Markov decision process; Bounded function; Mathematical optimization; Sample (material); Sample complexity; Computation; Set (abstract data type); Artificial intelligence; Markov process; Markov chain; Machine learning; Mathematics; Markov model; Algorithm","score_opus":0.07689906790923026,"score_gpt":0.3054622507888089,"score_spread":0.22856318287957864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108005621","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.027717398,0.00013945588,0.9699755,0.00030681392,0.000022654465,0.000057307407,0.000052185358,0.00026043208,0.001468381],"genre_scores_gemma":[0.9143212,0.00013240436,0.08374402,0.000090809204,0.000029030401,0.00026164416,0.00013110814,0.00007368232,0.0012162118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826366,0.0007433659,0.000084672334,0.00030403316,0.0004199192,0.00018421878],"domain_scores_gemma":[0.9868623,0.0105813835,0.0009039173,0.0006321298,0.0006269439,0.00039329214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035040278,0.0010418231,0.0016011518,0.0004400761,0.00063109305,0.0011970932,0.0014219878,0.0010901889,0.0020136484],"category_scores_gemma":[0.016829347,0.00067604997,0.0006549965,0.00044599661,0.0019251857,0.0017343583,0.0019222092,0.002674219,0.00017909643],"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.000053516746,0.000027689317,0.00025467091,0.000034086162,0.000013161653,0.000024539355,0.000024812853,0.9836088,0.00024698835,0.011465318,0.00016242068,0.004084087],"study_design_scores_gemma":[0.0000093102735,0.000010318181,0.000024255392,0.00000195611,0.0000013343024,0.0000022326212,0.0000026901314,0.99159044,0.00008960245,0.008208821,0.000057622736,0.000001462334],"about_ca_topic_score_codex":0.0042704563,"about_ca_topic_score_gemma":0.004178923,"teacher_disagreement_score":0.0042704563,"about_ca_system_score_codex":0.002421401,"about_ca_system_score_gemma":0.0020887027,"threshold_uncertainty_score":0.018531263},"labels":[],"label_agreement":null},{"id":"W2114793692","doi":"10.1609/aaai.v28i1.8810","title":"Solving Imperfect Information Games Using Decomposition","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates; Alberta Innovates - Technology Futures; Compute Canada","keywords":"Perfect information; Computer science; Decomposition; Extensive-form game; Imperfect; Sequential game; Subgame perfect equilibrium; Mathematical optimization; Nash equilibrium; Normal-form game; Construct (python library); Combinatorial game theory; Subgame; Game theory; Best response; Mathematical economics; Mathematics; Epsilon-equilibrium","score_opus":0.05366474124327942,"score_gpt":0.30969076569125964,"score_spread":0.2560260244479802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114793692","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.016299892,0.0001068629,0.9752703,0.00028426034,0.000034462733,0.00020904568,0.00010255189,0.00029261826,0.00740002],"genre_scores_gemma":[0.32263324,0.0003963872,0.66913575,0.0002731482,0.00007004761,0.0007396023,0.00041196405,0.00019972927,0.0061401785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99691594,0.0013456322,0.00018333954,0.00053535914,0.0005526241,0.00046707503],"domain_scores_gemma":[0.9945446,0.004069821,0.00031101174,0.00051330694,0.00027863472,0.000282701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028083913,0.0017745881,0.0018741454,0.0011316258,0.0009243403,0.0024564187,0.0014681072,0.0012058021,0.0046789926],"category_scores_gemma":[0.009018881,0.00089580123,0.0023279341,0.0009798416,0.0023919279,0.0032874956,0.0031266536,0.0031631945,0.0006968786],"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.00020640025,0.00018202151,0.0006845596,0.00031100368,0.00012699154,0.00015250295,0.00039804768,0.66410226,0.0032350123,0.2713245,0.003296891,0.055979863],"study_design_scores_gemma":[0.000048626087,0.000051675295,0.00009544243,0.000033962508,0.000025101035,0.000040762203,0.00006563793,0.7832403,0.0012352589,0.21328253,0.0018616861,0.000019019546],"about_ca_topic_score_codex":0.004505374,"about_ca_topic_score_gemma":0.0040048575,"teacher_disagreement_score":0.0046789926,"about_ca_system_score_codex":0.00242999,"about_ca_system_score_gemma":0.003684436,"threshold_uncertainty_score":0.017630935},"labels":[],"label_agreement":null},{"id":"W2128739123","doi":"10.1609/aaai.v28i1.8933","title":"Learning Concept Embeddings for Query Expansion by Quantum Entropy Minimization","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Query expansion; Computer science; Information retrieval; Embedding; Web search query; Representation (politics); Sargable; Web query classification; Theoretical computer science; Search engine; Artificial intelligence","score_opus":0.04401282363568374,"score_gpt":0.2829489593546883,"score_spread":0.23893613571900454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128739123","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.023220662,0.00037335142,0.97490644,0.00027418692,0.000023098464,0.000050234146,0.00005968196,0.000253698,0.0008386119],"genre_scores_gemma":[0.71061355,0.0007568438,0.28310037,0.00045402942,0.00019313768,0.000372152,0.0005974804,0.00024318915,0.0036693113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998965,0.00049417483,0.00005531559,0.00018030668,0.00022900991,0.00007610319],"domain_scores_gemma":[0.99731076,0.0020710311,0.00015112718,0.00019678545,0.00020173604,0.0000686176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019366579,0.00070725934,0.001032321,0.00080944767,0.00033527726,0.00077515235,0.0011680952,0.0010255787,0.0017227664],"category_scores_gemma":[0.007358598,0.0004547035,0.0007963725,0.0009748088,0.0012497754,0.0032741854,0.0017527062,0.001738798,0.00042402645],"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.00037335977,0.00036253713,0.0014902578,0.0003451298,0.00012274383,0.00015016017,0.00039920083,0.5692148,0.012656911,0.15419716,0.0067432574,0.25394434],"study_design_scores_gemma":[0.00001045364,0.0000353775,0.000086108,0.00000426065,0.0000055008063,0.000016933775,0.000011125804,0.9693839,0.000535237,0.029616281,0.00028780734,0.000006990567],"about_ca_topic_score_codex":0.0013768977,"about_ca_topic_score_gemma":0.0014100006,"teacher_disagreement_score":0.0019366579,"about_ca_system_score_codex":0.0008768055,"about_ca_system_score_gemma":0.00070156774,"threshold_uncertainty_score":0.010242164},"labels":[],"label_agreement":null},{"id":"W2153346333","doi":"10.1609/aaai.v28i1.8924","title":"On the Challenges of Physical Implementations of RBMs","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Generative Adversarial Networks and Image Synthesis","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":"Université de Montréal","funders":"","keywords":"Computer science; Implementation; Markov chain Monte Carlo; Physical system; Boltzmann machine; Computation; Software; Sampling (signal processing); Inference; Computer engineering; Focus (optics); Variety (cybernetics); Stochastic computing; Range (aeronautics); Theoretical computer science; Distributed computing; Machine learning; Computational science; Artificial intelligence; Deep learning; Algorithm; Software engineering; Bayesian probability","score_opus":0.08616196602842285,"score_gpt":0.30097166722354385,"score_spread":0.214809701195121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153346333","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.052719813,0.0035967976,0.8843993,0.013744262,0.00063257525,0.00009005239,0.000108238004,0.0015244666,0.04318447],"genre_scores_gemma":[0.8291739,0.0021601545,0.16061045,0.0012896565,0.000247508,0.0002239478,0.00009821716,0.00044152202,0.0057546655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966828,0.0016073681,0.00013802615,0.00029563135,0.0010700744,0.00020606101],"domain_scores_gemma":[0.983022,0.011607442,0.00055017736,0.0033041546,0.0012258902,0.00029040297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054143495,0.0005166075,0.0009670938,0.00057492696,0.0013532664,0.0032897664,0.0027012907,0.0022712823,0.0064548086],"category_scores_gemma":[0.030579852,0.00086662034,0.00059384934,0.00054580416,0.0047789016,0.007668357,0.0029941038,0.0042473488,0.0012280372],"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.00010820087,0.000057797948,0.0007317377,0.00016732703,0.000033180917,0.00013192461,0.00028263367,0.32058188,0.0019093554,0.6413326,0.0033431721,0.03132005],"study_design_scores_gemma":[0.00004731014,0.000047459176,0.000180103,0.000055930865,0.000012867497,0.000096744996,0.00011292055,0.6207431,0.0018827603,0.3684964,0.0082961,0.000028359173],"about_ca_topic_score_codex":0.0022454753,"about_ca_topic_score_gemma":0.0018804979,"teacher_disagreement_score":0.0064548086,"about_ca_system_score_codex":0.0016213746,"about_ca_system_score_gemma":0.0013524952,"threshold_uncertainty_score":0.02863419},"labels":[],"label_agreement":null},{"id":"W2153904215","doi":"10.1609/aaai.v26i1.8142","title":"Predicting Satisfiability at the Phase Transition","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Western Canada Research Grid; Compute Canada","keywords":"Satisfiability; Conjecture; Computer science; Range (aeronautics); Decision tree; Classifier (UML); Simple (philosophy); Binary number; Binary classification; Algorithm; Mathematics; Artificial intelligence; Machine learning; Discrete mathematics","score_opus":0.0556724554641079,"score_gpt":0.29746112244139145,"score_spread":0.24178866697728355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153904215","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.8440543,0.000385853,0.14729658,0.0014613114,0.000050031445,0.000058137655,0.0012308762,0.001410661,0.0040522655],"genre_scores_gemma":[0.97994107,0.000084127416,0.017992124,0.00011328207,0.000027454656,0.00003068706,0.0012763184,0.000047703244,0.00048724917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993729,0.00018915557,0.000029218347,0.00016681192,0.00015336821,0.000088616885],"domain_scores_gemma":[0.9919595,0.0058428813,0.0006246896,0.0007790341,0.0005468025,0.00024699533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015108127,0.00043957992,0.0006675279,0.0009877002,0.00037398507,0.0012308311,0.00084045203,0.0009926514,0.0013557625],"category_scores_gemma":[0.015015996,0.00027781102,0.0007071603,0.00083638314,0.00072800845,0.0026467962,0.00079772057,0.0016842097,0.0005091092],"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.000705726,0.00038773622,0.09295244,0.00020178358,0.00012239761,0.00026686868,0.0002170008,0.73864055,0.0072260336,0.037193224,0.010492948,0.11159322],"study_design_scores_gemma":[0.000009918419,0.00001944421,0.0023337589,0.0000059862823,0.000004979324,0.000022603093,0.000018904422,0.9760074,0.0017394507,0.019572021,0.00026080653,0.0000047649582],"about_ca_topic_score_codex":0.0028553812,"about_ca_topic_score_gemma":0.00434769,"teacher_disagreement_score":0.0028553812,"about_ca_system_score_codex":0.00087936735,"about_ca_system_score_gemma":0.0007373731,"threshold_uncertainty_score":0.007990062},"labels":[],"label_agreement":null},{"id":"W2155014708","doi":"10.1609/aaai.v24i1.7644","title":"Beyond Equilibrium: Predicting Human Behavior in Normal-Form Games","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Experimental Behavioral Economics Studies","field":"Social Sciences","cited_by":134,"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":"Nash equilibrium; Computer science; Mathematical economics; Set (abstract data type); Range (aeronautics); Best response; Game theory; Outcome (game theory); Extensive-form game; Equilibrium selection; Repeated game; Economics","score_opus":0.08053815555827337,"score_gpt":0.359902836620469,"score_spread":0.27936468106219564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155014708","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.51077956,0.002606337,0.47207198,0.0027010895,0.00012429335,0.0003808885,0.0013861901,0.00060047826,0.009349268],"genre_scores_gemma":[0.9578148,0.00063650444,0.03945539,0.00030016107,0.000058629263,0.0002816304,0.0006707857,0.000057209105,0.00072497554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99059206,0.0068427804,0.0002929744,0.0014540366,0.00056551007,0.00025260355],"domain_scores_gemma":[0.9246252,0.062084626,0.00575143,0.004634482,0.0020632553,0.0008409157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018914843,0.0017300228,0.002271894,0.0031392064,0.00087477855,0.0032668032,0.0036333222,0.0021785682,0.003198455],"category_scores_gemma":[0.08619532,0.00095545285,0.0021138047,0.00202886,0.002192126,0.008572977,0.0014483153,0.0026174744,0.00057082775],"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.0012595593,0.0010189334,0.11146445,0.0009870022,0.00227724,0.0002229533,0.0017552596,0.61576504,0.00094727625,0.1985833,0.0049341405,0.060784776],"study_design_scores_gemma":[0.0001454636,0.00036984912,0.0077200634,0.00009458629,0.00023947477,0.00007910453,0.00027806213,0.6960855,0.00042457998,0.29307213,0.0014246374,0.000066579225],"about_ca_topic_score_codex":0.009472219,"about_ca_topic_score_gemma":0.006752799,"teacher_disagreement_score":0.018914843,"about_ca_system_score_codex":0.0020379256,"about_ca_system_score_gemma":0.0012302598,"threshold_uncertainty_score":0.10003245},"labels":[],"label_agreement":null},{"id":"W2155378065","doi":"10.1609/aaai.v29i1.9398","title":"asprin: Customizing Answer Set Preferences without a Headache","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Preference; Computer science; Set (abstract data type); Dominance (genetics); Logic program; Extensibility; Artificial intelligence; Theoretical computer science; Machine learning; Logic programming; Mathematics; Programming language","score_opus":0.16490016425506848,"score_gpt":0.3202468155818483,"score_spread":0.15534665132677983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155378065","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.009499313,0.0000931833,0.9743062,0.00023356611,0.00006987918,0.00025141813,0.00034269187,0.009731931,0.0054717762],"genre_scores_gemma":[0.17909485,0.0001767834,0.80557865,0.00062977494,0.00007807495,0.00050996523,0.0015074788,0.0026252978,0.009799047],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940818,0.0018855677,0.00051733013,0.0009806859,0.0020695503,0.0004649577],"domain_scores_gemma":[0.99359363,0.002573073,0.0002301872,0.0025142445,0.00082076364,0.0002681518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007811057,0.0009939153,0.000910596,0.0012867423,0.00082224223,0.0030086867,0.0033098813,0.001275053,0.013980957],"category_scores_gemma":[0.019598573,0.00084763765,0.0014391649,0.0010959875,0.0012569526,0.008682886,0.0067420388,0.0029018305,0.003435525],"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.0015188253,0.0005022943,0.0022736876,0.0005630716,0.00014792162,0.00040323354,0.0011448328,0.03322285,0.021066446,0.26290503,0.022338316,0.6539135],"study_design_scores_gemma":[0.00023561533,0.00038415764,0.00069474016,0.00016317025,0.000102701255,0.00048707135,0.00046051567,0.47424206,0.036430493,0.3818781,0.104797624,0.0001237961],"about_ca_topic_score_codex":0.0010719835,"about_ca_topic_score_gemma":0.0020079424,"teacher_disagreement_score":0.013980957,"about_ca_system_score_codex":0.0009968764,"about_ca_system_score_gemma":0.0012306155,"threshold_uncertainty_score":0.04677093},"labels":[],"label_agreement":null},{"id":"W2155478180","doi":"10.1609/aaai.v27i3.19009","title":"Model AI Assignments 2013","year":2013,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Session (web analytics); Computer science; Variety (cybernetics); Dissemination; Artificial intelligence; Multimedia; Core (optical fiber); World Wide Web; Telecommunications","score_opus":0.08977113249345287,"score_gpt":0.29854480852091986,"score_spread":0.208773676027467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155478180","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013262227,0.0014809723,0.06084057,0.018315874,0.014438971,0.0009918144,0.018149141,0.018467365,0.85405314],"genre_scores_gemma":[0.04126768,0.0013618077,0.019551534,0.0018838873,0.0016681023,0.00090360467,0.023357159,0.004212645,0.9057937],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979826,0.0004129845,0.00007232516,0.00028433942,0.0009516773,0.00029608238],"domain_scores_gemma":[0.99585694,0.00044075656,0.00010387288,0.000514561,0.0013669448,0.0017170152],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0051671355,0.0011028727,0.0007408243,0.0012799425,0.0029741586,0.006645972,0.0025574993,0.0016821561,0.30225468],"category_scores_gemma":[0.008860163,0.00062075176,0.001140965,0.0011936772,0.0006099159,0.0032481365,0.0043135923,0.003291194,0.13557245],"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.000107425796,0.00023407115,0.00024382412,0.00006743043,0.000008253248,0.000040009352,0.00014066782,0.0007207026,0.000636737,0.007837419,0.9380495,0.05191396],"study_design_scores_gemma":[0.00002369947,0.000058610567,0.0006964068,0.00004318854,0.0000033105323,0.000033909808,0.000101379555,0.0019149891,0.0005976354,0.0057330197,0.9907741,0.000019792513],"about_ca_topic_score_codex":0.005902188,"about_ca_topic_score_gemma":0.020095663,"teacher_disagreement_score":0.30225468,"about_ca_system_score_codex":0.0040461286,"about_ca_system_score_gemma":0.0050209807,"threshold_uncertainty_score":0.99524903},"labels":[],"label_agreement":null},{"id":"W2156954687","doi":"10.1609/aaai.v25i1.7917","title":"Learning Structured Embeddings of Knowledge Bases","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":66,"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 Montréal","funders":"","keywords":"WordNet; Computer science; Artificial intelligence; Natural language processing; Process (computing); Knowledge extraction; Natural language; Information retrieval; Information extraction; Word (group theory); Annotation","score_opus":0.08527527762667422,"score_gpt":0.2914836337513474,"score_spread":0.20620835612467317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156954687","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.090590686,0.0005276891,0.9025856,0.0007492719,0.00011083033,0.00010435185,0.0010941572,0.0016540348,0.0025834218],"genre_scores_gemma":[0.6644039,0.00073462294,0.32455492,0.00028428013,0.00010109724,0.0002706554,0.0054109325,0.00018152125,0.004058128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990889,0.00029441147,0.00008090974,0.00027554936,0.00018708418,0.000073197785],"domain_scores_gemma":[0.9960394,0.0022793792,0.00029266762,0.00064818055,0.00062839146,0.00011194103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010461989,0.00078183267,0.00062151515,0.0016960544,0.00035974607,0.0016335539,0.0013246338,0.0011863207,0.002027417],"category_scores_gemma":[0.010934589,0.0005716153,0.00066043617,0.0015153801,0.0008101854,0.0049531134,0.0019329111,0.0017267318,0.0006804998],"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.00030952232,0.00030915506,0.0053022774,0.00047002864,0.00016348166,0.0002735352,0.0007210175,0.2851052,0.0063028554,0.070184864,0.009284843,0.6215732],"study_design_scores_gemma":[0.000018546723,0.000074998636,0.00038027452,0.00004774697,0.000023312106,0.00003470176,0.00011773807,0.92005837,0.0019569572,0.074885555,0.002386892,0.000015000813],"about_ca_topic_score_codex":0.0021667504,"about_ca_topic_score_gemma":0.0037713014,"teacher_disagreement_score":0.0021667504,"about_ca_system_score_codex":0.00078900723,"about_ca_system_score_gemma":0.0007200207,"threshold_uncertainty_score":0.0067824125},"labels":[],"label_agreement":null},{"id":"W2159176819","doi":"10.1609/aaai.v26i1.8204","title":"Time-Critical Influence Maximization in Social Networks with Time-Delayed Diffusion Process","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":131,"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":"Maximization; Heuristics; Computer science; Mathematical optimization; Greedy algorithm; Heuristic; Constraint (computer-aided design); Set (abstract data type); Process (computing); Algorithm; Mathematics; Artificial intelligence","score_opus":0.022702445818102917,"score_gpt":0.2931075849506718,"score_spread":0.27040513913256886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159176819","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.06990179,0.00040396152,0.92352504,0.00043985457,0.000024461897,0.000101261576,0.00010326281,0.00017898115,0.005321383],"genre_scores_gemma":[0.8782809,0.0007789738,0.11681726,0.00011448867,0.00008904219,0.00020638072,0.00014737104,0.000082882856,0.0034827944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988518,0.00039293466,0.00003902646,0.00027900864,0.000254477,0.00018273543],"domain_scores_gemma":[0.99504423,0.0037823517,0.0004976459,0.0001501058,0.0002709297,0.00025480922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002025636,0.0011322787,0.001237921,0.0012556051,0.00087150274,0.0015694847,0.0015873241,0.0012771756,0.001661057],"category_scores_gemma":[0.007894456,0.00073569483,0.00091914105,0.0015917623,0.0015901914,0.0024719974,0.0012893436,0.0011861642,0.00022773173],"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.00009513034,0.000051081315,0.0007943704,0.00010671948,0.000050023136,0.00018572633,0.00015960273,0.9180436,0.0026285194,0.06348558,0.00079389673,0.013605742],"study_design_scores_gemma":[0.000016673002,0.000023336444,0.00016043181,0.0000055079236,0.000014741683,0.000033119388,0.000028350807,0.96633774,0.0009369227,0.031836163,0.00059995113,0.000007104966],"about_ca_topic_score_codex":0.0050337533,"about_ca_topic_score_gemma":0.004327615,"teacher_disagreement_score":0.0050337533,"about_ca_system_score_codex":0.0022455938,"about_ca_system_score_gemma":0.0013606683,"threshold_uncertainty_score":0.01629299},"labels":[],"label_agreement":null},{"id":"W2161534823","doi":"10.1609/aaai.v26i1.8132","title":"Fast and Accurate Predictions of IDA*'s Performance","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates; University of Regina","keywords":"Computation; Computer science; Chen; Line (geometry); Point (geometry); Algorithm; Mathematics; Geology","score_opus":0.06116951912428045,"score_gpt":0.2721131074201581,"score_spread":0.21094358829587764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161534823","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.31102496,0.0016937479,0.65493304,0.001331505,0.00030882467,0.0001563551,0.003064667,0.011305757,0.016181266],"genre_scores_gemma":[0.7946901,0.00044449797,0.20004958,0.0001202105,0.00004837583,0.00021275769,0.0017836915,0.0005318534,0.0021189004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794775,0.00042102364,0.00008559864,0.0005165794,0.00075801596,0.0002710179],"domain_scores_gemma":[0.9883406,0.0071239853,0.0005297619,0.0019899283,0.001652691,0.00036308804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028206715,0.0012278295,0.0009634657,0.00130379,0.0007894548,0.001703123,0.0021621266,0.0014782815,0.002808884],"category_scores_gemma":[0.01830455,0.00077964616,0.00064690295,0.0010667177,0.00068665185,0.0027566315,0.0012127581,0.0029530216,0.001563854],"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.00034533744,0.00012641687,0.008285025,0.00014275649,0.000046554625,0.00006575731,0.00011485692,0.8947423,0.0064510396,0.011072942,0.0075531607,0.071054],"study_design_scores_gemma":[0.00000783765,0.000015310481,0.00055488606,0.000005848877,0.0000031141044,0.00000907289,0.000012901549,0.99317825,0.0027415163,0.0029354438,0.0005279454,0.000007830292],"about_ca_topic_score_codex":0.012533431,"about_ca_topic_score_gemma":0.010352839,"teacher_disagreement_score":0.012533431,"about_ca_system_score_codex":0.0022510889,"about_ca_system_score_gemma":0.0024111257,"threshold_uncertainty_score":0.02492094},"labels":[],"label_agreement":null},{"id":"W2165702433","doi":"10.1609/aaai.v26i2.18975","title":"TRUSTS: Scheduling Randomized Patrols for Fare Inspection in Transit Systems","year":2012,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Evacuation and Crowd Dynamics","field":"Engineering","cited_by":103,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Multidisciplinary University Research Initiative; National Science Foundation","keywords":"Stackelberg competition; Revenue; Computer science; Operations research; Scheduling (production processes); Transit (satellite); Novelty; Taxis; Payment; Computer security; Transport engineering; Business; Public transport; Economics; Engineering; Operations management; Finance; Microeconomics","score_opus":0.05135877959921619,"score_gpt":0.2783743659688538,"score_spread":0.2270155863696376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165702433","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.48026013,0.00072234473,0.50075585,0.0013019018,0.00039890828,0.0007700158,0.00062495423,0.008538309,0.006627572],"genre_scores_gemma":[0.910454,0.00006649458,0.08760007,0.00011745327,0.000033661003,0.00013386799,0.0002616403,0.00015789639,0.0011750112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983833,0.0005502551,0.000084401814,0.00036698786,0.00021688102,0.00039828636],"domain_scores_gemma":[0.99424225,0.0033088315,0.00059457833,0.00063144823,0.00046016337,0.0007627078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026889264,0.0012285818,0.0015555908,0.00055761164,0.001138224,0.0010924006,0.0021696102,0.001244663,0.00394586],"category_scores_gemma":[0.010461155,0.00067175785,0.0007651534,0.0005588503,0.0010172572,0.0018757347,0.0013759618,0.0012688901,0.0005360791],"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.0014456364,0.0005255925,0.0049697594,0.00015922805,0.00009019752,0.00014168331,0.0002532312,0.91520053,0.0032589464,0.005993765,0.004783926,0.06317762],"study_design_scores_gemma":[0.00009606784,0.00013472736,0.00025597675,0.000003462817,0.000010348063,0.00001386213,0.00004556106,0.9960359,0.00048185792,0.0024751485,0.0004400169,0.000007139329],"about_ca_topic_score_codex":0.018418962,"about_ca_topic_score_gemma":0.021383297,"teacher_disagreement_score":0.018418962,"about_ca_system_score_codex":0.002050527,"about_ca_system_score_gemma":0.0040215785,"threshold_uncertainty_score":0.036623538},"labels":[],"label_agreement":null},{"id":"W2171560059","doi":"10.1609/aaai.v29i1.9150","title":"Are Features Equally Representative? A Feature-Centric Recommendation","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Higher Education Discipline Innovation Project; Renmin University of China; China Knowledge Centre for Engineering Sciences and Technology; National Research Foundation Singapore; National Research Foundation","keywords":"Feature (linguistics); Computer science; Artificial intelligence; Recommender system; Machine learning; Rating scale; Information retrieval; Data mining; Mathematics; Statistics","score_opus":0.1573915639771322,"score_gpt":0.34231514955397185,"score_spread":0.18492358557683966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171560059","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.057373397,0.001654404,0.92874104,0.002701437,0.00014118456,0.00027837328,0.00088618364,0.00064591336,0.0075781713],"genre_scores_gemma":[0.6572635,0.0010819563,0.33186695,0.0017610042,0.0004966281,0.00032648654,0.0014070102,0.00016764387,0.005628884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940826,0.0019391035,0.00026010815,0.0023536866,0.0010755643,0.00028891],"domain_scores_gemma":[0.9886057,0.0053139385,0.00096711045,0.0032074547,0.0016066182,0.0002991971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005739371,0.000986004,0.0025681783,0.0020931242,0.0010069966,0.0022045162,0.0026970394,0.003034211,0.0033982461],"category_scores_gemma":[0.023240522,0.0011105193,0.0013367853,0.003504183,0.0011945508,0.007149149,0.0011047118,0.0017464287,0.0015615514],"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.0011799688,0.0006647558,0.03400775,0.00079303834,0.0012552469,0.00058241055,0.00079453643,0.06789282,0.0066007692,0.080382876,0.024363669,0.7814821],"study_design_scores_gemma":[0.00031157854,0.000679424,0.015621794,0.00025182444,0.0007055489,0.0023231646,0.0005070289,0.7277453,0.004787622,0.2255555,0.021345614,0.00016556682],"about_ca_topic_score_codex":0.0027037119,"about_ca_topic_score_gemma":0.0047299494,"teacher_disagreement_score":0.005739371,"about_ca_system_score_codex":0.0011280586,"about_ca_system_score_gemma":0.001247641,"threshold_uncertainty_score":0.03035307},"labels":[],"label_agreement":null},{"id":"W2172353311","doi":"10.1609/aaai.v28i1.8887","title":"A Game-Theoretic Analysis of Catalog Optimization","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Competitor analysis; Vendor; Computer science; Price of anarchy; Nash equilibrium; Profitability index; Game theory; Product (mathematics); Face (sociological concept); Best response; Operations research; Mathematical economics; Price of stability; Economics; Marketing; Mathematics; Business","score_opus":0.12457628017071908,"score_gpt":0.3706522191043465,"score_spread":0.2460759389336274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172353311","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.065259576,0.0017805459,0.75968266,0.0056434926,0.00015426904,0.00031062705,0.0005920333,0.00013882498,0.16643798],"genre_scores_gemma":[0.8882561,0.0018997164,0.07668466,0.00057504827,0.00025321823,0.00034875865,0.00031340282,0.000066247834,0.03160295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988618,0.0005651617,0.00003788974,0.00014295237,0.00023467596,0.0001575223],"domain_scores_gemma":[0.9983432,0.0011485358,0.0001311554,0.00009708532,0.0001441653,0.0001359095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014092824,0.00077512464,0.0009213441,0.0009580303,0.0011674495,0.003467031,0.0018908754,0.001871033,0.012061965],"category_scores_gemma":[0.005646043,0.0006031512,0.00092846574,0.001480984,0.002099875,0.0049905977,0.0013011049,0.0019581264,0.0007011433],"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.000024223144,0.00005091851,0.00021186224,0.00004533764,0.000018692968,0.00006182099,0.000099015175,0.11062546,0.00028610637,0.8803672,0.0025892707,0.005620101],"study_design_scores_gemma":[0.000029423642,0.000029963881,0.00022002,0.000020535135,0.000012245659,0.0000491985,0.000099011166,0.41152984,0.00009117892,0.5824988,0.005403136,0.000016483082],"about_ca_topic_score_codex":0.0065941247,"about_ca_topic_score_gemma":0.004291002,"teacher_disagreement_score":0.012061965,"about_ca_system_score_codex":0.003501222,"about_ca_system_score_gemma":0.0023428916,"threshold_uncertainty_score":0.04035127},"labels":[],"label_agreement":null},{"id":"W2172966806","doi":"10.1609/aaai.v28i1.8847","title":"Elimination Ordering in Lifted First-Order Probabilistic Inference","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Inference; Parameterized complexity; Probabilistic logic; Relational database; Computer science; Relational model; Statistical relational learning; Relational calculus; Theoretical computer science; Machine learning; Artificial intelligence; Data mining; Algorithm","score_opus":0.05811177073098736,"score_gpt":0.2875296377175596,"score_spread":0.22941786698657227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172966806","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.005159287,0.00019272116,0.99201727,0.00024394298,0.000035720008,0.00006983806,0.00015161232,0.00038540392,0.0017441943],"genre_scores_gemma":[0.17119715,0.0005880404,0.82362795,0.00030917354,0.000110461384,0.00027597958,0.0010824107,0.00023205904,0.002576853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994686,0.0025044468,0.00028291435,0.00064302236,0.0014841002,0.00039953174],"domain_scores_gemma":[0.98093855,0.014075127,0.00070766313,0.0026849366,0.0012346762,0.00035904816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005980772,0.0010544956,0.0018376671,0.0032630991,0.0014390389,0.002303219,0.0028286977,0.001434163,0.0063006408],"category_scores_gemma":[0.028369108,0.0014837704,0.0036846988,0.00323467,0.0027188512,0.0052322852,0.0036109588,0.0044846833,0.0010693754],"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.00011630359,0.00011387681,0.0015649584,0.00031058615,0.00013477281,0.00043692678,0.00047716452,0.34467515,0.00094639725,0.5121917,0.00502382,0.13400836],"study_design_scores_gemma":[0.000031815667,0.000018228917,0.00014134141,0.000040755192,0.0000289238,0.00008755314,0.000033872606,0.524854,0.0007383571,0.47138822,0.0026119642,0.000024910987],"about_ca_topic_score_codex":0.007744342,"about_ca_topic_score_gemma":0.011713929,"teacher_disagreement_score":0.007744342,"about_ca_system_score_codex":0.0021875717,"about_ca_system_score_gemma":0.0032472704,"threshold_uncertainty_score":0.03162974},"labels":[],"label_agreement":null},{"id":"W2173535716","doi":"10.1609/aaai.v27i1.8533","title":"Graphical Model-Based Learning in High Dimensional Feature Spaces","year":2013,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Image and Video Retrieval Techniques","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":"Simon Fraser University","funders":"","keywords":"Latent Dirichlet allocation; Computer science; Feature (linguistics); High dimensional; Process (computing); Space (punctuation); Feature vector; Topic model; Information retrieval; Artificial intelligence","score_opus":0.037819541267767286,"score_gpt":0.28787444423548075,"score_spread":0.2500549029677135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173535716","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.007042812,0.00025596173,0.9912055,0.00038349652,0.000021337724,0.00003112536,0.00018468611,0.00053220504,0.0003428333],"genre_scores_gemma":[0.56001997,0.000871924,0.4296707,0.00080896704,0.00030847715,0.0005959342,0.0031801746,0.00037000247,0.004173887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651474,0.0018161695,0.00017226751,0.00082595565,0.00043367318,0.00023722934],"domain_scores_gemma":[0.98553246,0.011893566,0.0006144112,0.00097267254,0.0007522347,0.00023453883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038693564,0.0014529742,0.0028597221,0.0024937605,0.00086513604,0.0026273145,0.003207756,0.0024995997,0.0030645295],"category_scores_gemma":[0.016642496,0.0011325162,0.0023002492,0.0030122374,0.0021296467,0.0043012947,0.0031168747,0.003922365,0.0011678064],"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.000193547,0.00020029774,0.0024792075,0.00026788207,0.00019975027,0.00018599394,0.00021784684,0.7885912,0.0012591913,0.058595426,0.005879989,0.14192966],"study_design_scores_gemma":[0.000013157344,0.000013063884,0.00009737458,0.0000064590727,0.00000838289,0.000013742936,0.000006748083,0.9664834,0.00012739706,0.03298531,0.00023812916,0.0000069104876],"about_ca_topic_score_codex":0.008088075,"about_ca_topic_score_gemma":0.008933551,"teacher_disagreement_score":0.008088075,"about_ca_system_score_codex":0.0019097105,"about_ca_system_score_gemma":0.0011807397,"threshold_uncertainty_score":0.020463347},"labels":[],"label_agreement":null},{"id":"W2174820871","doi":"10.1609/aaai.v28i1.9045","title":"Cost-Based Query Optimization via AI Planning","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Query optimization; Computer science; Query expansion; Suite; Sargable; Context (archaeology); Plan (archaeology); Optimization problem; Query plan; Query language; Domain (mathematical analysis); Web search query; Mathematical optimization; Data mining; Information retrieval; Algorithm; Search engine; Mathematics","score_opus":0.07989796132133917,"score_gpt":0.30293042550432664,"score_spread":0.22303246418298747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174820871","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.0065121013,0.0003739779,0.98828727,0.00047881293,0.000022939837,0.00014234916,0.000085400985,0.00060291076,0.0034942767],"genre_scores_gemma":[0.2662741,0.0007490213,0.729753,0.00024910478,0.000058053494,0.0003379507,0.00041686377,0.00025306415,0.0019088573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965006,0.001246486,0.00018472516,0.00046205497,0.0014162499,0.0001898731],"domain_scores_gemma":[0.9937844,0.0048421677,0.00030779175,0.0005887895,0.00038821605,0.00008865611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003065481,0.0011024441,0.0007908933,0.0010788697,0.0008099705,0.0018538454,0.0016654459,0.0008327505,0.0028538923],"category_scores_gemma":[0.009840842,0.00056459237,0.0009205377,0.0014452835,0.0019080581,0.0025861016,0.0019749356,0.0018593001,0.0004453521],"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.00015895761,0.0001405639,0.0008679937,0.000444178,0.00008116608,0.00018667475,0.00043207593,0.6743707,0.005051113,0.14428411,0.004205098,0.16977735],"study_design_scores_gemma":[0.000042062253,0.00006460468,0.00014642702,0.000030751457,0.000035148318,0.00006896541,0.00010332793,0.8705667,0.0032739316,0.12011545,0.005534384,0.000018138793],"about_ca_topic_score_codex":0.005668637,"about_ca_topic_score_gemma":0.0069170487,"teacher_disagreement_score":0.005668637,"about_ca_system_score_codex":0.0013993405,"about_ca_system_score_gemma":0.002342739,"threshold_uncertainty_score":0.016211987},"labels":[],"label_agreement":null},{"id":"W2176819926","doi":"10.1609/aaai.v28i1.9125","title":"Linear-Time Filtering Algorithms for the Disjunctive Constraint","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","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":"Université Laval","funders":"","keywords":"Computer science; Algorithm; Constraint (computer-aided design); Logarithm; Time complexity; Time constraint; Data structure; Tree (set theory); Constant (computer programming); Running time; Theoretical computer science; Mathematics","score_opus":0.06594457206901701,"score_gpt":0.29010170181726114,"score_spread":0.22415712974824414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2176819926","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.0026419642,0.00019450011,0.99298906,0.00012494512,0.000048745143,0.00009285186,0.00010117456,0.0015030873,0.002303613],"genre_scores_gemma":[0.031566586,0.00017621309,0.963824,0.00015057162,0.00007721193,0.00023737743,0.00058840524,0.00047091683,0.0029087353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962842,0.0005325363,0.00038382853,0.0008294876,0.0014157897,0.0005541059],"domain_scores_gemma":[0.9897878,0.005456122,0.0007288575,0.0019343916,0.0017581973,0.00033460255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028749574,0.0020469986,0.0014608073,0.0025640153,0.0013667184,0.0029782832,0.0039965142,0.0018362053,0.014649056],"category_scores_gemma":[0.012936561,0.00092057016,0.0018422017,0.0042427434,0.0012238293,0.006179598,0.0020866434,0.0031667617,0.0035704852],"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.0005137066,0.0005294948,0.0011553307,0.00046688798,0.00011145914,0.000083775085,0.00024097481,0.10719793,0.0067589986,0.07778569,0.022332307,0.7828234],"study_design_scores_gemma":[0.00020375305,0.00012025718,0.00038790444,0.000046021385,0.000054111555,0.00014656899,0.00007331829,0.8852973,0.009722007,0.09056565,0.013319772,0.00006345194],"about_ca_topic_score_codex":0.010066044,"about_ca_topic_score_gemma":0.012033546,"teacher_disagreement_score":0.014649056,"about_ca_system_score_codex":0.0032025808,"about_ca_system_score_gemma":0.0034677924,"threshold_uncertainty_score":0.049005985},"labels":[],"label_agreement":null},{"id":"W2177899970","doi":"10.1609/aaai.v31i1.10777","title":"Denoising Criterion for Variational Auto-Encoding Framework","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":142,"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 Montréal","funders":"","keywords":"Autoencoder; MNIST database; Noise reduction; Noise (video); Upper and lower bounds; Pattern recognition (psychology); Encoding (memory); Encoder; Artificial intelligence; Computer science; Algorithm; Mathematics; Deep learning","score_opus":0.10276992054147606,"score_gpt":0.3279392752590403,"score_spread":0.22516935471756427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177899970","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.0077137314,0.00018796836,0.98936546,0.00028666863,0.000018384826,0.000023392293,0.00005739297,0.00011928072,0.0022277413],"genre_scores_gemma":[0.53741866,0.00092691486,0.44318017,0.00064246,0.00017813574,0.00037532984,0.0007648667,0.00054233684,0.015971001],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993092,0.000244992,0.000039032602,0.00013589706,0.00020813906,0.00006277393],"domain_scores_gemma":[0.99818665,0.0011586059,0.00010472522,0.00013651491,0.00032987577,0.000083685874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023715657,0.00095316337,0.00095286104,0.0006752905,0.00033344276,0.0011101294,0.0013874897,0.00199006,0.0031275428],"category_scores_gemma":[0.00643788,0.0005795073,0.0006366,0.00043379416,0.0014270799,0.0017293296,0.0017103903,0.002334113,0.0006506829],"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.000075777345,0.0000425087,0.0005751133,0.00013256019,0.00004142684,0.000103478895,0.00010531243,0.7242818,0.007586976,0.2280168,0.0024187292,0.036619507],"study_design_scores_gemma":[0.0000034470047,0.00001257767,0.000046079527,0.000009145948,0.0000031510338,0.000022012651,0.000004433866,0.9759058,0.0010985442,0.022431593,0.00045767025,0.0000054594825],"about_ca_topic_score_codex":0.0023800137,"about_ca_topic_score_gemma":0.0020678677,"teacher_disagreement_score":0.0031275428,"about_ca_system_score_codex":0.0012468891,"about_ca_system_score_gemma":0.0013095838,"threshold_uncertainty_score":0.012542188},"labels":[],"label_agreement":null},{"id":"W2180453814","doi":"10.1609/aaai.v28i1.8980","title":"Learning the Structure of Probabilistic Graphical Models with an Extended Cascading Indian Buffet Process","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Graphical model; Directed acyclic graph; Computer science; Artificial intelligence; Process (computing); Machine learning; Context (archaeology); Probabilistic logic; Theoretical computer science; Extension (predicate logic); Graph; Algorithm; Programming language","score_opus":0.03783105091268975,"score_gpt":0.2889702007784415,"score_spread":0.25113914986575175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2180453814","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.02819707,0.00011005041,0.970426,0.00019057559,0.000018081204,0.000039572114,0.000048877857,0.00029515097,0.00067451154],"genre_scores_gemma":[0.680459,0.00033026809,0.31447116,0.0002414298,0.000096982134,0.0002328771,0.00043320403,0.00015520507,0.0035798773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986437,0.0006766559,0.00004764023,0.00032846155,0.0001937234,0.00010983151],"domain_scores_gemma":[0.9910749,0.0070044943,0.00044847638,0.0007521052,0.00046946702,0.000250519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039240513,0.0010012802,0.001208243,0.0012794312,0.00064572063,0.0014223935,0.0022125999,0.0017099449,0.0033641993],"category_scores_gemma":[0.015282584,0.0010074961,0.0014763303,0.0010096418,0.0016881122,0.0032805155,0.002595265,0.004034497,0.00058208196],"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.00018144946,0.00011515285,0.0025509484,0.00008738698,0.00009441678,0.0001907859,0.0002532526,0.84561497,0.0019072123,0.09330879,0.0010117259,0.054683864],"study_design_scores_gemma":[0.0000061851606,0.000012075934,0.00009052478,0.0000041921553,0.000005978403,0.000009790653,0.000004133835,0.97895586,0.0001575626,0.020614432,0.00013418333,0.0000051937054],"about_ca_topic_score_codex":0.0040410953,"about_ca_topic_score_gemma":0.0039225533,"teacher_disagreement_score":0.0040410953,"about_ca_system_score_codex":0.0007084233,"about_ca_system_score_gemma":0.00085572497,"threshold_uncertainty_score":0.020752668},"labels":[],"label_agreement":null},{"id":"W2181780560","doi":"10.1609/aaai.v28i1.8865","title":"PREGO: An Action Language for Belief-Based Cognitive Robotics in Continuous Domains","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":15,"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":"Robotics; Artificial intelligence; Cognitive robotics; Computer science; Successor cardinal; Context (archaeology); Axiom; Action (physics); Cognitive science; Cognition; Robot; Mathematics; Psychology","score_opus":0.06935904995918539,"score_gpt":0.3216811786343031,"score_spread":0.2523221286751177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2181780560","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.0018244736,0.00009755497,0.99161494,0.00046375254,0.00009234928,0.000103797014,0.00017014341,0.0029554996,0.0026774926],"genre_scores_gemma":[0.13380317,0.0003261234,0.8589256,0.0008216604,0.00013164194,0.0005551875,0.00038045313,0.00060254463,0.0044535594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986981,0.0003721752,0.00015597751,0.00027216636,0.0003859498,0.00011560861],"domain_scores_gemma":[0.9984133,0.00081478123,0.00017962388,0.00023838821,0.000208527,0.00014534211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024311915,0.0008800484,0.0006337488,0.0008087253,0.0009306725,0.0032545943,0.0028119334,0.0018352651,0.0060347747],"category_scores_gemma":[0.0045318143,0.00078132324,0.0017583693,0.00049042667,0.0040542437,0.004971438,0.0032145677,0.004063756,0.0015321238],"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.00015584349,0.00004442662,0.0002482317,0.00034490094,0.00003920478,0.00023600706,0.0011341701,0.01650761,0.0047460077,0.93536305,0.005125586,0.03605506],"study_design_scores_gemma":[0.00010641222,0.00017741756,0.0002202922,0.00020058005,0.000080472906,0.00043818296,0.00025116425,0.21063009,0.009837383,0.6730873,0.10486577,0.00010500311],"about_ca_topic_score_codex":0.0014860153,"about_ca_topic_score_gemma":0.0019410012,"teacher_disagreement_score":0.0060347747,"about_ca_system_score_codex":0.0009118453,"about_ca_system_score_gemma":0.001736941,"threshold_uncertainty_score":0.020188272},"labels":[],"label_agreement":null},{"id":"W2182451202","doi":"10.1609/aaai.v26i1.8331","title":"Construction of New Medicines via Game Proof Search","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Open Education and E-Learning","field":"Computer Science","cited_by":39,"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":"Suite; Computer science; Benchmark (surveying); Branching (polymer chemistry); Graph; Solver; Theoretical computer science; Heuristic; Tree (set theory); Artificial intelligence; Chemistry; Mathematics; Programming language; Combinatorics","score_opus":0.08343258179386757,"score_gpt":0.32660589475808716,"score_spread":0.24317331296421957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182451202","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.05206912,0.00079932483,0.903781,0.001928587,0.00012924043,0.00056298607,0.00052393065,0.0013092803,0.038896516],"genre_scores_gemma":[0.39737082,0.00074064004,0.592091,0.0005980705,0.000055362267,0.00062306254,0.0005923104,0.00030222017,0.007626402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847215,0.0006368777,0.00007455508,0.00022623452,0.00042888022,0.00016137426],"domain_scores_gemma":[0.99538225,0.0038031738,0.00022847798,0.00024396063,0.00020947211,0.00013261556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016995077,0.0010013068,0.0008956263,0.0009805158,0.0007215834,0.0018297622,0.001489209,0.0014508788,0.008870248],"category_scores_gemma":[0.01014914,0.00063936657,0.0014062894,0.00079945446,0.0022644664,0.0020563174,0.0022245932,0.0015755947,0.00085522444],"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.00013814813,0.0001964837,0.0007572496,0.00045085716,0.00008868299,0.00025437988,0.00018461105,0.6757737,0.0020514578,0.24980494,0.0065351655,0.06376433],"study_design_scores_gemma":[0.00012968964,0.00008873347,0.00009335477,0.00005242804,0.000029501183,0.000051398503,0.000065068416,0.82394975,0.0014733427,0.16443028,0.009619929,0.000016546865],"about_ca_topic_score_codex":0.0034528018,"about_ca_topic_score_gemma":0.0053127217,"teacher_disagreement_score":0.008870248,"about_ca_system_score_codex":0.0015290363,"about_ca_system_score_gemma":0.0031173932,"threshold_uncertainty_score":0.029673934},"labels":[],"label_agreement":null},{"id":"W2182562048","doi":"10.1609/aaai.v28i1.8976","title":"Convex Co-embedding","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Embedding; Ranking (information retrieval); Regular polygon; Computer science; Relation (database); Relevance (law); Convex optimization; Learning to rank; Artificial intelligence; Current (fluid); Machine learning; Theoretical computer science; Mathematical optimization; Mathematics; Data mining; Geometry","score_opus":0.056841868913256155,"score_gpt":0.3135525068299718,"score_spread":0.25671063791671567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182562048","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.0025231286,0.00024795174,0.9939818,0.00023392844,0.00004076317,0.000023641036,0.00021366666,0.00014456802,0.0025906423],"genre_scores_gemma":[0.34369305,0.0018404122,0.6252913,0.0005473413,0.00040792013,0.000553426,0.0031891675,0.0006902898,0.023787143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971282,0.0011262712,0.00014046184,0.0008279405,0.0006213238,0.00015583396],"domain_scores_gemma":[0.99471396,0.002192678,0.00045883819,0.001545351,0.0008279706,0.00026126663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021910528,0.0020078267,0.0015200626,0.0018292083,0.00078687107,0.002857981,0.0024502024,0.0017882123,0.008360722],"category_scores_gemma":[0.009926835,0.00078413717,0.0013561648,0.0023764533,0.0023645903,0.0053132335,0.004274566,0.0037449969,0.0031817453],"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.00007268694,0.00007807427,0.00097104366,0.00026648928,0.00011948081,0.00023817939,0.00021601748,0.2845281,0.0019385216,0.5923502,0.010784849,0.10843631],"study_design_scores_gemma":[0.000005993788,0.00004291432,0.00021715992,0.00002814194,0.0000130679855,0.00013515308,0.000031651634,0.7196777,0.00076815946,0.27037022,0.008691075,0.0000187264],"about_ca_topic_score_codex":0.0019183891,"about_ca_topic_score_gemma":0.0024552646,"teacher_disagreement_score":0.008360722,"about_ca_system_score_codex":0.0012432667,"about_ca_system_score_gemma":0.0009591897,"threshold_uncertainty_score":0.02796936},"labels":[],"label_agreement":null},{"id":"W2182573229","doi":"10.1609/aaai.v29i1.9701","title":"Representation Discovery for MDPs Using Bisimulation Metrics","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","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":"McGill University","funders":"","keywords":"Bisimulation; Metric (unit); Computer science; Representation (politics); Computation; Convergence (economics); Markov decision process; Sequence (biology); Theoretical computer science; State space; State (computer science); Metric space; Algorithm; Markov process; Mathematics; Discrete mathematics","score_opus":0.29689374545324165,"score_gpt":0.37833881418119636,"score_spread":0.0814450687279547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182573229","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.004125882,0.000042038966,0.99485224,0.00005614967,0.00000708661,0.000057441328,0.00004160669,0.00028719186,0.00053033046],"genre_scores_gemma":[0.16810647,0.00013504483,0.83000755,0.000056497935,0.00001466087,0.00042630982,0.0003721476,0.00019869092,0.0006826429],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781847,0.0007096104,0.00016754992,0.00040099336,0.0007582337,0.00014513795],"domain_scores_gemma":[0.99545044,0.0027596562,0.00045097,0.00063350296,0.00057413004,0.00013136736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024974702,0.0013634339,0.0013556224,0.0020483395,0.0008006251,0.0017505758,0.0020111143,0.0012782825,0.0028893366],"category_scores_gemma":[0.0141487075,0.0008458691,0.0018373958,0.0013214478,0.0014201468,0.003278455,0.0037219191,0.0021885275,0.0006628627],"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.00007095638,0.00006233696,0.00069737463,0.00017528643,0.000050755913,0.00008662317,0.00020857429,0.7584973,0.0027920878,0.116284825,0.00094769883,0.12012611],"study_design_scores_gemma":[0.000008481366,0.000022157854,0.000030785413,0.000014579171,0.000005316749,0.000016203474,0.000016287477,0.9647441,0.0010360285,0.033298135,0.0008009404,0.0000070374444],"about_ca_topic_score_codex":0.00426104,"about_ca_topic_score_gemma":0.0042428966,"teacher_disagreement_score":0.00426104,"about_ca_system_score_codex":0.002071491,"about_ca_system_score_gemma":0.00265392,"threshold_uncertainty_score":0.015029728},"labels":[],"label_agreement":null},{"id":"W2184714326","doi":"10.1609/aaai.v29i1.9660","title":"Improving Exploration in UCT Using Local Manifolds","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alberta Innovates; Western Canada Research Grid; Compute Canada","keywords":"Manifold (fluid mechanics); Metric (unit); Sample (material); Mathematical optimization; Computer science; Graph; Nonlinear dimensionality reduction; Monte Carlo method; Space (punctuation); State space; Sample space; Artificial intelligence; Mathematics; Algorithm; Machine learning; Theoretical computer science; Engineering; Statistics","score_opus":0.1935523347288295,"score_gpt":0.3302897479169594,"score_spread":0.13673741318812993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184714326","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.07014296,0.00079439307,0.92371637,0.00067168055,0.000049142716,0.000113690454,0.00009521496,0.0013664984,0.0030500665],"genre_scores_gemma":[0.8110819,0.00031631484,0.1846754,0.0002679784,0.00005286469,0.00029411496,0.00032258726,0.00027159948,0.0027172565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986345,0.00054824987,0.000081554834,0.00032939835,0.00025586132,0.00015042632],"domain_scores_gemma":[0.99189126,0.0058831167,0.0005263613,0.0008453916,0.0005196315,0.00033409268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00265185,0.0014140503,0.0023320995,0.0013074683,0.0013353582,0.0013566273,0.002136834,0.0020487362,0.003054828],"category_scores_gemma":[0.015508932,0.001057295,0.0012648682,0.0011740621,0.0025286686,0.0043479353,0.0039110878,0.0025586186,0.0005089282],"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.00011190991,0.00007672239,0.0012425532,0.0000689626,0.00004028868,0.00005826776,0.000110799214,0.9386878,0.00050529954,0.01530618,0.00102383,0.04276742],"study_design_scores_gemma":[0.000009262255,0.000028505001,0.000056728717,0.000006497169,0.0000037533298,0.000010202024,0.000007056203,0.9902473,0.00019375028,0.009262277,0.00017051553,0.0000041699304],"about_ca_topic_score_codex":0.008113426,"about_ca_topic_score_gemma":0.0074243727,"teacher_disagreement_score":0.008113426,"about_ca_system_score_codex":0.0018790406,"about_ca_system_score_gemma":0.0021473456,"threshold_uncertainty_score":0.016132355},"labels":[],"label_agreement":null},{"id":"W2185950569","doi":"10.1609/aaai.v28i1.9091","title":"A Model for Aggregating Contributions of Synergistic Crowdsourcing Workflows","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Mobile Crowdsensing and Crowdsourcing","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 Ottawa","funders":"National Key Research and Development Program of China; Beijing Nova Program; Foundation for the Author of National Excellent Doctoral Dissertation of the People's Republic of China","keywords":"Crowdsourcing; Workflow; Computer science; Task (project management); Quality (philosophy); Partially observable Markov decision process; Distributed computing; Machine learning; Data mining; Artificial intelligence; Database; Systems engineering; World Wide Web; Engineering; Markov model","score_opus":0.0593580602515172,"score_gpt":0.2903209386913843,"score_spread":0.23096287843986713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185950569","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.010886829,0.00020892317,0.98188996,0.0006251293,0.00007649482,0.00017980459,0.00039014083,0.00044533183,0.005297381],"genre_scores_gemma":[0.6329345,0.0007458099,0.34529516,0.00029379397,0.00018135612,0.0016093194,0.0007936206,0.00025753616,0.017888935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701595,0.0009121322,0.00021430315,0.0008515729,0.00058426615,0.00042177973],"domain_scores_gemma":[0.9961481,0.0021085977,0.00048710807,0.00027865975,0.00061478035,0.0003627185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004192494,0.0024633387,0.002049729,0.0017060929,0.0016917911,0.0033249473,0.0049845963,0.0033589385,0.00746326],"category_scores_gemma":[0.0075585106,0.0014864107,0.0023429573,0.002458717,0.0021259896,0.0036337208,0.004069229,0.0027883905,0.0013082039],"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.00008524494,0.00004152609,0.00044575328,0.00011190681,0.00005077544,0.00020813502,0.00022083649,0.9495263,0.0009478592,0.038299184,0.00096774887,0.009094836],"study_design_scores_gemma":[0.000028787743,0.000027321423,0.000074663534,0.000012477646,0.00002093081,0.000023378014,0.000023314336,0.9822222,0.00017908099,0.016356658,0.0010176891,0.000013540328],"about_ca_topic_score_codex":0.018324263,"about_ca_topic_score_gemma":0.012318509,"teacher_disagreement_score":0.018324263,"about_ca_system_score_codex":0.0033176627,"about_ca_system_score_gemma":0.0037993416,"threshold_uncertainty_score":0.036435187},"labels":[],"label_agreement":null},{"id":"W2187589363","doi":"10.1609/aaai.v28i1.8891","title":"Online (Budgeted) Social Choice","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":33,"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":"Cardinality (data modeling); Regret; Set (abstract data type); Decision maker; Combinatorics; Social choice theory; Matching (statistics); Contrast (vision); Selection (genetic algorithm); Order (exchange); Mathematics; Computer science; Binary logarithm; Mathematical optimization; Mathematical economics; Discrete mathematics; Artificial intelligence; Data mining; Operations research; Machine learning; Statistics; Economics","score_opus":0.28759561229267017,"score_gpt":0.45380007657920457,"score_spread":0.1662044642865344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187589363","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.09907216,0.0006999891,0.8687998,0.0039617675,0.00026132946,0.0007404839,0.0021235107,0.0010637727,0.023277234],"genre_scores_gemma":[0.74721855,0.00048045788,0.23131214,0.0005060484,0.0002896482,0.00069988426,0.0012445495,0.00014301165,0.018105617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99504375,0.002157991,0.00018102788,0.0012686067,0.00066574244,0.00068292604],"domain_scores_gemma":[0.99084985,0.0060558883,0.0005885656,0.0014403276,0.0003503242,0.0007150516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052453163,0.0019372469,0.002822947,0.0008521411,0.0016781674,0.0031627466,0.004663469,0.0038463697,0.020246668],"category_scores_gemma":[0.014844216,0.0010430207,0.0010955804,0.0024515453,0.0020628427,0.00787784,0.003018651,0.0028036092,0.0018931635],"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.0019419678,0.0009998715,0.0022600663,0.00041515497,0.00020853881,0.0004947177,0.00033871023,0.6778135,0.0014745166,0.20058998,0.015355512,0.09810754],"study_design_scores_gemma":[0.00021632921,0.00009520914,0.00027236223,0.000023267632,0.000026388772,0.00009031663,0.00006494161,0.86231226,0.0006969288,0.13228501,0.0038953188,0.000021660615],"about_ca_topic_score_codex":0.0046842117,"about_ca_topic_score_gemma":0.007004426,"teacher_disagreement_score":0.020246668,"about_ca_system_score_codex":0.0036025841,"about_ca_system_score_gemma":0.0024047948,"threshold_uncertainty_score":0.0677318},"labels":[],"label_agreement":null},{"id":"W2188435450","doi":"10.1609/aaai.v29i1.9665","title":"Planning Over Multi-Agent Epistemic States: A Classical Planning Approach","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Plan (archaeology); Computer science; Task (project management); Perspective (graphical); Automated planning and scheduling; Management science; Artificial intelligence; Engineering; Systems engineering","score_opus":0.1946618284340639,"score_gpt":0.33756142513053866,"score_spread":0.14289959669647476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188435450","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.0029384096,0.0004777704,0.9866251,0.0010603869,0.000038624003,0.00006591508,0.000060451497,0.00011650753,0.008616837],"genre_scores_gemma":[0.2496613,0.0013200738,0.74294865,0.00040679888,0.00017364483,0.00040985382,0.00014952912,0.00007924312,0.0048509296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978516,0.0009140549,0.0001520854,0.00032348337,0.0006089705,0.0001497981],"domain_scores_gemma":[0.99592906,0.0028707364,0.00021780259,0.00057352864,0.00026234853,0.00014638326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031337438,0.0008896671,0.0007161088,0.0014048504,0.0013695603,0.0030149121,0.0030372778,0.0017994145,0.0031140388],"category_scores_gemma":[0.0064041247,0.0008742156,0.0024739937,0.0014419443,0.006487043,0.006402125,0.0035176356,0.0035286238,0.0005237467],"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.0000214125,0.000026407568,0.0001265219,0.00012478663,0.000038487444,0.000108212385,0.00028763467,0.094621114,0.00043805523,0.88862973,0.0007149961,0.01486252],"study_design_scores_gemma":[0.000016560898,0.00001538195,0.000039686558,0.00004519666,0.00001864604,0.000037531106,0.00005545966,0.22190732,0.00050344574,0.7730502,0.004295587,0.00001506941],"about_ca_topic_score_codex":0.005305467,"about_ca_topic_score_gemma":0.007583106,"teacher_disagreement_score":0.005305467,"about_ca_system_score_codex":0.0032651841,"about_ca_system_score_gemma":0.0026859434,"threshold_uncertainty_score":0.0236907},"labels":[],"label_agreement":null},{"id":"W2189416168","doi":"10.1609/aaai.v27i1.8672","title":"A Fast Pairwise Heuristic for Planning under Uncertainty","year":2013,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","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 British Columbia","funders":"","keywords":"Partially observable Markov decision process; Heuristic; Pairwise comparison; Mathematical optimization; Bottleneck; Computer science; Greedy algorithm; Markov decision process; Sequence (biology); Markov process; Markov chain; Mathematics; Artificial intelligence; Markov model; Machine learning","score_opus":0.08542905099668778,"score_gpt":0.2954106598448335,"score_spread":0.2099816088481457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189416168","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.008614788,0.0004454281,0.9864662,0.00017859935,0.000083868836,0.00013820949,0.00011225192,0.0009808894,0.002979736],"genre_scores_gemma":[0.17935069,0.00036514562,0.81727546,0.00017477806,0.000055838456,0.00040529875,0.00044204202,0.00035901723,0.0015716427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829835,0.00063835195,0.00008432191,0.00028107438,0.000514226,0.00018360147],"domain_scores_gemma":[0.9977069,0.0016013707,0.00015687465,0.00022919422,0.00017989746,0.00012566881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021498052,0.0019423919,0.0018935456,0.0012578388,0.0011377773,0.000980133,0.001971583,0.001360251,0.005096628],"category_scores_gemma":[0.0059850174,0.0009246493,0.0017031732,0.0016123895,0.0011766443,0.002351646,0.0025000302,0.00246233,0.0007146775],"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.00020371626,0.000111027235,0.00045003422,0.00022525908,0.000094142975,0.00016278893,0.000093991905,0.80221397,0.0020882443,0.03484191,0.0039182147,0.15559663],"study_design_scores_gemma":[0.000083579245,0.00013813295,0.00011426979,0.000024970068,0.000035103927,0.0000690507,0.000031760457,0.9572545,0.0019786377,0.037859853,0.00238365,0.000026453321],"about_ca_topic_score_codex":0.004667149,"about_ca_topic_score_gemma":0.0061842096,"teacher_disagreement_score":0.005096628,"about_ca_system_score_codex":0.001524094,"about_ca_system_score_gemma":0.003797043,"threshold_uncertainty_score":0.017049849},"labels":[],"label_agreement":null},{"id":"W2189481455","doi":"10.1609/aaai.v28i1.8732","title":"Experiments on Visual Information Extraction with the Faces of Wikipedia","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Pipeline (software); Information retrieval; Focus (optics); Probabilistic logic; Information extraction; Domain (mathematical analysis); Public domain; Image (mathematics); Artificial intelligence","score_opus":0.04491529172705806,"score_gpt":0.328464405376028,"score_spread":0.28354911364896995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189481455","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.7382862,0.009680776,0.14536245,0.0020191397,0.0017322229,0.0030214204,0.020286964,0.0410695,0.038541306],"genre_scores_gemma":[0.6237444,0.0015281577,0.31606293,0.0013124198,0.0003722096,0.00091409765,0.044200517,0.0015702861,0.010294981],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99514586,0.001373519,0.00052707375,0.0013911875,0.0011663422,0.00039595034],"domain_scores_gemma":[0.9862514,0.009857788,0.00051962817,0.001641386,0.0013711213,0.00035864877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004126384,0.0025795235,0.0017240389,0.0036008356,0.0015237238,0.002043494,0.0021001208,0.0025672112,0.004565518],"category_scores_gemma":[0.019024357,0.00066869694,0.0016592123,0.0024059182,0.00094888033,0.0041019446,0.0022393963,0.0013472763,0.00364646],"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.004446911,0.0041003334,0.013303052,0.0043323208,0.0011232872,0.003210573,0.0015029574,0.04052058,0.08133589,0.002875223,0.0870287,0.75622016],"study_design_scores_gemma":[0.0009824109,0.0039118547,0.05326417,0.0007400179,0.00094625005,0.0079613,0.0030570475,0.5621206,0.26571092,0.018224033,0.08258914,0.000492222],"about_ca_topic_score_codex":0.0068742745,"about_ca_topic_score_gemma":0.006527949,"teacher_disagreement_score":0.0068742745,"about_ca_system_score_codex":0.0008246349,"about_ca_system_score_gemma":0.0005664838,"threshold_uncertainty_score":0.021822691},"labels":[],"label_agreement":null},{"id":"W2189755050","doi":"10.1609/aaai.v29i1.9329","title":"Matching with Dynamic Ordinal Preferences","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI 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 Waterloo","funders":"","keywords":"Matching (statistics); Computer science; Set (abstract data type); Mathematical optimization; Focus (optics); Mathematics; Statistics","score_opus":0.13376572984644494,"score_gpt":0.2759063819767562,"score_spread":0.14214065213031127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189755050","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.13669348,0.0004348011,0.8450851,0.0016146118,0.00012263402,0.00023047277,0.0003534898,0.00019844626,0.015266916],"genre_scores_gemma":[0.8347526,0.0003456541,0.15206544,0.0003179602,0.00011944694,0.00030970303,0.00032219535,0.000050092334,0.0117169535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99528235,0.0023736216,0.00026115926,0.0011402878,0.0005274518,0.0004151358],"domain_scores_gemma":[0.9936098,0.0036196425,0.0011611871,0.0008762191,0.00028494294,0.00044829273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037050045,0.0007437457,0.0013738896,0.0006875317,0.0009035458,0.0018385758,0.0022218346,0.0020822722,0.009166681],"category_scores_gemma":[0.01497089,0.00060352474,0.0012779223,0.0013893216,0.0014675424,0.0039145704,0.0020821742,0.0017534164,0.0010142506],"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.0003698568,0.0003003308,0.0029408406,0.00030032135,0.0002521597,0.00051998225,0.00042401123,0.22677502,0.0026570368,0.7110648,0.002291101,0.052104555],"study_design_scores_gemma":[0.00012841908,0.00018652446,0.00040976232,0.000020856176,0.000040331284,0.00016164592,0.00010677592,0.36730513,0.0007930696,0.62592566,0.0048905634,0.000031229774],"about_ca_topic_score_codex":0.00089509395,"about_ca_topic_score_gemma":0.00083602173,"teacher_disagreement_score":0.009166681,"about_ca_system_score_codex":0.0012204197,"about_ca_system_score_gemma":0.0007743517,"threshold_uncertainty_score":0.030665636},"labels":[],"label_agreement":null},{"id":"W2191266841","doi":"10.1609/aaai.v28i1.8772","title":"Modeling Argumentation and Explanation in the Social Web","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Sentiment Analysis and Opinion Mining","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":"Western University","funders":"","keywords":"Argumentation theory; Computer science; Data science; Computational sociology; Social web; Social media; World Wide Web; Epistemology","score_opus":0.09124313674391449,"score_gpt":0.3195607372196051,"score_spread":0.2283176004756906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2191266841","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.19230686,0.0016755066,0.7676877,0.007416172,0.00012698655,0.00033999182,0.00057898957,0.0004709357,0.029396845],"genre_scores_gemma":[0.87513596,0.00056684227,0.119125634,0.00020856601,0.000100997415,0.00034694548,0.00038334314,0.000051404742,0.004080352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996461,0.0024157683,0.00018945496,0.00037344996,0.0003641676,0.00019615948],"domain_scores_gemma":[0.9843709,0.013263436,0.00093054515,0.00060835027,0.00046695708,0.00035979133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043539032,0.00062666944,0.0006215703,0.0026108515,0.001339704,0.004736288,0.0015112608,0.0031599249,0.0036889182],"category_scores_gemma":[0.01531716,0.0005822229,0.0016175468,0.0018673178,0.0029223203,0.0073439805,0.0027632562,0.0020080043,0.00035530308],"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.000090304056,0.00015342643,0.0038875572,0.0001283018,0.00014920974,0.0005066019,0.0019969658,0.26405394,0.00042994664,0.70786446,0.0010129709,0.019726336],"study_design_scores_gemma":[0.000027662847,0.00001711185,0.0004766447,0.000028636903,0.000024482482,0.000055971952,0.0003581218,0.619552,0.00014544115,0.37575647,0.0035433527,0.000014073596],"about_ca_topic_score_codex":0.007430426,"about_ca_topic_score_gemma":0.006016674,"teacher_disagreement_score":0.007430426,"about_ca_system_score_codex":0.00216909,"about_ca_system_score_gemma":0.001285229,"threshold_uncertainty_score":0.02302587},"labels":[],"label_agreement":null},{"id":"W2191686679","doi":"10.1609/aaai.v28i1.8849","title":"Relaxation Search: A Simple Way of Managing Optional Clauses","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Satisfiability; Solver; Relaxation (psychology); Simple (philosophy); Computer science; Maximum satisfiability problem; Heuristic; Boolean satisfiability problem; Set (abstract data type); Task (project management); Flexibility (engineering); Algorithm; Conjunctive normal form; Mathematical optimization; Mathematics; Theoretical computer science; Artificial intelligence; Boolean function; Programming language","score_opus":0.13206539481356144,"score_gpt":0.33748093039612076,"score_spread":0.20541553558255932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2191686679","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.013649055,0.0003102553,0.9724196,0.0005052713,0.00007849819,0.0002914354,0.00027130952,0.0033044592,0.009170146],"genre_scores_gemma":[0.11637422,0.0002072581,0.8765423,0.0004841275,0.000046183828,0.0002994869,0.0006489522,0.00085822167,0.0045392434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983005,0.00067612727,0.00010877822,0.00030546266,0.00042454293,0.00018466884],"domain_scores_gemma":[0.9955094,0.0028389671,0.00034795213,0.0007654553,0.00042382133,0.000114470124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029092208,0.0012834357,0.0011915528,0.0011249743,0.00091951824,0.0018535611,0.0033180066,0.0014278602,0.014297931],"category_scores_gemma":[0.0109276185,0.0010198953,0.0014362513,0.0015719899,0.0015845802,0.00350341,0.0028981874,0.003405751,0.002174659],"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.001074541,0.00053796824,0.0027572294,0.0011684501,0.00030095835,0.0006492033,0.0009333931,0.21973202,0.03201508,0.18086642,0.03455287,0.5254119],"study_design_scores_gemma":[0.0005252843,0.00038716896,0.00054274657,0.00018346928,0.00016513141,0.0005452828,0.00023717071,0.77367216,0.031718697,0.15426138,0.037654907,0.000106493804],"about_ca_topic_score_codex":0.002181857,"about_ca_topic_score_gemma":0.0040969127,"teacher_disagreement_score":0.014297931,"about_ca_system_score_codex":0.00078403845,"about_ca_system_score_gemma":0.0020364637,"threshold_uncertainty_score":0.047831357},"labels":[],"label_agreement":null},{"id":"W2191710555","doi":"10.1609/aaai.v28i1.9099","title":"Genotypic versus Behavioural Diversity for Teams of Programs under the 4-v-3 Keepaway Soccer Task","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Evolutionary Algorithms and Applications","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":"Dalhousie University","funders":"","keywords":"Neuroevolution; Task (project management); Diversity (politics); Benchmark (surveying); Computer science; Reinforcement learning; Genetic programming; Artificial intelligence; Perspective (graphical); Function (biology); Machine learning; Variation (astronomy); Domain (mathematical analysis); Artificial neural network; Mathematics; Engineering; Biology; Sociology","score_opus":0.09984402336368582,"score_gpt":0.29562060442139904,"score_spread":0.19577658105771323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2191710555","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.9377283,0.00017125059,0.05650172,0.00032594058,0.000020923064,0.00003780091,0.00010990831,0.00007009802,0.005034038],"genre_scores_gemma":[0.98995274,0.000037512953,0.008847989,0.000032622636,0.000009956537,0.00004201304,0.00012302265,0.000027391749,0.00092680607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992599,0.00029298707,0.000028418342,0.00016894031,0.00012702023,0.00012272387],"domain_scores_gemma":[0.99455464,0.0033250588,0.00069333793,0.00039398804,0.00038363368,0.00064935314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018721118,0.00036782425,0.0004611832,0.0004906679,0.00048493344,0.0009962252,0.0007180893,0.00078834244,0.0019485024],"category_scores_gemma":[0.011185127,0.00014586243,0.00037695505,0.00024892855,0.0010340554,0.0012098639,0.0014194639,0.000898455,0.00009568671],"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.00091511355,0.00031318318,0.01668635,0.000115647614,0.000097061464,0.00021534723,0.00044675657,0.8963357,0.0063396683,0.029212011,0.0010941931,0.04822891],"study_design_scores_gemma":[0.00004126764,0.0003794619,0.0062597315,0.000018039298,0.000025374213,0.00007212148,0.0002225525,0.9709008,0.0009825847,0.020557946,0.00052206207,0.00001802578],"about_ca_topic_score_codex":0.0021723257,"about_ca_topic_score_gemma":0.0018900604,"teacher_disagreement_score":0.0021723257,"about_ca_system_score_codex":0.00090822746,"about_ca_system_score_gemma":0.00059853273,"threshold_uncertainty_score":0.009900749},"labels":[],"label_agreement":null},{"id":"W2192411834","doi":"10.1609/aaai.v29i1.9485","title":"Constructing Models of User and Task Characteristics from Eye Gaze Data for User-Adaptive Information Highlighting","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Gaze Tracking and Assistive Technology","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Visualization; Gaze; Human–computer interaction; Classifier (UML); Task (project management); Machine learning; User interface; Interface (matter); Eye tracking; Artificial intelligence; Data visualization; Information visualization","score_opus":0.1471941926282617,"score_gpt":0.30105281607366446,"score_spread":0.15385862344540277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2192411834","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.5765476,0.00080155086,0.41305405,0.0008222312,0.0000577053,0.00039627816,0.001181089,0.0059710154,0.0011683798],"genre_scores_gemma":[0.9440638,0.00017798816,0.054170817,0.000056595676,0.000016026344,0.00017831725,0.00056281965,0.00008224545,0.000691413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875474,0.0006133431,0.000069429036,0.00032290685,0.00015049365,0.000089159184],"domain_scores_gemma":[0.98790926,0.008879222,0.00093010766,0.0011331105,0.0009214312,0.00022691624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004659511,0.0010081356,0.0009327164,0.0015247283,0.00027761483,0.001127625,0.0009057308,0.0010774959,0.0013387742],"category_scores_gemma":[0.02685719,0.0005656721,0.0008942961,0.0007292291,0.000287526,0.0016975995,0.00057368743,0.0013436448,0.0008265824],"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.0019372351,0.001519566,0.16802837,0.00048148393,0.0007666416,0.00022241361,0.0015256946,0.32980552,0.035367,0.0013293995,0.00498662,0.45403007],"study_design_scores_gemma":[0.000016353784,0.00017401617,0.016734255,0.000026569076,0.000044182856,0.000047855636,0.000056906712,0.9779091,0.003605938,0.0010533539,0.0002986958,0.000032733173],"about_ca_topic_score_codex":0.009231472,"about_ca_topic_score_gemma":0.009914199,"teacher_disagreement_score":0.009231472,"about_ca_system_score_codex":0.0010179039,"about_ca_system_score_gemma":0.0009847437,"threshold_uncertainty_score":0.02464217},"labels":[],"label_agreement":null},{"id":"W2193259386","doi":"10.1609/aaai.v26i1.8401","title":"Using Sliding Windows to Generate Action Abstractions in Extensive-Form Games","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta; Compute Canada","keywords":"Abstraction; Limit (mathematics); Computer science; Action (physics); Flexibility (engineering); A priori and a posteriori; Range (aeronautics); Value (mathematics); Theoretical computer science; Algorithm; Mathematics; Machine learning; Statistics","score_opus":0.22213307891942874,"score_gpt":0.3698435559604664,"score_spread":0.14771047704103768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2193259386","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.06489643,0.00011422672,0.9309908,0.00011098613,0.000028619688,0.00015582166,0.000064686785,0.0006914877,0.0029468606],"genre_scores_gemma":[0.68731576,0.00012453941,0.30903083,0.00008399576,0.000017652634,0.00041841483,0.00017068979,0.00019990897,0.0026382098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908066,0.00032338916,0.000054964705,0.00019126074,0.00024266672,0.00010689843],"domain_scores_gemma":[0.99689317,0.0023338103,0.00018731841,0.00029670302,0.00013218756,0.00015684226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021630393,0.0011249583,0.0011108589,0.0007758533,0.00052107446,0.0010415596,0.0011995371,0.0008316954,0.0036077609],"category_scores_gemma":[0.008657959,0.0006921758,0.00086194515,0.0004373717,0.0016996582,0.0025560667,0.0022674105,0.0017610873,0.00046070447],"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.00029239152,0.00014615693,0.001396354,0.00012213127,0.00004873573,0.00017820908,0.0005322822,0.8168553,0.0066415584,0.07942764,0.0008608547,0.093498364],"study_design_scores_gemma":[0.00003132,0.00007357264,0.00012641138,0.000014773514,0.000007875375,0.000015235934,0.000032607364,0.95488614,0.0016401972,0.042409748,0.00075308676,0.000009048747],"about_ca_topic_score_codex":0.0016779996,"about_ca_topic_score_gemma":0.002430588,"teacher_disagreement_score":0.0036077609,"about_ca_system_score_codex":0.0010235435,"about_ca_system_score_gemma":0.0009157312,"threshold_uncertainty_score":0.012069106},"labels":[],"label_agreement":null},{"id":"W2193871400","doi":"10.1609/aaai.v28i1.8804","title":"Regret-Based Optimization and Preference Elicitation for Stackelberg Security Games with Uncertainty","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Infrastructure Resilience and Vulnerability Analysis","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Multidisciplinary University Research Initiative; Ministry of Education, India","keywords":"Regret; Stackelberg competition; Preference; Stochastic game; Minimax; Interval (graph theory); Mathematical economics; Mathematical optimization; Key (lock); Preference elicitation; Mathematics; Computer science; Expected utility hypothesis; Machine learning; Statistics; Computer security","score_opus":0.027557274083297664,"score_gpt":0.24402727600950666,"score_spread":0.216470001926209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2193871400","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.020134168,0.00016624539,0.97486943,0.0003491865,0.000029850533,0.00015879713,0.000105485626,0.00018079115,0.0040060594],"genre_scores_gemma":[0.63302433,0.00044302622,0.3612128,0.00027920815,0.00008529375,0.000602983,0.00032438515,0.00013832493,0.0038897088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9911452,0.0059901495,0.00032419706,0.0007850767,0.0011634267,0.000591875],"domain_scores_gemma":[0.9781568,0.017825428,0.0014714409,0.00091188046,0.00094955397,0.0006849332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009701149,0.0023721152,0.0020680705,0.0012130569,0.00084650767,0.0025483621,0.0018509455,0.0019029604,0.004272381],"category_scores_gemma":[0.029619984,0.0009216088,0.0016751112,0.0011546545,0.001643077,0.003415443,0.002605214,0.0035876266,0.0005711295],"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.00019948323,0.000115162606,0.0006544054,0.00012969138,0.00008479427,0.00005103199,0.00016726108,0.90803796,0.00078575616,0.061911594,0.0010012378,0.026861649],"study_design_scores_gemma":[0.00002112076,0.00005881382,0.0001135198,0.00001675692,0.000011279629,0.0000120491195,0.000026193202,0.95244575,0.00038890287,0.046551753,0.00033932246,0.000014412205],"about_ca_topic_score_codex":0.0033466045,"about_ca_topic_score_gemma":0.0034703873,"teacher_disagreement_score":0.009701149,"about_ca_system_score_codex":0.0034287157,"about_ca_system_score_gemma":0.0031848592,"threshold_uncertainty_score":0.051305175},"labels":[],"label_agreement":null},{"id":"W2195823538","doi":"10.1609/aaai.v26i1.8270","title":"Approximately Revenue-Maximizing Auctions for Deliberative Agents","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","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 British Columbia","funders":"Hebrew University of Jerusalem","keywords":"Common value auction; Deliberation; Leverage (statistics); Revenue; Microeconomics; Maximization; Mathematical economics; Computer science; Deliberative democracy; Upper and lower bounds; Mathematical optimization; Economics; Mathematics; Artificial intelligence; Political science; Finance; Democracy","score_opus":0.3825056263638915,"score_gpt":0.43774122359513623,"score_spread":0.055235597231244715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2195823538","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.04247113,0.00045671477,0.9442914,0.00060784334,0.000045066696,0.000080810496,0.00006225975,0.00016368036,0.0118211415],"genre_scores_gemma":[0.8141694,0.0006292466,0.17717835,0.00020401717,0.00012070454,0.00027835745,0.00012335644,0.00008326068,0.007213371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99540246,0.0027488589,0.00020165289,0.0005197622,0.00070561905,0.00042158095],"domain_scores_gemma":[0.98869437,0.008225026,0.0012444649,0.0008673745,0.0005697836,0.00039894565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048766946,0.00097512326,0.0012528779,0.00064212986,0.00072595256,0.003470397,0.0018751419,0.0016467284,0.003223716],"category_scores_gemma":[0.019373067,0.00092699844,0.00094690203,0.00091438845,0.0024431834,0.0062602423,0.0021747437,0.0020916834,0.000687508],"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.00016196747,0.000080563266,0.00032512296,0.00014325621,0.000056892655,0.00016167364,0.00020578672,0.21063568,0.0013238924,0.77263856,0.0010487708,0.013217769],"study_design_scores_gemma":[0.00003333638,0.000039646864,0.00008961346,0.000017044198,0.0000111811205,0.00004461304,0.000038392776,0.4535949,0.00046433823,0.5444873,0.001164302,0.0000152289485],"about_ca_topic_score_codex":0.0007773423,"about_ca_topic_score_gemma":0.000875426,"teacher_disagreement_score":0.0048766946,"about_ca_system_score_codex":0.0020912525,"about_ca_system_score_gemma":0.0017022864,"threshold_uncertainty_score":0.025790691},"labels":[],"label_agreement":null},{"id":"W2196283579","doi":"10.1609/aaai.v29i1.9572","title":"A Probabilistic Covariate Shift Assumption for Domain Adaptation","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","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 Waterloo","funders":"","keywords":"Covariate; Classifier (UML); Computer science; Probabilistic logic; Domain adaptation; Discriminative model; Artificial intelligence; Margin (machine learning); Labeled data; Pattern recognition (psychology); Domain (mathematical analysis); Algorithm; Machine learning; Mathematics","score_opus":0.21184496271369196,"score_gpt":0.32627189166883136,"score_spread":0.1144269289551394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2196283579","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.008746059,0.00015599551,0.9895682,0.0002991544,0.000026151965,0.00006795852,0.00007087098,0.000311158,0.00075444975],"genre_scores_gemma":[0.5628433,0.0005960858,0.42792487,0.0009208875,0.00029227015,0.00070520554,0.00095847325,0.00021885034,0.0055401013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966396,0.0011253561,0.0001881004,0.0011432931,0.0007255517,0.00017814185],"domain_scores_gemma":[0.98934025,0.005529295,0.00066568935,0.0028300583,0.0013553824,0.00027938385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051642633,0.0010044556,0.0016314004,0.00095377566,0.0010990965,0.0016238536,0.003117005,0.0026188379,0.002766104],"category_scores_gemma":[0.028097175,0.0007227362,0.0016562475,0.0013660645,0.002211233,0.0057098316,0.0037579495,0.004797015,0.0016365594],"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.00063607364,0.00033838075,0.008630219,0.00029783812,0.0002533284,0.00040761972,0.0007513537,0.49440604,0.020336738,0.1631605,0.00863143,0.3021505],"study_design_scores_gemma":[0.000031401847,0.00008001005,0.00076450134,0.000021446776,0.00002755071,0.00016008902,0.000034327786,0.9099869,0.004491756,0.08192797,0.0024455586,0.000028438793],"about_ca_topic_score_codex":0.0016292607,"about_ca_topic_score_gemma":0.0014679618,"teacher_disagreement_score":0.0051642633,"about_ca_system_score_codex":0.0011830081,"about_ca_system_score_gemma":0.0012513133,"threshold_uncertainty_score":0.027311563},"labels":[],"label_agreement":null},{"id":"W2196391751","doi":"10.1609/aaai.v29i1.9303","title":"The Pricing War Continues: On Competitive Multi-Item Pricing","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Microsoft Research","keywords":"Nash equilibrium; Submodular set function; Price of anarchy; Mathematical economics; Valuation (finance); Stochastic game; Strategy; Non-cooperative game; Game theory; Computer science; Best response; Revenue; Microeconomics; Mathematical optimization; Mathematics; Economics; Price of stability","score_opus":0.2868171920612574,"score_gpt":0.4058806962680854,"score_spread":0.11906350420682799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2196391751","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.2173382,0.003947024,0.5719646,0.010290345,0.00060327695,0.00033301662,0.00021571977,0.00018977503,0.19511798],"genre_scores_gemma":[0.95841676,0.0014185169,0.026480483,0.00083364855,0.00037439345,0.00016465089,0.00006540746,0.000093525814,0.012152551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778914,0.0011589471,0.00004742936,0.00029530458,0.0003291983,0.00037991372],"domain_scores_gemma":[0.99124384,0.0069646663,0.0003337503,0.0004676629,0.00038475596,0.00060535606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002692686,0.0014131833,0.002144009,0.00095965544,0.0017681766,0.0049483026,0.0025110536,0.0032014453,0.01008385],"category_scores_gemma":[0.015590027,0.00078453356,0.0012280523,0.0015890246,0.0053312345,0.012738835,0.002779065,0.0058258837,0.0009996054],"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.0002522442,0.00017917575,0.00045276448,0.00018048722,0.00006477068,0.00032672056,0.00040081545,0.0895966,0.0007632514,0.8858416,0.0038830955,0.018058455],"study_design_scores_gemma":[0.00006971349,0.00012451204,0.00020213153,0.000064304164,0.000030378962,0.00017230988,0.00023602648,0.28793058,0.0004947587,0.7045117,0.0061260974,0.00003748254],"about_ca_topic_score_codex":0.0020167697,"about_ca_topic_score_gemma":0.0012793362,"teacher_disagreement_score":0.01008385,"about_ca_system_score_codex":0.0024497048,"about_ca_system_score_gemma":0.0012335699,"threshold_uncertainty_score":0.033733845},"labels":[],"label_agreement":null},{"id":"W2196640769","doi":"10.1609/aaai.v29i1.9641","title":"A Generalization of Sleep Sets Based on Operator Sequence Redundancy","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; Universität Basel; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Correctness; Redundancy (engineering); Computer science; Operator (biology); Pruning; Commutative property; Sequence (biology); Generalization; Algorithm; Set (abstract data type); Sleep (system call); Mathematics; Theoretical computer science; Artificial intelligence; Discrete mathematics; Programming language","score_opus":0.13759979250461188,"score_gpt":0.31668917139525044,"score_spread":0.17908937889063856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2196640769","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.07722038,0.00039489576,0.91319454,0.00033993836,0.00009626939,0.00034610427,0.0004691138,0.002170969,0.005767772],"genre_scores_gemma":[0.43401635,0.00030611455,0.5592005,0.00045666037,0.00010142686,0.0006449134,0.0007734114,0.00051556283,0.0039850534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793774,0.0004339724,0.0002037045,0.00042303637,0.00080535124,0.00019619762],"domain_scores_gemma":[0.99262446,0.0031070567,0.0006843042,0.0025343949,0.0008316343,0.00021818175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001965474,0.0007744159,0.0011044808,0.0017842989,0.0012073099,0.0011729883,0.0024422596,0.0008394571,0.0027216298],"category_scores_gemma":[0.007920158,0.0005775174,0.0017116846,0.0013099418,0.0021036551,0.0027804845,0.0024328714,0.002011346,0.0005020339],"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.00075452455,0.00042753495,0.004998757,0.00082206924,0.00026023638,0.00079378707,0.0012916262,0.118440725,0.05495296,0.37414435,0.009480285,0.4336331],"study_design_scores_gemma":[0.00017402404,0.0010647179,0.0027971505,0.00017674411,0.0002665107,0.0012268989,0.0002492192,0.53021884,0.04532621,0.38554186,0.032805644,0.00015214022],"about_ca_topic_score_codex":0.0015321391,"about_ca_topic_score_gemma":0.0029316004,"teacher_disagreement_score":0.0027216298,"about_ca_system_score_codex":0.00079987355,"about_ca_system_score_gemma":0.0018938035,"threshold_uncertainty_score":0.010394573},"labels":[],"label_agreement":null},{"id":"W2196791692","doi":"10.1609/aaai.v29i1.9529","title":"Mining User Consumption Intention from Social Media Using Domain Adaptive Convolutional Neural Network","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":85,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Convolutional neural network; Domain (mathematical analysis); Social media; Domain adaptation; Consumption (sociology); Sentence; Adaptation (eye); Product (mathematics); Representation (politics); Task (project management); Targeted advertising; Artificial intelligence; Social network (sociolinguistics); Artificial neural network; Media consumption; Machine learning; Human–computer interaction; World Wide Web; Advertising; Psychology; Business","score_opus":0.2510960113646989,"score_gpt":0.32320578387779697,"score_spread":0.07210977251309808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2196791692","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.886843,0.0006591588,0.10470737,0.00046614022,0.000049521208,0.000109059925,0.002402107,0.0011243267,0.0036393527],"genre_scores_gemma":[0.9678105,0.00016689952,0.027684674,0.000076511846,0.000016680715,0.000059292437,0.0026643255,0.000017166221,0.001503893],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998093,0.00004260798,0.000015486725,0.00006606135,0.00003358648,0.00003295317],"domain_scores_gemma":[0.9994512,0.00028682814,0.000076693585,0.000055405562,0.000104646715,0.00002523612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041145508,0.0007524445,0.00031491826,0.0011677481,0.00019557921,0.000340918,0.00044777663,0.0004850712,0.00058850413],"category_scores_gemma":[0.0015286978,0.00024054812,0.0005459337,0.00083421107,0.00016394672,0.00066762173,0.00027653124,0.000667132,0.00027567204],"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.00090830115,0.0018263918,0.23679848,0.00035772505,0.00072408654,0.00084414496,0.00053932815,0.21086401,0.025259618,0.0025235016,0.0110182995,0.50833607],"study_design_scores_gemma":[0.0000066701514,0.00004668279,0.018075572,0.0000088375,0.000040210012,0.000040716404,0.00006908672,0.97731835,0.0028694177,0.00094590685,0.0005688764,0.000009660329],"about_ca_topic_score_codex":0.017847652,"about_ca_topic_score_gemma":0.03161308,"teacher_disagreement_score":0.017847652,"about_ca_system_score_codex":0.0007010845,"about_ca_system_score_gemma":0.00038760432,"threshold_uncertainty_score":0.035487533},"labels":[],"label_agreement":null},{"id":"W2196894019","doi":"10.1609/aaai.v28i1.8774","title":"Imputation, Social Choice, and Partial Preferences","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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":"Imputation (statistics); Outcome (game theory); Preference; Computer science; Social choice theory; Artificial intelligence; Machine learning; Psychology; Social psychology; Microeconomics; Economics; Missing data","score_opus":0.09775813191491592,"score_gpt":0.2774441489285116,"score_spread":0.17968601701359568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2196894019","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.061577983,0.00058251485,0.9231882,0.0038869223,0.00021978964,0.00014540527,0.001063295,0.00034719933,0.008988655],"genre_scores_gemma":[0.76054835,0.0005645377,0.22702654,0.00060376927,0.0005245696,0.0004372335,0.0019141973,0.00011934844,0.00826147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98683435,0.008881636,0.00054304564,0.0016038283,0.0013703299,0.0007668194],"domain_scores_gemma":[0.9371742,0.045092292,0.004968023,0.00906095,0.0024210105,0.001283476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016102655,0.0006998856,0.0023279784,0.0021405476,0.0020155734,0.0029024635,0.0036228455,0.0023752374,0.009559363],"category_scores_gemma":[0.079030916,0.0007091346,0.002003155,0.0041293474,0.0030854312,0.007495142,0.0025650924,0.0046168678,0.0013458175],"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.0010276011,0.00041515616,0.017207727,0.00032745962,0.0003485628,0.00033644328,0.0006267376,0.10148597,0.00078833185,0.7203869,0.01217332,0.14487581],"study_design_scores_gemma":[0.00007742296,0.00006547657,0.001388849,0.000045307515,0.000034341294,0.00011203563,0.00006319301,0.21251385,0.000417853,0.78291553,0.002331364,0.000034802277],"about_ca_topic_score_codex":0.002283882,"about_ca_topic_score_gemma":0.0035199462,"teacher_disagreement_score":0.016102655,"about_ca_system_score_codex":0.0015976735,"about_ca_system_score_gemma":0.0025281298,"threshold_uncertainty_score":0.08516002},"labels":[],"label_agreement":null},{"id":"W2198357760","doi":"10.1609/aaai.v29i1.9702","title":"Reward Shaping for Model-Based Bayesian Reinforcement Learning","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","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":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Defense Acquisition Program Administration; Agency for Defense Development; National Research Foundation of Korea; Ministry of Science, ICT and Future Planning; National Research Foundation","keywords":"Reinforcement learning; Benchmark (surveying); Machine learning; Computer science; Artificial intelligence; Heuristic; Bayesian probability; Function (biology); Bayes' theorem; Domain (mathematical analysis); Bayesian inference; Mathematics","score_opus":0.16860257365642317,"score_gpt":0.32334944967993895,"score_spread":0.15474687602351578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2198357760","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.008320238,0.00027505297,0.98756266,0.00028474434,0.000029429722,0.000045172612,0.0000427924,0.00032734545,0.0031126388],"genre_scores_gemma":[0.8441398,0.00036882216,0.15186793,0.00030071742,0.00005033469,0.00031663102,0.00012438605,0.00014809941,0.0026833278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833965,0.0008420249,0.00006443527,0.00022058317,0.0003854898,0.00014784191],"domain_scores_gemma":[0.99579704,0.0029666494,0.00035437912,0.00029404092,0.0003758431,0.00021217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034490433,0.0011810698,0.0014678822,0.0006258523,0.00045062474,0.0012694382,0.0017505992,0.00150083,0.0033399896],"category_scores_gemma":[0.015234772,0.0005842118,0.0005463179,0.00053673505,0.0017955201,0.0019831897,0.0019520695,0.0023843946,0.0005436678],"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.000072616946,0.000054761167,0.00028477848,0.00007880075,0.000022594304,0.000035707522,0.00006095665,0.90781164,0.00069530477,0.06605547,0.0009487285,0.023878584],"study_design_scores_gemma":[0.000011556389,0.000018280181,0.000022289461,0.000008070245,0.000002841245,0.0000056715567,0.0000028499237,0.9739354,0.00012367062,0.025595948,0.00026888365,0.0000044654407],"about_ca_topic_score_codex":0.0026384061,"about_ca_topic_score_gemma":0.00211786,"teacher_disagreement_score":0.0034490433,"about_ca_system_score_codex":0.001987776,"about_ca_system_score_gemma":0.0018477928,"threshold_uncertainty_score":0.018240452},"labels":[],"label_agreement":null},{"id":"W2200931022","doi":"10.1609/aaai.v29i1.9744","title":"On Manipulablity of Random Serial Dictatorship in Sequential Matching with Dynamic Preferences","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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":"Dictatorship; Matching (statistics); Set (abstract data type); Computer science; Algorithm; Theoretical computer science; Mathematics; Statistics; Programming language; Law; Political science","score_opus":0.13921773962528544,"score_gpt":0.28260444906647036,"score_spread":0.14338670944118492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2200931022","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.24824834,0.00085531187,0.723116,0.003134215,0.00013677722,0.0005028628,0.00023538133,0.00035664494,0.023414457],"genre_scores_gemma":[0.92856777,0.00060329854,0.06346113,0.00036837423,0.00014504249,0.000736432,0.00011985038,0.00011629178,0.005881873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9833543,0.011120001,0.00084583997,0.0020358127,0.0015004494,0.0011435387],"domain_scores_gemma":[0.8637896,0.10962346,0.012722567,0.009206143,0.002550446,0.002107847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022966973,0.0015449314,0.0031424656,0.00167409,0.0018941632,0.0041362713,0.0050869347,0.005405464,0.009008029],"category_scores_gemma":[0.11312599,0.0013818712,0.002422455,0.0018944831,0.006614763,0.009572356,0.004714871,0.0037741472,0.0008868246],"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.0004636235,0.00021207564,0.0019821047,0.00028618518,0.0002850273,0.00040597524,0.000612988,0.2363527,0.0017886028,0.73525786,0.00132,0.021032816],"study_design_scores_gemma":[0.00015778824,0.0001860509,0.00028766098,0.000042092543,0.000054874206,0.00008765713,0.00008114857,0.3802266,0.00061827846,0.61740476,0.0008043863,0.000048646416],"about_ca_topic_score_codex":0.0018734845,"about_ca_topic_score_gemma":0.0012651175,"teacher_disagreement_score":0.022966973,"about_ca_system_score_codex":0.0031758999,"about_ca_system_score_gemma":0.0028174596,"threshold_uncertainty_score":0.121462405},"labels":[],"label_agreement":null},{"id":"W2201168328","doi":"10.1609/aaai.v28i2.19033","title":"A Smart Range Helping Cognitively-Impaired Persons Cooking","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Context-Aware Activity Recognition Systems","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Dignity; Autonomy; Cognitive impairment; Human–computer interaction; Cognition; Computer science; Psychology; Internet privacy; Psychiatry","score_opus":0.09773372397844114,"score_gpt":0.28594682856922443,"score_spread":0.18821310459078328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2201168328","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.65883267,0.0016343275,0.30598155,0.0013643266,0.00048294186,0.0011428929,0.00091619784,0.010385817,0.019259354],"genre_scores_gemma":[0.7862586,0.00072092045,0.1884198,0.00068507466,0.00009195387,0.00092911266,0.00056660327,0.00020964173,0.022118213],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997918,0.000051167168,0.000011385808,0.00005057824,0.00006171627,0.000033234424],"domain_scores_gemma":[0.9996723,0.00010382521,0.000017680888,0.000056934292,0.000068835136,0.00008039335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030513562,0.00050271297,0.00040397092,0.0002896567,0.00024789898,0.00050723465,0.0011916806,0.0009534532,0.007350209],"category_scores_gemma":[0.0010670618,0.0001909331,0.0004437856,0.000110685876,0.00036057373,0.0011690987,0.0010582871,0.0004875654,0.0020547349],"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.0015280334,0.00171075,0.005585475,0.0013339418,0.00010201643,0.0025129917,0.0036519065,0.0019982173,0.48303494,0.0031029955,0.015834918,0.47960374],"study_design_scores_gemma":[0.0016031014,0.02596178,0.061254214,0.0007927878,0.0009864927,0.038187485,0.0065860897,0.08556122,0.48661974,0.0073175044,0.28432158,0.0008079206],"about_ca_topic_score_codex":0.00031390483,"about_ca_topic_score_gemma":0.0002805296,"teacher_disagreement_score":0.007350209,"about_ca_system_score_codex":0.00010316566,"about_ca_system_score_gemma":0.00018104623,"threshold_uncertainty_score":0.024588883},"labels":[],"label_agreement":null},{"id":"W2201672140","doi":"10.1609/aaai.v25i1.7918","title":"Basis Function Discovery Using Spectral Clustering and Bisimulation Metrics","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Office of Naval Research; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Adjacency list; Cluster analysis; Computer science; Basis (linear algebra); Graph; Function (biology); Theoretical computer science; Spectral clustering; State (computer science); Artificial intelligence; Data mining; Algorithm; Mathematics","score_opus":0.1564952070208593,"score_gpt":0.2914427844955239,"score_spread":0.1349475774746646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2201672140","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.028121827,0.00015764737,0.97047645,0.00016192824,0.000012597563,0.00004538521,0.000033310305,0.00025139202,0.0007394878],"genre_scores_gemma":[0.5536378,0.0002236377,0.44408962,0.00010718973,0.000037408838,0.00025152057,0.00025416393,0.00022674089,0.0011719711],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738103,0.0012554694,0.00013373057,0.00044363394,0.0006172904,0.0001688077],"domain_scores_gemma":[0.98465043,0.010901903,0.0014246416,0.0012969628,0.0012567324,0.00046935136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004374448,0.0012711593,0.002015749,0.0028758228,0.0009847324,0.0016788793,0.0020011484,0.002089462,0.0018109833],"category_scores_gemma":[0.027384205,0.00081845326,0.0012116255,0.0017149746,0.0020895316,0.0034753329,0.0029415372,0.0020345692,0.0004702256],"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.00014252671,0.00013850823,0.0018074693,0.00014083707,0.000072060386,0.0000700055,0.00020434141,0.82847255,0.0021186431,0.07948257,0.00088125304,0.086469226],"study_design_scores_gemma":[0.000006685411,0.000019933688,0.000055330078,0.0000070320557,0.000003520858,0.000009685911,0.0000073351457,0.97740424,0.00043317952,0.021922978,0.00012434094,0.0000057973784],"about_ca_topic_score_codex":0.0025537799,"about_ca_topic_score_gemma":0.0017774547,"teacher_disagreement_score":0.004374448,"about_ca_system_score_codex":0.002010852,"about_ca_system_score_gemma":0.0014437484,"threshold_uncertainty_score":0.02313453},"labels":[],"label_agreement":null},{"id":"W2203691441","doi":"10.1609/aaai.v27i2.18994","title":"Balancing the Traveling Tournament Problem for Weekday and Weekend Games","year":2013,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","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":"Quest University Canada","funders":"","keywords":"League; Tournament; Heuristics; Operations research; Scheduling (production processes); Computer science; Schedule; Advertising; Operations management; Business; Engineering; Mathematics","score_opus":0.17593365342072856,"score_gpt":0.36642870676881184,"score_spread":0.19049505334808328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2203691441","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.29552394,0.0015454219,0.65274644,0.0012153574,0.0002882996,0.00062034937,0.0014545604,0.0006079019,0.04599775],"genre_scores_gemma":[0.7945328,0.00095432246,0.19123933,0.00020065714,0.00018504894,0.00047190624,0.0022638089,0.00023383522,0.009918299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913377,0.00039592394,0.000039884715,0.0001401216,0.00010613107,0.0001841574],"domain_scores_gemma":[0.999171,0.00042098248,0.00011676477,0.00005966151,0.00009079577,0.000140896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012331553,0.0008023344,0.00085882744,0.00061002723,0.00077862974,0.0012776606,0.001290198,0.0009321567,0.0064013186],"category_scores_gemma":[0.0028943992,0.00036397766,0.00092840916,0.0008923201,0.00041218626,0.0015848541,0.000665304,0.0010605014,0.00048061917],"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.00072759186,0.00064984895,0.0032512501,0.00037350066,0.00018903882,0.00037560888,0.0002710572,0.7677948,0.0034754411,0.06689388,0.02133828,0.13465974],"study_design_scores_gemma":[0.00015963228,0.00027133682,0.002773447,0.00003657577,0.000050703242,0.00020188456,0.000266447,0.93262714,0.0009116415,0.049306028,0.013357774,0.000037474467],"about_ca_topic_score_codex":0.009593813,"about_ca_topic_score_gemma":0.010340564,"teacher_disagreement_score":0.009593813,"about_ca_system_score_codex":0.0010389566,"about_ca_system_score_gemma":0.0013903461,"threshold_uncertainty_score":0.021414578},"labels":[],"label_agreement":null},{"id":"W2203716654","doi":"10.1609/aaai.v28i2.19035","title":"Pattern Discovery in Protein Networks Reveals High-Confidence Predictions of Novel Interactions","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","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":"Queen's University","funders":"","keywords":"Computer science; Particle swarm optimization; Protein Interaction Networks; Task (project management); Artificial intelligence; Machine learning; Process (computing); Data mining; Computational biology; Protein–protein interaction; Biology; Engineering","score_opus":0.02983710357716452,"score_gpt":0.26473878248419214,"score_spread":0.23490167890702762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2203716654","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.4753058,0.0005807884,0.5194297,0.00040203438,0.00002606188,0.00005523644,0.0006033803,0.0010441561,0.0025528446],"genre_scores_gemma":[0.9501148,0.00018650941,0.048680093,0.00004096482,0.000013256113,0.000028706343,0.0006904677,0.000024434772,0.00022078927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920243,0.00018872604,0.000058251277,0.00022646801,0.00025883788,0.00006527979],"domain_scores_gemma":[0.997168,0.0017805919,0.0005201225,0.00025673935,0.00020237923,0.00007217493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009970773,0.00045821225,0.000492888,0.0022448474,0.0003560951,0.00092951115,0.0005065406,0.00064304454,0.0007540254],"category_scores_gemma":[0.0061093206,0.0002446262,0.0005862567,0.0011593418,0.0004865551,0.0013163948,0.00070243713,0.0005666072,0.0003177995],"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.0010056286,0.00036167618,0.1254681,0.0006885177,0.00054042373,0.0020010169,0.00045984096,0.53428996,0.07059884,0.022721978,0.0027848186,0.23907915],"study_design_scores_gemma":[0.000012077896,0.000061319835,0.012465539,0.000013716965,0.00003961912,0.00028343484,0.0000617868,0.96437,0.007833026,0.0140824,0.0007647525,0.000012382463],"about_ca_topic_score_codex":0.0010291036,"about_ca_topic_score_gemma":0.0011040407,"teacher_disagreement_score":0.0022448474,"about_ca_system_score_codex":0.00040881053,"about_ca_system_score_gemma":0.000350225,"threshold_uncertainty_score":0.0052731037},"labels":[],"label_agreement":null},{"id":"W2206071134","doi":"10.1609/aaai.v29i1.9364","title":"Value-Directed Compression of Large-Scale Assignment Problems","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":32,"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; Mathematical optimization; Linear programming; Population; Integer programming; Column generation; Analytics; Scale (ratio); Compression (physics); Algorithm; Data mining; Mathematics","score_opus":0.10165706352886701,"score_gpt":0.3362485228983332,"score_spread":0.23459145936946618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2206071134","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.04958553,0.0003370671,0.94350386,0.0010644865,0.00010270822,0.00018425295,0.00032727353,0.0008080939,0.004086721],"genre_scores_gemma":[0.5147845,0.00034202967,0.4789113,0.0004264995,0.00019548566,0.0006048103,0.0011103385,0.0002760565,0.003348918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883026,0.00042319493,0.0000687948,0.00020638431,0.00031066692,0.00016069043],"domain_scores_gemma":[0.99334526,0.0049020005,0.00037047916,0.00061436126,0.0005887449,0.00017913476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018794019,0.0011712288,0.0012119868,0.00086708,0.00080422155,0.0013872446,0.001660827,0.0012612285,0.0033766541],"category_scores_gemma":[0.010066557,0.0005233363,0.0007286061,0.001417813,0.0010891083,0.001974865,0.0019965474,0.0027607256,0.00049530243],"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.00018380945,0.00019147,0.0010586778,0.00015557614,0.00003163598,0.00016983988,0.00020036129,0.85821515,0.0023207336,0.029710148,0.005171685,0.1025908],"study_design_scores_gemma":[0.000021935908,0.000023452221,0.00009413491,0.000008660225,0.000004581602,0.000019655985,0.000041796742,0.975836,0.00094511686,0.02232513,0.0006753782,0.0000040838077],"about_ca_topic_score_codex":0.0033883548,"about_ca_topic_score_gemma":0.004086205,"teacher_disagreement_score":0.0033883548,"about_ca_system_score_codex":0.0012300828,"about_ca_system_score_gemma":0.0016408485,"threshold_uncertainty_score":0.011296034},"labels":[],"label_agreement":null},{"id":"W2207077672","doi":"10.1609/aaai.v29i1.9775","title":"Towards User-Adaptive Information Visualization","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Human–computer interaction; Visualization; Eye tracking; Adaptation (eye); Information visualization; Task (project management); User modeling; Gaze; User satisfaction; User interface; User interface design; Data visualization; User experience design; Artificial intelligence; Engineering","score_opus":0.12215215806384717,"score_gpt":0.33792099899056927,"score_spread":0.2157688409267221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2207077672","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.039580334,0.0010023684,0.9504931,0.001596645,0.000040083796,0.0001546839,0.00006927623,0.0039636274,0.0030999111],"genre_scores_gemma":[0.3010153,0.0010706908,0.6951089,0.00036903378,0.00008222188,0.00024967728,0.0002164511,0.00037362924,0.001514108],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9920771,0.004953424,0.00031769357,0.0011332008,0.00127292,0.00024577611],"domain_scores_gemma":[0.9814108,0.0115694795,0.00085419486,0.003503184,0.0020458463,0.0006165127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008118186,0.0011407145,0.00083236577,0.0011246739,0.00061915023,0.0052959407,0.0024175155,0.0020341983,0.0022465887],"category_scores_gemma":[0.030149698,0.0007471367,0.0008822078,0.0008382509,0.0016843003,0.0068393974,0.0042288736,0.0027041798,0.0007180205],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008973719,0.0011670131,0.019439138,0.0017717305,0.0004658453,0.0004896107,0.025185455,0.03757293,0.102838345,0.06932108,0.0113004865,0.729551],"study_design_scores_gemma":[0.00021056639,0.00083341677,0.01141628,0.0005109619,0.00027561607,0.0011359014,0.005817241,0.5991438,0.061473727,0.21174723,0.10717438,0.00026077763],"about_ca_topic_score_codex":0.0011005223,"about_ca_topic_score_gemma":0.001185639,"teacher_disagreement_score":0.008118186,"about_ca_system_score_codex":0.00063796784,"about_ca_system_score_gemma":0.00081015384,"threshold_uncertainty_score":0.042933583},"labels":[],"label_agreement":null},{"id":"W2207991438","doi":"10.1609/aaai.v29i1.9478","title":"Exploiting Determinism to Scale Relational Inference","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Inference; Computer science; Scalability; Bottleneck; Relational database; Theoretical computer science; Artificial intelligence; Machine learning; Data mining; Database","score_opus":0.1960231087494013,"score_gpt":0.33242055427119355,"score_spread":0.13639744552179225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2207991438","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.0094968835,0.00036035484,0.987347,0.0005725854,0.000030334833,0.00008308143,0.00013754965,0.0010428644,0.0009291697],"genre_scores_gemma":[0.23552713,0.00067776535,0.76087,0.00057054136,0.00012489139,0.00026855333,0.00055221614,0.00040167244,0.0010072475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9895028,0.0047271405,0.0007112932,0.0022089318,0.0024102195,0.00043958542],"domain_scores_gemma":[0.9379781,0.04559384,0.0019697645,0.012315239,0.0016184078,0.0005246867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013183397,0.0013788568,0.0021954053,0.0019780095,0.0016041289,0.0035277857,0.0042733345,0.0015756567,0.0042458368],"category_scores_gemma":[0.06882303,0.0026417421,0.0030864389,0.0022272663,0.0036389348,0.015328909,0.008821689,0.0066661267,0.0010204682],"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.0005713197,0.00025647046,0.005323305,0.0008923517,0.0006025425,0.0005239175,0.0011839543,0.39913562,0.010070827,0.27601987,0.004869562,0.30055028],"study_design_scores_gemma":[0.000049513044,0.000060025686,0.00029727948,0.000043208787,0.00007928009,0.00008932141,0.00008894271,0.6186382,0.0027256496,0.37528977,0.002599437,0.00003928307],"about_ca_topic_score_codex":0.0055174497,"about_ca_topic_score_gemma":0.010126544,"teacher_disagreement_score":0.013183397,"about_ca_system_score_codex":0.0021276646,"about_ca_system_score_gemma":0.0035411252,"threshold_uncertainty_score":0.06972134},"labels":[],"label_agreement":null},{"id":"W2208525479","doi":"10.1609/aaai.v25i1.7935","title":"Convex Sparse Coding, Subspace Learning, and Semi-Supervised Extensions","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Canada Research Chairs; University of Alberta","keywords":"Subspace topology; A priori and a posteriori; Computer science; Feature (linguistics); Artificial intelligence; Generalization; Machine learning; Neural coding; Semi-supervised learning; Supervised learning; Pattern recognition (psychology); Regular polygon; Mathematics; Artificial neural network","score_opus":0.0905704855965066,"score_gpt":0.2661249136904318,"score_spread":0.17555442809392519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2208525479","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.010238285,0.00056753185,0.9862059,0.00043261403,0.00002563233,0.000023206576,0.00009901061,0.00009624465,0.0023116027],"genre_scores_gemma":[0.6104022,0.0025473025,0.37975058,0.00043455616,0.0005292602,0.00031285523,0.0008223479,0.00013136854,0.0050695986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785066,0.0010088404,0.00008660831,0.00032138897,0.00061127153,0.00012122357],"domain_scores_gemma":[0.99260074,0.0042186747,0.00086203153,0.0013469057,0.00080470834,0.00016692208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025351632,0.0007910719,0.0011006702,0.0008571453,0.00042546724,0.0011203063,0.0014440013,0.00108186,0.0011871703],"category_scores_gemma":[0.009961443,0.0004642035,0.00065420324,0.0016451346,0.0026573401,0.0026987942,0.002250833,0.0022674839,0.00033426838],"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.000124833,0.000092056434,0.0008140428,0.00024641253,0.00006635035,0.00013745307,0.00020677054,0.45187426,0.0024274548,0.42228076,0.0039071445,0.11782235],"study_design_scores_gemma":[0.00000876238,0.00003053088,0.0001637952,0.000014786102,0.0000054767565,0.00005636993,0.000016771011,0.8122677,0.0005088992,0.18587902,0.0010357117,0.00001215016],"about_ca_topic_score_codex":0.0015871903,"about_ca_topic_score_gemma":0.001806571,"teacher_disagreement_score":0.0025351632,"about_ca_system_score_codex":0.0006409376,"about_ca_system_score_gemma":0.0009007714,"threshold_uncertainty_score":0.013407409},"labels":[],"label_agreement":null},{"id":"W221046306","doi":"10.1609/aaai.v28i1.9049","title":"Computing Contingent Plans via Fully Observable Non-Deterministic Planning","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Observability; Planner; Observable; Computer science; AKA; Automated planning and scheduling; Robotics; Key (lock); Realization (probability); Artificial intelligence; Robot; Mathematics; Computer security","score_opus":0.06584585395061208,"score_gpt":0.28404810356261573,"score_spread":0.21820224961200363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W221046306","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.035046402,0.00011765725,0.9565269,0.00033325306,0.000037965798,0.000097011485,0.00026850667,0.0030253807,0.0045469003],"genre_scores_gemma":[0.567875,0.00015743569,0.42900032,0.00009444578,0.000025379915,0.00020843488,0.0006494012,0.0003150444,0.0016744685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989213,0.00031145412,0.00007712957,0.00020214645,0.0003578823,0.0001302009],"domain_scores_gemma":[0.99518245,0.003598114,0.0002409229,0.0005990318,0.00025046428,0.00012899535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011653972,0.00073104794,0.0005055262,0.0005290706,0.0007166547,0.0012799632,0.0011567301,0.0007161286,0.0036985697],"category_scores_gemma":[0.007857949,0.0006533861,0.0012427842,0.00050967507,0.0017594292,0.0019540128,0.0023136563,0.0016370993,0.0004176367],"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.00014687749,0.00008424192,0.0012719512,0.00018928113,0.000047407233,0.000252419,0.00020239926,0.8618467,0.0026310252,0.07464995,0.0019663651,0.056711372],"study_design_scores_gemma":[0.000023597902,0.000022553468,0.00013874892,0.000013394346,0.000012305863,0.000022560482,0.00003108125,0.92349374,0.0018030329,0.07325609,0.0011740125,0.000008820289],"about_ca_topic_score_codex":0.005151303,"about_ca_topic_score_gemma":0.013405148,"teacher_disagreement_score":0.005151303,"about_ca_system_score_codex":0.0011032483,"about_ca_system_score_gemma":0.0021619957,"threshold_uncertainty_score":0.012372911},"labels":[],"label_agreement":null},{"id":"W2211066629","doi":"10.1609/aaai.v26i1.8428","title":"A Market-Based Coordination Mechanism for Resource Planning Under Uncertainty","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","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 Waterloo","funders":"","keywords":"Computer science; Resource allocation; Set (abstract data type); Mathematical optimization; Resource (disambiguation); Function (biology); Market mechanism; Order (exchange); Operations research; Economics; Mathematics","score_opus":0.21482983191129748,"score_gpt":0.3975061422860862,"score_spread":0.18267631037478874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2211066629","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.0050843563,0.00022839227,0.98857903,0.0004810504,0.00008996495,0.00013867403,0.00008615765,0.000312423,0.0049999035],"genre_scores_gemma":[0.5723093,0.0006335151,0.41729945,0.00024878548,0.00018039027,0.0007897712,0.00017092662,0.000100429024,0.00826736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986083,0.000527738,0.000089532405,0.00024336249,0.00039642715,0.00013474133],"domain_scores_gemma":[0.99835014,0.00079290563,0.00023781975,0.0001552704,0.000291317,0.00017254481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003198148,0.00065796275,0.00116793,0.0008741187,0.0012245066,0.0019825567,0.002671542,0.0014306137,0.004755886],"category_scores_gemma":[0.004660942,0.00043001343,0.0008174797,0.0011687635,0.0010745969,0.003216562,0.0019352122,0.001245995,0.0005000374],"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.00012598142,0.000119887176,0.00022845839,0.00014824886,0.000096232136,0.0002773171,0.00013427685,0.46706897,0.0033476616,0.4647201,0.0063315458,0.057401292],"study_design_scores_gemma":[0.0000660043,0.000059486334,0.00006366547,0.000016193324,0.000021113752,0.00007033825,0.000020563513,0.90936404,0.0007466564,0.08155772,0.007990761,0.000023420325],"about_ca_topic_score_codex":0.0025908465,"about_ca_topic_score_gemma":0.0030803753,"teacher_disagreement_score":0.004755886,"about_ca_system_score_codex":0.0013853868,"about_ca_system_score_gemma":0.0027956432,"threshold_uncertainty_score":0.016913593},"labels":[],"label_agreement":null},{"id":"W2212265026","doi":"10.1609/aaai.v29i2.19049","title":"Process Diagnosis System (PDS) — A 30 Year History","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Fault Detection and Control Systems","field":"Engineering","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":"University of Toronto; Siemens (Canada)","funders":"","keywords":"Siemens; Expert system; Process (computing); Software; Gas turbines; Electricity generation; Engineering; The Renaissance; Systems engineering; Popularity; Power (physics); Computer science; Manufacturing engineering; Reliability engineering; Electrical engineering; Operating system; Mechanical engineering; Artificial intelligence","score_opus":0.0714574200581008,"score_gpt":0.2596843873941534,"score_spread":0.1882269673360526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2212265026","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.017763646,0.3824882,0.39423686,0.034118038,0.007708312,0.0009514554,0.0027067733,0.012607539,0.14741918],"genre_scores_gemma":[0.16514966,0.31313625,0.3414285,0.017808018,0.009503814,0.0007941997,0.009485855,0.0017721794,0.1409215],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.997154,0.00036643678,0.00025605134,0.00056182384,0.0015085313,0.00015310507],"domain_scores_gemma":[0.99295515,0.0019799531,0.00033741572,0.0006276949,0.0035801204,0.0005197059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049406006,0.0010768228,0.00089039723,0.0028965853,0.00084049325,0.0029380636,0.0020632884,0.0024701862,0.006659547],"category_scores_gemma":[0.0068136114,0.0005994296,0.00067846524,0.0030032205,0.0019804093,0.0050395075,0.0028118358,0.0032335063,0.0062345965],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018151091,0.00017589805,0.0020304397,0.0010185264,0.000060022747,0.00015715652,0.00025177715,0.0023024743,0.0036491498,0.02469104,0.054611858,0.9108701],"study_design_scores_gemma":[0.000026169899,0.00027928886,0.0016378205,0.00049891864,0.000042624884,0.0003882967,0.000080231555,0.0057162065,0.005667154,0.006707815,0.97888845,0.00006700127],"about_ca_topic_score_codex":0.0051640654,"about_ca_topic_score_gemma":0.0019944573,"teacher_disagreement_score":0.006659547,"about_ca_system_score_codex":0.0027746612,"about_ca_system_score_gemma":0.0032316705,"threshold_uncertainty_score":0.02612871},"labels":[],"label_agreement":null},{"id":"W2212534599","doi":"10.1609/aaai.v29i1.9605","title":"Approximate MaxEnt Inverse Optimal Control and Its Application for Mental Simulation of Human Interactions","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Control Systems Optimization","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Laboratory; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Principle of maximum entropy; Inference; Bottleneck; Mathematical optimization; Dynamic programming; Context (archaeology); Approximate inference; Algorithm; Monte Carlo method; Artificial intelligence; Mathematics; Statistics","score_opus":0.06806185321690855,"score_gpt":0.3132112067488762,"score_spread":0.24514935353196765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2212534599","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.027321823,0.0001822394,0.96895885,0.0003287959,0.000029838671,0.00003178831,0.000040414707,0.00029364845,0.0028125618],"genre_scores_gemma":[0.87350315,0.00011070908,0.12434548,0.00013194495,0.000028310984,0.00017202631,0.00008251504,0.00009305354,0.0015327538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965405,0.00014980328,0.000014769636,0.000056963665,0.00008382896,0.000040681996],"domain_scores_gemma":[0.997785,0.0016457147,0.00015760674,0.00017024831,0.00016848036,0.000073030555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013506172,0.0007433178,0.00094751787,0.00060417794,0.0006070487,0.0010704799,0.0010863298,0.0011356382,0.0017242844],"category_scores_gemma":[0.007420695,0.0005688794,0.00061728567,0.00048144933,0.0016134828,0.0010820626,0.0012991144,0.0012690224,0.0001672228],"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.000023863311,0.000009100689,0.00019100637,0.000013650578,0.000008672004,0.00001718523,0.000023224091,0.98869485,0.00026904742,0.0072824364,0.00010388601,0.00336304],"study_design_scores_gemma":[8.7020436e-7,0.0000022176353,0.00001445334,9.3824315e-7,4.2965164e-7,0.0000013146449,9.500039e-7,0.9984378,0.00005960516,0.0014506388,0.000029618172,0.0000010692728],"about_ca_topic_score_codex":0.011143126,"about_ca_topic_score_gemma":0.006389698,"teacher_disagreement_score":0.011143126,"about_ca_system_score_codex":0.0013292294,"about_ca_system_score_gemma":0.0012458729,"threshold_uncertainty_score":0.022156537},"labels":[],"label_agreement":null},{"id":"W2213572082","doi":"10.1609/aaai.v27i1.8680","title":"Mixed Observability Predictive State Representations","year":2013,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Fault Detection and Control Systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Observability; Representation (politics); Computer science; Consistency (knowledge bases); Scalability; State (computer science); Imperfect; Model predictive control; Artificial intelligence; Machine learning; Algorithm; Mathematics; Control (management); Applied mathematics","score_opus":0.061702096757571705,"score_gpt":0.2646990865811969,"score_spread":0.20299698982362518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2213572082","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.012463059,0.000109470144,0.9854124,0.00013477996,0.00001823337,0.000031998115,0.000180987,0.00054311554,0.0011058861],"genre_scores_gemma":[0.8580337,0.0002059083,0.13827582,0.00013053726,0.00006222973,0.0002384752,0.00090077484,0.00007348591,0.0020790994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991339,0.00020695917,0.000053818472,0.0002419508,0.0002759278,0.00008739951],"domain_scores_gemma":[0.99733245,0.0013000484,0.00040939078,0.0005443243,0.00035466973,0.000059249447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001166149,0.0009239735,0.0011237973,0.0007907987,0.00031747518,0.0014072867,0.002187066,0.0012179287,0.0022648994],"category_scores_gemma":[0.0069252583,0.00046228507,0.00076829514,0.0009887528,0.000848833,0.0027441436,0.0016365172,0.0019535257,0.00038061987],"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.00008499267,0.000044500262,0.0009336609,0.000060659662,0.00003675744,0.00007947826,0.00006223167,0.8963073,0.0010444132,0.032505296,0.0009337436,0.067906946],"study_design_scores_gemma":[0.000003782106,0.000009460059,0.00007318471,0.000003679634,0.0000036597696,0.000007948797,0.0000034152974,0.98889273,0.00029230784,0.0105312755,0.0001750718,0.00000338132],"about_ca_topic_score_codex":0.0035023484,"about_ca_topic_score_gemma":0.0034598294,"teacher_disagreement_score":0.0035023484,"about_ca_system_score_codex":0.00078131654,"about_ca_system_score_gemma":0.0008750282,"threshold_uncertainty_score":0.0075768232},"labels":[],"label_agreement":null},{"id":"W2214660060","doi":"10.1609/aaai.v25i1.7895","title":"Adaptive Large Margin Training for Multilabel Classification","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Text and Document Classification Technologies","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","funders":"","keywords":"Margin (machine learning); Computer science; Exploit; Scalability; Categorization; Machine learning; Generalization; Classifier (UML); Artificial intelligence; Training set; Data mining; Pattern recognition (psychology); Mathematics","score_opus":0.3253993417235344,"score_gpt":0.3314708791762336,"score_spread":0.006071537452699172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2214660060","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.011308233,0.00021378182,0.9859719,0.00029197862,0.00003284857,0.00004585216,0.00009055045,0.0011391105,0.0009057312],"genre_scores_gemma":[0.41721284,0.00029350587,0.57312375,0.0006985712,0.00023300224,0.00048591202,0.0015882258,0.0007897108,0.0055744904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99643743,0.0017565149,0.00015201882,0.0007965035,0.0006197404,0.00023779234],"domain_scores_gemma":[0.9933971,0.0037197697,0.0005121395,0.0013779791,0.0007355163,0.0002574342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051879683,0.0014806174,0.0016476865,0.0010344653,0.00104788,0.0012593145,0.0034278443,0.0021811519,0.003645554],"category_scores_gemma":[0.015016617,0.00064114714,0.0010726199,0.0013428759,0.0018198219,0.004583553,0.00408839,0.004162673,0.0020691287],"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.0007034817,0.0005782457,0.0026883192,0.00025709678,0.00012715608,0.0001716279,0.00031393193,0.5211056,0.008927869,0.038945958,0.015743112,0.41043755],"study_design_scores_gemma":[0.000013753921,0.00004035873,0.00015481975,0.000009455988,0.0000058480427,0.00002773537,0.000020770773,0.96722275,0.0018371138,0.029669916,0.0009883652,0.000009138029],"about_ca_topic_score_codex":0.0014689909,"about_ca_topic_score_gemma":0.002302049,"teacher_disagreement_score":0.0051879683,"about_ca_system_score_codex":0.0012328217,"about_ca_system_score_gemma":0.0011396935,"threshold_uncertainty_score":0.027436972},"labels":[],"label_agreement":null},{"id":"W2216933343","doi":"10.1609/aaai.v25i1.7863","title":"Dominant-Strategy Auction Design for Agents with Uncertain, Private Values","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","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 British Columbia","funders":"","keywords":"Common value auction; Set (abstract data type); Class (philosophy); Auction theory; Mechanism design; Microeconomics; Forward auction; Vickrey auction; Mathematical economics; Computer science; Economics; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.4530444784868824,"score_gpt":0.4084055162750959,"score_spread":0.04463896221178648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2216933343","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.023897503,0.00048722004,0.9698584,0.00049574854,0.000040721312,0.00010299934,0.000053866574,0.000081344166,0.0049822195],"genre_scores_gemma":[0.7028865,0.0009838606,0.28722095,0.00023403685,0.000114683804,0.00046036206,0.00012464801,0.00005917773,0.00791579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955968,0.0024817719,0.0001976954,0.0004919566,0.00089292804,0.00033871125],"domain_scores_gemma":[0.9924999,0.004829194,0.0009246153,0.00065756345,0.000735119,0.00035361404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007931024,0.0011277233,0.0015810732,0.0009711393,0.00066578353,0.003930192,0.0025598796,0.0016626067,0.0023981165],"category_scores_gemma":[0.016588751,0.0009437581,0.0011664473,0.0010103004,0.0018938294,0.00464816,0.001570766,0.0017508051,0.00050290686],"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.00021663768,0.00016018421,0.00065691525,0.00031731362,0.00020474766,0.00023061039,0.00040346844,0.31892416,0.003151983,0.64240885,0.0017903709,0.031534754],"study_design_scores_gemma":[0.00009161034,0.000097803975,0.000088710454,0.000020201864,0.000040998,0.000085450505,0.00004502002,0.5464814,0.0006699962,0.45005068,0.0023084967,0.000019586107],"about_ca_topic_score_codex":0.00075117033,"about_ca_topic_score_gemma":0.00078451383,"teacher_disagreement_score":0.007931024,"about_ca_system_score_codex":0.0017716999,"about_ca_system_score_gemma":0.0021808064,"threshold_uncertainty_score":0.04194379},"labels":[],"label_agreement":null},{"id":"W2218417636","doi":"10.1609/aaai.v25i1.7925","title":"Heterogeneous Transfer Learning with RBMs","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Transfer of learning; Multi-task learning; Machine learning; Artificial intelligence; Boltzmann machine; Feature (linguistics); Task (project management); Semi-supervised learning; Feature learning; Online machine learning; Disjoint sets; Probabilistic logic; Restricted Boltzmann machine; Feature vector; Adaptation (eye); Deep learning; Mathematics","score_opus":0.09964339697449759,"score_gpt":0.2598105776249844,"score_spread":0.1601671806504868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2218417636","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.016427934,0.00035019845,0.9794519,0.0003438217,0.00005837484,0.00009222928,0.00008017017,0.0013417292,0.0018535923],"genre_scores_gemma":[0.7562898,0.00026873953,0.23552872,0.00060974766,0.00013833011,0.00058477744,0.00042715677,0.00033558565,0.0058172513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767333,0.001205063,0.00009865192,0.0005236934,0.00031140426,0.00018794673],"domain_scores_gemma":[0.996491,0.0019518503,0.00022211245,0.0007605418,0.00042373704,0.00015073779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043607606,0.0014083083,0.0020084488,0.000972197,0.00078145874,0.0013289244,0.003957685,0.0022786094,0.0044286074],"category_scores_gemma":[0.010975373,0.00078162114,0.0015304252,0.0011940825,0.0015211485,0.0035500978,0.0037130201,0.0025784995,0.0019622983],"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.00028273626,0.00025393534,0.00091525854,0.00013400373,0.00017286617,0.00018090876,0.00021664934,0.75656474,0.001987835,0.038245343,0.0031781148,0.19786756],"study_design_scores_gemma":[0.000015335254,0.000025123383,0.00005411689,0.0000046877226,0.0000071236423,0.000011596495,0.000011714284,0.9715575,0.00041666004,0.027517937,0.00037116907,0.0000070459423],"about_ca_topic_score_codex":0.003199083,"about_ca_topic_score_gemma":0.0023029977,"teacher_disagreement_score":0.0044286074,"about_ca_system_score_codex":0.0012854757,"about_ca_system_score_gemma":0.0010188144,"threshold_uncertainty_score":0.02306223},"labels":[],"label_agreement":null},{"id":"W2218835453","doi":"10.1609/aaai.v29i1.9607","title":"Online Boosting Algorithms for Anytime Transfer and Multitask Learning","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Boosting (machine learning); Computer science; Transfer of learning; Multi-task learning; Leverage (statistics); Machine learning; Artificial intelligence; Online machine learning; Instance-based learning; Semi-supervised learning; Algorithm; Task (project management)","score_opus":0.17525614189589536,"score_gpt":0.3293227549776878,"score_spread":0.15406661308179245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2218835453","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.0037558626,0.00081419887,0.99323964,0.00022636325,0.00010065982,0.00006353289,0.000051819137,0.0005813032,0.0011665641],"genre_scores_gemma":[0.28612754,0.0012679647,0.7033962,0.0006950179,0.000658154,0.0007062458,0.00071762403,0.00043298185,0.0059982473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977806,0.0009587131,0.00012412391,0.00041931635,0.00051293074,0.00020434152],"domain_scores_gemma":[0.99513996,0.0028003834,0.00028320737,0.0007886744,0.0007635668,0.00022421413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005368375,0.0015256628,0.002791435,0.0015639599,0.00093116873,0.0013877407,0.0034489857,0.0022280356,0.0046961675],"category_scores_gemma":[0.012857203,0.0006816312,0.0014268842,0.0017927514,0.0011644041,0.003043652,0.0025002456,0.0038253379,0.0025940582],"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.00028775304,0.00051109673,0.0015089286,0.00038773843,0.000206589,0.00013376324,0.00017958164,0.44818735,0.003039323,0.08064626,0.0151214115,0.4497903],"study_design_scores_gemma":[0.000026858625,0.00004934553,0.00014252115,0.000014866604,0.00001364283,0.000038864287,0.000010686486,0.94778454,0.00064098445,0.04905132,0.0022153382,0.00001104771],"about_ca_topic_score_codex":0.0015552619,"about_ca_topic_score_gemma":0.0015386635,"teacher_disagreement_score":0.005368375,"about_ca_system_score_codex":0.0011670481,"about_ca_system_score_gemma":0.0016803761,"threshold_uncertainty_score":0.028391063},"labels":[],"label_agreement":null},{"id":"W2219400200","doi":"10.1609/aaai.v29i1.9655","title":"Approximate Linear Programming for Constrained Partially Observable Markov Decision Processes","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Waterloo","funders":"Institute for Information and Communications Technology Promotion; Natural Sciences and Engineering Research Council of Canada; Ministry of Science, ICT and Future Planning","keywords":"Observable; Partially observable Markov decision process; Markov decision process; Mathematical optimization; Benchmark (surveying); Computer science; Linear programming; Suite; Sequence (biology); Dynamic programming; Controller (irrigation); State (computer science); Markov process; Mathematics; Algorithm","score_opus":0.14263682547995002,"score_gpt":0.3262468132388472,"score_spread":0.18360998775889717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2219400200","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.0135177085,0.0005408189,0.9822875,0.00032589203,0.000025788848,0.00005301585,0.00009621424,0.00028869158,0.0028642707],"genre_scores_gemma":[0.76715064,0.0007324531,0.22465959,0.00022755076,0.000060372342,0.000511608,0.00035818535,0.000157186,0.0061424645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987923,0.00059713254,0.000042853007,0.00018746831,0.0002543723,0.00012588692],"domain_scores_gemma":[0.9952413,0.004040951,0.00028727675,0.00010686628,0.0002346454,0.00008902016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018151583,0.0011392457,0.0014493245,0.00048763838,0.00040425945,0.0013001491,0.0008525918,0.0012335435,0.0036294677],"category_scores_gemma":[0.007118206,0.0007363043,0.0006227719,0.000820516,0.0013383579,0.0011153595,0.0011318108,0.002003606,0.00034293806],"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.00002965371,0.000016368791,0.00011230312,0.000038614107,0.000013626123,0.000024101693,0.000019873634,0.9809651,0.00014296795,0.013259006,0.00024638698,0.0051320004],"study_design_scores_gemma":[0.0000044890726,0.0000050093936,0.000013040314,0.0000026356595,0.0000013166043,0.0000018472043,0.000002398013,0.99177176,0.00004503551,0.008053102,0.00009818403,0.0000011479783],"about_ca_topic_score_codex":0.009674829,"about_ca_topic_score_gemma":0.009023144,"teacher_disagreement_score":0.009674829,"about_ca_system_score_codex":0.0018580297,"about_ca_system_score_gemma":0.002162361,"threshold_uncertainty_score":0.019236982},"labels":[],"label_agreement":null},{"id":"W2220382889","doi":"10.1609/aaai.v27i2.18988","title":"Interactive Information Extraction and Navigation to Enable Effective Link Analysis and Visualization of Unstructured Text","year":2013,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Scientific Computing and Data Management","field":"Decision 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":"General Dynamics (Canada)","funders":"","keywords":"Computer science; Visualization; Key (lock); Information extraction; Information retrieval; Obstacle; Interface (matter); Unstructured data; Information visualization; Imperfect; Data mining; Human–computer interaction; Big data","score_opus":0.05721025266602141,"score_gpt":0.3700182060496383,"score_spread":0.3128079533836169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2220382889","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.0137035595,0.00058012985,0.92312217,0.0009118193,0.00013767772,0.0002978948,0.0015791385,0.05195634,0.0077112517],"genre_scores_gemma":[0.061160307,0.00035368162,0.9294986,0.00028948058,0.00009248448,0.00025526652,0.0014178194,0.0019993505,0.0049329665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799925,0.00085837475,0.00017228162,0.0003654188,0.0005385904,0.000066068475],"domain_scores_gemma":[0.9841816,0.011380267,0.0006612859,0.0019278601,0.0014857529,0.00036326665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004340236,0.0010781244,0.0006139872,0.0035689098,0.0007330459,0.0033129894,0.0012464266,0.0010090787,0.013421207],"category_scores_gemma":[0.01800936,0.00066490314,0.00060681324,0.002089649,0.0007008597,0.0046549574,0.0032346821,0.0010803482,0.004829206],"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.0008131611,0.0002195737,0.0031040472,0.0014651954,0.00016303021,0.0009707495,0.0060763657,0.00403105,0.06584598,0.023703294,0.059747256,0.8338603],"study_design_scores_gemma":[0.00030349923,0.0003771983,0.005675771,0.0006179073,0.00019297215,0.0020199772,0.0016395063,0.17253543,0.10162985,0.058236632,0.6563808,0.00039050987],"about_ca_topic_score_codex":0.0011700763,"about_ca_topic_score_gemma":0.0028028283,"teacher_disagreement_score":0.013421207,"about_ca_system_score_codex":0.0003676411,"about_ca_system_score_gemma":0.0010199284,"threshold_uncertainty_score":0.04489839},"labels":[],"label_agreement":null},{"id":"W2221230328","doi":"10.1609/aaai.v29i1.9677","title":"Representing Aggregators in Relational Probabilistic Models","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","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 British Columbia","funders":"","keywords":"Statistical relational learning; Probabilistic logic; Conditional probability distribution; Set (abstract data type); Mathematics; Markov chain; Random variable; Conditional probability; Theoretical computer science; Relational model; Computer science; Variable (mathematics); Relational database; Artificial intelligence; Data mining; Machine learning; Econometrics; Statistics","score_opus":0.20935536979317007,"score_gpt":0.30977196572744703,"score_spread":0.10041659593427696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2221230328","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.005572813,0.00020876447,0.9909889,0.0005388005,0.00002986353,0.000033284876,0.00027568577,0.00028076256,0.0020711566],"genre_scores_gemma":[0.26749295,0.0011187168,0.72397006,0.00070154085,0.00024015861,0.00036612863,0.0014188364,0.00024686914,0.004444713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99249285,0.0032211104,0.0006574826,0.0016204162,0.0015670303,0.00044114192],"domain_scores_gemma":[0.9830428,0.011266528,0.0016528884,0.0025517573,0.0010780776,0.00040785753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008099945,0.0014142556,0.001299,0.0022103956,0.0015148591,0.004210809,0.0034158928,0.0019819527,0.004231236],"category_scores_gemma":[0.026162488,0.0011721925,0.0030688844,0.0038965715,0.0031773462,0.012119701,0.0059659784,0.0046962164,0.0008370209],"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.000024705123,0.000027993347,0.0006217004,0.00010345253,0.00006875702,0.00015376267,0.00038892607,0.09504801,0.00044229452,0.88322407,0.0010097382,0.018886609],"study_design_scores_gemma":[0.000009438662,0.0000107840315,0.00007202142,0.000031564963,0.000035664376,0.00004557274,0.00004860468,0.2251565,0.0003765528,0.7705315,0.0036649085,0.00001696414],"about_ca_topic_score_codex":0.007115346,"about_ca_topic_score_gemma":0.007902068,"teacher_disagreement_score":0.008099945,"about_ca_system_score_codex":0.0029918258,"about_ca_system_score_gemma":0.0016348012,"threshold_uncertainty_score":0.042837083},"labels":[],"label_agreement":null},{"id":"W22227930","doi":"10.1609/aaai.v24i1.7604","title":"Trust Models and Con-Man Agents: From Mathematical to Empirical Analysis","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Access Control and Trust","field":"Social Sciences","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Regret; Exploit; Computer science; Reputation; Probabilistic logic; Computer security; Artificial intelligence; Machine learning","score_opus":0.1330138091313569,"score_gpt":0.38264659967227566,"score_spread":0.24963279054091875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W22227930","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.12328567,0.01443,0.8110524,0.016404014,0.00015342969,0.00012279116,0.00025159479,0.00018953755,0.034110487],"genre_scores_gemma":[0.95664537,0.0071341055,0.032785684,0.00032540297,0.00023037488,0.00015632367,0.00009618559,0.000028992328,0.002597488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725264,0.0017245435,0.000105428124,0.00022440171,0.00050674466,0.00018619724],"domain_scores_gemma":[0.94825834,0.042592138,0.005028802,0.0019899283,0.001585508,0.00054538157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006853063,0.0008174805,0.0011051918,0.001866425,0.0009665585,0.0036638756,0.0012891712,0.0022414525,0.0029885436],"category_scores_gemma":[0.047138173,0.0006404873,0.000870389,0.0019908063,0.0055230907,0.007909487,0.0015742937,0.0039125076,0.0002912734],"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.000025108255,0.00007136392,0.0039298944,0.00013822071,0.0000795766,0.00013341209,0.00029117157,0.1218668,0.0001324528,0.8594238,0.0017390406,0.01216905],"study_design_scores_gemma":[0.000011911716,0.000029605411,0.0008757551,0.00007537128,0.000015280308,0.00009667247,0.00014849861,0.43190742,0.00007790531,0.5647451,0.001994374,0.000022149505],"about_ca_topic_score_codex":0.0049105757,"about_ca_topic_score_gemma":0.0028792173,"teacher_disagreement_score":0.006853063,"about_ca_system_score_codex":0.0040773656,"about_ca_system_score_gemma":0.0014328737,"threshold_uncertainty_score":0.036242902},"labels":[],"label_agreement":null},{"id":"W2223759661","doi":"10.1609/aaai.v25i1.8053","title":"Time Complexity of Iterative-Deepening A*: The Informativeness Pathology (Abstract)","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Regina","keywords":"Discretization; Discretization error; Truncation (statistics); Computer science; Line (geometry); Truncation error; Mean squared prediction error; Algorithm; Econometrics; Data science; Artificial intelligence; Applied mathematics; Machine learning; Mathematics; Mathematical analysis","score_opus":0.17527443074450133,"score_gpt":0.30825201972083616,"score_spread":0.13297758897633483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2223759661","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.48706827,0.0015253592,0.48905206,0.006296673,0.0001427833,0.00020513106,0.00056869077,0.0027850664,0.012356071],"genre_scores_gemma":[0.89871603,0.00022885564,0.09759024,0.0004527165,0.00007312099,0.00011812755,0.00041616798,0.00019992044,0.0022048317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842274,0.0006581318,0.00007990024,0.00030400162,0.00028406223,0.00025114923],"domain_scores_gemma":[0.97394896,0.022650551,0.0007514298,0.0012938884,0.0007472508,0.0006079287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004329485,0.0007499855,0.0010696189,0.0005910889,0.00072581356,0.0015742884,0.002330417,0.0015318088,0.0039092028],"category_scores_gemma":[0.021670375,0.00066839304,0.00080952287,0.0005144986,0.001503459,0.0041262642,0.0024466934,0.0027537097,0.0004114041],"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.00078318093,0.00017708103,0.0063365134,0.00027739618,0.00007493172,0.00012582267,0.00030654308,0.81006074,0.00317198,0.029449005,0.006346201,0.14289065],"study_design_scores_gemma":[0.000012693609,0.000032423173,0.00018597048,0.000008835728,0.000008254007,0.000015008537,0.000015148874,0.9875416,0.0005597616,0.011506277,0.00011093013,0.000003200699],"about_ca_topic_score_codex":0.007208904,"about_ca_topic_score_gemma":0.008664502,"teacher_disagreement_score":0.007208904,"about_ca_system_score_codex":0.0019818188,"about_ca_system_score_gemma":0.002493929,"threshold_uncertainty_score":0.022896767},"labels":[],"label_agreement":null},{"id":"W2225794812","doi":"10.1609/aaai.v25i1.7865","title":"Efficiency and Privacy Tradeoffs in Mechanism Design","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Common value auction; Private information retrieval; Variety (cybernetics); Mechanism design; Dimension (graph theory); Mechanism (biology); Key (lock); Information privacy; Outcome (game theory); Differential privacy; Computer security; Data mining; Artificial intelligence; Microeconomics","score_opus":0.3936472202184486,"score_gpt":0.37668367901652716,"score_spread":0.01696354120192145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2225794812","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.034078762,0.0038429003,0.9261228,0.010576572,0.00015048389,0.00030628673,0.0001384663,0.00016162975,0.024622131],"genre_scores_gemma":[0.77445227,0.0031339733,0.21157679,0.0014725982,0.0006499434,0.0009358024,0.00017048357,0.00021645542,0.0073917625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.919734,0.058341786,0.0030687002,0.005550086,0.010244587,0.0030607737],"domain_scores_gemma":[0.7365273,0.22321403,0.009030198,0.023691412,0.00584541,0.0016915457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.06466519,0.0021329364,0.0028722577,0.0027222706,0.0023953973,0.009205085,0.0044772974,0.006407651,0.004844511],"category_scores_gemma":[0.17531501,0.0021802534,0.0025486543,0.0031751283,0.011020299,0.02772613,0.0066144564,0.009108295,0.000956139],"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.0002674789,0.00012040409,0.0010091315,0.00026538575,0.00013649116,0.00011527429,0.00037007296,0.058724314,0.00071248505,0.9154448,0.0009025671,0.021931738],"study_design_scores_gemma":[0.00012644488,0.00016334777,0.00028246825,0.00009250932,0.000059805738,0.00018264864,0.00009406377,0.069569685,0.0010537526,0.9253925,0.002949996,0.00003276584],"about_ca_topic_score_codex":0.0005684215,"about_ca_topic_score_gemma":0.00041089204,"teacher_disagreement_score":0.06466519,"about_ca_system_score_codex":0.005663589,"about_ca_system_score_gemma":0.0036267876,"threshold_uncertainty_score":0.3419863},"labels":[],"label_agreement":null},{"id":"W2232305727","doi":"10.1609/aaai.v29i1.9700","title":"Tighter Value Function Bounds for Bayesian Reinforcement Learning","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Defense Acquisition Program Administration; Agency for Defense Development; National Research Foundation of Korea; Ministry of Science, ICT and Future Planning; National Research Foundation","keywords":"Reinforcement learning; Bayesian probability; Computer science; Heuristic; Bellman equation; Bayes' theorem; Function (biology); Perspective (graphical); Value (mathematics); Artificial intelligence; Machine learning; Mathematical optimization; Focus (optics); Mathematics","score_opus":0.09005187973659068,"score_gpt":0.2974173093581666,"score_spread":0.20736542962157595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2232305727","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.004064534,0.0004512745,0.9918521,0.00039569577,0.00004184445,0.00004397385,0.00003831208,0.00020475997,0.0029074575],"genre_scores_gemma":[0.5231126,0.0013004367,0.46856558,0.0009903042,0.00028312113,0.00084253866,0.00032627909,0.0007196479,0.0038595926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921227,0.0038148204,0.00035912718,0.0009361127,0.002098082,0.00066921185],"domain_scores_gemma":[0.9574349,0.035783462,0.0017695787,0.0020829088,0.0021423341,0.00078689767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013951349,0.0025839144,0.0032706312,0.002541065,0.0012158962,0.004452459,0.0029866048,0.0034800062,0.0062312884],"category_scores_gemma":[0.087317325,0.001537704,0.0015551413,0.0017740306,0.004484632,0.00834672,0.005587924,0.009845499,0.0011793532],"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.00009496891,0.00010353884,0.00045328742,0.00015295614,0.000052003645,0.00005051314,0.00016852493,0.7046476,0.0008358313,0.26319414,0.0016427421,0.028603863],"study_design_scores_gemma":[0.00001548075,0.000021561875,0.000048227706,0.000043470947,0.000007056229,0.00000914058,0.000010041664,0.86354184,0.00030260655,0.13547018,0.00051963946,0.000010809882],"about_ca_topic_score_codex":0.0035197006,"about_ca_topic_score_gemma":0.0033167703,"teacher_disagreement_score":0.013951349,"about_ca_system_score_codex":0.0053103734,"about_ca_system_score_gemma":0.0035410176,"threshold_uncertainty_score":0.07378268},"labels":[],"label_agreement":null},{"id":"W2240620234","doi":"10.1609/aaai.v29i1.9614","title":"Optimal Estimation of Multivariate ARMA Models","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Statistical Methods and Inference","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates; University of Alberta","keywords":"Autoregressive model; Autoregressive–moving-average model; A priori and a posteriori; Mathematics; Multivariate statistics; Estimation theory; Mathematical optimization; Maximum a posteriori estimation; Estimation; Econometrics; Computer science; Maximum likelihood; Statistics","score_opus":0.3452224946235315,"score_gpt":0.41893765224798946,"score_spread":0.07371515762445796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2240620234","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.005183206,0.00021766261,0.99333185,0.00017911254,0.000013586968,0.000012757835,0.000065346874,0.00022155634,0.0007750131],"genre_scores_gemma":[0.41866764,0.0011274465,0.573835,0.00018046006,0.00014840615,0.00022328367,0.0007461915,0.00044288894,0.004628618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791497,0.0012440108,0.000097005366,0.00035152386,0.00028107202,0.00011138937],"domain_scores_gemma":[0.99486333,0.0036397576,0.000552964,0.0003959846,0.000428168,0.00011976582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037275723,0.0010475981,0.0013829476,0.0010000698,0.00041609845,0.0016537061,0.0011011447,0.001032772,0.0024957068],"category_scores_gemma":[0.017884307,0.0008199004,0.0009879745,0.0011078977,0.0008104788,0.0019485941,0.001699278,0.0019361905,0.0008684612],"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.00007608972,0.00003190601,0.001038016,0.00011145375,0.000081294704,0.000057569443,0.00008923549,0.8459814,0.0012454934,0.07102109,0.0024602136,0.07780625],"study_design_scores_gemma":[0.0000043647806,0.000008444171,0.00016925232,0.000010923079,0.0000060018547,0.000008076901,0.000008593735,0.9672086,0.0002884221,0.03165432,0.0006244591,0.00000859185],"about_ca_topic_score_codex":0.004110476,"about_ca_topic_score_gemma":0.004251346,"teacher_disagreement_score":0.004110476,"about_ca_system_score_codex":0.0008116841,"about_ca_system_score_gemma":0.0018611283,"threshold_uncertainty_score":0.019713521},"labels":[],"label_agreement":null},{"id":"W2267902091","doi":"10.1609/aaai.v29i1.9163","title":"A New Granger Causal Model for Influence Evolution in Dynamic Social Networks: The Case of DBLP","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Université de Sherbrooke","funders":"","keywords":"Interpretability; Granger causality; Computer science; Causality (physics); Social network (sociolinguistics); Multigraph; Econometrics; Data science; Data mining; Artificial intelligence; Machine learning; Theoretical computer science; Social media; Mathematics; World Wide Web","score_opus":0.06854819209006671,"score_gpt":0.3311819870115975,"score_spread":0.2626337949215308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2267902091","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.053534288,0.0006703513,0.9375096,0.0017851979,0.000089842935,0.00006459675,0.0003813032,0.00035199258,0.0056128446],"genre_scores_gemma":[0.83726466,0.001469358,0.14784001,0.00040882584,0.0003829113,0.00029816895,0.0005099374,0.00022487964,0.011601352],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846774,0.0007237629,0.000056442477,0.00035541801,0.00024686515,0.00014972143],"domain_scores_gemma":[0.9902172,0.007414891,0.00097079546,0.0005234247,0.00059149176,0.0002822615],"candidate_categories":["bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0043557677,0.000832058,0.0010844861,0.0032775078,0.0013877552,0.0031535355,0.0027215946,0.0028242427,0.0034933668],"category_scores_gemma":[0.017623655,0.00066365115,0.0009527644,0.0033343118,0.0020615424,0.0054353895,0.0016087895,0.0027573917,0.00075597555],"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.00010542225,0.000113184,0.005262983,0.00011254518,0.00010584102,0.0006391632,0.00055131054,0.62323123,0.0007883577,0.33769906,0.003140382,0.028250603],"study_design_scores_gemma":[0.0000149457,0.000013315768,0.00026998552,0.000008373951,0.000017803724,0.000084108025,0.000038358026,0.922394,0.00007752637,0.07559562,0.0014719801,0.000013908889],"about_ca_topic_score_codex":0.013170327,"about_ca_topic_score_gemma":0.011060288,"teacher_disagreement_score":0.9967225,"about_ca_system_score_codex":0.0018018298,"about_ca_system_score_gemma":0.0013438911,"threshold_uncertainty_score":0.02618736},"labels":[],"label_agreement":null},{"id":"W2271390017","doi":"10.1609/aaai.v30i1.10026","title":"Reinstating Combinatorial Protections for Manipulation and Bribery in Single-Peaked and Nearly Single-Peaked Electorates","year":2016,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Voting; Shields; Work (physics); Microeconomics; Political science; Biology; Economics; Physics; Law; Politics; Quantum mechanics","score_opus":0.08316015348029338,"score_gpt":0.28042511857189784,"score_spread":0.19726496509160446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2271390017","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.4227397,0.0006862622,0.52114195,0.005124777,0.0002897623,0.0002805651,0.0006639219,0.001355093,0.047718037],"genre_scores_gemma":[0.96353644,0.00017499746,0.030744415,0.00044777605,0.00012153157,0.00016575411,0.00019986651,0.00022676609,0.0043824613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992018,0.0032095264,0.0004090086,0.0014366215,0.0014207647,0.0015061063],"domain_scores_gemma":[0.93945366,0.03576828,0.0043119355,0.016849933,0.0013928864,0.0022234044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062377793,0.0008794273,0.0023845024,0.0011775049,0.0020846426,0.005668403,0.0032776762,0.0022398215,0.00838314],"category_scores_gemma":[0.048125196,0.0011602809,0.0023214899,0.0010039882,0.0051587545,0.008688779,0.0075377394,0.0069897254,0.0011576943],"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.0013005777,0.00043691503,0.003789934,0.00046044096,0.00027113347,0.00051576557,0.0008619535,0.1412265,0.014163656,0.77165604,0.007732958,0.057584114],"study_design_scores_gemma":[0.0001739528,0.00018194092,0.0009190198,0.00006152438,0.00007324849,0.00029070364,0.00016316562,0.24025522,0.0061067543,0.74751997,0.0042022737,0.000052194348],"about_ca_topic_score_codex":0.00051676313,"about_ca_topic_score_gemma":0.00087063864,"teacher_disagreement_score":0.00838314,"about_ca_system_score_codex":0.0015774891,"about_ca_system_score_gemma":0.0018073656,"threshold_uncertainty_score":0.032988906},"labels":[],"label_agreement":null},{"id":"W2272644799","doi":"10.1609/aaai.v29i1.9659","title":"Information Gathering and Reward Exploitation of Subgoals for POMDPs","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Partially observable Markov decision process; Computer science; Benchmark (surveying); Solver; Time horizon; Markov decision process; Space (punctuation); State (computer science); Artificial intelligence; Machine learning; Markov chain; Markov process; Markov model; Mathematical optimization; Mathematics; Algorithm","score_opus":0.1196532880799096,"score_gpt":0.3033813658153713,"score_spread":0.18372807773546168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2272644799","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.036477037,0.00025648525,0.95982593,0.00026921905,0.000025125091,0.00016411502,0.00008704312,0.0008003504,0.0020946055],"genre_scores_gemma":[0.6215093,0.00022186656,0.37633288,0.00014363934,0.000024859477,0.00036910063,0.00021261125,0.00014641203,0.001039306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905926,0.00038562383,0.00005812917,0.0001876082,0.00019949907,0.000109892724],"domain_scores_gemma":[0.9974058,0.0018923879,0.0002707098,0.0001670195,0.00013522801,0.00012884979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019958776,0.001116921,0.0011089774,0.00060199946,0.00056896324,0.0007018175,0.0013090346,0.0009490335,0.0018501705],"category_scores_gemma":[0.005780852,0.00056215265,0.0009824305,0.00041032326,0.0013567448,0.0013926333,0.0018860616,0.0017896652,0.00025665213],"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.00012804203,0.00008767997,0.0009535943,0.00017088484,0.00004493605,0.00011002064,0.00016369001,0.92977196,0.002308069,0.020790692,0.00075447274,0.04471598],"study_design_scores_gemma":[0.000029698193,0.000040285096,0.00007960468,0.000011791424,0.000009376249,0.000013757085,0.000015480773,0.9870129,0.00088445557,0.011427252,0.00046960852,0.0000059096697],"about_ca_topic_score_codex":0.0027482703,"about_ca_topic_score_gemma":0.0032345979,"teacher_disagreement_score":0.0027482703,"about_ca_system_score_codex":0.0009202149,"about_ca_system_score_gemma":0.0018465961,"threshold_uncertainty_score":0.010555327},"labels":[],"label_agreement":null},{"id":"W2289170904","doi":"10.1609/aaai.v28i1.8828","title":"False-Name Bidding and Economic Efficiency in Combinatorial Auctions","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","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":"Combinatorial auction; Bidding; Common value auction; Vickrey–Clarke–Groves auction; Mechanism design; Incentive compatibility; Computer science; Microeconomics; Incentive; Strategic dominance; Mathematical economics; Auction theory; Economics","score_opus":0.11758609788523001,"score_gpt":0.36456612144437095,"score_spread":0.24698002355914095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289170904","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.10590714,0.0030025393,0.8128127,0.0046331016,0.0002344288,0.00017658828,0.00014174309,0.00027291058,0.072818905],"genre_scores_gemma":[0.9106839,0.0017982192,0.07273708,0.000724776,0.00033007763,0.00028584598,0.00016784128,0.00024582786,0.013026462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9833823,0.009573966,0.0006586346,0.0016123975,0.003433025,0.0013397619],"domain_scores_gemma":[0.94419193,0.040081583,0.0044702366,0.0067479564,0.0031562797,0.0013519037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014030944,0.0012550331,0.0018463342,0.0016953463,0.001369199,0.0070184786,0.003553772,0.0025483696,0.004701693],"category_scores_gemma":[0.06697807,0.0010016183,0.0015726606,0.0022139298,0.009393295,0.012812766,0.0037773652,0.004809894,0.0016592102],"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.0001291304,0.00007582966,0.00067831454,0.00009470359,0.000039461993,0.00009703082,0.00018463327,0.029751409,0.0004965834,0.9550119,0.0013671388,0.012073954],"study_design_scores_gemma":[0.000051665433,0.00003874278,0.00030546164,0.000039737406,0.000017150753,0.00012044027,0.00005625044,0.087671615,0.00046058543,0.9086795,0.0025357036,0.00002314708],"about_ca_topic_score_codex":0.00075686,"about_ca_topic_score_gemma":0.0003940443,"teacher_disagreement_score":0.014030944,"about_ca_system_score_codex":0.003208904,"about_ca_system_score_gemma":0.0018348581,"threshold_uncertainty_score":0.07420361},"labels":[],"label_agreement":null},{"id":"W2292038563","doi":"10.1609/aaai.v27i1.8528","title":"Trading Space for Time in Grid-Based Path Finding","year":2013,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Benchmark (surveying); Grid; Path (computing); Computer science; Space (punctuation); Spacetime; Mathematical optimization; Algorithm; Mathematics; Geography; Cartography","score_opus":0.07627115331290309,"score_gpt":0.2979713380072939,"score_spread":0.22170018469439084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292038563","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.10755531,0.0007288914,0.875699,0.00063011935,0.00010999048,0.00017219038,0.00028263402,0.0027340834,0.01208779],"genre_scores_gemma":[0.49517015,0.00023574315,0.50136364,0.00010190244,0.0000138973965,0.00018877031,0.00023418089,0.00027033756,0.0024214317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857867,0.0005443707,0.000108537206,0.00030119828,0.00028918535,0.00017809737],"domain_scores_gemma":[0.9953141,0.0031505967,0.00024133608,0.0007945129,0.00030556714,0.00019391603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020372227,0.00062780944,0.0011564145,0.0010120758,0.0012500832,0.0020174072,0.0019787964,0.0009912862,0.0056441696],"category_scores_gemma":[0.008322355,0.0006877807,0.0006128206,0.0015710255,0.0013316117,0.0037308873,0.0027711345,0.0012216932,0.000868575],"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.00062462484,0.00025679194,0.00312367,0.00020111889,0.000090616995,0.00014371154,0.0005465483,0.6514635,0.0035973212,0.058359936,0.0052379235,0.2763543],"study_design_scores_gemma":[0.0001522558,0.00014176907,0.00039577906,0.000024904142,0.000028918694,0.00007634582,0.00014949756,0.9468721,0.0028060442,0.044777613,0.0045484887,0.00002623047],"about_ca_topic_score_codex":0.0130507415,"about_ca_topic_score_gemma":0.018957762,"teacher_disagreement_score":0.0130507415,"about_ca_system_score_codex":0.0011611847,"about_ca_system_score_gemma":0.0026864493,"threshold_uncertainty_score":0.025949538},"labels":[],"label_agreement":null},{"id":"W2293119400","doi":"10.1609/aaai.v26i1.8137","title":"Partial-Expansion A* with Selective Node Generation","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation","keywords":"Node (physics); A priori and a posteriori; Computer science; Yield (engineering); Branching (polymer chemistry); Domain (mathematical analysis); Pathfinding; Mathematics; Mathematical optimization; Algorithm; Theoretical computer science; Graph; Engineering","score_opus":0.0722721480175147,"score_gpt":0.27603751006543265,"score_spread":0.20376536204791795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293119400","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.05461853,0.00035205937,0.9194404,0.00039777948,0.00009293685,0.00039372922,0.00046146638,0.0066682333,0.017574882],"genre_scores_gemma":[0.27189338,0.00015885309,0.7154829,0.00040561767,0.000029462311,0.00040643278,0.0010308834,0.00064373587,0.009948835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959236,0.00009217285,0.00002849791,0.000104508,0.00009919902,0.00008338622],"domain_scores_gemma":[0.9986785,0.00061662536,0.00007039068,0.00039621448,0.0001740849,0.00006421264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006995388,0.0008810914,0.00068163767,0.00078638835,0.000592495,0.0006111623,0.0020526345,0.0010633472,0.007923798],"category_scores_gemma":[0.002590383,0.00044406534,0.0010124004,0.00092460006,0.00088905054,0.0018240093,0.0026435128,0.0014209456,0.0014902488],"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.00030568102,0.00034925467,0.002586708,0.00042906427,0.00007710716,0.00037538033,0.00039548895,0.18082857,0.022333821,0.03880308,0.017750539,0.7357653],"study_design_scores_gemma":[0.00010125337,0.00023648841,0.00057024835,0.00004943027,0.000058322243,0.0003694589,0.0001254818,0.9099366,0.016759804,0.051703244,0.020060657,0.000029040022],"about_ca_topic_score_codex":0.0027078525,"about_ca_topic_score_gemma":0.0048107523,"teacher_disagreement_score":0.007923798,"about_ca_system_score_codex":0.0004612854,"about_ca_system_score_gemma":0.0013405897,"threshold_uncertainty_score":0.026507795},"labels":[],"label_agreement":null},{"id":"W2293478223","doi":"10.1609/aaai.v28i1.8850","title":"Worst-Case Solution Quality Analysis When Not Re-Expanding Nodes in Best-First Search","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Heuristic; Quality (philosophy); Weighting; Upper and lower bounds; Bounded function; Computer science; Mathematical optimization; Process (computing); Quadratic equation; Mathematics","score_opus":0.161165875110203,"score_gpt":0.35136251817553654,"score_spread":0.19019664306533354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293478223","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.16098936,0.0010922957,0.83022565,0.0007471837,0.000058996855,0.00021507748,0.00017054773,0.00076396257,0.0057369783],"genre_scores_gemma":[0.5783534,0.00033587447,0.41899905,0.00020877854,0.000024426114,0.00019498642,0.00028324616,0.0003317897,0.0012684664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99317,0.0027623528,0.00034851325,0.00075583695,0.0020220254,0.00094118324],"domain_scores_gemma":[0.96122426,0.029766567,0.00228282,0.0036417106,0.0025337467,0.00055095006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010390451,0.0010579342,0.0011884844,0.0016318455,0.00085062085,0.0024720996,0.0018601719,0.0015930277,0.002350751],"category_scores_gemma":[0.049870536,0.00096117216,0.0014856778,0.0019079816,0.0019827415,0.0034653742,0.0015362684,0.002255701,0.00042084852],"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.00053506915,0.00022578755,0.0056376494,0.00028816325,0.00016541006,0.00014231635,0.00023401936,0.8869924,0.0054602455,0.019462183,0.0014870525,0.0793698],"study_design_scores_gemma":[0.000040086998,0.00021966983,0.00097640394,0.00004262874,0.00008982097,0.00007802256,0.00010078389,0.97159857,0.0040809033,0.021884818,0.0008716651,0.000016636712],"about_ca_topic_score_codex":0.0059463494,"about_ca_topic_score_gemma":0.008785746,"teacher_disagreement_score":0.010390451,"about_ca_system_score_codex":0.002110689,"about_ca_system_score_gemma":0.0024891354,"threshold_uncertainty_score":0.054950595},"labels":[],"label_agreement":null},{"id":"W2293576044","doi":"10.1609/aaai.v26i1.8268","title":"The Deployment-to-Saturation Ratio in Security Games","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Infrastructure Resilience and Vulnerability Analysis","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; U.S. Department of Homeland Security","keywords":"Stackelberg competition; Software deployment; Computer science; Suite; Benchmark (surveying); Guard (computer science); Computation; Saturation (graph theory); Operations research; Mathematical optimization; Computer security; Theoretical computer science; Algorithm; Mathematics; Mathematical economics; Law","score_opus":0.023236857222426476,"score_gpt":0.2643852335409225,"score_spread":0.24114837631849606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293576044","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.3951016,0.0009778902,0.5752261,0.0032869924,0.0001466313,0.00045842718,0.00048481056,0.0009026308,0.023414906],"genre_scores_gemma":[0.9239979,0.0006416722,0.07181071,0.00038934863,0.00008633122,0.0003295049,0.00027344452,0.00024947603,0.0022215932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951361,0.002376473,0.00022218941,0.0008522802,0.0006253062,0.0007876547],"domain_scores_gemma":[0.9560312,0.037346836,0.0025324305,0.0013560128,0.0011171503,0.0016163224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067550694,0.0016578252,0.0015179869,0.0013813023,0.0011261082,0.0031231348,0.0020705785,0.0015229152,0.004455104],"category_scores_gemma":[0.051578425,0.0009695936,0.0013790125,0.0009785416,0.0036648489,0.006928552,0.0026606193,0.0036379131,0.0004622981],"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.0005509775,0.00026382616,0.0036915143,0.00037785285,0.00012468679,0.00018824899,0.00045717685,0.75781316,0.0036126494,0.20256442,0.0042373277,0.026118217],"study_design_scores_gemma":[0.00009044576,0.00022266562,0.00095003727,0.00006445701,0.000040119146,0.00011575296,0.0001866761,0.8349915,0.0025729174,0.15898827,0.0017390545,0.000038084516],"about_ca_topic_score_codex":0.0030925043,"about_ca_topic_score_gemma":0.0021181703,"teacher_disagreement_score":0.0067550694,"about_ca_system_score_codex":0.003365664,"about_ca_system_score_gemma":0.0026387635,"threshold_uncertainty_score":0.03572464},"labels":[],"label_agreement":null},{"id":"W2294752011","doi":"10.1609/aaai.v27i2.18982","title":"An Antimicrobial Prescription Surveillance System that Learns from Experience","year":2013,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Time Series Analysis and Forecasting","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Medical prescription; Computer science; Artificial intelligence; Machine learning; Software deployment; Exploit; Abstraction; Key (lock); Representation (politics); Function (biology); Data mining; Medicine; Computer security; Nursing; Software engineering","score_opus":0.05951961927324837,"score_gpt":0.2585104121257998,"score_spread":0.19899079285255142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294752011","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.39484534,0.0006673708,0.5421862,0.0014482923,0.0002653003,0.0007592559,0.0028950502,0.044980228,0.011952987],"genre_scores_gemma":[0.811628,0.00023769158,0.1807828,0.0004673206,0.00012482527,0.00021188565,0.0024115385,0.00020922048,0.003926708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947995,0.000082293875,0.00004622978,0.0002023882,0.00016061224,0.000028542248],"domain_scores_gemma":[0.9977628,0.0009051113,0.0002762746,0.00036569664,0.0005532977,0.00013672841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079239294,0.0005054994,0.00053982786,0.00079735083,0.00024014756,0.0007047293,0.0010415114,0.00056976726,0.0013622184],"category_scores_gemma":[0.005188625,0.00026027652,0.00026735305,0.00050051213,0.00016596913,0.0011907087,0.00051123014,0.0006164775,0.0008090821],"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.00058807165,0.001877186,0.060277373,0.00025355633,0.00021882156,0.0006478024,0.00042343314,0.044819143,0.028191907,0.002073788,0.015313265,0.84531564],"study_design_scores_gemma":[0.000058081547,0.0003414715,0.016485175,0.000028695746,0.000066756074,0.00043039044,0.0000747019,0.9565497,0.01623123,0.0023138889,0.007370577,0.000049325427],"about_ca_topic_score_codex":0.004008842,"about_ca_topic_score_gemma":0.0046835337,"teacher_disagreement_score":0.004008842,"about_ca_system_score_codex":0.0004436509,"about_ca_system_score_gemma":0.0007518263,"threshold_uncertainty_score":0.007970989},"labels":[],"label_agreement":null},{"id":"W2295179707","doi":"10.1609/aaai.v28i1.8830","title":"Using Response Functions to Measure Strategy Strength","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates; University of Alberta; Compute Canada","keywords":"Computer science; Measure (data warehouse); Nash equilibrium; Variety (cybernetics); Monte Carlo tree search; Best response; Regret; Class (philosophy); Mathematical optimization; Epsilon-equilibrium; Computation; Mathematical economics; Monte Carlo method; Mathematics; Artificial intelligence; Machine learning; Algorithm","score_opus":0.16479258411519682,"score_gpt":0.33551433261073044,"score_spread":0.17072174849553362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295179707","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.105995804,0.00034649507,0.8841573,0.00082717784,0.000060161765,0.00024120748,0.00022697993,0.00068432797,0.0074604317],"genre_scores_gemma":[0.9010215,0.00014479217,0.09570096,0.00028148608,0.000040744188,0.000370947,0.00027625522,0.00008460535,0.002078811],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9919043,0.0049975202,0.00036383278,0.0010041588,0.0012850482,0.00044509882],"domain_scores_gemma":[0.9572778,0.032184407,0.0038400353,0.0034691168,0.0021794229,0.0010492683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013290956,0.0017142083,0.0014267728,0.0026513063,0.00070746464,0.002165694,0.0023094038,0.0026315264,0.0028692235],"category_scores_gemma":[0.06473634,0.0005327787,0.001026476,0.0011695375,0.0024779637,0.004724103,0.0022603858,0.002818887,0.0007762326],"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.00048953877,0.0003527601,0.01654866,0.00018412451,0.0003084826,0.00012628615,0.00026853647,0.77821875,0.0029568793,0.103205696,0.0019825194,0.09535773],"study_design_scores_gemma":[0.000024718214,0.00015331995,0.0015413875,0.000025393474,0.000023953626,0.000052352574,0.000043983993,0.9466656,0.0012785804,0.049556,0.0006028874,0.000031820007],"about_ca_topic_score_codex":0.0014102249,"about_ca_topic_score_gemma":0.0012323604,"teacher_disagreement_score":0.013290956,"about_ca_system_score_codex":0.0018939422,"about_ca_system_score_gemma":0.0010357014,"threshold_uncertainty_score":0.07029015},"labels":[],"label_agreement":null},{"id":"W2295497133","doi":"10.1609/aaai.v26i1.8099","title":"Adaptive Polling for Information Aggregation","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Xerox Foundation; John Templeton Foundation; National Science Foundation","keywords":"Pairwise comparison; Polling; Ranking (information retrieval); Computer science; Simple (philosophy); Machine learning; Artificial intelligence; Data mining","score_opus":0.06370963450995835,"score_gpt":0.27344991805905416,"score_spread":0.2097402835490958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295497133","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.067343205,0.00049946096,0.926558,0.00059029064,0.00015078638,0.00038573102,0.00023438863,0.0015498163,0.0026882375],"genre_scores_gemma":[0.8101611,0.00011859793,0.18567032,0.0004073522,0.00020034873,0.0004930786,0.00034056586,0.00011804736,0.0024905703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99304855,0.003069075,0.0003364648,0.0019181136,0.0011548189,0.00047302796],"domain_scores_gemma":[0.9712605,0.020603053,0.0013634065,0.004997851,0.0011203295,0.00065483054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0078340545,0.0014404263,0.0033997323,0.0016339413,0.0019820386,0.0021067315,0.0039752577,0.0028862844,0.0032116475],"category_scores_gemma":[0.036166612,0.0009844501,0.0012973542,0.0019730446,0.0018236942,0.0042150677,0.0033934452,0.0027366376,0.0006715261],"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.0016553202,0.0011844721,0.013191391,0.00056513905,0.00062205625,0.0007616077,0.0019297816,0.55522543,0.015675336,0.07636832,0.009815186,0.32300603],"study_design_scores_gemma":[0.00007370394,0.00009907256,0.00064353464,0.00001534853,0.00003249355,0.000069753136,0.00006208648,0.9561716,0.0012946996,0.04038746,0.0011209025,0.000029296574],"about_ca_topic_score_codex":0.0045139603,"about_ca_topic_score_gemma":0.004989738,"teacher_disagreement_score":0.0078340545,"about_ca_system_score_codex":0.0017105907,"about_ca_system_score_gemma":0.0017127808,"threshold_uncertainty_score":0.04143095},"labels":[],"label_agreement":null},{"id":"W2295595685","doi":"10.1609/aaai.v28i1.9034","title":"Scheduling for Transfers in Pickup and Delivery Problems with Very Large Neighborhood Search","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; York University; Center for Urban Science and Progress; National Science Foundation","keywords":"Pickup; Benchmark (surveying); Computer science; Scheduling (production processes); Transfer (computing); Set (abstract data type); Mathematical optimization; Mathematics; Parallel computing; Artificial intelligence","score_opus":0.045937613441096814,"score_gpt":0.2547736107056953,"score_spread":0.2088359972645985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295595685","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.1811171,0.0007286726,0.8114939,0.0005568474,0.0000865559,0.0003073652,0.00026450664,0.00046587831,0.0049791886],"genre_scores_gemma":[0.77247274,0.0002919755,0.22204845,0.00010975615,0.000051515657,0.0005026472,0.0005820681,0.00014022103,0.003800688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991371,0.0004138029,0.000043282624,0.0001619007,0.00014885832,0.00009506675],"domain_scores_gemma":[0.99784493,0.0016185625,0.00018776763,0.000092791764,0.0001354639,0.00012033849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018198955,0.00067161315,0.0012473257,0.00062890386,0.0010661158,0.00067766395,0.0015441969,0.0009634941,0.0026352885],"category_scores_gemma":[0.005491047,0.0005634272,0.00074783014,0.00089662656,0.00079352147,0.0015685876,0.0010243151,0.001033304,0.00029268474],"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.00009100237,0.000100088095,0.0006177441,0.000055025386,0.000030857966,0.0000670038,0.000060288152,0.9744834,0.00040713628,0.006393295,0.0011794255,0.016514728],"study_design_scores_gemma":[0.00003236811,0.00006357586,0.00016868024,0.000005069379,0.000008319797,0.000017418124,0.00003767575,0.99154073,0.00025069102,0.007129019,0.00074162945,0.0000048824463],"about_ca_topic_score_codex":0.0094419075,"about_ca_topic_score_gemma":0.011964311,"teacher_disagreement_score":0.0094419075,"about_ca_system_score_codex":0.0012397328,"about_ca_system_score_gemma":0.0014503332,"threshold_uncertainty_score":0.018773913},"labels":[],"label_agreement":null},{"id":"W2295981949","doi":"10.1609/aaai.v29i1.9222","title":"Bayesian Affect Control Theory of Self","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Opinion Dynamics and Social Influence","field":"Physics and Astronomy","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Situational ethics; Identity (music); Social psychology; Affect (linguistics); Feeling; Social identity theory; Psychology; Generalization; Consistency (knowledge bases); Self; Identification (biology); Control (management); Interpersonal communication; Epistemology; Social group; Computer science; Artificial intelligence; Communication","score_opus":0.04971329757712951,"score_gpt":0.2985229693419746,"score_spread":0.2488096717648451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295981949","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.052270208,0.0019631316,0.7715716,0.007741235,0.00030386532,0.00013904946,0.0002479172,0.00023414535,0.1655289],"genre_scores_gemma":[0.9499694,0.0011128908,0.035239723,0.00077943504,0.0002702525,0.00021747708,0.000101122154,0.00004066284,0.012269072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851483,0.000522871,0.000049268823,0.0003110395,0.00048905856,0.00011285836],"domain_scores_gemma":[0.9979449,0.0010128064,0.00030933126,0.00019121611,0.0004042501,0.0001375561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021449244,0.00052035705,0.00044115365,0.0007169693,0.0006264649,0.0019411368,0.00091626827,0.00089900347,0.0044586966],"category_scores_gemma":[0.0072252243,0.0002473281,0.0005384771,0.0004361608,0.0032201188,0.0021376568,0.00092163077,0.001502292,0.000626028],"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.000034019457,0.000027794857,0.001050886,0.000048412396,0.000030262758,0.00007377913,0.00051663164,0.01583393,0.0006317311,0.9621862,0.0017708327,0.017795563],"study_design_scores_gemma":[0.000019354336,0.000026611277,0.0014233779,0.000022430173,0.000017817252,0.000070025104,0.000076245306,0.053288862,0.00016358397,0.9395434,0.005331616,0.00001666257],"about_ca_topic_score_codex":0.004461481,"about_ca_topic_score_gemma":0.0017564435,"teacher_disagreement_score":0.004461481,"about_ca_system_score_codex":0.0021068149,"about_ca_system_score_gemma":0.00075269694,"threshold_uncertainty_score":0.015286088},"labels":[],"label_agreement":null},{"id":"W2296059279","doi":"10.1609/aaai.v29i1.9375","title":"Efficient Benchmarking of Hyperparameter Optimizers via Surrogates","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":113,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Deutsche Forschungsgemeinschaft","keywords":"Hyperparameter; Hyperparameter optimization; Machine learning; Computer science; Artificial intelligence; Benchmarking; Regression; Algorithm; Support vector machine; Mathematics; Statistics","score_opus":0.09360323200453574,"score_gpt":0.298169570383572,"score_spread":0.20456633837903626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296059279","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.30889055,0.002781274,0.66503894,0.0011366887,0.0003866644,0.00034374677,0.0012806196,0.0068054916,0.013336053],"genre_scores_gemma":[0.8188611,0.0005197177,0.17520192,0.00026391266,0.000047198762,0.00045454263,0.0021189493,0.00096240453,0.0015702546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99509937,0.0025587478,0.00031012963,0.00048009842,0.0012277733,0.0003239263],"domain_scores_gemma":[0.98574984,0.008414847,0.0009686523,0.0027276445,0.0018454388,0.00029361513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007550742,0.001992469,0.0015447041,0.0016496243,0.00055577117,0.0023910895,0.0018715397,0.0022741323,0.0025117085],"category_scores_gemma":[0.03503464,0.0006933365,0.001122291,0.0016024031,0.0012200809,0.0022308466,0.0016156305,0.002827196,0.0012179015],"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.00019651158,0.00015997852,0.0020627612,0.00016659679,0.00008428016,0.000056829194,0.000050130166,0.9612257,0.0020032339,0.0060067833,0.0027241176,0.025263142],"study_design_scores_gemma":[0.00002432506,0.00008252126,0.000298037,0.00002728276,0.000007747015,0.000019557721,0.000019155059,0.99385816,0.0020169222,0.002895504,0.00073947356,0.0000112889775],"about_ca_topic_score_codex":0.0025543314,"about_ca_topic_score_gemma":0.0023163743,"teacher_disagreement_score":0.007550742,"about_ca_system_score_codex":0.0012348337,"about_ca_system_score_gemma":0.0015169869,"threshold_uncertainty_score":0.03993267},"labels":[],"label_agreement":null},{"id":"W2296203380","doi":"10.1609/aaai.v24i2.18826","title":"A Machine Learning Approach to the Detection of Fetal Hypoxia during Labor and Delivery","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning in Healthcare","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypoxia (environmental); Pathological; Fetus; Caesarean section; Pregnancy; Binary classification; Medicine; Computer science; Intensive care medicine; Artificial intelligence; Internal medicine; Biology; Support vector machine","score_opus":0.03803371074124865,"score_gpt":0.2703639622354497,"score_spread":0.23233025149420103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296203380","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.07320271,0.002138349,0.9205557,0.0014786156,0.00018813786,0.00012534451,0.00025272183,0.00044799884,0.0016104381],"genre_scores_gemma":[0.74001735,0.00089092384,0.25471014,0.0004019249,0.0005573345,0.00022613254,0.00042682793,0.00003404162,0.0027352583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906665,0.00029982845,0.00008200731,0.00027879947,0.00017761163,0.00009506657],"domain_scores_gemma":[0.99888223,0.0006741679,0.00013948191,0.00007435729,0.00018220553,0.00004759865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013459258,0.00062637415,0.0008989996,0.0014135938,0.00056203635,0.0008944111,0.00121817,0.001645864,0.0005529665],"category_scores_gemma":[0.0037019781,0.0002762785,0.00068004156,0.0010023204,0.0004957708,0.0006363531,0.00061439147,0.0011496729,0.0002770762],"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.0004729204,0.00082198024,0.023364104,0.00023329887,0.0002634269,0.00056821556,0.00035452834,0.2578888,0.01962562,0.0076927347,0.003861298,0.684853],"study_design_scores_gemma":[0.000017828184,0.00016110255,0.0040374515,0.000020198146,0.00003263923,0.00022339268,0.000053524123,0.9844914,0.002882691,0.006742373,0.0013121237,0.000025390289],"about_ca_topic_score_codex":0.0027375214,"about_ca_topic_score_gemma":0.0020946686,"teacher_disagreement_score":0.0027375214,"about_ca_system_score_codex":0.00065725483,"about_ca_system_score_gemma":0.0008164918,"threshold_uncertainty_score":0.0071180463},"labels":[],"label_agreement":null},{"id":"W2332912320","doi":"10.1609/aaai.v27i2.18995","title":"Assessing the Predictability of Hospital Readmission Using Machine Learning","year":2013,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Chronic Disease Management Strategies","field":"Medicine","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"McGill University","funders":"","keywords":"Predictability; Hospital readmission; Medicine; Demographics; Health care; Predictive power; Medical emergency; Quality (philosophy); Emergency medicine; Intensive care medicine; Statistics","score_opus":0.1173915713302513,"score_gpt":0.36587652841757345,"score_spread":0.24848495708732216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2332912320","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.9819873,0.0005373013,0.013182922,0.0013659758,0.000054328004,0.000041234936,0.0016584139,0.00019975133,0.00097280997],"genre_scores_gemma":[0.9963457,0.00009685697,0.0018887644,0.00004560723,0.000050517858,0.000011101291,0.0014435151,0.000007427249,0.00011052207],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9977349,0.0010833738,0.00026528173,0.00033868363,0.00036609784,0.0002116693],"domain_scores_gemma":[0.96811837,0.024589654,0.0038116085,0.0013066815,0.0013840377,0.0007896861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041743494,0.0007315504,0.0008244708,0.0026133512,0.0003996571,0.0013546384,0.00061181246,0.0006728191,0.0008271068],"category_scores_gemma":[0.028182205,0.00024294732,0.00072442763,0.0014388039,0.00036980727,0.0010987305,0.0006709197,0.0013185367,0.00033340428],"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.00017318522,0.00020747355,0.9397959,0.000038167775,0.00025467726,0.00008703235,0.000051988824,0.036092874,0.00020342202,0.00017706341,0.00091792207,0.022000339],"study_design_scores_gemma":[0.000018992987,0.00023116448,0.41828457,0.000038098715,0.00005818298,0.000101545724,0.00017157581,0.5775791,0.00050255714,0.0025414894,0.00044451712,0.000028305676],"about_ca_topic_score_codex":0.011783438,"about_ca_topic_score_gemma":0.01338016,"teacher_disagreement_score":0.011783438,"about_ca_system_score_codex":0.00068851124,"about_ca_system_score_gemma":0.0010307025,"threshold_uncertainty_score":0.023429751},"labels":[],"label_agreement":null},{"id":"W2394540668","doi":"10.1609/aaai.v25i1.8032","title":"Provoking Opponents to Facilitate the Recognition of their Intentions","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Adversary; Plan (archaeology); Contrast (vision); Observer (physics); Computer science; State (computer science); Psychology; Cognitive psychology; Artificial intelligence; Social psychology; Human–computer interaction; Computer security; Algorithm","score_opus":0.3161080705411999,"score_gpt":0.29375630951558374,"score_spread":0.022351761025616146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394540668","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.6990337,0.00024686626,0.24379405,0.0016750059,0.00042716743,0.0003877393,0.00007977148,0.002552422,0.051803302],"genre_scores_gemma":[0.962234,0.0000534939,0.031222994,0.0003463845,0.000033991702,0.000091909154,0.00006297378,0.00008584066,0.005868444],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993979,0.00019641855,0.00002495496,0.00014249267,0.00013518072,0.0001030312],"domain_scores_gemma":[0.99771035,0.0012936707,0.0002975949,0.0002883478,0.00016891242,0.00024120824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010138955,0.00063663675,0.00024539474,0.00015560356,0.00026667767,0.0008037201,0.0005618173,0.00075618457,0.0074887383],"category_scores_gemma":[0.005787362,0.0003116861,0.00035647344,0.000055461205,0.00068737246,0.0008927088,0.0012868287,0.0013626256,0.0011306319],"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.0019740688,0.0012883606,0.011744856,0.0004915057,0.00010793238,0.0014958632,0.0058428734,0.01328017,0.78423476,0.040018056,0.003570684,0.13595074],"study_design_scores_gemma":[0.0010808397,0.005537154,0.034568626,0.00023063454,0.00045525323,0.0020756566,0.0029147281,0.3377605,0.48688942,0.06975764,0.05842243,0.00030709174],"about_ca_topic_score_codex":0.00047012034,"about_ca_topic_score_gemma":0.0007708931,"teacher_disagreement_score":0.0074887383,"about_ca_system_score_codex":0.0002255877,"about_ca_system_score_gemma":0.00046188492,"threshold_uncertainty_score":0.025052309},"labels":[],"label_agreement":null},{"id":"W2397904553","doi":"10.1609/aaai.v26i1.8193","title":"Dynamic Multiagent Resource Allocation: Integrating Auctions and MDPs for Real-Time Decisions","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","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 Waterloo","funders":"","keywords":"Common value auction; Computer science; Resource allocation; Computation; Representation (politics); Distributed computing; Range (aeronautics); Mathematical optimization; Resource (disambiguation); Operations research; Microeconomics; Economics; Algorithm; Computer network; Mathematics","score_opus":0.1618983754936225,"score_gpt":0.3968343220710123,"score_spread":0.23493594657738984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397904553","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.0085440045,0.00041591213,0.9882895,0.0004219603,0.000049724742,0.00006428854,0.000025830483,0.0001239973,0.0020647899],"genre_scores_gemma":[0.66832787,0.0007345414,0.32774255,0.00020086818,0.0001462033,0.00026086558,0.000073624244,0.00006184918,0.00245167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787295,0.001176713,0.00011754148,0.00028931655,0.00038326386,0.0001602013],"domain_scores_gemma":[0.9962529,0.0026731195,0.0003134419,0.00024326985,0.00032984544,0.00018751096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035260026,0.00093927246,0.0015082369,0.000884635,0.0005513106,0.0023792076,0.0018813958,0.0014801684,0.0017415406],"category_scores_gemma":[0.008430331,0.0007194877,0.0008728939,0.0012914716,0.00093415676,0.0029954552,0.0019179144,0.0018550042,0.00025602302],"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.00005297968,0.000053537417,0.0002279544,0.000061857296,0.000055153712,0.00006773355,0.000049939877,0.94005394,0.00042903665,0.03501914,0.0004469929,0.02348171],"study_design_scores_gemma":[0.0000076126266,0.000012091001,0.00003120331,0.0000046781743,0.000006540639,0.00001159247,0.000007806782,0.9846481,0.00011465978,0.014743501,0.00040755657,0.0000046116324],"about_ca_topic_score_codex":0.0040607797,"about_ca_topic_score_gemma":0.0031227176,"teacher_disagreement_score":0.0040607797,"about_ca_system_score_codex":0.0013204594,"about_ca_system_score_gemma":0.0020487488,"threshold_uncertainty_score":0.018647492},"labels":[],"label_agreement":null},{"id":"W2399526712","doi":"10.1609/aaai.v27i1.8687","title":"Assumption-Based Planning: Generating Plans and Explanations under Incomplete Knowledge","year":2013,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Planner; Plan (archaeology); Computer science; Automated planning and scheduling; State (computer science); Core (optical fiber); Assertion; Translation (biology); Artificial intelligence; Algorithm","score_opus":0.11252463266994085,"score_gpt":0.30649777650549215,"score_spread":0.1939731438355513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399526712","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.014170446,0.00008021602,0.98161536,0.0004419264,0.000021001531,0.00013692197,0.00015360265,0.001170376,0.0022100902],"genre_scores_gemma":[0.22467886,0.00018649276,0.77257144,0.00017138936,0.000025819178,0.00026469416,0.0006516445,0.00013832517,0.0013112429],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807715,0.00091482804,0.00010751721,0.0003091696,0.00049004005,0.00010123761],"domain_scores_gemma":[0.9944564,0.0038789161,0.00033141713,0.0008748983,0.0003441204,0.000114104594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026907632,0.0007378739,0.00038997267,0.0008324598,0.0005252398,0.0010388508,0.0021018921,0.0009550114,0.0037993544],"category_scores_gemma":[0.01233279,0.00041899196,0.0011593866,0.0008969428,0.002223389,0.0030164046,0.0019152235,0.001433393,0.00049137115],"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.00038126024,0.00021715662,0.0027357307,0.0005663702,0.00011966337,0.0007418862,0.002122882,0.34060022,0.0064723142,0.32776746,0.0066106105,0.31166443],"study_design_scores_gemma":[0.00006690267,0.00013116306,0.00043505698,0.00009741125,0.000047909994,0.00020438604,0.0003080261,0.72356987,0.006703845,0.26129797,0.0070970226,0.00004044245],"about_ca_topic_score_codex":0.0026522886,"about_ca_topic_score_gemma":0.0034289963,"teacher_disagreement_score":0.0037993544,"about_ca_system_score_codex":0.00077324116,"about_ca_system_score_gemma":0.001762055,"threshold_uncertainty_score":0.014230311},"labels":[],"label_agreement":null},{"id":"W2399696728","doi":"10.1609/aaai.v29i1.9402","title":"A Syntax-Independent Approach to Forgetting in Disjunctive Logic Programs","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","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":"Simon Fraser University","funders":"","keywords":"Forgetting; Computer science; Logic program; Characterization (materials science); Set (abstract data type); Programming language; Syntax; Atom (system on chip); Inference; Artificial intelligence; Linguistics; Logic programming; Philosophy; Operating system; Physics","score_opus":0.13896157369015405,"score_gpt":0.3008111010752447,"score_spread":0.16184952738509067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399696728","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.011111471,0.00023701035,0.9840943,0.00038812959,0.000060616832,0.00008317894,0.0001132949,0.001703039,0.0022088508],"genre_scores_gemma":[0.21650404,0.00052073324,0.77531016,0.00087425165,0.00031684726,0.00021373501,0.0006016872,0.0010085598,0.0046499996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925882,0.0013659213,0.0006332216,0.0014838293,0.003289261,0.0006395171],"domain_scores_gemma":[0.98342705,0.0075016757,0.000808304,0.0061385217,0.0018046868,0.00031977307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051567233,0.0010799633,0.0011361516,0.0022294142,0.0012141527,0.0035484387,0.005470442,0.0016030311,0.004257262],"category_scores_gemma":[0.0151228,0.0013520161,0.0044111474,0.0019898005,0.0047307573,0.011285913,0.0062330575,0.0068401783,0.000788014],"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.00036920872,0.00024144343,0.0022504402,0.00076310476,0.00018932912,0.00072236155,0.0018975092,0.04481166,0.020828892,0.69919974,0.0036580104,0.22506835],"study_design_scores_gemma":[0.00007246568,0.0001466155,0.00045557253,0.00011504987,0.00026432378,0.00059804606,0.00016549464,0.16516125,0.037779205,0.7739008,0.02123931,0.000101881495],"about_ca_topic_score_codex":0.0013930007,"about_ca_topic_score_gemma":0.0019753557,"teacher_disagreement_score":0.005470442,"about_ca_system_score_codex":0.001721645,"about_ca_system_score_gemma":0.00171673,"threshold_uncertainty_score":0.027271688},"labels":[],"label_agreement":null},{"id":"W2399880602","doi":"10.1609/aaai.v31i1.10983","title":"A Hierarchical Latent Variable Encoder-Decoder Model for Generating Dialogues","year":2017,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":266,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; McGill University; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Samsung; Compute Canada; Samsung Advanced Institute of Technology; Canadian Institute for Advanced Research","keywords":"Computer science; Latent variable; Generative grammar; Generative model; Latent variable model; Artificial intelligence; Context (archaeology); Variable (mathematics); Artificial neural network; Process (computing); Encoder; Machine learning; Task (project management); Mathematics; Engineering","score_opus":0.21650778029913978,"score_gpt":0.3321390255953345,"score_spread":0.1156312452961947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399880602","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.015738621,0.00027063556,0.98024726,0.0004614954,0.000065031985,0.000073460884,0.00034970941,0.0011700786,0.0016237025],"genre_scores_gemma":[0.62573504,0.00037100888,0.36162838,0.00032088428,0.00014098587,0.00054607977,0.0012538747,0.00034758492,0.009656114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991054,0.00045487037,0.000039564453,0.00021828999,0.0001127911,0.00006908795],"domain_scores_gemma":[0.99777204,0.0016767952,0.00011540562,0.00014617297,0.00021177533,0.000077816905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018265644,0.000785258,0.0006308528,0.00066649966,0.0004003156,0.0008479111,0.00156732,0.0013519607,0.004114923],"category_scores_gemma":[0.0058167074,0.0006030776,0.00086720847,0.000783503,0.0006976786,0.0014624656,0.0010498702,0.0020712218,0.001402666],"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.000594786,0.00019414887,0.0021408552,0.00026408187,0.00013910637,0.00031589676,0.0008445431,0.7428105,0.010041214,0.08645752,0.005839127,0.15035823],"study_design_scores_gemma":[0.000014451246,0.00001772841,0.00007847111,0.000005349767,0.000009764588,0.000023355993,0.000008004518,0.9899182,0.0004981742,0.008949878,0.00047022421,0.0000064119804],"about_ca_topic_score_codex":0.0048897774,"about_ca_topic_score_gemma":0.007904901,"teacher_disagreement_score":0.0048897774,"about_ca_system_score_codex":0.0009869706,"about_ca_system_score_gemma":0.0011937665,"threshold_uncertainty_score":0.013765812},"labels":[],"label_agreement":null},{"id":"W2399952684","doi":"10.1609/aaai.v25i1.8060","title":"Extending the Applications of Recent Real-Time Heuristic Search","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pathfinding; Incremental heuristic search; Computer science; Heuristic; Property (philosophy); Search algorithm; Beam search; Space (punctuation); Theoretical computer science; Artificial intelligence; Algorithm","score_opus":0.14950089952854162,"score_gpt":0.33305114734217656,"score_spread":0.18355024781363494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399952684","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.036910456,0.007909447,0.92538226,0.001116876,0.0003924116,0.00018089474,0.00012500994,0.0013335793,0.026649049],"genre_scores_gemma":[0.4451853,0.005860028,0.54213643,0.00059764547,0.0004971513,0.00021478326,0.00033647937,0.000351971,0.004820095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979777,0.0006878077,0.0001411102,0.00039118945,0.00069827936,0.00010398117],"domain_scores_gemma":[0.991025,0.0050828103,0.00053778075,0.002010785,0.0011217708,0.00022196471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024919903,0.0010347491,0.00080517656,0.0015639843,0.0005692494,0.0018369132,0.0029784518,0.0011289928,0.0055164737],"category_scores_gemma":[0.016236113,0.00039010672,0.0007631574,0.0020129075,0.0013378704,0.003127608,0.0019471091,0.001306065,0.0011231952],"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.00025427528,0.0003503288,0.0020933724,0.0006200887,0.0001395316,0.00016352694,0.0002894746,0.19912374,0.005383295,0.09557189,0.0041877013,0.69182277],"study_design_scores_gemma":[0.000112426715,0.00035676535,0.000914018,0.00011490728,0.00009480552,0.00052160845,0.0001072593,0.8711261,0.00573838,0.08189742,0.038966794,0.00004943128],"about_ca_topic_score_codex":0.0032938386,"about_ca_topic_score_gemma":0.0026142234,"teacher_disagreement_score":0.0055164737,"about_ca_system_score_codex":0.000962826,"about_ca_system_score_gemma":0.0012671315,"threshold_uncertainty_score":0.018454432},"labels":[],"label_agreement":null},{"id":"W2401722941","doi":"10.1609/aaai.v25i1.7815","title":"Euclidean Heuristic Optimization","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Heuristic; Mathematical optimization; Optimization problem; Consistency (knowledge bases); Computer science; Reduction (mathematics); Euclidean geometry; Dimensionality reduction; Mathematics; Artificial intelligence","score_opus":0.1529758557561552,"score_gpt":0.30765553793865236,"score_spread":0.15467968218249717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401722941","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.008573409,0.00091151963,0.97369814,0.00043600987,0.00008640828,0.000094482464,0.00017211173,0.00026439724,0.015763508],"genre_scores_gemma":[0.3279565,0.0011516246,0.65715766,0.00056686864,0.000118193515,0.00045801688,0.0007107421,0.0002898854,0.011590459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822766,0.0007862937,0.00010726057,0.00031180348,0.00041317948,0.0001538824],"domain_scores_gemma":[0.9969183,0.0019312745,0.0002454172,0.000456767,0.00033734023,0.00011078965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024465094,0.00129504,0.0012863753,0.0014567391,0.0005726241,0.0020031417,0.001860534,0.002038237,0.0058438377],"category_scores_gemma":[0.010456379,0.0005681618,0.0009995302,0.0016681381,0.0019020919,0.0019993645,0.0018034497,0.001807702,0.0012421323],"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.00008245164,0.000066644396,0.00045638916,0.0002826759,0.00008474052,0.00007689509,0.00009461316,0.6748982,0.0009801713,0.23211895,0.005085743,0.08577254],"study_design_scores_gemma":[0.00003234026,0.00007064112,0.00013235136,0.000060729435,0.000024370327,0.000048005302,0.000035003526,0.8698867,0.00082712894,0.12310225,0.0057632136,0.000017224582],"about_ca_topic_score_codex":0.001875431,"about_ca_topic_score_gemma":0.0018944056,"teacher_disagreement_score":0.0058438377,"about_ca_system_score_codex":0.0021386386,"about_ca_system_score_gemma":0.0016279372,"threshold_uncertainty_score":0.019549608},"labels":[],"label_agreement":null},{"id":"W2402248766","doi":"10.1609/aaai.v25i1.7954","title":"Recommendation Sets and Choice Queries: There Is No Exploration/Exploitation Tradeoff!","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Bandit Algorithms Research","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 Toronto","funders":"","keywords":"Regret; Recommender system; Computer science; Set (abstract data type); Preference elicitation; Bayesian probability; Component (thermodynamics); Function (biology); Query optimization; Information retrieval; Data mining; Artificial intelligence; Machine learning; Preference; Mathematics","score_opus":0.46823225723104683,"score_gpt":0.4411107119125127,"score_spread":0.027121545318534113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402248766","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.04231053,0.002468155,0.9052324,0.022210397,0.00015040608,0.00029492768,0.00043445802,0.00029898016,0.02659971],"genre_scores_gemma":[0.70884126,0.0021971213,0.27445802,0.0033236945,0.00079776044,0.0010141705,0.00064564386,0.00036290346,0.008359426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96547914,0.024392748,0.0011620028,0.0026132436,0.0053403545,0.0010124875],"domain_scores_gemma":[0.83248556,0.14718631,0.0044347676,0.010825048,0.0030041311,0.0020643089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0287375,0.0013060624,0.0028764834,0.0012512052,0.0017646049,0.00811733,0.0031459522,0.0073940107,0.012550054],"category_scores_gemma":[0.15877013,0.0015741833,0.0016150645,0.0026590277,0.005890809,0.023276687,0.0052534086,0.008563961,0.0016335081],"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.00074419647,0.00028175942,0.0021412405,0.0003933386,0.00022790911,0.00013788679,0.00084853446,0.05238029,0.00080723077,0.8668938,0.0052929316,0.06985091],"study_design_scores_gemma":[0.00010616014,0.00010088166,0.000462345,0.00007501373,0.000032297357,0.00014101162,0.00013098617,0.09661156,0.0004208533,0.8990959,0.0027922862,0.000030738458],"about_ca_topic_score_codex":0.001215561,"about_ca_topic_score_gemma":0.0010345313,"teacher_disagreement_score":0.0287375,"about_ca_system_score_codex":0.002961618,"about_ca_system_score_gemma":0.0022042182,"threshold_uncertainty_score":0.15198022},"labels":[],"label_agreement":null},{"id":"W2402343526","doi":"10.1609/aaai.v26i1.8147","title":"From Streamlined Combinatorial Search to Efficient Constructive Procedures","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorial explosion; Constructive; Constraint satisfaction problem; Computation; Combinatorial search; Combinatorial optimization; Computer science; Mathematics; Theoretical computer science; Series (stratigraphy); Algebra over a field; Combinatorics; Search algorithm; Algorithm; Artificial intelligence; Pure mathematics; Beam search","score_opus":0.032262152350743464,"score_gpt":0.26282477656972864,"score_spread":0.23056262421898516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402343526","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.021213606,0.0005794045,0.9682621,0.00079156854,0.000031775875,0.00013443395,0.00006684528,0.00073578383,0.008184558],"genre_scores_gemma":[0.22269276,0.0009260157,0.7712955,0.00032011222,0.00011189963,0.00040792613,0.0002333577,0.0003119767,0.0037004384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959947,0.0020822606,0.00015433533,0.0005285532,0.0010222363,0.00021785476],"domain_scores_gemma":[0.98684573,0.010280122,0.0004564076,0.00177948,0.00046996237,0.00016820333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040579727,0.001066668,0.0008504064,0.0018639074,0.00084354775,0.0027988248,0.0017216252,0.0011891016,0.0048113004],"category_scores_gemma":[0.015951464,0.0009858763,0.0012135474,0.001471142,0.0057663913,0.0045269295,0.0030448402,0.0023994776,0.0011284841],"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.0000923541,0.00008161951,0.00044516375,0.0002747965,0.000030096922,0.000073115334,0.0002933734,0.05595236,0.004631625,0.85285974,0.0019142639,0.083351456],"study_design_scores_gemma":[0.000066894245,0.000063707004,0.00008845583,0.000051448278,0.000020885363,0.00006827617,0.000059887378,0.22343843,0.0047836923,0.76342773,0.00790923,0.000021450862],"about_ca_topic_score_codex":0.0007272928,"about_ca_topic_score_gemma":0.0009083599,"teacher_disagreement_score":0.0048113004,"about_ca_system_score_codex":0.0019914042,"about_ca_system_score_gemma":0.0017489751,"threshold_uncertainty_score":0.02146089},"labels":[],"label_agreement":null},{"id":"W2406423292","doi":"10.1609/aaai.v25i1.7845","title":"Preferred Explanations: Theory and Generation via Planning","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Exploit; Computer science; Domain (mathematical analysis); Artificial intelligence; Characterization (materials science); Dynamical systems theory; Theoretical computer science; Machine learning; Mathematics","score_opus":0.17345072975235198,"score_gpt":0.29621240104317037,"score_spread":0.12276167129081839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406423292","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.0041164374,0.00074281456,0.98533404,0.0014421791,0.00005471911,0.00007914164,0.00018527183,0.0002708416,0.007774673],"genre_scores_gemma":[0.2657616,0.0019647065,0.723666,0.00058715604,0.0002210628,0.0006615813,0.0009894288,0.00026637316,0.0058821337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99619436,0.0018967523,0.00022621968,0.0006979971,0.0007668298,0.00021782384],"domain_scores_gemma":[0.9873727,0.010133649,0.0005440964,0.001178349,0.0005578791,0.00021318095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048635523,0.0011224176,0.00078060693,0.0023854203,0.0014050872,0.003433493,0.002824495,0.0021948488,0.009282666],"category_scores_gemma":[0.018263662,0.00083525386,0.0025163253,0.0019042939,0.0059752814,0.007214346,0.0029935888,0.0029534118,0.0008427648],"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.000031535335,0.000022809629,0.0003141142,0.00020236977,0.000035214347,0.00014345869,0.00043956254,0.037937913,0.0003143655,0.93113685,0.0017028353,0.027719116],"study_design_scores_gemma":[0.00002046828,0.000011666657,0.000051560655,0.00004745557,0.000016306649,0.00005754997,0.000069167996,0.07125968,0.00042486907,0.92387086,0.004156659,0.00001366869],"about_ca_topic_score_codex":0.0039633955,"about_ca_topic_score_gemma":0.00486062,"teacher_disagreement_score":0.009282666,"about_ca_system_score_codex":0.0022533606,"about_ca_system_score_gemma":0.0020216396,"threshold_uncertainty_score":0.031053662},"labels":[],"label_agreement":null},{"id":"W2408131130","doi":"10.1609/aaai.v26i1.8397","title":"A Search Algorithm for Latent Variable Models with Unbounded Domains","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Bayesian Methods and Mixture Models","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":"Latent variable; A priori and a posteriori; Latent variable model; Prior probability; Algorithm; Computer science; Probabilistic logic; Probabilistic latent semantic analysis; Domain (mathematical analysis); Variable (mathematics); Latent Dirichlet allocation; Dirichlet distribution; Mathematics; Machine learning; Artificial intelligence; Topic model; Bayesian probability","score_opus":0.09569180326638813,"score_gpt":0.30836496863901175,"score_spread":0.21267316537262362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408131130","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.0026185839,0.00021802228,0.9958741,0.00017463221,0.000019009232,0.00003896775,0.000042341515,0.00037027465,0.0006440226],"genre_scores_gemma":[0.07658986,0.00028947715,0.9189478,0.0002148792,0.00006943609,0.00042799822,0.0004969869,0.00028665987,0.0026767983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981687,0.0007733979,0.0001401797,0.00040395456,0.00037982236,0.00013397323],"domain_scores_gemma":[0.99059033,0.008170343,0.00027186354,0.0003888413,0.00040120835,0.00017743923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038656858,0.0012394853,0.0019762593,0.0023939824,0.0010842826,0.0017718105,0.0027002774,0.0031242855,0.0050961226],"category_scores_gemma":[0.020012064,0.0011561816,0.0014910543,0.0030579315,0.0014068687,0.005252751,0.004038927,0.0032531237,0.0016565174],"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.00030065601,0.00018211985,0.0012460389,0.00027810762,0.00015349718,0.00016360528,0.0003788702,0.4758347,0.0016176462,0.20747238,0.008592095,0.30378023],"study_design_scores_gemma":[0.00004369104,0.000014609369,0.0000434512,0.000017987835,0.000010322651,0.000024952495,0.000015942695,0.92699885,0.00020981421,0.07171658,0.0008964547,0.000007332432],"about_ca_topic_score_codex":0.004482197,"about_ca_topic_score_gemma":0.004557197,"teacher_disagreement_score":0.0050961226,"about_ca_system_score_codex":0.0017392286,"about_ca_system_score_gemma":0.002523652,"threshold_uncertainty_score":0.020443976},"labels":[],"label_agreement":null},{"id":"W2415711950","doi":"10.1609/aaai.v30i1.10117","title":"Verifying ConGolog Programs on Bounded Situation Calculus Theories","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Bounded function; Situation calculus; Decidability; Computer science; Generality; Compiler; Domain (mathematical analysis); Semantics (computer science); Variable (mathematics); Calculus (dental); Action (physics); Programming language; Theoretical computer science; Mathematics","score_opus":0.07104795872369078,"score_gpt":0.28858675826953256,"score_spread":0.21753879954584177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2415711950","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.23649092,0.00018089754,0.75116265,0.00050379685,0.00006933588,0.00014156247,0.00032341792,0.005252453,0.0058749677],"genre_scores_gemma":[0.8574443,0.00010701629,0.13988625,0.00015985117,0.000037395635,0.00012938712,0.00033623065,0.00032827278,0.0015714032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99510807,0.0016206964,0.00032066982,0.00086524274,0.0013680274,0.000717307],"domain_scores_gemma":[0.9871295,0.008365993,0.0011313754,0.0021405802,0.0009110706,0.00032152538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004707773,0.0006223987,0.00065378036,0.001100319,0.0010949377,0.0023015244,0.0018426173,0.0010379791,0.00255212],"category_scores_gemma":[0.01907966,0.0008060725,0.0019011715,0.0007208937,0.0042643673,0.0052746697,0.0040498828,0.0019342399,0.0003699372],"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.00093824725,0.00031209792,0.01143428,0.0006266963,0.00027397307,0.0018321808,0.0019420218,0.21747495,0.031626195,0.6758784,0.0020226347,0.05563827],"study_design_scores_gemma":[0.000108931265,0.0002250547,0.0011620919,0.00009963098,0.00016628148,0.00024187435,0.00038777053,0.57443386,0.050968748,0.3660247,0.0061095315,0.00007147825],"about_ca_topic_score_codex":0.0049575428,"about_ca_topic_score_gemma":0.00555995,"teacher_disagreement_score":0.0049575428,"about_ca_system_score_codex":0.0020714318,"about_ca_system_score_gemma":0.0028002877,"threshold_uncertainty_score":0.024897337},"labels":[],"label_agreement":null},{"id":"W2418993857","doi":"10.1609/aaai.v31i1.10984","title":"Multiresolution Recurrent Neural Networks: An Application to Dialogue Response Generation","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":162,"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 Montréal","funders":"","keywords":"Computer science; Margin (machine learning); Recurrent neural network; Sequence (biology); Artificial intelligence; Semantics (computer science); Representation (politics); Artificial neural network; Abstraction; Machine learning; Process (computing); Natural language processing","score_opus":0.13868579761646666,"score_gpt":0.3393223618512201,"score_spread":0.20063656423475346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2418993857","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.024820482,0.00059214956,0.969738,0.00032154232,0.00006074532,0.00006486763,0.00014831717,0.0024103338,0.0018435791],"genre_scores_gemma":[0.650272,0.0005071396,0.34412864,0.00024406402,0.000088080174,0.00021066237,0.00042069177,0.0002756844,0.003852978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938416,0.00027613487,0.000028344408,0.00014174827,0.00012313634,0.00004637521],"domain_scores_gemma":[0.9988686,0.0007271959,0.00010794133,0.00011962804,0.00013539108,0.000041204188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013881682,0.0008621636,0.0006533443,0.00050310965,0.00023230512,0.00072367315,0.0012641462,0.001001679,0.0019930245],"category_scores_gemma":[0.004518589,0.00044242907,0.0007739615,0.0005547595,0.00037588354,0.0012665711,0.000815781,0.0013736122,0.0006132079],"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.00023683021,0.00014349582,0.0009158442,0.00016457276,0.00011464918,0.0002728406,0.00032741218,0.77493894,0.016646605,0.015058014,0.0028661585,0.18831456],"study_design_scores_gemma":[0.0000041057365,0.00001647762,0.000054629876,0.0000033447177,0.0000064125284,0.000015158672,0.0000041653166,0.9965417,0.0009340644,0.0020455876,0.00036997735,0.000004391177],"about_ca_topic_score_codex":0.0040321257,"about_ca_topic_score_gemma":0.0045395587,"teacher_disagreement_score":0.0040321257,"about_ca_system_score_codex":0.0006753828,"about_ca_system_score_gemma":0.00039842873,"threshold_uncertainty_score":0.008017302},"labels":[],"label_agreement":null},{"id":"W2426659032","doi":"10.1609/aaai.v30i2.19073","title":"Infusing Human Factors into Algorithmic Crowdsourcing","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Mobile Crowdsensing and Crowdsourcing","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":"Crowdsourcing; Computer science; Task (project management); Crowdsourcing software development; Field (mathematics); Data science; Construct (python library); Key (lock); Agile software development; Delegation; Knowledge management; Artificial intelligence; World Wide Web; Computer security; Software engineering; Engineering","score_opus":0.058575363307755465,"score_gpt":0.28637839904911094,"score_spread":0.22780303574135546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2426659032","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.115784384,0.0010699198,0.8441986,0.0067633847,0.0004319821,0.000758265,0.0010103025,0.0010296984,0.028953545],"genre_scores_gemma":[0.8845599,0.0003211744,0.1098662,0.0005755144,0.00011033918,0.00044191416,0.00035029,0.0001739465,0.0036007012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9861718,0.009934675,0.00034249565,0.0017788601,0.0012460749,0.00052619475],"domain_scores_gemma":[0.962512,0.026197862,0.0023513285,0.006717468,0.0013925204,0.0008287509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012855267,0.0012604749,0.0009221323,0.0014577619,0.0017808973,0.0036240988,0.0019531623,0.0023309304,0.0054808287],"category_scores_gemma":[0.05175118,0.0007132486,0.00095390104,0.0015576138,0.006140274,0.004028751,0.0053962916,0.0020823632,0.00087742525],"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.0007231633,0.00037698267,0.0205321,0.00064870203,0.00023158468,0.00031106515,0.0027867686,0.5486037,0.003944832,0.29561833,0.0071310047,0.11909179],"study_design_scores_gemma":[0.00013572183,0.00022088985,0.003056929,0.000118032265,0.000037058773,0.00007149672,0.0007998612,0.67768997,0.0015131995,0.2976945,0.018573884,0.000088378656],"about_ca_topic_score_codex":0.01413829,"about_ca_topic_score_gemma":0.015605653,"teacher_disagreement_score":0.01413829,"about_ca_system_score_codex":0.0031645934,"about_ca_system_score_gemma":0.0031416202,"threshold_uncertainty_score":0.06798595},"labels":[],"label_agreement":null},{"id":"W2434144965","doi":"10.1609/aaai.v30i1.10108","title":"A First-Order Logic of Probability and Only Knowing in Unbounded Domains","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Vlaamse regering; University of Toronto; Fonds Wetenschappelijk Onderzoek","keywords":"Probabilistic logic; Knowledge base; Computer science; Belief revision; Order (exchange); Logical consequence; Base (topology); Artificial intelligence; Theoretical computer science; Mathematics","score_opus":0.06535929149130568,"score_gpt":0.2797917303073284,"score_spread":0.21443243881602272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2434144965","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.012058364,0.00080708,0.9403859,0.004710681,0.00023463469,0.000084992505,0.00053723477,0.00043883486,0.04074237],"genre_scores_gemma":[0.61656266,0.0014089688,0.35857657,0.0021900032,0.0009088208,0.00031494495,0.0008329892,0.00017190262,0.019033158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963651,0.0011101105,0.00034620854,0.0008132314,0.0009687212,0.0003965385],"domain_scores_gemma":[0.9930951,0.004142547,0.00061798334,0.00090112025,0.00082910573,0.00041416264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051212357,0.00093617797,0.0010375861,0.0021014563,0.0028973815,0.00632724,0.0022676047,0.0026764888,0.0044445232],"category_scores_gemma":[0.0072021913,0.00093249517,0.0026085651,0.0021827943,0.008511677,0.015295952,0.003618825,0.005279826,0.00080539606],"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.0000065170047,0.000004990051,0.000052155556,0.00001657082,0.000006090915,0.000063071166,0.00012537517,0.0008201626,0.00009820167,0.9968148,0.00035307824,0.001638982],"study_design_scores_gemma":[0.0000090514195,0.000009064204,0.00005594969,0.000013976062,0.000014893794,0.00009490444,0.000028655639,0.0071154614,0.00027983598,0.9880151,0.0043500215,0.000013067524],"about_ca_topic_score_codex":0.004159373,"about_ca_topic_score_gemma":0.0048700115,"teacher_disagreement_score":0.00632724,"about_ca_system_score_codex":0.0034777315,"about_ca_system_score_gemma":0.0026547457,"threshold_uncertainty_score":0.027083993},"labels":[],"label_agreement":null},{"id":"W2466797724","doi":"10.1609/aaai.v30i1.10111","title":"SAT-to-SAT: Declarative Extension of SAT Solvers with New Propagators","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Academy of Finland","keywords":"Propagator; Computer science; Solver; Extension (predicate logic); Theoretical computer science; Declarative programming; Programming language; Mathematics; Programming paradigm; Inductive programming","score_opus":0.0643844141834685,"score_gpt":0.2730478353290722,"score_spread":0.20866342114560366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2466797724","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.001155218,0.000059739814,0.99087685,0.00020999997,0.00006294102,0.000092064816,0.00017857479,0.005390166,0.0019744565],"genre_scores_gemma":[0.036911976,0.00016469738,0.9575561,0.0004378063,0.00008387263,0.0003315277,0.0008899776,0.0012350985,0.0023888736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99577737,0.0017965634,0.00054655876,0.00067862304,0.0009418523,0.00025904572],"domain_scores_gemma":[0.99015373,0.005761753,0.000700612,0.0022489415,0.0009016831,0.00023321406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005632631,0.0013593497,0.001004113,0.0013471622,0.0008372555,0.0031298376,0.0054259035,0.0017448798,0.010146452],"category_scores_gemma":[0.011647756,0.0014712617,0.00300905,0.0014837013,0.0028211235,0.006023393,0.005977907,0.0062618745,0.0029313874],"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.0004668375,0.00043968434,0.0015704731,0.0012134992,0.00028916565,0.0007293801,0.0013487227,0.08762851,0.016937809,0.63713026,0.03208942,0.22015628],"study_design_scores_gemma":[0.0002602897,0.00012358568,0.0002255169,0.00019517046,0.00015151336,0.00047036287,0.000107246815,0.6316813,0.02042977,0.24082711,0.10543079,0.0000972986],"about_ca_topic_score_codex":0.0012747098,"about_ca_topic_score_gemma":0.0034721817,"teacher_disagreement_score":0.010146452,"about_ca_system_score_codex":0.0011061043,"about_ca_system_score_gemma":0.0025833172,"threshold_uncertainty_score":0.033943236},"labels":[],"label_agreement":null},{"id":"W2480793474","doi":"10.1609/aaai.v30i1.10045","title":"Using Correlated Strategies for Computing Stackelberg Equilibria in Extensive-Form Games","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Office of Naval Research Global; Sino-Danish Center; Alberta Innovates; Grantová Agentura České Republiky; Office of Naval Research; National Natural Science Foundation of China; National Research Foundation; České Vysoké Učení Technické v Praze; Danmarks Grundforskningsfond; National Science Foundation","keywords":"Stackelberg competition; Computer science; Perfect information; Extensive-form game; Best response; Game theory; Imperfect; Algorithmic game theory; Mathematical optimization; Mathematical economics; Algorithm; Sequential game; Mathematics","score_opus":0.32910523418623444,"score_gpt":0.4314764942199643,"score_spread":0.10237126003372987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2480793474","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.025588382,0.00008401733,0.97141135,0.0001706002,0.000018685669,0.000133394,0.00006535038,0.00064837,0.0018798102],"genre_scores_gemma":[0.39515036,0.00013409261,0.6024187,0.0001903076,0.000028917013,0.00042501875,0.00027066743,0.00016609915,0.0012158924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972025,0.001125523,0.00019017326,0.00052756886,0.00059620285,0.00035810223],"domain_scores_gemma":[0.99149865,0.005868759,0.0006501143,0.00093361124,0.00075504364,0.0002939285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034538864,0.002038043,0.0017436442,0.0018140855,0.0010338195,0.00265503,0.0022302244,0.0017866198,0.003963053],"category_scores_gemma":[0.018111302,0.0010214619,0.0014061413,0.0019507414,0.0018467966,0.004459793,0.0023732316,0.0023949507,0.0007960295],"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.00015755794,0.00022030053,0.0021154527,0.00014261813,0.00013892271,0.00012110262,0.00015266583,0.84381527,0.0015668847,0.088224225,0.0010977279,0.062247302],"study_design_scores_gemma":[0.00003099084,0.000033353277,0.000081414386,0.000012027305,0.00001216865,0.000017915077,0.00002029599,0.94850075,0.0011520245,0.049859427,0.00026812626,0.000011533424],"about_ca_topic_score_codex":0.004549371,"about_ca_topic_score_gemma":0.0069729057,"teacher_disagreement_score":0.004549371,"about_ca_system_score_codex":0.0021336826,"about_ca_system_score_gemma":0.0052014715,"threshold_uncertainty_score":0.018266082},"labels":[],"label_agreement":null},{"id":"W2493063923","doi":"10.1609/aaai.v30i1.10051","title":"Counterfactual Regret Minimization in Sequential Security Games","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alberta Innovates; Compute Canada","keywords":"Counterfactual thinking; Computer science; Regret; Nash equilibrium; Mathematical optimization; Repeated game; Class (philosophy); Computation; Mathematical economics; Game theory; Mathematics; Algorithm; Artificial intelligence; Machine learning","score_opus":0.07097387569925362,"score_gpt":0.30342123310477553,"score_spread":0.23244735740552191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2493063923","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.064368226,0.00022816057,0.9291249,0.00061763654,0.000047951555,0.00014504467,0.000104652354,0.00045940102,0.0049038962],"genre_scores_gemma":[0.74948937,0.00017542951,0.24647225,0.0002424335,0.00005472942,0.00028589496,0.00021328653,0.00013883534,0.00292768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949824,0.003419753,0.00014311014,0.0005604999,0.0005716686,0.00032244527],"domain_scores_gemma":[0.9858169,0.011842076,0.00069922704,0.0008775585,0.00046853983,0.00029561573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073693935,0.0013958452,0.0015291199,0.00074785546,0.000667701,0.0020219993,0.002175788,0.0014623257,0.0028865356],"category_scores_gemma":[0.020365346,0.00070394756,0.0012200716,0.0006848387,0.0027238168,0.0027657356,0.0017662605,0.0022351427,0.00036197755],"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.00017650411,0.000072065886,0.00052148325,0.0000921589,0.00005122645,0.00008109782,0.00009991884,0.8489212,0.00045510853,0.12763779,0.0008912075,0.021000301],"study_design_scores_gemma":[0.000028896844,0.000027468002,0.00006871851,0.00000983703,0.00000826267,0.00001566144,0.000011756319,0.9142949,0.0004013849,0.08480925,0.0003170107,0.0000068101895],"about_ca_topic_score_codex":0.0043817186,"about_ca_topic_score_gemma":0.0038845115,"teacher_disagreement_score":0.0073693935,"about_ca_system_score_codex":0.002490181,"about_ca_system_score_gemma":0.0023978609,"threshold_uncertainty_score":0.03897357},"labels":[],"label_agreement":null},{"id":"W2501538315","doi":"10.1609/aaai.v30i1.10063","title":"DRIMUX: Dynamic Rumor Influence Minimization with User Experience in Social Networks","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":32,"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":"National Science Foundation","keywords":"Rumor; Blocking (statistics); Computer science; Constraint (computer-aided design); Popularity; Inference; Node (physics); Minification; Social network (sociolinguistics); Mathematical optimization; Artificial intelligence; Computer network; Social media; Mathematics; Engineering","score_opus":0.03429066935275732,"score_gpt":0.30181836728649936,"score_spread":0.26752769793374204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2501538315","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.026436402,0.00042631675,0.97110724,0.0003295414,0.000026752372,0.0000743949,0.00007240728,0.00025452458,0.0012724343],"genre_scores_gemma":[0.83416164,0.00069842214,0.1600938,0.0001838865,0.00013013554,0.00034731775,0.00024060156,0.00012525113,0.0040189796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982153,0.0009218489,0.000061753315,0.00032630606,0.00029352718,0.00018123256],"domain_scores_gemma":[0.99437994,0.004023626,0.0005679587,0.00041754142,0.0003849016,0.00022603494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036011552,0.0011718203,0.0016549858,0.0011651036,0.000784639,0.0014478863,0.002797473,0.0015134901,0.0013230325],"category_scores_gemma":[0.01183756,0.000729036,0.0010738478,0.0011340507,0.0016821304,0.002928014,0.0021830779,0.0015499428,0.00027161156],"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.00014359073,0.000083670944,0.0024601514,0.00014303911,0.0001226359,0.0001390685,0.00023323552,0.8995034,0.0012708937,0.058605865,0.0011994069,0.036095075],"study_design_scores_gemma":[0.000008817539,0.00003331067,0.00014142887,0.0000061133023,0.0000138624155,0.000017947512,0.000012177133,0.9868499,0.00022607965,0.012395707,0.00028733633,0.000007310109],"about_ca_topic_score_codex":0.0051876307,"about_ca_topic_score_gemma":0.0035724503,"teacher_disagreement_score":0.0051876307,"about_ca_system_score_codex":0.0016136051,"about_ca_system_score_gemma":0.0012647875,"threshold_uncertainty_score":0.019044936},"labels":[],"label_agreement":null},{"id":"W2503919929","doi":"10.1609/aaai.v30i1.10440","title":"Using the Shapley Value to Analyze Algorithm Portfolios","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Insight SFI Research Centre for Data Analytics; Compute Canada","keywords":"Shapley value; Component (thermodynamics); Computer science; Portfolio; Algorithm; Set (abstract data type); Cooperative game theory; Measure (data warehouse); Value (mathematics); Strengths and weaknesses; Mathematical optimization; Game theory; Mathematics; Machine learning; Data mining; Mathematical economics; Finance; Economics","score_opus":0.14428951096714085,"score_gpt":0.30294544640319626,"score_spread":0.1586559354360554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2503919929","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.10538629,0.000570344,0.87941265,0.0010319051,0.00005541489,0.00023026626,0.00015559969,0.00020199585,0.01295561],"genre_scores_gemma":[0.8072806,0.000545996,0.18862954,0.00017927782,0.0001131907,0.0002982109,0.00024482812,0.00016178293,0.0025465905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99337065,0.0034943037,0.00030536688,0.0005741228,0.0017677873,0.00048773343],"domain_scores_gemma":[0.9753651,0.018574642,0.00175327,0.0022550575,0.001306756,0.00074509636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012596924,0.0013092078,0.0014363779,0.0044967397,0.0012483258,0.0055644237,0.002211116,0.0016598507,0.0032131854],"category_scores_gemma":[0.048955273,0.00065792137,0.0012489508,0.004271044,0.0037793033,0.009440587,0.003081065,0.0028199863,0.000311252],"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.00011274556,0.00014696563,0.00507545,0.00014337756,0.00018093709,0.0000655387,0.00037292435,0.34331247,0.0015005284,0.58771944,0.0013263323,0.06004339],"study_design_scores_gemma":[0.000019315967,0.00008414643,0.0005587941,0.000025902378,0.000019093533,0.000030672305,0.00007666026,0.52771515,0.0008105625,0.46924117,0.0013978763,0.000020739535],"about_ca_topic_score_codex":0.0015042172,"about_ca_topic_score_gemma":0.0013546145,"teacher_disagreement_score":0.012596924,"about_ca_system_score_codex":0.0036684426,"about_ca_system_score_gemma":0.0029667474,"threshold_uncertainty_score":0.066619694},"labels":[],"label_agreement":null},{"id":"W2505696146","doi":"10.1609/aaai.v30i1.9876","title":"What’s Hot in Human Language Technology: Highlights from NAACL HLT 2015","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Natural Language Processing Techniques","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":"Simon Fraser University","funders":"","keywords":"Computer science; Data science; History","score_opus":0.039601484243117456,"score_gpt":0.3154644048457776,"score_spread":0.27586292060266016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2505696146","genre_codex":"commentary","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017482206,0.27743796,0.010457463,0.6193146,0.023346404,0.00009634137,0.0041929223,0.0012708363,0.04640124],"genre_scores_gemma":[0.34671703,0.33668312,0.026380794,0.18055558,0.04818173,0.00047884646,0.018523194,0.002457485,0.040022165],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9897133,0.0029309066,0.0010670966,0.0012224643,0.004064208,0.0010021286],"domain_scores_gemma":[0.968739,0.0172014,0.0015763994,0.001072582,0.0073907864,0.0040198225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019804107,0.00063235266,0.0009094488,0.005197439,0.0026815708,0.015688187,0.0013616774,0.0040020263,0.005038441],"category_scores_gemma":[0.029734427,0.00054139795,0.0005544389,0.009596406,0.004902476,0.015664723,0.00649238,0.005899709,0.0023291525],"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.00050427933,0.00017871032,0.0050432784,0.002971135,0.00004685668,0.00039580165,0.0056391596,0.0006749187,0.0024907219,0.03294095,0.6320133,0.31710085],"study_design_scores_gemma":[0.00003543971,0.00011314164,0.010267614,0.0017030587,0.000029301053,0.00042628372,0.006116621,0.00066725624,0.0019604187,0.016468639,0.96210724,0.0001050166],"about_ca_topic_score_codex":0.013048469,"about_ca_topic_score_gemma":0.0256537,"teacher_disagreement_score":0.019804107,"about_ca_system_score_codex":0.0064003724,"about_ca_system_score_gemma":0.005661436,"threshold_uncertainty_score":0.104735374},"labels":[],"label_agreement":null},{"id":"W2520523926","doi":"10.1609/aaai.v30i1.9999","title":"Survival Prediction by an Integrated Learning Criterion on Intermittently Varying Healthcare Data","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning in Healthcare","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Generalizability theory; Health care; Computer science; Class (philosophy); Healthcare system; Machine learning; Data mining; Artificial intelligence; Econometrics; Statistics; Mathematics; Economics","score_opus":0.13921495677946505,"score_gpt":0.3530516355418152,"score_spread":0.21383667876235013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520523926","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.050715733,0.00032577367,0.94727117,0.0006674485,0.000039265666,0.000054693595,0.00020327882,0.00023169961,0.00049094093],"genre_scores_gemma":[0.86375284,0.00060353044,0.12990312,0.00033434806,0.00023211622,0.00028750542,0.0012120222,0.000119026336,0.0035554362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749845,0.001215605,0.00013590488,0.0005736121,0.0004092887,0.00016710497],"domain_scores_gemma":[0.98770905,0.00910098,0.000901327,0.00089717546,0.0010619721,0.00032951366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009785636,0.001093296,0.0019612769,0.001029367,0.0003727487,0.0013226224,0.002686701,0.00139649,0.0012051298],"category_scores_gemma":[0.024121871,0.00064899767,0.0009723164,0.0010219067,0.0013168455,0.0024993632,0.0022431763,0.0030171187,0.00038237227],"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.00016499856,0.00010155518,0.0051465123,0.000086744716,0.00009627145,0.00010812988,0.000105855775,0.9306138,0.0012926497,0.013916663,0.0013343672,0.047032423],"study_design_scores_gemma":[0.0000059116733,0.000027425831,0.00026500435,0.000004745581,0.000007434074,0.000013985653,0.0000051340794,0.99472046,0.0001538113,0.004664882,0.00012524045,0.0000059496188],"about_ca_topic_score_codex":0.0034709496,"about_ca_topic_score_gemma":0.0026387863,"teacher_disagreement_score":0.009785636,"about_ca_system_score_codex":0.0009076228,"about_ca_system_score_gemma":0.0015381757,"threshold_uncertainty_score":0.05175203},"labels":[],"label_agreement":null},{"id":"W2521066248","doi":"10.1609/aaai.v31i1.10755","title":"Enabling Dark Energy Science with Deep Generative Models of Galaxy Images","year":2017,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Generative Adversarial Networks and Image Synthesis","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":"University of Alberta","funders":"","keywords":"Autoencoder; Dark energy; Generative grammar; Galaxy; Cosmology; Calibration; Computer science; Astrophysics; Artificial intelligence; Physics; Deep learning","score_opus":0.07212541502478928,"score_gpt":0.28402776183954914,"score_spread":0.21190234681475986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521066248","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.054673675,0.0003973922,0.94017553,0.00091735413,0.000045462344,0.000028151164,0.00022991492,0.00072855386,0.0028040614],"genre_scores_gemma":[0.8944061,0.00043932998,0.09959809,0.00049984053,0.00009563654,0.000072249204,0.0006094737,0.00022603483,0.0040532188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980336,0.000076305056,0.0000049824,0.000051261584,0.000038732298,0.000025396903],"domain_scores_gemma":[0.99873346,0.0009357774,0.00009564022,0.00012705941,0.000052953164,0.000055171175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075958984,0.0007262017,0.0005281437,0.00036591882,0.00023445438,0.00089703884,0.0011215872,0.0011006193,0.0015422204],"category_scores_gemma":[0.0035223754,0.00065410876,0.00068953465,0.0003323944,0.0011087497,0.0012648616,0.0018030403,0.0020692034,0.00039462355],"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.000038883394,0.000019647106,0.00080283394,0.000025199297,0.00002552602,0.0000368281,0.000048728718,0.9595791,0.0016344406,0.024500582,0.0008743584,0.012413901],"study_design_scores_gemma":[0.00000247591,0.0000029233452,0.0000564431,0.0000024263504,0.0000017617514,0.0000055347405,0.0000022872955,0.9892084,0.00028150133,0.010255089,0.00017903195,0.0000021652086],"about_ca_topic_score_codex":0.004694015,"about_ca_topic_score_gemma":0.006378567,"teacher_disagreement_score":0.004694015,"about_ca_system_score_codex":0.0009769952,"about_ca_system_score_gemma":0.0005054966,"threshold_uncertainty_score":0.009333372},"labels":[],"label_agreement":null},{"id":"W2522536814","doi":"10.1609/aaai.v31i1.10854","title":"Tsallis Regularized Optimal Transport and Ecological Inference","year":2017,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Statistical Mechanics and Entropy","field":"Physics and Astronomy","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":"Polytechnique Montréal","funders":"","keywords":"Mathematical proof; Inference; Joint probability distribution; Kullback–Leibler divergence; Computer science; Probability distribution; Convergence (economics); Metric (unit); Divergence (linguistics); Mathematics; Mathematical economics; Artificial intelligence; Economics; Statistics","score_opus":0.08027964101977351,"score_gpt":0.32523047806645683,"score_spread":0.2449508370466833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522536814","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.020312883,0.0005444834,0.97486275,0.0009601291,0.000053930547,0.000031111384,0.00029609687,0.0002510156,0.0026875844],"genre_scores_gemma":[0.6980605,0.0012713157,0.29118693,0.00048327554,0.00023240535,0.00025143346,0.0011521161,0.0004400674,0.0069218697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803346,0.0009076374,0.00013307281,0.0004641558,0.0003255507,0.00013621866],"domain_scores_gemma":[0.98832685,0.008325903,0.0012224013,0.0012463005,0.00057332835,0.00030524674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004203976,0.0008883994,0.0013729812,0.0021876446,0.0012228615,0.002350645,0.0019497325,0.0018818597,0.003545575],"category_scores_gemma":[0.024857124,0.0008108937,0.0019175402,0.0021190674,0.0044479044,0.006290346,0.0026696243,0.0035031075,0.00048127363],"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.00006752216,0.000024451105,0.0017276517,0.000106171865,0.000088807596,0.000094283096,0.00014254541,0.34339628,0.00053681765,0.6360161,0.0015357402,0.016263718],"study_design_scores_gemma":[0.00000733799,0.000015608686,0.00026864363,0.000018163586,0.0000086181435,0.000036027515,0.000019757195,0.44593945,0.0003094161,0.5522163,0.0011437101,0.000017052018],"about_ca_topic_score_codex":0.00709946,"about_ca_topic_score_gemma":0.0046236464,"teacher_disagreement_score":0.00709946,"about_ca_system_score_codex":0.004877526,"about_ca_system_score_gemma":0.002241429,"threshold_uncertainty_score":0.035389066},"labels":[],"label_agreement":null},{"id":"W2523728418","doi":"10.1609/aaai.v31i1.10916","title":"The Option-Critic Architecture","year":2017,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":209,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Reinforcement learning; Flexibility (engineering); Computer science; Architecture; Abstraction; Key (lock); Artificial intelligence; Economics; Computer security; Management; Epistemology","score_opus":0.08507794004948784,"score_gpt":0.3192055271439572,"score_spread":0.2341275870944694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2523728418","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.010012724,0.0004054291,0.97541124,0.0010000651,0.000096785356,0.00004522463,0.00008872127,0.0005385211,0.0124011915],"genre_scores_gemma":[0.7117746,0.00076225464,0.27234036,0.0004591023,0.00013311463,0.00028338487,0.00018099016,0.0001588672,0.0139074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994487,0.00016181303,0.0000298946,0.00014483152,0.0001618101,0.000052911204],"domain_scores_gemma":[0.9990978,0.00043156222,0.00007432087,0.00015565782,0.00014343111,0.00009728146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009809321,0.0008233829,0.0006473402,0.00034592763,0.00046799984,0.0012915645,0.0015277191,0.001421225,0.0046299663],"category_scores_gemma":[0.0040002763,0.00060600584,0.00060589786,0.00035267018,0.0016972633,0.0024243686,0.0018483688,0.003288094,0.0009195589],"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.00008746639,0.000036731133,0.0006332994,0.00010139992,0.00006939502,0.00016621176,0.00011416661,0.5939296,0.003040292,0.34730422,0.0030457643,0.051471446],"study_design_scores_gemma":[0.000017970502,0.000021988417,0.00009102263,0.000016846216,0.0000143179095,0.000040283798,0.0000059849226,0.8564832,0.00053880387,0.14000203,0.0027545537,0.000013051197],"about_ca_topic_score_codex":0.0026436625,"about_ca_topic_score_gemma":0.0032571694,"teacher_disagreement_score":0.0046299663,"about_ca_system_score_codex":0.00093433383,"about_ca_system_score_gemma":0.0014179953,"threshold_uncertainty_score":0.015488803},"labels":[],"label_agreement":null},{"id":"W2524453101","doi":"10.1609/aaai.v30i1.10160","title":"Recommending Groups to Users Using User-Group Engagement and Time-Dependent Matrix Factorization","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":47,"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; Simon Fraser University","funders":"","keywords":"Assertion; Computer science; Matrix decomposition; User engagement; Group (periodic table); User group; Factorization; Regularization (linguistics); Information retrieval; Human–computer interaction; World Wide Web; Artificial intelligence; Algorithm","score_opus":0.09709312352397087,"score_gpt":0.31567222421559005,"score_spread":0.21857910069161918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2524453101","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.13288496,0.00063344644,0.8621625,0.0007443696,0.00008912812,0.00020060486,0.0005443899,0.0007033124,0.002037239],"genre_scores_gemma":[0.717128,0.00034400166,0.2758666,0.0002460053,0.00015685352,0.00024020558,0.0015349664,0.00007145051,0.004411905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985189,0.00060727046,0.000078725214,0.00044012154,0.00022370226,0.0001314447],"domain_scores_gemma":[0.99482805,0.0033347674,0.0005122813,0.00058967376,0.00052202406,0.00021312092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002896931,0.001051438,0.0012176109,0.0015367146,0.00079178193,0.0011143772,0.0015688415,0.0015947897,0.002096215],"category_scores_gemma":[0.00929537,0.00052311557,0.0012971071,0.0018759007,0.0007419385,0.0024914062,0.0009703143,0.0022529445,0.001014024],"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.0011904803,0.0013546137,0.045937587,0.00041507784,0.0005767445,0.00028110557,0.0019432121,0.5286261,0.008474984,0.0212364,0.013052699,0.37691095],"study_design_scores_gemma":[0.000018236306,0.00007447941,0.0014969029,0.000013429205,0.000021032678,0.00003927983,0.000059500224,0.99252546,0.00030626354,0.0046885544,0.0007422538,0.000014598271],"about_ca_topic_score_codex":0.018297695,"about_ca_topic_score_gemma":0.037783425,"teacher_disagreement_score":0.018297695,"about_ca_system_score_codex":0.00096000434,"about_ca_system_score_gemma":0.00094017904,"threshold_uncertainty_score":0.036382377},"labels":[],"label_agreement":null},{"id":"W2526893957","doi":"10.1609/aaai.v30i1.9856","title":"BeeMo, a Monte Carlo Simulation Agent for Playing Parameterized Poker Squares","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","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":"MacEwan University","funders":"","keywords":"Parameterized complexity; Monte Carlo method; Monte Carlo tree search; Computer science; Heuristic; Dimension (graph theory); Mathematical optimization; Representation (politics); Greedy algorithm; Algorithm; Artificial intelligence; Mathematics; Statistics; Combinatorics","score_opus":0.12419114301632209,"score_gpt":0.3347293487670524,"score_spread":0.21053820575073032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526893957","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.057848528,0.00013637169,0.9328203,0.00017938256,0.000051606487,0.00018909984,0.000069890586,0.0008691718,0.007835583],"genre_scores_gemma":[0.57664824,0.00010234359,0.4180315,0.00012290697,0.000012169682,0.00042199442,0.000076022225,0.0001249772,0.0044597583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996106,0.00017808889,0.000017268187,0.00006304476,0.00009322291,0.000037858776],"domain_scores_gemma":[0.9981791,0.0012336624,0.00010003306,0.00016980841,0.00019011421,0.00012726507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013373513,0.00067957083,0.0006193544,0.00036828846,0.00048872305,0.0009229256,0.0014987598,0.0012799102,0.00460623],"category_scores_gemma":[0.0061807088,0.00046549205,0.00033679302,0.00026904707,0.0008215413,0.0010812897,0.000860589,0.0010924762,0.00055775937],"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.00019153736,0.00011414215,0.00071265956,0.00006291043,0.000040976596,0.000061460094,0.00009574891,0.93435514,0.0029540185,0.03636627,0.00080993463,0.024235174],"study_design_scores_gemma":[0.000017627048,0.000034405213,0.000028992188,0.000003464463,0.0000029588643,0.000008945117,0.000005246666,0.99583864,0.00042863292,0.0029697386,0.0006581171,0.000003342154],"about_ca_topic_score_codex":0.0037218889,"about_ca_topic_score_gemma":0.00573951,"teacher_disagreement_score":0.00460623,"about_ca_system_score_codex":0.0008368742,"about_ca_system_score_gemma":0.0013440747,"threshold_uncertainty_score":0.01540935},"labels":[],"label_agreement":null},{"id":"W2561827022","doi":"10.1609/aaai.v30i1.9972","title":"Community-Based Question Answering via Heterogeneous Social Network Learning","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Expert finding and Q&A systems","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; Natural Sciences and Engineering Research Council of Canada; China Knowledge Centre for Engineering Sciences and Technology","keywords":"Question answering; Computer science; Matching (statistics); Similarity (geometry); Bottleneck; Quality (philosophy); Questions and answers; Information retrieval; Rank (graph theory); Social network (sociolinguistics); Learning to rank; Data science; World Wide Web; Social media; Artificial intelligence; Mathematics; Ranking (information retrieval)","score_opus":0.0727782252670084,"score_gpt":0.29596424524014475,"score_spread":0.22318601997313636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561827022","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.084631056,0.0018225289,0.9047028,0.001564967,0.00011212145,0.00040362892,0.0010093722,0.0023209038,0.0034326788],"genre_scores_gemma":[0.7471564,0.00049949816,0.24234839,0.0007581124,0.0003121618,0.0003809252,0.00315021,0.00016026352,0.005233965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979075,0.00083151413,0.00007322992,0.0007490907,0.00029363963,0.00014499416],"domain_scores_gemma":[0.9945551,0.0035455066,0.00053304696,0.00045369737,0.0005932608,0.00031940264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029794925,0.001281014,0.0015296937,0.0037223788,0.0012486088,0.0013892667,0.0027058867,0.0025437097,0.002407882],"category_scores_gemma":[0.010456818,0.00053071434,0.0014371215,0.002080344,0.0010092469,0.0040759984,0.0028410936,0.0016378491,0.0008866556],"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.00084283325,0.0011305632,0.020022884,0.0007754605,0.0005341707,0.00050089846,0.001947978,0.36450988,0.010814816,0.039867282,0.024013424,0.5350398],"study_design_scores_gemma":[0.000032362565,0.000046326382,0.00056692085,0.000012958867,0.00002758198,0.000036326157,0.00007634689,0.9763214,0.000613827,0.020844745,0.0014073896,0.0000138856085],"about_ca_topic_score_codex":0.009926048,"about_ca_topic_score_gemma":0.013610224,"teacher_disagreement_score":0.009926048,"about_ca_system_score_codex":0.0012869494,"about_ca_system_score_gemma":0.0010681424,"threshold_uncertainty_score":0.019736528},"labels":[],"label_agreement":null},{"id":"W2561828331","doi":"10.1609/aaai.v30i1.10304","title":"Compressed Conditional Mean Embeddings for Model-Based Reinforcement Learning","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":19,"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; Reinforcement learning; Markov decision process; Class (philosophy); Context (archaeology); Kernel (algebra); Bottleneck; Mathematical optimization; Artificial intelligence; Machine learning; Markov process; Mathematics","score_opus":0.07598492911930667,"score_gpt":0.3017610321490101,"score_spread":0.22577610302970347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561828331","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.0063626594,0.000096706644,0.9920339,0.00015493373,0.000023801042,0.000017869612,0.000043528536,0.00041398293,0.0008525567],"genre_scores_gemma":[0.7011598,0.00022178816,0.2948527,0.0002210396,0.000075067364,0.00024621928,0.0003190705,0.00023810694,0.0026662608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994661,0.00020489313,0.00002444471,0.00010474752,0.00014437934,0.0000554472],"domain_scores_gemma":[0.9976484,0.0016075511,0.00021676146,0.00024442977,0.00018086848,0.0001019139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010468604,0.0008985607,0.0011597693,0.0004722524,0.00031600246,0.0007205551,0.001437333,0.0011112272,0.0033293164],"category_scores_gemma":[0.006229788,0.00054804207,0.00067127944,0.000472966,0.0011062667,0.0017639407,0.0017549912,0.0026933993,0.00045647012],"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.000048907103,0.000040749663,0.0002082527,0.000043676333,0.000019264608,0.000028905593,0.00003201474,0.9488815,0.0006134252,0.0281145,0.0007699412,0.021198813],"study_design_scores_gemma":[0.0000031625666,0.00000851326,0.000010548114,0.000002032755,0.000001303836,0.00000364653,0.0000011163368,0.99164164,0.00014393197,0.008048518,0.00013353796,0.0000020336608],"about_ca_topic_score_codex":0.003391833,"about_ca_topic_score_gemma":0.0028271475,"teacher_disagreement_score":0.003391833,"about_ca_system_score_codex":0.0010419536,"about_ca_system_score_gemma":0.0012791065,"threshold_uncertainty_score":0.011137664},"labels":[],"label_agreement":null},{"id":"W2562174057","doi":"10.1609/aaai.v32i1.11481","title":"AIVAT: A New Variance Reduction Technique for Agent Evaluation in Imperfect Information Games","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","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 Alberta","funders":"","keywords":"Variance reduction; Variance (accounting); Perfect information; Computer science; Estimator; Imperfect; Heuristic; Limit (mathematics); Value (mathematics); Victory; Mathematical optimization; Artificial intelligence; Statistics; Machine learning; Mathematics; Monte Carlo method; Mathematical economics; Economics","score_opus":0.09062847487418954,"score_gpt":0.3394626692515252,"score_spread":0.24883419437733564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2562174057","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.004513151,0.00009909483,0.9933206,0.0000847641,0.000032989155,0.000109088454,0.000045190016,0.0007273933,0.0010676497],"genre_scores_gemma":[0.37454596,0.00014154798,0.62200665,0.00020088385,0.0001248823,0.00074077345,0.00025783016,0.0003948518,0.0015866605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98584783,0.008332886,0.0006472133,0.0010281237,0.003549549,0.00059446675],"domain_scores_gemma":[0.9649253,0.025859393,0.002812914,0.002423545,0.003301822,0.0006771231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013421485,0.0018059759,0.0021737558,0.0024684302,0.0009010574,0.0022159806,0.0028110887,0.0016804144,0.0026694885],"category_scores_gemma":[0.05475974,0.00093418214,0.0016934348,0.0009835571,0.0019494346,0.002729362,0.0034128246,0.003636068,0.00061587495],"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.00056001765,0.00026566157,0.0065387837,0.00033581856,0.00043783063,0.00032056394,0.00058000314,0.62035215,0.0056298994,0.1027511,0.004773449,0.2574547],"study_design_scores_gemma":[0.000030038535,0.00009230574,0.00028477,0.000024413472,0.000018720939,0.000041704414,0.000022062757,0.9742405,0.0011956283,0.023366839,0.0006639767,0.000019047602],"about_ca_topic_score_codex":0.0025408186,"about_ca_topic_score_gemma":0.0026485024,"teacher_disagreement_score":0.013421485,"about_ca_system_score_codex":0.0016251318,"about_ca_system_score_gemma":0.0022883997,"threshold_uncertainty_score":0.07098049},"labels":[],"label_agreement":null},{"id":"W2562745053","doi":"10.1609/aaai.v30i1.9822","title":"Productive Aging through Intelligent Personalized Crowdsourcing","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":14,"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":"National Research Foundation","keywords":"Crowdsourcing; Productivity; Delegation; Task (project management); Knowledge management; Business; Computer science; World Wide Web; Economic growth; Economics; Management","score_opus":0.1129454421895436,"score_gpt":0.3095647963690773,"score_spread":0.1966193541795337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2562745053","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.16224004,0.00091183826,0.789747,0.0016053927,0.00037661445,0.00071299693,0.0004893851,0.006696649,0.037220158],"genre_scores_gemma":[0.87229353,0.00035778625,0.11151264,0.00036947714,0.00010597728,0.00035385575,0.0003468855,0.00023806852,0.014421783],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914086,0.00026005707,0.000033641,0.00021657538,0.00024687237,0.00010196848],"domain_scores_gemma":[0.99922323,0.0002746861,0.000067604626,0.00018900103,0.00012982471,0.00011561327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014061875,0.0008261848,0.0005781804,0.00072381244,0.00080352026,0.0011895513,0.0014887815,0.0007564613,0.0027447296],"category_scores_gemma":[0.0029846744,0.00030916405,0.00048670056,0.0005342565,0.00058340246,0.001156355,0.0033715025,0.00081162684,0.0012814807],"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.0007311589,0.000775822,0.008793018,0.00035856868,0.00015448248,0.00056451646,0.002821148,0.15969618,0.030348219,0.022135137,0.021948814,0.751673],"study_design_scores_gemma":[0.00014849791,0.00032297694,0.004504312,0.000069198635,0.00010193078,0.00018626078,0.0011071886,0.8496324,0.008663323,0.07962271,0.05553319,0.00010816588],"about_ca_topic_score_codex":0.0050175996,"about_ca_topic_score_gemma":0.0063655213,"teacher_disagreement_score":0.0050175996,"about_ca_system_score_codex":0.00051516376,"about_ca_system_score_gemma":0.00088888715,"threshold_uncertainty_score":0.009976804},"labels":[],"label_agreement":null},{"id":"W2563145168","doi":"10.1609/aaai.v30i1.10229","title":"Multitask Generalized Eigenvalue Program","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Subspace topology; Computer science; Principal component analysis; Multi-task learning; Eigenvalues and eigenvectors; Machine learning; Linear discriminant analysis; Artificial intelligence; Unsupervised learning; Benchmark (surveying); Pattern recognition (psychology); Task (project management)","score_opus":0.08226779278877065,"score_gpt":0.3105908612917288,"score_spread":0.22832306850295814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563145168","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.0050634113,0.00013171727,0.9916871,0.0002813229,0.000043697873,0.000045914625,0.0000753715,0.00011373813,0.0025576614],"genre_scores_gemma":[0.44880113,0.00059086905,0.533134,0.00058640225,0.0003061126,0.0010366491,0.0006917762,0.00039027436,0.014462839],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845695,0.0007316429,0.000050899973,0.00024002085,0.0003265183,0.00019392691],"domain_scores_gemma":[0.99786276,0.0011795403,0.00017804539,0.0001765689,0.00040886365,0.00019417873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022297811,0.0013547067,0.0013288484,0.0007353944,0.0005747763,0.0014900047,0.0016266815,0.0015113457,0.005867438],"category_scores_gemma":[0.006031258,0.0005330609,0.0011211412,0.00092423754,0.0011948501,0.0019207753,0.002328683,0.0016707487,0.00090348086],"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.000114019196,0.00012984421,0.0009518337,0.0001937901,0.00012400484,0.00030618816,0.00014859039,0.7000418,0.0018166575,0.22543982,0.009915114,0.060818326],"study_design_scores_gemma":[0.000009325284,0.000022489337,0.00006440787,0.0000052768055,0.0000038734124,0.000022139491,0.000012788108,0.939972,0.00015449629,0.058677413,0.0010489998,0.0000067980245],"about_ca_topic_score_codex":0.002475637,"about_ca_topic_score_gemma":0.0029361758,"teacher_disagreement_score":0.005867438,"about_ca_system_score_codex":0.0006998309,"about_ca_system_score_gemma":0.001975399,"threshold_uncertainty_score":0.019628584},"labels":[],"label_agreement":null},{"id":"W2563280975","doi":"10.1609/aaai.v30i1.10320","title":"Delay-Tolerant Online Convex Optimization: Unified Analysis and Adaptive-Gradient Algorithms","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Online algorithm; Regret; Computer science; Convexity; Reduction (mathematics); Algorithm; Convex optimization; Gradient descent; Convex function; Smoothness; Mathematical optimization; Unification; Regular polygon; Mathematics; Artificial intelligence; Machine learning","score_opus":0.059354583606724874,"score_gpt":0.2635845540217784,"score_spread":0.2042299704150535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563280975","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.0012120052,0.00018368251,0.9970546,0.00016255019,0.000037070953,0.00002881774,0.00002960976,0.00010662691,0.001185077],"genre_scores_gemma":[0.4290037,0.0017932117,0.55653536,0.0006630076,0.0005518445,0.0007993956,0.00032461688,0.0006123389,0.009716479],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982951,0.0005272194,0.00007906409,0.00031930968,0.0006130556,0.00016633703],"domain_scores_gemma":[0.99601966,0.0024668947,0.00038019635,0.0004361992,0.00051969156,0.00017740428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033916058,0.0020942478,0.0014090609,0.0009692781,0.00049907033,0.0020242897,0.0029070515,0.001835839,0.0034616431],"category_scores_gemma":[0.01317691,0.00072772894,0.001203569,0.0009842222,0.001994053,0.0033640983,0.0030758125,0.00424649,0.0008655772],"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.00008932316,0.00009586469,0.00041818462,0.00023657281,0.00005361386,0.000099829354,0.00009701367,0.6701447,0.0018929066,0.28673458,0.004237187,0.035900164],"study_design_scores_gemma":[0.000006906028,0.000017817327,0.00002941146,0.000009772022,0.0000049680953,0.00001179183,0.0000047451485,0.9591653,0.00034889774,0.039723583,0.0006715227,0.0000052932833],"about_ca_topic_score_codex":0.0019989945,"about_ca_topic_score_gemma":0.0018011582,"teacher_disagreement_score":0.0034616431,"about_ca_system_score_codex":0.0022054194,"about_ca_system_score_gemma":0.0022374378,"threshold_uncertainty_score":0.017936766},"labels":[],"label_agreement":null},{"id":"W2564001612","doi":"10.1609/aaai.v30i1.10439","title":"Exponential Recency Weighted Average Branching Heuristic for SAT Solvers","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":67,"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":"Heuristics; Heuristic; Branching (polymer chemistry); Computer science; Hash function; Benchmark (surveying); Exponential function; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Programming language","score_opus":0.08381016544744409,"score_gpt":0.3122846525582125,"score_spread":0.22847448711076845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564001612","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.05583769,0.0014788609,0.92532766,0.0011224041,0.00014691404,0.00030051632,0.0003642335,0.0033740122,0.0120476335],"genre_scores_gemma":[0.31958923,0.0005255864,0.6730819,0.0007547639,0.00009647089,0.0004772591,0.0010379454,0.00063035195,0.0038065168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980939,0.0008693718,0.000096628835,0.00029803798,0.00041006808,0.000232],"domain_scores_gemma":[0.9939434,0.004654277,0.00028649007,0.0004954124,0.00042333102,0.00019700167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029922056,0.0013145274,0.0011772678,0.0013970014,0.0006936719,0.0013565375,0.0023856142,0.0013678226,0.0059833294],"category_scores_gemma":[0.010811002,0.00070782244,0.0010737092,0.0017391971,0.0011289906,0.0023373463,0.0013395057,0.003482911,0.0012373038],"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.0005428503,0.00032987155,0.0020347803,0.00035732237,0.00010577227,0.0001288117,0.000203023,0.6389019,0.003938026,0.065804996,0.010446698,0.27720588],"study_design_scores_gemma":[0.00008838598,0.000067144894,0.00013071173,0.000031035215,0.000021663427,0.000027591317,0.000029899036,0.95799464,0.0011292063,0.03856017,0.0019095833,0.000009987663],"about_ca_topic_score_codex":0.0043523572,"about_ca_topic_score_gemma":0.008227794,"teacher_disagreement_score":0.0059833294,"about_ca_system_score_codex":0.0020294597,"about_ca_system_score_gemma":0.0030891441,"threshold_uncertainty_score":0.020016193},"labels":[],"label_agreement":null},{"id":"W2564027179","doi":"10.1609/aaai.v30i1.9880","title":"Ontology Instance Linking: Towards Interlinked Knowledge Graphs","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Data Quality and Management","field":"Decision Sciences","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thomson Reuters (Canada)","funders":"","keywords":"Computer science; Coreference; Identifier; Ontology; Information retrieval; Semantic Web; Linked data; Entity linking; Unique identifier; Data mining; Data science; Artificial intelligence; Resolution (logic); Knowledge base; Programming language","score_opus":0.33435980493086737,"score_gpt":0.424342706670221,"score_spread":0.08998290173935364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564027179","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.008056728,0.00042192376,0.983518,0.00049820234,0.000053835978,0.00025090636,0.0015930072,0.0031647333,0.0024425678],"genre_scores_gemma":[0.06901214,0.0008948766,0.91625154,0.00048814595,0.0000886599,0.0003967168,0.010055331,0.00067652116,0.0021360535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9913987,0.003090516,0.00054653845,0.0025495298,0.0021396175,0.00027512782],"domain_scores_gemma":[0.97552913,0.01436006,0.0018833308,0.0051173395,0.0026083176,0.0005017976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063391104,0.0020925724,0.0013532063,0.013458333,0.0027212661,0.004728414,0.0040460653,0.0032421907,0.003832642],"category_scores_gemma":[0.04633697,0.0013727577,0.0024772696,0.015485767,0.0018482455,0.010763492,0.008922614,0.0032078687,0.00214102],"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.00024506723,0.00044397952,0.0069437968,0.0014382687,0.000533503,0.0009024853,0.002911214,0.15250193,0.005973651,0.14026962,0.032418564,0.6554179],"study_design_scores_gemma":[0.000049249615,0.000055945617,0.0012845926,0.0003195991,0.00018656421,0.00040175152,0.0007302163,0.48928103,0.0076406053,0.4544375,0.045558292,0.00005468838],"about_ca_topic_score_codex":0.0069185654,"about_ca_topic_score_gemma":0.011418103,"teacher_disagreement_score":0.013458333,"about_ca_system_score_codex":0.0015282801,"about_ca_system_score_gemma":0.0025479598,"threshold_uncertainty_score":0.03352487},"labels":[],"label_agreement":null},{"id":"W2564532471","doi":"10.1609/aaai.v30i1.10038","title":"Strategyproof Peer Selection: Mechanisms, Analyses, and Experiments","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","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 Toronto","funders":"Australian Research Council; Australian Government; Microsoft Research","keywords":"Crowdsourcing; Computer science; Axiom; Mechanism (biology); Selection (genetic algorithm); Partition (number theory); Mechanism design; Liberian dollar; Mathematical economics; Artificial intelligence; Mathematics; Economics; World Wide Web","score_opus":0.371830055748852,"score_gpt":0.4581984198974757,"score_spread":0.0863683641486237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564532471","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.6739313,0.004915536,0.28766072,0.0037692194,0.00042733195,0.0040069404,0.001303277,0.0012610989,0.022724656],"genre_scores_gemma":[0.9390314,0.00082140224,0.05653268,0.00034510472,0.000118396136,0.0012501994,0.0002579969,0.00010890314,0.0015338645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9626714,0.02671371,0.001295331,0.002266615,0.004789972,0.0022630747],"domain_scores_gemma":[0.6722054,0.27480856,0.020681867,0.021750484,0.0070140655,0.0035396202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.038118925,0.0022251045,0.002860466,0.0029168427,0.0023324813,0.003722918,0.0050419206,0.0038077217,0.004990356],"category_scores_gemma":[0.13948002,0.0010245475,0.0015169147,0.0035639822,0.004275865,0.008211223,0.0033577273,0.0047638463,0.0007699009],"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.008199563,0.012436064,0.018066544,0.0029649267,0.0016587347,0.00059618516,0.0018195552,0.5819502,0.011241381,0.21627903,0.014914685,0.12987314],"study_design_scores_gemma":[0.0017802935,0.0024521225,0.003251448,0.00015879194,0.00036740696,0.0003592461,0.0008240846,0.8710464,0.006149374,0.109929636,0.0035289319,0.00015220449],"about_ca_topic_score_codex":0.0034102062,"about_ca_topic_score_gemma":0.0016757462,"teacher_disagreement_score":0.038118925,"about_ca_system_score_codex":0.005880054,"about_ca_system_score_gemma":0.0045188847,"threshold_uncertainty_score":0.20159459},"labels":[],"label_agreement":null},{"id":"W2566425679","doi":"10.1609/aaai.v30i1.10433","title":"Counting-Based Search for Constraint Optimization Problems","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Benchmark (surveying); Constraint satisfaction problem; Mathematical optimization; Constraint (computer-aided design); Computation; Computer science; Constraint satisfaction; Constraint programming; Optimization problem; Counting problem; Constraint satisfaction dual problem; Adaptation (eye); Local search (optimization); Metaheuristic; Mathematics; Constraint logic programming; Algorithm; Artificial intelligence; Stochastic programming","score_opus":0.07479258741980677,"score_gpt":0.2882084655670942,"score_spread":0.2134158781472874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566425679","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.017872488,0.0004988302,0.9754249,0.0002764999,0.00007225344,0.00015740748,0.000098975695,0.0016901342,0.0039085364],"genre_scores_gemma":[0.18236628,0.00041377565,0.81369495,0.00037505443,0.00007403358,0.00045510073,0.0004978397,0.0005200284,0.0016030504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728596,0.0012185748,0.00015813587,0.00030672664,0.0008357198,0.00019491228],"domain_scores_gemma":[0.9915657,0.0062403004,0.00041798173,0.0008425887,0.0007523535,0.00018104729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034746213,0.0013112207,0.0016993014,0.002305,0.0009985204,0.0014365934,0.0029704957,0.0015674,0.0038189504],"category_scores_gemma":[0.01868407,0.00082019734,0.0011451828,0.0043968847,0.0013995437,0.0025493212,0.0021664165,0.0026185354,0.00072139024],"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.00020346869,0.00027150512,0.0012252087,0.00029441545,0.00010901358,0.000104556675,0.0001309957,0.6606677,0.005072911,0.061682206,0.0060233837,0.2642147],"study_design_scores_gemma":[0.000044770346,0.000031830663,0.000104883795,0.000017935221,0.000015586313,0.000025869931,0.000010218216,0.976989,0.0011965723,0.020147331,0.0014043169,0.000011782301],"about_ca_topic_score_codex":0.006093601,"about_ca_topic_score_gemma":0.008268833,"teacher_disagreement_score":0.006093601,"about_ca_system_score_codex":0.0016495789,"about_ca_system_score_gemma":0.0019109669,"threshold_uncertainty_score":0.018375754},"labels":[],"label_agreement":null},{"id":"W2566652907","doi":"10.1609/aaai.v30i1.10436","title":"Bidirectional Search That Is Guaranteed to Meet in the Middle","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation; Compute Canada; National Science Foundation","keywords":"Node (physics); Heuristic; Search algorithm; Bidirectional search; Computer science; Brute force; Best-first search; Midpoint; Incremental heuristic search; Algorithm; Mathematical optimization; Beam search; Mathematics; Artificial intelligence; Engineering; Computer security; Geometry","score_opus":0.17798934605340982,"score_gpt":0.3083391178389802,"score_spread":0.1303497717855704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566652907","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.10565069,0.0006205353,0.8621047,0.0009231434,0.00012791349,0.00021845875,0.00029815096,0.0027818887,0.027274597],"genre_scores_gemma":[0.5088096,0.00021247093,0.48400566,0.00040144552,0.000039500068,0.0002572156,0.0005073489,0.00058025337,0.0051865224],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987802,0.00040267553,0.0000824085,0.00022278687,0.00029793562,0.00021403679],"domain_scores_gemma":[0.9957152,0.0022306703,0.00044189917,0.0008244017,0.00048189345,0.00030585416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022265415,0.0008448158,0.0012578532,0.0012767804,0.0014045507,0.0016845778,0.0017184844,0.00201037,0.0053295484],"category_scores_gemma":[0.012691649,0.0006970944,0.00091049453,0.0011046592,0.0009676629,0.002779061,0.0033518553,0.0014789271,0.0018428032],"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.0024089327,0.0007416586,0.005504721,0.00064053154,0.00021827983,0.00040728739,0.0009955809,0.2805244,0.021839058,0.22249098,0.01632201,0.44790664],"study_design_scores_gemma":[0.0002247987,0.00041038662,0.0004121685,0.0001331817,0.000074866715,0.0002488805,0.00034788347,0.85802066,0.014106949,0.11345855,0.012512582,0.0000491135],"about_ca_topic_score_codex":0.003735789,"about_ca_topic_score_gemma":0.005230429,"teacher_disagreement_score":0.0053295484,"about_ca_system_score_codex":0.00066930166,"about_ca_system_score_gemma":0.0031910965,"threshold_uncertainty_score":0.01782912},"labels":[],"label_agreement":null},{"id":"W2566659572","doi":"10.1609/aaai.v30i1.10081","title":"On the Completeness of Best-First Search Variants That Use Random Exploration","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Incremental heuristic search; Greedy algorithm; Computer science; Robustness (evolution); Completeness (order theory); Best-first search; Heuristic; Beam search; Greedy randomized adaptive search procedure; Mathematical optimization; Search algorithm; Graph; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence","score_opus":0.23837014475232568,"score_gpt":0.3007328333075417,"score_spread":0.06236268855521601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566659572","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.03402697,0.0011385202,0.9477627,0.0016383881,0.000074533185,0.00018484985,0.00033822967,0.0009874018,0.013848378],"genre_scores_gemma":[0.5206553,0.002145142,0.46681082,0.0011679223,0.00028058875,0.0008291783,0.0010911403,0.0018907158,0.0051291795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9805834,0.009856739,0.0010973505,0.0029114939,0.004172657,0.0013782971],"domain_scores_gemma":[0.74586207,0.19889656,0.0076342286,0.036602333,0.008765647,0.002239206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.033692684,0.002110952,0.003851816,0.0035118987,0.003321127,0.00480116,0.0043338924,0.0037020242,0.004782738],"category_scores_gemma":[0.17944413,0.0018450447,0.0036892933,0.004105673,0.008366121,0.014436511,0.0068425005,0.0069460217,0.0015647156],"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.00052667665,0.0001793175,0.0033383665,0.0004144132,0.00017298335,0.00016869756,0.00095038145,0.4621776,0.0011157967,0.47404432,0.004231199,0.05268026],"study_design_scores_gemma":[0.00010371811,0.00012221877,0.00037607847,0.00017555163,0.00006811945,0.00021725852,0.00008321801,0.55336803,0.0012832925,0.44102988,0.0031220508,0.000050592247],"about_ca_topic_score_codex":0.004218962,"about_ca_topic_score_gemma":0.0036774324,"teacher_disagreement_score":0.033692684,"about_ca_system_score_codex":0.0028860166,"about_ca_system_score_gemma":0.0069402717,"threshold_uncertainty_score":0.17818612},"labels":[],"label_agreement":null},{"id":"W2566735941","doi":"10.1609/aaai.v30i1.9915","title":"Bagging Ensembles for the Diagnosis and Prognostication of Alzheimer's Disease","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Brain Tumor Detection and Classification","field":"Neuroscience","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":"Western University","funders":"National Institutes of Health; Alzheimer's Disease Neuroimaging Initiative; U.S. Department of Defense","keywords":"Random forest; Support vector machine; Artificial intelligence; Pattern recognition (psychology); Computer science; Machine learning; Correlation; Feature (linguistics); Disease; Decision tree; Robustness (evolution); Medicine; Mathematics; Pathology; Biology","score_opus":0.1777521107701318,"score_gpt":0.3285437996330684,"score_spread":0.1507916888629366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566735941","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.1864519,0.005401315,0.80373144,0.00058547605,0.00024566022,0.00008531883,0.00029017281,0.0017609594,0.0014476763],"genre_scores_gemma":[0.8927736,0.0008099378,0.10443046,0.00015794023,0.00018976683,0.00007158219,0.0006227967,0.000049836017,0.0008941065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989454,0.0005043208,0.000079604964,0.00016295914,0.00022524527,0.00008261699],"domain_scores_gemma":[0.99701846,0.0018080695,0.00021448506,0.00030739597,0.00052184897,0.00012972578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033303213,0.00096304313,0.0018799665,0.0024490536,0.0006457037,0.0008314771,0.0010193945,0.0009560475,0.0006054501],"category_scores_gemma":[0.005764847,0.00035753037,0.0008328243,0.001333038,0.0003737021,0.0010302534,0.00084647705,0.0010215343,0.00032647312],"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.00038422088,0.00022079989,0.0076819602,0.00008429321,0.00031072414,0.00010652206,0.000097935736,0.57443315,0.0027196421,0.002879437,0.0031337359,0.40794763],"study_design_scores_gemma":[0.000005183208,0.0000425497,0.0007428634,0.000008383391,0.000023245308,0.000020623505,0.00001066307,0.9957658,0.0005360829,0.0025906595,0.00024511243,0.000008878963],"about_ca_topic_score_codex":0.0044604028,"about_ca_topic_score_gemma":0.004023699,"teacher_disagreement_score":0.0044604028,"about_ca_system_score_codex":0.00048976793,"about_ca_system_score_gemma":0.0006893635,"threshold_uncertainty_score":0.017612636},"labels":[],"label_agreement":null},{"id":"W2567719433","doi":"10.1609/aaai.v30i1.10150","title":"Learning Deep Convolutional Neural Networks for X-Ray Protein Crystallization Image Analysis","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Enzyme Structure and Function","field":"Materials Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Convolutional neural network; Pipeline (software); Crystallization; Computer science; Protein crystallization; Artificial intelligence; Throughput; Deep learning; Pattern recognition (psychology); Process (computing); Image (mathematics); Contextual image classification; Data mining; Engineering","score_opus":0.030973984316346456,"score_gpt":0.26427213910501923,"score_spread":0.23329815478867277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567719433","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.08414223,0.0018050318,0.89689386,0.0007294118,0.000094756055,0.000101212936,0.0008652675,0.01210933,0.003258901],"genre_scores_gemma":[0.4804735,0.0013420796,0.50572675,0.0003545044,0.000070250164,0.00021493885,0.0030878477,0.0003355703,0.008394448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972004,0.0000504922,0.000013966353,0.00007644174,0.00008636348,0.00005265657],"domain_scores_gemma":[0.9995764,0.00016893326,0.000055935325,0.0000656593,0.0001101696,0.000022881213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007609385,0.00096631964,0.0006229387,0.00082801754,0.0003829479,0.0007875789,0.001351294,0.0009653327,0.0022358447],"category_scores_gemma":[0.0014977704,0.0005124105,0.0006640792,0.0009841983,0.00044022276,0.0010003042,0.00069751206,0.0012116989,0.0009016705],"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.00037273532,0.0003336739,0.00217895,0.00016584879,0.00013607986,0.00015481992,0.00006639243,0.47945166,0.0340044,0.007276187,0.011044027,0.46481514],"study_design_scores_gemma":[0.0000034551008,0.000008356358,0.00016162783,0.0000025580712,0.0000040229143,0.000007507548,0.0000030092388,0.9949393,0.0033673432,0.0010491794,0.0004502706,0.0000032721164],"about_ca_topic_score_codex":0.02129551,"about_ca_topic_score_gemma":0.025675032,"teacher_disagreement_score":0.02129551,"about_ca_system_score_codex":0.0020752787,"about_ca_system_score_gemma":0.0013394494,"threshold_uncertainty_score":0.04234314},"labels":[],"label_agreement":null},{"id":"W2567995295","doi":"10.1609/aaai.v30i1.9868","title":"What's Hot in Intelligent User Interfaces","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Personal Information Management and User Behavior","field":"Decision 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":"University of British Columbia","funders":"","keywords":"Computer science; Atlanta; User interface; Human–computer interaction; Intelligent decision support system; World Wide Web; Artificial intelligence; Operating system","score_opus":0.3859813767873521,"score_gpt":0.43311798685642744,"score_spread":0.047136610069075324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567995295","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008799752,0.75133705,0.00300801,0.16966651,0.05533903,0.000027517312,0.00015654636,0.0002441972,0.019341247],"genre_scores_gemma":[0.019384978,0.65580106,0.0065343147,0.14689048,0.13257942,0.00010931865,0.0004932877,0.0005630788,0.037644066],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99314064,0.0022321134,0.0006859122,0.00088887144,0.0024924974,0.00055987865],"domain_scores_gemma":[0.98026836,0.009155553,0.000894939,0.0010977923,0.0067975996,0.001785894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006784089,0.00086223765,0.0018498033,0.003976653,0.0021798043,0.012443019,0.0017699071,0.0068532866,0.020539105],"category_scores_gemma":[0.013659218,0.0006620393,0.0011117444,0.0072417366,0.0059253704,0.022749364,0.002348566,0.009177125,0.008336827],"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.00012549324,0.000100711324,0.000875155,0.0031357217,0.00007751599,0.00011584917,0.0011922817,0.00010671029,0.00069325726,0.019302232,0.5907114,0.3835637],"study_design_scores_gemma":[0.000011029449,0.000046991503,0.0011194103,0.002197842,0.000033687214,0.0003272429,0.0010205252,0.00011724535,0.00017968664,0.008296318,0.98661417,0.000035786812],"about_ca_topic_score_codex":0.0020897824,"about_ca_topic_score_gemma":0.003727394,"teacher_disagreement_score":0.020539105,"about_ca_system_score_codex":0.0015346009,"about_ca_system_score_gemma":0.0020675056,"threshold_uncertainty_score":0.06871015},"labels":[],"label_agreement":null},{"id":"W2568999269","doi":"10.1609/aaai.v30i1.10311","title":"Incremental Stochastic Factorization for Online Reinforcement Learning","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","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":"McGill University","funders":"","keywords":"Markov decision process; Reinforcement learning; Computer science; Non-negative matrix factorization; Probabilistic logic; Multiplicative function; Factorization; Divergence (linguistics); Bellman equation; Markov chain; Artificial intelligence; Markov process; Algorithm; Mathematical optimization; Theoretical computer science; Machine learning; Matrix decomposition; Mathematics; Eigenvalues and eigenvectors","score_opus":0.0805954660865807,"score_gpt":0.3016254592844599,"score_spread":0.2210299931978792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2568999269","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.0025191996,0.00029696326,0.9951029,0.00014586344,0.000048013306,0.00004198716,0.000041560535,0.00026025175,0.0015432932],"genre_scores_gemma":[0.6152559,0.0009133901,0.3754227,0.0003531865,0.00021975761,0.00069744914,0.00038439702,0.00016267455,0.0065905377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991328,0.00033014626,0.000043872646,0.00018608116,0.00022274694,0.000084446976],"domain_scores_gemma":[0.99751747,0.001804319,0.00017673247,0.00015804652,0.00025490916,0.00008851379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021666938,0.0013599123,0.0017024145,0.00064452505,0.00042154797,0.0008257763,0.0014480823,0.001172001,0.0061235065],"category_scores_gemma":[0.0074801273,0.000581144,0.0008201411,0.00071772636,0.0011043088,0.001296226,0.0011227395,0.0022679425,0.00081099564],"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.00008846946,0.000083039806,0.000448644,0.00016611865,0.00006207875,0.0000816758,0.00006157673,0.849345,0.00086179294,0.08141572,0.0027797483,0.06460611],"study_design_scores_gemma":[0.000010335289,0.000017486558,0.000029946676,0.000006324949,0.0000048498027,0.0000068724275,0.0000020502735,0.9773119,0.000110966146,0.021898752,0.0005959977,0.0000044912795],"about_ca_topic_score_codex":0.0061714747,"about_ca_topic_score_gemma":0.0070100524,"teacher_disagreement_score":0.0061714747,"about_ca_system_score_codex":0.0015454846,"about_ca_system_score_gemma":0.0017769826,"threshold_uncertainty_score":0.020485163},"labels":[],"label_agreement":null},{"id":"W2569162955","doi":"10.1609/aaai.v30i1.9910","title":"Big-Data Mechanisms and Energy-Policy Design","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Big Data Technologies and Applications","field":"Decision 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":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Leverage (statistics); Mechanism design; Incentive; Big data; Stakeholder; Computer science; Task (project management); Mechanism (biology); Risk analysis (engineering); Business; Economics; Microeconomics; Management","score_opus":0.565963653801508,"score_gpt":0.40025083783055404,"score_spread":0.165712815970954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2569162955","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.007167577,0.0016552402,0.95661986,0.022437155,0.00035280533,0.0010349051,0.0005204139,0.00069986493,0.009512046],"genre_scores_gemma":[0.29334125,0.0016412641,0.69379056,0.0033957579,0.00026344418,0.0036135816,0.0005457927,0.00019771415,0.0032105611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9433637,0.04416869,0.003125454,0.0034778607,0.0047157,0.0011486581],"domain_scores_gemma":[0.8273917,0.13091154,0.009346293,0.020837905,0.007869408,0.003643265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.1005324,0.001275325,0.0016395865,0.0035627428,0.0028670742,0.011939944,0.006037338,0.005622859,0.006247088],"category_scores_gemma":[0.124977835,0.0017342609,0.0021429565,0.0039354614,0.009445966,0.014107795,0.0076469886,0.006638131,0.000945715],"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.00013017487,0.00011313867,0.0018864747,0.00056882075,0.00018858253,0.00011858029,0.00044077152,0.04240035,0.0003529104,0.9123189,0.0032226522,0.03825869],"study_design_scores_gemma":[0.00011069599,0.00006192445,0.00020825054,0.00020204537,0.000051634674,0.00005252098,0.00026398795,0.048867088,0.00079854694,0.928673,0.020672599,0.000037759593],"about_ca_topic_score_codex":0.0035057282,"about_ca_topic_score_gemma":0.0034984977,"teacher_disagreement_score":0.1005324,"about_ca_system_score_codex":0.005868904,"about_ca_system_score_gemma":0.014336822,"threshold_uncertainty_score":0.5316725},"labels":[],"label_agreement":null},{"id":"W2575561059","doi":"10.1609/aaai.v30i1.9957","title":"Decision Sum-Product-Max Networks","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI 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":"University of Waterloo","funders":"","keywords":"Graphical model; Computer science; Influence diagram; Inference; Product (mathematics); Decision tree; Probabilistic logic; Treewidth; Class (philosophy); Extension (predicate logic); Mathematical optimization; Theoretical computer science; Artificial intelligence; Mathematics; Graph","score_opus":0.06666047892119044,"score_gpt":0.2876446630990715,"score_spread":0.22098418417788107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575561059","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.011570393,0.0003464495,0.9835271,0.0003997856,0.000059618207,0.0000807598,0.00030362906,0.00034252036,0.003369735],"genre_scores_gemma":[0.44782564,0.0007604546,0.53923523,0.00064845016,0.00017459609,0.0005047439,0.0013363715,0.0002659472,0.009248565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978237,0.0008912073,0.00014377623,0.0006930361,0.00029211515,0.00015611495],"domain_scores_gemma":[0.9934797,0.0048604356,0.0003746904,0.0005840524,0.0004930819,0.00020801745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032574637,0.0013563217,0.001994387,0.0008886288,0.0009662653,0.0019503745,0.0029076708,0.001948828,0.009385959],"category_scores_gemma":[0.013044312,0.0011448424,0.0013772111,0.0015191495,0.001856716,0.0058338377,0.0024085152,0.0028157602,0.0011800448],"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.0004187242,0.00014190351,0.0011859407,0.00038851224,0.00016787811,0.00017619516,0.00021698425,0.52793574,0.0016934735,0.2874628,0.008470942,0.1717409],"study_design_scores_gemma":[0.000020544529,0.00002474308,0.000060337847,0.000013169894,0.000019778669,0.00004026983,0.000012900799,0.7944525,0.0006235993,0.20289248,0.0018282156,0.000011433574],"about_ca_topic_score_codex":0.0017354831,"about_ca_topic_score_gemma":0.002713118,"teacher_disagreement_score":0.009385959,"about_ca_system_score_codex":0.0013834678,"about_ca_system_score_gemma":0.0013457597,"threshold_uncertainty_score":0.03139919},"labels":[],"label_agreement":null},{"id":"W2575899338","doi":"10.1609/aaai.v31i1.10911","title":"Policy Search with High-Dimensional Context Variables","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","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":"McGill University","funders":"Japan Society for the Promotion of Science; Deutsche Forschungsgemeinschaft","keywords":"Dimensionality reduction; Principal component analysis; Computer science; Machine learning; Artificial intelligence; Curse of dimensionality; Context (archaeology); Entropy (arrow of time); Pattern recognition (psychology)","score_opus":0.08807321710670347,"score_gpt":0.31399613779126334,"score_spread":0.22592292068455988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575899338","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.03664319,0.00071425847,0.9596988,0.00031687377,0.000056988592,0.00007295538,0.00004897493,0.0008058692,0.0016420715],"genre_scores_gemma":[0.80941975,0.0003090674,0.18722461,0.0003960934,0.00008655421,0.00024649242,0.00022010173,0.00019045077,0.001906986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893755,0.0004528317,0.00005746407,0.00029021106,0.00015089748,0.000111000496],"domain_scores_gemma":[0.9980938,0.0012633502,0.00015305977,0.00021423284,0.00017567276,0.00010005543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016791046,0.0011054166,0.0021465793,0.0006936963,0.000625027,0.00087297126,0.0013444397,0.0015941627,0.0021007783],"category_scores_gemma":[0.007160951,0.0006983911,0.00083415466,0.0006700008,0.0011894696,0.0018684373,0.0016671043,0.0016918491,0.00042463033],"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.00015597494,0.00014118373,0.0008240053,0.00011126337,0.00008224053,0.000097894204,0.00010009364,0.90717566,0.0016747087,0.019421024,0.0017241257,0.06849174],"study_design_scores_gemma":[0.0000141529335,0.00002085384,0.00005609281,0.000005189793,0.0000065855993,0.000011125071,0.0000062057143,0.99364954,0.00022487743,0.0058100787,0.00019091199,0.000004417468],"about_ca_topic_score_codex":0.0047144364,"about_ca_topic_score_gemma":0.005380782,"teacher_disagreement_score":0.0047144364,"about_ca_system_score_codex":0.0010780406,"about_ca_system_score_gemma":0.001971189,"threshold_uncertainty_score":0.009373963},"labels":[],"label_agreement":null},{"id":"W2577122409","doi":"10.1609/aaai.v30i1.10214","title":"Common and Discriminative Subspace Kernel-Based Multiblock Tensor Partial Least Squares Regression","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Discriminative model; Multilinear map; Tensor (intrinsic definition); Kernel (algebra); Pattern recognition (psychology); Artificial intelligence; Mathematics; Computer science; Linear subspace; Subspace topology; Discrete mathematics","score_opus":0.13102826435870088,"score_gpt":0.3652290948497541,"score_spread":0.2342008304910532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577122409","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.0037387146,0.000116071686,0.99549615,0.00004084837,0.00001751503,0.000011849681,0.000038987604,0.00033444923,0.00020538353],"genre_scores_gemma":[0.24782814,0.00058112823,0.74529064,0.000114662405,0.00011666129,0.00011096305,0.0010124106,0.00043081117,0.0045146854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886143,0.0003819555,0.000060555918,0.0003092512,0.00027678013,0.00011001146],"domain_scores_gemma":[0.9985031,0.00043750033,0.00020943125,0.00034667263,0.00041236097,0.00009110184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012818023,0.0016584505,0.0013711113,0.00094258407,0.00041487,0.00086780026,0.0016763126,0.00097017887,0.0017266201],"category_scores_gemma":[0.004195549,0.0006209746,0.0012359981,0.0013201445,0.0008775569,0.002185098,0.0012271601,0.001552124,0.0013427563],"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.00020234087,0.00013830357,0.0019314407,0.00023810258,0.00017931212,0.00014040465,0.0001364931,0.6104566,0.024730539,0.022848776,0.0038497446,0.33514792],"study_design_scores_gemma":[0.0000022734428,0.000014243073,0.000117670425,0.0000026546309,0.000006911549,0.00001873431,0.000005492566,0.9960348,0.0012835439,0.0019703533,0.0005354961,0.000007742],"about_ca_topic_score_codex":0.0050130757,"about_ca_topic_score_gemma":0.0069134724,"teacher_disagreement_score":0.0050130757,"about_ca_system_score_codex":0.0005419326,"about_ca_system_score_gemma":0.0013639806,"threshold_uncertainty_score":0.009967804},"labels":[],"label_agreement":null},{"id":"W2579842701","doi":"10.1609/aaai.v30i1.9941","title":"Efficient Collaborative Crowdsourcing","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":39,"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":"National Research Foundation","keywords":"Crowdsourcing; Computer science; Task (project management); Profit (economics); Crowdsourcing software development; Quality (philosophy); Data science; Knowledge management; World Wide Web; Engineering; Microeconomics","score_opus":0.03784253213540263,"score_gpt":0.26560864876638113,"score_spread":0.2277661166309785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579842701","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.020038674,0.00060914346,0.9674685,0.00083070924,0.00013555169,0.00025982934,0.00014623012,0.000596283,0.009915032],"genre_scores_gemma":[0.73190105,0.0006744179,0.25273237,0.00039959993,0.00021989121,0.00042157527,0.0003069889,0.00027019056,0.013073963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949261,0.0015187991,0.0002118371,0.0012898212,0.0013791033,0.0006743369],"domain_scores_gemma":[0.9927435,0.003802795,0.0005627096,0.0014367579,0.0009337303,0.0005204843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049578776,0.0019076077,0.0026354224,0.0012071949,0.0023406458,0.0033514348,0.0046277735,0.003553544,0.006390113],"category_scores_gemma":[0.014027664,0.0011570657,0.001133251,0.0020101392,0.002015091,0.0038060814,0.0058157537,0.002039076,0.0018336707],"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.00036447722,0.00021913728,0.0008785595,0.00034713367,0.00015577827,0.00034515696,0.00040006582,0.83268964,0.006737861,0.049288444,0.00701965,0.10155403],"study_design_scores_gemma":[0.00006728087,0.000105779356,0.0002345627,0.000023160823,0.000036085294,0.0000873921,0.00012333973,0.9125799,0.0021206865,0.07820684,0.0063811033,0.00003382743],"about_ca_topic_score_codex":0.0055052545,"about_ca_topic_score_gemma":0.0044484325,"teacher_disagreement_score":0.006390113,"about_ca_system_score_codex":0.0020220887,"about_ca_system_score_gemma":0.0026981235,"threshold_uncertainty_score":0.026220083},"labels":[],"label_agreement":null},{"id":"W2582886532","doi":"10.1609/aaai.v31i1.11111","title":"Discovering Conversational Dependencies between Messages in Dialogs","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":15,"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; Natural language processing; Probabilistic logic; Classifier (UML); Task (project management); Set (abstract data type); Customer service; Artificial intelligence; Information retrieval; Heuristic; Online chat; Service (business); World Wide Web; The Internet","score_opus":0.12033444732769798,"score_gpt":0.3256685017205043,"score_spread":0.20533405439280633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582886532","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.708367,0.002329317,0.2767064,0.0009580941,0.000104360675,0.0003127857,0.0032871603,0.002161723,0.005773199],"genre_scores_gemma":[0.9552625,0.00034551098,0.040142577,0.00007560337,0.0001413702,0.000106133724,0.0025253533,0.00007729173,0.0013236941],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986614,0.00043053651,0.00008052265,0.00043343435,0.00025162695,0.00014248332],"domain_scores_gemma":[0.99082094,0.006998223,0.000734719,0.00032977344,0.00079257984,0.0003237938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015696461,0.0010845058,0.0006897479,0.002690762,0.0012044929,0.0010345569,0.00082715566,0.0009847662,0.0013677536],"category_scores_gemma":[0.009615527,0.00053469563,0.0006803939,0.0010200659,0.00040754766,0.0026599346,0.00097404805,0.0013373393,0.001078787],"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.002232578,0.0018138739,0.18451405,0.0012227994,0.00040662297,0.0019305972,0.0057243016,0.053004336,0.080012105,0.0064091166,0.01249752,0.65023214],"study_design_scores_gemma":[0.000036625122,0.00023834936,0.057520613,0.000069841204,0.00017927717,0.00041642663,0.00081016903,0.910394,0.015861312,0.009139872,0.0052680112,0.000065653425],"about_ca_topic_score_codex":0.007282442,"about_ca_topic_score_gemma":0.01142543,"teacher_disagreement_score":0.007282442,"about_ca_system_score_codex":0.0006091819,"about_ca_system_score_gemma":0.0011392881,"threshold_uncertainty_score":0.014480114},"labels":[],"label_agreement":null},{"id":"W2584220694","doi":"10.1609/aaai.v32i1.11321","title":"RUBER: An Unsupervised Method for Automatic Evaluation of Open-Domain Dialog Systems","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":162,"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":"National Key Research and Development Program of China; National Natural Science Foundation of China; Tencent; National Science Foundation","keywords":"Dialog box; Computer science; Annotation; Metric (unit); Open domain; Artificial intelligence; Utterance; Domain (mathematical analysis); Natural language processing; Dialog system; Transferability; Conversation; Information retrieval; Machine learning; World Wide Web; Linguistics; Mathematics","score_opus":0.24357062726124815,"score_gpt":0.40746944321116096,"score_spread":0.16389881594991282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2584220694","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.018759256,0.000873649,0.9121875,0.00015596156,0.00021258116,0.00086179655,0.00425271,0.058453888,0.004242569],"genre_scores_gemma":[0.21574593,0.00025985835,0.75768465,0.0002211047,0.00015071488,0.0020291654,0.01354065,0.0042313305,0.006136598],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9802033,0.009049145,0.0017738988,0.0044495347,0.0038574808,0.00066671986],"domain_scores_gemma":[0.98418945,0.0063555124,0.0011651951,0.0032336512,0.004440743,0.0006154997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010365751,0.0034801206,0.0016399496,0.0068818056,0.0012934154,0.0028776391,0.0035780305,0.0022827848,0.0065282215],"category_scores_gemma":[0.03332132,0.00072465965,0.0014594357,0.0026709717,0.0010262633,0.004353632,0.0047396366,0.002548281,0.0073789777],"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.00077920005,0.0004602764,0.005079574,0.0014278381,0.00045655298,0.00020450017,0.0017469849,0.015894953,0.03504214,0.0093045635,0.048210744,0.88139266],"study_design_scores_gemma":[0.00020740632,0.000726643,0.011364924,0.00024600836,0.00016952389,0.00062392076,0.0011800678,0.8185634,0.069659404,0.032227036,0.06461286,0.00041883206],"about_ca_topic_score_codex":0.0030475378,"about_ca_topic_score_gemma":0.0056651896,"teacher_disagreement_score":0.010365751,"about_ca_system_score_codex":0.0013847525,"about_ca_system_score_gemma":0.0023178593,"threshold_uncertainty_score":0.05482},"labels":[],"label_agreement":null},{"id":"W2593237273","doi":"10.1609/aaai.v32i1.11631","title":"Multi-Step Reinforcement Learning: A Unifying Algorithm","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates; DeepMind","keywords":"Reinforcement learning; Computer science; Backup; Algorithm; TRACE (psycholinguistics); Sampling (signal processing); Focus (optics); Monte Carlo method; Importance sampling; Artificial intelligence; Machine learning; Mathematics","score_opus":0.09247718432083181,"score_gpt":0.31363613619094266,"score_spread":0.22115895187011086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593237273","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.0043565007,0.00012386667,0.99379635,0.00017328857,0.00002700765,0.00005120847,0.000009462159,0.00049820414,0.0009641481],"genre_scores_gemma":[0.26403397,0.00020196322,0.73253405,0.00030177055,0.0000790517,0.00026469538,0.00006869081,0.00021737716,0.0022983516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790597,0.000637068,0.00014626875,0.00059276674,0.00054718833,0.00017068745],"domain_scores_gemma":[0.99623775,0.0022688603,0.0002181543,0.00069558504,0.0003746171,0.00020501325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051256567,0.0010897092,0.0016828169,0.00083400647,0.00058709964,0.0013436697,0.0033492136,0.002242376,0.0021321499],"category_scores_gemma":[0.010697602,0.00059134385,0.0007992157,0.0006536894,0.001699375,0.0030623088,0.0029024207,0.003134806,0.00063576724],"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.00022776281,0.00022486318,0.0013231089,0.000122043624,0.000075025084,0.000070562135,0.00022952475,0.6289505,0.0030763058,0.100575306,0.0018595569,0.2632655],"study_design_scores_gemma":[0.000024348688,0.00004901222,0.000036078978,0.000009986517,0.000006142607,0.00001603444,0.000004921979,0.98259616,0.0006418874,0.015958874,0.0006500112,0.0000065829568],"about_ca_topic_score_codex":0.0021413197,"about_ca_topic_score_gemma":0.0020102465,"teacher_disagreement_score":0.0051256567,"about_ca_system_score_codex":0.0012756105,"about_ca_system_score_gemma":0.00221014,"threshold_uncertainty_score":0.027107358},"labels":[],"label_agreement":null},{"id":"W2599839051","doi":"10.1609/aaai.v31i1.10502","title":"Expectile Matrix Factorization for Skewed Data Analysis","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Alberta","funders":"","keywords":"Matrix decomposition; Matrix (chemical analysis); Factorization; Mathematics; Rank (graph theory); Algorithm; Matrix completion; Least-squares function approximation; Mathematical optimization; Computer science; Statistics; Combinatorics; Eigenvalues and eigenvectors","score_opus":0.17737984857863723,"score_gpt":0.3631672490427594,"score_spread":0.18578740046412215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599839051","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.001341605,0.000092996845,0.9979153,0.00011171057,0.000017556507,0.000018044,0.000055942743,0.00014041424,0.00030642594],"genre_scores_gemma":[0.14721133,0.00072131783,0.84637463,0.00048980495,0.00022940588,0.00038428168,0.0009898419,0.00023713085,0.0033621676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769706,0.00095464604,0.000094637675,0.0003999215,0.00071626285,0.00013743789],"domain_scores_gemma":[0.9935276,0.0036246832,0.00063675834,0.0011059699,0.0009173894,0.00018754166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003354966,0.0014196578,0.0011704648,0.0009859505,0.000738184,0.0011128141,0.0013337675,0.0014072835,0.0035797546],"category_scores_gemma":[0.015155205,0.0005278524,0.00097308605,0.0011333568,0.0014146899,0.0019987891,0.0022982387,0.0029592714,0.0018267245],"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.00032324492,0.00015322222,0.0027675673,0.000472176,0.00017998935,0.0005930904,0.00042128278,0.47683775,0.016026616,0.16715929,0.01962274,0.31544307],"study_design_scores_gemma":[0.000014635062,0.000042533895,0.00032381495,0.000027452179,0.000007861311,0.00013217295,0.0000434182,0.9425847,0.0021099185,0.050114684,0.004577116,0.000021764356],"about_ca_topic_score_codex":0.0022688683,"about_ca_topic_score_gemma":0.0034271423,"teacher_disagreement_score":0.0035797546,"about_ca_system_score_codex":0.00064594037,"about_ca_system_score_gemma":0.0013675992,"threshold_uncertainty_score":0.017742991},"labels":[],"label_agreement":null},{"id":"W2604173138","doi":"10.1609/aaai.v31i1.11056","title":"Hindsight Optimization for Hybrid State and Action MDPs","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":13,"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":"National Science Foundation","keywords":"Computer science; Mathematical optimization; Markov decision process; Upper and lower bounds; Piecewise linear function; Formalism (music); Action selection; Scaling; Markov process; Mathematics","score_opus":0.13164595548725436,"score_gpt":0.330156495202359,"score_spread":0.19851053971510466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604173138","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.019078657,0.00031924358,0.97628343,0.00028338953,0.00003587725,0.00008717028,0.00017545551,0.0005699839,0.0031667496],"genre_scores_gemma":[0.6383772,0.00027931467,0.3556122,0.00036445033,0.000049435355,0.0003678104,0.0005863046,0.0002687209,0.0040945923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847025,0.00071002584,0.00007392354,0.00035869464,0.00023966127,0.00014735098],"domain_scores_gemma":[0.99374133,0.005210035,0.00039678175,0.00020081399,0.0002371573,0.00021388283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003080574,0.0016764507,0.0013784813,0.0007730906,0.0004979038,0.0013786494,0.0014412408,0.001312527,0.0054420256],"category_scores_gemma":[0.008410472,0.0009417955,0.001117171,0.00064690365,0.0014783969,0.0017041585,0.0020276285,0.0026030876,0.00054568634],"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.00005069778,0.000027527916,0.00025708915,0.000046779922,0.000019161018,0.000029083623,0.000022407352,0.9829486,0.0001975364,0.008565721,0.00039866194,0.0074367854],"study_design_scores_gemma":[0.000008698145,0.000015538999,0.000025285843,0.0000052455107,0.0000030158706,0.0000046962596,0.000005007039,0.9923394,0.00012337099,0.0072797784,0.0001874539,0.000002447477],"about_ca_topic_score_codex":0.0049872384,"about_ca_topic_score_gemma":0.005670914,"teacher_disagreement_score":0.0054420256,"about_ca_system_score_codex":0.0017006107,"about_ca_system_score_gemma":0.002112024,"threshold_uncertainty_score":0.018205404},"labels":[],"label_agreement":null},{"id":"W2604181050","doi":"10.1609/aaai.v31i1.10658","title":"Problem Difficulty and the Phase Transition in Heuristic Search","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Heuristic; Benchmark (surveying); Mathematical optimization; Computer science; Incremental heuristic search; Phase transition; Beam search; Greedy algorithm; Work (physics); Search algorithm; Mathematics; Physics; Thermodynamics","score_opus":0.09672332879444981,"score_gpt":0.35426040957173177,"score_spread":0.257537080777282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604181050","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.5558979,0.0037545473,0.40229014,0.006910126,0.00012928869,0.00032852424,0.00043144877,0.00054968946,0.02970838],"genre_scores_gemma":[0.9460918,0.0010981763,0.049798705,0.00037735724,0.00012102635,0.0003232097,0.000328195,0.00018853752,0.0016729684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964516,0.0017279224,0.00016686562,0.00048364722,0.00077179144,0.00039811176],"domain_scores_gemma":[0.93780357,0.052747507,0.004019325,0.0028633266,0.0015714952,0.000994745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048157773,0.00070862257,0.0011260331,0.0017590106,0.001029363,0.0031708223,0.001190951,0.0019282436,0.0040426366],"category_scores_gemma":[0.07929777,0.0010498861,0.0013010033,0.0014128125,0.0042912164,0.0077050584,0.0025743416,0.0038255847,0.00041776372],"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.00057078304,0.00045918982,0.010628535,0.00074818876,0.0002504839,0.0003350851,0.0017363523,0.42932126,0.0050797565,0.508172,0.004348453,0.03834995],"study_design_scores_gemma":[0.0001402344,0.000249205,0.0031738738,0.00011599261,0.000039980678,0.00021003607,0.0004364455,0.45350647,0.0018360451,0.5356756,0.004571169,0.000045016004],"about_ca_topic_score_codex":0.0014052638,"about_ca_topic_score_gemma":0.0008822002,"teacher_disagreement_score":0.0048157773,"about_ca_system_score_codex":0.0017458268,"about_ca_system_score_gemma":0.0012575238,"threshold_uncertainty_score":0.025468528},"labels":[],"label_agreement":null},{"id":"W2604196750","doi":"10.1609/aaai.v31i1.10657","title":"Efficient Parameter Importance Analysis via Ablation with Surrogates","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Computer science; Satisfiability; Range (aeronautics); Integer programming; Set (abstract data type); Process (computing); Mathematical optimization; Class (philosophy); Solver; Algorithm; Artificial intelligence; Mathematics; Programming language","score_opus":0.06480095062167711,"score_gpt":0.29528038762647346,"score_spread":0.23047943700479634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604196750","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.022222335,0.0002370801,0.97227556,0.0003043495,0.00003855255,0.000090594825,0.00015872056,0.002072303,0.0026006203],"genre_scores_gemma":[0.47752076,0.00022613759,0.5176364,0.0002853676,0.00005246429,0.00047037768,0.0010564227,0.0009814017,0.001770588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949254,0.0028403474,0.00019360048,0.00054967235,0.0011568062,0.0003342167],"domain_scores_gemma":[0.9762841,0.01782049,0.0011644646,0.00278837,0.0016627347,0.0002797923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006572953,0.0018454696,0.00158948,0.0016383586,0.0007676851,0.0024028325,0.0019540556,0.0016797435,0.003579459],"category_scores_gemma":[0.046574805,0.00111178,0.0014928323,0.0012766971,0.0013193174,0.0025042968,0.0026331889,0.0033966738,0.0011340803],"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.0002256969,0.00012460338,0.0025844537,0.00014475064,0.000070313086,0.000117445976,0.00011829028,0.9032007,0.0033759957,0.018635789,0.0027571805,0.06864479],"study_design_scores_gemma":[0.000012232648,0.000022341424,0.00012360347,0.000010248568,0.000006202096,0.000017428349,0.000011251805,0.9870576,0.000998129,0.01121082,0.00052438927,0.000005751459],"about_ca_topic_score_codex":0.0021672908,"about_ca_topic_score_gemma":0.0025632605,"teacher_disagreement_score":0.006572953,"about_ca_system_score_codex":0.0012582013,"about_ca_system_score_gemma":0.0025180252,"threshold_uncertainty_score":0.03476149},"labels":[],"label_agreement":null},{"id":"W2604207308","doi":"10.1609/aaai.v31i1.10973","title":"Disambiguating Spatial Prepositions Using Deep Convolutional Networks","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Geographic Information Systems Studies","field":"Social Sciences","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 Ottawa","funders":"","keywords":"Computer science; Artificial intelligence; Convolutional neural network; Feature (linguistics); Natural language processing; Word (group theory); Deep learning; Set (abstract data type); Feature engineering; Pattern recognition (psychology); Linguistics","score_opus":0.13856550472782964,"score_gpt":0.3622023285665965,"score_spread":0.22363682383876687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604207308","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.4978754,0.0034950285,0.4490753,0.0010829654,0.0007802949,0.00023499937,0.011108629,0.01278406,0.023563303],"genre_scores_gemma":[0.77703184,0.00068086584,0.19979894,0.00026406947,0.00009316789,0.00006806311,0.014303176,0.00025607628,0.007503709],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949896,0.00008401643,0.000053990538,0.00020817282,0.00008119523,0.00007366054],"domain_scores_gemma":[0.99922335,0.00026192344,0.000106785505,0.00015154095,0.00021431972,0.000042204385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048498774,0.0013142307,0.00052250363,0.001768452,0.0006350366,0.0009630228,0.000911904,0.0007496254,0.003990125],"category_scores_gemma":[0.001688953,0.00038748773,0.00071977166,0.0013225923,0.0005866144,0.0031989706,0.0013608575,0.0011712215,0.0024553102],"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.00086646376,0.00032113385,0.018377507,0.0008600878,0.0001925577,0.0017927008,0.0010606942,0.03422627,0.070821114,0.013178408,0.032261048,0.82604206],"study_design_scores_gemma":[0.00010179274,0.0002408082,0.015637496,0.00020883128,0.0002544587,0.0014818618,0.0016403489,0.7610595,0.1137824,0.031697363,0.07375954,0.00013554339],"about_ca_topic_score_codex":0.008521514,"about_ca_topic_score_gemma":0.017065903,"teacher_disagreement_score":0.008521514,"about_ca_system_score_codex":0.000631078,"about_ca_system_score_gemma":0.001133074,"threshold_uncertainty_score":0.016943872},"labels":[],"label_agreement":null},{"id":"W2604239885","doi":"10.1609/aaai.v31i1.10873","title":"Adaptive Proximal Average Approximation for Composite Convex Minimization","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Zhejiang University; University of Waterloo; National Science Foundation","keywords":"Minification; Convergence (economics); Regular polygon; Proximal Gradient Methods; Mathematical optimization; Lasso (programming language); Algorithm; Computer science; Mathematics; Convex function; Convex optimization; Graph; Combinatorics","score_opus":0.08504970923303085,"score_gpt":0.2885937885056267,"score_spread":0.20354407927259588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604239885","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.0008283444,0.000057907582,0.998645,0.000033312182,0.000014943636,0.000007255397,0.000007636387,0.00009289079,0.00031274706],"genre_scores_gemma":[0.11121028,0.0003396564,0.8840954,0.00014281282,0.00013530765,0.0001637638,0.00013414487,0.00019386104,0.0035848087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999258,0.00019420523,0.000027554774,0.00012416374,0.00033785086,0.00005823885],"domain_scores_gemma":[0.9991524,0.00044596408,0.0000804879,0.000099566605,0.00016565048,0.000055800214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011909764,0.0011409927,0.0013706216,0.00072088855,0.000438778,0.0009281934,0.0015345395,0.0013429903,0.002589469],"category_scores_gemma":[0.0026882016,0.00054655905,0.0011909821,0.0009597446,0.00095733535,0.0011710782,0.0017095626,0.0025406713,0.0010125258],"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.00013533019,0.0000705766,0.00044318716,0.00026760623,0.00011016788,0.00013408331,0.0001392209,0.7636189,0.010147398,0.060766324,0.00503011,0.15913707],"study_design_scores_gemma":[0.000004580551,0.000016262324,0.000023733206,0.0000032703895,0.0000038244066,0.000018876162,0.0000033224355,0.9947747,0.0007015087,0.0036063099,0.00083948794,0.000004140907],"about_ca_topic_score_codex":0.0018458571,"about_ca_topic_score_gemma":0.0018767312,"teacher_disagreement_score":0.002589469,"about_ca_system_score_codex":0.0004955688,"about_ca_system_score_gemma":0.0013733356,"threshold_uncertainty_score":0.008662641},"labels":[],"label_agreement":null},{"id":"W2604249670","doi":"10.1609/aaai.v31i1.10788","title":"Convex Co-Embedding for Matrix Completion with Predictive Side Information","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Matrix completion; Embedding; Low-rank approximation; Matrix (chemical analysis); Matrix decomposition; Computer science; Matrix norm; Algorithm; Exploit; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.06051471548726226,"score_gpt":0.3195898642032612,"score_spread":0.2590751487159989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604249670","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.0018757812,0.000097028875,0.99718446,0.000102729406,0.000015784066,0.000023865505,0.000040383093,0.00011003917,0.0005498751],"genre_scores_gemma":[0.25228816,0.0009217338,0.7379088,0.00028534397,0.0002498928,0.0005300199,0.0009959221,0.0004145977,0.006405512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984964,0.00064978004,0.00005907753,0.00029691416,0.00040820058,0.00008975798],"domain_scores_gemma":[0.9951213,0.0029771153,0.00038608885,0.0006311922,0.0006782063,0.00020601285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022789065,0.001781864,0.0015630056,0.00080405106,0.0005612786,0.0011283467,0.0016563005,0.0016357913,0.0038364907],"category_scores_gemma":[0.008794292,0.0005951265,0.0010041422,0.0012274921,0.002056202,0.0024799684,0.0022521333,0.0039228755,0.0014090704],"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.00015071825,0.00014104722,0.000498992,0.0003411382,0.00007896488,0.00023184756,0.00016401257,0.76463467,0.0060418244,0.1387806,0.0071665794,0.08176968],"study_design_scores_gemma":[0.0000039739625,0.000017410157,0.00003895588,0.000005077029,0.0000026289092,0.00002309121,0.000007284545,0.9810963,0.0005949642,0.017563231,0.0006405047,0.0000065667064],"about_ca_topic_score_codex":0.0029003227,"about_ca_topic_score_gemma":0.0030388476,"teacher_disagreement_score":0.0038364907,"about_ca_system_score_codex":0.00083269854,"about_ca_system_score_gemma":0.0015583801,"threshold_uncertainty_score":0.0128343105},"labels":[],"label_agreement":null},{"id":"W2604272310","doi":"10.1609/aaai.v31i2.19102","title":"Crowdsensing Air Quality with Camera-Enabled Mobile Devices","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":66,"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":"Nanyang Technological University; National Research Foundation","keywords":"Crowdsensing; Computer science; Air quality index; Scalability; Mobile device; Quality (philosophy); Analytics; Real-time computing; Artificial intelligence; Data mining; Data science; Database","score_opus":0.07407773828354826,"score_gpt":0.318293629477468,"score_spread":0.24421589119391973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604272310","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.53477436,0.0041956725,0.39296353,0.0030170304,0.0009924282,0.0017690858,0.0029569129,0.008322546,0.051008437],"genre_scores_gemma":[0.9177807,0.0005157725,0.076496266,0.00056787103,0.00016033158,0.0002748243,0.00045394644,0.00007020572,0.003680206],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99924254,0.00017277976,0.000025573345,0.00018343142,0.00030155663,0.000074059426],"domain_scores_gemma":[0.99906594,0.0004430688,0.00009258689,0.00013031802,0.00019328258,0.00007487125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004679046,0.00068144087,0.0005726295,0.00071895204,0.0004867797,0.00072530704,0.00078559294,0.0007481146,0.0016189466],"category_scores_gemma":[0.0022538537,0.00029023777,0.00042075483,0.00048459912,0.00032808844,0.0007356089,0.0016474302,0.0005579686,0.00059192214],"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.0029084466,0.0009137976,0.033600293,0.001827705,0.0005176305,0.0020430337,0.0025228006,0.07337429,0.15778926,0.0076100035,0.031874724,0.685018],"study_design_scores_gemma":[0.0005015604,0.0014522028,0.034053426,0.0003408822,0.00034013143,0.0011817623,0.0015393108,0.7950949,0.07372133,0.02029432,0.0712099,0.00027030063],"about_ca_topic_score_codex":0.006676659,"about_ca_topic_score_gemma":0.008251197,"teacher_disagreement_score":0.006676659,"about_ca_system_score_codex":0.00047552894,"about_ca_system_score_gemma":0.00041303626,"threshold_uncertainty_score":0.013275623},"labels":[],"label_agreement":null},{"id":"W2604296014","doi":"10.1609/aaai.v31i1.11143","title":"Getting More Out of the Exposed Structure in Constraint Programming Models of Combinatorial Problems","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Constraint programming; Constraint (computer-aided design); Mathematical optimization; Computer science; Set (abstract data type); Key (lock); Computation; Combinatorial optimization; Theoretical computer science; Constraint satisfaction; Constraint logic programming; Mathematics; Algorithm; Stochastic programming; Artificial intelligence; Programming language","score_opus":0.0762784727144263,"score_gpt":0.29231251834197863,"score_spread":0.21603404562755235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604296014","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.0090788035,0.0040981616,0.932198,0.03847667,0.0005499592,0.0000616248,0.00042578002,0.00034560484,0.014765585],"genre_scores_gemma":[0.30027828,0.020831492,0.6471278,0.010324472,0.0047506113,0.00042466895,0.0014845369,0.0011733003,0.013604734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99152774,0.0039368547,0.00028655087,0.0011215593,0.0027946804,0.0003326766],"domain_scores_gemma":[0.9763059,0.014900748,0.00085240573,0.005742603,0.0015636303,0.00063464785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006501762,0.0015502195,0.0018496043,0.0018457297,0.0017755514,0.007829968,0.0029516825,0.003205727,0.011467376],"category_scores_gemma":[0.034690604,0.0016316086,0.0023043565,0.0037217988,0.008519189,0.029403841,0.0057142107,0.019019851,0.0023713964],"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.000034907487,0.000059143003,0.0004069212,0.00024524613,0.000060400722,0.00010092526,0.0005120912,0.015924728,0.0005851803,0.9480636,0.008000964,0.02600594],"study_design_scores_gemma":[0.000016783106,0.000016565285,0.00012564495,0.00010414425,0.000013026021,0.000055855988,0.000104356914,0.039086133,0.0002514969,0.94192713,0.018271744,0.000027087219],"about_ca_topic_score_codex":0.0050783795,"about_ca_topic_score_gemma":0.0057648937,"teacher_disagreement_score":0.011467376,"about_ca_system_score_codex":0.0030073423,"about_ca_system_score_gemma":0.0032554916,"threshold_uncertainty_score":0.038362145},"labels":[],"label_agreement":null},{"id":"W2604334159","doi":"10.1609/aaai.v31i1.10758","title":"Low-Rank Linear Cold-Start Recommendation from Social Data","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":72,"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; Scalability; Cold start (automotive); Metadata; Collaborative filtering; Weighting; Hyperparameter; Rank (graph theory); Information retrieval; Recommender system; Data mining; Machine learning; Artificial intelligence; World Wide Web; Mathematics","score_opus":0.22026851021350677,"score_gpt":0.35775471147378285,"score_spread":0.13748620126027608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604334159","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.024061536,0.0009776691,0.97086424,0.0006613347,0.000093860595,0.00014548094,0.0006615615,0.0011504511,0.0013838316],"genre_scores_gemma":[0.548507,0.0012085027,0.4224989,0.0014564331,0.0007238237,0.00082571624,0.0065689767,0.0003603634,0.017850252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99572146,0.0017600432,0.0002106306,0.001163979,0.0008186328,0.00032525067],"domain_scores_gemma":[0.9900147,0.005905679,0.00074500334,0.0017409663,0.0012873792,0.0003062586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004775673,0.0024283587,0.003988666,0.001655594,0.0014588715,0.0023573574,0.0044867443,0.0031077585,0.0027033698],"category_scores_gemma":[0.013239258,0.0015159899,0.0018305959,0.0027186715,0.0018601498,0.0036243256,0.002034633,0.0039019051,0.0029450953],"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.00094671187,0.0006576445,0.0066549047,0.0007849056,0.0005905446,0.00036472286,0.00066552666,0.7287252,0.0079561705,0.02471583,0.024844583,0.20309323],"study_design_scores_gemma":[0.000032644934,0.00008209105,0.0004359721,0.000024595183,0.000030774045,0.000045249417,0.000038757542,0.98794156,0.0010296814,0.009069055,0.0012428066,0.000026751084],"about_ca_topic_score_codex":0.018305797,"about_ca_topic_score_gemma":0.037300456,"teacher_disagreement_score":0.018305797,"about_ca_system_score_codex":0.0015843583,"about_ca_system_score_gemma":0.0018497814,"threshold_uncertainty_score":0.03639853},"labels":[],"label_agreement":null},{"id":"W2604384918","doi":"10.1609/aaai.v31i1.10618","title":"Resource Graph Games: A Compact Representation for Games with Structured Strategy Spaces","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Applications","field":"Decision Sciences","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 British Columbia","funders":"","keywords":"Multilinear map; Computer science; Leverage (statistics); Theoretical computer science; Common value auction; Representation (politics); Graph; Key (lock); Range (aeronautics); Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.2702547147049079,"score_gpt":0.4295086686081825,"score_spread":0.15925395390327457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604384918","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.0049340227,0.00017907181,0.9900705,0.00021660293,0.000038424998,0.00010801282,0.00049949525,0.00030542997,0.003648537],"genre_scores_gemma":[0.21131517,0.00086211006,0.778411,0.00031429878,0.000122024736,0.0008782555,0.0018661328,0.00029869349,0.005932351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989164,0.0004075098,0.00007917314,0.000254342,0.00023884383,0.000103763334],"domain_scores_gemma":[0.99880016,0.0005550199,0.00017616263,0.00024769266,0.00014331497,0.00007750331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010089753,0.0016505271,0.0011534397,0.0013476266,0.0005966398,0.002459082,0.0018423577,0.0011626214,0.00579054],"category_scores_gemma":[0.004642181,0.00061457884,0.0017295684,0.0016800833,0.0014591417,0.0047798585,0.0017779202,0.0030468903,0.0011610973],"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.00004346558,0.000052811192,0.00031798342,0.000116139374,0.00003385549,0.00013701656,0.00031936425,0.11965629,0.00120602,0.84522945,0.0037137973,0.029173834],"study_design_scores_gemma":[0.000019619989,0.000026589827,0.000075368785,0.000036903297,0.000016336026,0.00007382479,0.000065886445,0.34288746,0.0003922849,0.64642054,0.00996882,0.000016360644],"about_ca_topic_score_codex":0.004604123,"about_ca_topic_score_gemma":0.004912051,"teacher_disagreement_score":0.00579054,"about_ca_system_score_codex":0.001359652,"about_ca_system_score_gemma":0.0011116242,"threshold_uncertainty_score":0.019371271},"labels":[],"label_agreement":null},{"id":"W2604400671","doi":"10.1609/aaai.v31i1.11181","title":"Healthy Cognitive Aging: A Hybrid Random Vector Functional-Link Model for the Analysis of Alzheimer’s Disease","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Dementia and Cognitive Impairment Research","field":"Medicine","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":"Western University","funders":"National Institutes of Health; Alzheimer's Disease Neuroimaging Initiative; U.S. Department of Defense","keywords":"Random forest; Support vector machine; Computer science; Artificial intelligence; Machine learning; Neuroimaging; Multilayer perceptron; Disease; Clinical trial; Cognition; Linear discriminant analysis; Decision tree; Artificial neural network; Medicine; Psychology; Neuroscience; Pathology","score_opus":0.18613073094221322,"score_gpt":0.39940128726448343,"score_spread":0.2132705563222702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604400671","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.10355267,0.0011091831,0.8919481,0.0005894317,0.00009411419,0.000062973704,0.00021245802,0.00066699315,0.0017640843],"genre_scores_gemma":[0.89910084,0.00049232994,0.0943439,0.00020918716,0.00011084574,0.0001890876,0.00041076497,0.000053815547,0.005089312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979025,0.00009644623,0.000007964802,0.00004946592,0.000030750318,0.000025122006],"domain_scores_gemma":[0.99971205,0.00014380153,0.000036714126,0.000016070002,0.00007042577,0.000020949183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010145197,0.0006381773,0.0004979733,0.0005781934,0.0002533952,0.0004238458,0.00092501723,0.0008680906,0.0009318544],"category_scores_gemma":[0.0015116753,0.00017629945,0.0006518902,0.00031424378,0.000285941,0.0006474417,0.00051281654,0.00056120695,0.0002565709],"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.0001285898,0.00010019961,0.0022606445,0.000034789624,0.00006737459,0.00009623842,0.000051395582,0.9347581,0.0013308333,0.0058181207,0.0011811596,0.05417253],"study_design_scores_gemma":[0.0000021091796,0.000012584828,0.00012223735,0.0000012465148,0.0000031099767,0.0000045670995,0.0000011173121,0.9989768,0.00003306806,0.00075967377,0.00008158535,0.0000019174433],"about_ca_topic_score_codex":0.010418146,"about_ca_topic_score_gemma":0.006403655,"teacher_disagreement_score":0.010418146,"about_ca_system_score_codex":0.00049267756,"about_ca_system_score_gemma":0.00055510574,"threshold_uncertainty_score":0.020714998},"labels":[],"label_agreement":null},{"id":"W2604490975","doi":"10.1609/aaai.v31i2.19093","title":"Real-Time Indoor Localization in Smart Homes Using Semi-Supervised Learning","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Train; Real-time computing; Scope (computer science); Supervised learning; Task (project management); Home automation; Deep learning; Artificial intelligence; Human–computer interaction; Telecommunications; Artificial neural network; Engineering","score_opus":0.048261808242944806,"score_gpt":0.2768741957613913,"score_spread":0.22861238751844648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604490975","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.052430987,0.0001007069,0.94454306,0.00009315438,0.00001939253,0.000059844668,0.0000668885,0.0021118687,0.00057402765],"genre_scores_gemma":[0.79738027,0.00008035183,0.20044796,0.00009965208,0.000050933668,0.00014895658,0.00038043578,0.00012049304,0.0012909591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989034,0.00036507953,0.00006848614,0.0003341527,0.000225204,0.00010369214],"domain_scores_gemma":[0.99631363,0.0018682347,0.0004508418,0.0004950065,0.00072378834,0.000148482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002003647,0.0006902819,0.0010157818,0.00060430804,0.0003927383,0.00075316546,0.0020395187,0.0008168649,0.0008750424],"category_scores_gemma":[0.0044378545,0.0005157364,0.0007048451,0.00050565513,0.0008752838,0.0013963239,0.0012903031,0.0010392764,0.00062999],"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.00038330886,0.00039479096,0.005031257,0.0001635055,0.000121912984,0.00015736427,0.00031873633,0.71073264,0.008635631,0.0014655099,0.0021062978,0.2704891],"study_design_scores_gemma":[0.000006020173,0.00002355629,0.00030751145,0.0000028146455,0.0000027113394,0.00001084754,0.000011428956,0.99773645,0.0011633586,0.0006261196,0.00010490976,0.000004379259],"about_ca_topic_score_codex":0.0046612914,"about_ca_topic_score_gemma":0.0059396303,"teacher_disagreement_score":0.0046612914,"about_ca_system_score_codex":0.0006644191,"about_ca_system_score_gemma":0.00093846425,"threshold_uncertainty_score":0.010596395},"labels":[],"label_agreement":null},{"id":"W2604565099","doi":"10.1609/aaai.v31i1.11070","title":"A Computational Assessment Model for the Adaptive Level of Rehabilitation Exergames for the Elderly","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Technology Use by Older Adults","field":"Social Sciences","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 British Columbia","funders":"National Research Foundation","keywords":"Adaptability; Rehabilitation; Computer science; Elderly people; Physical activity; Psychology; Physical medicine and rehabilitation; Applied psychology; Human–computer interaction; Gerontology; Medicine","score_opus":0.2518916033916794,"score_gpt":0.4101608060423543,"score_spread":0.1582692026506749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604565099","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.099188514,0.00019347803,0.884244,0.0012078823,0.00006989076,0.00016854513,0.0005718417,0.00041667925,0.013939164],"genre_scores_gemma":[0.9058711,0.00019547544,0.08435646,0.00017023156,0.000034512024,0.000527754,0.00033866763,0.000056046112,0.008449788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995863,0.00013948628,0.000026285288,0.00011017112,0.000089948546,0.000047738977],"domain_scores_gemma":[0.9989177,0.00066082587,0.00010923981,0.000052572228,0.00018704,0.00007263919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000793807,0.0006063626,0.00045742752,0.0006907343,0.00041484807,0.0012687474,0.001632977,0.0011512345,0.0055885683],"category_scores_gemma":[0.005573991,0.00033898445,0.0006745784,0.00053846836,0.0005478079,0.0014254337,0.0010849807,0.001076774,0.0005737421],"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.00005845928,0.00009507221,0.003913026,0.000036744073,0.000035377532,0.00012429565,0.00019286937,0.9436584,0.00061600824,0.034311965,0.00088438863,0.016073408],"study_design_scores_gemma":[0.000005922521,0.000023758752,0.00060633797,0.0000051939805,0.000008717996,0.000024218989,0.000018832076,0.99187416,0.000059821046,0.007023011,0.00034347342,0.0000065251884],"about_ca_topic_score_codex":0.020616328,"about_ca_topic_score_gemma":0.015499149,"teacher_disagreement_score":0.020616328,"about_ca_system_score_codex":0.0011899037,"about_ca_system_score_gemma":0.0012502566,"threshold_uncertainty_score":0.040992618},"labels":[],"label_agreement":null},{"id":"W2604587608","doi":"10.1609/aaai.v31i1.10848","title":"Fast Generalized Distillation for Semi-Supervised Domain Adaptation","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Domain adaptation; Computer science; Distillation; Labeled data; Support vector machine; Classifier (UML); Transfer of learning; Artificial intelligence; Machine learning; Adaptation (eye); Domain (mathematical analysis); Data source; Data mining; Pattern recognition (psychology); Mathematics","score_opus":0.12008076116521839,"score_gpt":0.3188042640720414,"score_spread":0.198723502906823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604587608","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.013961738,0.00031883648,0.9832154,0.00015346543,0.000054501044,0.00006148861,0.000099164514,0.0015771723,0.00055829354],"genre_scores_gemma":[0.5235698,0.00032149247,0.47063458,0.00050735835,0.00014276376,0.00035836562,0.001304182,0.00031146302,0.0028499933],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975097,0.0010200314,0.00012083594,0.00075502024,0.00044036368,0.00015412041],"domain_scores_gemma":[0.9964651,0.0017206094,0.00022745662,0.00089700404,0.00052448,0.00016533135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027136572,0.0012604726,0.0017657351,0.00086414494,0.00085996435,0.00092725205,0.0027192235,0.0015326958,0.0020932567],"category_scores_gemma":[0.006677892,0.00065537426,0.0010967342,0.0011903538,0.0015575953,0.0027087927,0.003498862,0.0035997066,0.0009795335],"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.0004631872,0.00038341896,0.0013549015,0.0002979703,0.00020053834,0.00018270494,0.00032627943,0.34639302,0.019599717,0.01712892,0.00907892,0.6045905],"study_design_scores_gemma":[0.000010116037,0.000027791672,0.000105023304,0.000004140882,0.0000051091047,0.000027537815,0.000012441158,0.98867214,0.0017576742,0.0088074375,0.0005609689,0.000009625084],"about_ca_topic_score_codex":0.002755516,"about_ca_topic_score_gemma":0.0037846067,"teacher_disagreement_score":0.002755516,"about_ca_system_score_codex":0.00075472635,"about_ca_system_score_gemma":0.001447861,"threshold_uncertainty_score":0.014351308},"labels":[],"label_agreement":null},{"id":"W2604635684","doi":"10.1609/aaai.v31i1.11031","title":"Logical Filtering and Smoothing: State Estimation in Partially Observable Domains","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","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 Toronto","funders":"","keywords":"Smoothing; Observable; State (computer science); Computer science; State space; Algorithm; Logical framework; Estimation; Dynamical systems theory; Dynamical system (definition); Theoretical computer science; Mathematics; Computer vision","score_opus":0.1056481588798765,"score_gpt":0.311098857837069,"score_spread":0.20545069895719248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604635684","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.004612211,0.00011420896,0.99422944,0.00015681957,0.000015460246,0.000022584052,0.000037315003,0.00035186086,0.00046011488],"genre_scores_gemma":[0.35913295,0.0004377341,0.6381346,0.00020680211,0.0000928838,0.00016487717,0.00031728408,0.00015032753,0.0013625477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99649614,0.001223328,0.0002735146,0.0008131771,0.000980298,0.00021364773],"domain_scores_gemma":[0.9794516,0.015275985,0.0013082295,0.0026764318,0.0010128528,0.00027496126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055416124,0.0010533956,0.0012850111,0.0016270563,0.0011591337,0.0026286533,0.0028417704,0.0016655006,0.0024512387],"category_scores_gemma":[0.026108425,0.00097194646,0.0018396815,0.0016843547,0.0032038868,0.00667217,0.0028264755,0.002894944,0.00039002488],"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.00040674533,0.00010904073,0.0026249199,0.00032731428,0.00014776894,0.00023126625,0.00061163184,0.5272977,0.004552051,0.29734355,0.001984487,0.16436362],"study_design_scores_gemma":[0.000024445613,0.000032656575,0.00023416849,0.000032449232,0.000029165023,0.000045834342,0.000043603417,0.8329971,0.002887263,0.16194735,0.0016995755,0.000026445725],"about_ca_topic_score_codex":0.00886863,"about_ca_topic_score_gemma":0.007505862,"teacher_disagreement_score":0.00886863,"about_ca_system_score_codex":0.0020408216,"about_ca_system_score_gemma":0.002889264,"threshold_uncertainty_score":0.029307187},"labels":[],"label_agreement":null},{"id":"W2604825101","doi":"10.1609/aaai.v31i1.11058","title":"Non-Deterministic Planning with Temporally Extended Goals: LTL over Finite and Infinite Traces","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear temporal logic; Planner; Domain (mathematical analysis); Observable; Computer science; Automaton; Finite-state machine; State (computer science); Theoretical computer science; Finite state; Point (geometry); Mathematics; Algorithm; Artificial intelligence","score_opus":0.07026156845158368,"score_gpt":0.30907883790142954,"score_spread":0.23881726944984585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604825101","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.029700726,0.00018892209,0.9634127,0.00043163975,0.000033080058,0.00010536207,0.0001604427,0.0012270187,0.004740089],"genre_scores_gemma":[0.49301913,0.00029164582,0.50258327,0.00023453306,0.000028627206,0.00032813335,0.00046364003,0.00034548642,0.002705446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794596,0.00087782013,0.00017269321,0.00026769986,0.0005625825,0.00017319592],"domain_scores_gemma":[0.9903775,0.006734222,0.00067623355,0.0013882177,0.0006120417,0.00021181592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025608721,0.00063684577,0.0004946926,0.00045545094,0.00063053216,0.0018388007,0.0012951067,0.00092179765,0.0021409397],"category_scores_gemma":[0.010736328,0.00046802394,0.00095861324,0.00074711075,0.0023928974,0.0033918654,0.0017389653,0.0020611766,0.0003816032],"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.00031664933,0.00015324695,0.0016099284,0.00033107118,0.000063832405,0.00046069743,0.0007561791,0.59720975,0.008103204,0.3018727,0.0016818121,0.087440856],"study_design_scores_gemma":[0.000053796946,0.000078025245,0.00017385469,0.000054062482,0.00002870602,0.000078510784,0.00011351946,0.80425155,0.008249309,0.1826266,0.004271241,0.000020937237],"about_ca_topic_score_codex":0.004723975,"about_ca_topic_score_gemma":0.0075815665,"teacher_disagreement_score":0.004723975,"about_ca_system_score_codex":0.0013722609,"about_ca_system_score_gemma":0.0029307115,"threshold_uncertainty_score":0.013543308},"labels":[],"label_agreement":null},{"id":"W2604896086","doi":"10.1609/aaai.v31i1.10693","title":"Abstraction in Situation Calculus Action Theories","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Multi-Agent Systems and Negotiation","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":"York University","funders":"","keywords":"Abstraction; Computer science; Bisimulation; Action (physics); Situation calculus; Programming language; Theoretical computer science; Epistemology","score_opus":0.14141044087088875,"score_gpt":0.3511131627483136,"score_spread":0.20970272187742486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604896086","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.004517509,0.00063317415,0.9792473,0.0008368459,0.0000942349,0.00010506148,0.00012459,0.00040969587,0.014031724],"genre_scores_gemma":[0.3231236,0.0012974421,0.6638934,0.0006436881,0.00034414654,0.00071410654,0.00056756404,0.0002274343,0.009188625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954699,0.0017461237,0.00040493606,0.0005313424,0.0013283757,0.0005193111],"domain_scores_gemma":[0.9965456,0.0018974862,0.000260295,0.0006743572,0.00043239477,0.0001898603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051566036,0.0012470239,0.0010439174,0.002113886,0.0017820131,0.004280744,0.0030330198,0.0018361002,0.005440191],"category_scores_gemma":[0.0066662505,0.0011430585,0.0041481243,0.0017704708,0.0056340145,0.008104759,0.0041708346,0.0047255224,0.0009789277],"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.0000064936326,0.000007788199,0.00007807791,0.00003297987,0.000009221684,0.00007169746,0.00026716918,0.0053583616,0.00015395778,0.99096817,0.00029865312,0.0027473466],"study_design_scores_gemma":[0.0000142785,0.000013830502,0.000050714796,0.000036273897,0.000017885219,0.000059242375,0.00006649101,0.029043289,0.00032919823,0.96144384,0.008911085,0.000013859762],"about_ca_topic_score_codex":0.005966267,"about_ca_topic_score_gemma":0.0036881873,"teacher_disagreement_score":0.005966267,"about_ca_system_score_codex":0.0032419916,"about_ca_system_score_gemma":0.0027645389,"threshold_uncertainty_score":0.027271092},"labels":[],"label_agreement":null},{"id":"W2604942799","doi":"10.1609/aaai.v31i1.10488","title":"Community Preserving Network Embedding","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":929,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Tencent","keywords":"Computer science; Embedding; Correctness; Community structure; Modularity (biology); Theoretical computer science; Exploit; Variety (cybernetics); Representation (politics); Feature (linguistics); Feature learning; Artificial intelligence; Non-negative matrix factorization; Matrix decomposition; Algorithm; Mathematics","score_opus":0.1242917882980847,"score_gpt":0.342916314103725,"score_spread":0.2186245258056403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604942799","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.0050002136,0.0002572985,0.99243224,0.00014737413,0.000037622587,0.000039461163,0.00018724024,0.00035403317,0.0015444742],"genre_scores_gemma":[0.43993142,0.0013497648,0.5449197,0.00037137067,0.00022846561,0.0004849031,0.0018777312,0.00040086886,0.01043588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920875,0.00026946052,0.000028030485,0.00022270739,0.0002030847,0.00006808476],"domain_scores_gemma":[0.9987205,0.0005122299,0.00019478911,0.0002551455,0.0002456382,0.00007172168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088444323,0.0013408253,0.0010539145,0.001389497,0.0005329156,0.0009623161,0.0016513703,0.0013522183,0.0028194606],"category_scores_gemma":[0.0046120933,0.0003969697,0.0010930346,0.0012669837,0.000838656,0.0025429379,0.0018534308,0.0017455951,0.0008883986],"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.000091628055,0.0000798146,0.0011919392,0.00033950023,0.000116116265,0.00022185147,0.00019840265,0.59105617,0.00776476,0.15246776,0.011452022,0.23502001],"study_design_scores_gemma":[0.0000061782057,0.000018540337,0.00013691984,0.0000136042245,0.000009356023,0.000060120667,0.000015020482,0.95590395,0.0007962246,0.04056243,0.0024686514,0.000008950435],"about_ca_topic_score_codex":0.0026244735,"about_ca_topic_score_gemma":0.003462556,"teacher_disagreement_score":0.0028194606,"about_ca_system_score_codex":0.0009076539,"about_ca_system_score_gemma":0.0010362905,"threshold_uncertainty_score":0.009432018},"labels":[],"label_agreement":null},{"id":"W2604963202","doi":"10.1609/aaai.v31i1.10931","title":"Distributed Negative Sampling for Word Embeddings","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":16,"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":"Word2vec; Word (group theory); Vocabulary; Computer science; Sampling (signal processing); Artificial intelligence; Core (optical fiber); Scale (ratio); Natural language processing; Theoretical computer science; Mathematics; Linguistics; Telecommunications; Geography; Cartography","score_opus":0.16769677131130994,"score_gpt":0.35517976344463,"score_spread":0.18748299213332004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604963202","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.016368933,0.00041240163,0.9805839,0.0003186194,0.00011139416,0.000074507865,0.00016619824,0.00090071425,0.0010633877],"genre_scores_gemma":[0.5614216,0.00060318754,0.42430478,0.0006182569,0.000504443,0.0006421009,0.0031425268,0.0005030489,0.008260176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772006,0.0009577001,0.00009094398,0.00054130517,0.0005200721,0.00016976902],"domain_scores_gemma":[0.99456984,0.0031089094,0.00029914657,0.0010056013,0.00082700513,0.00018946979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025045315,0.0012913371,0.0016548984,0.0009369476,0.00094601646,0.0014554046,0.0020109909,0.0010081067,0.0032668111],"category_scores_gemma":[0.01644401,0.00055624446,0.00057376834,0.0012688707,0.0016032181,0.0038729857,0.0026451452,0.0018237229,0.0015468104],"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.0011610335,0.00037187795,0.004405352,0.0004343222,0.00013803435,0.0002620871,0.0003697078,0.33780643,0.012682117,0.19483,0.029306687,0.41823232],"study_design_scores_gemma":[0.000033794277,0.000044792094,0.00015919616,0.000008783849,0.000007643792,0.000055836175,0.00003169339,0.92562306,0.0016118321,0.0706693,0.0017436664,0.000010387597],"about_ca_topic_score_codex":0.0023044136,"about_ca_topic_score_gemma":0.003974861,"teacher_disagreement_score":0.0032668111,"about_ca_system_score_codex":0.0010687842,"about_ca_system_score_gemma":0.0010313438,"threshold_uncertainty_score":0.013245344},"labels":[],"label_agreement":null},{"id":"W2604992821","doi":"10.1609/aaai.v31i1.10898","title":"Unsupervised Domain Adaptation with a Relaxed Covariate Shift Assumption","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","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":"University of Waterloo","funders":"","keywords":"Covariate; Computer science; Inference; Domain (mathematical analysis); Domain adaptation; Adaptation (eye); Generative model; Machine learning; Artificial intelligence; Generative grammar; Algorithm; Data mining; Mathematics","score_opus":0.12357503461243029,"score_gpt":0.3013951643751564,"score_spread":0.1778201297627261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604992821","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.0117748575,0.00016090705,0.98635477,0.00020833647,0.000031471685,0.00006803254,0.000104293424,0.0005422245,0.0007551324],"genre_scores_gemma":[0.5156268,0.00040939683,0.47206098,0.0008275305,0.00021783476,0.00054418045,0.0015946522,0.0003434662,0.008375264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982103,0.0007359368,0.0000667471,0.0006631901,0.00020616397,0.000117643474],"domain_scores_gemma":[0.99568236,0.0019014748,0.00024190244,0.0016098693,0.0004178599,0.00014661941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037722583,0.0008668928,0.0013191879,0.0006455643,0.00063889206,0.0010488743,0.0027524435,0.0019336011,0.002276791],"category_scores_gemma":[0.009682499,0.00064721965,0.0016272089,0.00084200146,0.0014592974,0.0027816272,0.003127837,0.0036187307,0.0014481994],"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.00041178783,0.00043948946,0.0057678064,0.00022841046,0.00026284202,0.00030960215,0.0004881293,0.56617576,0.022279201,0.06862222,0.010803864,0.32421094],"study_design_scores_gemma":[0.00002542124,0.000054922708,0.0007287306,0.000010322791,0.00001837783,0.000121243036,0.000023467255,0.9641352,0.0031119976,0.029754637,0.0019953856,0.000020244706],"about_ca_topic_score_codex":0.0030372501,"about_ca_topic_score_gemma":0.004258647,"teacher_disagreement_score":0.0037722583,"about_ca_system_score_codex":0.00078448467,"about_ca_system_score_gemma":0.0013693267,"threshold_uncertainty_score":0.019949853},"labels":[],"label_agreement":null},{"id":"W2605022915","doi":"10.1609/aaai.v31i1.10640","title":"What's Hot at CPAIOR (Extended Abstract)","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI 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":true,"ca_institutions":"Université Laval","funders":"","keywords":"Constraint (computer-aided design); Constraint programming; Operations research; Computer science; Order (exchange); Engineering; Business; Mathematical optimization; Mathematics; Stochastic programming","score_opus":0.08394019557605761,"score_gpt":0.3129034657129764,"score_spread":0.22896327013691878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605022915","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004467142,0.08279853,0.008426439,0.40623817,0.4254307,0.00018460478,0.0050937654,0.0016673596,0.06971371],"genre_scores_gemma":[0.009623852,0.12495404,0.010627614,0.19240358,0.40016508,0.00052515714,0.0073930416,0.004150389,0.25015724],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99557376,0.00090390886,0.00030591807,0.0007212097,0.0019054223,0.00058969384],"domain_scores_gemma":[0.9801498,0.0023130262,0.0009355445,0.0011232719,0.011774933,0.003703377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073640025,0.00090668455,0.001571273,0.0035815157,0.0026796907,0.0110108545,0.0031844098,0.0056035044,0.25745833],"category_scores_gemma":[0.02366187,0.0005852166,0.0019819122,0.0066833827,0.0022000377,0.013899816,0.0036543508,0.0058458964,0.105027385],"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.0000274694,0.000015917198,0.00005550029,0.00053204346,0.000011420543,0.000030461028,0.00003677137,0.000054606553,0.00005296254,0.003423555,0.9603733,0.035386086],"study_design_scores_gemma":[0.000011311999,0.000012239379,0.0002030183,0.0007007883,0.000009815446,0.000056073084,0.000074647025,0.000045006476,0.00008062398,0.002670364,0.99611664,0.000019384717],"about_ca_topic_score_codex":0.021421876,"about_ca_topic_score_gemma":0.020221366,"teacher_disagreement_score":0.25745833,"about_ca_system_score_codex":0.0045345165,"about_ca_system_score_gemma":0.009685969,"threshold_uncertainty_score":0.8612839},"labels":[],"label_agreement":null},{"id":"W2605104053","doi":"10.1609/aaai.v31i1.10905","title":"A General Clustering Agreement Index: For Comparing Disjoint and Overlapping Clusters","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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 Alberta","funders":"","keywords":"Cluster analysis; Disjoint sets; Rand index; Index (typography); Similarity (geometry); Benchmark (surveying); Computer science; Data mining; Mathematics; Pattern recognition (psychology); Artificial intelligence; Combinatorics; Geography; Cartography","score_opus":0.09353539178493135,"score_gpt":0.3283291559622062,"score_spread":0.23479376417727482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605104053","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.046711612,0.0037705572,0.91501343,0.00052928255,0.00048728555,0.0007179683,0.007264068,0.0032557237,0.022250038],"genre_scores_gemma":[0.42719218,0.0015103037,0.5529222,0.00042402174,0.00053963996,0.0012624048,0.011198176,0.0013593627,0.003591784],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9799573,0.003837558,0.0026661544,0.004045968,0.0086602485,0.00083274354],"domain_scores_gemma":[0.9540628,0.018898774,0.008454692,0.0067757587,0.010679739,0.0011281649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013368167,0.00216254,0.0021236138,0.017111747,0.0024984456,0.00594401,0.00274935,0.002965271,0.004528735],"category_scores_gemma":[0.0715095,0.0005638639,0.0017359961,0.015283825,0.0028157695,0.010749812,0.005573795,0.0024104007,0.0028410044],"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.0012515414,0.00040681832,0.0710468,0.003339604,0.0022917022,0.0005262206,0.0026274698,0.11362461,0.02391853,0.15244564,0.052966543,0.5755546],"study_design_scores_gemma":[0.00019390964,0.0010896787,0.06085596,0.0011031923,0.0009636154,0.003398331,0.0035749078,0.45027578,0.044669785,0.31726626,0.115675315,0.0009332835],"about_ca_topic_score_codex":0.002003975,"about_ca_topic_score_gemma":0.002078631,"teacher_disagreement_score":0.017111747,"about_ca_system_score_codex":0.0022893504,"about_ca_system_score_gemma":0.002455421,"threshold_uncertainty_score":0.0706985},"labels":[],"label_agreement":null},{"id":"W2605176733","doi":"10.1609/aaai.v31i1.11235","title":"Leveraging Saccades to Learn Smooth Pursuit: A Self-Organizing Motion Tracking Model Using Restricted Boltzmann Machines","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Neural dynamics and brain function","field":"Neuroscience","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 Ottawa","funders":"","keywords":"Artificial intelligence; Smooth pursuit; Computer science; Gaze; Reinforcement learning; Saccade; Motion (physics); Computer vision; Generative model; Biological motion; Leverage (statistics); Boltzmann machine; Traverse; Deep learning; Eye movement; Generative grammar","score_opus":0.1737508536580591,"score_gpt":0.3313530905112159,"score_spread":0.15760223685315683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605176733","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.116144314,0.00055640424,0.877718,0.0007160073,0.00006643748,0.000035373123,0.000097527874,0.0005078536,0.0041580233],"genre_scores_gemma":[0.95022047,0.00028675486,0.043692503,0.00014877468,0.000032669403,0.0001148007,0.000086337284,0.00005923974,0.0053586345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998814,0.000030254108,0.0000058388196,0.000036292957,0.000023642708,0.000022620137],"domain_scores_gemma":[0.9996624,0.00017515996,0.000056282017,0.000026036345,0.00005128594,0.000028923687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042509,0.0004385457,0.00060098874,0.0002775397,0.00024389259,0.00061727536,0.0011528922,0.0009631201,0.0010061556],"category_scores_gemma":[0.0013132291,0.0004506284,0.0007145566,0.00027327918,0.00076689036,0.00085600745,0.00069542165,0.0010130493,0.0002478328],"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.000030407462,0.00001731914,0.0008214746,0.000019121679,0.00002916484,0.000043154498,0.000048853235,0.9773282,0.00195456,0.012200558,0.00029518406,0.007211948],"study_design_scores_gemma":[0.0000030447882,0.0000071341888,0.000057463105,0.0000016077101,0.0000028360282,0.0000051052307,0.0000017487849,0.9970125,0.00011461443,0.002710428,0.000081217935,0.0000022604643],"about_ca_topic_score_codex":0.0061465045,"about_ca_topic_score_gemma":0.004255983,"teacher_disagreement_score":0.0061465045,"about_ca_system_score_codex":0.00062441936,"about_ca_system_score_gemma":0.00063916465,"threshold_uncertainty_score":0.012221456},"labels":[],"label_agreement":null},{"id":"W2621731111","doi":"10.1609/aaai.v32i1.11627","title":"Sample-Efficient Learning of Mixtures","year":2018,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sample complexity; Combinatorics; Distribution (mathematics); Logarithm; Class (philosophy); Mathematics; Upper and lower bounds; Discrete mathematics; Mathematical analysis; Computer science; Artificial intelligence","score_opus":0.05839631489145449,"score_gpt":0.3098292682075604,"score_spread":0.25143295331610593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621731111","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.006441674,0.0004109705,0.99117285,0.0003164993,0.0000360059,0.000051871142,0.00007821657,0.0005307718,0.000961094],"genre_scores_gemma":[0.35080698,0.0010830099,0.6382984,0.0009118396,0.00043924962,0.00048656727,0.00092564407,0.00047444092,0.0065739667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949714,0.0016137976,0.00026983413,0.0015947635,0.0011759643,0.00037413236],"domain_scores_gemma":[0.9856082,0.0098481,0.00091606,0.002061552,0.0010387003,0.0005274048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005594072,0.0022716268,0.0035425455,0.001653691,0.0012502713,0.0032478294,0.004774316,0.0034763487,0.0033956342],"category_scores_gemma":[0.030672584,0.0018003244,0.002957114,0.0020194205,0.0033398643,0.009454929,0.0053398837,0.006730237,0.0012190122],"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.00053565763,0.00024116124,0.0023696197,0.00030332198,0.00025312632,0.00017220723,0.00024150027,0.7757091,0.0026826877,0.12867498,0.0034871602,0.085329585],"study_design_scores_gemma":[0.000015612615,0.00003249619,0.00011828003,0.000010003067,0.00001493019,0.000036214973,0.000008945509,0.94957715,0.00065518625,0.04884658,0.000670926,0.000013667278],"about_ca_topic_score_codex":0.0035141725,"about_ca_topic_score_gemma":0.0027951514,"teacher_disagreement_score":0.005594072,"about_ca_system_score_codex":0.0027194924,"about_ca_system_score_gemma":0.0016957452,"threshold_uncertainty_score":0.029584646},"labels":[],"label_agreement":null},{"id":"W2724632096","doi":"10.1609/aaai.v31i1.11054","title":"Deterministic versus Probabilistic Methods for Searching for an Evasive Target","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Probabilistic logic; Computer science; Task (project management); Key (lock); Class (philosophy); Bayesian probability; Constraint (computer-aided design); Mathematical optimization; Artificial intelligence; Machine learning; Mathematics","score_opus":0.2936157113745732,"score_gpt":0.45980466385428453,"score_spread":0.16618895247971133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2724632096","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.0025780383,0.00029307316,0.99335575,0.0003426,0.000028788398,0.000030043477,0.000068239846,0.00015848273,0.0031450812],"genre_scores_gemma":[0.27899462,0.0012734749,0.71336937,0.0002706489,0.00012794245,0.00048372362,0.00024775826,0.00022964591,0.0050028786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857354,0.0004938735,0.00007924385,0.00026459523,0.00044662008,0.00014211333],"domain_scores_gemma":[0.99599504,0.003017664,0.00037699958,0.0002845905,0.00023218142,0.00009349727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019228514,0.0011372686,0.0009319516,0.0011366701,0.0006896976,0.0017191899,0.0022689418,0.001650326,0.0047540353],"category_scores_gemma":[0.007242508,0.0010784746,0.0014358547,0.0016360725,0.0018626915,0.00232631,0.0016909336,0.002087553,0.0005609719],"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.000017345666,0.00001952783,0.00019677976,0.000096333715,0.000025449059,0.000027205542,0.000044471737,0.90584034,0.00028802725,0.07686395,0.0006919873,0.015888562],"study_design_scores_gemma":[0.00001245578,0.000011634548,0.00004773036,0.000017035134,0.000008817649,0.000012727093,0.000014069979,0.9515266,0.00019036746,0.04647076,0.0016798716,0.0000079081765],"about_ca_topic_score_codex":0.011682159,"about_ca_topic_score_gemma":0.012419778,"teacher_disagreement_score":0.011682159,"about_ca_system_score_codex":0.0018241943,"about_ca_system_score_gemma":0.0030858682,"threshold_uncertainty_score":0.023228288},"labels":[],"label_agreement":null},{"id":"W2734426634","doi":"10.1609/aaai.v32i1.11634","title":"Adversarial Dropout for Supervised and Semi-Supervised Learning","year":2018,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","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":"Kootenay Association for Science & Technology","funders":"National Research Foundation of Korea; National Research Foundation","keywords":"Generality; Dropout (neural networks); MNIST database; Adversarial system; Computer science; Machine learning; Artificial intelligence; Artificial neural network; Generalization; Set (abstract data type); Deep neural networks; Supervised learning; Mathematics; Psychology","score_opus":0.06696556916244889,"score_gpt":0.3084728003732138,"score_spread":0.2415072312107649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734426634","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.0055763656,0.00042243322,0.9920568,0.00029675243,0.00004154814,0.000038322618,0.000060298804,0.00035183132,0.0011556367],"genre_scores_gemma":[0.7004999,0.0012340737,0.2915252,0.0005711348,0.00034669365,0.0004270204,0.00058483,0.00027759362,0.004533532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969825,0.0014007996,0.0001582321,0.0006131011,0.00068247196,0.00016296233],"domain_scores_gemma":[0.99263304,0.004863449,0.00064418255,0.0011823593,0.000493239,0.00018372099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005549772,0.001430365,0.0013910102,0.0008272806,0.0005790681,0.0011028233,0.002071774,0.0017908334,0.0017581126],"category_scores_gemma":[0.013429455,0.0005861729,0.0010847735,0.0007858415,0.002858663,0.0023532307,0.0026007784,0.0039757597,0.0004160445],"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.00015331707,0.000083845065,0.00080389495,0.00023308229,0.00013360442,0.00014886298,0.00013812711,0.8105924,0.0035949291,0.115380645,0.0033209883,0.065416284],"study_design_scores_gemma":[0.0000060460766,0.000023133236,0.00009636726,0.0000111694135,0.0000052361574,0.000020792302,0.0000034023944,0.9668929,0.00096589833,0.031353284,0.00061491923,0.000006881591],"about_ca_topic_score_codex":0.0013739524,"about_ca_topic_score_gemma":0.0013545938,"teacher_disagreement_score":0.005549772,"about_ca_system_score_codex":0.0016974993,"about_ca_system_score_gemma":0.0011213537,"threshold_uncertainty_score":0.02935034},"labels":[],"label_agreement":null},{"id":"W2752442988","doi":"10.1609/aaai.v32i1.11947","title":"Order-Planning Neural Text Generation From Structured Data","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":101,"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":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Dialog box; Table (database); Natural language generation; Natural language processing; Artificial neural network; Artificial intelligence; Text generation; Encoder; NIST; Language model; Order (exchange); Component (thermodynamics); Natural language; Machine learning; Data mining","score_opus":0.22174273540355915,"score_gpt":0.34089337949952864,"score_spread":0.11915064409596948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752442988","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.12533163,0.0009799645,0.84802204,0.00083357736,0.0002724808,0.00042584466,0.0015503214,0.015740372,0.0068437965],"genre_scores_gemma":[0.6625438,0.00033881704,0.3215569,0.00040392537,0.00012842666,0.00045740453,0.004656025,0.0005155436,0.009399149],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995782,0.000106070685,0.000026718924,0.00017617008,0.00007455358,0.00003826083],"domain_scores_gemma":[0.99789643,0.0014054158,0.0000993765,0.00026932228,0.00025923233,0.00007028554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009595777,0.00090832484,0.00061360555,0.00086902623,0.00040270263,0.0006145742,0.001486357,0.00089599326,0.0034156493],"category_scores_gemma":[0.0042442787,0.0003642102,0.00067681837,0.00086815475,0.0004743912,0.0017524376,0.0007973885,0.0012383225,0.0010410313],"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.00038363386,0.00035814187,0.001938088,0.00029077544,0.0000793118,0.00033421814,0.00030129545,0.40348703,0.01346808,0.009558996,0.017454252,0.55234617],"study_design_scores_gemma":[0.000026143449,0.000027095615,0.00013775231,0.000004600676,0.000009095009,0.000023714698,0.000017870176,0.989096,0.004076465,0.005788977,0.00078690815,0.0000054710617],"about_ca_topic_score_codex":0.0066353213,"about_ca_topic_score_gemma":0.012408413,"teacher_disagreement_score":0.0066353213,"about_ca_system_score_codex":0.0009327818,"about_ca_system_score_gemma":0.0008620327,"threshold_uncertainty_score":0.013193369},"labels":[],"label_agreement":null},{"id":"W2754203286","doi":"10.1609/aaai.v32i1.11831","title":"When Waiting Is Not an Option: Learning Options With a Deliberation Cost","year":2018,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Institut de Valorisation des Données","keywords":"Deliberation; Interpretability; Bounded rationality; Computer science; Rationality; Management science; Risk analysis (engineering); Artificial intelligence; Epistemology; Economics; Business; Political science","score_opus":0.12388612333898766,"score_gpt":0.3176455879313191,"score_spread":0.19375946459233143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754203286","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.14910853,0.00035422522,0.8421383,0.0017867289,0.00006747895,0.0000872173,0.000119173834,0.00059664395,0.0057417606],"genre_scores_gemma":[0.8886179,0.00016922333,0.10798753,0.00024779513,0.000034056644,0.000115434515,0.00012265859,0.00010662609,0.0025987797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833196,0.0007454714,0.00008714649,0.00041169822,0.0002340416,0.0001896312],"domain_scores_gemma":[0.9879401,0.009330926,0.0008614725,0.00079553836,0.00044600086,0.0006259366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032545014,0.00076633255,0.0009888601,0.00037153275,0.0005243709,0.0013867174,0.0016237667,0.0018918565,0.0034410655],"category_scores_gemma":[0.022945076,0.00056125,0.00063092797,0.0003994105,0.0024267929,0.005068857,0.0025801864,0.0031698279,0.00038040476],"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.0012382229,0.00023888843,0.004165752,0.00023506486,0.00013931542,0.00043532668,0.00059534766,0.69575965,0.002742938,0.19205463,0.0021025152,0.100292236],"study_design_scores_gemma":[0.00007075149,0.00008455709,0.00029178985,0.000025610056,0.000022948474,0.000050448456,0.000056822995,0.821645,0.0011096803,0.17594068,0.00067855493,0.000023038601],"about_ca_topic_score_codex":0.0024021433,"about_ca_topic_score_gemma":0.002464376,"teacher_disagreement_score":0.0034410655,"about_ca_system_score_codex":0.0010617786,"about_ca_system_score_gemma":0.0016435824,"threshold_uncertainty_score":0.017211676},"labels":[],"label_agreement":null},{"id":"W2754517384","doi":"10.1609/aaai.v32i1.11694","title":"Deep Reinforcement Learning That Matters","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":1504,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Open Philanthropy Project; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Reinforcement learning; Computer science; Standardization; Benchmark (surveying); Artificial intelligence; Field (mathematics); Variance (accounting); Deep learning; Machine learning; Data science; Risk analysis (engineering); Mathematics","score_opus":0.07088540185984533,"score_gpt":0.28886615983652203,"score_spread":0.2179807579766767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754517384","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.09335494,0.05890464,0.38759974,0.34703887,0.014838288,0.00018434964,0.002536151,0.002732888,0.09281014],"genre_scores_gemma":[0.8573246,0.0157044,0.060084257,0.039400376,0.004706854,0.00025642352,0.0010616577,0.0018389026,0.019622583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9907906,0.0042127613,0.00045221808,0.002325859,0.00190102,0.00031756554],"domain_scores_gemma":[0.9601553,0.02693311,0.0022412387,0.0045945896,0.004792576,0.0012832566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016862407,0.00068971736,0.0012376839,0.0004689479,0.0009112101,0.0047461004,0.0016060637,0.0024842715,0.008552005],"category_scores_gemma":[0.09086421,0.0003431441,0.00038626092,0.00061897584,0.0040282286,0.008155254,0.0017668633,0.00595044,0.0024463676],"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.0006528513,0.00031010716,0.013748026,0.0013081455,0.000562492,0.00016988144,0.000865069,0.026963344,0.0037342282,0.42260382,0.10344904,0.425633],"study_design_scores_gemma":[0.00014555949,0.0004001205,0.008300369,0.0011953334,0.0001573027,0.00026730634,0.00071666844,0.06270193,0.00626424,0.7822539,0.13747412,0.00012321024],"about_ca_topic_score_codex":0.002344082,"about_ca_topic_score_gemma":0.0018793152,"teacher_disagreement_score":0.016862407,"about_ca_system_score_codex":0.0020131557,"about_ca_system_score_gemma":0.002038659,"threshold_uncertainty_score":0.089178026},"labels":[],"label_agreement":null},{"id":"W2754588405","doi":"10.1609/aaai.v32i1.11532","title":"Warmstarting of Model-Based Algorithm Configuration","year":2018,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","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":"University of British Columbia","funders":"Deutsche Forschungsgemeinschaft","keywords":"Exploit; Computer science; Benchmark (surveying); Solver; Process (computing); Scratch; Algorithm; Programming language","score_opus":0.08355056564429254,"score_gpt":0.32335339257047163,"score_spread":0.2398028269261791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754588405","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.11498557,0.0011474704,0.86014676,0.0005700334,0.00039172627,0.00044419523,0.0002266314,0.012281315,0.009806306],"genre_scores_gemma":[0.62798345,0.00023253818,0.36498886,0.00056152843,0.0001278568,0.0008248232,0.0009870769,0.002071786,0.0022220437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99604994,0.0017093562,0.00019373318,0.00089946727,0.0006390885,0.0005084562],"domain_scores_gemma":[0.98549426,0.0068586976,0.0007332005,0.0052037737,0.0011707057,0.0005393858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005314572,0.0024704717,0.0025414678,0.0017022939,0.0013115142,0.0023252587,0.0036461933,0.0023521024,0.0059332936],"category_scores_gemma":[0.026897497,0.0020345554,0.0017956652,0.001284573,0.0017011021,0.0038643766,0.004129383,0.0052662627,0.0025687865],"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.0007945629,0.00062219345,0.006284204,0.00028256743,0.00025834766,0.00021618468,0.0004269223,0.82353944,0.007304498,0.013679664,0.007678174,0.13891327],"study_design_scores_gemma":[0.00010640693,0.00016957708,0.00038536257,0.00004134074,0.00004622417,0.000057591078,0.000055350214,0.9841232,0.004331211,0.008793232,0.0018607994,0.000029789006],"about_ca_topic_score_codex":0.0020587475,"about_ca_topic_score_gemma":0.0036388899,"teacher_disagreement_score":0.0059332936,"about_ca_system_score_codex":0.0012778109,"about_ca_system_score_gemma":0.0023191175,"threshold_uncertainty_score":0.02810651},"labels":[],"label_agreement":null},{"id":"W2757609746","doi":"10.1609/aaai.v32i1.11775","title":"OptionGAN: Learning Joint Reward-Policy Options Using Generative Adversarial Inverse Reinforcement Learning","year":2018,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Open Philanthropy Project; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Reinforcement learning; Leverage (statistics); Computer science; Adversarial system; Generative grammar; Artificial intelligence; Function (biology); Set (abstract data type); Machine learning","score_opus":0.13871062076476812,"score_gpt":0.32905867573710673,"score_spread":0.19034805497233862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757609746","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.016302442,0.00027609224,0.9794881,0.00030884348,0.000047481713,0.00006520789,0.00009329027,0.0009759432,0.0024426673],"genre_scores_gemma":[0.8183374,0.0002460204,0.1740828,0.00053379085,0.00006389813,0.00035953856,0.00036936268,0.0002755499,0.005731655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946576,0.00021353757,0.000019348785,0.000114220515,0.00012686613,0.000060313578],"domain_scores_gemma":[0.9985569,0.0010526533,0.00009522172,0.00012870603,0.000091278955,0.000075193224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014739858,0.0011687547,0.0010657208,0.0004470699,0.00025928157,0.00077168655,0.0014934998,0.0017119666,0.003541623],"category_scores_gemma":[0.004755085,0.0006989657,0.0007184935,0.00034174777,0.0014240443,0.0015015954,0.0018791917,0.0024085727,0.0005879542],"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.00007669878,0.000039191953,0.000522191,0.000049198807,0.000045947894,0.00008145621,0.000039616512,0.95446,0.0010786182,0.014614457,0.0012965695,0.027695961],"study_design_scores_gemma":[0.00000723207,0.000013279517,0.000036328995,0.000005370765,0.0000027492993,0.000011421912,0.000001933193,0.9921956,0.00026216713,0.0072427033,0.00021669453,0.0000045544284],"about_ca_topic_score_codex":0.002520568,"about_ca_topic_score_gemma":0.002930377,"teacher_disagreement_score":0.003541623,"about_ca_system_score_codex":0.00077205914,"about_ca_system_score_gemma":0.0010676719,"threshold_uncertainty_score":0.011847913},"labels":[],"label_agreement":null},{"id":"W2760103357","doi":"10.1609/aaai.v32i1.11671","title":"FiLM: Visual Reasoning with a General Conditioning Layer","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Multimodal Machine Learning Applications","field":"Computer Science","cited_by":1633,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Université de Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; CHIST-ERA; Nvidia","keywords":"Affine transformation; Computer science; Benchmark (surveying); Artificial intelligence; Feature (linguistics); Computation; Transformation (genetics); Artificial neural network; Simple (philosophy); Layer (electronics); Visual reasoning; Image (mathematics); Task (project management); Process (computing); Pattern recognition (psychology); Machine learning; Algorithm; Mathematics","score_opus":0.04609872896526987,"score_gpt":0.3260767922855972,"score_spread":0.2799780633203274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760103357","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.020138491,0.00042676314,0.95615685,0.0005475299,0.00017197907,0.00019983244,0.000560865,0.013050412,0.00874723],"genre_scores_gemma":[0.49523762,0.00036806279,0.48895645,0.0009619433,0.00010655314,0.000303953,0.001202365,0.0011166387,0.011746417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996909,0.000049867143,0.000017917586,0.00011195631,0.000083538755,0.000045905563],"domain_scores_gemma":[0.99943835,0.00017431773,0.000054488894,0.00022342255,0.00006621449,0.000043148724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063973083,0.0010683571,0.00045021923,0.0003313238,0.00027467744,0.0013059567,0.0019269614,0.0010763407,0.013792588],"category_scores_gemma":[0.0028415504,0.000518426,0.000651501,0.00024756807,0.00093391695,0.0034541718,0.0019593542,0.0021373995,0.0022813126],"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.0010890776,0.0004489443,0.0014442003,0.00075225945,0.0002412783,0.00028349823,0.00032042546,0.12982945,0.12522279,0.080016285,0.033183727,0.62716794],"study_design_scores_gemma":[0.00011447763,0.00021771948,0.0004922131,0.00005354484,0.00006839664,0.00013097342,0.000033424203,0.8590227,0.073099315,0.051239736,0.015493973,0.00003364491],"about_ca_topic_score_codex":0.0022113086,"about_ca_topic_score_gemma":0.0031121224,"teacher_disagreement_score":0.013792588,"about_ca_system_score_codex":0.00067819597,"about_ca_system_score_gemma":0.0006646126,"threshold_uncertainty_score":0.04614073},"labels":[],"label_agreement":null},{"id":"W2767354950","doi":"10.1609/aaai.v32i1.11740","title":"Learning With Options That Terminate Off-Policy","year":2018,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","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":"McGill University","funders":"","keywords":"Dilemma; Flexibility (engineering); Computer science; Odds; Decoupling (probability); Set (abstract data type); Quality (philosophy); Task (project management); Reinforcement learning; Mathematical optimization; Artificial intelligence; Economics; Mathematics; Machine learning","score_opus":0.08436074975531656,"score_gpt":0.3127829237718858,"score_spread":0.22842217401656928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767354950","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.06901426,0.00018705128,0.9232509,0.0007430632,0.00007037116,0.00011731634,0.0000782988,0.000742127,0.005796607],"genre_scores_gemma":[0.76441306,0.00017071956,0.22764322,0.0004970367,0.000067374975,0.00032041653,0.00027261974,0.00028108538,0.0063344445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986358,0.00049656635,0.00008892025,0.00035187072,0.00023363665,0.00019306528],"domain_scores_gemma":[0.99147403,0.005993637,0.00058259815,0.0010307425,0.0005034529,0.0004155097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033330065,0.001056482,0.0011863428,0.00046341808,0.0005411088,0.0014104465,0.0018330399,0.00239384,0.0040702596],"category_scores_gemma":[0.019831218,0.000487298,0.0008130764,0.00041456186,0.00218879,0.0034985463,0.0022799617,0.003676224,0.0006277933],"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.00049189,0.00028873817,0.0050683585,0.00018423988,0.000076136785,0.00026079945,0.0003485868,0.65198326,0.0032308288,0.19594988,0.002983818,0.1391334],"study_design_scores_gemma":[0.000033975983,0.00007659111,0.00013990235,0.000030653086,0.000010221813,0.000030694682,0.000021487112,0.92471415,0.0011472637,0.0730402,0.0007447589,0.000010108623],"about_ca_topic_score_codex":0.0012242688,"about_ca_topic_score_gemma":0.0015710898,"teacher_disagreement_score":0.0040702596,"about_ca_system_score_codex":0.0013002915,"about_ca_system_score_gemma":0.0019317458,"threshold_uncertainty_score":0.017626822},"labels":[],"label_agreement":null},{"id":"W2769482590","doi":"10.1609/aaai.v32i1.12332","title":"Learning Spatio-Temporal Features With Partial Expression Sequences for On-the-Fly Prediction","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Emotion and Mood Recognition","field":"Psychology","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":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea","keywords":"Computer science; Artificial intelligence; Expression (computer science); Feature (linguistics); Sequence (biology); Encoding (memory); Facial expression; Pattern recognition (psychology); On the fly; Segmentation; Task (project management); Machine learning","score_opus":0.1049035944441057,"score_gpt":0.3382219981355238,"score_spread":0.2333184036914181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769482590","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.06795189,0.00031017486,0.92844784,0.00015062305,0.0000741144,0.00006446434,0.00022329,0.0016015577,0.0011760464],"genre_scores_gemma":[0.8210836,0.00031598174,0.17431542,0.00015194755,0.000073985975,0.00016215087,0.00081974437,0.00013620866,0.002940905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979097,0.000028126049,0.0000108208305,0.00008484507,0.000051277962,0.00003397483],"domain_scores_gemma":[0.9997106,0.00009106861,0.000038675487,0.000059462254,0.000075927135,0.000024199639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030594165,0.0007570098,0.00060830894,0.00033123474,0.00019584941,0.00033702268,0.0008029382,0.0003757012,0.0015886826],"category_scores_gemma":[0.0011902818,0.00029034127,0.00044438167,0.0003393505,0.00024011712,0.00082278537,0.0005632049,0.0009899692,0.00058806484],"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.0003686058,0.00025125348,0.0035776466,0.000076184515,0.000055844936,0.00012230108,0.00011932723,0.16155785,0.061461266,0.002189311,0.0047410624,0.76547945],"study_design_scores_gemma":[0.000005237714,0.000033763907,0.0006941896,0.000003876639,0.000008562512,0.000021174565,0.000013313239,0.9928756,0.0050790757,0.00081622065,0.00044434803,0.0000048081024],"about_ca_topic_score_codex":0.0043346165,"about_ca_topic_score_gemma":0.0065520615,"teacher_disagreement_score":0.0043346165,"about_ca_system_score_codex":0.000348834,"about_ca_system_score_gemma":0.00059262186,"threshold_uncertainty_score":0.008618772},"labels":[],"label_agreement":null},{"id":"W2773584821","doi":"10.1609/aaai.v32i1.12323","title":"Co-Domain Embedding Using Deep Quadruplet Networks for Unseen Traffic Sign Recognition","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Infrastructure Maintenance and Monitoring","field":"Engineering","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":"Kootenay Association for Science & Technology","funders":"Samsung","keywords":"Computer science; Embedding; Artificial intelligence; Generalization; Traffic sign recognition; Pairwise comparison; Similarity (geometry); Feature (linguistics); Pattern recognition (psychology); Class (philosophy); Domain (mathematical analysis); Sign (mathematics); Synthetic data; Machine learning; Traffic sign; Image (mathematics); Mathematics","score_opus":0.05853266592608864,"score_gpt":0.2991962923570157,"score_spread":0.2406636264309271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2773584821","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.17564204,0.00087495876,0.81502235,0.0004065767,0.0001627684,0.00008121506,0.00056451466,0.003433532,0.0038119715],"genre_scores_gemma":[0.8265802,0.0003763474,0.16318955,0.00025836405,0.00007820262,0.000091797876,0.0027623826,0.00013734678,0.006525735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996604,0.00006439142,0.000014615737,0.00012818776,0.00007720407,0.000055162167],"domain_scores_gemma":[0.9993612,0.00018939018,0.00007878996,0.00018375715,0.0001383477,0.000048531372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056017155,0.0008627907,0.0007604593,0.0007007181,0.0003102104,0.00059974386,0.0012331846,0.0010092758,0.0018322598],"category_scores_gemma":[0.0014187009,0.0003084451,0.00051875843,0.0007845328,0.000507428,0.0019331173,0.0011139727,0.001574122,0.0009572005],"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.00047600843,0.00060454576,0.0032994414,0.00013147615,0.00013020143,0.00030820456,0.00017995149,0.32649127,0.031389248,0.009321504,0.011791219,0.61587685],"study_design_scores_gemma":[0.0000032691496,0.000028751418,0.00026932923,0.0000033527353,0.0000060366215,0.000035757836,0.000012355256,0.99346864,0.0029125614,0.0026156877,0.0006383433,0.000005879079],"about_ca_topic_score_codex":0.0032965872,"about_ca_topic_score_gemma":0.004956003,"teacher_disagreement_score":0.0032965872,"about_ca_system_score_codex":0.00065221364,"about_ca_system_score_gemma":0.00045598132,"threshold_uncertainty_score":0.0065547824},"labels":[],"label_agreement":null},{"id":"W2775300540","doi":"10.1609/aaai.v32i1.12111","title":"RelNN: A Deep Neural Model for Relational Learning","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":41,"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":"Statistical relational learning; Computer science; Artificial intelligence; Deep learning; Scalability; Machine learning; Object (grammar); Artificial neural network; Modular design; Focus (optics); Deep belief network; Architecture; Relational database; Data mining","score_opus":0.1342475788295949,"score_gpt":0.3147651427810738,"score_spread":0.18051756395147892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775300540","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.009847299,0.00094916276,0.9817098,0.0006006392,0.00008891433,0.000043706248,0.0011679312,0.0022303336,0.0033622142],"genre_scores_gemma":[0.45237702,0.0022898265,0.5234313,0.00093138823,0.00014066862,0.00029847072,0.006198998,0.00044261868,0.013889659],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995441,0.00010259961,0.000029036084,0.00015040791,0.00012731786,0.0000464086],"domain_scores_gemma":[0.9994597,0.0002117099,0.000071313116,0.00011084859,0.00011211556,0.000034335524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084538275,0.00070820365,0.00063389644,0.0006229871,0.00029622047,0.0010660128,0.0023702583,0.000980478,0.0033083477],"category_scores_gemma":[0.0028291875,0.0005832796,0.00091000966,0.0009869072,0.0006281524,0.002745484,0.0012902846,0.0024763471,0.0012253241],"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.00021668826,0.00015054406,0.0023928108,0.00029944786,0.00025356456,0.00023797574,0.00017618453,0.55355674,0.0055063525,0.11704734,0.019637939,0.30052438],"study_design_scores_gemma":[0.000008318744,0.000020237534,0.00017529157,0.00002002982,0.000015333775,0.00004199165,0.000009033625,0.9535958,0.0008417129,0.041419417,0.0038435457,0.000009286845],"about_ca_topic_score_codex":0.008075941,"about_ca_topic_score_gemma":0.012965447,"teacher_disagreement_score":0.008075941,"about_ca_system_score_codex":0.0009865514,"about_ca_system_score_gemma":0.0009035682,"threshold_uncertainty_score":0.016057909},"labels":[],"label_agreement":null},{"id":"W2783392051","doi":"10.1609/aaai.v32i1.12095","title":"Planning With Pixels in (Almost) Real Time","year":2018,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Alberta","keywords":"Computer science; Pixel; Artificial intelligence; State (computer science); Computer vision; Machine learning; Algorithm","score_opus":0.07757191859625165,"score_gpt":0.3079997685792846,"score_spread":0.23042784998303298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783392051","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.077128656,0.0001726409,0.90315455,0.00030336433,0.00007766337,0.00011336545,0.00016709887,0.006506564,0.01237603],"genre_scores_gemma":[0.62552726,0.00009874673,0.3684592,0.00012795802,0.000019221388,0.00013255802,0.0002782939,0.00036144204,0.004995363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999496,0.00013412462,0.000030070898,0.00016040388,0.00012465894,0.00005482429],"domain_scores_gemma":[0.99904436,0.0004933947,0.000079751684,0.00023809115,0.00009166905,0.00005269455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071655907,0.0007006016,0.00056239485,0.00029028094,0.00030185617,0.00095843186,0.001074006,0.0006768594,0.0072928183],"category_scores_gemma":[0.0027391007,0.00033075854,0.00032471187,0.0003170998,0.00093839807,0.0015003663,0.0011119996,0.00087876176,0.0011198347],"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.0010990533,0.00023354724,0.0016486167,0.00017038005,0.00007787195,0.00021328837,0.00032844057,0.5075651,0.020750131,0.03183742,0.0067487527,0.42932746],"study_design_scores_gemma":[0.000068683985,0.000110513356,0.00034202432,0.00001234784,0.00001653763,0.000045717938,0.000055831537,0.9609364,0.010081495,0.025207864,0.003110301,0.000012306248],"about_ca_topic_score_codex":0.0043595973,"about_ca_topic_score_gemma":0.005884976,"teacher_disagreement_score":0.0072928183,"about_ca_system_score_codex":0.0005364275,"about_ca_system_score_gemma":0.0008671292,"threshold_uncertainty_score":0.024396896},"labels":[],"label_agreement":null},{"id":"W2785356083","doi":"10.1609/aaai.v32i1.11561","title":"Situation Calculus Semantics for Actual Causality","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Semantics (computer science); Calculus (dental); Causality (physics); Computer science; Programming language; Mathematics; Algebra over a field; Theoretical computer science; Medicine; Pure mathematics","score_opus":0.11436557990035665,"score_gpt":0.3318612548278091,"score_spread":0.21749567492745245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785356083","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.007702653,0.0010654689,0.93237734,0.0043162033,0.0003162942,0.000102800426,0.00034664583,0.00056999724,0.053202596],"genre_scores_gemma":[0.6273955,0.0015205271,0.35433102,0.0018885601,0.0005946527,0.00067085057,0.00065091974,0.0003300743,0.012617874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939037,0.0025475286,0.00059110095,0.00093332405,0.0015168297,0.00050747674],"domain_scores_gemma":[0.9935736,0.0035642025,0.00044228043,0.0010751551,0.0010535948,0.00029117955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006630903,0.0010104895,0.00084482186,0.0027147608,0.0026195254,0.005493386,0.0024162785,0.002999866,0.007632994],"category_scores_gemma":[0.009915523,0.00083169184,0.0026834973,0.0020054192,0.010966572,0.011255832,0.004356798,0.0057649617,0.0009121121],"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.0000015247373,0.0000022966335,0.00001591063,0.000009597694,0.0000019052695,0.000014740602,0.00010790098,0.00045410878,0.000028542501,0.9986028,0.0001446598,0.00061599206],"study_design_scores_gemma":[0.0000059288623,0.000002905845,0.000014468855,0.00001169753,0.0000040481445,0.000026071522,0.0000376052,0.0027492319,0.00008001964,0.99287647,0.0041870996,0.0000044936137],"about_ca_topic_score_codex":0.0032538008,"about_ca_topic_score_gemma":0.0022949632,"teacher_disagreement_score":0.007632994,"about_ca_system_score_codex":0.0040413067,"about_ca_system_score_gemma":0.0032401802,"threshold_uncertainty_score":0.035067976},"labels":[],"label_agreement":null},{"id":"W2785529341","doi":"10.1609/aaai.v32i1.12115","title":"Learning Robust Options","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":16,"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":"Robustness (evolution); Reinforcement learning; Computer science; Artificial intelligence; Robust control; Mathematical optimization; Machine learning; Convergence (economics); Artificial neural network; Mathematics; Nonlinear system","score_opus":0.09360344398562903,"score_gpt":0.2975536324951889,"score_spread":0.20395018850955987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785529341","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.025699694,0.00013671766,0.97071606,0.00021606093,0.000028954184,0.000042555308,0.00007905604,0.0006302125,0.0024507977],"genre_scores_gemma":[0.8287028,0.00014406428,0.1674075,0.00022800986,0.000030415029,0.00017058609,0.00024040417,0.00023246549,0.0028437446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988667,0.00035553292,0.000058417034,0.00032905355,0.00026918054,0.000121063575],"domain_scores_gemma":[0.99675155,0.0018923191,0.00044095315,0.00042499087,0.00030954118,0.000180664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021550488,0.001021764,0.00115058,0.00058725575,0.00040227274,0.0011583037,0.001537024,0.0013417635,0.003204647],"category_scores_gemma":[0.010562946,0.00067504885,0.0008078803,0.00036348283,0.001789597,0.0026641237,0.0020979943,0.002191251,0.0005565417],"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.000109401,0.000045151246,0.0010321708,0.00007340592,0.000062016275,0.000094141964,0.00008016323,0.90635586,0.0021337369,0.045522913,0.0009557165,0.043535404],"study_design_scores_gemma":[0.0000074429586,0.000024785482,0.00005211638,0.000008487976,0.0000041772605,0.000012739152,0.000005834067,0.97297645,0.0005946856,0.026007986,0.00029984958,0.0000054158027],"about_ca_topic_score_codex":0.0016515612,"about_ca_topic_score_gemma":0.0019163232,"teacher_disagreement_score":0.003204647,"about_ca_system_score_codex":0.0011736075,"about_ca_system_score_gemma":0.0014609457,"threshold_uncertainty_score":0.011397123},"labels":[],"label_agreement":null},{"id":"W2785925437","doi":"10.1609/aaai.v32i1.11891","title":"DeepHeart: Semi-Supervised Sequence Learning for Cardiovascular Risk Prediction","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"ECG Monitoring and Analysis","field":"Medicine","cited_by":142,"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":"Wearable computer; Computer science; Machine learning; Supervised learning; Wearable technology; Artificial intelligence; Blood pressure; Sleep apnea; Classifier (UML); Medicine; Cardiology; Internal medicine; Embedded system","score_opus":0.0954081901217702,"score_gpt":0.31589073978342647,"score_spread":0.22048254966165626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785925437","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.33596802,0.0024398596,0.6306425,0.0010564087,0.0006368035,0.0002554345,0.005980855,0.020043217,0.002976967],"genre_scores_gemma":[0.8257402,0.00036439995,0.15884343,0.00064857566,0.00015302029,0.00027861606,0.010099759,0.00022851177,0.003643397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993156,0.00027422048,0.00004404368,0.00020251902,0.00008913986,0.000074418786],"domain_scores_gemma":[0.99772817,0.0013492766,0.00014230564,0.00030134496,0.00037623223,0.000102735925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021011112,0.0013714972,0.00068820297,0.0005626584,0.00026986818,0.00053687376,0.001536591,0.0012202215,0.0019034693],"category_scores_gemma":[0.0056273052,0.00045933877,0.0006747613,0.0005015908,0.00033370606,0.00092518306,0.0011097483,0.001802564,0.0013305558],"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.0011381196,0.001361871,0.020069938,0.00039833662,0.0007434627,0.0003287268,0.00028399247,0.38383135,0.014586671,0.0014029494,0.025467996,0.5503866],"study_design_scores_gemma":[0.000036444882,0.00012513607,0.0016535235,0.000016324097,0.000024682782,0.000050669743,0.000013927138,0.9924252,0.0036836108,0.0013050836,0.0006490612,0.000016340311],"about_ca_topic_score_codex":0.005048405,"about_ca_topic_score_gemma":0.009405647,"teacher_disagreement_score":0.005048405,"about_ca_system_score_codex":0.00049647706,"about_ca_system_score_gemma":0.0009399524,"threshold_uncertainty_score":0.0111118555},"labels":[],"label_agreement":null},{"id":"W2786472750","doi":"10.1609/aaai.v32i1.11332","title":"Complex Sequential Question Answering: Towards Learning to Converse Over Linked Question Answer Pairs with a Knowledge Graph","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":177,"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 Montréal","funders":"","keywords":"Computer science; Question answering; Converse; Dialog box; Ask price; Conversation; Natural language processing; Context (archaeology); Artificial intelligence; Coreference; Ellipsis (linguistics); Parsing; Graph; Information retrieval; Linguistics; World Wide Web; Theoretical computer science; Resolution (logic); Mathematics","score_opus":0.09260613830365648,"score_gpt":0.32629793119242484,"score_spread":0.23369179288876835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786472750","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.07319394,0.0014016053,0.9012562,0.0019496941,0.000118539756,0.0006712001,0.0047854693,0.012062462,0.0045607793],"genre_scores_gemma":[0.41988757,0.00045370474,0.55112576,0.0016534242,0.0001511853,0.0005718339,0.02017256,0.00046583233,0.0055181594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969944,0.0010658769,0.00012052752,0.001423782,0.0002760671,0.00011939094],"domain_scores_gemma":[0.99164987,0.0059987027,0.00041037443,0.0011295193,0.00050581637,0.00030577485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028726726,0.0022935835,0.00097450975,0.0021021252,0.0009145248,0.0018554695,0.0038558508,0.0032023126,0.0055846423],"category_scores_gemma":[0.01301584,0.0007073598,0.0023120125,0.0012701004,0.0012385531,0.006546896,0.0036387448,0.0035823614,0.0032542048],"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.0010535553,0.0014382366,0.01269185,0.0018855047,0.00057441613,0.001212337,0.004485568,0.19447358,0.020458579,0.032264743,0.047119573,0.68234205],"study_design_scores_gemma":[0.00010958571,0.00027962404,0.0019697032,0.00011255751,0.00012238724,0.0003296854,0.0009529556,0.8673593,0.006260517,0.10496183,0.017485628,0.00005628544],"about_ca_topic_score_codex":0.0055745197,"about_ca_topic_score_gemma":0.010439543,"teacher_disagreement_score":0.0055846423,"about_ca_system_score_codex":0.0014861256,"about_ca_system_score_gemma":0.0014023788,"threshold_uncertainty_score":0.01868242},"labels":[],"label_agreement":null},{"id":"W2787477569","doi":"10.1609/aaai.v32i1.11594","title":"PAC Reinforcement Learning With an Imperfect Model","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Reinforcement learning; Fidelity; Computer science; Reduction (mathematics); Action (physics); Simple (philosophy); Artificial intelligence; Sample (material); Transfer of learning; Imperfect; Sample complexity; State space; Polynomial; Machine learning; Mathematics","score_opus":0.0664821800134268,"score_gpt":0.2958776474047536,"score_spread":0.22939546739132677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787477569","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.029168203,0.00019484841,0.96531147,0.00061333145,0.00005130838,0.00006492491,0.000091074515,0.00062980124,0.0038750586],"genre_scores_gemma":[0.8438513,0.00016947159,0.14952601,0.0003128973,0.00009374286,0.0002572969,0.00022092134,0.00012045308,0.005447965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987025,0.00048087482,0.000059424387,0.00032473728,0.00025534784,0.00017704237],"domain_scores_gemma":[0.9915251,0.0061417464,0.0005600767,0.0010777707,0.00037009173,0.00032519005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021210276,0.0013157048,0.002045392,0.00037255886,0.00053145067,0.0012975743,0.0024507246,0.0017379118,0.0025305094],"category_scores_gemma":[0.011053077,0.00075272063,0.000606444,0.00051832694,0.00222721,0.002906268,0.00189225,0.0037911837,0.00046063573],"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.00016483915,0.00006582003,0.0004742221,0.00008660168,0.000038576283,0.000098401804,0.0000610417,0.9322212,0.00041068392,0.05089907,0.0012330416,0.014246485],"study_design_scores_gemma":[0.00001978225,0.000021989366,0.000034806355,0.0000038406733,0.0000046636246,0.000009713055,0.0000036563692,0.9791605,0.0001514287,0.020388745,0.0001970322,0.0000038542203],"about_ca_topic_score_codex":0.0047953897,"about_ca_topic_score_gemma":0.004883823,"teacher_disagreement_score":0.0047953897,"about_ca_system_score_codex":0.001656089,"about_ca_system_score_gemma":0.0023176232,"threshold_uncertainty_score":0.01201582},"labels":[],"label_agreement":null},{"id":"W2788330867","doi":"10.1609/aaai.v32i1.12092","title":"Fat- and Heavy-Tailed Behavior in Satisficing Planning","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Satisficing; Randomness; Heuristic; Benchmark (surveying); Computer science; Heuristics; Mathematical optimization; Process (computing); Mathematics; Artificial intelligence; Statistics","score_opus":0.07938709591078513,"score_gpt":0.3101511081629452,"score_spread":0.2307640122521601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788330867","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.7867392,0.0010035774,0.20642953,0.0006899641,0.00006665782,0.00011529131,0.00041490252,0.0015116009,0.0030293015],"genre_scores_gemma":[0.9766049,0.000112606285,0.021859612,0.00012149673,0.000025778725,0.00008931011,0.00042831825,0.00024267168,0.0005153781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99475706,0.0019705836,0.0002441825,0.0013151075,0.00094340753,0.000769699],"domain_scores_gemma":[0.9446234,0.042578746,0.0037404583,0.0060145175,0.0019165862,0.0011263167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007461968,0.00066431274,0.0012385154,0.0011824623,0.00080655195,0.0014081174,0.0016060676,0.0010310055,0.0023341863],"category_scores_gemma":[0.04783374,0.00080011407,0.0010806075,0.0012463091,0.0023435939,0.0024796287,0.0012831069,0.002841241,0.0002731872],"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.0008484682,0.000289949,0.021167776,0.00021965917,0.000285591,0.0003499838,0.000542538,0.9171406,0.006557552,0.02176671,0.0025912148,0.028239936],"study_design_scores_gemma":[0.000059863716,0.00024967993,0.007834337,0.00002706733,0.000048953556,0.00018782592,0.00015610881,0.9589068,0.0039186105,0.027919106,0.0006494896,0.000042235468],"about_ca_topic_score_codex":0.0032226925,"about_ca_topic_score_gemma":0.005144219,"teacher_disagreement_score":0.007461968,"about_ca_system_score_codex":0.0016686592,"about_ca_system_score_gemma":0.0013555784,"threshold_uncertainty_score":0.039463103},"labels":[],"label_agreement":null},{"id":"W2788343755","doi":"10.1609/aaai.v32i1.11273","title":"CA-RNN: Using Context-Aligned Recurrent Neural Networks for Modeling Sentence Similarity","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Recurrent neural network; Computer science; Sentence; Benchmark (surveying); Context (archaeology); Artificial intelligence; Paraphrase; Natural language processing; Word (group theory); Similarity (geometry); Language model; Artificial neural network; Speech recognition","score_opus":0.17887027404759642,"score_gpt":0.3348507905021531,"score_spread":0.15598051645455668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788343755","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.07135659,0.0025950347,0.91563857,0.00038103675,0.00033609226,0.00020891661,0.0009685861,0.004853109,0.0036620367],"genre_scores_gemma":[0.7229157,0.0010131766,0.26625922,0.0004554415,0.00020860264,0.00038875104,0.0023885593,0.0003848445,0.0059857094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952745,0.00011790502,0.000032620057,0.00019726816,0.00008033802,0.000044410303],"domain_scores_gemma":[0.999371,0.00024320043,0.00008353847,0.000067297464,0.00020657777,0.000028439992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087246235,0.0010077327,0.0007083397,0.00085330143,0.00034453676,0.00061598007,0.0019739922,0.0009441165,0.0017689073],"category_scores_gemma":[0.003226305,0.00037813018,0.0008209418,0.00084427017,0.0003280387,0.0014891494,0.00065026194,0.00119536,0.00078212144],"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.00043529668,0.00021916385,0.003899921,0.00026321466,0.000345704,0.00034403274,0.00023879147,0.5238455,0.022938881,0.009333345,0.008954878,0.42918134],"study_design_scores_gemma":[0.0000056886965,0.000023568966,0.00022582004,0.0000057550783,0.000017483579,0.000018201417,0.000004940762,0.9964006,0.001009637,0.0017692959,0.0005127093,0.000006371658],"about_ca_topic_score_codex":0.018162297,"about_ca_topic_score_gemma":0.022042392,"teacher_disagreement_score":0.018162297,"about_ca_system_score_codex":0.0008752813,"about_ca_system_score_gemma":0.0010191551,"threshold_uncertainty_score":0.036113203},"labels":[],"label_agreement":null},{"id":"W2788408359","doi":"10.1609/aaai.v32i1.11548","title":"Embedding of Hierarchically Typed Knowledge Bases","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":13,"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 Ottawa","funders":"National Key Research and Development Program of China; Beijing Advanced Innovation Center for Big Data and Brain Computing; State Key Laboratory of Software Development Environment; National Natural Science Foundation of China","keywords":"Embedding; Computer science; Set (abstract data type); Inference; Theoretical computer science; Knowledge base; Constraint (computer-aided design); Base (topology); Scheme (mathematics); Artificial intelligence; Mathematics; Programming language","score_opus":0.07006822215061718,"score_gpt":0.3312770358805869,"score_spread":0.2612088137299697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788408359","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.059582543,0.00030245664,0.9367492,0.00029344784,0.000033392662,0.000045703207,0.00042083274,0.00052360346,0.002048802],"genre_scores_gemma":[0.68555975,0.00058321183,0.3066643,0.00013734389,0.000054442255,0.00012937801,0.0015987793,0.00015822046,0.005114606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988397,0.00047381705,0.00008997115,0.0002365747,0.00027230725,0.00008756797],"domain_scores_gemma":[0.99597543,0.002056773,0.00038299905,0.00096416846,0.0004989441,0.000121739766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012228045,0.00049604685,0.00054988865,0.0018198928,0.0004487181,0.0015098756,0.0013358486,0.00088035746,0.0024583708],"category_scores_gemma":[0.0078071225,0.000498357,0.00082140195,0.0020688165,0.0008237075,0.004743036,0.0020351452,0.0011459822,0.00047365043],"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.0002201142,0.00016449763,0.0032338297,0.0003093227,0.000121190635,0.00055817113,0.00085788773,0.4894645,0.007903889,0.2621306,0.002901075,0.23213491],"study_design_scores_gemma":[0.000009884212,0.000039334398,0.000313016,0.000027638174,0.00003718811,0.000064457825,0.00008080561,0.826628,0.0021082307,0.16767488,0.0030018587,0.000014774601],"about_ca_topic_score_codex":0.0041445745,"about_ca_topic_score_gemma":0.006088307,"teacher_disagreement_score":0.0041445745,"about_ca_system_score_codex":0.0007701457,"about_ca_system_score_gemma":0.0007269401,"threshold_uncertainty_score":0.008240938},"labels":[],"label_agreement":null},{"id":"W2788421913","doi":"10.1609/aaai.v32i1.11680","title":"Learning Across Scales---Multiscale Methods for Convolution Neural Networks","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","cited_by":66,"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":"National Science Foundation","keywords":"Convolution (computer science); Convolutional neural network; Computer science; Artificial intelligence; Artificial neural network; Nonlinear system; Pattern recognition (psychology); Deep learning; Class (philosophy); Algorithm; Multigrid method; Interpretation (philosophy); Relation (database); Partial differential equation; Mathematics; Data mining; Mathematical analysis","score_opus":0.08275116561921445,"score_gpt":0.3875231856371282,"score_spread":0.3047720200179137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788421913","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.0044026915,0.00030722606,0.9938775,0.00017710378,0.000034631634,0.000016421205,0.000014586252,0.00013264487,0.001037217],"genre_scores_gemma":[0.39512527,0.00095177675,0.5972025,0.000293629,0.00023013863,0.00026367072,0.00011570966,0.00037077727,0.005446519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996195,0.0001145265,0.00002956487,0.00009524081,0.00010831431,0.00003286068],"domain_scores_gemma":[0.99900335,0.0005335835,0.0001311354,0.0001556529,0.00012127197,0.000055042277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015460625,0.0008284189,0.00069851225,0.00051113975,0.00032128702,0.0008324062,0.0009579764,0.0010330294,0.0016552969],"category_scores_gemma":[0.0047349506,0.0005024078,0.00071422406,0.00039505042,0.0010645472,0.0015694078,0.0020991706,0.0015478757,0.00030086178],"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.000058086676,0.0000541256,0.0009810508,0.00019829614,0.00010074377,0.00007393528,0.00015708311,0.61659956,0.010158597,0.23282541,0.0016645899,0.13712855],"study_design_scores_gemma":[0.0000032004743,0.000011418496,0.00006330238,0.000007130189,0.000005027136,0.000008736956,0.000003888873,0.9715864,0.0005539816,0.02699771,0.00075539516,0.000003841389],"about_ca_topic_score_codex":0.0024839584,"about_ca_topic_score_gemma":0.0027218433,"teacher_disagreement_score":0.0024839584,"about_ca_system_score_codex":0.0010632216,"about_ca_system_score_gemma":0.00071634125,"threshold_uncertainty_score":0.008176506},"labels":[],"label_agreement":null},{"id":"W2788438366","doi":"10.1609/aaai.v32i1.12082","title":"Linear and Integer Programming-Based Heuristics for Cost-Optimal Numeric Planning","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Integer programming; Linear programming; Mathematical optimization; Linear programming relaxation; Computer science; Heuristic; Branch and price; State (computer science); State variable; Relaxation (psychology); Mathematics; Algorithm","score_opus":0.09279822587069986,"score_gpt":0.32817093078137904,"score_spread":0.2353727049106792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788438366","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.007465805,0.00034093758,0.9840641,0.0002402789,0.000043335513,0.0000887221,0.00013335618,0.0007540674,0.0068693394],"genre_scores_gemma":[0.19070241,0.00037118598,0.80626625,0.00015896342,0.00003086573,0.00026461823,0.0003152198,0.00026599615,0.0016244466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801934,0.0009486857,0.00013437784,0.0002542234,0.00045064866,0.00019281569],"domain_scores_gemma":[0.99404776,0.0044677206,0.00042606212,0.00058347743,0.0003510572,0.00012391264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026755151,0.001131051,0.0008339635,0.001238014,0.00064001436,0.002171685,0.0015411619,0.0009475901,0.0061706146],"category_scores_gemma":[0.00902045,0.00077563815,0.0011517752,0.0018120428,0.0013891483,0.0022302067,0.0012775717,0.0025005355,0.00094125187],"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.00008370608,0.00008451495,0.00024606127,0.0001423777,0.000026271502,0.000036109024,0.000075859345,0.8696722,0.0007845844,0.06908443,0.001997979,0.05776597],"study_design_scores_gemma":[0.000016987311,0.000032022348,0.00004030877,0.000028317545,0.0000080068085,0.000012223243,0.000020331032,0.9651819,0.0005775129,0.032353435,0.001720995,0.000007986416],"about_ca_topic_score_codex":0.007774509,"about_ca_topic_score_gemma":0.009533723,"teacher_disagreement_score":0.007774509,"about_ca_system_score_codex":0.0026649653,"about_ca_system_score_gemma":0.0034555902,"threshold_uncertainty_score":0.020642698},"labels":[],"label_agreement":null},{"id":"W2788459610","doi":"10.1609/aaai.v32i1.12203","title":"A SAT+CAS Method for Enumerating Williamson Matrices of Even Order","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Enumeration; Solver; Satisfiability; Order (exchange); Symbolic computation; Field (mathematics); Boolean satisfiability problem; Computation; Domain (mathematical analysis); Discrete mathematics; Computer science; Mathematics; Algebra over a field; Combinatorics; Algorithm; Pure mathematics; Mathematical optimization","score_opus":0.1032482280250316,"score_gpt":0.38150325656186534,"score_spread":0.27825502853683376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788459610","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.03118384,0.00026809538,0.93628365,0.00033441558,0.0001243827,0.00025338595,0.0012576755,0.003576554,0.02671806],"genre_scores_gemma":[0.14369696,0.0001946229,0.8395204,0.00023260458,0.00004763244,0.00031028394,0.0026347274,0.0006320804,0.012730616],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993259,0.00013138143,0.00005152513,0.00015251504,0.00024965408,0.00008894359],"domain_scores_gemma":[0.99841154,0.00078656385,0.00014014842,0.00026580412,0.0003228827,0.00007295163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005297152,0.0009856222,0.0005495944,0.0019255549,0.0010170422,0.0015621225,0.0012112729,0.0006618548,0.016047651],"category_scores_gemma":[0.0040020836,0.00044307168,0.0008247929,0.001828828,0.00086300203,0.002697804,0.0013029726,0.0012230072,0.0042036646],"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.00040006396,0.0002665153,0.0036611746,0.0008202339,0.000119385724,0.0005358519,0.0004963488,0.04801679,0.027755918,0.42967138,0.032227654,0.45602882],"study_design_scores_gemma":[0.00010802273,0.00021572193,0.0008517505,0.0001629041,0.00009326567,0.00071068306,0.00033317163,0.42010602,0.041224927,0.46439853,0.07169726,0.00009775873],"about_ca_topic_score_codex":0.0019886694,"about_ca_topic_score_gemma":0.007185588,"teacher_disagreement_score":0.016047651,"about_ca_system_score_codex":0.0008351834,"about_ca_system_score_gemma":0.0023731706,"threshold_uncertainty_score":0.05368477},"labels":[],"label_agreement":null},{"id":"W2788555957","doi":"10.1609/aaai.v32i1.12076","title":"A Recursive Algorithm to Generate Balanced Weekend Tournaments","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Quest University Canada","funders":"","keywords":"Tournament; League; Schedule; Corollary; Scheduling (production processes); Computer science; Directed graph; Hamiltonian path; Simple (philosophy); Mathematics; Graph; Mathematical economics; Operations research; Algorithm; Combinatorics; Mathematical optimization","score_opus":0.22900074592288563,"score_gpt":0.4119095838618458,"score_spread":0.18290883793896015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788555957","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.034767076,0.00007489001,0.95595443,0.00015312409,0.0000420519,0.00033442763,0.00023321464,0.0021279296,0.006312997],"genre_scores_gemma":[0.14733961,0.00005079118,0.84708714,0.00008272157,0.000019789679,0.00034393033,0.0009878365,0.00037917274,0.0037090846],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919313,0.00022456383,0.00004527996,0.00019961564,0.00014840557,0.0001890617],"domain_scores_gemma":[0.9987656,0.00062051933,0.00009718596,0.00025095267,0.00016844919,0.000097362776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008271923,0.0007258907,0.00079339143,0.00082291744,0.0010012406,0.00097269914,0.0018639286,0.00092346035,0.010645573],"category_scores_gemma":[0.0034439024,0.000511794,0.00093488285,0.0007113446,0.0006121691,0.0012573698,0.0017001388,0.001078071,0.0021316784],"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.00046850444,0.00070257304,0.00387913,0.00039635197,0.00011623502,0.00032000578,0.00079182105,0.21967979,0.01691343,0.11584967,0.019490847,0.6213917],"study_design_scores_gemma":[0.00033259412,0.0002474009,0.000686018,0.000039618397,0.00004908314,0.00019596292,0.00020147456,0.897438,0.0068123555,0.072288476,0.021667214,0.00004181501],"about_ca_topic_score_codex":0.0021894937,"about_ca_topic_score_gemma":0.004694173,"teacher_disagreement_score":0.010645573,"about_ca_system_score_codex":0.0008076444,"about_ca_system_score_gemma":0.00142586,"threshold_uncertainty_score":0.035613},"labels":[],"label_agreement":null},{"id":"W2788603415","doi":"10.1609/aaai.v32i1.11531","title":"Memory-Augmented Monte Carlo Tree Search","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monte Carlo tree search; Computer science; Monte Carlo method; Exploit; Generalization; Tree (set theory); Algorithm; Artificial intelligence; Machine learning; Mathematics; Statistics","score_opus":0.10057922332975935,"score_gpt":0.3228504654192324,"score_spread":0.22227124208947305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788603415","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.06279859,0.001119018,0.92899793,0.00044738804,0.000109759356,0.00010320282,0.0001415734,0.00079985574,0.0054826476],"genre_scores_gemma":[0.8070399,0.00032875667,0.18957707,0.00030760918,0.00006566858,0.00022371234,0.00022864174,0.00013110822,0.0020973694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857605,0.0007346165,0.00006588662,0.00018594289,0.00029900717,0.00013854097],"domain_scores_gemma":[0.99236155,0.0058145765,0.00037386824,0.0007203032,0.000515335,0.00021444759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021844287,0.0008068467,0.0018200089,0.0006486894,0.00059986394,0.0010260112,0.0025047066,0.0015389405,0.003104119],"category_scores_gemma":[0.016295215,0.00060658454,0.00070685137,0.0010164842,0.0013281108,0.0027400048,0.0016509049,0.0014531929,0.0004246429],"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.00020313647,0.000049166436,0.00087964477,0.0000658246,0.000052768315,0.00006492768,0.000059215847,0.942423,0.00035932037,0.026843486,0.00085130654,0.028148197],"study_design_scores_gemma":[0.000013923527,0.000019344752,0.000036003083,0.00000528356,0.000005524306,0.000008742561,0.0000028596355,0.9915331,0.00008632853,0.008091552,0.00019377536,0.0000035618416],"about_ca_topic_score_codex":0.0066313082,"about_ca_topic_score_gemma":0.0071802665,"teacher_disagreement_score":0.0066313082,"about_ca_system_score_codex":0.0011220777,"about_ca_system_score_gemma":0.0018458201,"threshold_uncertainty_score":0.0131854415},"labels":[],"label_agreement":null},{"id":"W2788626059","doi":"10.1609/aaai.v32i1.11744","title":"Learning Predictive State Representations From Non-Uniform Sampling","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Fault Detection and Control Systems","field":"Engineering","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; National Research Council Canada","funders":"","keywords":"Observable; Computer science; Artificial intelligence; Sampling (signal processing); Machine learning; Conditional probability distribution; Process (computing); Conditional expectation; Algorithm; Mathematics; Econometrics","score_opus":0.04491740335700904,"score_gpt":0.28764444538654155,"score_spread":0.2427270420295325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788626059","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.017573152,0.00019734711,0.98023635,0.0001751514,0.00003255027,0.000037995942,0.00020052656,0.0008299864,0.00071690924],"genre_scores_gemma":[0.82304853,0.00040331276,0.17062382,0.00034180807,0.00014576734,0.0003065421,0.0022586838,0.00022127565,0.0026501773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987766,0.00040837473,0.000074392694,0.00038339593,0.00023727692,0.00011989581],"domain_scores_gemma":[0.99361575,0.004222085,0.00054495275,0.0009658031,0.0005237367,0.00012758665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025101055,0.0013079309,0.0015725647,0.0009363801,0.00045230487,0.0013952951,0.0022468069,0.0015002827,0.0024078763],"category_scores_gemma":[0.013821696,0.0008112194,0.0010761265,0.0010035416,0.0012823079,0.0033509617,0.0019726953,0.002917411,0.0007473988],"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.00012616128,0.00007563951,0.0011634805,0.00008817276,0.000049820035,0.00006173823,0.0000901187,0.90498704,0.0010260708,0.024339896,0.0014692063,0.06652254],"study_design_scores_gemma":[0.0000030803167,0.00000888067,0.00005969736,0.0000044413446,0.000002865022,0.0000055152536,0.0000033185715,0.99329656,0.000186084,0.0063322247,0.00009391793,0.0000034041834],"about_ca_topic_score_codex":0.0044141454,"about_ca_topic_score_gemma":0.0050815535,"teacher_disagreement_score":0.0044141454,"about_ca_system_score_codex":0.00096771127,"about_ca_system_score_gemma":0.0011534226,"threshold_uncertainty_score":0.013274848},"labels":[],"label_agreement":null},{"id":"W2788918109","doi":"10.1609/aaai.v32i1.12015","title":"Spectral Word Embedding with Negative Sampling","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","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":"Dalhousie University","funders":"","keywords":"Word (group theory); Embedding; Computer science; Word embedding; Context (archaeology); Sampling (signal processing); Algorithm; Artificial intelligence; Natural language processing; Theoretical computer science; Mathematics","score_opus":0.10624167690963107,"score_gpt":0.32364312890205293,"score_spread":0.21740145199242186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788918109","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.020199519,0.0002854063,0.97783285,0.0001822306,0.00005380971,0.00004367166,0.000042750053,0.0004771886,0.0008825477],"genre_scores_gemma":[0.4648861,0.0003146439,0.52858156,0.00041093657,0.0002324805,0.00025575343,0.00060912006,0.0003018391,0.0044075707],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982293,0.0009885269,0.000069307986,0.0003311289,0.00030291948,0.000078776044],"domain_scores_gemma":[0.99505144,0.0032087136,0.00026481962,0.0008145219,0.0005465761,0.000113833004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022115167,0.0010676013,0.0011676931,0.0011120087,0.0005410327,0.0010218273,0.0013842375,0.0012595268,0.002285907],"category_scores_gemma":[0.011906762,0.00047907844,0.00062777055,0.0009906051,0.0014819398,0.0039014327,0.0017366755,0.0013801857,0.0011374311],"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.00041629997,0.0003657512,0.0027580392,0.00039217752,0.00012594432,0.00016409467,0.00033604406,0.3772026,0.011435448,0.10174599,0.0064497143,0.49860787],"study_design_scores_gemma":[0.000013706486,0.000030907962,0.00011506625,0.00000880923,0.000005613491,0.000044993685,0.000020098296,0.96174663,0.001505516,0.03558368,0.00091723196,0.000007775097],"about_ca_topic_score_codex":0.00084210455,"about_ca_topic_score_gemma":0.0012538891,"teacher_disagreement_score":0.002285907,"about_ca_system_score_codex":0.000484163,"about_ca_system_score_gemma":0.00049585936,"threshold_uncertainty_score":0.011695743},"labels":[],"label_agreement":null},{"id":"W2789037897","doi":"10.1609/aaai.v32i1.11289","title":"Learning Differences Between Visual Scanning Patterns Can Disambiguate Bipolar and Unipolar Patients","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Mental Health Research Topics","field":"Psychology","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University Health Network; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto; Nvidia","keywords":"Artificial intelligence; Pattern recognition (psychology); Classifier (UML); Convolutional neural network; Computer science; Bipolar disorder; Recurrent neural network; Mood; Artificial neural network; Medicine; Psychiatry","score_opus":0.13824255664207433,"score_gpt":0.4066659573390452,"score_spread":0.2684234006969709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789037897","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.9922609,0.00045367892,0.004927398,0.00013989209,0.000050048886,0.00003160224,0.0003886777,0.00010288489,0.0016450055],"genre_scores_gemma":[0.9963875,0.00013835618,0.0025800264,0.000063769934,0.000022705519,0.000011527201,0.00054432475,0.000012700884,0.00023909064],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99978906,0.000047633774,0.00002498383,0.00007904177,0.000027657796,0.000031588665],"domain_scores_gemma":[0.9994012,0.00023960647,0.00014170608,0.000047014808,0.00009998662,0.000070537084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005255194,0.00041497464,0.00032399446,0.00097476697,0.00014980654,0.00055823673,0.00013977982,0.00041642046,0.0012127426],"category_scores_gemma":[0.002889334,0.00015040468,0.00031217712,0.00024452267,0.00015253181,0.0003317834,0.0003019175,0.00029488598,0.00047183057],"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.0041079447,0.00025571926,0.68710494,0.00018710694,0.00038235303,0.00065605564,0.0005041045,0.005983908,0.04878927,0.00048408954,0.005300246,0.2462443],"study_design_scores_gemma":[0.00008266144,0.0004489228,0.92808574,0.000091850816,0.00016263386,0.0012215672,0.00041582028,0.058960345,0.007279367,0.0016954744,0.0015076366,0.00004790263],"about_ca_topic_score_codex":0.0020507767,"about_ca_topic_score_gemma":0.0049516493,"teacher_disagreement_score":0.0020507767,"about_ca_system_score_codex":0.00022417813,"about_ca_system_score_gemma":0.00012116615,"threshold_uncertainty_score":0.0040776134},"labels":[],"label_agreement":null},{"id":"W2789177853","doi":"10.1609/aaai.v32i1.12274","title":"Visual Relationship Detection With Deep Structural Ranking","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Multimodal Machine Learning Applications","field":"Computer Science","cited_by":96,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Canada Research Chairs","keywords":"Ranking (information retrieval); Computer science; Artificial intelligence; Complement (music); Representation (politics); Relevance (law); Object (grammar); Machine learning; Pattern recognition (psychology); Function (biology); Image (mathematics)","score_opus":0.047743937746706655,"score_gpt":0.31674477158315684,"score_spread":0.2690008338364502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789177853","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.070751205,0.0024006094,0.909874,0.000328491,0.0001357364,0.00023950182,0.0012966845,0.009860622,0.005113162],"genre_scores_gemma":[0.6267779,0.0009357023,0.35606596,0.0004190536,0.00018610206,0.0002171152,0.0057613864,0.00055424275,0.009082506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987325,0.00018735378,0.00005841866,0.00042750133,0.00039644225,0.00019771034],"domain_scores_gemma":[0.99875,0.00031601297,0.00023975951,0.00030437598,0.00027573342,0.000114044706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008348082,0.0018960246,0.0014006951,0.0040160986,0.0006654232,0.0015422778,0.0031787206,0.0016588925,0.0037774674],"category_scores_gemma":[0.0028350926,0.0005941763,0.0012113451,0.0025759167,0.00048433078,0.0031531383,0.0020151553,0.0015862173,0.0022136918],"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.00044474335,0.00056057743,0.004214717,0.00039116445,0.0001877078,0.00034919626,0.00016179017,0.04233181,0.033789616,0.0084973695,0.020063607,0.8890077],"study_design_scores_gemma":[0.000037310547,0.00018738059,0.0020207907,0.00003628083,0.000078712175,0.0003588426,0.00008628179,0.9649402,0.013400616,0.014166301,0.0046473043,0.00003995187],"about_ca_topic_score_codex":0.006216206,"about_ca_topic_score_gemma":0.014812695,"teacher_disagreement_score":0.006216206,"about_ca_system_score_codex":0.00088838587,"about_ca_system_score_gemma":0.0011245908,"threshold_uncertainty_score":0.0126369},"labels":[],"label_agreement":null},{"id":"W2795115631","doi":"10.1609/aaai.v32i1.11426","title":"Learning to Become an Expert: Deep Networks Applied to Super-Resolution Microscopy","year":2018,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Cell Image Analysis Techniques","field":"Biochemistry, Genetics and Molecular Biology","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":"Université Laval","funders":"","keywords":"STED microscopy; Computer science; Artificial intelligence; Artificial neural network; Quality (philosophy); Deep learning; Resolution (logic); Function (biology); Image quality; Measure (data warehouse); Machine learning; Microscopy; Superresolution; Image (mathematics); Pattern recognition (psychology); Data mining; Optics; Physics","score_opus":0.035439348245276184,"score_gpt":0.32617841847136175,"score_spread":0.2907390702260856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795115631","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.15616265,0.0014752902,0.83515006,0.0017479744,0.000114870905,0.000071774084,0.000120783756,0.0017509318,0.0034056688],"genre_scores_gemma":[0.88309735,0.00043564633,0.11315323,0.00025774908,0.000038424998,0.000045964192,0.00012296397,0.00007008067,0.0027785914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994831,0.00019859754,0.000018985047,0.000095815114,0.00013705732,0.00006650002],"domain_scores_gemma":[0.99876827,0.00070578273,0.000101162885,0.00013145973,0.00022282968,0.000070377944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001507328,0.00048171994,0.00035795243,0.00027945277,0.0001976379,0.0006335857,0.0007414964,0.0012058142,0.0011158973],"category_scores_gemma":[0.0044789454,0.00029347438,0.00021662355,0.00027838003,0.0005033516,0.0011030234,0.0009740262,0.0013915236,0.0002623526],"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.0003878129,0.00022183472,0.0030306121,0.00013526205,0.00010034888,0.00024271174,0.00034094567,0.63229895,0.024269354,0.010353342,0.0035253316,0.32509354],"study_design_scores_gemma":[0.000003602173,0.000013650218,0.00022013429,0.000004986996,0.0000036104823,0.000013214671,0.00000795282,0.9931765,0.0025570374,0.0037045563,0.00029121782,0.0000036692772],"about_ca_topic_score_codex":0.005099915,"about_ca_topic_score_gemma":0.005470372,"teacher_disagreement_score":0.005099915,"about_ca_system_score_codex":0.00086946896,"about_ca_system_score_gemma":0.00042727406,"threshold_uncertainty_score":0.010140479},"labels":[],"label_agreement":null},{"id":"W2804364458","doi":"10.1609/aaai.v32i1.12221","title":"Clustering - What Both Theoreticians and Practitioners Are Doing Wrong","year":2018,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Clustering Algorithms Research","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 Waterloo","funders":"","keywords":"Cluster analysis; Computer science; Selection (genetic algorithm); Task (project management); Conceptual clustering; Correlation clustering; Machine learning; Implementation; Consensus clustering; Constrained clustering; CURE data clustering algorithm; Artificial intelligence; Data mining; Engineering","score_opus":0.0757605411064104,"score_gpt":0.3368907167482257,"score_spread":0.2611301756418153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804364458","genre_codex":"commentary","genre_gemma":"methods","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020607195,0.051469218,0.10604784,0.8104351,0.01007587,0.000042456242,0.00029580668,0.0007326796,0.018840343],"genre_scores_gemma":[0.19983816,0.13873835,0.28540242,0.3163682,0.03495739,0.00047584335,0.001282011,0.0023444323,0.020593215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9596301,0.021094264,0.0017661551,0.00478134,0.01160472,0.0011233862],"domain_scores_gemma":[0.86469203,0.09028243,0.0034638692,0.021631006,0.016668355,0.0032623906],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0436604,0.0013717723,0.0024761434,0.0055859243,0.007707458,0.015652617,0.0063417633,0.0153981345,0.005899038],"category_scores_gemma":[0.12677279,0.0011133262,0.0015767599,0.008810697,0.03102647,0.036055278,0.0056636883,0.012619315,0.0055359732],"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.000055237895,0.000034407738,0.0014798352,0.0010527181,0.00013862959,0.00010118853,0.0025439193,0.0023622261,0.00020060166,0.6217492,0.2329999,0.13728218],"study_design_scores_gemma":[0.000016152459,0.000010641258,0.00033033092,0.00078131445,0.000014790629,0.00013696334,0.0018271597,0.0017018643,0.00025078465,0.8910473,0.10382327,0.000059503956],"about_ca_topic_score_codex":0.007537201,"about_ca_topic_score_gemma":0.0056511746,"teacher_disagreement_score":0.9563396,"about_ca_system_score_codex":0.005627858,"about_ca_system_score_gemma":0.0054233233,"threshold_uncertainty_score":0.23090106},"labels":[],"label_agreement":null},{"id":"W2805487959","doi":"10.1609/aaai.v32i1.12154","title":"AdGAP: Advanced Global Average Pooling","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Image and Video Retrieval Techniques","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":"Indian Institute of Technology Kharagpur","keywords":"Pooling; Computer science; Class (philosophy); Architecture; Feature (linguistics); Artificial intelligence; Pattern recognition (psychology); Image (mathematics); Position (finance); Computer vision; Data mining; Geography","score_opus":0.05587852239492569,"score_gpt":0.3299980462256266,"score_spread":0.27411952383070093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805487959","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.017045755,0.0016097254,0.94310653,0.00032305135,0.0003649198,0.00024202609,0.0017728829,0.025244048,0.010291107],"genre_scores_gemma":[0.3260188,0.0012025008,0.63973826,0.0008518607,0.0003240346,0.0006846822,0.007830798,0.0020961878,0.021252817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994172,0.00007319984,0.000030369338,0.00018605373,0.00017279678,0.00012039908],"domain_scores_gemma":[0.999645,0.00006274384,0.000029337723,0.00013721803,0.000090038455,0.000035666177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009472038,0.0021038374,0.0013525867,0.0010297421,0.0005926987,0.0016283947,0.0033209252,0.0015539335,0.013362106],"category_scores_gemma":[0.0015264731,0.0005426751,0.0012049719,0.0011337985,0.00061948725,0.0020052285,0.0025078454,0.0016816844,0.0047388873],"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.0008545441,0.00034952487,0.0008401042,0.00063398306,0.00044384395,0.00043872485,0.00012352754,0.046334565,0.068576254,0.02187644,0.07949382,0.78003466],"study_design_scores_gemma":[0.00017575706,0.0005234067,0.0018619772,0.00006880482,0.00018691194,0.0008240314,0.000073057614,0.7755569,0.11025006,0.048363194,0.062025014,0.00009086126],"about_ca_topic_score_codex":0.003426193,"about_ca_topic_score_gemma":0.005257492,"teacher_disagreement_score":0.013362106,"about_ca_system_score_codex":0.0008038507,"about_ca_system_score_gemma":0.0011298772,"threshold_uncertainty_score":0.044700682},"labels":[],"label_agreement":null},{"id":"W2805553943","doi":"10.1609/aaai.v32i1.11382","title":"SmartHS: An AI Platform for Improving Government Service Provision","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Digital Economy and Work Transformation","field":"Social Sciences","cited_by":65,"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":"National Natural Science Foundation of China; National Research Foundation","keywords":"Government (linguistics); Business; Service (business); Workflow; Toolbox; Knowledge management; Marketing; Public relations; Computer science; Economics; Management; Political science","score_opus":0.0721843376748713,"score_gpt":0.31755201270026495,"score_spread":0.24536767502539364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805553943","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.3493619,0.000567201,0.5164881,0.004231382,0.00029749138,0.0015457078,0.001362964,0.0594373,0.066708066],"genre_scores_gemma":[0.6895722,0.0004602238,0.28858116,0.00067481375,0.00010065262,0.00042459063,0.0017639002,0.000964382,0.017458094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991565,0.00025702495,0.00004849506,0.00011261898,0.00032974093,0.00009573193],"domain_scores_gemma":[0.9987676,0.00034324953,0.00012270786,0.0003199511,0.00021435603,0.00023214532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015720198,0.00038851658,0.00021144057,0.0008937552,0.0005985755,0.001026854,0.0009758241,0.0004150431,0.006625557],"category_scores_gemma":[0.0025859224,0.00022656028,0.00030047479,0.0008142239,0.0009863282,0.0023429361,0.0029564716,0.0007392953,0.0014255586],"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.00062565756,0.0008918448,0.014095123,0.00038439318,0.00008734725,0.00042653998,0.003989073,0.031984154,0.04607497,0.04594986,0.055938497,0.7995525],"study_design_scores_gemma":[0.00042038702,0.0011809756,0.021106495,0.00014888635,0.00014116603,0.00033690446,0.0029214418,0.44754434,0.045607217,0.054206263,0.4261986,0.0001874065],"about_ca_topic_score_codex":0.005727688,"about_ca_topic_score_gemma":0.0055808863,"teacher_disagreement_score":0.006625557,"about_ca_system_score_codex":0.0009150774,"about_ca_system_score_gemma":0.0022263105,"threshold_uncertainty_score":0.022164702},"labels":[],"label_agreement":null},{"id":"W2805910173","doi":"10.1609/aaai.v32i1.11383","title":"An Automated Employee Timetabling System for Small Businesses","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","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":"Quest University Canada","funders":"","keywords":"Seniority; Scheduling (production processes); Integer programming; Work (physics); Business; Computer science; Operations management; Marketing; Operations research; Economics; Engineering","score_opus":0.29406755595754197,"score_gpt":0.42673446947263516,"score_spread":0.1326669135150932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805910173","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.21276034,0.00045216538,0.6053116,0.00066816027,0.00017499723,0.0009941896,0.003603188,0.16933665,0.006698727],"genre_scores_gemma":[0.48557785,0.00020298445,0.5044186,0.00013970221,0.000048209862,0.0005883577,0.0034981945,0.0010420021,0.00448412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955934,0.000094864336,0.0000404885,0.00014218595,0.00011640048,0.000046627316],"domain_scores_gemma":[0.9988921,0.0004405192,0.00014448166,0.0001769924,0.00020066409,0.0001453562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009723308,0.0006191493,0.00042879482,0.00067078765,0.0006847613,0.0006530766,0.0014492922,0.00049032917,0.007779954],"category_scores_gemma":[0.0025454222,0.0003925491,0.00039261568,0.0006740492,0.00018697821,0.0009022536,0.0008064205,0.0005866698,0.0018042026],"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.0019966715,0.0009423648,0.0077175885,0.00046830837,0.0000730194,0.00036017102,0.00076259876,0.09310162,0.05289926,0.0058938735,0.056400653,0.77938384],"study_design_scores_gemma":[0.00020927243,0.00019700201,0.0028774687,0.000029103028,0.000030463261,0.00009766435,0.00014261779,0.94977313,0.01845974,0.0028009755,0.025330666,0.000052008283],"about_ca_topic_score_codex":0.007641501,"about_ca_topic_score_gemma":0.007181201,"teacher_disagreement_score":0.007779954,"about_ca_system_score_codex":0.0009540661,"about_ca_system_score_gemma":0.0016174051,"threshold_uncertainty_score":0.026026547},"labels":[],"label_agreement":null},{"id":"W2806149066","doi":"10.1609/aaai.v32i1.11369","title":"Dataset Evolver: An Interactive Feature Engineering Notebook","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI 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 Toronto","funders":"","keywords":"Feature engineering; Feature (linguistics); Computer science; Construct (python library); Artificial intelligence; Reinforcement learning; Science and engineering; Machine learning; Human–computer interaction; Software engineering; Engineering; Deep learning; Programming language","score_opus":0.05272340630652117,"score_gpt":0.3101749047573195,"score_spread":0.25745149845079834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806149066","genre_codex":"software","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.011190013,0.0006883385,0.19428037,0.0010984334,0.00047201957,0.0006872988,0.19429338,0.57626903,0.021020997],"genre_scores_gemma":[0.07392999,0.00085749733,0.40541425,0.0021460855,0.00027334405,0.0036495717,0.36004597,0.12542404,0.028259292],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941444,0.00011079992,0.000045123405,0.0001507284,0.0002238617,0.000055066084],"domain_scores_gemma":[0.9963368,0.0022779212,0.000112684924,0.00057495973,0.00034479905,0.00035283234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015992541,0.0018206154,0.0009649534,0.0019225267,0.0005157875,0.0018330241,0.0031411527,0.0010416087,0.066802695],"category_scores_gemma":[0.0075030853,0.0009028543,0.0012068518,0.0013774446,0.00030165678,0.0027908948,0.002815641,0.002229743,0.020242132],"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.00090302003,0.00015871886,0.0013906294,0.00069031375,0.00010547556,0.00041883544,0.00026983957,0.0036841722,0.005685416,0.0029783426,0.8830213,0.10069402],"study_design_scores_gemma":[0.0011042046,0.00017776816,0.0055013318,0.00024694178,0.00005962716,0.0005820106,0.00019321925,0.06447227,0.021343088,0.016457567,0.8896072,0.00025479877],"about_ca_topic_score_codex":0.0025633106,"about_ca_topic_score_gemma":0.005391702,"teacher_disagreement_score":0.066802695,"about_ca_system_score_codex":0.0007704848,"about_ca_system_score_gemma":0.00089013047,"threshold_uncertainty_score":0.2234773},"labels":[],"label_agreement":null},{"id":"W2806367735","doi":"10.1609/aaai.v32i1.12140","title":"Towards Neural Speaker Modeling in Multi-Party Conversation: The Task, Dataset, and Models","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Speech Recognition and Synthesis","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 Waterloo","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Conversation; Computer science; Task (project management); Component (thermodynamics); Speaker diarisation; Speech recognition; Speaker recognition; Artificial intelligence; Natural language processing; Linguistics","score_opus":0.24178893384203265,"score_gpt":0.3237499481515659,"score_spread":0.08196101430953323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806367735","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.2684461,0.0044652703,0.6879225,0.0049588145,0.0009084013,0.00076406443,0.019766083,0.00716484,0.0056040375],"genre_scores_gemma":[0.58073384,0.0012216265,0.34437045,0.0007829852,0.0006690043,0.0016147585,0.06479315,0.00039666536,0.0054174233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974597,0.0013782155,0.000105470535,0.00064468913,0.0002793179,0.00013267453],"domain_scores_gemma":[0.99645364,0.0014491098,0.0001761829,0.001086509,0.0006036535,0.00023090064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044659222,0.0015613493,0.0010714434,0.0011898432,0.0012977145,0.0015191567,0.0021125549,0.002252067,0.002296386],"category_scores_gemma":[0.01081551,0.00044964536,0.0014901778,0.0009220778,0.00059981423,0.0023873046,0.0027590771,0.0044441917,0.0034101363],"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.0021772585,0.0024873693,0.04027375,0.000788221,0.0008564574,0.00042979585,0.0011479184,0.105009,0.03499335,0.010015327,0.06837146,0.7334502],"study_design_scores_gemma":[0.00011964601,0.00025577846,0.012624899,0.00012620805,0.00026092672,0.00036429174,0.00060702156,0.9351328,0.012411371,0.019327791,0.018649265,0.00012007546],"about_ca_topic_score_codex":0.008725256,"about_ca_topic_score_gemma":0.011857729,"teacher_disagreement_score":0.008725256,"about_ca_system_score_codex":0.0009820674,"about_ca_system_score_gemma":0.0016955466,"threshold_uncertainty_score":0.02361834},"labels":[],"label_agreement":null},{"id":"W2806372986","doi":"10.1609/aaai.v32i1.11353","title":"Building More Explainable Artificial Intelligence With Argumentation","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":32,"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":"National Research Foundation","keywords":"Argumentation theory; Artificial intelligence; Black box; Computer science; Order (exchange); Data science; Management science; Epistemology; Engineering; Philosophy","score_opus":0.07023473309506409,"score_gpt":0.31771451339344026,"score_spread":0.24747978029837617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806372986","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.014187073,0.00081230595,0.9555358,0.008345047,0.00018890057,0.00022561569,0.00019250307,0.0008276142,0.019685134],"genre_scores_gemma":[0.21462378,0.0008662916,0.7779268,0.001174982,0.00018352311,0.0003894284,0.0006406356,0.00023409812,0.003960523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940568,0.0037664417,0.0002928278,0.0006516068,0.0010247721,0.00020752879],"domain_scores_gemma":[0.9868401,0.008460272,0.00074653333,0.0027834184,0.0008521013,0.0003175785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072669936,0.0012525581,0.00079996046,0.0021644845,0.0014142656,0.0045364546,0.002643357,0.0031356046,0.006958624],"category_scores_gemma":[0.021833394,0.00084551965,0.0029153938,0.0010099496,0.005008283,0.010586569,0.00859774,0.005265146,0.0009298305],"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.000020469653,0.00008297518,0.0006054385,0.0002641726,0.00012420962,0.00027693235,0.0018261254,0.024449563,0.0009702748,0.93891054,0.0026657216,0.02980358],"study_design_scores_gemma":[0.000030212821,0.000021813423,0.00017969735,0.00013698764,0.000041717358,0.00007976866,0.00030620256,0.062022477,0.00069266785,0.9124502,0.024010777,0.000027515069],"about_ca_topic_score_codex":0.0013317049,"about_ca_topic_score_gemma":0.0027082234,"teacher_disagreement_score":0.0072669936,"about_ca_system_score_codex":0.0017667911,"about_ca_system_score_gemma":0.0017183423,"threshold_uncertainty_score":0.038432002},"labels":[],"label_agreement":null},{"id":"W2806544672","doi":"10.1609/aaai.v32i1.12186","title":"Rating Super-Resolution Microscopy Images With Deep Learning","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Cell Image Analysis Techniques","field":"Biochemistry, Genetics and Molecular Biology","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":"Université Laval","funders":"","keywords":"Artificial intelligence; Computer science; Deep learning; Task (project management); Image quality; Quality (philosophy); Microscopy; Resolution (logic); Function (biology); Image resolution; Machine learning; Image (mathematics); Computer vision; Pattern recognition (psychology); Optics; Physics; Engineering; Biology; Systems engineering","score_opus":0.021925063919918768,"score_gpt":0.2956859042507157,"score_spread":0.27376084033079695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806544672","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.21053751,0.0014209519,0.7769808,0.0011636369,0.00015618469,0.00025936283,0.00086525496,0.0031837753,0.0054324693],"genre_scores_gemma":[0.81922746,0.0005548133,0.17489496,0.00023780507,0.00009381771,0.000092450544,0.0010352336,0.00016603923,0.003697385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983581,0.00043292475,0.00008464925,0.0003036887,0.0007179483,0.00010282982],"domain_scores_gemma":[0.9953602,0.0019651647,0.00046203175,0.00060253864,0.0013952918,0.00021473363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002119964,0.0009182334,0.00055320794,0.001104183,0.00016516606,0.0009274119,0.0007547587,0.0013991392,0.0039217058],"category_scores_gemma":[0.011019805,0.0002689822,0.0005146121,0.00050864957,0.00034065676,0.0015897721,0.0009458273,0.0012106483,0.0011603074],"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.0011632532,0.00055453705,0.012878305,0.00039494355,0.0002855819,0.00022273214,0.00016466224,0.17235717,0.045381684,0.003994192,0.014079195,0.7485238],"study_design_scores_gemma":[0.000021830287,0.00016135708,0.0034976224,0.000022439788,0.000026144007,0.000083375206,0.00002607737,0.97882026,0.011587717,0.004729407,0.0010004699,0.00002326789],"about_ca_topic_score_codex":0.0022402636,"about_ca_topic_score_gemma":0.0042063403,"teacher_disagreement_score":0.0039217058,"about_ca_system_score_codex":0.00077643944,"about_ca_system_score_gemma":0.00031997843,"threshold_uncertainty_score":0.013119459},"labels":[],"label_agreement":null},{"id":"W2806731171","doi":"10.1609/aaai.v32i1.11423","title":"TipMaster: A Knowledge Base of Authoritative Local News Sources on Social Media","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Misinformation and Its Impacts","field":"Social Sciences","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":"Thomson Reuters (Canada)","funders":"","keywords":"Mainstream; Social media; Metadata; Precision and recall; Recall; Computer science; World Wide Web; Local government; Base (topology); News media; Government (linguistics); Information retrieval; Data science; Political science; Advertising; Business; Psychology","score_opus":0.1900927591908508,"score_gpt":0.3808605871941506,"score_spread":0.1907678280032998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806731171","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.3276704,0.003607947,0.34369472,0.0019865094,0.00027720514,0.0024231896,0.22836606,0.066549174,0.0254248],"genre_scores_gemma":[0.49881044,0.001401196,0.26909667,0.00036415452,0.00015823492,0.000898645,0.22157365,0.0006728695,0.0070241774],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990907,0.000107770386,0.00009300192,0.0003385761,0.00028901675,0.0000809109],"domain_scores_gemma":[0.996216,0.0016579847,0.000474508,0.0006476018,0.0007372736,0.00026655997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091871474,0.0012734188,0.0007732596,0.011989555,0.0010648622,0.002122654,0.0020706109,0.0014768027,0.004546619],"category_scores_gemma":[0.008702462,0.00053455296,0.0008105754,0.0049645267,0.00038160844,0.004869536,0.0019541022,0.0012703151,0.003685928],"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.0010562176,0.0013975713,0.098736465,0.0022961088,0.0006564593,0.0039849165,0.0026181405,0.023110574,0.019224316,0.00503592,0.115489736,0.7263936],"study_design_scores_gemma":[0.00019611687,0.00052445923,0.09389653,0.0009906404,0.0009708541,0.002569989,0.0029888772,0.6391203,0.047191408,0.016919442,0.19434617,0.000285222],"about_ca_topic_score_codex":0.016424648,"about_ca_topic_score_gemma":0.03339247,"teacher_disagreement_score":0.016424648,"about_ca_system_score_codex":0.0009517686,"about_ca_system_score_gemma":0.0022067765,"threshold_uncertainty_score":0.0326581},"labels":[],"label_agreement":null},{"id":"W2806863256","doi":"10.1609/aaai.v32i1.12155","title":"Training Autoencoders in Sparse Domain","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Generative Adversarial Networks and Image Synthesis","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":"McGill University","funders":"","keywords":"Discrete cosine transform; Artificial intelligence; Computer science; Sparse approximation; Fast Fourier transform; Encoding (memory); Pattern recognition (psychology); Domain (mathematical analysis); Frequency domain; Dimensionality reduction; Feature (linguistics); Representation (politics); Autoencoder; Discrete Fourier transform (general); Fourier transform; Algorithm; Image (mathematics); Computer vision; Deep learning; Mathematics; Short-time Fourier transform; Fourier analysis","score_opus":0.1123061887485974,"score_gpt":0.2962036159536301,"score_spread":0.18389742720503272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806863256","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.024217615,0.00030713476,0.97223324,0.00026542557,0.000058859016,0.000029687704,0.00007878438,0.00056823564,0.0022410634],"genre_scores_gemma":[0.6709842,0.0007511681,0.3207756,0.00048255688,0.00014695038,0.00017898098,0.000548449,0.00016690927,0.0059653386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959713,0.00013827404,0.000021300859,0.00009388473,0.000111155605,0.000038178157],"domain_scores_gemma":[0.9978344,0.0015872028,0.00011247919,0.00022220176,0.00020506489,0.000038570517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011032947,0.0006526178,0.00067559205,0.0003482336,0.00022111977,0.00054176553,0.00061880157,0.0010088332,0.0018099784],"category_scores_gemma":[0.004736884,0.0005157072,0.00038497153,0.00040087142,0.00075767766,0.0010951353,0.00085337175,0.0017790648,0.00069413084],"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.00006230708,0.00006174478,0.00063553464,0.00007949098,0.000059052734,0.00007579196,0.000058750415,0.8802544,0.0064438838,0.019097144,0.0025450045,0.09062684],"study_design_scores_gemma":[0.0000037385025,0.000012853757,0.000067141475,0.0000053765016,0.0000028406223,0.000011720881,0.000004032559,0.99355006,0.0010995261,0.004870631,0.0003696056,0.0000024141477],"about_ca_topic_score_codex":0.0017666118,"about_ca_topic_score_gemma":0.0026435205,"teacher_disagreement_score":0.0018099784,"about_ca_system_score_codex":0.0003577842,"about_ca_system_score_gemma":0.0004287799,"threshold_uncertainty_score":0.0060549974},"labels":[],"label_agreement":null},{"id":"W2806928859","doi":"10.1609/aaai.v32i1.12183","title":"Imitation Upper Confidence Bound for Bandits on a Graph","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Institut de Valorisation des Données","keywords":"Graph; Upper and lower bounds; Computer science; Imitation; Extension (predicate logic); Theoretical computer science; Mathematics; Mathematical optimization; Artificial intelligence; Psychology","score_opus":0.31198128436934186,"score_gpt":0.4631698758885268,"score_spread":0.15118859151918496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806928859","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.035173167,0.0005070027,0.9585033,0.00068624876,0.00004841862,0.000058945265,0.00012294426,0.0006358347,0.0042640786],"genre_scores_gemma":[0.8291359,0.0005760312,0.16343294,0.00040304183,0.00012592642,0.00034407352,0.00045782086,0.00031969917,0.0052046985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962831,0.0015504229,0.00017975386,0.00066988514,0.00085631706,0.00046051227],"domain_scores_gemma":[0.9571231,0.034559548,0.0024175453,0.0027435413,0.0021018626,0.0010543877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059141433,0.0015847131,0.0029628105,0.0016765959,0.0010724759,0.002972663,0.0034738039,0.003036309,0.0039495486],"category_scores_gemma":[0.04979809,0.0007949152,0.0007839137,0.0018607405,0.0027724023,0.0048773843,0.0033268633,0.0037331462,0.00081939594],"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.00021996605,0.00006798191,0.00078437227,0.00009808731,0.00005003984,0.00006762757,0.000093450624,0.9106744,0.00071424607,0.058645703,0.0015360214,0.027048066],"study_design_scores_gemma":[0.000008986494,0.000014141907,0.00004946911,0.000009686093,0.000004518784,0.000011156422,0.000005517559,0.97782636,0.00022441613,0.021679446,0.00016155042,0.000004824766],"about_ca_topic_score_codex":0.0053483522,"about_ca_topic_score_gemma":0.0031742502,"teacher_disagreement_score":0.0059141433,"about_ca_system_score_codex":0.0029990189,"about_ca_system_score_gemma":0.0020821572,"threshold_uncertainty_score":0.0312773},"labels":[],"label_agreement":null},{"id":"W2807252041","doi":"10.1609/aaai.v32i1.11413","title":"Optimal Pricing for Distance-Based Transit Fares","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Transportation Planning and Optimization","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":true,"ca_institutions":"Quest University Canada","funders":"","keywords":"Metropolitan area; Transit (satellite); Revenue; Equity (law); Transport engineering; Business; Pricing strategies; Service (business); Public transport; Computer science; Microeconomics; Economics; Finance; Geography; Engineering; Marketing","score_opus":0.08141576696269703,"score_gpt":0.3332916122753961,"score_spread":0.2518758453126991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807252041","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.21784367,0.00078500004,0.73803365,0.0017629435,0.00019688213,0.00025094417,0.0002467697,0.0003782717,0.040501837],"genre_scores_gemma":[0.9623655,0.00022414727,0.03215684,0.000088132816,0.00005407959,0.000050536193,0.00007681358,0.00006470795,0.004919183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984523,0.00050388195,0.000054181768,0.00020200048,0.00048432467,0.00030330516],"domain_scores_gemma":[0.99729025,0.0017046878,0.00017410424,0.00020243881,0.00046269904,0.00016593412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020891787,0.000579867,0.0008698853,0.0009253681,0.00052983366,0.0025531298,0.0017765564,0.0010998982,0.0040379954],"category_scores_gemma":[0.013777587,0.00064606196,0.0005314289,0.00078099384,0.0013173963,0.0027747287,0.0010181225,0.0017211533,0.00029226314],"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.00006707915,0.000075043165,0.0013897279,0.000038937076,0.000019233239,0.0000783644,0.00012390237,0.8520911,0.0010750683,0.1179772,0.0024242834,0.024640167],"study_design_scores_gemma":[0.000011673816,0.000015871194,0.00039139506,0.000006617682,0.0000065976997,0.00001782283,0.00004041867,0.96914244,0.00015312787,0.029593745,0.0006115802,0.000008796828],"about_ca_topic_score_codex":0.015058223,"about_ca_topic_score_gemma":0.012906322,"teacher_disagreement_score":0.015058223,"about_ca_system_score_codex":0.004383246,"about_ca_system_score_gemma":0.0020400565,"threshold_uncertainty_score":0.031802833},"labels":[],"label_agreement":null},{"id":"W2807463858","doi":"10.1609/aaai.v32i1.12164","title":"Preliminary Results on Exploration-Driven Satisfiability Solving","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI 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 Alberta","funders":"","keywords":"Heuristic; Satisfiability; Boolean satisfiability problem; Computer science; Branching (polymer chemistry); Heuristics; DPLL algorithm; Space (punctuation); Theoretical computer science; Algorithm; Artificial intelligence; Chemistry","score_opus":0.08495256228418385,"score_gpt":0.29892390857299717,"score_spread":0.2139713462888133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807463858","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.13117342,0.0059756194,0.82687443,0.0029030587,0.00020362792,0.0004110582,0.000459636,0.0023822759,0.029616863],"genre_scores_gemma":[0.59448344,0.0027773974,0.39531937,0.0010327193,0.00026039168,0.00027691416,0.001344102,0.00036957202,0.0041360864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954464,0.0025027483,0.0001755115,0.0005747736,0.001059311,0.00024119832],"domain_scores_gemma":[0.9697341,0.02627543,0.00038968833,0.001751657,0.0014959614,0.00035315566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055974736,0.00082564884,0.0009727942,0.00079325994,0.00056117354,0.0013180942,0.0019781797,0.0011179983,0.008249008],"category_scores_gemma":[0.03168604,0.00047108904,0.0010930242,0.0015447248,0.0015649393,0.0028065105,0.001994594,0.002767688,0.0006896523],"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.00058181485,0.000784582,0.0051078857,0.0010064476,0.00021686062,0.00007401526,0.0002603355,0.6125575,0.0054289014,0.05558055,0.006704089,0.31169713],"study_design_scores_gemma":[0.00011043206,0.00038238292,0.00063138874,0.000060472143,0.000043885848,0.00006293652,0.00006516362,0.9500695,0.0039802813,0.039145816,0.005434058,0.000013757688],"about_ca_topic_score_codex":0.0026951188,"about_ca_topic_score_gemma":0.005531549,"teacher_disagreement_score":0.008249008,"about_ca_system_score_codex":0.0011622172,"about_ca_system_score_gemma":0.0014626476,"threshold_uncertainty_score":0.029602587},"labels":[],"label_agreement":null},{"id":"W283996357","doi":"10.1609/aaai.v27i1.8641","title":"On the Value of Using Group Discounts under Price Competition","year":2013,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Regret; Vendor; Microeconomics; Profit (economics); Schedule; Exploit; Competition (biology); Value (mathematics); Order (exchange); Yield (engineering); Business; Economics; Computer science; Marketing","score_opus":0.2139040112757152,"score_gpt":0.38105935223126775,"score_spread":0.16715534095555254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W283996357","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.3943393,0.0068230764,0.5005055,0.015169774,0.00046164644,0.00034970263,0.00060619315,0.00047207827,0.08127277],"genre_scores_gemma":[0.97525996,0.0010088818,0.019929994,0.00064557476,0.00030634325,0.00008117838,0.00009204156,0.00010705129,0.002568839],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98945194,0.0073291534,0.0002672613,0.000907759,0.000995885,0.001048031],"domain_scores_gemma":[0.8553668,0.12620738,0.007081379,0.005785118,0.0021978582,0.0033614775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02021612,0.0013789961,0.0031621396,0.0015104725,0.001697543,0.0050741285,0.0033108818,0.0046862373,0.005738005],"category_scores_gemma":[0.0825735,0.0010320643,0.0016176499,0.0017241061,0.004805365,0.0114396745,0.0038676122,0.0057681715,0.00044805626],"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.0016388351,0.0004221539,0.0046578953,0.00030437953,0.00032276547,0.00041066558,0.00039510953,0.5626621,0.0008798821,0.38052145,0.005543515,0.04224126],"study_design_scores_gemma":[0.00024082517,0.0003761941,0.00097180734,0.00008615247,0.00013003203,0.00018744015,0.00019291534,0.45416644,0.00039161893,0.54138726,0.0017960992,0.00007316799],"about_ca_topic_score_codex":0.0025031525,"about_ca_topic_score_gemma":0.001543786,"teacher_disagreement_score":0.02021612,"about_ca_system_score_codex":0.0039490773,"about_ca_system_score_gemma":0.0021371401,"threshold_uncertainty_score":0.10691434},"labels":[],"label_agreement":null},{"id":"W2886012730","doi":"10.1609/aaai.v34i04.5955","title":"Count-Based Exploration with the Successor Representation","year":2020,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alberta Innovates; University of Alberta; Alberta Machine Intelligence Institute; Compute Canada","keywords":"Successor cardinal; Representation (politics); Computer science; Norm (philosophy); Generalization; Sample complexity; Reinforcement learning; Similarity (geometry); Artificial intelligence; State (computer science); Algorithm; Theoretical computer science; Mathematics","score_opus":0.15508351119977026,"score_gpt":0.3234339624244677,"score_spread":0.16835045122469744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886012730","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.029503418,0.00021341247,0.9652595,0.00039585706,0.000057056903,0.00007327984,0.00010708408,0.000958699,0.0034317106],"genre_scores_gemma":[0.67277193,0.00015484623,0.3206093,0.00023335103,0.00006268047,0.00032846257,0.0002834026,0.00021344094,0.0053426055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989448,0.00038168568,0.00006751131,0.00023256014,0.00026394267,0.000109548666],"domain_scores_gemma":[0.99654764,0.0020721399,0.00031572505,0.00056903233,0.00028464303,0.0002107694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018416712,0.0007172966,0.0012407788,0.00079417735,0.00050201145,0.0013311476,0.0022965425,0.0012871362,0.0047647236],"category_scores_gemma":[0.008967494,0.00039721426,0.0006705508,0.0008105403,0.0014559806,0.003987537,0.002790785,0.0020429553,0.0006649088],"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.00042185446,0.00017986416,0.0020058544,0.00020080151,0.000067556146,0.00012614268,0.00024039879,0.52987224,0.003811494,0.23789021,0.0035037545,0.22167985],"study_design_scores_gemma":[0.000027210159,0.000068749694,0.0000775646,0.0000132735095,0.000007869891,0.000028893222,0.000009882,0.9336309,0.000837933,0.064494535,0.00079269614,0.000010499109],"about_ca_topic_score_codex":0.0012526028,"about_ca_topic_score_gemma":0.001776898,"teacher_disagreement_score":0.0047647236,"about_ca_system_score_codex":0.0010744798,"about_ca_system_score_gemma":0.001758761,"threshold_uncertainty_score":0.015939653},"labels":[],"label_agreement":null},{"id":"W2887615774","doi":"10.1609/aaai.v33i01.33013470","title":"On-Line Adaptative Curriculum Learning for GANs","year":2019,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Data Classification","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":"Institut National de la Recherche Scientifique; McGill University","funders":"","keywords":"Discriminator; Computer science; Generator (circuit theory); Generative grammar; Adversarial system; Artificial intelligence; Cover (algebra); Machine learning; Curriculum; Convergence (economics); Quality (philosophy)","score_opus":0.11362376742260104,"score_gpt":0.3441957825344797,"score_spread":0.23057201511187864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887615774","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.01661557,0.00025395103,0.9793058,0.00023872695,0.000038229908,0.00007354202,0.00008181436,0.001110111,0.0022823086],"genre_scores_gemma":[0.74338317,0.00034760084,0.24619187,0.0006684803,0.000103041806,0.0004206552,0.0006505639,0.0004932171,0.0077414364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929845,0.0002861816,0.00002370058,0.00018516115,0.00012192877,0.00008451263],"domain_scores_gemma":[0.9981925,0.0011658081,0.0001318168,0.00023136247,0.00017629049,0.000102119535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017578657,0.0013053213,0.0010175437,0.0005758645,0.0004166698,0.0008607407,0.0020778568,0.0013663053,0.0036219072],"category_scores_gemma":[0.0064110006,0.0006202071,0.00062920485,0.00046453992,0.0010421829,0.0017764237,0.0019173422,0.002747016,0.0010211144],"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.00008967759,0.00007134498,0.00087876467,0.000056104087,0.000038417464,0.000058451686,0.00006921578,0.9124894,0.0020694118,0.01426612,0.0022737146,0.067639396],"study_design_scores_gemma":[0.0000044601125,0.000012217418,0.00004616807,0.0000049937225,0.0000023999796,0.0000108949625,0.000003894326,0.9932555,0.00035765753,0.0060198554,0.00027960574,0.0000022895176],"about_ca_topic_score_codex":0.0021768152,"about_ca_topic_score_gemma":0.0037050466,"teacher_disagreement_score":0.0036219072,"about_ca_system_score_codex":0.0013167735,"about_ca_system_score_gemma":0.0007944809,"threshold_uncertainty_score":0.012116492},"labels":[],"label_agreement":null},{"id":"W2889616780","doi":"10.1609/aaai.v33i01.33011861","title":"Solving Large Extensive-Form Games with Strategy Constraints","year":2019,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI 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":"Regret; Computer science; Set (abstract data type); Nash equilibrium; Mathematical optimization; Perfect information; Counterfactual thinking; Consistency (knowledge bases); Complete information; Mathematical economics; Mathematics; Artificial intelligence; Machine learning","score_opus":0.07993644806912124,"score_gpt":0.3080277459254752,"score_spread":0.22809129785635396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889616780","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.037022624,0.00025206248,0.95543593,0.0007557348,0.000036414694,0.00012546491,0.00019468038,0.00037993648,0.0057971864],"genre_scores_gemma":[0.62029654,0.00035568877,0.37025917,0.0003837515,0.00010573335,0.00052731426,0.00055836583,0.00017821118,0.0073351967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848014,0.00076105556,0.000076387354,0.00033702183,0.0002117341,0.00013356615],"domain_scores_gemma":[0.9879483,0.010800896,0.0003692807,0.0004438093,0.00023085118,0.00020674587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030394674,0.0014104358,0.0014323224,0.0004659047,0.00060454657,0.0019252397,0.0013990446,0.0017642464,0.0041043847],"category_scores_gemma":[0.012549576,0.0008992703,0.0008738688,0.0007659895,0.0012897894,0.0026718494,0.002062565,0.0025492157,0.00046029998],"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.000048480364,0.00008003984,0.00046364925,0.00008567283,0.00004326201,0.00013123636,0.000084864776,0.9374775,0.0003547236,0.042209566,0.001263001,0.017757978],"study_design_scores_gemma":[0.00002216249,0.000014589273,0.00005330461,0.000008003904,0.000006076681,0.00001670411,0.00002302298,0.94855,0.00019936162,0.05058771,0.0005141736,0.000004917509],"about_ca_topic_score_codex":0.0038283751,"about_ca_topic_score_gemma":0.0059835366,"teacher_disagreement_score":0.0041043847,"about_ca_system_score_codex":0.0011490346,"about_ca_system_score_gemma":0.0019034377,"threshold_uncertainty_score":0.016074419},"labels":[],"label_agreement":null},{"id":"W2889732123","doi":"10.1609/aaai.v33i01.33013582","title":"Combined Reinforcement Learning via Abstract Representations","year":2019,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","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":"Université de Montréal; McGill University","funders":"","keywords":"Reinforcement learning; Computer science; Modularity (biology); Bridging (networking); Generalization; Artificial intelligence; Representation (politics); Encoding (memory); Machine learning; Theoretical computer science; Mathematics","score_opus":0.08144392931513404,"score_gpt":0.31546580598770657,"score_spread":0.23402187667257252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889732123","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.009697022,0.00014058653,0.98812604,0.00018864802,0.000028862869,0.000022068387,0.000044335582,0.00040859182,0.0013439471],"genre_scores_gemma":[0.82628393,0.00024841464,0.16985108,0.00015809723,0.000057872516,0.00018417368,0.00019397671,0.00009997062,0.002922389],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918205,0.00031088453,0.00004450377,0.00018671268,0.00020179313,0.00007402126],"domain_scores_gemma":[0.9984164,0.00081658066,0.00016191187,0.00033828564,0.00016944011,0.000097400334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011156969,0.0008902925,0.0011428789,0.00048436841,0.00026938334,0.001152195,0.0015210008,0.0010161811,0.002411722],"category_scores_gemma":[0.004874594,0.00043283918,0.0006690721,0.0005017414,0.0012996707,0.0026032731,0.00244879,0.002205943,0.00043566793],"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.00011315918,0.000066474015,0.00044006816,0.00009434177,0.00006832677,0.0000690148,0.00008418022,0.8272984,0.002515244,0.08750541,0.0010231409,0.08072221],"study_design_scores_gemma":[0.000011417676,0.000029185298,0.000040947703,0.0000055272494,0.000006683923,0.000008489867,0.000003897196,0.9398499,0.00041146114,0.059192095,0.0004343658,0.0000060065736],"about_ca_topic_score_codex":0.0017913347,"about_ca_topic_score_gemma":0.0019453733,"teacher_disagreement_score":0.002411722,"about_ca_system_score_codex":0.00094022957,"about_ca_system_score_gemma":0.0007981521,"threshold_uncertainty_score":0.008068025},"labels":[],"label_agreement":null},{"id":"W2890608676","doi":"10.1609/aaai.v33i01.33011443","title":"Improving Optimization Bounds Using Machine Learning: Decision Diagrams Meet Deep Reinforcement Learning","year":2019,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Formal Methods in Verification","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":"Bounding overwatch; Reinforcement learning; Computer science; Maximum cut; Mathematical optimization; Set (abstract data type); Relaxation (psychology); Perspective (graphical); Optimization problem; Function (biology); Artificial intelligence; Algorithm; Mathematics; Theoretical computer science; Graph","score_opus":0.08560422175768673,"score_gpt":0.32333212729102756,"score_spread":0.23772790553334083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890608676","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.010456272,0.00042200426,0.9864893,0.00026883718,0.000039446637,0.00004295721,0.000052100557,0.00033818345,0.0018908465],"genre_scores_gemma":[0.4850879,0.0008017703,0.51069766,0.00031322768,0.00010908844,0.0003283437,0.00036196705,0.00040637437,0.0018936925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961675,0.0016152938,0.00019880725,0.000659518,0.0010606619,0.0002982129],"domain_scores_gemma":[0.9824332,0.013048232,0.001299404,0.0018012698,0.00090489746,0.0005129635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005236243,0.001885542,0.0016460662,0.0014966832,0.00056392926,0.0020875083,0.0017072521,0.0017339811,0.003941479],"category_scores_gemma":[0.03187687,0.0009857767,0.0012277821,0.0013787217,0.0020871488,0.004169411,0.0034376937,0.0051389574,0.00069577695],"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.00012200158,0.00010572805,0.000835722,0.00022004895,0.000044762823,0.000046525383,0.00011313751,0.809644,0.0024454198,0.09801037,0.0015336591,0.08687859],"study_design_scores_gemma":[0.000013797709,0.000032102824,0.000056884375,0.00002922276,0.000007110897,0.000010141505,0.000007754945,0.9313558,0.00085315906,0.06675198,0.0008758889,0.000006189943],"about_ca_topic_score_codex":0.0022911462,"about_ca_topic_score_gemma":0.0027135902,"teacher_disagreement_score":0.005236243,"about_ca_system_score_codex":0.0021416203,"about_ca_system_score_gemma":0.0024370712,"threshold_uncertainty_score":0.027692199},"labels":[],"label_agreement":null},{"id":"W2891021639","doi":"10.1609/aaai.v33i01.33013714","title":"MixUp as Locally Linear Out-of-Manifold Regularization","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":265,"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 Ottawa; National Research Council Canada","funders":"National Key Research and Development Program of China; Beijing Advanced Innovation Center for Big Data and Brain Computing; National Natural Science Foundation of China","keywords":"Computer science; Regularization (linguistics); Manifold (fluid mechanics); Artificial neural network; Benchmark (surveying); Artificial intelligence; Machine learning; Mixing (physics); Nonlinear dimensionality reduction; Algorithm; Dimensionality reduction","score_opus":0.05000555547855106,"score_gpt":0.29572975316366,"score_spread":0.24572419768510895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891021639","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.02621372,0.00063480873,0.968236,0.00041581178,0.00006158227,0.00012238855,0.00014883999,0.002734759,0.0014319913],"genre_scores_gemma":[0.4985226,0.00049410365,0.49011728,0.00093111803,0.00016283579,0.0006859364,0.0011575342,0.0009908316,0.006937818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840754,0.00070697523,0.00007935652,0.0003507232,0.00033336692,0.0001219797],"domain_scores_gemma":[0.9976706,0.001001208,0.0002285649,0.000690654,0.00026257956,0.00014637726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035475586,0.0018806512,0.0015355372,0.0009971253,0.0007742886,0.0015797985,0.0032846609,0.0024386318,0.0023874387],"category_scores_gemma":[0.0077029043,0.0011094074,0.0013387926,0.0009267264,0.0022255448,0.0030191476,0.005379437,0.0045407936,0.0011990075],"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.00051456655,0.00029508912,0.0035995697,0.00036744666,0.00030003712,0.00024783108,0.00043900445,0.6598876,0.013508464,0.053729504,0.011899602,0.25521123],"study_design_scores_gemma":[0.000015853773,0.00007355284,0.00011041862,0.000015978436,0.000012397266,0.000032841355,0.000013187637,0.98576677,0.002395124,0.0100510465,0.0015005057,0.000012298479],"about_ca_topic_score_codex":0.0014944652,"about_ca_topic_score_gemma":0.002296479,"teacher_disagreement_score":0.0035475586,"about_ca_system_score_codex":0.00111927,"about_ca_system_score_gemma":0.0012201082,"threshold_uncertainty_score":0.018761516},"labels":[],"label_agreement":null},{"id":"W2894280539","doi":"10.1609/aaai.v33i01.33019062","title":"Multilevel Language and Vision Integration for Text-to-Clip Retrieval","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Multimodal Machine Learning Applications","field":"Computer Science","cited_by":332,"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":"Intelligence Advanced Research Projects Activity","keywords":"Computer science; Task (project management); CLIPS; Matching (statistics); Metric (unit); Natural language processing; Artificial intelligence; Sentence; Similarity (geometry); Word (group theory); Recurrent neural network; Artificial neural network; Information retrieval; Image (mathematics)","score_opus":0.04201553110016543,"score_gpt":0.34819292535200913,"score_spread":0.3061773942518437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894280539","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.057284188,0.0027372052,0.90635544,0.00084893784,0.00036686813,0.0004311829,0.0016413633,0.021713419,0.00862141],"genre_scores_gemma":[0.5687347,0.00094293576,0.40880474,0.0009682454,0.00053055666,0.0004781554,0.00626005,0.00079696666,0.012483688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926656,0.00010955751,0.000043964552,0.00024500606,0.00020184195,0.00013316506],"domain_scores_gemma":[0.99906987,0.0003108155,0.00007922149,0.00022136346,0.00022903286,0.0000898025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009210044,0.0013116053,0.0013568496,0.0016681452,0.0004621608,0.0016207433,0.0024309382,0.0018646588,0.007957785],"category_scores_gemma":[0.0034836694,0.00035095096,0.0012286222,0.0016115706,0.00052714517,0.0032638563,0.0016944661,0.0021306674,0.0040592374],"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.00068142265,0.0008924959,0.001006175,0.0005546804,0.00019224863,0.00035529045,0.00016375554,0.12131173,0.07133438,0.008834662,0.03320715,0.7614659],"study_design_scores_gemma":[0.00003350159,0.00023881381,0.00035300956,0.000013935604,0.000045357745,0.00010264458,0.000028980685,0.9749228,0.015436311,0.0053259055,0.003473097,0.000025674117],"about_ca_topic_score_codex":0.009208652,"about_ca_topic_score_gemma":0.014184683,"teacher_disagreement_score":0.009208652,"about_ca_system_score_codex":0.0013066273,"about_ca_system_score_gemma":0.0012550958,"threshold_uncertainty_score":0.02662146},"labels":[],"label_agreement":null},{"id":"W2901577540","doi":"10.1609/aaai.v33i01.33011435","title":"A SAT+CAS Approach to Finding Good Matrices: New Examples and Counterexamples","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"Compute Canada","keywords":"Counterexample; Circulant matrix; Conjecture; Algebraic number; Set (abstract data type); Order (exchange); Enumeration","score_opus":0.08115225128442288,"score_gpt":0.2795572415818648,"score_spread":0.1984049902974419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901577540","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.423781,0.0017583775,0.4808564,0.0080288565,0.00043226374,0.00020233187,0.0010522353,0.0015482204,0.08234034],"genre_scores_gemma":[0.78710306,0.00066819036,0.20191596,0.0007334315,0.0001884348,0.00018046508,0.0008248362,0.0001799121,0.008205674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982816,0.00066205533,0.00009613846,0.00025933606,0.000534615,0.00016625896],"domain_scores_gemma":[0.9920195,0.006005476,0.00034261894,0.0008280588,0.0005486707,0.0002557177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013725929,0.0007905855,0.0006590315,0.0017987348,0.0016727033,0.0022530463,0.001388469,0.0015353697,0.0054550227],"category_scores_gemma":[0.009524694,0.00042924122,0.00083478435,0.0021394906,0.0028781975,0.0032568038,0.0020333768,0.0026442094,0.0005049966],"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.00034417634,0.0002406132,0.0045196493,0.00036374322,0.00007688655,0.000984884,0.0006152637,0.041961446,0.0045106006,0.894045,0.010816463,0.04152121],"study_design_scores_gemma":[0.0001104922,0.000111635054,0.00087665784,0.00010464085,0.00006552205,0.0009901684,0.00051570986,0.25231075,0.010130322,0.71834373,0.01638104,0.000059199207],"about_ca_topic_score_codex":0.0013539154,"about_ca_topic_score_gemma":0.003100229,"teacher_disagreement_score":0.0054550227,"about_ca_system_score_codex":0.00094966125,"about_ca_system_score_gemma":0.00079014973,"threshold_uncertainty_score":0.018248856},"labels":[],"label_agreement":null},{"id":"W2901745601","doi":"10.1609/aaai.v33i01.33017892","title":"Finding All Bayesian Network Structures within a Factor of Optimal","year":2019,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","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":"Frequentist inference; Bayesian network; Computer science; Variable-order Bayesian network; Graphical model; Machine learning; Bayesian probability; Artificial intelligence; Bayesian average; Probabilistic logic; Bayesian inference; Data mining","score_opus":0.11181728710241448,"score_gpt":0.31775753545290125,"score_spread":0.20594024835048677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901745601","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.04963784,0.0016381205,0.92584944,0.0027297647,0.00009798082,0.00023872765,0.0016091565,0.0015648669,0.016634125],"genre_scores_gemma":[0.4283503,0.0023419843,0.5544527,0.0009467428,0.00032883315,0.0005653758,0.0043438133,0.0008145329,0.007855656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957871,0.0014214865,0.00015432965,0.0014629688,0.0007642674,0.0004099366],"domain_scores_gemma":[0.9856593,0.0103895385,0.0007759318,0.0017602058,0.00095670257,0.00045836857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004275595,0.0020867595,0.002740835,0.003357657,0.0017675187,0.0036800033,0.0025871708,0.0033390187,0.011962361],"category_scores_gemma":[0.044605214,0.0014681792,0.0023684336,0.0027389405,0.0022067975,0.009679843,0.0027537893,0.004257503,0.0031192254],"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.0004513141,0.00032555393,0.007210456,0.00061754073,0.00030591365,0.00026379176,0.0005322338,0.43138215,0.0023223518,0.27780968,0.03244359,0.2463355],"study_design_scores_gemma":[0.000050495186,0.00005378102,0.00080547336,0.000096177064,0.0000672089,0.00013235297,0.000119673736,0.4913856,0.000982668,0.50079453,0.0054811956,0.00003082205],"about_ca_topic_score_codex":0.0062909448,"about_ca_topic_score_gemma":0.0093876,"teacher_disagreement_score":0.011962361,"about_ca_system_score_codex":0.0030671677,"about_ca_system_score_gemma":0.0043608495,"threshold_uncertainty_score":0.04001808},"labels":[],"label_agreement":null},{"id":"W2901871898","doi":"10.1609/aaai.v33i01.33011495","title":"Constraint-Based Sequential Pattern Mining with Decision Diagrams","year":2019,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Office of Naval Research","keywords":"Computer science; Constraint (computer-aided design); Data mining; Sequential Pattern Mining; Scalability; Representation (politics); Projection (relational algebra); Artificial intelligence; Algorithm; Database; Mathematics","score_opus":0.0817448956449763,"score_gpt":0.3044731405390466,"score_spread":0.2227282448940703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901871898","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.006382488,0.00012554381,0.9914888,0.00011180249,0.000013703286,0.00013825318,0.00041595954,0.00096610107,0.00035728142],"genre_scores_gemma":[0.09483136,0.00019455055,0.9029539,0.000068816895,0.000015975576,0.00026356874,0.001144729,0.000085981585,0.000441087],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965449,0.0012958413,0.00032338215,0.000562462,0.0011441907,0.00012923974],"domain_scores_gemma":[0.9853461,0.011552453,0.00071160385,0.0009794048,0.0012107254,0.00019976303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026960915,0.0009498567,0.0010525566,0.0020422165,0.00053551607,0.0018418527,0.0016436536,0.0007920887,0.0031261141],"category_scores_gemma":[0.019573007,0.0006147727,0.0013570796,0.0030476726,0.00069197203,0.0025334456,0.0015056467,0.0013545906,0.00064010615],"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.00066912884,0.00026989705,0.006351873,0.0010370526,0.00032830262,0.0005270029,0.00028812926,0.40818694,0.010356821,0.06494201,0.0055578267,0.50148505],"study_design_scores_gemma":[0.00006023265,0.000064375454,0.0002586485,0.000029275487,0.000038308997,0.00018575891,0.000039729886,0.9492843,0.0059168264,0.040270224,0.0038351032,0.000017212304],"about_ca_topic_score_codex":0.0034285842,"about_ca_topic_score_gemma":0.00418192,"teacher_disagreement_score":0.0034285842,"about_ca_system_score_codex":0.0008558599,"about_ca_system_score_gemma":0.0028651867,"threshold_uncertainty_score":0.014258504},"labels":[],"label_agreement":null},{"id":"W2902833081","doi":"10.1609/aaai.v34i07.6722","title":"SADA: Semantic Adversarial Diagnostic Attacks for Autonomous Applications","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"King Abdullah University of Science and Technology","keywords":"Adversarial system; Adversary; Task (project management); Focus (optics); Deep neural networks; Object (grammar); Autonomous agent; Deep learning","score_opus":0.06996422985742493,"score_gpt":0.3038931894540672,"score_spread":0.23392895959664226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902833081","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.02405339,0.0004616194,0.9648657,0.0013177883,0.00016387436,0.00013828735,0.00022505881,0.0023989705,0.006375347],"genre_scores_gemma":[0.86656445,0.00030656197,0.12630548,0.0009503683,0.000086794134,0.00024864386,0.00039903718,0.00020678887,0.0049319817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989335,0.00038020583,0.00004660763,0.00016002782,0.0003510472,0.00012870178],"domain_scores_gemma":[0.9977724,0.0013564661,0.00019384513,0.00040296325,0.00018212793,0.00009213427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016004088,0.0010096312,0.00068529765,0.0005284592,0.00047977193,0.000818585,0.0011854989,0.0015770707,0.002825774],"category_scores_gemma":[0.0057031056,0.0003582117,0.00072930247,0.00022526228,0.001919559,0.0016133923,0.0034234864,0.0026724301,0.0006064267],"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.00046308574,0.000105305284,0.0015706545,0.00016733159,0.00012397385,0.0002814852,0.000117770425,0.8043097,0.017333722,0.079196535,0.012285943,0.08404448],"study_design_scores_gemma":[0.00001990312,0.00005013417,0.00013864881,0.000014501207,0.0000071036507,0.00007092384,0.000009386589,0.968286,0.0036708864,0.025583532,0.0021387774,0.000010232496],"about_ca_topic_score_codex":0.0009956814,"about_ca_topic_score_gemma":0.001274339,"teacher_disagreement_score":0.002825774,"about_ca_system_score_codex":0.00096210523,"about_ca_system_score_gemma":0.00097004534,"threshold_uncertainty_score":0.009453118},"labels":[],"label_agreement":null},{"id":"W2903017298","doi":"10.1609/aaai.v33i01.33014512","title":"State-Augmentation Transformations for Risk-Sensitive Reinforcement Learning","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","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":"Concordia University","funders":"China Scholarship Council","keywords":"Reinforcement learning; Markov decision process; Markov chain; Successor cardinal; Markov process; Function (biology); Computer science; Bellman equation; Q-learning; State (computer science); Mathematical optimization; Mathematics; Artificial intelligence; Machine learning; Algorithm; Statistics","score_opus":0.043402280773973005,"score_gpt":0.2852395603095862,"score_spread":0.24183727953561318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903017298","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.005535051,0.00014883316,0.9915959,0.0001459063,0.000030252257,0.000045644014,0.000036827616,0.00018493462,0.0022765459],"genre_scores_gemma":[0.7362184,0.00046738164,0.25702554,0.00027206636,0.00009161309,0.0005958988,0.00022469486,0.00017664781,0.004927811],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824834,0.000883098,0.00010703881,0.0003266089,0.0003315052,0.000103456376],"domain_scores_gemma":[0.99706537,0.0020458857,0.00023714975,0.0002861625,0.00026355364,0.000101980695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027869788,0.001322722,0.0010154045,0.000545535,0.00033456393,0.0010587677,0.0009290361,0.0010978951,0.0036842455],"category_scores_gemma":[0.0074072904,0.00042245555,0.001275203,0.00055600726,0.0020261921,0.0018654747,0.0017646059,0.0028030016,0.0005938086],"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.000090556925,0.000090259135,0.00042442235,0.00011694053,0.000046606798,0.00012345848,0.00018805287,0.7082975,0.0022953816,0.24524248,0.0010764045,0.042007975],"study_design_scores_gemma":[0.000012918,0.00004737906,0.000047191108,0.000010772034,0.000006294512,0.000017014074,0.0000056829795,0.91033375,0.0004909163,0.08820883,0.0008113382,0.000008042922],"about_ca_topic_score_codex":0.0012488537,"about_ca_topic_score_gemma":0.0007517368,"teacher_disagreement_score":0.0036842455,"about_ca_system_score_codex":0.0011842054,"about_ca_system_score_gemma":0.0012391254,"threshold_uncertainty_score":0.014739156},"labels":[],"label_agreement":null},{"id":"W2903574704","doi":"10.1609/aaai.v33i01.33013943","title":"Meta-Descent for Online, Continual Prediction","year":2019,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","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":"Stochastic gradient descent; Computer science; Gradient descent; Range (aeronautics); Mathematical optimization; Descent (aeronautics); Hessian matrix; Artificial intelligence; Algorithm; Mathematics; Applied mathematics; Artificial neural network","score_opus":0.5329035804286594,"score_gpt":0.47185202673754284,"score_spread":0.061051553691116534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903574704","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.009488334,0.0008161665,0.9871884,0.00031716021,0.00007351693,0.00003309499,0.000047780984,0.0006671224,0.00136845],"genre_scores_gemma":[0.48159516,0.00075664214,0.5114313,0.00043454074,0.0001996819,0.00032176188,0.00034987475,0.00040614099,0.004504925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992767,0.00026957574,0.000043704895,0.00014220203,0.00020088766,0.000067002824],"domain_scores_gemma":[0.9969445,0.0020865118,0.0002373081,0.00029676443,0.00032919357,0.00010569188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027318394,0.0012122223,0.0016360078,0.0008865416,0.00045625112,0.0013431387,0.002007972,0.0017386392,0.001988339],"category_scores_gemma":[0.00738201,0.00082984427,0.00089930417,0.0008858863,0.0011236827,0.0017181948,0.0012234179,0.00240502,0.00065548706],"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.00007237403,0.000057935904,0.0005648008,0.00009359905,0.000082981904,0.00004816802,0.000040153074,0.9378581,0.0008599885,0.015648142,0.0016741846,0.042999562],"study_design_scores_gemma":[0.0000053497306,0.000010339627,0.000031798092,0.0000057311863,0.0000035349042,0.0000055992614,0.0000020311252,0.99601376,0.00018863507,0.0034086506,0.00032221817,0.0000023715259],"about_ca_topic_score_codex":0.003579758,"about_ca_topic_score_gemma":0.004206594,"teacher_disagreement_score":0.003579758,"about_ca_system_score_codex":0.0011300585,"about_ca_system_score_gemma":0.0016317206,"threshold_uncertainty_score":0.01444757},"labels":[],"label_agreement":null},{"id":"W2903585023","doi":"10.1609/aaai.v33i01.33013412","title":"Spatially Invariant Unsupervised Object Detection with Convolutional Neural Networks","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Samsung","keywords":"Computer science; Artificial intelligence; Interpretability; Object detection; Object (grammar); Convolutional neural network; Cognitive neuroscience of visual object recognition; Generalization; Transfer of learning; Machine learning; Invariant (physics); Unsupervised learning; Pattern recognition (psychology)","score_opus":0.03753807711940282,"score_gpt":0.2539223336304387,"score_spread":0.21638425651103588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903585023","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.048964594,0.00046869752,0.9452502,0.00020515206,0.000038625458,0.000038279795,0.00016157395,0.0027165445,0.0021562122],"genre_scores_gemma":[0.62856025,0.00047849308,0.3632758,0.00027972594,0.00007043213,0.00009776528,0.00089687214,0.00022163815,0.0061189462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995957,0.000054654032,0.0000170031,0.00016511568,0.00010527478,0.00006228771],"domain_scores_gemma":[0.99924374,0.00026151445,0.00014480429,0.00018341727,0.00012857218,0.000038032264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006248084,0.0009654729,0.0005953092,0.0007447462,0.0003040652,0.00074482564,0.0019412366,0.0008423168,0.00089689577],"category_scores_gemma":[0.0018959237,0.0005716744,0.00071202486,0.00079734134,0.0007596941,0.0015868616,0.0011855124,0.0013446944,0.00046475788],"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.00021440767,0.00017640124,0.0028741101,0.0001302552,0.00019957327,0.00020250624,0.0001610127,0.5430193,0.05878775,0.021011198,0.0042167767,0.3690068],"study_design_scores_gemma":[0.00000363405,0.000018082366,0.00040936557,0.0000044421236,0.000008900364,0.000024286,0.0000057154407,0.9883958,0.0054498804,0.005132453,0.0005405816,0.000006885687],"about_ca_topic_score_codex":0.010375048,"about_ca_topic_score_gemma":0.015600789,"teacher_disagreement_score":0.010375048,"about_ca_system_score_codex":0.0011138195,"about_ca_system_score_gemma":0.0008169701,"threshold_uncertainty_score":0.020629346},"labels":[],"label_agreement":null},{"id":"W2903831494","doi":"10.1609/aaai.v33i01.33014983","title":"Hierarchical Context Enabled Recurrent Neural Network for Recommendation","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Recommender Systems and Techniques","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":"Kootenay Association for Science & Technology","funders":"National Research Foundation of Korea; National Research Foundation","keywords":"MovieLens; Computer science; Recurrent neural network; Context (archaeology); Dependency (UML); Artificial intelligence; Term (time); Recommender system; Transition (genetics); Artificial neural network; Machine learning; Collaborative filtering","score_opus":0.08308021677068256,"score_gpt":0.30729041870678975,"score_spread":0.2242102019361072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903831494","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.1221194,0.008860132,0.85510385,0.0010660867,0.0003511436,0.000089930356,0.00089290994,0.004455363,0.0070612463],"genre_scores_gemma":[0.9040946,0.0012739765,0.087692,0.00028271938,0.00012567067,0.00007308924,0.0006976952,0.00006690896,0.005693309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968255,0.00007205827,0.00002178144,0.00010981331,0.000057150566,0.00005661477],"domain_scores_gemma":[0.99963987,0.00016052478,0.000038242033,0.000038370767,0.00010516353,0.00001791013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049726706,0.0006812552,0.00076515484,0.00048816952,0.00030234235,0.0004344973,0.00096135755,0.0008988592,0.0017155707],"category_scores_gemma":[0.0017937381,0.00040998874,0.0005083968,0.00062229455,0.00022872313,0.0012214489,0.00047998966,0.001258423,0.00052819634],"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.00030756346,0.00013879211,0.00233601,0.00018274489,0.00015456011,0.00015562667,0.00010082117,0.7287471,0.007426874,0.0080324635,0.006321949,0.24609543],"study_design_scores_gemma":[0.0000048032243,0.000014726321,0.000206701,0.0000039709776,0.000012107835,0.000006639635,0.0000022842803,0.99781704,0.00030689844,0.0013824991,0.00023846042,0.000003855945],"about_ca_topic_score_codex":0.037290767,"about_ca_topic_score_gemma":0.04921286,"teacher_disagreement_score":0.037290767,"about_ca_system_score_codex":0.001064779,"about_ca_system_score_gemma":0.00077275024,"threshold_uncertainty_score":0.0741474},"labels":[],"label_agreement":null},{"id":"W2903958360","doi":"10.1609/aaai.v33i01.33017975","title":"Lifted Hinge-Loss Markov Random Fields","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"U.S. Army Corps of Engineers; Institut de Valorisation des Données; Canada First Research Excellence Fund; National Science Foundation","keywords":"Inference; Approximate inference; Graphical model; Markov chain; Hinge loss; Random field; Markov random field; Computer science; Mathematical optimization; Optimization problem; Convex optimization; Algorithm; Maximum a posteriori estimation; Theoretical computer science; Mathematics; Artificial intelligence; Regular polygon; Machine learning","score_opus":0.04339664534832468,"score_gpt":0.27234071018871453,"score_spread":0.22894406484038984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903958360","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.0044403016,0.00011283547,0.9941339,0.000193132,0.000023786868,0.00002064045,0.000093615374,0.0003988084,0.00058299786],"genre_scores_gemma":[0.4361849,0.0005214459,0.55655444,0.00059152005,0.00014422159,0.00022641625,0.0007436061,0.00029477626,0.0047386093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984458,0.000706767,0.000059066428,0.00030532863,0.00035825392,0.00012476655],"domain_scores_gemma":[0.99525225,0.0032972572,0.00032878842,0.0006164692,0.00036376732,0.00014155613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038346886,0.0010872326,0.0013826994,0.0007530761,0.0003945192,0.0011493207,0.0023096718,0.0014538724,0.0034210095],"category_scores_gemma":[0.010096118,0.0006853006,0.001102868,0.00086592283,0.0015222294,0.0028773288,0.0017116064,0.0034241083,0.0008713698],"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.00011422066,0.0000610635,0.0006067385,0.00007607923,0.00004300486,0.00010224856,0.00006104277,0.8531196,0.0013173405,0.0755291,0.0028848236,0.066084854],"study_design_scores_gemma":[0.000007141205,0.000010464737,0.000041541556,0.0000050622116,0.0000032251353,0.0000102270205,0.000002652843,0.970189,0.00029409025,0.02909208,0.00034004208,0.00000440312],"about_ca_topic_score_codex":0.0032560162,"about_ca_topic_score_gemma":0.0037728033,"teacher_disagreement_score":0.0038346886,"about_ca_system_score_codex":0.0013585389,"about_ca_system_score_gemma":0.0013287296,"threshold_uncertainty_score":0.020280063},"labels":[],"label_agreement":null},{"id":"W2903963674","doi":"10.1609/aaai.v33i01.33017459","title":"Generating Chinese Ci with Designated Metrical Structure","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Music and Audio Processing","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"National Key Research and Development Program of China; Beijing Advanced Innovation Center for Big Data and Brain Computing; State Key Laboratory of Software Development Environment; National Natural Science Foundation of China","keywords":"Subject (documents); Computer science; Poetry; Artificial intelligence; Natural language processing; Linguistics; Philosophy; World Wide Web","score_opus":0.03904777732918851,"score_gpt":0.26863602814395815,"score_spread":0.22958825081476963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903963674","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.222535,0.0005557021,0.7034471,0.0004842807,0.0006440259,0.0006288744,0.0013780588,0.006740364,0.06358667],"genre_scores_gemma":[0.7793718,0.00019140853,0.20362198,0.00014044993,0.000049466555,0.00022506661,0.0019967607,0.00045711343,0.01394604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999705,0.000052587024,0.000019438654,0.000093961404,0.00009654052,0.000032466713],"domain_scores_gemma":[0.99917763,0.0002403068,0.000038548696,0.0002105851,0.00026905924,0.0000637356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004599383,0.0008472182,0.00045584943,0.00050837715,0.0004475357,0.0006580668,0.0009457226,0.00047823004,0.0075032273],"category_scores_gemma":[0.00304103,0.00023215033,0.00043745682,0.0005681815,0.0005304546,0.0010506385,0.00094332575,0.0008080243,0.0015456282],"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.00037723003,0.00014874607,0.0033932608,0.0009843651,0.00008691022,0.0011940515,0.00093910954,0.0916028,0.107838295,0.07989557,0.020632766,0.6929069],"study_design_scores_gemma":[0.00008820755,0.00024758477,0.0023912136,0.000049620667,0.000059318147,0.0006385627,0.000334765,0.85090166,0.09382862,0.025919404,0.025473453,0.000067688816],"about_ca_topic_score_codex":0.0021391108,"about_ca_topic_score_gemma":0.003270333,"teacher_disagreement_score":0.0075032273,"about_ca_system_score_codex":0.00053455884,"about_ca_system_score_gemma":0.000984473,"threshold_uncertainty_score":0.025100827},"labels":[],"label_agreement":null},{"id":"W2903988268","doi":"10.1609/aaai.v33i01.33017031","title":"Fast PMI-Based Word Embedding with Efficient Use of Unobserved Patterns","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","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":"Dalhousie University","funders":"","keywords":"Pointwise mutual information; Word (group theory); Computer science; Word embedding; Artificial intelligence; Embedding; Similarity (geometry); Pointwise; Margin (machine learning); Natural language processing; Semantic similarity; Kernel (algebra); Latent semantic analysis; Vocabulary; Mutual information; Machine learning; Mathematics; Linguistics","score_opus":0.09438551158186712,"score_gpt":0.27984865010700816,"score_spread":0.18546313852514104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903988268","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.012228127,0.00015983662,0.9857136,0.000091130554,0.000040627576,0.00005337879,0.00015187419,0.001100438,0.00046108259],"genre_scores_gemma":[0.23204987,0.00024946246,0.7599489,0.00012223935,0.00010496128,0.00038946516,0.0022249704,0.00040578732,0.0045044054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991047,0.00024248079,0.000073011186,0.00025812583,0.0002449748,0.0000766409],"domain_scores_gemma":[0.99792624,0.000972032,0.0001857069,0.00043788395,0.00039621364,0.000081826416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007979315,0.0010504489,0.0011609121,0.0014349355,0.00047851048,0.0008888202,0.0017386219,0.00091517554,0.0029966417],"category_scores_gemma":[0.0046129427,0.000559232,0.0009612756,0.0019974473,0.0006901576,0.003090106,0.0018785961,0.001802975,0.0023193439],"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.00024330743,0.00018338382,0.0020059994,0.00022580034,0.000101283156,0.00012928457,0.00023845017,0.114112884,0.01634219,0.021735027,0.006426656,0.83825564],"study_design_scores_gemma":[0.000013045441,0.000046332218,0.0003334196,0.000006829109,0.000008240259,0.00006667343,0.000029575065,0.9820326,0.0033144134,0.012932009,0.0012042364,0.0000126483565],"about_ca_topic_score_codex":0.0022147188,"about_ca_topic_score_gemma":0.003985354,"teacher_disagreement_score":0.0029966417,"about_ca_system_score_codex":0.00057187903,"about_ca_system_score_gemma":0.0010532576,"threshold_uncertainty_score":0.010024786},"labels":[],"label_agreement":null},{"id":"W2904041860","doi":"10.1609/aaai.v33i01.33014854","title":"Congestion Graphs for Automated Time Predictions","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Time Series Analysis and Forecasting","field":"Computer Science","cited_by":19,"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":"Deutsche Forschungsgemeinschaft","keywords":"Computer science; Queueing theory; Scheduling (production processes); Workload; Routing (electronic design automation); Resource (disambiguation); Operations research; Event (particle physics); Resource allocation; Data mining; Distributed computing; Artificial intelligence; Machine learning; Mathematical optimization; Computer network","score_opus":0.041332049782836756,"score_gpt":0.26724424827285503,"score_spread":0.22591219849001828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904041860","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.02855338,0.0009512233,0.94690526,0.00086136634,0.00012788968,0.00019931357,0.0063316114,0.014126374,0.0019434576],"genre_scores_gemma":[0.6304473,0.0008390717,0.35099742,0.00034058228,0.00021105488,0.0003284826,0.014253999,0.0008242842,0.0017578038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989147,0.00024642912,0.000077787154,0.00038102845,0.00028347215,0.00009660672],"domain_scores_gemma":[0.9949367,0.0030515997,0.0007050606,0.0006369309,0.00051386544,0.0001557678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010725372,0.0017623603,0.00086040987,0.004916276,0.0006881436,0.001425114,0.0014553388,0.0012440135,0.0029235054],"category_scores_gemma":[0.011660191,0.00076337776,0.0013398245,0.0030243937,0.0006244289,0.0027044872,0.0012782594,0.0019277215,0.0012485476],"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.00022202363,0.0002110468,0.009350273,0.0002721894,0.00016135874,0.00031598745,0.00024072552,0.7453839,0.0037723507,0.019625904,0.01637515,0.20406905],"study_design_scores_gemma":[0.0000090982585,0.000012327553,0.000726436,0.000017681221,0.000012214658,0.00003179953,0.000025539604,0.9707199,0.0008010065,0.025678102,0.0019536496,0.000012261166],"about_ca_topic_score_codex":0.017586296,"about_ca_topic_score_gemma":0.01824035,"teacher_disagreement_score":0.017586296,"about_ca_system_score_codex":0.0017049003,"about_ca_system_score_gemma":0.0015927076,"threshold_uncertainty_score":0.03496784},"labels":[],"label_agreement":null},{"id":"W2904119616","doi":"10.1609/aaai.v33i01.33011246","title":"Learning Phenotypes and Dynamic Patient Representations via RNN Regularized Collective Non-Negative Tensor Factorization","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning in Healthcare","field":"Computer Science","cited_by":19,"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":"Regularization (linguistics); Computer science; Tensor (intrinsic definition); Temporal database; Artificial intelligence; Machine learning; Pattern recognition (psychology); Data mining; Mathematics","score_opus":0.02497882665520336,"score_gpt":0.2892401545010073,"score_spread":0.264261327845804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904119616","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.056806672,0.0004356993,0.9397417,0.0008578083,0.000095742485,0.00006685394,0.0006274866,0.00062794995,0.0007401226],"genre_scores_gemma":[0.7759097,0.00051188597,0.21726215,0.00040240222,0.00019965517,0.00024496487,0.0022734643,0.00012776321,0.0030679556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992348,0.00031839428,0.000034242985,0.00024632856,0.00008685641,0.00007945212],"domain_scores_gemma":[0.99818486,0.00094573625,0.00031426968,0.00021095747,0.00024743742,0.00009677386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001970524,0.0012629817,0.0007529728,0.0006483844,0.00028981332,0.00059342047,0.0010515131,0.0008974005,0.0008502132],"category_scores_gemma":[0.006130135,0.00048778436,0.0011945633,0.0008048161,0.00072958355,0.0011137092,0.0007277067,0.0018140363,0.00035563335],"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.00027604125,0.00014690266,0.009491326,0.00011008997,0.00015883328,0.00033202788,0.00029813862,0.8189929,0.004013082,0.01312678,0.0066661728,0.14638764],"study_design_scores_gemma":[0.0000069210805,0.000015097292,0.00045204323,0.0000054677207,0.000008549867,0.000027192546,0.000009013518,0.9924914,0.00017031297,0.0065312143,0.00027630792,0.000006332174],"about_ca_topic_score_codex":0.012894251,"about_ca_topic_score_gemma":0.01679674,"teacher_disagreement_score":0.012894251,"about_ca_system_score_codex":0.00094647985,"about_ca_system_score_gemma":0.0012168938,"threshold_uncertainty_score":0.025638402},"labels":[],"label_agreement":null},{"id":"W2904140126","doi":"10.1609/aaai.v33i01.3301978","title":"Crash to Not Crash: Learn to Identify Dangerous Vehicles Using a Simulator","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Autonomous Vehicle Technology and Safety","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"National Research Foundation of Korea; Ministry of Science, ICT and Future Planning; National Research Foundation","keywords":"Computer science; Crash; Classifier (UML); Driving simulator; Collision; Generator (circuit theory); Artificial intelligence; Simulation; Machine learning; Computer security","score_opus":0.0607103320586291,"score_gpt":0.30693622427405637,"score_spread":0.24622589221542726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904140126","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.62174004,0.0002558021,0.37046522,0.00072662777,0.00011272824,0.0002369583,0.0005092866,0.003904145,0.0020492016],"genre_scores_gemma":[0.93435633,0.00006043759,0.06273661,0.00020807813,0.000019561387,0.00010652157,0.0011487145,0.00007892642,0.0012847753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968743,0.000075908436,0.000015971491,0.00011798441,0.00004833342,0.000054321685],"domain_scores_gemma":[0.9983537,0.0008280127,0.00015257782,0.00018737956,0.00030384233,0.0001745597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009035945,0.00087913615,0.00049618253,0.0005788438,0.00028269336,0.00046017207,0.0015114595,0.00096001255,0.00091196917],"category_scores_gemma":[0.0036893687,0.00037997708,0.00046206565,0.00018694023,0.0004711324,0.0010203408,0.00082973985,0.0011494331,0.000634715],"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.0008298658,0.0009275046,0.07245529,0.000113760216,0.000189054,0.0003061562,0.00033496114,0.55886585,0.016345944,0.002266148,0.0077429796,0.33962247],"study_design_scores_gemma":[0.000012517744,0.000091931666,0.0008708918,0.0000040750315,0.0000058424703,0.000025450905,0.000026185284,0.99572253,0.0021047655,0.00090856163,0.00022130791,0.0000058450005],"about_ca_topic_score_codex":0.006343032,"about_ca_topic_score_gemma":0.0064813844,"teacher_disagreement_score":0.006343032,"about_ca_system_score_codex":0.0005227729,"about_ca_system_score_gemma":0.0011087117,"threshold_uncertainty_score":0.012612224},"labels":[],"label_agreement":null},{"id":"W2904154908","doi":"10.1609/aaai.v33i01.33012379","title":"Enriching Non-Parametric Bidirectional Search Algorithms","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation; National Science Foundation","keywords":"Parametric statistics; Computer science; Node (physics); Algorithm; Mathematical optimization; Mathematics; Engineering","score_opus":0.06019225234362175,"score_gpt":0.29256652348478174,"score_spread":0.23237427114116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904154908","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.011413263,0.00027028745,0.98184764,0.00017350788,0.000036273694,0.00007972199,0.000101436126,0.00075184606,0.0053260135],"genre_scores_gemma":[0.27574527,0.00045374886,0.71640545,0.00022539351,0.0000664259,0.00036762262,0.0005633508,0.00050285447,0.005669841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957331,0.0017384938,0.00022986569,0.00054500945,0.0013664679,0.00038700714],"domain_scores_gemma":[0.9899894,0.006060268,0.00054089964,0.002111109,0.0010115672,0.0002868251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042421813,0.0012686265,0.0014794884,0.0014683378,0.0007368536,0.001888948,0.0037176374,0.0017823313,0.006400609],"category_scores_gemma":[0.022138443,0.0008521687,0.0011608558,0.0017594026,0.0020459674,0.004971398,0.006056543,0.0028482908,0.0017225344],"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.0003821351,0.00021062797,0.0013065698,0.00038077708,0.000064396925,0.0001091058,0.00027159942,0.41719785,0.0056473864,0.28489968,0.0038997594,0.28563005],"study_design_scores_gemma":[0.000045624693,0.00008788337,0.00011377498,0.000048231206,0.000016326298,0.000060632374,0.00004273599,0.8678416,0.002330796,0.12309391,0.0063003222,0.000018140601],"about_ca_topic_score_codex":0.0031131536,"about_ca_topic_score_gemma":0.0046265135,"teacher_disagreement_score":0.006400609,"about_ca_system_score_codex":0.001191764,"about_ca_system_score_gemma":0.002589968,"threshold_uncertainty_score":0.02243507},"labels":[],"label_agreement":null},{"id":"W2904232271","doi":"10.1609/aaai.v33i01.33016112","title":"Leveraging Observations in Bandits: Between Risks and Benefits","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","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":"McGill University","funders":"","keywords":"Regret; Multi-armed bandit; Leverage (statistics); Computer science; Optimism; Context (archaeology); Thompson sampling; Order (exchange); Task (project management); Artificial intelligence; Machine learning; Dependency (UML); Economics; Psychology","score_opus":0.534976651882224,"score_gpt":0.4463792313613104,"score_spread":0.08859742052091357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904232271","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.12502432,0.0010209879,0.86860657,0.0015073654,0.000045747773,0.00008811346,0.000050303595,0.00050524395,0.003151346],"genre_scores_gemma":[0.9427553,0.00039839523,0.055065952,0.00023712931,0.000060879058,0.00013442563,0.00003592786,0.00007910468,0.0012329064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99424356,0.0033743882,0.0002542742,0.0007499805,0.000978374,0.00039938162],"domain_scores_gemma":[0.9244561,0.06376859,0.0048958897,0.005063485,0.0010247291,0.00079128053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0123988865,0.002015115,0.0019938215,0.00071863836,0.0009622455,0.002383128,0.0020500936,0.0027935887,0.0014435655],"category_scores_gemma":[0.07663623,0.0011353819,0.0008565105,0.0005897645,0.004392011,0.0055657616,0.004619733,0.0050078123,0.00034852186],"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.0005430088,0.00014479177,0.0040040123,0.00013331238,0.00012389019,0.00017711383,0.0002506721,0.87307596,0.0019804407,0.08216585,0.000460153,0.03694078],"study_design_scores_gemma":[0.000040113562,0.00015126824,0.00051037694,0.000037999445,0.000026706923,0.000055098582,0.000024821878,0.937046,0.0010612415,0.06074887,0.00027494464,0.000022618562],"about_ca_topic_score_codex":0.0017360937,"about_ca_topic_score_gemma":0.0013634105,"teacher_disagreement_score":0.0123988865,"about_ca_system_score_codex":0.0014685881,"about_ca_system_score_gemma":0.0013504049,"threshold_uncertainty_score":0.06557232},"labels":[],"label_agreement":null},{"id":"W2904232841","doi":"10.1609/aaai.v33i01.33017554","title":"Efficient Temporal Planning Using Metastates","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"State (computer science); Plan (archaeology); Computer science; Range (aeronautics); State space; Space (punctuation); Artificial intelligence; Mathematics; Algorithm; Geography; Statistics; Engineering","score_opus":0.0919222900024954,"score_gpt":0.3055255624659554,"score_spread":0.21360327246346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904232841","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.05016194,0.0004923785,0.9287411,0.0005061714,0.000051485484,0.00013622566,0.00041587785,0.010242783,0.009252027],"genre_scores_gemma":[0.55625015,0.0002669649,0.43882784,0.00018404395,0.000020314721,0.00020248408,0.0007586013,0.00058804883,0.0029015904],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992895,0.00024189641,0.000049607916,0.00014230178,0.00019470188,0.00008208899],"domain_scores_gemma":[0.99821424,0.0011941892,0.000113203765,0.0002962384,0.00011555018,0.0000666076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011049286,0.00058447715,0.0005236374,0.0006407138,0.00070528255,0.0010999867,0.001106894,0.00067206135,0.005649538],"category_scores_gemma":[0.0045414786,0.0004197455,0.0007745927,0.0007277407,0.0009185598,0.00243916,0.0024514871,0.0012502166,0.00077893434],"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.0007702504,0.0002461237,0.0026396366,0.00055788027,0.00013248081,0.00039625523,0.00087077694,0.42302224,0.021129766,0.09142938,0.009480374,0.44932494],"study_design_scores_gemma":[0.000055639328,0.00009759764,0.00030075124,0.00003137982,0.000030722676,0.00009444858,0.00010755776,0.9322707,0.010019818,0.05114746,0.005824444,0.000019535284],"about_ca_topic_score_codex":0.0054794303,"about_ca_topic_score_gemma":0.011728157,"teacher_disagreement_score":0.005649538,"about_ca_system_score_codex":0.0009533505,"about_ca_system_score_gemma":0.0016777297,"threshold_uncertainty_score":0.01889956},"labels":[],"label_agreement":null},{"id":"W2904464104","doi":"10.1609/aaai.v33i01.33013248","title":"Deep Convolutional Sum-Product Networks","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Convolutional neural network; Pooling; Computer science; Inference; Artificial intelligence; Robustness (evolution); Pattern recognition (psychology); Probabilistic logic; Differentiable function; Benchmark (surveying); Algorithm; Mathematics","score_opus":0.03965008146062683,"score_gpt":0.2524805903209098,"score_spread":0.21283050886028299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904464104","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.0179331,0.0008670314,0.9687636,0.0005299066,0.00010450245,0.00005362872,0.0006593612,0.0006561896,0.010432694],"genre_scores_gemma":[0.7092113,0.0022502944,0.2674407,0.00082997663,0.00017333627,0.00030406352,0.0028329503,0.0005277298,0.016429681],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884003,0.00022611248,0.00008851964,0.0002677287,0.00040229643,0.00017531388],"domain_scores_gemma":[0.997811,0.0009458293,0.00026063196,0.0003891717,0.0004592342,0.00013409762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001722956,0.0012639047,0.0007342485,0.0007062249,0.0004891992,0.0016299922,0.0016341747,0.0013216604,0.0050885375],"category_scores_gemma":[0.007137502,0.00056933565,0.0010188358,0.0008026896,0.0015259811,0.0033429705,0.002739067,0.0026606761,0.001108399],"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.00014149738,0.000061467326,0.0015186702,0.00021909618,0.00007916238,0.0003116223,0.00013439622,0.4604266,0.007208701,0.4343841,0.008067143,0.08744749],"study_design_scores_gemma":[0.0000060748375,0.00002817457,0.00019013256,0.000022397056,0.0000127793,0.000089268404,0.000012117466,0.85639596,0.0030569518,0.13685885,0.0033154208,0.000011812926],"about_ca_topic_score_codex":0.004074396,"about_ca_topic_score_gemma":0.0068906983,"teacher_disagreement_score":0.0050885375,"about_ca_system_score_codex":0.0019517618,"about_ca_system_score_gemma":0.0015280837,"threshold_uncertainty_score":0.017022848},"labels":[],"label_agreement":null},{"id":"W2904474531","doi":"10.1609/aaai.v33i01.33013143","title":"An Exponential Tail Bound for the Deleted Estimate","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Generalization; Stability (learning theory); Mathematics; Exponential function; Applied mathematics; Upper and lower bounds; Computation; Distribution (mathematics); Exponential family; Computer science; Mathematical analysis; Algorithm; Machine learning","score_opus":0.04738441104690382,"score_gpt":0.31718142633747964,"score_spread":0.2697970152905758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904474531","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.019353272,0.0019427794,0.96727896,0.0028199325,0.00018127242,0.0001004647,0.0002997486,0.00043758354,0.007585904],"genre_scores_gemma":[0.6822454,0.0057673166,0.27978697,0.0048190374,0.0014645355,0.0010076725,0.0017362844,0.0015204393,0.021652384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9919264,0.00241099,0.00042359997,0.0020284485,0.0025070496,0.0007036155],"domain_scores_gemma":[0.87985766,0.09349077,0.0046397303,0.009832402,0.010360337,0.0018191047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01421363,0.0024651296,0.0021956135,0.0025108256,0.0014270438,0.0040943995,0.0060555097,0.00335429,0.008484288],"category_scores_gemma":[0.13390017,0.0010743487,0.0023523073,0.00149397,0.006005062,0.014530634,0.007740474,0.012632702,0.00258154],"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.0008311254,0.00023208286,0.007333373,0.00077282713,0.0002830989,0.00085241307,0.0010782736,0.22639109,0.012349876,0.66523373,0.010238965,0.07440312],"study_design_scores_gemma":[0.000042494183,0.00018823575,0.0012683087,0.00022498178,0.000092810245,0.00040391635,0.00010142052,0.6560398,0.0062555163,0.33027002,0.005037188,0.00007542938],"about_ca_topic_score_codex":0.0018462595,"about_ca_topic_score_gemma":0.0015035106,"teacher_disagreement_score":0.01421363,"about_ca_system_score_codex":0.0048665763,"about_ca_system_score_gemma":0.002365137,"threshold_uncertainty_score":0.0751698},"labels":[],"label_agreement":null},{"id":"W2904524947","doi":"10.1609/aaai.v33i01.33012995","title":"On Limited Conjunctions and Partial Features in Parameter-Tractable Feature Logics","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Consistency (knowledge bases); Feature (linguistics); Computer science; Knowledge base; Description logic; Base (topology); Theoretical computer science; Partial function; Artificial intelligence; Automated reasoning; Algorithm; Mathematics; Discrete mathematics","score_opus":0.05070974456493918,"score_gpt":0.2798243286108011,"score_spread":0.2291145840458619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904524947","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.036376365,0.0002923242,0.95150113,0.0016333209,0.0000462345,0.00017973746,0.0005870741,0.00094760844,0.008436113],"genre_scores_gemma":[0.54199713,0.000596732,0.4484513,0.0007532063,0.00017998311,0.0004264934,0.001462076,0.0005633271,0.005569729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99250495,0.0027883162,0.0005805199,0.0015080058,0.0017419624,0.0008761573],"domain_scores_gemma":[0.9718988,0.022548584,0.0009978842,0.0030585094,0.0010252488,0.00047104986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00755368,0.0012017796,0.0017455675,0.0017617346,0.0023868028,0.0058483994,0.004561738,0.0026016987,0.008485596],"category_scores_gemma":[0.03277293,0.0015398726,0.0040328302,0.0030031535,0.0072938716,0.023685595,0.006666348,0.0066305017,0.0008102673],"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.0002473728,0.00013638313,0.00083291024,0.00017081498,0.000074473246,0.00045050003,0.0006421621,0.07741153,0.0013204525,0.8948509,0.001978774,0.021883795],"study_design_scores_gemma":[0.000050838,0.000025070885,0.000112781934,0.000029065268,0.00003893192,0.00008389774,0.000102684615,0.11581854,0.0010074514,0.88109857,0.0016063793,0.000025748557],"about_ca_topic_score_codex":0.01035495,"about_ca_topic_score_gemma":0.011546747,"teacher_disagreement_score":0.01035495,"about_ca_system_score_codex":0.004808719,"about_ca_system_score_gemma":0.0025386408,"threshold_uncertainty_score":0.039948165},"labels":[],"label_agreement":null},{"id":"W2904526711","doi":"10.1609/aaai.v33i01.33011158","title":"Improving Search with Supervised Learning in Trick-Based Card Games","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":13,"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; Sampling (signal processing); Artificial intelligence; Machine learning; Focus (optics); Monte Carlo tree search; Sample (material); Sampling bias; Process (computing); Monte Carlo method; Sample size determination; Statistics; Mathematics","score_opus":0.05390015759600682,"score_gpt":0.281418344109766,"score_spread":0.2275181865137592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904526711","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.37044358,0.0012691678,0.6178836,0.0007618293,0.00010154623,0.0002005734,0.00022056869,0.0035196408,0.0055995234],"genre_scores_gemma":[0.9311836,0.000102622005,0.06679631,0.00023073552,0.000040459814,0.000075765056,0.00026955016,0.000101028214,0.0011999612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867153,0.00063904026,0.00008169034,0.0002669017,0.00021382743,0.0001270284],"domain_scores_gemma":[0.9928981,0.0049968134,0.00043250737,0.0008400262,0.0005425256,0.0002899312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027374378,0.0010198263,0.0017717023,0.000825551,0.00059784146,0.001189114,0.002325832,0.0017717658,0.0017439905],"category_scores_gemma":[0.014462729,0.00058231474,0.00057149027,0.00056212314,0.0013804651,0.0032234585,0.0018701053,0.0019338928,0.0005016895],"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.0006063032,0.00063543,0.0073474934,0.00016682898,0.000107615546,0.00009853335,0.00017537197,0.8096103,0.002141433,0.010525571,0.002820676,0.16576448],"study_design_scores_gemma":[0.000019489113,0.000042277534,0.00018438141,0.000004865471,0.000004088317,0.000007722247,0.000007734149,0.9961565,0.00029094314,0.0031954693,0.000083162544,0.0000033123956],"about_ca_topic_score_codex":0.005961385,"about_ca_topic_score_gemma":0.008217532,"teacher_disagreement_score":0.005961385,"about_ca_system_score_codex":0.0012785462,"about_ca_system_score_gemma":0.0013625356,"threshold_uncertainty_score":0.014477074},"labels":[],"label_agreement":null},{"id":"W2904535507","doi":"10.1609/aaai.v33i01.33013280","title":"Towards Non-Saturating Recurrent Units for Modelling Long-Term Dependencies","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Neural Network Applications","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":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Term (time); Recurrent neural network; Computer science; Sequence (biology); Mechanism (biology); Artificial intelligence; Identification (biology); Artificial neural network; Algorithm; Chemistry; Physics","score_opus":0.12234183720027215,"score_gpt":0.3209075503423701,"score_spread":0.19856571314209798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904535507","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.041664943,0.00079649244,0.95284283,0.00045393984,0.000080666745,0.000043143307,0.0001506293,0.0022477,0.0017196954],"genre_scores_gemma":[0.6892727,0.00096002745,0.3023312,0.0004690009,0.00009167012,0.0001630389,0.00051030697,0.0005536567,0.0056483513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994505,0.00022037419,0.000034420056,0.00015453975,0.00008144108,0.000058700996],"domain_scores_gemma":[0.9986003,0.00074869907,0.0001463186,0.00021845697,0.00022345141,0.000062857245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018310552,0.0015185825,0.0008937586,0.0004471626,0.00027840392,0.0011194322,0.0020494908,0.0012199763,0.0023464297],"category_scores_gemma":[0.0049166726,0.0007411145,0.0008559378,0.00050588505,0.0005931914,0.0033482302,0.0010928353,0.0027197772,0.0013518409],"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.00032270481,0.00015074987,0.0017647772,0.00033630186,0.0003156624,0.0002485815,0.00027445762,0.7278091,0.040494822,0.021141702,0.004498337,0.20264289],"study_design_scores_gemma":[0.000005263737,0.000032453896,0.00008810114,0.000007644026,0.00001411543,0.000021008877,0.000007681618,0.99326843,0.002244477,0.003941991,0.00036228806,0.0000066096645],"about_ca_topic_score_codex":0.004984291,"about_ca_topic_score_gemma":0.009463199,"teacher_disagreement_score":0.004984291,"about_ca_system_score_codex":0.00074692105,"about_ca_system_score_gemma":0.001077675,"threshold_uncertainty_score":0.0099105835},"labels":[],"label_agreement":null},{"id":"W2904661726","doi":"10.1609/aaai.v33i01.33013108","title":"Recursively Learning Causal Structures Using Regression-Based Conditional Independence Test","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","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":"University of Calgary","funders":"National Natural Science Foundation of China","keywords":"Conditional independence; Causality (physics); Causal inference; Independence (probability theory); Mathematics; Inference; Algorithm; Computer science; Artificial intelligence; Statistics","score_opus":0.0679810427885299,"score_gpt":0.30566669982047323,"score_spread":0.23768565703194333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904661726","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.0129809305,0.00012520062,0.9850071,0.00015959448,0.000013838482,0.00007229249,0.00016571114,0.00079991575,0.0006754804],"genre_scores_gemma":[0.41043583,0.0003110314,0.5842066,0.0003643721,0.000111928006,0.0003574578,0.0023857818,0.00029103577,0.001536057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950382,0.0018115477,0.00033762623,0.0012980213,0.0011390768,0.00037554812],"domain_scores_gemma":[0.97180104,0.022523707,0.0015732263,0.0016895437,0.0019330689,0.0004795114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055396077,0.0015022083,0.0021644065,0.0041272934,0.00087966654,0.0014267158,0.002905993,0.0013042438,0.004037888],"category_scores_gemma":[0.031484205,0.0008244291,0.0026177568,0.0025543764,0.00132496,0.0038586832,0.002246299,0.0042297672,0.000798615],"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.00068389456,0.0005025827,0.018086595,0.0003177987,0.00052082585,0.00043887118,0.00028270565,0.45355865,0.0069988,0.0714321,0.005298972,0.44187814],"study_design_scores_gemma":[0.00004081882,0.000033198765,0.00071019836,0.000015074891,0.000035881192,0.000040579074,0.000013538611,0.9706707,0.0013485786,0.026569363,0.00050466135,0.000017422592],"about_ca_topic_score_codex":0.011514107,"about_ca_topic_score_gemma":0.0117997965,"teacher_disagreement_score":0.011514107,"about_ca_system_score_codex":0.0013328095,"about_ca_system_score_gemma":0.0038907253,"threshold_uncertainty_score":0.029296637},"labels":[],"label_agreement":null},{"id":"W2904760604","doi":"10.1609/aaai.v33i01.33016188","title":"Enriching Word Embeddings with a Regressor Instead of Labeled Corpora","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Vetenskapsrådet","keywords":"Computer science; Natural language processing; Artificial intelligence; Word (group theory); Lexicon; Task (project management); Embedding; Sentence; SemEval; Word embedding; Analogy; Binary classification; Linguistics; Support vector machine","score_opus":0.05268464246031737,"score_gpt":0.27048664703602743,"score_spread":0.21780200457571006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904760604","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.02897238,0.00038552127,0.9553441,0.00042474284,0.00017120737,0.00013627586,0.0017453479,0.009922393,0.0028981154],"genre_scores_gemma":[0.20797457,0.0005746546,0.7695757,0.00038282276,0.00016244533,0.00055043556,0.011510326,0.0015272405,0.007741793],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981438,0.00073891843,0.00013863113,0.0005662267,0.0003244473,0.00008800097],"domain_scores_gemma":[0.99451435,0.001860121,0.00049700576,0.0018737887,0.0011190397,0.00013574677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023195194,0.0021184848,0.0010455163,0.0023644362,0.00060435414,0.001643724,0.0013741087,0.0010292256,0.0039025669],"category_scores_gemma":[0.013444678,0.0007583957,0.0007617848,0.0024628278,0.0007702289,0.0077308803,0.0028812536,0.002251119,0.006540991],"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.00034512184,0.00070792023,0.010921096,0.0006991458,0.00022359299,0.00025131518,0.0006889406,0.034517735,0.062244665,0.016469534,0.024316017,0.84861493],"study_design_scores_gemma":[0.00007628378,0.0004660993,0.0043343864,0.00019953032,0.00018457515,0.0004953316,0.00062427035,0.7724243,0.08025922,0.06029651,0.08046087,0.00017851495],"about_ca_topic_score_codex":0.0018293122,"about_ca_topic_score_gemma":0.0060157212,"teacher_disagreement_score":0.0039025669,"about_ca_system_score_codex":0.0004905641,"about_ca_system_score_gemma":0.0012940346,"threshold_uncertainty_score":0.013055325},"labels":[],"label_agreement":null},{"id":"W2904784373","doi":"10.1609/aaai.v33i01.33017530","title":"Deep Reactive Policies for Planning in Stochastic Nonlinear Domains","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","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":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Computer science; Reinforcement learning; Markov decision process; Mathematical optimization; Stochastic optimization; Artificial intelligence; Probabilistic logic; Stochastic control; Benchmark (surveying); Inference; Optimal control; Mathematics; Markov process","score_opus":0.04538887102499332,"score_gpt":0.31662759264975515,"score_spread":0.2712387216247618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904784373","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.0069731325,0.000245046,0.989495,0.00024707813,0.000032540516,0.00003320701,0.00010929701,0.0011922645,0.001672422],"genre_scores_gemma":[0.53784853,0.0006367612,0.4564843,0.00024699888,0.000054184144,0.0003374499,0.00058800966,0.00040467054,0.0033991593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958223,0.00011524259,0.000030459576,0.00009093932,0.00012605882,0.00005501286],"domain_scores_gemma":[0.99879634,0.00074992777,0.00011072949,0.00012651134,0.00015286688,0.00006354065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009233368,0.0010936892,0.000875295,0.00052449835,0.0004804293,0.0009793241,0.0013271304,0.0009800531,0.003382658],"category_scores_gemma":[0.0031736027,0.00068423135,0.00065684406,0.0005514401,0.0011726957,0.0013309423,0.0012586447,0.0023628306,0.0005330571],"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.000025584339,0.000012766351,0.00012634914,0.000043240965,0.00000884306,0.000017604614,0.00001987735,0.9709523,0.00049880217,0.012218557,0.00057395623,0.015502253],"study_design_scores_gemma":[0.0000033924864,0.000003878241,0.000013355487,0.0000034644684,0.00000115757,0.000002202085,0.000002516304,0.9932376,0.00022647635,0.0062171044,0.0002872819,0.000001455431],"about_ca_topic_score_codex":0.016135672,"about_ca_topic_score_gemma":0.017346518,"teacher_disagreement_score":0.016135672,"about_ca_system_score_codex":0.0019427404,"about_ca_system_score_gemma":0.0027784917,"threshold_uncertainty_score":0.03208351},"labels":[],"label_agreement":null},{"id":"W2904805225","doi":"10.1609/aaai.v33i01.33012288","title":"On the Optimal Efficiency of Cost-Algebraic A*","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Algebraic number; Heuristic; Mathematics; Cost efficiency; Mathematical optimization; Computer science; Algebra over a field; Mathematical economics; Pure mathematics","score_opus":0.08247716301350781,"score_gpt":0.25680929752451825,"score_spread":0.17433213451101043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904805225","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.4193212,0.0006961157,0.5452149,0.0017793551,0.000053173277,0.00023551741,0.00034108566,0.00031731467,0.03204129],"genre_scores_gemma":[0.9081095,0.0002446383,0.0893171,0.00017311491,0.000029929337,0.00013441942,0.00016887038,0.00008881243,0.0017337587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995216,0.0022436234,0.00039499212,0.00075591507,0.0008136643,0.0005758558],"domain_scores_gemma":[0.967602,0.023159092,0.002294535,0.0043144524,0.0018096544,0.0008203042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068584885,0.0007234894,0.0013133648,0.0012890311,0.0010760454,0.0028655312,0.0019762602,0.0014466627,0.0049686297],"category_scores_gemma":[0.043107633,0.00063432736,0.0008382913,0.0013790722,0.0034762693,0.005768281,0.0031317049,0.0020167092,0.00049179286],"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.00027323427,0.00015019596,0.0023755864,0.00018928153,0.000099816876,0.000068800146,0.00032415823,0.17597122,0.0023961922,0.77966,0.0010618452,0.03742975],"study_design_scores_gemma":[0.0000631974,0.00015793528,0.00054432935,0.000040427018,0.00004047717,0.00011178407,0.00013988769,0.40314987,0.0021411031,0.59165174,0.0019313451,0.000027914612],"about_ca_topic_score_codex":0.0012046604,"about_ca_topic_score_gemma":0.0010839619,"teacher_disagreement_score":0.0068584885,"about_ca_system_score_codex":0.0019120952,"about_ca_system_score_gemma":0.0018281708,"threshold_uncertainty_score":0.036271572},"labels":[],"label_agreement":null},{"id":"W2904811519","doi":"10.1609/aaai.v33i01.33017610","title":"Generalized Planning via Abstraction: Arbitrary Numbers of Objects","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Microsoft Research","keywords":"Nondeterministic algorithm; Abstraction; Class (philosophy); Computer science; Set (abstract data type); Task (project management); Action (physics); Observable; Theoretical computer science; Mathematical optimization; Artificial intelligence; Mathematics; Programming language","score_opus":0.05131861020903025,"score_gpt":0.28261574386964894,"score_spread":0.2312971336606187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904811519","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.014862143,0.000150987,0.9798171,0.00029852576,0.000034134762,0.00012111269,0.00009233814,0.00054885197,0.004074762],"genre_scores_gemma":[0.2364692,0.00026902964,0.7585842,0.00014188931,0.000036222562,0.00038244115,0.00028065324,0.00017878953,0.0036575454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723583,0.0009596667,0.00021896804,0.00064091943,0.00064851553,0.0002961889],"domain_scores_gemma":[0.9969976,0.0014000053,0.0002633207,0.0009615107,0.00019383838,0.00018366467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025120405,0.0011808415,0.0011509724,0.0008544156,0.0015767217,0.0026896326,0.0027889076,0.0011470169,0.0043943347],"category_scores_gemma":[0.0071705584,0.00083522435,0.0023414956,0.0015417616,0.004289768,0.008593607,0.006192972,0.0030646448,0.0005018708],"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.00013541944,0.000060853894,0.00052146666,0.00028801613,0.00007497559,0.0003876523,0.0007314278,0.14607593,0.003819351,0.78013545,0.0015282927,0.066241264],"study_design_scores_gemma":[0.00003619209,0.000049281974,0.0001479457,0.000037925733,0.00003907525,0.00009426827,0.000109924316,0.20397808,0.0021271,0.78462267,0.008728944,0.000028624647],"about_ca_topic_score_codex":0.004236034,"about_ca_topic_score_gemma":0.0051711714,"teacher_disagreement_score":0.0043943347,"about_ca_system_score_codex":0.0016463952,"about_ca_system_score_gemma":0.0019739612,"threshold_uncertainty_score":0.014700472},"labels":[],"label_agreement":null},{"id":"W2904940351","doi":"10.1609/aaai.v33i01.33013526","title":"Improved Knowledge Graph Embedding Using Background Taxonomic Information","year":2019,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","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":"Embedding; Knowledge graph; Computer science; Theoretical computer science; Graph; Mathematics; Artificial intelligence","score_opus":0.13480551769492677,"score_gpt":0.32662901701316743,"score_spread":0.19182349931824066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904940351","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.031466894,0.00031507429,0.96222365,0.00051418936,0.00004168981,0.00007230395,0.00089088693,0.0023884734,0.0020868797],"genre_scores_gemma":[0.3969902,0.00061885593,0.5858138,0.0002761034,0.000103682156,0.00016095924,0.0071004573,0.00071956095,0.008216351],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987079,0.00035216755,0.00007785201,0.0004485621,0.00031878435,0.000094692004],"domain_scores_gemma":[0.99486876,0.0020363126,0.00032903932,0.0021364796,0.00046063584,0.00016886381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012298257,0.0010075892,0.0010210735,0.0017358069,0.0005942046,0.0019793767,0.001653702,0.0013577932,0.0039986027],"category_scores_gemma":[0.008706959,0.00058675423,0.0015086908,0.0022183687,0.00084136904,0.008258321,0.0030657477,0.002488,0.001408617],"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.00030959735,0.00050412543,0.0026045016,0.00058662007,0.00019733375,0.00045620298,0.00089537253,0.28558362,0.015476768,0.12686518,0.020782946,0.5457378],"study_design_scores_gemma":[0.000016026623,0.00003078648,0.0002583795,0.00002670331,0.000037777845,0.00009915344,0.00008832752,0.9094244,0.0024222168,0.083538845,0.004041754,0.00001559341],"about_ca_topic_score_codex":0.0042843614,"about_ca_topic_score_gemma":0.006619258,"teacher_disagreement_score":0.0042843614,"about_ca_system_score_codex":0.00087700685,"about_ca_system_score_gemma":0.0011232108,"threshold_uncertainty_score":0.013376653},"labels":[],"label_agreement":null},{"id":"W2904945528","doi":"10.1609/aaai.v33i01.33014570","title":"Cost-Sensitive Learning to Rank","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Rank (graph theory); Learning to rank; Ranking (information retrieval); Computer science; Machine learning; Artificial intelligence; Risk analysis (engineering); Business; Mathematics","score_opus":0.31424019844457085,"score_gpt":0.43772003951743144,"score_spread":0.12347984107286059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904945528","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.013242366,0.00076459115,0.98076594,0.001297995,0.00014082651,0.00017700835,0.00037879418,0.00035004714,0.0028822997],"genre_scores_gemma":[0.7428138,0.0011777042,0.2449093,0.0011442875,0.000669557,0.0005697884,0.0013051671,0.00015603422,0.007254279],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9917088,0.0045176153,0.0003504898,0.0011317284,0.001620208,0.00067114364],"domain_scores_gemma":[0.97517043,0.01749791,0.0018712594,0.0019743245,0.0027929693,0.0006930322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008877902,0.0022346228,0.003244503,0.0019108178,0.00076502754,0.0032140452,0.0029677856,0.00244721,0.0054016816],"category_scores_gemma":[0.029365243,0.00054224546,0.00093247916,0.002895565,0.0018177293,0.0032868953,0.0017354725,0.0031907642,0.0012350954],"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.00017946631,0.00030753762,0.0015609242,0.00028290992,0.0001525697,0.000100043435,0.000060644183,0.8214194,0.00074408925,0.046059873,0.012355997,0.11677653],"study_design_scores_gemma":[0.000023547118,0.00009672048,0.00016635857,0.000014163272,0.000016580396,0.000027318652,0.00000987396,0.96354455,0.00031267197,0.035105754,0.00066832924,0.000014153469],"about_ca_topic_score_codex":0.00418748,"about_ca_topic_score_gemma":0.004547525,"teacher_disagreement_score":0.008877902,"about_ca_system_score_codex":0.0020844054,"about_ca_system_score_gemma":0.0028304388,"threshold_uncertainty_score":0.046951413},"labels":[],"label_agreement":null},{"id":"W2904990262","doi":"10.1609/aaai.v33i01.33014699","title":"Adversarial Dropout for Recurrent Neural Networks","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","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":"Kootenay Association for Science & Technology","funders":"National Research Foundation of Korea; National Research Foundation","keywords":"Dropout (neural networks); Recurrent neural network; Computer science; MNIST database; Adversarial system; Generalization; Inference; Artificial intelligence; Machine learning; Artificial neural network; Mathematics","score_opus":0.04608459895551688,"score_gpt":0.2972818511481127,"score_spread":0.2511972521925958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904990262","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.011150923,0.00031311242,0.98650265,0.00035761666,0.00003400896,0.000027275362,0.00006877262,0.0004072077,0.0011384576],"genre_scores_gemma":[0.83532435,0.00070371176,0.15473375,0.00038918378,0.00013072682,0.0002925317,0.0004997886,0.00024376936,0.007682154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987739,0.00048539293,0.00006586235,0.00025324692,0.0003013439,0.000120251265],"domain_scores_gemma":[0.9947916,0.0038645747,0.0004038669,0.00043431646,0.00037916165,0.0001265233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035290483,0.0012397357,0.001134825,0.0005984865,0.0005029148,0.0008381587,0.0015285894,0.0012437814,0.0014318703],"category_scores_gemma":[0.012791566,0.0005611695,0.0007768273,0.0004995762,0.001685598,0.0016356924,0.0018030179,0.0026185936,0.00042491156],"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.0000869179,0.000024280684,0.0004305726,0.000050053706,0.000035187135,0.00007314092,0.000044868877,0.95005375,0.0016073412,0.031098265,0.0010522972,0.015443277],"study_design_scores_gemma":[0.0000023338243,0.000008154404,0.00003459528,0.0000027501005,0.0000022421427,0.0000048680613,0.0000014357748,0.9921272,0.00031142373,0.0073514897,0.00015125232,0.0000023286086],"about_ca_topic_score_codex":0.003946432,"about_ca_topic_score_gemma":0.0036176115,"teacher_disagreement_score":0.003946432,"about_ca_system_score_codex":0.0019690401,"about_ca_system_score_gemma":0.0010212867,"threshold_uncertainty_score":0.018663585},"labels":[],"label_agreement":null},{"id":"W2905137389","doi":"10.1609/aaai.v33i01.33017476","title":"Generating Character Descriptions for Automatic Summarization of Fiction","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Automatic summarization; Character (mathematics); Computer science; Ranking (information retrieval); Information retrieval; Sample (material); Quality (philosophy); Natural language processing; Artificial intelligence; Mathematics","score_opus":0.0536322909089638,"score_gpt":0.29526777414468663,"score_spread":0.24163548323572284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905137389","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.36517203,0.0060622473,0.43075353,0.0020882823,0.0005520252,0.0029169235,0.13501027,0.042948812,0.014495828],"genre_scores_gemma":[0.32332453,0.0010544917,0.45040014,0.00015691253,0.00023705505,0.0009786256,0.21902388,0.0005636977,0.0042606685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869126,0.0004252737,0.00015653555,0.00032695517,0.00030243341,0.000097532844],"domain_scores_gemma":[0.9917105,0.0040690512,0.0011689644,0.0007932631,0.0019352153,0.00032307723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011545983,0.0013335472,0.00062492065,0.007427599,0.0006229111,0.0013706974,0.0010585205,0.001006718,0.0043504094],"category_scores_gemma":[0.012551337,0.0003660568,0.0006518243,0.0033646468,0.00031160947,0.002730663,0.0009739005,0.0009220598,0.003609906],"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.00089065754,0.0004863247,0.02638099,0.0038094823,0.0002159846,0.0009159098,0.0026567625,0.013509382,0.036813263,0.0058909617,0.10351371,0.80491656],"study_design_scores_gemma":[0.0003118874,0.0012058945,0.057219956,0.000771889,0.000447416,0.0022842842,0.0057057566,0.56327313,0.09819743,0.017119767,0.25320104,0.0002616588],"about_ca_topic_score_codex":0.002397204,"about_ca_topic_score_gemma":0.0043581137,"teacher_disagreement_score":0.007427599,"about_ca_system_score_codex":0.00091258285,"about_ca_system_score_gemma":0.00082714896,"threshold_uncertainty_score":0.0145536065},"labels":[],"label_agreement":null},{"id":"W2905159666","doi":"10.1609/aaai.v33i01.33011804","title":"Primarily about Primaries","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Voting; Converse; Cardinal voting systems; Bullet voting; Quality (philosophy); Ranked voting system; Computer science; Politics; Approval voting; Disapproval voting; General election; Political science; Law; Mathematics","score_opus":0.07054627635837617,"score_gpt":0.25168067762827667,"score_spread":0.1811344012699005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905159666","genre_codex":"other","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.08333432,0.00905452,0.16399354,0.033517435,0.004183096,0.00018451175,0.0016937306,0.00079970126,0.7032391],"genre_scores_gemma":[0.810507,0.0040659113,0.028890284,0.009715949,0.0030344888,0.00016378216,0.0012714615,0.0006063132,0.14174491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99568534,0.001162865,0.00020498595,0.0017670346,0.0007233053,0.0004564084],"domain_scores_gemma":[0.9899256,0.003974108,0.0010881716,0.003208654,0.0010983092,0.000705147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003663881,0.0007664593,0.0011359114,0.0010381058,0.0033583748,0.006764645,0.0014115396,0.0025668056,0.05299241],"category_scores_gemma":[0.024604589,0.0005242085,0.00078247476,0.0013251329,0.0051460494,0.011210295,0.003897771,0.0045809103,0.012359611],"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.00022435363,0.00004788514,0.0020437639,0.00016714736,0.000035601883,0.00009725734,0.0005628002,0.00077393185,0.00066167035,0.9119578,0.024797304,0.05863049],"study_design_scores_gemma":[0.000055308225,0.00014165265,0.0015978499,0.00018346329,0.00005583693,0.0006068358,0.00038000065,0.00299688,0.0020392516,0.71712875,0.274775,0.000039137503],"about_ca_topic_score_codex":0.0013131853,"about_ca_topic_score_gemma":0.0011682771,"teacher_disagreement_score":0.05299241,"about_ca_system_score_codex":0.001539487,"about_ca_system_score_gemma":0.0010983925,"threshold_uncertainty_score":0.17727727},"labels":[],"label_agreement":null},{"id":"W2905224739","doi":"10.1609/aaai.v33i01.33014504","title":"A Comparative Analysis of Expected and Distributional Reinforcement Learning","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Reinforcement learning; Convergence (economics); Computer science; Mathematical optimization; Linear approximation; Mathematics; Econometrics; Artificial intelligence; Nonlinear system; Economics","score_opus":0.058978497480422894,"score_gpt":0.3011855220912152,"score_spread":0.2422070246107923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905224739","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.097379744,0.0023395962,0.88758695,0.0016484924,0.00008660953,0.00008967878,0.00007684207,0.0007308122,0.01006136],"genre_scores_gemma":[0.9278194,0.0005806717,0.06919786,0.0002579053,0.00007588551,0.00011633221,0.00014850679,0.00014280873,0.0016605781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9894434,0.006190744,0.00037036103,0.0009737304,0.0025679776,0.00045372976],"domain_scores_gemma":[0.9177887,0.07003044,0.0029508695,0.004334801,0.0038644338,0.0010307854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014447526,0.00065744127,0.0012662304,0.0010564373,0.0005262428,0.0018834448,0.0022812767,0.0015200785,0.0034739096],"category_scores_gemma":[0.08589091,0.00039141162,0.0007355409,0.0007650662,0.002676139,0.0050743623,0.00253669,0.0023354825,0.00034626943],"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.0005763393,0.00030368948,0.0055265366,0.00042667397,0.00020851621,0.000094242765,0.00027666515,0.65047646,0.0013270318,0.24082002,0.0015621635,0.09840161],"study_design_scores_gemma":[0.000029721261,0.00023618437,0.00079997507,0.000039905557,0.000015306696,0.000040576135,0.000044723696,0.93788326,0.0004967547,0.059800636,0.0005973191,0.00001566181],"about_ca_topic_score_codex":0.0013619815,"about_ca_topic_score_gemma":0.0013651294,"teacher_disagreement_score":0.014447526,"about_ca_system_score_codex":0.0019103087,"about_ca_system_score_gemma":0.0014915059,"threshold_uncertainty_score":0.07640672},"labels":[],"label_agreement":null},{"id":"W2905254322","doi":"10.1609/aaai.v33i01.3301582","title":"Learning Diffusions without Timestamps","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Timestamp; Node (physics); Computer science; Diffusion; Inference; Probabilistic logic; Process (computing); Data mining; Distributed computing; Theoretical computer science; Artificial intelligence; Computer network; Engineering","score_opus":0.03306045239926844,"score_gpt":0.2883744243641603,"score_spread":0.2553139719648918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905254322","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.09629438,0.0010189203,0.89942616,0.00058104494,0.00010416424,0.000056348115,0.0003868396,0.0009090718,0.0012230828],"genre_scores_gemma":[0.87848854,0.00086699054,0.117052145,0.00013559777,0.00017717981,0.00010786852,0.0009900773,0.00010187524,0.0020798203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987897,0.000295685,0.000103893544,0.00047597897,0.00022898239,0.00010571627],"domain_scores_gemma":[0.9903094,0.006758567,0.0011500762,0.00075130607,0.0006796187,0.00035099397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030013265,0.000895587,0.0011522691,0.0019081024,0.0006320206,0.0014325168,0.001824685,0.0014840603,0.0014890225],"category_scores_gemma":[0.024915446,0.00091098563,0.0009871672,0.0013160119,0.00094139896,0.0054839593,0.0014707401,0.002283547,0.0004343739],"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.00021989689,0.000086092165,0.010984171,0.00015448412,0.00010748495,0.00017745355,0.0002256016,0.8717017,0.0022595658,0.03966793,0.001663624,0.072751895],"study_design_scores_gemma":[0.000009083417,0.000012007986,0.00024099989,0.000006379315,0.000008673609,0.000025625635,0.000012219181,0.98550373,0.0003836111,0.013466718,0.00032546237,0.000005444998],"about_ca_topic_score_codex":0.006833437,"about_ca_topic_score_gemma":0.0072164983,"teacher_disagreement_score":0.006833437,"about_ca_system_score_codex":0.0012325188,"about_ca_system_score_gemma":0.001048236,"threshold_uncertainty_score":0.015872777},"labels":[],"label_agreement":null},{"id":"W2905284239","doi":"10.1609/aaai.v33i01.33012895","title":"LENA: Locality-Expanded Neural Embedding for Knowledge Base Completion","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","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 Ottawa","funders":"National Key Research and Development Program of China; Beijing Advanced Innovation Center for Big Data and Brain Computing; State Key Laboratory of Software Development Environment; National Natural Science Foundation of China","keywords":"Embedding; Locality; Knowledge base; Neighbourhood (mathematics); Computer science; Theoretical computer science; Graph; Artificial neural network; Artificial intelligence; Mathematics","score_opus":0.08924279712722161,"score_gpt":0.32619592035492556,"score_spread":0.23695312322770395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905284239","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.019266462,0.0010905951,0.9741241,0.0004967716,0.00006621202,0.00011120367,0.00044946524,0.0027566913,0.0016384524],"genre_scores_gemma":[0.55725574,0.0011485536,0.42788857,0.0006153155,0.00013952325,0.00047082367,0.0037719002,0.0003830853,0.008326502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990736,0.0003300376,0.00005817027,0.00023812878,0.00023379503,0.00006625638],"domain_scores_gemma":[0.99723464,0.0014358553,0.00022505819,0.00066758064,0.00032944017,0.000107491534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020011312,0.001088304,0.0011530734,0.0016470898,0.00048848114,0.0011661607,0.002543908,0.0014845732,0.0032393886],"category_scores_gemma":[0.007950501,0.00046427408,0.0011191939,0.0017306842,0.0009005037,0.004167281,0.002511596,0.003551743,0.0011741952],"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.0002223775,0.00031176934,0.0016562645,0.0002753477,0.00018800698,0.00012649715,0.00020871624,0.49152353,0.0023588333,0.022707768,0.009099047,0.47132185],"study_design_scores_gemma":[0.000007910522,0.000028774424,0.00012351938,0.000012646718,0.000010008776,0.000018090503,0.0000121460835,0.9787118,0.00058794115,0.01963091,0.00084909494,0.0000072430807],"about_ca_topic_score_codex":0.007686381,"about_ca_topic_score_gemma":0.01094579,"teacher_disagreement_score":0.007686381,"about_ca_system_score_codex":0.0012550397,"about_ca_system_score_gemma":0.0013170594,"threshold_uncertainty_score":0.015283287},"labels":[],"label_agreement":null},{"id":"W2905288264","doi":"10.1609/aaai.v33i01.33018885","title":"Connecting Language to Images: A Progressive Attention-Guided Network for Simultaneous Image Captioning and Language Grounding","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Multimodal Machine Learning Applications","field":"Computer Science","cited_by":16,"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":"Science and Technology Planning Project of Guangdong Province; National Key Research and Development Program of China; China Scholarship Council; National Natural Science Foundation of China","keywords":"Closed captioning; Bounding overwatch; Computer science; Benchmark (surveying); Artificial intelligence; Image (mathematics); Process (computing); Machine learning; Natural language processing; Pattern recognition (psychology)","score_opus":0.030288974158012197,"score_gpt":0.3297025353385947,"score_spread":0.29941356118058254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905288264","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.0812729,0.0014248148,0.898527,0.0012199011,0.00029218214,0.00027863763,0.0007252059,0.008442795,0.007816549],"genre_scores_gemma":[0.74299693,0.000543451,0.24355431,0.0009871739,0.00019443982,0.00028518698,0.0018756883,0.00039284592,0.009169958],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995703,0.0000939907,0.000014730167,0.00019912788,0.000058557507,0.00006325251],"domain_scores_gemma":[0.999183,0.0003745973,0.00007771824,0.00013874634,0.00015466836,0.00007128549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007669594,0.0016826398,0.00085379544,0.00097554096,0.00060608407,0.0009037572,0.0031211046,0.0022928263,0.0031614678],"category_scores_gemma":[0.0031564615,0.0006532161,0.0010016155,0.0007245616,0.0012024649,0.0027478652,0.0018372649,0.0020803697,0.0009895161],"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.0005802085,0.00042144395,0.0020557255,0.00033831163,0.00015122515,0.00058855687,0.00044857492,0.44230813,0.031567268,0.015483727,0.016953098,0.48910376],"study_design_scores_gemma":[0.00001840815,0.000055257555,0.00015552544,0.000013406665,0.000022827657,0.000055069533,0.000022013943,0.9843993,0.005132113,0.008855812,0.0012576502,0.000012587552],"about_ca_topic_score_codex":0.0091061825,"about_ca_topic_score_gemma":0.010714678,"teacher_disagreement_score":0.0091061825,"about_ca_system_score_codex":0.0013762101,"about_ca_system_score_gemma":0.001092637,"threshold_uncertainty_score":0.018106341},"labels":[],"label_agreement":null},{"id":"W2905395078","doi":"10.1609/aaai.v33i01.3301809","title":"Weakly-Supervised Simultaneous Evidence Identification and Segmentation for Automated Glaucoma Diagnosis","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Retinal Imaging and Analysis","field":"Medicine","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Artificial intelligence; Segmentation; Glaucoma; Computer science; Discriminative model; Pattern recognition (psychology); Optic disc; Identification (biology); Fundus (uterus); Pixel; Image segmentation; Optic cup (embryology); Computer vision; Medicine; Ophthalmology","score_opus":0.062172918983564446,"score_gpt":0.3425337385625334,"score_spread":0.28036081957896897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905395078","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.102804124,0.0009565725,0.8903666,0.0006331784,0.000060146005,0.00016737668,0.00037940612,0.0025854246,0.0020471457],"genre_scores_gemma":[0.73395926,0.0003421833,0.26095662,0.00045318523,0.00015099469,0.00014274678,0.0010860654,0.00016901782,0.0027399696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990729,0.00022449165,0.00007329266,0.00027097255,0.00027214494,0.00008617803],"domain_scores_gemma":[0.9977424,0.00080903526,0.00038495948,0.00039058307,0.0005022595,0.00017063977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014458493,0.00094498193,0.0009009492,0.0015722855,0.00044794948,0.0009874352,0.0016516714,0.0015146444,0.0015344416],"category_scores_gemma":[0.004550879,0.0004774987,0.0009708655,0.0007209133,0.00077630515,0.0014878135,0.0018618461,0.0011809056,0.0007878514],"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.0010123157,0.00046973905,0.01709677,0.00055470533,0.0002485065,0.00072177616,0.00025081506,0.113765575,0.08950735,0.0041417694,0.006958848,0.76527196],"study_design_scores_gemma":[0.000024055758,0.00012309004,0.002949315,0.000023856404,0.00005145813,0.00025111923,0.000036310197,0.9697081,0.02016064,0.0053607444,0.0012884412,0.00002290929],"about_ca_topic_score_codex":0.0017804573,"about_ca_topic_score_gemma":0.004063332,"teacher_disagreement_score":0.0017804573,"about_ca_system_score_codex":0.0006486301,"about_ca_system_score_gemma":0.0010049514,"threshold_uncertainty_score":0.0076464415},"labels":[],"label_agreement":null},{"id":"W2905514808","doi":"10.1609/aaai.v33i01.33014360","title":"Learning Multi-Task Communication with Message Passing for Sequence Learning","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Polytechnique Montréal","funders":"Science and Technology Commission of Shanghai Municipality; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Task (project management); Sequence learning; Artificial intelligence; Graph; Multi-task learning; Machine learning; Sequence (biology); Transfer of learning; Message passing; Natural language processing; Theoretical computer science; Distributed computing","score_opus":0.07632874879394373,"score_gpt":0.30763395760968065,"score_spread":0.2313052088157369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905514808","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.009790012,0.00021578454,0.9869667,0.00045812514,0.00009672752,0.00009036829,0.00008273055,0.0014292294,0.0008703518],"genre_scores_gemma":[0.57477295,0.00033292198,0.41495222,0.00060703076,0.00024865413,0.0007692114,0.0007237966,0.0003072818,0.0072859568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998125,0.0008205807,0.000087150205,0.00047722913,0.00027883385,0.00021126615],"domain_scores_gemma":[0.9950799,0.0025289615,0.00036991693,0.0010854189,0.0005939397,0.00034187586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035962262,0.0018670008,0.0014888743,0.0010990519,0.0008395895,0.0014905739,0.004100163,0.0030866503,0.004520966],"category_scores_gemma":[0.011447868,0.0006377219,0.0013184231,0.0011635736,0.001564657,0.005269406,0.0030422618,0.0043772673,0.0014642851],"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.0006848202,0.0006844829,0.0013248286,0.00033096306,0.0001920556,0.00019999305,0.00037652737,0.62814957,0.0064342134,0.047604013,0.0074559352,0.3065625],"study_design_scores_gemma":[0.000017726052,0.000060813403,0.00006426331,0.0000060062935,0.000011306287,0.000012240668,0.000009969327,0.9710193,0.0014418274,0.026715567,0.0006306803,0.000010293894],"about_ca_topic_score_codex":0.0050392877,"about_ca_topic_score_gemma":0.005446265,"teacher_disagreement_score":0.0050392877,"about_ca_system_score_codex":0.0019112735,"about_ca_system_score_gemma":0.0020767762,"threshold_uncertainty_score":0.019018888},"labels":[],"label_agreement":null},{"id":"W2905539846","doi":"10.1609/aaai.v33i01.33011724","title":"The Pure Price of Anarchy of Pool Block Withholding Attacks in Bitcoin Mining","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Blockchain Technology Applications and Security","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":"Cryptocurrency; Nash equilibrium; Conjecture; Block (permutation group theory); Protocol (science); Computer science; Price of anarchy; Computer security; Mathematical economics; Focus (optics); Game theory; Microeconomics; Economics; Mathematics; Price of stability; Monetary economics; Combinatorics","score_opus":0.03442986226599457,"score_gpt":0.2757541355054575,"score_spread":0.24132427323946296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905539846","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.7899378,0.0003916605,0.16621329,0.0052890717,0.00009614819,0.00024845955,0.00020100022,0.0002732964,0.03734926],"genre_scores_gemma":[0.9924378,0.00008421439,0.0055737426,0.00014279752,0.000016757402,0.00007167441,0.00001868017,0.000029117762,0.0016251816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954326,0.002717309,0.0001775212,0.00040185923,0.00057358015,0.0006970974],"domain_scores_gemma":[0.96411395,0.028098362,0.0029887992,0.0024578066,0.00095746125,0.001383611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052957674,0.00053742103,0.0011722278,0.000620566,0.0018759096,0.0037948177,0.0016616374,0.0034842868,0.005496894],"category_scores_gemma":[0.03652186,0.00062994944,0.0008661622,0.00060057355,0.00418145,0.010192165,0.002796901,0.0038670832,0.00052346924],"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.0017560652,0.00042361874,0.0064578378,0.0002767294,0.00022618673,0.0011750791,0.0009793951,0.22892906,0.0102618495,0.72718686,0.0036842315,0.018643135],"study_design_scores_gemma":[0.00022837565,0.00027828457,0.000829199,0.000038080594,0.000040122017,0.00033983684,0.0003004847,0.5066127,0.0028843519,0.486737,0.0016510858,0.000060488048],"about_ca_topic_score_codex":0.0016348828,"about_ca_topic_score_gemma":0.0015195938,"teacher_disagreement_score":0.005496894,"about_ca_system_score_codex":0.0017665749,"about_ca_system_score_gemma":0.0017404029,"threshold_uncertainty_score":0.02800703},"labels":[],"label_agreement":null},{"id":"W2905564365","doi":"10.1609/aaai.v33i01.33018505","title":"DeepCCFV: Camera Constraint-Free Multi-View Convolutional Neural Network for 3D Object Retrieval","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Robotics and Sensor-Based Localization","field":"Engineering","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":"Computer science; Artificial intelligence; Convolutional neural network; Constraint (computer-aided design); Dropout (neural networks); Computer vision; Point cloud; Object (grammar); Feature (linguistics); Modal; Field (mathematics); Machine learning; Mathematics","score_opus":0.053434367339828814,"score_gpt":0.26569153290476927,"score_spread":0.21225716556494045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905564365","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.021596,0.0015800863,0.9693406,0.00016987033,0.00011689333,0.000074218784,0.00038751215,0.0049682697,0.0017664647],"genre_scores_gemma":[0.5748498,0.0015138717,0.40502685,0.00086668646,0.0001317612,0.00018439133,0.004004465,0.00047244353,0.012949799],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966526,0.000029167752,0.000012442687,0.0001029894,0.00011878416,0.0000714397],"domain_scores_gemma":[0.999775,0.00004889578,0.000027756363,0.00006506452,0.00006275529,0.000020532729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004956335,0.001179193,0.0010545463,0.000681452,0.00031569475,0.0006878246,0.0026241466,0.0014011327,0.002303104],"category_scores_gemma":[0.0010960872,0.0005842535,0.0008362342,0.00077189284,0.00044187103,0.0015336324,0.0013682141,0.0013721348,0.0009797945],"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.00027556834,0.00014696515,0.0014212525,0.0001945383,0.00018420925,0.00022924488,0.00007315328,0.2313132,0.038442764,0.005019856,0.015114087,0.7075852],"study_design_scores_gemma":[0.0000113196265,0.0000419043,0.00032927733,0.000009846731,0.000020730426,0.000106955464,0.000007008864,0.9884504,0.0074053076,0.0016245054,0.0019781338,0.0000145381955],"about_ca_topic_score_codex":0.023327831,"about_ca_topic_score_gemma":0.029021833,"teacher_disagreement_score":0.023327831,"about_ca_system_score_codex":0.001232425,"about_ca_system_score_gemma":0.0013552875,"threshold_uncertainty_score":0.046384096},"labels":[],"label_agreement":null},{"id":"W2906208572","doi":"10.1609/aaai.v33i01.330110075","title":"Sequence to Sequence Learning for Query Expansion","year":2019,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","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":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Sequence (biology); Query expansion; Information retrieval; Set (abstract data type); Sentence; Space (punctuation); Natural language processing; Artificial intelligence","score_opus":0.20417178667479077,"score_gpt":0.351188536485249,"score_spread":0.14701674981045823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2906208572","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.054371975,0.001389447,0.93303937,0.0005260146,0.00013828986,0.00032553176,0.000533298,0.0047913822,0.004884673],"genre_scores_gemma":[0.5372406,0.0007714456,0.45114315,0.00053283473,0.00021679325,0.0004310758,0.0022625413,0.00040739827,0.006994136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987997,0.0004297777,0.000091129594,0.00035291846,0.00023580842,0.000090810165],"domain_scores_gemma":[0.9974935,0.0014486546,0.00013677483,0.00035431693,0.0004907264,0.000076031465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018062192,0.0009301286,0.00067731366,0.0013589568,0.00032425867,0.0005957025,0.0011688849,0.0010023768,0.006547138],"category_scores_gemma":[0.007335757,0.00029104244,0.0006503379,0.0012523028,0.0005614608,0.0035563107,0.000991131,0.0013582879,0.002148574],"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.00051530695,0.0005087734,0.0021425325,0.0005658045,0.00010282361,0.00016848498,0.00035166965,0.11609196,0.039124057,0.019414632,0.0120046465,0.80900925],"study_design_scores_gemma":[0.00003219419,0.00019499903,0.00043101632,0.0000191403,0.000023158727,0.000112152724,0.00006015969,0.96751904,0.009801306,0.017214283,0.0045781424,0.000014338349],"about_ca_topic_score_codex":0.0034809539,"about_ca_topic_score_gemma":0.004570568,"teacher_disagreement_score":0.006547138,"about_ca_system_score_codex":0.00084123516,"about_ca_system_score_gemma":0.0008958209,"threshold_uncertainty_score":0.021902323},"labels":[],"label_agreement":null},{"id":"W2914914077","doi":"10.1609/aaai.v33i01.33018901","title":"A Layer-Based Sequential Framework for Scene Generation with GANs","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Generative grammar; Artificial intelligence; Task (project management); Affine transformation; Computer vision; Adversarial system; Mathematics","score_opus":0.09918387295695763,"score_gpt":0.29796823514722526,"score_spread":0.19878436219026763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914914077","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.0032256523,0.00016632261,0.99397755,0.00009850032,0.0000313084,0.00003918345,0.000085920066,0.00084121095,0.0015343751],"genre_scores_gemma":[0.40185046,0.00039749427,0.5892414,0.00035681447,0.00011048948,0.0002614472,0.0008291941,0.0006643483,0.006288364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961543,0.00011866537,0.000013265218,0.00011389506,0.00009264744,0.00004614609],"domain_scores_gemma":[0.99961025,0.00019362965,0.00003189715,0.00007708095,0.000052689815,0.000034434026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008014751,0.0011991537,0.0006674948,0.00051156455,0.0003213149,0.0008099809,0.0017160468,0.000880644,0.004046976],"category_scores_gemma":[0.001356836,0.0006275288,0.0010283388,0.00042232207,0.00073704077,0.000998528,0.0013814535,0.0017321915,0.00085599197],"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.00008407529,0.000037251088,0.00029684562,0.00006383058,0.00005366024,0.00009476361,0.00006144115,0.91491026,0.0076307137,0.023820594,0.0027521756,0.0501944],"study_design_scores_gemma":[0.000005009456,0.000011671985,0.00002875431,0.0000033236615,0.000003828073,0.000020011832,0.0000026290047,0.9927938,0.00075445394,0.00567855,0.00069460325,0.0000032868923],"about_ca_topic_score_codex":0.003115281,"about_ca_topic_score_gemma":0.0058462815,"teacher_disagreement_score":0.004046976,"about_ca_system_score_codex":0.0008625585,"about_ca_system_score_gemma":0.0005991594,"threshold_uncertainty_score":0.01353848},"labels":[],"label_agreement":null},{"id":"W2915001123","doi":"10.1609/aaai.v26i1.8282","title":"Weighted Clustering","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Strategic Research Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Research Foundation; Sino-Danish Center; Danmarks Grundforskningsfond; National Science Foundation","keywords":"Cluster analysis; Computer science; Correlation clustering; CURE data clustering algorithm; Generalization; Single-linkage clustering; Data mining; Canopy clustering algorithm; Artificial intelligence; Fuzzy clustering; Consensus clustering; Hierarchical clustering; Selection (genetic algorithm); Pattern recognition (psychology); Mathematics","score_opus":0.08640250646346599,"score_gpt":0.32819258052314715,"score_spread":0.24179007405968117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915001123","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.006224465,0.00051622046,0.9872662,0.0002992848,0.00011894264,0.00014922164,0.00032562274,0.00024826918,0.0048517766],"genre_scores_gemma":[0.20498632,0.0013573525,0.7757124,0.000664753,0.00041540584,0.00060553645,0.0027024571,0.0004965924,0.013059147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99022734,0.0031150442,0.0004975833,0.0026566684,0.0030273814,0.0004760414],"domain_scores_gemma":[0.98735726,0.004378977,0.001104795,0.0041349195,0.0026356492,0.0003883849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063957223,0.0014604193,0.0014150544,0.0038929603,0.0015368639,0.0039715394,0.004711466,0.0019436327,0.0056130616],"category_scores_gemma":[0.024892882,0.00070178445,0.0015643418,0.005369802,0.0019649877,0.0058946167,0.0041006575,0.0019462891,0.00259355],"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.00016699122,0.00014768873,0.0027045652,0.00060953514,0.00042089744,0.0001656261,0.00040310164,0.16794086,0.004662048,0.5719521,0.016879112,0.23394758],"study_design_scores_gemma":[0.000031811167,0.00009386971,0.0009229043,0.000082447,0.00008840288,0.0002602985,0.00016773367,0.49116886,0.0041030236,0.46747822,0.035551284,0.000051226933],"about_ca_topic_score_codex":0.0024637347,"about_ca_topic_score_gemma":0.0034539765,"teacher_disagreement_score":0.0063957223,"about_ca_system_score_codex":0.0020057096,"about_ca_system_score_gemma":0.0020188054,"threshold_uncertainty_score":0.033824265},"labels":[],"label_agreement":null},{"id":"W2919328485","doi":"10.1609/aaai.v33i01.33017949","title":"Rethinking the Discount Factor in Reinforcement Learning: A Decision Theoretic Approach","year":2019,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Decision-Making and Behavioral Economics","field":"Decision Sciences","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":"University of Toronto","funders":"","keywords":"Discounting; Reinforcement learning; Axiom; Markov decision process; Bellman equation; Generalization; Mathematical economics; Expected utility hypothesis; Preference; Computer science; Revealed preference; Decision theory; Markov process; Mathematics; Econometrics; Economics; Artificial intelligence; Microeconomics; Statistics","score_opus":0.24995316240911114,"score_gpt":0.3937038071337248,"score_spread":0.14375064472461369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919328485","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.008403671,0.0010720111,0.9872093,0.0011531132,0.00011995815,0.000027780872,0.000025357545,0.000055435215,0.0019333344],"genre_scores_gemma":[0.7577699,0.0020871595,0.23612632,0.0005846406,0.0005686282,0.00015960285,0.000049962342,0.00016606819,0.0024878096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99510926,0.0027514414,0.00025381305,0.00087997346,0.0007334095,0.0002719653],"domain_scores_gemma":[0.97389394,0.022391783,0.0011284372,0.0010149551,0.0009094693,0.0006613805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011156974,0.001956027,0.0031865493,0.001069675,0.0007921926,0.0034984332,0.004348249,0.0037724806,0.002464084],"category_scores_gemma":[0.0376957,0.0015847794,0.001613217,0.0012110567,0.0056046364,0.009714984,0.0030604065,0.009833383,0.00027978013],"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.00014812831,0.00012445303,0.0008345025,0.00021065368,0.00013407494,0.00010359886,0.00020437886,0.47295943,0.0009981132,0.4969577,0.0008132386,0.02651171],"study_design_scores_gemma":[0.000031553576,0.000038222708,0.00007470744,0.000032959775,0.000028139828,0.00001708524,0.000012631226,0.71988314,0.0002044234,0.27909863,0.0005517537,0.000026777714],"about_ca_topic_score_codex":0.0034686741,"about_ca_topic_score_gemma":0.002256025,"teacher_disagreement_score":0.011156974,"about_ca_system_score_codex":0.003053649,"about_ca_system_score_gemma":0.00201869,"threshold_uncertainty_score":0.059004426},"labels":[],"label_agreement":null},{"id":"W2919351616","doi":"10.1609/aaai.v33i01.33019558","title":"Artificial Counselor System for Stock Investment","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Stock Market Forecasting Methods","field":"Decision Sciences","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 Waterloo","funders":"","keywords":"Stock exchange; Technical analysis; Stock (firearms); Fuzzy logic; Portfolio; Stock market; Profit (economics); Financial economics; Econometrics; Computer science; Business; Economics; Microeconomics; Finance; Artificial intelligence; Engineering","score_opus":0.2663376686490279,"score_gpt":0.4069810585356831,"score_spread":0.1406433898866552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919351616","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.07135314,0.0009051264,0.9019139,0.00056731317,0.0002235848,0.00022395952,0.00032920862,0.013000408,0.0114834765],"genre_scores_gemma":[0.6674012,0.00044877213,0.3216572,0.0002818344,0.00012376215,0.00021011013,0.00040053268,0.00008387154,0.009392675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996829,0.000059846887,0.000033817134,0.000067876616,0.000135194,0.000020421716],"domain_scores_gemma":[0.9996637,0.00011411225,0.00004848813,0.000040465624,0.00011145683,0.000021825696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050762546,0.00034453804,0.00048435392,0.000634506,0.0003005771,0.0007213723,0.0007545703,0.00072751223,0.003966326],"category_scores_gemma":[0.0013119964,0.00015384599,0.00024775602,0.0003852116,0.00016310785,0.0007582588,0.00035159528,0.00044550246,0.00090484065],"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.00047095804,0.00023722307,0.003231624,0.00017136928,0.00007371471,0.00041355946,0.0001644408,0.07764571,0.031145763,0.00924022,0.009057666,0.8681478],"study_design_scores_gemma":[0.00004169451,0.00011137245,0.000991231,0.0000145791855,0.00003183385,0.0001345737,0.000016476297,0.9777616,0.008956209,0.0021951147,0.009720445,0.00002478107],"about_ca_topic_score_codex":0.0021046735,"about_ca_topic_score_gemma":0.0021024994,"teacher_disagreement_score":0.003966326,"about_ca_system_score_codex":0.000388431,"about_ca_system_score_gemma":0.0005273163,"threshold_uncertainty_score":0.013268709},"labels":[],"label_agreement":null},{"id":"W292355835","doi":"10.1609/aaai.v28i1.9031","title":"Solving the Traveling Tournament Problem by Packing Three-Vertex Paths","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","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":"Quest University Canada","funders":"","keywords":"Tournament; Schedule; Mathematical optimization; Vertex (graph theory); Integer programming; TRIPS architecture; Computer science; Scheduling (production processes); Job shop scheduling; Graph; Benchmark (surveying); Mathematics; Theoretical computer science; Combinatorics; Geography; Parallel computing","score_opus":0.16066170412888656,"score_gpt":0.35453162501407115,"score_spread":0.1938699208851846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W292355835","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.33042565,0.00018556617,0.6478846,0.00031189682,0.00008238627,0.0003543621,0.00039008542,0.0006774107,0.01968792],"genre_scores_gemma":[0.60025847,0.00024035625,0.39465627,0.0000725965,0.000026862397,0.00022412557,0.00090626755,0.00016382887,0.0034512156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962735,0.00013963868,0.000015184407,0.000070985785,0.000058409416,0.00008848548],"domain_scores_gemma":[0.99946135,0.00029130295,0.000059260063,0.00006481136,0.000051216004,0.00007208913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005604364,0.0007304477,0.000596648,0.0004640549,0.0006162995,0.0008172955,0.00096926524,0.00066262257,0.0046597254],"category_scores_gemma":[0.0017491258,0.00032378265,0.0006817059,0.0009580389,0.00049517426,0.0009189134,0.0006498778,0.00079061714,0.0003795365],"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.00018046622,0.00018370751,0.0015021868,0.00014162362,0.000055815475,0.0002518846,0.00017144436,0.8677598,0.0030747345,0.027239362,0.004662829,0.09477616],"study_design_scores_gemma":[0.00007472246,0.000261868,0.0003539555,0.000010561314,0.000024190012,0.000112579815,0.00013141934,0.96984285,0.0018585682,0.023619294,0.0036987837,0.000011214748],"about_ca_topic_score_codex":0.0038623582,"about_ca_topic_score_gemma":0.004349003,"teacher_disagreement_score":0.0046597254,"about_ca_system_score_codex":0.0005336165,"about_ca_system_score_gemma":0.0010837818,"threshold_uncertainty_score":0.015588284},"labels":[],"label_agreement":null},{"id":"W2937821344","doi":"10.1609/aaai.v34i05.6296","title":"One Homonym per Translation","year":2020,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Homonym (biology); Polysemy; Context (archaeology); Computer science; Semantics (computer science); Natural language processing; Linguistics; Lexical semantics; Syntax; Resource (disambiguation); Translation (biology); Artificial intelligence; Lexical item; History; Programming language; Philosophy; Biology","score_opus":0.13614279806786667,"score_gpt":0.3266309128161678,"score_spread":0.19048811474830113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2937821344","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49167496,0.0030890654,0.30437487,0.0039109243,0.0012300473,0.0003569114,0.01648586,0.0040154546,0.17486185],"genre_scores_gemma":[0.8693614,0.00057330314,0.109269656,0.0003840483,0.00018488607,0.00012186369,0.005963064,0.00058839243,0.013553382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978671,0.0005936562,0.00022082872,0.00065625797,0.0005553031,0.00010692019],"domain_scores_gemma":[0.99559987,0.0017633354,0.00022868314,0.0017207072,0.00051618554,0.0001712529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001265871,0.00033431174,0.0006333946,0.0020842766,0.0016909224,0.0021129558,0.0005151336,0.0008620889,0.02010652],"category_scores_gemma":[0.0056326226,0.00035026507,0.00039221314,0.002494946,0.0018039775,0.0069657383,0.0025786145,0.0009756962,0.003831719],"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.00085053686,0.000180306,0.016116384,0.0014691866,0.00012296223,0.0020326884,0.011310211,0.0021086133,0.08942697,0.44527227,0.02338235,0.40772748],"study_design_scores_gemma":[0.00007076331,0.00020022347,0.020724524,0.0004203371,0.0001496233,0.004866252,0.0070210886,0.014884015,0.037744246,0.5180736,0.39562342,0.0002217553],"about_ca_topic_score_codex":0.00053741824,"about_ca_topic_score_gemma":0.00085627876,"teacher_disagreement_score":0.02010652,"about_ca_system_score_codex":0.00052858796,"about_ca_system_score_gemma":0.0009207947,"threshold_uncertainty_score":0.06726301},"labels":[],"label_agreement":null},{"id":"W2939670620","doi":"10.1609/aaai.v33i01.330110019","title":"Hierarchical Deep Feature Learning for Decoding Imagined Speech from EEG","year":2019,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","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 British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Electroencephalography; Convolutional neural network; Deep learning; Feature (linguistics); Pattern recognition (psychology); Recurrent neural network; Speech recognition; Decoding methods; Channel (broadcasting); Artificial neural network; Algorithm; Psychology","score_opus":0.08360300926353506,"score_gpt":0.3234145522690937,"score_spread":0.23981154300555865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2939670620","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.043278985,0.00033634948,0.95247877,0.00017232641,0.000057051646,0.00003893442,0.0004612525,0.0018083636,0.0013680877],"genre_scores_gemma":[0.63101226,0.00027333564,0.3630585,0.00013304403,0.000072881885,0.00011835856,0.0016627429,0.00010420651,0.003564709],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997762,0.000041437328,0.000013725979,0.00006389163,0.000059385224,0.00004549039],"domain_scores_gemma":[0.99973124,0.00010552389,0.000031576838,0.000047118952,0.00006672931,0.000017830589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044409494,0.0008134007,0.00051158696,0.00051907304,0.00019356814,0.00047201954,0.00086606276,0.0005302871,0.0019999708],"category_scores_gemma":[0.0013098122,0.00029831377,0.00057048124,0.0005039383,0.00025831605,0.0010167505,0.00089624303,0.000869003,0.0007305932],"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.00027435186,0.00024423242,0.0018916959,0.00015024254,0.00012041626,0.00019120744,0.00011119947,0.21816784,0.07510722,0.0112915775,0.0051985853,0.68725145],"study_design_scores_gemma":[0.000008213135,0.000045508084,0.00060514256,0.000006770672,0.000013835307,0.000027698059,0.000009942083,0.98387146,0.010321883,0.004447183,0.0006339324,0.000008430056],"about_ca_topic_score_codex":0.0039243815,"about_ca_topic_score_gemma":0.0075603384,"teacher_disagreement_score":0.0039243815,"about_ca_system_score_codex":0.00042453947,"about_ca_system_score_gemma":0.00071151677,"threshold_uncertainty_score":0.0078030825},"labels":[],"label_agreement":null},{"id":"W2945192089","doi":"10.1609/aaai.v34i04.6039","title":"Bivariate Beta-LSTM","year":2020,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot 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":"Kootenay Association for Science & Technology","funders":"Defense Acquisition Program Administration; Korea Advanced Institute of Science and Technology; Agency for Defense Development","keywords":"Sigmoid function; Bivariate analysis; Beta distribution; Computer science; Function (biology); Prior probability; Skewness; Algorithm; Artificial intelligence; Image (mathematics); Probabilistic logic; Term (time); Mathematics; Pattern recognition (psychology); Statistics; Machine learning; Bayesian probability; Physics; Artificial neural network","score_opus":0.15833930927051848,"score_gpt":0.316150595604048,"score_spread":0.15781128633352953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945192089","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.03318777,0.00072378607,0.955186,0.0004894886,0.00014769734,0.000026382168,0.0008579751,0.002507477,0.0068733743],"genre_scores_gemma":[0.8662447,0.0008622525,0.121940054,0.0003868813,0.00012862362,0.000092366325,0.0014292994,0.0003528939,0.008562917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978644,0.00004144455,0.000010395512,0.00009110834,0.00003894451,0.000031681957],"domain_scores_gemma":[0.9995987,0.00015021357,0.000038501476,0.00006959208,0.00011110225,0.000031939122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003885638,0.00077777315,0.0005496298,0.0004167437,0.0001981617,0.000652972,0.0010109445,0.0006299348,0.0047367443],"category_scores_gemma":[0.0018561771,0.0003325361,0.00047667106,0.0006896352,0.00040744746,0.0016077652,0.0007845213,0.0012095344,0.0015689909],"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.00043028136,0.00011011971,0.002732317,0.00024015972,0.0001252613,0.00027566147,0.00017089867,0.5150195,0.030742055,0.054440733,0.013664527,0.38204855],"study_design_scores_gemma":[0.0000063517637,0.000025329902,0.0004377575,0.000010076942,0.000014583061,0.00006347219,0.00000788648,0.9792796,0.003378612,0.015285053,0.0014832742,0.000008016596],"about_ca_topic_score_codex":0.0024273607,"about_ca_topic_score_gemma":0.0034466886,"teacher_disagreement_score":0.0047367443,"about_ca_system_score_codex":0.00063135655,"about_ca_system_score_gemma":0.0006800584,"threshold_uncertainty_score":0.015846014},"labels":[],"label_agreement":null},{"id":"W2948288905","doi":"10.1609/aaai.v34i06.6565","title":"Learning Fair Naive Bayes Classifiers by Discovering and Eliminating Discrimination Patterns","year":2020,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Ethics and Social Impacts of AI","field":"Social Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Defense Advanced Research Projects Agency; Institut de Valorisation des Données; Canada First Research Excellence Fund; National Science Foundation","keywords":"Naive Bayes classifier; Machine learning; Computer science; Artificial intelligence; Classifier (UML); Bayes' theorem; Set (abstract data type); Fraction (chemistry); Bayesian probability; Pattern recognition (psychology); Data mining; Support vector machine","score_opus":0.12796665775171717,"score_gpt":0.36607356473225056,"score_spread":0.23810690698053338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948288905","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.047073986,0.00031169495,0.9501104,0.0008255925,0.000066518354,0.0001382472,0.000076643315,0.00035999183,0.0010369421],"genre_scores_gemma":[0.5257815,0.00019822129,0.4698801,0.0010973646,0.00020262107,0.0003019949,0.00049665774,0.00014579309,0.001895624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98575264,0.006455983,0.0010090196,0.0025765116,0.0032824574,0.00092343206],"domain_scores_gemma":[0.932365,0.05013163,0.004639055,0.0063494197,0.005228781,0.0012861548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026564283,0.0015998961,0.003471715,0.0023897248,0.0022388052,0.0036151474,0.0035394784,0.0032272434,0.0013660261],"category_scores_gemma":[0.098418914,0.0016931929,0.0015585745,0.0016636605,0.0031061058,0.008301595,0.0032247978,0.0053512044,0.0006848123],"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.0011302102,0.0005769465,0.027773047,0.0003049293,0.0003130259,0.00040233432,0.0011320026,0.48993522,0.003640309,0.08413918,0.0063592526,0.3842936],"study_design_scores_gemma":[0.00004843287,0.000062556996,0.0003248528,0.000038411275,0.00002750334,0.000057367546,0.000053799595,0.8768857,0.0010484512,0.120818384,0.00061476236,0.000019740455],"about_ca_topic_score_codex":0.003844377,"about_ca_topic_score_gemma":0.004189097,"teacher_disagreement_score":0.026564283,"about_ca_system_score_codex":0.002300248,"about_ca_system_score_gemma":0.004824052,"threshold_uncertainty_score":0.14048707},"labels":[],"label_agreement":null},{"id":"W2948831929","doi":"10.1609/aaai.v34i04.5727","title":"A Stochastic Derivative-Free Optimization Method with Importance Sampling: Theory and Learning to Control","year":2020,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Stochastic Gradient Optimization 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":"Kootenay Association for Science & Technology","funders":"King Abdullah University of Science and Technology","keywords":"Sampling (signal processing); Mathematical optimization; Computer science; Convergence (economics); Convex function; Function (biology); Derivative (finance); Regular polygon; Sample (material); Derivative-free optimization; Acceleration; Minification; Convex optimization; Control (management); Algorithm; Mathematics; Optimization problem; Artificial intelligence","score_opus":0.07210470146840367,"score_gpt":0.31624839202100435,"score_spread":0.24414369055260068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948831929","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.0009958617,0.0001273836,0.99814105,0.000098065415,0.00003201417,0.000018111066,0.0000063654143,0.00006781072,0.0005133397],"genre_scores_gemma":[0.27789834,0.00060108735,0.7147542,0.00036852562,0.00028392044,0.00039817925,0.00010012641,0.00024802482,0.005347602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990727,0.00035680606,0.000034159217,0.0001516472,0.0003236325,0.000061135004],"domain_scores_gemma":[0.9982285,0.001191788,0.00010594686,0.00012863842,0.00025734003,0.00008776848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002234692,0.0011759385,0.0015203159,0.0007811267,0.0004788148,0.0010754311,0.0017922821,0.0017899573,0.0024422284],"category_scores_gemma":[0.006425536,0.00069133326,0.00095784815,0.00082742964,0.0016509655,0.0014676935,0.0015744322,0.0023921395,0.00044804666],"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.000070038615,0.00006846048,0.00035283298,0.00016945458,0.000052453295,0.00008256895,0.000059667043,0.86535496,0.0025155093,0.06078812,0.0021050675,0.06838094],"study_design_scores_gemma":[0.0000059589893,0.000015694755,0.000022544993,0.000005631279,0.0000024539256,0.000009313132,0.0000013085494,0.99481165,0.00025474606,0.0044874917,0.0003793843,0.0000038816506],"about_ca_topic_score_codex":0.0029258847,"about_ca_topic_score_gemma":0.001972513,"teacher_disagreement_score":0.0029258847,"about_ca_system_score_codex":0.000981883,"about_ca_system_score_gemma":0.0014197992,"threshold_uncertainty_score":0.011818349},"labels":[],"label_agreement":null},{"id":"W2949910966","doi":"10.1609/aaai.v29i1.9755","title":"SAT Modulo Monotonic Theories","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Earl Haig Secondary School; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Western Canada Research Grid; Compute Canada","keywords":"Monotonic function; Computer science; Modulo; Answer set programming; Theoretical computer science; Satisfiability modulo theories; Variety (cybernetics); Set (abstract data type); Programming language; Discrete mathematics; Mathematics; Artificial intelligence","score_opus":0.13960626480657615,"score_gpt":0.33423574303286674,"score_spread":0.1946294782262906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949910966","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.02574935,0.0016346925,0.90398216,0.003303025,0.0002815948,0.0003325567,0.0008104498,0.0019003635,0.06200574],"genre_scores_gemma":[0.28468087,0.0024323692,0.69649726,0.0014191552,0.0005709781,0.00061432226,0.0018663055,0.00043968367,0.011479081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961086,0.0015992912,0.00024094527,0.0005540629,0.0011619423,0.0003352335],"domain_scores_gemma":[0.9940779,0.0041383957,0.00027791414,0.0008403773,0.0005510377,0.00011434227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033346226,0.0007581995,0.000574824,0.0012525468,0.0011663118,0.0034888594,0.0020595284,0.0010869022,0.010671433],"category_scores_gemma":[0.011991216,0.0007997478,0.0017038642,0.0014087793,0.0026539,0.006172018,0.002752017,0.004483874,0.0020936541],"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.00004514501,0.000048299946,0.00038421009,0.00028507964,0.000038869064,0.00020525744,0.00030861227,0.013913192,0.002000792,0.9109688,0.00569872,0.06610295],"study_design_scores_gemma":[0.000050657425,0.00003361183,0.00017015585,0.0001167143,0.00003987033,0.00019943801,0.00016230035,0.09405383,0.005003935,0.87131685,0.028833484,0.000019167466],"about_ca_topic_score_codex":0.0018123551,"about_ca_topic_score_gemma":0.002580747,"teacher_disagreement_score":0.010671433,"about_ca_system_score_codex":0.0015828664,"about_ca_system_score_gemma":0.002438892,"threshold_uncertainty_score":0.035699487},"labels":[],"label_agreement":null},{"id":"W2952353673","doi":"10.1609/aaai.v27i1.8628","title":"Vesselness Features and the Inverse Compositional AAM for Robust Face Recognition Using Thermal IR","year":2013,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Face recognition and analysis","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":"Artificial intelligence; Image warping; Facial expression; Computer science; Pattern recognition (psychology); Computer vision; Face (sociological concept); Active appearance model; Expression (computer science); Representation (politics); Facial recognition system; Image (mathematics)","score_opus":0.09626352450097359,"score_gpt":0.27905169734475316,"score_spread":0.18278817284377957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952353673","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.015229783,0.00013277086,0.98342276,0.000068110276,0.00002694935,0.000029646322,0.000052452848,0.00039336304,0.00064423063],"genre_scores_gemma":[0.41977656,0.00055486267,0.574467,0.00011904741,0.000109926266,0.00015249616,0.00046341636,0.00031880208,0.0040379036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973553,0.000060707724,0.000012350376,0.000056286568,0.00011002565,0.000025087089],"domain_scores_gemma":[0.99971014,0.0001159759,0.000047573903,0.000053907268,0.000058437767,0.000013993894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051799184,0.0004587111,0.000406771,0.00080648623,0.00021271508,0.00062101445,0.000639593,0.0005709417,0.0017884541],"category_scores_gemma":[0.0021077371,0.00029570665,0.00092877145,0.0005587893,0.00039374764,0.00063528324,0.00051747245,0.0010211106,0.0008788991],"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.00018109693,0.00008476977,0.0010494014,0.00015660933,0.00007239577,0.00018428433,0.00013275667,0.19782136,0.11743643,0.015002595,0.002251766,0.6656266],"study_design_scores_gemma":[0.0000029995049,0.000051760533,0.0007897802,0.0000106925,0.00001434011,0.00011895713,0.000016379418,0.98355675,0.010098453,0.0035125352,0.0018140752,0.000013259526],"about_ca_topic_score_codex":0.0012906123,"about_ca_topic_score_gemma":0.0011963295,"teacher_disagreement_score":0.0017884541,"about_ca_system_score_codex":0.00025204418,"about_ca_system_score_gemma":0.00033856137,"threshold_uncertainty_score":0.005982995},"labels":[],"label_agreement":null},{"id":"W2952627588","doi":"10.1609/aaai.v33i01.33019111","title":"Instance-Level Facial Attributes Transfer with Geometry-Aware Flow","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Face recognition and analysis","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 British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Leverage (statistics); Face (sociological concept); Computer vision; Context (archaeology); Representation (politics); Pattern recognition (psychology)","score_opus":0.07835275067118748,"score_gpt":0.2599646286022749,"score_spread":0.18161187793108746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952627588","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.021699755,0.000082649734,0.9757067,0.00008850903,0.000043240427,0.00006285196,0.00007642554,0.0012347096,0.0010052051],"genre_scores_gemma":[0.5410155,0.0002564685,0.45294923,0.000221344,0.00008927026,0.00015042746,0.0006600182,0.0003871656,0.0042706085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997271,0.00003665024,0.00001180809,0.00010865913,0.00007541219,0.00004039928],"domain_scores_gemma":[0.99953294,0.000121010606,0.00005148727,0.0001812312,0.00007305071,0.000040380764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074974616,0.0010137869,0.00075767556,0.0006375815,0.00033523442,0.0007927219,0.0016459541,0.00095595635,0.0024338749],"category_scores_gemma":[0.0022134727,0.0004163218,0.0008516561,0.00042811988,0.00080294046,0.0018359063,0.001494374,0.0016723679,0.00078157085],"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.00017649986,0.0001782423,0.0017457315,0.00010391964,0.00006636563,0.00016279277,0.00018807387,0.44044235,0.044491842,0.010955036,0.0032744845,0.49821463],"study_design_scores_gemma":[0.00000612474,0.00004845265,0.00020023473,0.000004944084,0.000008983805,0.00007032528,0.000015479058,0.9801297,0.012158318,0.0064975657,0.0008511803,0.000008636379],"about_ca_topic_score_codex":0.0021127597,"about_ca_topic_score_gemma":0.0017546263,"teacher_disagreement_score":0.0024338749,"about_ca_system_score_codex":0.00053092255,"about_ca_system_score_gemma":0.00066608214,"threshold_uncertainty_score":0.008142114},"labels":[],"label_agreement":null},{"id":"W2962904108","doi":"10.1609/aaai.v32i1.11865","title":"Adversarial Network Embedding","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Functional Brain Connectivity Studies","field":"Neuroscience","cited_by":201,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Hong Kong Polytechnic University","keywords":"Computer science; Embedding; Feature learning; Exploit; Artificial intelligence; Robustness (evolution); Adversarial system; Machine learning; Component (thermodynamics); ENCODE; Prior probability; Theoretical computer science; Representation (politics); Graph","score_opus":0.11751862446602658,"score_gpt":0.3243730060555998,"score_spread":0.20685438158957326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962904108","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.0064488766,0.0003377309,0.98898447,0.00034612595,0.00006938732,0.000051017705,0.0002397789,0.00038492508,0.0031376441],"genre_scores_gemma":[0.707963,0.0012602911,0.2665382,0.00070803746,0.00032142524,0.000655005,0.0021201752,0.00034309417,0.020090776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916184,0.000338975,0.000031114887,0.00020246777,0.00018199079,0.00008360155],"domain_scores_gemma":[0.9976554,0.0016137403,0.00018883446,0.00026309592,0.00020215113,0.00007672001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001350477,0.0018092522,0.0012473613,0.0009963665,0.00044101343,0.0009384142,0.0017284079,0.001703856,0.0047150897],"category_scores_gemma":[0.0053050215,0.0005037236,0.00097275886,0.000814504,0.0012537177,0.0016108097,0.0021963343,0.0027993491,0.0010202617],"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.000041074334,0.000023920431,0.00035965495,0.00005508049,0.000041326857,0.00006840309,0.000031873187,0.92765355,0.0008664151,0.038348343,0.0032603114,0.029250057],"study_design_scores_gemma":[0.0000023723126,0.000006281601,0.000037186477,0.000004564313,0.000003341049,0.000014111179,0.000002671848,0.98774815,0.0001862968,0.011352084,0.0006396628,0.0000032420876],"about_ca_topic_score_codex":0.0027175897,"about_ca_topic_score_gemma":0.0028772713,"teacher_disagreement_score":0.0047150897,"about_ca_system_score_codex":0.001164884,"about_ca_system_score_gemma":0.0007591014,"threshold_uncertainty_score":0.015773535},"labels":[],"label_agreement":null},{"id":"W2963062932","doi":"10.1609/aaai.v30i1.10475","title":"SentiCap: Generating Image Descriptions with Sentiments","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Multimodal Machine Learning Applications","field":"Computer Science","cited_by":214,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Australian Research Council; Instituto de Ciencias del Mar y Limnología, Universidad Nacional Autónoma de México; Australian Government; Institute for Catastrophic Loss Reduction; Nvidia","keywords":"Closed captioning; Computer science; Natural language processing; Stylized fact; Artificial intelligence; Image (mathematics); Vocabulary; Sentiment analysis; Regularization (linguistics); Quality (philosophy); Linguistics","score_opus":0.05085603367949731,"score_gpt":0.29375943901469953,"score_spread":0.24290340533520222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963062932","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.06870779,0.0013044303,0.77285355,0.000977938,0.0009836159,0.0014596622,0.012872718,0.11979798,0.021042356],"genre_scores_gemma":[0.28951946,0.000801025,0.6551006,0.00061843544,0.00030382484,0.0012256484,0.031605527,0.005731046,0.01509449],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99944645,0.00017730422,0.00003400127,0.000121554265,0.00018412631,0.00003670325],"domain_scores_gemma":[0.9985885,0.0005369618,0.00010567865,0.00025086413,0.00045516388,0.00006274948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001048335,0.0018448462,0.0004621265,0.0014673553,0.0004114996,0.0010299069,0.0013134918,0.0012080185,0.010776045],"category_scores_gemma":[0.004670191,0.00048797805,0.0010834098,0.0007523642,0.00042927722,0.0015826494,0.0012547754,0.0010296734,0.0043313005],"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.0009490997,0.00048153935,0.0026873713,0.0021589485,0.00037130542,0.0010922373,0.0011746145,0.058912404,0.10761227,0.011253965,0.22802015,0.58528614],"study_design_scores_gemma":[0.00008880949,0.00031307453,0.0019413675,0.00009349947,0.000077149896,0.00041365466,0.00026990435,0.86598986,0.058908515,0.011883581,0.059922546,0.00009804838],"about_ca_topic_score_codex":0.0018368092,"about_ca_topic_score_gemma":0.0025554406,"teacher_disagreement_score":0.010776045,"about_ca_system_score_codex":0.000664828,"about_ca_system_score_gemma":0.00036674005,"threshold_uncertainty_score":0.036049426},"labels":[],"label_agreement":null},{"id":"W2963097726","doi":"10.1609/aaai.v33i01.33014384","title":"The Utility of Sparse Representations for Control in Reinforcement Learning","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Reinforcement learning; Sparse approximation; Computer science; Neural coding; Bootstrapping (finance); Artificial intelligence; Representation (politics); Machine learning; Artificial neural network; Locality; Mathematics","score_opus":0.06591031971543576,"score_gpt":0.3089931647799222,"score_spread":0.24308284506448646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963097726","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.013887132,0.00020694279,0.9828636,0.0005426632,0.00003160598,0.000035034212,0.000029035356,0.00009669245,0.002307247],"genre_scores_gemma":[0.8551536,0.00049197447,0.14118366,0.00038403284,0.00012891821,0.00019405829,0.00006512964,0.0000676764,0.002330898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989793,0.000507112,0.000046051722,0.00016518074,0.00021211893,0.00009024705],"domain_scores_gemma":[0.9930421,0.005407297,0.0004770858,0.0005513339,0.00034296935,0.00017921028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025749907,0.0007978194,0.0009166682,0.0004942686,0.00042845833,0.0011940502,0.0010785131,0.0012988268,0.0021725781],"category_scores_gemma":[0.01558663,0.00041238024,0.00063486956,0.00049094885,0.0025542304,0.0027879395,0.0014939401,0.0027479657,0.00027064708],"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.00010732662,0.00008588642,0.00070964306,0.00012713714,0.0000389486,0.00008694277,0.00015420582,0.6488802,0.0025968386,0.3052908,0.00090151204,0.041020643],"study_design_scores_gemma":[0.000014177014,0.000063716274,0.000053588312,0.000011187979,0.00000550539,0.000013118336,0.000007717714,0.91054195,0.00049549347,0.08841015,0.00037584428,0.000007458019],"about_ca_topic_score_codex":0.0017873199,"about_ca_topic_score_gemma":0.001221239,"teacher_disagreement_score":0.0025749907,"about_ca_system_score_codex":0.00094523444,"about_ca_system_score_gemma":0.0008674151,"threshold_uncertainty_score":0.013618052},"labels":[],"label_agreement":null},{"id":"W2963172229","doi":"10.1609/aaai.v33i01.33016762","title":"Contextualized Non-Local Neural Networks for Sequence Learning","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Science and Technology Commission of Shanghai Municipality; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Interpretability; Computer science; Artificial intelligence; Leverage (statistics); Artificial neural network; Sentence; Machine learning; Sequence learning; Transformer; Natural language processing","score_opus":0.09166343411648817,"score_gpt":0.31093158964930734,"score_spread":0.21926815553281917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963172229","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.0077188383,0.0010527109,0.9887905,0.00023687114,0.000043171596,0.000030010542,0.00015843255,0.0009475252,0.0010219107],"genre_scores_gemma":[0.5728072,0.0020326104,0.41682658,0.00044810557,0.0002613201,0.00035845026,0.0013106134,0.00027951007,0.0056757196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953806,0.00016540938,0.000023908831,0.00016632843,0.000071786955,0.000034565182],"domain_scores_gemma":[0.9990741,0.0005275928,0.00008632776,0.00014855638,0.00012720523,0.000036221416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089664455,0.00083108386,0.0007821267,0.0008723526,0.00031716633,0.00059026893,0.0014819814,0.0010099361,0.0032473],"category_scores_gemma":[0.0033066815,0.00040847823,0.0006150447,0.0012578795,0.0006447702,0.0018747939,0.0009053024,0.0016387617,0.00082988176],"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.00014917142,0.00008649911,0.0008313332,0.00022373644,0.00010671369,0.00013661469,0.00012962673,0.7261063,0.0058028414,0.05202677,0.0036092703,0.21079113],"study_design_scores_gemma":[0.0000036420533,0.0000177869,0.000087102475,0.0000063098146,0.0000066325742,0.000010140385,0.000004719815,0.9747354,0.0005168628,0.023879444,0.0007271992,0.000004782538],"about_ca_topic_score_codex":0.0061133546,"about_ca_topic_score_gemma":0.010377844,"teacher_disagreement_score":0.0061133546,"about_ca_system_score_codex":0.0010575046,"about_ca_system_score_gemma":0.0007011627,"threshold_uncertainty_score":0.012155533},"labels":[],"label_agreement":null},{"id":"W2963388106","doi":"10.1609/aaai.v33i01.33015797","title":"QUOTA: The Quantile Option Architecture for Reinforcement Learning","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","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":"University of Alberta","funders":"","keywords":"Quantile; Reinforcement learning; Architecture; Computer science; Optimism; Value (mathematics); Artificial intelligence; Econometrics; Machine learning; Economics; Psychology","score_opus":0.05244733210608453,"score_gpt":0.2880631182674069,"score_spread":0.23561578616132234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963388106","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.012469952,0.00033118442,0.9828524,0.00035371174,0.00007661223,0.000050364233,0.00004914277,0.0006704391,0.0031461485],"genre_scores_gemma":[0.8616918,0.00034334694,0.13284807,0.0003169359,0.000072982824,0.00023864512,0.000108736225,0.00012958638,0.0042500133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999337,0.00027986683,0.000034265333,0.000118438555,0.00015476909,0.000075640215],"domain_scores_gemma":[0.99891686,0.0005653277,0.000085142696,0.0001286924,0.00019389283,0.00011008432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016729366,0.000687212,0.0009121712,0.0003510092,0.0004076825,0.00112451,0.0016724118,0.0009906929,0.0065372856],"category_scores_gemma":[0.004551687,0.00036206105,0.00046466946,0.00042295197,0.0011653906,0.0018061883,0.0016494934,0.002009379,0.00077079434],"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.00029257053,0.00013231846,0.0012948766,0.00012474868,0.00008845281,0.00009812408,0.00012702367,0.7556628,0.0030874792,0.1163745,0.0025941334,0.120122984],"study_design_scores_gemma":[0.000020749974,0.000046549,0.000074698015,0.000008611348,0.0000073571046,0.0000141383825,0.0000055282285,0.96073836,0.00039740873,0.03771995,0.0009589583,0.000007670334],"about_ca_topic_score_codex":0.0022950189,"about_ca_topic_score_gemma":0.0021415611,"teacher_disagreement_score":0.0065372856,"about_ca_system_score_codex":0.0008151458,"about_ca_system_score_gemma":0.0010724963,"threshold_uncertainty_score":0.021869421},"labels":[],"label_agreement":null},{"id":"W2963430540","doi":"10.1609/aaai.v33i01.33015789","title":"ACE: An Actor Ensemble Algorithm for Continuous Control with Tree Search","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Reinforcement learning; Ensemble learning; Search tree; Computer science; Perspective (graphical); Tree (set theory); Control (management); Artificial intelligence; Value (mathematics); Machine learning; Search algorithm; Ensemble forecasting; Mathematical optimization; Algorithm; Mathematics","score_opus":0.048752940312597276,"score_gpt":0.28943699690266234,"score_spread":0.24068405659006506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963430540","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.0038089545,0.00018096258,0.9943263,0.00006667293,0.000033910866,0.000025463205,0.000020741318,0.00034202478,0.0011950716],"genre_scores_gemma":[0.47477204,0.00031216137,0.5196019,0.0002777235,0.00010563435,0.0003652769,0.00021573753,0.00026287214,0.0040867003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952626,0.00015205788,0.000023824903,0.00009821248,0.00014190734,0.000057767036],"domain_scores_gemma":[0.9989931,0.0006457747,0.0000709913,0.00007511209,0.00015276861,0.000062237035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013085029,0.00090444024,0.0014423103,0.00059364195,0.0004169865,0.00070431264,0.0013557199,0.0012894007,0.0032222376],"category_scores_gemma":[0.0027414763,0.00045742447,0.0006004969,0.00054090435,0.0006718455,0.0010751786,0.0012676688,0.0017606263,0.00067035534],"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.00007624582,0.00003499321,0.00036467027,0.00004287212,0.000056592606,0.000037148508,0.00004302588,0.9001227,0.00095939013,0.012317141,0.0014459217,0.08449926],"study_design_scores_gemma":[0.000005287057,0.000014155861,0.000018232024,0.0000031331258,0.0000028850798,0.0000051818442,0.0000017169422,0.9976222,0.00011455291,0.0018905558,0.0003198601,0.000002192943],"about_ca_topic_score_codex":0.0038300082,"about_ca_topic_score_gemma":0.0036386964,"teacher_disagreement_score":0.0038300082,"about_ca_system_score_codex":0.0005468339,"about_ca_system_score_gemma":0.000998823,"threshold_uncertainty_score":0.01077944},"labels":[],"label_agreement":null},{"id":"W2963456618","doi":"10.1609/aaai.v33i01.33015829","title":"Bayesian Graph Convolutional Neural Networks for Semi-Supervised Classification","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":191,"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; Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Artificial intelligence; Convolutional neural network; Graph; Inference; Machine learning; Theoretical computer science; Random graph; Graphical model; Spurious relationship; Bayesian probability; Pattern recognition (psychology)","score_opus":0.07611389153592427,"score_gpt":0.2874026157032265,"score_spread":0.21128872416730224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963456618","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.0041403137,0.00045966712,0.99342716,0.0002310439,0.000025023612,0.000040877614,0.00018773672,0.00084062445,0.0006475919],"genre_scores_gemma":[0.40511838,0.0012431119,0.5842627,0.0004118604,0.00021522075,0.00049074774,0.0021531982,0.0003721617,0.0057325657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983065,0.00071986584,0.00008877004,0.00034003146,0.000431183,0.00011368356],"domain_scores_gemma":[0.9953589,0.0028359848,0.0004736124,0.0005800936,0.00063241797,0.00011909782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028926148,0.000944512,0.0013684917,0.0018184892,0.00053291814,0.000955736,0.0024551828,0.0016515448,0.0023705335],"category_scores_gemma":[0.009018076,0.00090640894,0.00094447366,0.0019539236,0.0011059078,0.0018729799,0.001319546,0.0022878773,0.0009986331],"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.000119518256,0.00010185404,0.0009574953,0.00016365385,0.0001327313,0.000050778406,0.000090687594,0.73307204,0.0015716577,0.05081644,0.0048694164,0.20805368],"study_design_scores_gemma":[0.0000025589661,0.0000040412056,0.00008120493,0.000004903738,0.0000028452907,0.000004264653,0.000001934747,0.98244506,0.00016805269,0.016942924,0.00033840263,0.0000038847147],"about_ca_topic_score_codex":0.013411197,"about_ca_topic_score_gemma":0.02090988,"teacher_disagreement_score":0.013411197,"about_ca_system_score_codex":0.002435313,"about_ca_system_score_gemma":0.00205429,"threshold_uncertainty_score":0.026666284},"labels":[],"label_agreement":null},{"id":"W2963462769","doi":"10.1609/aaai.v32i1.12146","title":"Generative Adversarial Networks and Probabilistic Graph Models for Hyperspectral Image Classification","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Remote-Sensing Image Classification","field":"Engineering","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":"Hyperspectral imaging; Pattern recognition (psychology); Computer science; Discriminative model; Artificial intelligence; Probabilistic logic; Discriminator; Machine learning","score_opus":0.08009929386753985,"score_gpt":0.28090356263237165,"score_spread":0.20080426876483182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963462769","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.011920516,0.0004942212,0.9850662,0.0004816289,0.000039009246,0.000027347145,0.00013043893,0.00050992944,0.001330731],"genre_scores_gemma":[0.7956619,0.0009846587,0.19484423,0.0005113017,0.00020739269,0.00022118921,0.0009884221,0.00021197382,0.0063688313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993279,0.00029992085,0.000021371274,0.00015628261,0.00013503133,0.000059637652],"domain_scores_gemma":[0.99748284,0.0018892888,0.00021974703,0.00019078537,0.00015255727,0.0000647672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001452196,0.0010740147,0.0009082145,0.0008807674,0.00032308887,0.00074342865,0.0014354502,0.00096420816,0.0016560678],"category_scores_gemma":[0.0037941441,0.0005542154,0.00091928,0.0009251023,0.0011777355,0.0011891202,0.0012999492,0.002664836,0.00041900255],"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.000026833512,0.00002168539,0.00030595905,0.000020748324,0.000025700123,0.000030044654,0.000025065548,0.97095484,0.00047328472,0.012188742,0.00084936037,0.0150777595],"study_design_scores_gemma":[0.000001070264,0.0000026274877,0.000036354566,0.0000016575467,0.0000014388894,0.00000389093,0.0000011573308,0.99344057,0.000096053576,0.006310851,0.000102276,0.0000019862696],"about_ca_topic_score_codex":0.004642093,"about_ca_topic_score_gemma":0.0050685327,"teacher_disagreement_score":0.004642093,"about_ca_system_score_codex":0.0012830988,"about_ca_system_score_gemma":0.0005294883,"threshold_uncertainty_score":0.00930953},"labels":[],"label_agreement":null},{"id":"W2963615308","doi":"10.1609/aaai.v33i01.3301232","title":"Multi-Perspective Relevance Matching with Hierarchical ConvNets for Social Media Search","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","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 Waterloo","funders":"","keywords":"Computer science; Ranking (information retrieval); Social media; Relevance (law); Microblogging; Information retrieval; Convolutional neural network; Phrase; Artificial intelligence; Artificial neural network; Feature (linguistics); Matching (statistics); World Wide Web","score_opus":0.10936196247753777,"score_gpt":0.3302808550666266,"score_spread":0.2209188925890888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963615308","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.12813069,0.0032327427,0.8477129,0.001121153,0.00018360185,0.00022623639,0.0012714752,0.0073721074,0.010749184],"genre_scores_gemma":[0.88020414,0.00057208055,0.10437625,0.00039823464,0.00016605007,0.0001410456,0.0013883964,0.00020342415,0.012550324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996581,0.000074957796,0.000017850858,0.000090835005,0.000077479686,0.00008076337],"domain_scores_gemma":[0.9996265,0.0001308784,0.00006441879,0.000062031875,0.00008328201,0.000032823074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006987852,0.00089741155,0.001013501,0.0012063622,0.00040699053,0.00079297007,0.001726041,0.0012592167,0.0033873518],"category_scores_gemma":[0.0021397227,0.0004860652,0.00085779035,0.0013088599,0.00040867744,0.0020864925,0.0009142516,0.0010286847,0.0013781689],"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.000525386,0.00038116865,0.0029422313,0.00025907764,0.00023489424,0.0002736793,0.00014381374,0.54191506,0.008221532,0.022791568,0.015214653,0.407097],"study_design_scores_gemma":[0.000008855729,0.000028343444,0.000163018,0.0000042490537,0.000010530541,0.000017653676,0.000006632129,0.9928127,0.00053232146,0.0059863725,0.00042453682,0.000004714168],"about_ca_topic_score_codex":0.015161128,"about_ca_topic_score_gemma":0.025429888,"teacher_disagreement_score":0.015161128,"about_ca_system_score_codex":0.0014768428,"about_ca_system_score_gemma":0.0009884344,"threshold_uncertainty_score":0.030145764},"labels":[],"label_agreement":null},{"id":"W2963814513","doi":"10.1609/aaai.v33i01.33018545","title":"Self-Supervised Video Representation Learning with Space-Time Cubic Puzzles","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":344,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science; Artificial intelligence; Representation (politics); Task (project management); Relation (database); Pattern recognition (psychology); Feature learning; Inpainting; Deep learning; Domain (mathematical analysis); Space (punctuation); Machine learning; Image (mathematics); Computer vision; Mathematics; Data mining","score_opus":0.03845464712294914,"score_gpt":0.2635565649297661,"score_spread":0.22510191780681696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963814513","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.13801166,0.0007199129,0.8515934,0.00050492847,0.00014537336,0.00015248108,0.0007365421,0.005379564,0.002756063],"genre_scores_gemma":[0.78044045,0.00029873912,0.20880345,0.000453804,0.00013473218,0.00018425418,0.00421562,0.00028546446,0.005183457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994747,0.00009770575,0.000025463094,0.00024407844,0.00008131593,0.00007681076],"domain_scores_gemma":[0.99895644,0.00027826085,0.0001582878,0.0003184926,0.00020977607,0.00007872907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082797854,0.0012634209,0.0011342198,0.0007698412,0.00036882074,0.0007401021,0.0022774183,0.0014192963,0.0018898058],"category_scores_gemma":[0.002460857,0.00056077435,0.0009999294,0.00091798895,0.0006992442,0.0019189753,0.0011261035,0.0017440751,0.0007081379],"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.00037516007,0.00034722884,0.002771727,0.00016288729,0.00013293585,0.00019096065,0.00014556963,0.4907266,0.016620811,0.0046875114,0.013987169,0.46985152],"study_design_scores_gemma":[0.000007990906,0.000027557862,0.00012575544,0.0000028191678,0.0000035745281,0.000018961151,0.0000070669635,0.9971898,0.0012173173,0.0011227331,0.00027302952,0.0000033867036],"about_ca_topic_score_codex":0.0066356855,"about_ca_topic_score_gemma":0.007881884,"teacher_disagreement_score":0.0066356855,"about_ca_system_score_codex":0.0009983581,"about_ca_system_score_gemma":0.0008683731,"threshold_uncertainty_score":0.013194144},"labels":[],"label_agreement":null},{"id":"W2963885834","doi":"10.1609/aaai.v32i1.11299","title":"TIMERS: Error-Bounded SVD Restart on Dynamic Networks","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":93,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Tencent","keywords":"Singular value decomposition; Computer science; Margin (machine learning); Reset (finance); Algorithm; Bounded function; Dynamic network analysis; Singular value; Upper and lower bounds; Process (computing); Mathematical optimization; Mathematics; Machine learning","score_opus":0.06146482267875695,"score_gpt":0.31123523603661013,"score_spread":0.2497704133578532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963885834","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.016979016,0.00038917278,0.97787535,0.00013669135,0.00009625603,0.00008121573,0.0000898683,0.003456313,0.0008961741],"genre_scores_gemma":[0.47021547,0.00047176683,0.52337426,0.00028766316,0.00014027553,0.00025644602,0.0008805632,0.0007790729,0.0035943617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981736,0.00034161189,0.00015215829,0.00043082473,0.00072915363,0.00017257847],"domain_scores_gemma":[0.99546283,0.0018967391,0.0005147804,0.00092833565,0.0009661213,0.0002311996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019599453,0.001812462,0.0015991932,0.0012303015,0.0008616315,0.0015414908,0.0023728802,0.0011318572,0.0018500207],"category_scores_gemma":[0.011642323,0.00067442027,0.0010542705,0.00083685666,0.0012293977,0.0025298211,0.0020251377,0.0021605613,0.0008125807],"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.0007244874,0.00017570147,0.0029726564,0.00022799127,0.00012648907,0.00034698335,0.00030488675,0.52903837,0.0219413,0.011452779,0.0072575286,0.42543086],"study_design_scores_gemma":[0.000012767142,0.000039368606,0.00013424462,0.0000092101955,0.000010132422,0.00004681732,0.000022144737,0.9927585,0.0041001732,0.0021897736,0.0006671102,0.000009698439],"about_ca_topic_score_codex":0.006376291,"about_ca_topic_score_gemma":0.0072953636,"teacher_disagreement_score":0.006376291,"about_ca_system_score_codex":0.00091080077,"about_ca_system_score_gemma":0.0015187793,"threshold_uncertainty_score":0.012678385},"labels":[],"label_agreement":null},{"id":"W2963995608","doi":"10.1609/aaai.v33i01.33011303","title":"Cognitive Deficit of Deep Learning in Numerosity","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Cognitive and developmental aspects of mathematical skills","field":"Mathematics","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":"McMaster University","funders":"","keywords":"Numerosity adaptation effect; Cognition; Number sense; Artificial intelligence; Cognitive psychology; Black box; Computer science; Task (project management); Numerical cognition; Cognitive science; Psychology; Neuroscience","score_opus":0.07226652101280862,"score_gpt":0.3199975851005814,"score_spread":0.2477310640877728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963995608","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.9577519,0.00035841833,0.016702827,0.003317581,0.000121221696,0.000050350696,0.0007969563,0.0009011745,0.019999519],"genre_scores_gemma":[0.9904993,0.00016533582,0.0055106846,0.0005289581,0.000022030821,0.000038218364,0.00025153044,0.00007270972,0.0029111668],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999131,0.000090308895,0.00007720243,0.00023935991,0.00036875185,0.0000933664],"domain_scores_gemma":[0.9950275,0.002056871,0.00095252035,0.0009813105,0.0004239973,0.00055782846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012665078,0.0013249171,0.0005593749,0.0014428378,0.00026358364,0.001301892,0.0008365374,0.00077147264,0.008005706],"category_scores_gemma":[0.009170779,0.00022652614,0.00032172812,0.00034098982,0.0032386372,0.0029106876,0.0019401218,0.002736273,0.0005617611],"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.0030627672,0.0023983612,0.117335446,0.001533597,0.00059444254,0.0102025205,0.0043428508,0.01504469,0.28115672,0.15155125,0.018633902,0.3941435],"study_design_scores_gemma":[0.00040630036,0.002087632,0.19169566,0.00044283067,0.00047849913,0.021617936,0.002505997,0.067502335,0.1795983,0.50905895,0.024377296,0.00022836443],"about_ca_topic_score_codex":0.00181233,"about_ca_topic_score_gemma":0.0010907359,"teacher_disagreement_score":0.008005706,"about_ca_system_score_codex":0.00083603454,"about_ca_system_score_gemma":0.0007742429,"threshold_uncertainty_score":0.026781738},"labels":[],"label_agreement":null},{"id":"W2964436851","doi":"10.1609/aaai.v33i01.33011853","title":"Group Fairness for the Allocation of Indivisible Goods","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Fair division; Group (periodic table); Set (abstract data type); Mathematical economics; Fairness measure; Public good; Function (biology); Computer science; Nash equilibrium; Microeconomics; Economics","score_opus":0.10217581358762721,"score_gpt":0.2747536511323003,"score_spread":0.1725778375446731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964436851","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.039633702,0.00038491105,0.94970065,0.0009271342,0.00009254438,0.00011849799,0.000082793114,0.00023020097,0.00882962],"genre_scores_gemma":[0.561318,0.00036928212,0.429027,0.00035787444,0.00012611417,0.00031176282,0.00013501938,0.0001997159,0.008155246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961116,0.0018281507,0.000108475135,0.0007630218,0.0006445482,0.00054424256],"domain_scores_gemma":[0.99503773,0.0031559742,0.0004316689,0.0008273587,0.00027684332,0.0002703717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006297975,0.0009769282,0.001470721,0.0009108359,0.0016900742,0.0030901488,0.002578227,0.002167686,0.006037178],"category_scores_gemma":[0.014366257,0.0005194026,0.00123406,0.0018206293,0.0033951728,0.0053256056,0.0022197415,0.0033715325,0.0007657975],"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.0006978883,0.00020681298,0.0009318388,0.00020377495,0.000095989904,0.00011072166,0.00054429297,0.383903,0.0030356098,0.5558587,0.0034134334,0.050997972],"study_design_scores_gemma":[0.000086954795,0.00008660844,0.00017191356,0.00002692316,0.000033316002,0.000055937708,0.00006902847,0.47334662,0.0017999316,0.5200694,0.0042342916,0.000019108831],"about_ca_topic_score_codex":0.0024939007,"about_ca_topic_score_gemma":0.002465092,"teacher_disagreement_score":0.006297975,"about_ca_system_score_codex":0.0034599428,"about_ca_system_score_gemma":0.0028746077,"threshold_uncertainty_score":0.033307254},"labels":[],"label_agreement":null},{"id":"W2964599462","doi":"10.1609/aaai.v33i01.33019955","title":"Learning Options with Interest Functions","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","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":"McGill University","funders":"","keywords":"Computer science; Task (project management); Function (biology); State space; Plan (archaeology); Space (punctuation); Architecture; State (computer science); Artificial intelligence; Theoretical computer science; Mathematics; Algorithm; Economics","score_opus":0.06783980109864947,"score_gpt":0.2736481056250446,"score_spread":0.20580830452639515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964599462","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.028210055,0.00019966968,0.96832824,0.00039805326,0.000025308475,0.000032271924,0.000045975867,0.00025929796,0.0025012193],"genre_scores_gemma":[0.8470986,0.00024161088,0.14760374,0.00017285587,0.000039592145,0.00017845894,0.00015789458,0.0001075315,0.0043997946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911207,0.000429967,0.00004131939,0.00016959586,0.00015816923,0.00008884564],"domain_scores_gemma":[0.99743974,0.001760954,0.00021053661,0.00022274835,0.00019925907,0.00016670772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021190695,0.00079081644,0.00082563004,0.0004992718,0.00035834796,0.0013730518,0.0013277549,0.0014117003,0.0023057745],"category_scores_gemma":[0.00884419,0.0006226989,0.00075584376,0.0003616416,0.001524165,0.0035774473,0.0020016094,0.0022795994,0.00041066902],"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.0001535919,0.000053095177,0.0013816694,0.00007931623,0.00006262558,0.00014142237,0.00017224293,0.8000362,0.0017087858,0.14787562,0.0012894005,0.047046088],"study_design_scores_gemma":[0.000010715893,0.000019513873,0.00008662363,0.000009543528,0.000005522459,0.000012406008,0.000011235398,0.9308272,0.00041749867,0.06812515,0.00046766616,0.00000699117],"about_ca_topic_score_codex":0.0016375515,"about_ca_topic_score_gemma":0.0018080858,"teacher_disagreement_score":0.0023057745,"about_ca_system_score_codex":0.0010056951,"about_ca_system_score_gemma":0.0008866594,"threshold_uncertainty_score":0.011206806},"labels":[],"label_agreement":null},{"id":"W2964755937","doi":"10.1609/aaai.v33i01.33019748","title":"Predicting Unsolvable Deals in the Birds of a Feather Solitaire Game","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI 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":"Quest University Canada","funders":"","keywords":"Adjacency matrix; Feather; Computer science; Binary number; Graph; Adjacency list; Combinatorics; Theoretical computer science; Artificial intelligence; Mathematics; Algorithm; Arithmetic; Zoology; Biology","score_opus":0.06224596502994323,"score_gpt":0.3009733816748913,"score_spread":0.23872741664494807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964755937","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.99660975,0.000050967796,0.0025599273,0.00005630903,0.000006273354,0.000016896189,0.00021156878,0.000021241294,0.00046701665],"genre_scores_gemma":[0.9973974,0.000023942233,0.0016722219,0.000016630313,0.000005563804,0.00001004129,0.0005507155,0.000006782947,0.00031657127],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962175,0.00012419606,0.000023871326,0.00007832206,0.0000886809,0.00006319415],"domain_scores_gemma":[0.9944259,0.003556836,0.0010765762,0.00015672138,0.0003179796,0.00046598396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000766023,0.0005094077,0.00028860781,0.0014772888,0.00033735138,0.00080747163,0.00047782745,0.0006680733,0.0014211716],"category_scores_gemma":[0.005864065,0.00017591777,0.00032966177,0.0005896543,0.00041800598,0.001011301,0.00036380018,0.0008663854,0.0004506353],"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.0011220531,0.0006755125,0.8868262,0.00007632505,0.00018524335,0.00034350646,0.00040042642,0.07122235,0.0030580417,0.0013477133,0.0019920883,0.03275062],"study_design_scores_gemma":[0.000045074194,0.00030789257,0.41838443,0.000029961011,0.000049563267,0.00023904217,0.0006660517,0.5734579,0.0020467665,0.0033559396,0.0013793932,0.000037969236],"about_ca_topic_score_codex":0.006548981,"about_ca_topic_score_gemma":0.011685216,"teacher_disagreement_score":0.006548981,"about_ca_system_score_codex":0.00041661123,"about_ca_system_score_gemma":0.00022026441,"threshold_uncertainty_score":0.013021708},"labels":[],"label_agreement":null},{"id":"W2964993916","doi":"10.1609/aaai.v33i01.33019648","title":"Computational Intractability and Solvability for the Birds of a Feather Game","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","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":"Quest University Canada","funders":"","keywords":"Testbed; Feather; Graph; Computer science; Theoretical computer science; Game theory; Mathematical economics; Discrete mathematics; Mathematics; Zoology; World Wide Web; Biology","score_opus":0.06356466278561955,"score_gpt":0.3092906926676545,"score_spread":0.24572602988203496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964993916","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.63737875,0.00058937795,0.31747854,0.0065740114,0.00014733255,0.00042219073,0.0015075648,0.00091352314,0.034988593],"genre_scores_gemma":[0.90274954,0.000328339,0.088324726,0.00052819785,0.00018685308,0.0003759478,0.0013079058,0.00024464753,0.005953895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979481,0.0006626989,0.000085021034,0.00047815626,0.00038492394,0.0004410747],"domain_scores_gemma":[0.9779034,0.019435067,0.0009253742,0.00085989403,0.00044634333,0.00042993372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015128786,0.0010093984,0.001034623,0.0008938807,0.0019556892,0.003070282,0.0017671654,0.0015438293,0.008765956],"category_scores_gemma":[0.014355344,0.00058858015,0.00216494,0.00090430805,0.0037952035,0.0050746077,0.0020933193,0.0036294986,0.0005238104],"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.0011523464,0.0007663796,0.009693518,0.0010532831,0.0003947814,0.0008472506,0.002044518,0.4350052,0.007653516,0.48483133,0.01437456,0.04218335],"study_design_scores_gemma":[0.00020756686,0.000101804566,0.001127615,0.000039524934,0.0000821569,0.00017398455,0.00034444328,0.49764106,0.0023100318,0.49489626,0.0030412802,0.000034258737],"about_ca_topic_score_codex":0.004837153,"about_ca_topic_score_gemma":0.006136254,"teacher_disagreement_score":0.008765956,"about_ca_system_score_codex":0.0018088225,"about_ca_system_score_gemma":0.002396431,"threshold_uncertainty_score":0.029325068},"labels":[],"label_agreement":null},{"id":"W2965216507","doi":"10.1609/aaai.v33i01.33019957","title":"Variational BEJG Solvers for Marginal-MAP Inference with Accurate Approximation of B-Conditional Entropy","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","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 Waterloo","funders":"","keywords":"Inference; Graphical model; Approximate inference; Computer science; Belief propagation; Variable elimination; Probabilistic logic; Mathematical optimization; Principle of maximum entropy; Algorithm; Artificial intelligence; Machine learning; Mathematics","score_opus":0.03291802856887852,"score_gpt":0.2828693483141397,"score_spread":0.24995131974526116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965216507","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.0024024332,0.0001833322,0.99486166,0.0002548201,0.00003318364,0.000042519456,0.0000993518,0.00038890232,0.0017337368],"genre_scores_gemma":[0.27096716,0.0004546742,0.72070533,0.00060455996,0.00013687229,0.0005379561,0.0007528062,0.0009580625,0.004882562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904805,0.00034494852,0.000053656833,0.00019305604,0.00023883088,0.000121381425],"domain_scores_gemma":[0.99506277,0.003840051,0.0001960771,0.00030708688,0.00041211286,0.00018191675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027389938,0.0015979998,0.002165488,0.0009932664,0.00077930593,0.0020668507,0.003063114,0.0024064002,0.007056151],"category_scores_gemma":[0.010485088,0.0012981904,0.0018059234,0.0013225469,0.0016046016,0.0017091777,0.003218982,0.004704193,0.0010407344],"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.000040778476,0.000032099986,0.00041084824,0.00009982389,0.000050727715,0.000056826484,0.00006877422,0.9248056,0.00036517336,0.048467062,0.00198748,0.023614885],"study_design_scores_gemma":[0.0000053842564,0.0000025460824,0.000016619573,0.0000061644027,0.0000028061822,0.0000046649184,0.000005138512,0.9868203,0.000079064805,0.012753563,0.00030164456,0.0000020770592],"about_ca_topic_score_codex":0.019604616,"about_ca_topic_score_gemma":0.022602655,"teacher_disagreement_score":0.019604616,"about_ca_system_score_codex":0.0024034737,"about_ca_system_score_gemma":0.0047570756,"threshold_uncertainty_score":0.03898102},"labels":[],"label_agreement":null},{"id":"W2965407014","doi":"10.1609/aaai.v33i01.33019886","title":"Counterfactual Reasoning in Observational Studies","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI 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":"University of Alberta","funders":"","keywords":"Counterfactual thinking; Observational study; Action (physics); Focus (optics); Causal inference; Population; Computer science; Psychology; Management science; Cognitive psychology; Risk analysis (engineering); Medicine; Social psychology; Econometrics; Economics","score_opus":0.2059506527187002,"score_gpt":0.352009713556374,"score_spread":0.1460590608376738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965407014","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.008683749,0.016507056,0.93982327,0.019666411,0.0014598325,0.0010303409,0.0005889522,0.00026249746,0.0119778775],"genre_scores_gemma":[0.2778516,0.0069725844,0.69880426,0.0065427576,0.0026518847,0.004705195,0.0006516646,0.00009849343,0.0017214664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.65362746,0.31080127,0.009150672,0.013298278,0.011973039,0.001149236],"domain_scores_gemma":[0.20667784,0.75035846,0.014445417,0.022228343,0.0049902815,0.0012996318],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.30282548,0.00271649,0.0047890404,0.009942481,0.0036248064,0.010336252,0.008633972,0.010118015,0.008873339],"category_scores_gemma":[0.5260012,0.00270005,0.004581071,0.0082043335,0.026773222,0.015789613,0.0076594893,0.0134263225,0.0007688818],"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.00022785463,0.00008471508,0.0021156769,0.0010858783,0.00064387906,0.00043261278,0.001658716,0.012584073,0.00007723959,0.95421946,0.0024261593,0.02444376],"study_design_scores_gemma":[0.00009998439,0.000021822329,0.000195164,0.00026390006,0.00007317017,0.00006149184,0.000099868696,0.014189232,0.00007402964,0.98123413,0.0036642333,0.000022896666],"about_ca_topic_score_codex":0.008923019,"about_ca_topic_score_gemma":0.0065781106,"teacher_disagreement_score":0.30282548,"about_ca_system_score_codex":0.0068491274,"about_ca_system_score_gemma":0.006874507,"threshold_uncertainty_score":0.8597403},"labels":[],"label_agreement":null},{"id":"W2965500200","doi":"10.1609/aaai.v33i01.330110079","title":"Computing Argumentative Explanations in Bipolar Argumentation Frameworks","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","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":"BC Research (Canada)","funders":"Nanyang Technological University; National Research Foundation","keywords":"Argumentative; Argumentation theory; Focus (optics); Process (computing); Semantics (computer science); Epistemology; Computer science; Argumentation framework; Programming language; Philosophy","score_opus":0.046784827284984974,"score_gpt":0.28533225157066616,"score_spread":0.23854742428568118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965500200","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.12598257,0.00046007714,0.8669801,0.0005636265,0.00005643413,0.00012059367,0.00036116672,0.00078207545,0.0046932925],"genre_scores_gemma":[0.7076589,0.00023723263,0.29010126,0.00008043425,0.000044321332,0.0001307447,0.00063683186,0.000081325124,0.0010288974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973586,0.0011324678,0.0002397145,0.0002824896,0.00078432047,0.0002023143],"domain_scores_gemma":[0.99493766,0.0032874483,0.00049644226,0.00032179733,0.00075919554,0.00019737823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028129513,0.00081913907,0.0006750507,0.003640735,0.0010402937,0.0035320462,0.0009992832,0.0016483999,0.0028874096],"category_scores_gemma":[0.023500828,0.000583554,0.0012467603,0.0025659476,0.0013130015,0.004487221,0.0024768384,0.0011957154,0.0004078125],"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.00029668876,0.00010261292,0.004347055,0.00032800922,0.00011607889,0.00042390867,0.0013680827,0.155734,0.0029287925,0.69983417,0.0026408401,0.13187982],"study_design_scores_gemma":[0.000040475585,0.000030119776,0.00068003184,0.000052858824,0.000034408986,0.00004895365,0.00025452903,0.31121436,0.0008820864,0.6848797,0.0018575414,0.00002490363],"about_ca_topic_score_codex":0.0024038842,"about_ca_topic_score_gemma":0.004068756,"teacher_disagreement_score":0.003640735,"about_ca_system_score_codex":0.0012611739,"about_ca_system_score_gemma":0.000841044,"threshold_uncertainty_score":0.014876485},"labels":[],"label_agreement":null},{"id":"W2965513350","doi":"10.1609/aaai.v33i01.33019933","title":"CSEye: A Proposed Solution for Accurate and Accessible One-to-Many Face Verification","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Face recognition and analysis","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 Waterloo","funders":"","keywords":"Computer science; Artificial intelligence; Face (sociological concept); Task (project management); Extension (predicate logic); Suspect; Pattern recognition (psychology); Facial recognition system; Contrast (vision); Computer vision; Image (mathematics); Machine learning; Engineering","score_opus":0.09680694264324718,"score_gpt":0.31618873306938716,"score_spread":0.21938179042613998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965513350","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.004162997,0.00021929157,0.9842239,0.0002671815,0.00021901715,0.00021464113,0.000277606,0.008016378,0.002398976],"genre_scores_gemma":[0.09094741,0.00024121403,0.8974622,0.00040995592,0.0002427725,0.00026314685,0.0014832306,0.0005422494,0.008407707],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996469,0.0003505059,0.00016679677,0.0006790912,0.0020359443,0.00029867492],"domain_scores_gemma":[0.99655426,0.00031091378,0.00014268146,0.0018092124,0.0010195569,0.00016345503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023536193,0.0012693047,0.0015125925,0.0023632555,0.0012320968,0.0021009222,0.0047927625,0.0028782673,0.01357752],"category_scores_gemma":[0.006109239,0.00063810794,0.0012543668,0.0013559659,0.001110314,0.0039253957,0.006747076,0.002367564,0.008883838],"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.0006197609,0.00029867343,0.0011789316,0.0002095927,0.00010859297,0.00025916565,0.00012576744,0.01538471,0.037506014,0.03080411,0.05209646,0.8614082],"study_design_scores_gemma":[0.00015615691,0.00032840407,0.0010949537,0.0000723021,0.00008400607,0.0015330169,0.00015519132,0.851271,0.056503404,0.039863985,0.04882291,0.00011469202],"about_ca_topic_score_codex":0.0025594875,"about_ca_topic_score_gemma":0.0036661532,"teacher_disagreement_score":0.01357752,"about_ca_system_score_codex":0.00078518095,"about_ca_system_score_gemma":0.0020412868,"threshold_uncertainty_score":0.045421362},"labels":[],"label_agreement":null},{"id":"W2965584667","doi":"10.1609/aaai.v33i01.33019365","title":"Large Scale Personalized Categorization of Financial Transactions","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Stock Market Forecasting Methods","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Database transaction; Categorization; Computer science; Scale (ratio); Automation; Financial transaction; Task (project management); Chart; Accounting; Transaction data; Finance; Business; Database; Artificial intelligence; Management; Engineering; Economics","score_opus":0.13932869890057958,"score_gpt":0.38043272645355297,"score_spread":0.2411040275529734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965584667","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.7152381,0.0028088714,0.24398893,0.0015511166,0.00029461208,0.00056997617,0.010015054,0.016093293,0.009440119],"genre_scores_gemma":[0.8457599,0.0004754727,0.13790138,0.00028528363,0.00013916455,0.00012364244,0.010733174,0.00015089223,0.0044311625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987612,0.0002450651,0.00008374921,0.00038320647,0.00041854565,0.000108306594],"domain_scores_gemma":[0.99798834,0.00074114656,0.0001543337,0.0005974171,0.00042231972,0.00009645088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008116459,0.00064735505,0.0009129616,0.0025256383,0.0007040208,0.0010871984,0.00090499496,0.000806884,0.001542258],"category_scores_gemma":[0.003804657,0.0003069124,0.00048909755,0.0027451445,0.00023603653,0.0020041515,0.0007615025,0.00080696784,0.0013438156],"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.00055605645,0.00091027596,0.059699718,0.00019290869,0.00031790105,0.00050875876,0.00062316004,0.03254537,0.022162264,0.0010289705,0.02715709,0.8542975],"study_design_scores_gemma":[0.00004583813,0.00025373496,0.09589642,0.00004227138,0.00014364903,0.000641522,0.00078231783,0.85775787,0.015659256,0.009169314,0.019520506,0.00008728922],"about_ca_topic_score_codex":0.015190767,"about_ca_topic_score_gemma":0.03328279,"teacher_disagreement_score":0.015190767,"about_ca_system_score_codex":0.00065693795,"about_ca_system_score_gemma":0.0005351418,"threshold_uncertainty_score":0.030204713},"labels":[],"label_agreement":null},{"id":"W2966010467","doi":"10.1609/aaai.v33i01.33019890","title":"Learning Generalized Temporal Abstractions across Both Action and Perception","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Perception; Task (project management); Action (physics); Artificial intelligence; Key (lock); Human–computer interaction; Cognitive science; Psychology","score_opus":0.08339651864273415,"score_gpt":0.3342602207353737,"score_spread":0.25086370209263953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966010467","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.03342905,0.00031355323,0.96320677,0.00047098612,0.000037455095,0.00002814937,0.00010874227,0.00035438495,0.0020510063],"genre_scores_gemma":[0.77732265,0.0005691807,0.21675792,0.00027548464,0.00007345973,0.00010625387,0.00037205307,0.00010731766,0.0044155843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925953,0.00020845747,0.00003910507,0.00030629753,0.00010634605,0.00008029857],"domain_scores_gemma":[0.99786633,0.0010906538,0.0002809329,0.0004249534,0.00015104102,0.0001859944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015223266,0.0009084888,0.00069019507,0.0004913384,0.00037420442,0.0015732523,0.001177126,0.0009809433,0.0027863877],"category_scores_gemma":[0.0055513065,0.0006783227,0.0014435751,0.0005355523,0.0014076272,0.005766793,0.00272964,0.0024624048,0.0003619137],"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.00042569934,0.00021443427,0.005094094,0.00025074068,0.00028420976,0.00026489707,0.0009023411,0.43707258,0.01644709,0.24681768,0.0029832998,0.28924298],"study_design_scores_gemma":[0.000014413098,0.00009895483,0.00091195985,0.000026782334,0.000037799953,0.000049507176,0.00007096352,0.8578567,0.0019457686,0.13691677,0.0020496333,0.000020879897],"about_ca_topic_score_codex":0.005176755,"about_ca_topic_score_gemma":0.00558554,"teacher_disagreement_score":0.005176755,"about_ca_system_score_codex":0.0014226069,"about_ca_system_score_gemma":0.0010399162,"threshold_uncertainty_score":0.010321856},"labels":[],"label_agreement":null},{"id":"W2966085774","doi":"10.1609/aaai.v33i01.33019504","title":"Profiles, Proxies, and Assumptions: Decentralized, Communications-Resilient Planning, Allocation, and Scheduling","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Systems Engineering Methodologies and Applications","field":"Engineering","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":"Lockheed Martin (Canada)","funders":"Air Force Research Laboratory","keywords":"Computer science; Scheduling (production processes); Negotiation; Scalability; Operations research; Schedule; Subject matter; Operational planning; Distributed computing; Architecture; Operations management; Engineering; Business","score_opus":0.1011026142359156,"score_gpt":0.3148382994624773,"score_spread":0.21373568522656172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966085774","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.013959388,0.005676205,0.956563,0.0055694487,0.00030849027,0.0001872909,0.00016509145,0.0008327045,0.016738392],"genre_scores_gemma":[0.5165948,0.0065924427,0.46526876,0.0010862142,0.00038822056,0.00034039794,0.00039486212,0.00028604685,0.009048317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939659,0.0035768251,0.00026913092,0.000587581,0.0014283891,0.00017216167],"domain_scores_gemma":[0.99276394,0.0035324448,0.00086132594,0.0016094511,0.00094860676,0.00028425112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053741075,0.00054270664,0.00050870416,0.00076064636,0.0010196432,0.0025926249,0.0020001687,0.0014710341,0.0017784982],"category_scores_gemma":[0.017481238,0.00065591355,0.00044580706,0.0012737614,0.0018343044,0.0047648977,0.0019124364,0.0020035077,0.0007412074],"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.00018176055,0.00007732768,0.0014227154,0.0008021892,0.00007500147,0.00020919861,0.00093005813,0.11867187,0.0039880876,0.5577955,0.015911981,0.29993427],"study_design_scores_gemma":[0.000075064185,0.0001352673,0.0013053596,0.00053134275,0.000085720276,0.0004993929,0.0006835927,0.35757056,0.009962605,0.3895461,0.23950194,0.00010300303],"about_ca_topic_score_codex":0.004072504,"about_ca_topic_score_gemma":0.0035731788,"teacher_disagreement_score":0.0053741075,"about_ca_system_score_codex":0.0017817824,"about_ca_system_score_gemma":0.004066876,"threshold_uncertainty_score":0.028421342},"labels":[],"label_agreement":null},{"id":"W2966132766","doi":"10.1609/aaai.v33i01.33019987","title":"A Multi-Task Learning Framework for Abstractive Text Summarization","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":14,"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 Waterloo","funders":"","keywords":"Automatic summarization; Computer science; Syntax; Natural language processing; Categorization; Task (project management); Artificial intelligence; Encoder","score_opus":0.08044737931383913,"score_gpt":0.31492123089233054,"score_spread":0.2344738515784914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966132766","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.0045569357,0.0005533742,0.99011505,0.00034671105,0.00011398478,0.00012291182,0.0002913775,0.0030888051,0.00081084133],"genre_scores_gemma":[0.18572082,0.0006064523,0.800123,0.0006787547,0.000603762,0.0007970525,0.004008216,0.00048197422,0.00697991],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837613,0.00063462846,0.00010583619,0.00045464607,0.00030058512,0.0001281505],"domain_scores_gemma":[0.9980725,0.00075243245,0.00019758478,0.0003151166,0.0005222099,0.00014009082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024715355,0.0020865847,0.0014884936,0.001585217,0.000715645,0.0013816949,0.0028002947,0.0021308549,0.0038639249],"category_scores_gemma":[0.0051809466,0.00049561437,0.0014885085,0.001553275,0.00067903963,0.0036179055,0.0020992944,0.003065494,0.0028439534],"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.0004858913,0.00061373465,0.0007119018,0.000568977,0.0002470061,0.00023848975,0.00036797166,0.1739741,0.029579943,0.012146664,0.022187704,0.75887775],"study_design_scores_gemma":[0.000039859908,0.00016375339,0.00022069729,0.000015409583,0.00003812138,0.000042333,0.000044754277,0.97644275,0.0058279643,0.012823509,0.0043173484,0.000023460023],"about_ca_topic_score_codex":0.0026967342,"about_ca_topic_score_gemma":0.0039830985,"teacher_disagreement_score":0.0038639249,"about_ca_system_score_codex":0.0008779308,"about_ca_system_score_gemma":0.0013623124,"threshold_uncertainty_score":0.013070881},"labels":[],"label_agreement":null},{"id":"W2968923568","doi":"10.1609/aaai.v34i04.5712","title":"Detecting Semantic Anomalies","year":2020,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Compute Canada; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Generalization; Relevance (law); Task (project management); Context (archaeology); Anomaly detection; Set (abstract data type); Artificial intelligence; Object (grammar); Natural language processing; Machine learning; Information retrieval; Data science; Programming language; Epistemology","score_opus":0.10565315845507382,"score_gpt":0.3098998095140946,"score_spread":0.2042466510590208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968923568","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.36222044,0.0059649367,0.5902701,0.008344803,0.0012874639,0.0003014403,0.0056284117,0.009898148,0.016084224],"genre_scores_gemma":[0.8483358,0.0007998366,0.13903934,0.0010244271,0.00037401903,0.0001332513,0.007896182,0.0006714482,0.0017257289],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98864704,0.003326264,0.0007018614,0.0020626846,0.0044087777,0.0008534198],"domain_scores_gemma":[0.9570329,0.02250331,0.0028419823,0.00831295,0.008035816,0.0012729607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009735506,0.0012850607,0.0012018844,0.0054039005,0.0015376323,0.0034957328,0.0023922022,0.002256417,0.0018107668],"category_scores_gemma":[0.058977336,0.0002281092,0.0009684257,0.0046700384,0.0020458263,0.0050617633,0.004203529,0.0024241344,0.0010643192],"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.0011593133,0.000666362,0.12882695,0.0010250484,0.00035849412,0.001113481,0.0013161335,0.060917635,0.016912501,0.05904476,0.05415917,0.6745002],"study_design_scores_gemma":[0.00005935907,0.00037056496,0.041399844,0.00023424323,0.00013540819,0.0030411445,0.0017780028,0.61994874,0.046219353,0.23211949,0.054548096,0.0001458718],"about_ca_topic_score_codex":0.002793816,"about_ca_topic_score_gemma":0.0035639175,"teacher_disagreement_score":0.009735506,"about_ca_system_score_codex":0.0019242238,"about_ca_system_score_gemma":0.0016217383,"threshold_uncertainty_score":0.05148691},"labels":[],"label_agreement":null},{"id":"W2971484784","doi":"10.1609/aaai.v34i04.5784","title":"Fixed-Horizon Temporal Difference Methods for Stable Reinforcement Learning","year":2020,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Huawei Technologies (Canada); University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Vector Institute; Alberta Innovates; DeepMind","keywords":"Reinforcement learning; Bellman equation; Horizon; Temporal difference learning; Function (biology); Time horizon; Value (mathematics); Stability (learning theory); Computer science; Mathematics; Mathematical optimization; Artificial intelligence; Machine learning","score_opus":0.137803606700458,"score_gpt":0.36583601233052376,"score_spread":0.22803240563006577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971484784","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.002313752,0.00020904683,0.9959947,0.000101753016,0.00004352049,0.000018102808,0.000014014725,0.0000832907,0.001221762],"genre_scores_gemma":[0.5148572,0.00062327686,0.47777,0.00030451413,0.000103872146,0.0003541287,0.00010613056,0.00020774835,0.005673142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994004,0.00024445605,0.0000293931,0.00010512631,0.00017122581,0.000049409344],"domain_scores_gemma":[0.99714124,0.002103798,0.0002088576,0.00015068245,0.00029490096,0.00010049272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001982418,0.0008347128,0.0008894865,0.0003808095,0.0003855237,0.00094686635,0.0017546888,0.0011197525,0.003985907],"category_scores_gemma":[0.0069301175,0.00041784663,0.00065450167,0.00043591243,0.0012793556,0.0013667464,0.0013115535,0.0023018967,0.0005145989],"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.000086453685,0.000065863074,0.00047272316,0.00015072958,0.000048775622,0.000058640147,0.00008713765,0.8343075,0.0017040113,0.115035795,0.0011344836,0.046847884],"study_design_scores_gemma":[0.000008464381,0.00001550128,0.000018433153,0.000008116852,0.000003128749,0.0000060251364,0.0000026726004,0.9816613,0.00025996365,0.017441828,0.00057096774,0.0000035829096],"about_ca_topic_score_codex":0.0035379112,"about_ca_topic_score_gemma":0.0023885893,"teacher_disagreement_score":0.003985907,"about_ca_system_score_codex":0.00130499,"about_ca_system_score_gemma":0.0011450376,"threshold_uncertainty_score":0.013334215},"labels":[],"label_agreement":null},{"id":"W2977481643","doi":"10.1609/aaai.v35i12.17276","title":"Improving Sample Efficiency in Model-Free Reinforcement Learning from Images","year":2021,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":121,"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":"Reinforcement learning; Robustness (evolution); Computer science; Artificial intelligence; Stability (learning theory); Machine learning; Encoder; Representation (politics); Noise (video); Code (set theory); Image (mathematics)","score_opus":0.07127289501225326,"score_gpt":0.2836056152858242,"score_spread":0.21233272027357092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2977481643","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.04095241,0.00017984388,0.9556742,0.00031453578,0.00002435989,0.00005164371,0.00003249415,0.0010664491,0.0017041086],"genre_scores_gemma":[0.8612784,0.00009830592,0.1359755,0.00021622963,0.000028243012,0.00014765744,0.00010819449,0.00024429904,0.0019031663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991339,0.00036306467,0.00004180688,0.00018450107,0.0001717569,0.000105062405],"domain_scores_gemma":[0.9942808,0.004170848,0.0003821589,0.00065927004,0.00032221392,0.00018482201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030991547,0.0010846577,0.0015781464,0.00048731704,0.0005415608,0.0010274079,0.0019593542,0.001416929,0.0024105704],"category_scores_gemma":[0.014849336,0.0007995028,0.0005556846,0.00033335536,0.0017855836,0.00218686,0.0019454927,0.0022878,0.0004862301],"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.00022755864,0.00012965086,0.001024837,0.000085478576,0.000039371873,0.000073304655,0.00010217702,0.9321941,0.0023441722,0.016762858,0.0008702454,0.04614608],"study_design_scores_gemma":[0.000013135978,0.000022186074,0.00004434441,0.0000047138637,0.0000027149563,0.0000067879178,0.000003214012,0.99473214,0.0004665226,0.0046178848,0.000083833715,0.0000025481556],"about_ca_topic_score_codex":0.0048994436,"about_ca_topic_score_gemma":0.0049686274,"teacher_disagreement_score":0.0048994436,"about_ca_system_score_codex":0.0012486505,"about_ca_system_score_gemma":0.0016416587,"threshold_uncertainty_score":0.016390085},"labels":[],"label_agreement":null},{"id":"W2985666906","doi":"10.1609/aaai.v34i04.5724","title":"Midas: Microcluster-Based Detector of Anomalies in Edge Streams","year":2020,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Network Security and Intrusion Detection","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":"Kootenay Association for Science & Technology","funders":"","keywords":"Anomaly detection; Denial-of-service attack; Computer science; Graph; Enhanced Data Rates for GSM Evolution; Detector; Constant (computer programming); State (computer science); Anomaly (physics); Theoretical computer science; Artificial intelligence; Algorithm; Physics","score_opus":0.07525842876823527,"score_gpt":0.28124551041670137,"score_spread":0.2059870816484661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2985666906","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.25772196,0.0013997284,0.70140284,0.0006991577,0.0002828554,0.00032276742,0.0036140636,0.031936385,0.0026202896],"genre_scores_gemma":[0.7323281,0.00037074985,0.25974324,0.00024691096,0.00013301948,0.00019782079,0.003812132,0.0003083116,0.0028596267],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995322,0.00007201501,0.000032400327,0.00013989676,0.0001599374,0.000063601954],"domain_scores_gemma":[0.9981346,0.0006763606,0.0003803716,0.00024877573,0.0003982897,0.00016155142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006122546,0.0010097648,0.0010375229,0.003479196,0.0003860831,0.00090140034,0.0013537729,0.00079079124,0.0011450115],"category_scores_gemma":[0.0034217054,0.0002662224,0.00048743366,0.0015600133,0.00037537757,0.0012932318,0.00083528407,0.00084922335,0.00079832436],"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.002332648,0.00076323625,0.0815562,0.00048808748,0.00039722197,0.0010216937,0.00037842616,0.10490726,0.104821794,0.0103483,0.03476218,0.658223],"study_design_scores_gemma":[0.000024152649,0.00011136314,0.004967876,0.000009091843,0.000023669982,0.00039097227,0.00005007978,0.96903956,0.017577872,0.0049304212,0.0028533116,0.000021652648],"about_ca_topic_score_codex":0.0014848808,"about_ca_topic_score_gemma":0.00242621,"teacher_disagreement_score":0.003479196,"about_ca_system_score_codex":0.0004611953,"about_ca_system_score_gemma":0.00041584368,"threshold_uncertainty_score":0.003830433},"labels":[],"label_agreement":null},{"id":"W2987502141","doi":"10.1609/aaai.v34i04.6027","title":"Gamma-Nets: Generalizing Value Estimation over Timescale","year":2020,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates; Alberta Machine Intelligence Institute; Compute Canada","keywords":"Estimator; Reinforcement learning; Computer science; A priori and a posteriori; Bellman equation; Representation (politics); Function (biology); Value (mathematics); Artificial intelligence; Algorithm; Machine learning; Mathematical optimization; Mathematics; Statistics","score_opus":0.09424233049296664,"score_gpt":0.31212231732304635,"score_spread":0.2178799868300797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2987502141","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.022689054,0.0003960851,0.9733612,0.00040187596,0.000072147486,0.00004923847,0.00017566793,0.0012044,0.0016503222],"genre_scores_gemma":[0.74909496,0.0006920793,0.2440497,0.00054960424,0.00012787744,0.000249509,0.00062069105,0.0003590758,0.0042565414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939966,0.00015749187,0.000039053455,0.00018656183,0.00013508766,0.00008211402],"domain_scores_gemma":[0.99775106,0.0013725082,0.00026685058,0.0002253468,0.00025335455,0.0001308166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021491363,0.0015829562,0.0011112954,0.00079645164,0.00046156315,0.0012660252,0.0024697199,0.0015935161,0.00231283],"category_scores_gemma":[0.007778883,0.0008605263,0.0010128287,0.00060570205,0.0014525979,0.0034730448,0.0020500908,0.0033892775,0.00048357103],"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.00008299572,0.00003008702,0.0012644123,0.00004460598,0.000035885758,0.00005779808,0.00006400648,0.9384231,0.0009370685,0.012917353,0.0011489829,0.044993788],"study_design_scores_gemma":[0.0000050533995,0.000012197263,0.000059376413,0.0000069420203,0.000004220977,0.000006215806,0.0000044295325,0.9863127,0.00029453577,0.0130227525,0.00026770207,0.000004013421],"about_ca_topic_score_codex":0.013551806,"about_ca_topic_score_gemma":0.012117948,"teacher_disagreement_score":0.013551806,"about_ca_system_score_codex":0.0021609932,"about_ca_system_score_gemma":0.0016301576,"threshold_uncertainty_score":0.02694583},"labels":[],"label_agreement":null},{"id":"W2989640809","doi":"10.1609/aaai.v34i04.5857","title":"Algorithmic Improvements for Deep Reinforcement Learning Applied to Interactive Fiction","year":2020,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Compute Canada; Canadian Institute for Advanced Research","keywords":"Reinforcement learning; Observability; Computer science; Artificial intelligence; Action (physics); Function (biology); Domain (mathematical analysis); Baseline (sea); Point (geometry); Machine learning; Mathematics","score_opus":0.0794015375588785,"score_gpt":0.32264253964009265,"score_spread":0.24324100208121416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989640809","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.013517591,0.00021729936,0.98031235,0.00041972598,0.00006925251,0.00012454756,0.000036009093,0.0007465945,0.0045565907],"genre_scores_gemma":[0.56917864,0.0002481538,0.4246893,0.0002930435,0.000101548845,0.00045411187,0.00014537448,0.00018317933,0.0047066784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883825,0.0004127648,0.00006722549,0.00024244477,0.00030961997,0.0001296788],"domain_scores_gemma":[0.9970818,0.0018694327,0.00018900329,0.00034768827,0.00035355953,0.00015840308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025704487,0.001166819,0.0009732336,0.0005380926,0.00061474723,0.0010891015,0.0021981217,0.0015301468,0.0062196767],"category_scores_gemma":[0.009751167,0.00053999975,0.00063623366,0.0004134769,0.0013729556,0.0016126581,0.0025592356,0.002979898,0.0008392288],"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.00014015632,0.00023251493,0.0010489763,0.0001270736,0.00004420944,0.00006518346,0.00010938718,0.81168586,0.0022943432,0.04914522,0.001997116,0.13310996],"study_design_scores_gemma":[0.000020760806,0.000037033304,0.000046645935,0.000006809697,0.0000042541064,0.00000793398,0.000005155713,0.9884821,0.0003189949,0.010487483,0.0005796918,0.0000031852976],"about_ca_topic_score_codex":0.0054432154,"about_ca_topic_score_gemma":0.0069605685,"teacher_disagreement_score":0.0062196767,"about_ca_system_score_codex":0.0019099313,"about_ca_system_score_gemma":0.0023909041,"threshold_uncertainty_score":0.020806909},"labels":[],"label_agreement":null},{"id":"W2989651853","doi":"10.1609/aaai.v34i04.5793","title":"On the Discrepancy between the Theoretical Analysis and Practical Implementations of Compressed Communication for Distributed Deep Learning","year":2020,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science; Implementation; Compression (physics); Quantization (signal processing); Convergence (economics); Compression ratio; Rate of convergence; Data compression; Bounded function; Algorithm; Data compression ratio; Upper and lower bounds; Artificial intelligence; Theoretical computer science; Image compression; Mathematics; Telecommunications; Engineering; Image processing; Channel (broadcasting)","score_opus":0.11402986330989107,"score_gpt":0.3676228565956723,"score_spread":0.2535929932857812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989651853","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.021270037,0.014315196,0.923121,0.01680991,0.0007006527,0.00012700031,0.00022630735,0.0009908502,0.022438988],"genre_scores_gemma":[0.6478566,0.021207878,0.31234473,0.0055848905,0.0028415236,0.001085491,0.00056975574,0.0012982263,0.007210969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98628634,0.0055092527,0.0007119094,0.0017210228,0.004985775,0.0007856605],"domain_scores_gemma":[0.89876366,0.080527455,0.0020640858,0.011634609,0.0062005427,0.0008095852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016731637,0.0026827431,0.002258016,0.0019294177,0.0017858029,0.005955824,0.004768834,0.0050123837,0.008181457],"category_scores_gemma":[0.1152038,0.0015069403,0.0010728575,0.0024551912,0.00748148,0.018589579,0.0065654684,0.014651913,0.00208144],"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.00048789225,0.0002780552,0.0012249735,0.000958345,0.00008010151,0.00020691605,0.00045974416,0.14732976,0.003696635,0.7085417,0.0143482005,0.122387685],"study_design_scores_gemma":[0.00009407841,0.00018786395,0.00045562582,0.00056920544,0.000031304808,0.00031858293,0.0002000469,0.6081081,0.0056302994,0.3761659,0.008166655,0.0000723892],"about_ca_topic_score_codex":0.0018501811,"about_ca_topic_score_gemma":0.0017155396,"teacher_disagreement_score":0.016731637,"about_ca_system_score_codex":0.00321896,"about_ca_system_score_gemma":0.0032043883,"threshold_uncertainty_score":0.08848637},"labels":[],"label_agreement":null},{"id":"W2989943660","doi":"10.1609/aaai.v34i06.6547","title":"Idle Time Optimization for Target Assignment and Path Finding in Sortation Centers","year":2020,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Robotic Path Planning 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":"Simon Fraser University","funders":"University of Southern California; National Science Foundation","keywords":"Computer science; Queue; Sorting; Idle; Path (computing); Set (abstract data type); Task (project management); Real-time computing; Bin; Queueing theory; Throughput; Mathematical optimization; Operations research; Distributed computing; Simulation; Algorithm; Computer network; Engineering; Mathematics; Operating system","score_opus":0.09084846226161183,"score_gpt":0.3010939958970604,"score_spread":0.21024553363544854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989943660","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.08765049,0.00026946468,0.9069893,0.00026857058,0.00003797639,0.00011339601,0.00012307942,0.00053080026,0.0040169805],"genre_scores_gemma":[0.7718887,0.0002274174,0.22138444,0.0001205333,0.000034122742,0.00022008695,0.00032202934,0.00022836564,0.005574382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938715,0.00015740747,0.000019314339,0.00016932479,0.000100708305,0.00016607682],"domain_scores_gemma":[0.9984274,0.0010355227,0.00017424191,0.000089798006,0.000116977695,0.00015607836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010936772,0.0011470475,0.0012129113,0.0006379703,0.0010360779,0.0011420442,0.0021799265,0.0013086636,0.004878838],"category_scores_gemma":[0.0032304877,0.00076843565,0.0005960546,0.0009406893,0.0015842151,0.0018837112,0.0014760182,0.0012141747,0.00040798675],"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.00013955364,0.00009301899,0.00041502097,0.00007432448,0.00002883158,0.00006506536,0.00010731885,0.96798384,0.0012814585,0.012144327,0.0009137243,0.016753579],"study_design_scores_gemma":[0.000018521432,0.000046878868,0.000120464436,0.0000037611528,0.0000070737365,0.00001696238,0.000040628278,0.99165195,0.000474944,0.0071410267,0.0004709016,0.0000068236222],"about_ca_topic_score_codex":0.009457659,"about_ca_topic_score_gemma":0.0068034222,"teacher_disagreement_score":0.009457659,"about_ca_system_score_codex":0.001909109,"about_ca_system_score_gemma":0.001925894,"threshold_uncertainty_score":0.018805206},"labels":[],"label_agreement":null},{"id":"W2990557064","doi":"10.1609/aaai.v34i05.6328","title":"ALOHA: Artificial Learning of Human Attributes for Dialogue Agents","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI in Service Interactions","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 Waterloo","funders":"Huawei Technologies","keywords":"Character (mathematics); Context (archaeology); Expression (computer science); Style (visual arts); Personality psychology; Space (punctuation); Language acquisition","score_opus":0.19218864134113106,"score_gpt":0.34374721618405707,"score_spread":0.151558574842926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990557064","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.19701086,0.00083657785,0.77396834,0.00077231246,0.00028661074,0.00082289195,0.0049635894,0.015923267,0.005415519],"genre_scores_gemma":[0.59577274,0.00018367948,0.3899338,0.0003274032,0.00007875486,0.0007595833,0.007883783,0.00023025721,0.0048299925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983929,0.0007175872,0.000076179895,0.00056893565,0.00017206611,0.00007227744],"domain_scores_gemma":[0.99681515,0.0016515153,0.00020559682,0.0006542171,0.0003844818,0.0002890363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026449903,0.0011893592,0.00055906526,0.0012337897,0.000618332,0.0011396284,0.0019823434,0.0012920635,0.0028041198],"category_scores_gemma":[0.0067281434,0.00038035435,0.000987139,0.0005999371,0.0005442804,0.0018411978,0.002026223,0.0018292919,0.001254996],"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.00089057634,0.0016586224,0.030206112,0.00046527837,0.00029141377,0.00022333437,0.0010028423,0.15349492,0.011731534,0.005082131,0.021087823,0.7738654],"study_design_scores_gemma":[0.00004013071,0.00017743115,0.002830727,0.0000232123,0.000023865236,0.00006434679,0.00017352373,0.9794663,0.0050889496,0.0062624402,0.0058236998,0.000025413548],"about_ca_topic_score_codex":0.0032029734,"about_ca_topic_score_gemma":0.005088448,"teacher_disagreement_score":0.0032029734,"about_ca_system_score_codex":0.0010132538,"about_ca_system_score_gemma":0.0007918963,"threshold_uncertainty_score":0.013988197},"labels":[],"label_agreement":null},{"id":"W2991085797","doi":"10.1609/aaai.v34i04.5777","title":"Exploiting Spatial Invariance for Scalable Unsupervised Object Tracking","year":2020,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Video Surveillance and Tracking Methods","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":"McGill University","funders":"Samsung","keywords":"Computer science; Scalability; Artificial intelligence; Object (grammar); Architecture; Computer vision; Invariant (physics); Video tracking; Tracking (education); Process (computing); Computation; Track (disk drive); Cognitive neuroscience of visual object recognition; Geography","score_opus":0.20920677760534342,"score_gpt":0.3441807439909045,"score_spread":0.13497396638556106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991085797","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.03088694,0.00020503839,0.9646135,0.000092482405,0.000034579843,0.000025458117,0.00007109778,0.0023687386,0.0017022305],"genre_scores_gemma":[0.6553282,0.00031619155,0.33857173,0.00023806351,0.00006329188,0.00008277332,0.0005688772,0.00021238787,0.0046184333],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997019,0.00003380878,0.000014262353,0.00011624712,0.00007756544,0.00005606171],"domain_scores_gemma":[0.999501,0.00014584705,0.00006330992,0.00017583456,0.00007845694,0.00003564265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006048667,0.0005379059,0.00062360195,0.0005941118,0.0003470479,0.0005745071,0.0017675456,0.00066165614,0.0016087712],"category_scores_gemma":[0.0014322856,0.00035482278,0.0005982601,0.0008819742,0.0005268001,0.0011625194,0.0011655127,0.0008314363,0.0006201634],"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.00021475703,0.00019271085,0.0016259437,0.0000878914,0.00011236872,0.0001223885,0.00012483835,0.3986128,0.094043456,0.018000733,0.004804739,0.48205736],"study_design_scores_gemma":[0.0000051327993,0.00002344171,0.00031166343,0.0000020780117,0.000008668537,0.00002769219,0.0000053248923,0.98903507,0.005683966,0.0042418563,0.0006496151,0.0000054750985],"about_ca_topic_score_codex":0.008430123,"about_ca_topic_score_gemma":0.011391904,"teacher_disagreement_score":0.008430123,"about_ca_system_score_codex":0.0007698294,"about_ca_system_score_gemma":0.0009363359,"threshold_uncertainty_score":0.016762137},"labels":[],"label_agreement":null},{"id":"W2995926104","doi":"10.1609/aaai.v34i02.5602","title":"Path Planning Problems with Side Observations—When Colonels Play Hide-and-Seek","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Safran Electronics (Canada)","funders":"Agence Nationale de la Recherche; Alexander von Humboldt-Stiftung","keywords":"Regret; Benchmark (surveying); Computer science; Path (computing); Oracle; Observability; Mathematical optimization; Mathematics; Machine learning; Geography","score_opus":0.10832251060419515,"score_gpt":0.27702353533914686,"score_spread":0.16870102473495172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995926104","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.10811049,0.00044113485,0.8727029,0.002779523,0.0001961107,0.0004868278,0.00069592695,0.0012778132,0.013309318],"genre_scores_gemma":[0.8279137,0.0003070483,0.15892439,0.00090881914,0.00011928834,0.0005965345,0.000783373,0.00025955372,0.010187208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845386,0.00063983386,0.000048708287,0.0004306805,0.00016687626,0.00026010635],"domain_scores_gemma":[0.9917854,0.0064453017,0.0005267133,0.0005990353,0.00016716827,0.00047644932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002196032,0.0016339172,0.001482157,0.00036195805,0.00084244483,0.001256086,0.0018580722,0.0025764054,0.008154548],"category_scores_gemma":[0.011779364,0.0007999182,0.0010218059,0.00045883917,0.0020799085,0.0046651848,0.002742016,0.004577074,0.0007292993],"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.0017191704,0.0005104264,0.0028585303,0.00039743003,0.00018130656,0.0006642122,0.00045546226,0.7582798,0.0037615043,0.14264655,0.015382728,0.07314288],"study_design_scores_gemma":[0.00015090466,0.00016374812,0.0002812709,0.000028438417,0.000021926855,0.00012525788,0.00008794589,0.85898644,0.0014427196,0.13625243,0.0024320856,0.00002681722],"about_ca_topic_score_codex":0.003742027,"about_ca_topic_score_gemma":0.0054464303,"teacher_disagreement_score":0.008154548,"about_ca_system_score_codex":0.0011801561,"about_ca_system_score_gemma":0.0023910177,"threshold_uncertainty_score":0.027279675},"labels":[],"label_agreement":null},{"id":"W2996819921","doi":"10.1609/aaai.v34i01.5431","title":"Generalizable Resource Allocation in Stream Processing via Deep Reinforcement Learning","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Reinforcement learning; Stream processing; Encoder; Computation; Distributed computing; Leverage (statistics); Embedding; Theoretical computer science; Graph; Artificial intelligence; Algorithm","score_opus":0.06652245181908237,"score_gpt":0.2652637011071084,"score_spread":0.19874124928802603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996819921","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.07579771,0.00027877226,0.92041206,0.00040556796,0.000039970673,0.000045492052,0.00009667688,0.0013165213,0.0016073016],"genre_scores_gemma":[0.9232959,0.00014791783,0.07401308,0.00019360373,0.000025189172,0.00007878876,0.00017482585,0.00011428831,0.0019562806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997603,0.000065473454,0.000010508191,0.00007720082,0.00004493115,0.00004152655],"domain_scores_gemma":[0.9993038,0.00042531808,0.000068649824,0.00006598899,0.000092750706,0.00004345455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068060175,0.0008099149,0.00078467117,0.00031786226,0.00023519657,0.0005566178,0.0011135198,0.0008094168,0.0009847409],"category_scores_gemma":[0.0023650448,0.00045611907,0.00034117434,0.00038633496,0.00081541255,0.0013539457,0.0006551613,0.0015138268,0.0001926756],"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.0000348364,0.000031551735,0.00027347435,0.000017728718,0.000010578984,0.000023605027,0.00002084321,0.9782559,0.0011710065,0.0023510896,0.00045731428,0.017351998],"study_design_scores_gemma":[0.0000021230005,0.000003608089,0.000014930902,6.427224e-7,8.2711085e-7,0.0000013503702,0.0000010586003,0.9984536,0.00013897852,0.0013497272,0.000032361044,6.155095e-7],"about_ca_topic_score_codex":0.008105595,"about_ca_topic_score_gemma":0.009093919,"teacher_disagreement_score":0.008105595,"about_ca_system_score_codex":0.0012491774,"about_ca_system_score_gemma":0.0011518258,"threshold_uncertainty_score":0.016116858},"labels":[],"label_agreement":null},{"id":"W2996823581","doi":"10.1609/aaai.v34i04.5883","title":"Residual Neural Processes","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Neural Networks and Applications","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":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; Iran Telecommunication Research Center; National Research Foundation","keywords":"Universality (dynamical systems); Residual; Computer science; Convergence (economics); Simple (philosophy); Stochastic process; Artificial intelligence; Set (abstract data type); Process (computing); Mathematical optimization; Bayesian probability; Inference; Algorithm; Machine learning; Mathematics; Statistics","score_opus":0.1184773588599628,"score_gpt":0.2946823630960368,"score_spread":0.176205004236074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996823581","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.012384306,0.0002797424,0.980508,0.00036392122,0.00005895951,0.000035359706,0.00014189369,0.00052208616,0.0057057273],"genre_scores_gemma":[0.67832595,0.00090677844,0.30516937,0.0003357713,0.00017781706,0.00022510641,0.00046111355,0.00018434552,0.014213707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937904,0.00014599583,0.000031755026,0.00022288451,0.00015965612,0.00006055062],"domain_scores_gemma":[0.99871314,0.0006208369,0.0001547793,0.00022393279,0.00023171748,0.000055625667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014986792,0.0007028272,0.0006303501,0.00064081274,0.00034758018,0.0012893087,0.0019823762,0.0012899799,0.0044713207],"category_scores_gemma":[0.0057462184,0.0003470297,0.0007971495,0.00061774947,0.001299482,0.0025381432,0.001231231,0.0020356847,0.0010733788],"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.000083157545,0.000057780464,0.0014058239,0.0001346359,0.00008398169,0.00015817743,0.00015067968,0.49112394,0.007337634,0.42163542,0.002680686,0.075148135],"study_design_scores_gemma":[0.000007945777,0.000026758422,0.0001881571,0.000013019068,0.000010099674,0.000039527004,0.000009517744,0.92956054,0.0012383494,0.06701075,0.0018839617,0.000011386056],"about_ca_topic_score_codex":0.002845286,"about_ca_topic_score_gemma":0.0021537398,"teacher_disagreement_score":0.0044713207,"about_ca_system_score_codex":0.0008257539,"about_ca_system_score_gemma":0.00071676326,"threshold_uncertainty_score":0.014958084},"labels":[],"label_agreement":null},{"id":"W2996883610","doi":"10.1609/aaai.v34i07.6961","title":"Leveraging Multi-View Image Sets for Unsupervised Intrinsic Image Decomposition and Highlight Separation","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Image Enhancement Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Artificial intelligence; Computer science; Decomposition; Image (mathematics); Computer vision; Representation (politics); Object (grammar); Pattern recognition (psychology); Exploit; Range (aeronautics); Construct (python library)","score_opus":0.09186159896244678,"score_gpt":0.35005124372389584,"score_spread":0.25818964476144907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996883610","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.035686333,0.00021243237,0.9600873,0.0000802929,0.00003239996,0.000060441216,0.00026215863,0.0023032478,0.0012753133],"genre_scores_gemma":[0.29508153,0.00031851925,0.698143,0.00020352325,0.000068650486,0.00012173482,0.0024012674,0.000508934,0.0031526745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995505,0.00006787021,0.00001540742,0.00018151826,0.000114493705,0.00007017212],"domain_scores_gemma":[0.9991541,0.00016532911,0.00009665789,0.0003108035,0.0002003952,0.00007266005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005392781,0.0011952001,0.0008960787,0.0010069242,0.0003387402,0.00078549905,0.001302003,0.0007642413,0.001093758],"category_scores_gemma":[0.0013942623,0.0005630447,0.0012315137,0.00081808056,0.00050908345,0.0011466832,0.0012702117,0.0016299076,0.0012602931],"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.00030626234,0.0004002248,0.004266836,0.00019889891,0.00021769259,0.00014798317,0.00021059565,0.085423075,0.2455451,0.0036713756,0.007018978,0.6525929],"study_design_scores_gemma":[0.00001909052,0.00012908383,0.0035778978,0.000019002278,0.000051699477,0.00020764433,0.00005997765,0.9189241,0.06909506,0.0032945299,0.004590459,0.000031364078],"about_ca_topic_score_codex":0.0027427517,"about_ca_topic_score_gemma":0.008471714,"teacher_disagreement_score":0.0027427517,"about_ca_system_score_codex":0.00033727384,"about_ca_system_score_gemma":0.0006101043,"threshold_uncertainty_score":0.0054535866},"labels":[],"label_agreement":null},{"id":"W2996891787","doi":"10.1609/aaai.v34i04.6038","title":"Aggregated Learning: A Vector-Quantization Approach to Learning Neural Network Classifiers","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","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":"National Research Council Canada; University of Ottawa","funders":"Beijing Advanced Innovation Center for Big Data and Brain Computing; National Natural Science Foundation of China","keywords":"Learning vector quantization; Competitive learning; Artificial intelligence; Artificial neural network; Computer science; Vector quantization; Information bottleneck method; Machine learning; Quantization (signal processing); Feature learning; Instance-based learning; Classifier (UML); Pattern recognition (psychology); Unsupervised learning; Algorithm; Cluster analysis","score_opus":0.11109664830582071,"score_gpt":0.28008444633561197,"score_spread":0.16898779802979125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996891787","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.0036888977,0.00046049565,0.9948259,0.00016186778,0.000045484714,0.000028013874,0.00004106287,0.00013233557,0.00061590725],"genre_scores_gemma":[0.49419725,0.0013688118,0.49935353,0.00044245727,0.00045554037,0.0003355179,0.00045687388,0.00015008124,0.003239965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816847,0.0007324562,0.00011763338,0.00036067938,0.0004969308,0.00012375733],"domain_scores_gemma":[0.99722975,0.0014050535,0.0002506454,0.00042509177,0.0005719706,0.000117579475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003399865,0.0008315353,0.0019032013,0.0014405429,0.00052261,0.0018058539,0.0031060495,0.0014286968,0.0021703762],"category_scores_gemma":[0.008592124,0.00058327045,0.0008129366,0.0019351478,0.0014223122,0.0041507906,0.0027432786,0.0022956892,0.00043081393],"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.00011385266,0.00012970973,0.0010998967,0.0002647906,0.00016104271,0.000088088076,0.00027239078,0.62331825,0.0031368092,0.14747117,0.0032003692,0.22074363],"study_design_scores_gemma":[0.0000051438687,0.000029812605,0.0000711394,0.000011129612,0.000009600156,0.000012276972,0.000010638886,0.93626463,0.0004587941,0.062499087,0.0006210978,0.0000067382175],"about_ca_topic_score_codex":0.0028362034,"about_ca_topic_score_gemma":0.0021322242,"teacher_disagreement_score":0.003399865,"about_ca_system_score_codex":0.0013064475,"about_ca_system_score_gemma":0.0009955519,"threshold_uncertainty_score":0.017980397},"labels":[],"label_agreement":null},{"id":"W2996917304","doi":"10.1609/aaai.v34i05.6423","title":"Relation Extraction with Convolutional Network over Learnable Syntax-Transport Graph","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Beijing Advanced Innovation Center for Big Data and Brain Computing; Fundamental Research Funds for the Central Universities; State Key Laboratory of Software Development Environment; National Natural Science Foundation of China","keywords":"Computer science; Graph; Dependency graph; Dependency (UML); Artificial intelligence; Relationship extraction; Theoretical computer science; Abstract syntax; Natural language processing; Syntax; Information extraction","score_opus":0.07050531782830213,"score_gpt":0.26828117828860537,"score_spread":0.19777586046030324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996917304","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.06186781,0.0019225599,0.8962816,0.00077382533,0.00021665628,0.0002517755,0.004062501,0.026798416,0.007824976],"genre_scores_gemma":[0.49622864,0.0016851814,0.46596295,0.00064371416,0.00012385375,0.00029183723,0.019576387,0.000841808,0.014645564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946207,0.000047528818,0.000033772445,0.00026518598,0.00011115753,0.00008032127],"domain_scores_gemma":[0.99953663,0.00014248733,0.000064269225,0.00013101309,0.000094492796,0.000031140873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043424888,0.0019585832,0.00093168346,0.003032214,0.00062927086,0.0010600247,0.0016888124,0.0013405291,0.0042993105],"category_scores_gemma":[0.0014070785,0.00068604294,0.0019286247,0.003328356,0.00069090025,0.0036466226,0.0014456525,0.0019078047,0.0027080574],"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.000302578,0.00024998817,0.003105888,0.00045074147,0.00022093824,0.0005663618,0.00024389275,0.07678773,0.029224446,0.021769159,0.029368835,0.8377094],"study_design_scores_gemma":[0.000028590737,0.000067854286,0.0019509066,0.00006125425,0.00013783918,0.00021818321,0.00006880882,0.923698,0.01609429,0.04796935,0.009666414,0.000038437727],"about_ca_topic_score_codex":0.01891886,"about_ca_topic_score_gemma":0.030481648,"teacher_disagreement_score":0.01891886,"about_ca_system_score_codex":0.0015054666,"about_ca_system_score_gemma":0.0016355569,"threshold_uncertainty_score":0.037617505},"labels":[],"label_agreement":null},{"id":"W2996949682","doi":"10.1609/aaai.v34i04.6148","title":"Fragmentation Coagulation Based Mixed Membership Stochastic Blockmodel","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Bayesian Methods and Mixture Models","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":"Cluster analysis; Computer science; Inference; Gibbs sampling; Data mining; Fragmentation (computing); Bayesian inference; Community structure; Parametric statistics; Bayesian probability; Theoretical computer science; Artificial intelligence; Mathematics; Statistics","score_opus":0.13246840546758681,"score_gpt":0.3062725757817495,"score_spread":0.17380417031416268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996949682","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.037714805,0.00025440333,0.9580572,0.00037915024,0.00004061686,0.00007242271,0.00051462615,0.00021937717,0.0027473753],"genre_scores_gemma":[0.85384667,0.0007105379,0.12249917,0.0002760796,0.00011963559,0.0005305073,0.0016083315,0.00014332318,0.020265736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886656,0.00032191753,0.00004931109,0.00034023015,0.00025867342,0.00016335658],"domain_scores_gemma":[0.99758685,0.0012325126,0.00038962453,0.00019665078,0.00042902047,0.0001653455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019578442,0.00072392734,0.0014308528,0.0011834996,0.0006915339,0.0016329561,0.0032759258,0.0019088153,0.0051524322],"category_scores_gemma":[0.005188595,0.0006327013,0.0012258482,0.0013513512,0.0015607717,0.0028407006,0.0015450411,0.0015065883,0.0009255374],"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.00008288477,0.00004303952,0.002990912,0.00007225189,0.000058859867,0.00018512153,0.00024315673,0.7618473,0.0020111536,0.21525335,0.0016479096,0.015564131],"study_design_scores_gemma":[0.000007088246,0.000008387875,0.00019634006,0.0000030698532,0.000006842537,0.000020240444,0.000007075259,0.9790522,0.00012913508,0.020039538,0.0005235632,0.00000646165],"about_ca_topic_score_codex":0.014625611,"about_ca_topic_score_gemma":0.010040167,"teacher_disagreement_score":0.014625611,"about_ca_system_score_codex":0.0017885783,"about_ca_system_score_gemma":0.0013895988,"threshold_uncertainty_score":0.029080927},"labels":[],"label_agreement":null},{"id":"W2997033417","doi":"10.1609/aaai.v34i04.5817","title":"Robust Gradient-Based Markov Subsampling","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Minimax; Estimator; Computer science; Markov chain; Sampling (signal processing); Probabilistic logic; Algorithm; Mathematical optimization; Mathematics; Artificial intelligence; Statistics; Machine learning","score_opus":0.13627175802375874,"score_gpt":0.2615147983450123,"score_spread":0.12524304032125355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997033417","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.0046486855,0.00018997466,0.9942022,0.000093014416,0.00003084756,0.00003459062,0.000047526828,0.00027974226,0.00047340637],"genre_scores_gemma":[0.41533932,0.0005532031,0.5797221,0.00035030395,0.00018184399,0.0002508313,0.0006194514,0.00022852131,0.0027544147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865794,0.0005175928,0.000060241386,0.00023464442,0.00042041292,0.00010922577],"domain_scores_gemma":[0.9968227,0.0018464861,0.0002966006,0.00045200533,0.00047000626,0.000112208596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023097433,0.00096470525,0.0016472278,0.00085973827,0.00051221444,0.00093047513,0.0013890736,0.0009967249,0.0015063026],"category_scores_gemma":[0.009869342,0.0005402085,0.00092540996,0.00077079283,0.00095975643,0.0011795615,0.0012507079,0.001404639,0.0005766983],"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.00039554495,0.000090435686,0.0021690307,0.00024909707,0.00017220552,0.000221281,0.00013211301,0.7545327,0.014240033,0.07367181,0.004665422,0.14946027],"study_design_scores_gemma":[0.000009724554,0.000027734424,0.0001591733,0.0000071254863,0.0000075080766,0.00003168878,0.000005818559,0.9896785,0.0019882638,0.0074122986,0.0006618198,0.000010363587],"about_ca_topic_score_codex":0.0043461644,"about_ca_topic_score_gemma":0.0042394507,"teacher_disagreement_score":0.0043461644,"about_ca_system_score_codex":0.00081833935,"about_ca_system_score_gemma":0.0015359978,"threshold_uncertainty_score":0.012215197},"labels":[],"label_agreement":null},{"id":"W2997060212","doi":"10.1609/aaai.v34i04.6029","title":"Quadruply Stochastic Gradient Method for Large Scale Nonlinear Semi-Supervised Ordinal Regression AUC Optimization","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Data Classification","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":"Western University","funders":"Government of Jiangsu Province; National Natural Science Foundation of China","keywords":"Ordinal regression; Generalization; Computer science; Benchmark (surveying); Scalability; Ranking (information retrieval); Ordinal Scale; Ordinal data; Regression; Binary classification; Scale (ratio); Mathematics; Mathematical optimization; Artificial intelligence; Algorithm; Machine learning; Statistics; Support vector machine","score_opus":0.07678475938076705,"score_gpt":0.33235058833096354,"score_spread":0.25556582895019647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997060212","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.0044167554,0.0001332214,0.9944243,0.00014575716,0.00001786107,0.000034996167,0.000032673877,0.0003558362,0.0004386019],"genre_scores_gemma":[0.34339985,0.00029385142,0.6505791,0.0002971234,0.000115727984,0.00050647603,0.00047264117,0.0004713997,0.003863824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855524,0.0007170574,0.00006651963,0.00021692623,0.00034911645,0.000095121635],"domain_scores_gemma":[0.99710256,0.001694825,0.0002217193,0.00023360875,0.0006008224,0.0001464694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034899204,0.0011759665,0.0020071073,0.0010209457,0.00057284464,0.0010917443,0.0016392642,0.0014795027,0.0019376719],"category_scores_gemma":[0.008711483,0.0005984819,0.0008201345,0.00092589244,0.0011560015,0.001362108,0.0015429901,0.0021535542,0.0007346089],"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.0001060026,0.00010287753,0.001059109,0.00017328883,0.00007178914,0.00009715293,0.000088367604,0.85248476,0.002638397,0.026488284,0.0041911327,0.11249876],"study_design_scores_gemma":[0.0000034069863,0.000007494873,0.000038131464,0.0000025134361,0.0000012530888,0.000005091031,0.000002793526,0.99700826,0.00013291546,0.0026241813,0.00017144217,0.0000026098442],"about_ca_topic_score_codex":0.0041853273,"about_ca_topic_score_gemma":0.0039392575,"teacher_disagreement_score":0.0041853273,"about_ca_system_score_codex":0.0011250146,"about_ca_system_score_gemma":0.0020577083,"threshold_uncertainty_score":0.018456697},"labels":[],"label_agreement":null},{"id":"W2997090216","doi":"10.1609/aaai.v34i04.5733","title":"Predicting Propositional Satisfiability via End-to-End Learning","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Software Engineering Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"British Columbia Knowledge Development Fund; Natural Sciences and Engineering Research Council of Canada; Alberta Machine Intelligence Institute; Compute Canada; Defense Advanced Research Projects Agency; Canadian Institute for Advanced Research; Nvidia","keywords":"Satisfiability; Computer science; Variable (mathematics); Boolean satisfiability problem; Feature (linguistics); Artificial intelligence; Deep learning; Feature engineering; Linear programming; Key (lock); Algorithm; Machine learning; Theoretical computer science; Mathematics","score_opus":0.06095954478794397,"score_gpt":0.2915961234970659,"score_spread":0.2306365787091219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997090216","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.16206945,0.0009127571,0.7927228,0.0027962457,0.00033759684,0.00041882868,0.003352469,0.024713794,0.0126759745],"genre_scores_gemma":[0.64947367,0.0004469775,0.33067772,0.0013768715,0.0001532043,0.00050430314,0.009696001,0.00086425274,0.006807057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985593,0.0004084401,0.00007457879,0.0005076763,0.00027189765,0.0001780715],"domain_scores_gemma":[0.99021727,0.0071400786,0.00039934262,0.0010990992,0.00092152075,0.0002226557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018973436,0.002280262,0.0010772962,0.0009851683,0.00063851767,0.0018763685,0.0031619964,0.0023130754,0.009732446],"category_scores_gemma":[0.015273831,0.0010571213,0.0013665616,0.00081231556,0.0013671161,0.004792671,0.0020196654,0.0051439917,0.003414466],"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.00052825065,0.000856334,0.006370805,0.0006313867,0.00019252975,0.00021207215,0.00013447576,0.67055684,0.005577173,0.013865444,0.027438205,0.27363646],"study_design_scores_gemma":[0.00001950317,0.00003480093,0.00013271213,0.000012571711,0.000008306731,0.000009436352,0.000013657008,0.98544705,0.0013068966,0.012495995,0.00051453005,0.000004514319],"about_ca_topic_score_codex":0.0042974856,"about_ca_topic_score_gemma":0.014410008,"teacher_disagreement_score":0.009732446,"about_ca_system_score_codex":0.0020116053,"about_ca_system_score_gemma":0.002649927,"threshold_uncertainty_score":0.032558322},"labels":[],"label_agreement":null},{"id":"W2997123841","doi":"10.1609/aaai.v34i04.5885","title":"Monte-Carlo Tree Search in Continuous Action Spaces with Value Gradients","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Mila - Quebec Artificial Intelligence Institute; Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; Iran Telecommunication Research Center; National Research Foundation","keywords":"Monte Carlo tree search; Discretization; Smoothness; Action (physics); Tree (set theory); Mathematical optimization; Computer science; Monte Carlo method; Set (abstract data type); Space (punctuation); Mathematics; Discrete space; Exploit; Algorithm; Mathematical analysis","score_opus":0.12340160450697585,"score_gpt":0.3139371520565129,"score_spread":0.19053554754953705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997123841","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.022683712,0.00068409694,0.97162694,0.00028917153,0.00007123245,0.00008673946,0.00007659783,0.00074251473,0.0037390718],"genre_scores_gemma":[0.596566,0.0003262006,0.3987561,0.00033128628,0.00006895074,0.0003187642,0.00027654888,0.0002693459,0.003086622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992181,0.00031790775,0.0000431679,0.00014708172,0.00018927369,0.00008444299],"domain_scores_gemma":[0.9964414,0.002809064,0.00016967859,0.00018147884,0.00023983186,0.00015852781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001799693,0.0009936558,0.0016958282,0.00073153124,0.0005911086,0.00093839364,0.0016737818,0.0015542752,0.0028393017],"category_scores_gemma":[0.007162802,0.0007497347,0.00074976723,0.0010315375,0.0014875606,0.0016808521,0.0012720803,0.0018658557,0.0004882677],"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.00007600476,0.000034436784,0.00049216766,0.00005654387,0.00002446983,0.000049312985,0.0000432975,0.9549979,0.00030225876,0.016687319,0.0010356016,0.026200743],"study_design_scores_gemma":[0.000010019502,0.000009992354,0.000026727388,0.000004774362,0.0000026422313,0.0000062095373,0.0000027595709,0.99446183,0.00008616153,0.00515009,0.00023668689,0.0000020457442],"about_ca_topic_score_codex":0.012280613,"about_ca_topic_score_gemma":0.012345563,"teacher_disagreement_score":0.012280613,"about_ca_system_score_codex":0.0013238569,"about_ca_system_score_gemma":0.0024020337,"threshold_uncertainty_score":0.024418235},"labels":[],"label_agreement":null},{"id":"W2997141632","doi":"10.1609/aaai.v34i05.6517","title":"Replicate, Walk, and Stop on Syntax: An Effective Neural Network Model for Aspect-Level Sentiment Classification","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":47,"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 Ottawa","funders":"Beijing Advanced Innovation Center for Big Data and Brain Computing; Fundamental Research Funds for the Central Universities; State Key Laboratory of Software Development Environment; National Natural Science Foundation of China","keywords":"Computer science; Sentence; Artificial intelligence; Sentiment analysis; Syntax; Leverage (statistics); Natural language processing; Representation (politics); Machine learning","score_opus":0.1952806311226545,"score_gpt":0.3317955325796875,"score_spread":0.13651490145703302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997141632","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.22729912,0.0011289804,0.7637787,0.0012506492,0.0001859315,0.00015580918,0.00057945587,0.0016281257,0.003993221],"genre_scores_gemma":[0.8915312,0.00043720787,0.10115234,0.00031628294,0.000081604514,0.0002004006,0.0006939167,0.000108339,0.005478669],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998361,0.000050230716,0.000009566772,0.00005931689,0.000022615704,0.00002210998],"domain_scores_gemma":[0.9995609,0.00021857412,0.000052412783,0.000045524423,0.000095665244,0.00002687809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005796338,0.0007455936,0.0007574813,0.0006733288,0.00036199138,0.0006490533,0.0017730109,0.0011037919,0.0014566442],"category_scores_gemma":[0.0019217747,0.0003930428,0.0007114937,0.0007302375,0.00050704804,0.0016451018,0.00063981005,0.0012474974,0.00040103422],"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.00026510144,0.00017425616,0.002485337,0.000084326115,0.00013417262,0.00015703551,0.00012355234,0.7913265,0.0047783977,0.011906324,0.0038906771,0.18467428],"study_design_scores_gemma":[0.0000034313332,0.000013138475,0.00006871815,0.0000021437254,0.000005526977,0.0000057084835,0.0000023911246,0.9973008,0.00013970937,0.002380002,0.00007629145,0.0000022503532],"about_ca_topic_score_codex":0.0074999537,"about_ca_topic_score_gemma":0.01116521,"teacher_disagreement_score":0.0074999537,"about_ca_system_score_codex":0.00080089027,"about_ca_system_score_gemma":0.0006651604,"threshold_uncertainty_score":0.014912605},"labels":[],"label_agreement":null},{"id":"W2997166078","doi":"10.1609/aaai.v34i04.5773","title":"Deep Mixed Effect Model Using Gaussian Processes: A Personalized and Reliable Prediction for Healthcare","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning in Healthcare","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Samsung; Ministry of Science and ICT, South Korea; National Research Foundation of Korea; National Research Foundation","keywords":"Computer science; Component (thermodynamics); Artificial intelligence; Machine learning; Personalized medicine; Recurrent neural network; Deep learning; Time series; Data mining; Gaussian; Artificial neural network; Gaussian process; Data science; Bioinformatics","score_opus":0.10744128469518001,"score_gpt":0.3343533441846164,"score_spread":0.22691205948943638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997166078","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.02430973,0.00074924796,0.9705293,0.0020134423,0.00013394361,0.000032421343,0.0005962635,0.0006018316,0.0010337778],"genre_scores_gemma":[0.84371316,0.0015003841,0.14203557,0.0011373464,0.00037786242,0.00024921552,0.0013305057,0.0001618702,0.009493981],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992487,0.00027353165,0.00003309476,0.0002272888,0.00011386728,0.00010349399],"domain_scores_gemma":[0.9982041,0.0011427854,0.00017948472,0.00014756733,0.00022108074,0.00010496473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024329661,0.001012574,0.0013605846,0.000734841,0.0003336787,0.0011411079,0.0018465496,0.0019085757,0.002105049],"category_scores_gemma":[0.0059410804,0.00073708995,0.0012428655,0.0009890434,0.000886648,0.0016972172,0.0014007017,0.0028480524,0.0005990486],"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.00018558877,0.000101487996,0.004277805,0.0000688273,0.00014634438,0.00017297358,0.00009347622,0.9126664,0.00097591255,0.03624852,0.0036154462,0.04144735],"study_design_scores_gemma":[0.000007567133,0.00001151289,0.00016422437,0.000005312088,0.000012529188,0.0000098360915,0.0000025223403,0.9892675,0.000099209596,0.010131918,0.00028235593,0.0000054605835],"about_ca_topic_score_codex":0.012019268,"about_ca_topic_score_gemma":0.013713675,"teacher_disagreement_score":0.012019268,"about_ca_system_score_codex":0.0011268572,"about_ca_system_score_gemma":0.0015782205,"threshold_uncertainty_score":0.023898661},"labels":[],"label_agreement":null},{"id":"W2997205428","doi":"10.1609/aaai.v34i04.5822","title":"Nonlinear Mixup: Out-Of-Manifold Data Augmentation for Text Classification","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Nonlinear system; Mixing (physics); Manifold (fluid mechanics); Computer science; Regularization (linguistics); Scalar (mathematics); Interpolation (computer graphics); Benchmark (surveying); Mathematics; Artificial intelligence; Pattern recognition (psychology); Algorithm; Machine learning","score_opus":0.2956569575793979,"score_gpt":0.36300084100343927,"score_spread":0.06734388342404135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997205428","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.030946244,0.00051476946,0.96021914,0.00033507042,0.000105647465,0.00017324206,0.00036986303,0.005567543,0.0017684768],"genre_scores_gemma":[0.41724506,0.00035647638,0.5690773,0.0007831632,0.00017460657,0.00072570663,0.0026157836,0.00093619793,0.008085658],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879056,0.00043824274,0.00006426145,0.00036769122,0.00023490329,0.00010434244],"domain_scores_gemma":[0.9982742,0.0006533727,0.00013539844,0.00058632327,0.00023538942,0.00011522115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020161662,0.0021763605,0.0014799464,0.0012253596,0.0009773485,0.0013706275,0.002649165,0.0019887716,0.0047440645],"category_scores_gemma":[0.00595257,0.0007946804,0.0014849268,0.001318619,0.0015975329,0.0035018357,0.0051032575,0.0035772808,0.002813751],"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.00087318907,0.00055636454,0.0041001122,0.00039032853,0.00021010188,0.00027885786,0.0006943284,0.19843094,0.025450852,0.02385407,0.01790032,0.72726053],"study_design_scores_gemma":[0.00002732424,0.00013631809,0.00025492845,0.000019750236,0.000017591554,0.00007585284,0.00005772798,0.97252107,0.009211336,0.014044344,0.0036104014,0.000023432478],"about_ca_topic_score_codex":0.0013194185,"about_ca_topic_score_gemma":0.00271347,"teacher_disagreement_score":0.0047440645,"about_ca_system_score_codex":0.000826434,"about_ca_system_score_gemma":0.0008967377,"threshold_uncertainty_score":0.015870452},"labels":[],"label_agreement":null},{"id":"W2997240763","doi":"10.1609/aaai.v34i07.6923","title":"3D Human Pose Estimation via Explicit Compositional Depth Maps","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Human Pose and Action Recognition","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":"McGill University","funders":"","keywords":"Pose; Artificial intelligence; Computer vision; Computer science; Monocular; 3D pose estimation; Projection (relational algebra); Perspective (graphical); Pixel; Image (mathematics); Articulated body pose estimation; Algorithm","score_opus":0.10146973028174629,"score_gpt":0.3023834091127771,"score_spread":0.20091367883103084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997240763","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.011436787,0.00023114757,0.9848904,0.00005823229,0.00003343616,0.000039955994,0.00026469628,0.0021254676,0.0009199467],"genre_scores_gemma":[0.39587903,0.0007539547,0.59592503,0.00024784997,0.00012889015,0.00013127169,0.0019667025,0.00035264864,0.004614585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995135,0.00006928631,0.000011787511,0.00017619094,0.00016817679,0.00006109343],"domain_scores_gemma":[0.9996816,0.00007447416,0.000042407355,0.00009861614,0.00007693494,0.000025968156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002678973,0.0016543405,0.00094645954,0.00088783033,0.00029030556,0.00075198145,0.0012133353,0.00081591937,0.0041505974],"category_scores_gemma":[0.0012712828,0.0008074578,0.0008266565,0.00081468525,0.00045749536,0.0013181813,0.0020027738,0.0011215092,0.0022237645],"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.0003762225,0.00015478954,0.0026147305,0.00024983086,0.00016051234,0.00017061521,0.0001876787,0.12210007,0.073093764,0.0053116814,0.0078942515,0.7876858],"study_design_scores_gemma":[0.000035163084,0.00013054906,0.0035714542,0.000035535595,0.000039461163,0.00041531358,0.00008145061,0.9515536,0.024004089,0.01315687,0.006936768,0.000039803675],"about_ca_topic_score_codex":0.0044944696,"about_ca_topic_score_gemma":0.010366626,"teacher_disagreement_score":0.0044944696,"about_ca_system_score_codex":0.00030831897,"about_ca_system_score_gemma":0.0006187175,"threshold_uncertainty_score":0.01388514},"labels":[],"label_agreement":null},{"id":"W2997242078","doi":"10.1609/aaai.v34i04.6178","title":"DGE: Deep Generative Network Embedding Based on Commonality and Individuality","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural 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":"Simon Fraser University","funders":"Zhejiang University; China Postdoctoral Science Foundation; Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Embedding; Computer science; Node (physics); Generative model; Network topology; Topology (electrical circuits); Artificial intelligence; Generative grammar; Focus (optics); Theoretical computer science; Variety (cybernetics); Machine learning; Mathematics; Computer network","score_opus":0.09933017429236297,"score_gpt":0.3111534523431887,"score_spread":0.21182327805082574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997242078","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.008760175,0.00032918993,0.9890478,0.00024221097,0.000026968084,0.00003169034,0.00022106015,0.00046337518,0.00087757065],"genre_scores_gemma":[0.62777704,0.0013777581,0.35733312,0.00060479966,0.00014341275,0.00036721016,0.002808666,0.00061961723,0.008968377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999393,0.00022247585,0.00002208474,0.00018102932,0.000121481586,0.00005992678],"domain_scores_gemma":[0.9985014,0.00085434405,0.00016659066,0.00022767638,0.00014595223,0.00010400221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012630564,0.0012947125,0.0011961107,0.0013846674,0.000410817,0.0012178064,0.0021825368,0.0013810371,0.002289788],"category_scores_gemma":[0.004347915,0.0007992339,0.0012889986,0.0014112876,0.0013950014,0.0029519857,0.002190637,0.0031408768,0.00072566036],"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.00007233083,0.00008064418,0.0028146901,0.00013009993,0.0001593738,0.00015561511,0.00023898024,0.78632414,0.0023010357,0.086374395,0.005173876,0.11617482],"study_design_scores_gemma":[0.0000041506723,0.000011037458,0.00015399433,0.000011061463,0.000008071258,0.000030276935,0.000009835558,0.966459,0.0002569853,0.032253645,0.0007947637,0.0000071495106],"about_ca_topic_score_codex":0.0055330102,"about_ca_topic_score_gemma":0.009571502,"teacher_disagreement_score":0.0055330102,"about_ca_system_score_codex":0.0012388864,"about_ca_system_score_gemma":0.0008875669,"threshold_uncertainty_score":0.011001587},"labels":[],"label_agreement":null},{"id":"W2997250483","doi":"10.1609/aaai.v34i04.5871","title":"Options of Interest: Temporal Abstraction with Interest Functions","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Abstraction; Generalization; Computer science; Set (abstract data type); Function (biology); Variable (mathematics); Theoretical computer science; Abstraction layer; Artificial intelligence; Machine learning; Programming language; Mathematics; Software","score_opus":0.45947554634592874,"score_gpt":0.39809771098521407,"score_spread":0.06137783536071467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997250483","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.004928576,0.00013458026,0.99225426,0.00022629788,0.000019339648,0.000024629204,0.0000426528,0.00017688097,0.0021927918],"genre_scores_gemma":[0.56632626,0.0004939853,0.42634463,0.00023017032,0.00008910937,0.00027712985,0.00023617929,0.00026129428,0.005741221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985241,0.00065175025,0.00007959932,0.0002971295,0.00032759891,0.000119856464],"domain_scores_gemma":[0.9956611,0.002575392,0.00047725724,0.00067795394,0.00036151026,0.0002468085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029390599,0.0009302602,0.00078057643,0.0007539155,0.00056327897,0.0025937166,0.002019549,0.0013741244,0.004401352],"category_scores_gemma":[0.014417548,0.0006695275,0.0013771888,0.0008406394,0.0025445821,0.0070626414,0.0026766963,0.0035427897,0.0006218256],"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.00014873878,0.000057307494,0.0012931532,0.00012741121,0.00004770845,0.0002579107,0.00049305125,0.2944877,0.002603987,0.6396835,0.0016607932,0.059138734],"study_design_scores_gemma":[0.000012902179,0.000032869728,0.00017453126,0.00002740027,0.000015693515,0.00007226483,0.00003241585,0.70404,0.0010316434,0.29173127,0.0028101206,0.000018919145],"about_ca_topic_score_codex":0.002688255,"about_ca_topic_score_gemma":0.002136264,"teacher_disagreement_score":0.004401352,"about_ca_system_score_codex":0.0015550664,"about_ca_system_score_gemma":0.0012617236,"threshold_uncertainty_score":0.015543401},"labels":[],"label_agreement":null},{"id":"W2997261254","doi":"10.1609/aaai.v34i04.5945","title":"Memory Augmented Graph Neural Networks for Sequential Recommendation","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":231,"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; Recommender system; Graph; Term (time); Artificial neural network; Variety (cybernetics); Machine learning; Artificial intelligence; Information retrieval; Data mining; Theoretical computer science","score_opus":0.1317487524637631,"score_gpt":0.31049293463658023,"score_spread":0.17874418217281712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997261254","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.07498649,0.0038277716,0.9139456,0.0009906664,0.00021829773,0.00007551683,0.0006944895,0.0018440501,0.0034171504],"genre_scores_gemma":[0.8760828,0.00139362,0.11252687,0.00038518567,0.00014650077,0.0001481987,0.00095354096,0.000097650416,0.008265658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956745,0.000100679514,0.000029099803,0.00015083577,0.00008502737,0.00006690916],"domain_scores_gemma":[0.99854255,0.00086640724,0.00013252602,0.00015371986,0.0002569991,0.000047867656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009061508,0.0010512723,0.00127646,0.0009916731,0.00047186794,0.0007285446,0.0017063323,0.001439729,0.002382762],"category_scores_gemma":[0.0040787305,0.00062948343,0.0007377344,0.0014679547,0.00057065906,0.0017191677,0.00067544106,0.00195991,0.0006894565],"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.00011310336,0.000071422226,0.0010975712,0.00007364065,0.000071249975,0.000055761033,0.000043422635,0.9214579,0.000791349,0.004850525,0.0015247752,0.06984931],"study_design_scores_gemma":[0.0000029824876,0.000009489178,0.00009985587,0.0000029128369,0.000005690161,0.0000049168216,0.0000021696073,0.9967198,0.000080294776,0.0029353008,0.00013351772,0.0000031392392],"about_ca_topic_score_codex":0.040985893,"about_ca_topic_score_gemma":0.052050047,"teacher_disagreement_score":0.040985893,"about_ca_system_score_codex":0.0013834573,"about_ca_system_score_gemma":0.0011467503,"threshold_uncertainty_score":0.08149463},"labels":[],"label_agreement":null},{"id":"W2997326929","doi":"10.1609/aaai.v34i03.5669","title":"ElGolog: A High-Level Programming Language with Memory of the Execution History","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","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":"Simon Fraser University; York University","funders":"European Commission","keywords":"Converse; Computer science; Programming language; Situation calculus; Mathematics","score_opus":0.08513993585300643,"score_gpt":0.25414579831492945,"score_spread":0.169005862461923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997326929","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.009344779,0.00014959618,0.9607285,0.0006581247,0.000052762993,0.00011921468,0.00067852705,0.023537781,0.0047305957],"genre_scores_gemma":[0.2722581,0.00043408887,0.7110482,0.001348521,0.00009270622,0.00039916736,0.0014793496,0.0034890855,0.009450797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99931455,0.00018000923,0.00007467137,0.00015026887,0.00016873042,0.00011176345],"domain_scores_gemma":[0.99842453,0.0008269153,0.00020254229,0.00030393197,0.00015375754,0.000088342356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001377217,0.0006393962,0.0004701696,0.00065263273,0.0005292078,0.0024507374,0.002129599,0.00087215565,0.006047399],"category_scores_gemma":[0.0028860937,0.00070563925,0.0009990375,0.0006048362,0.0029512711,0.00506839,0.0021818879,0.0021479067,0.0014265105],"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.0005589814,0.00013669938,0.0032896488,0.00080105406,0.00008004942,0.0008826675,0.0020566746,0.02892187,0.013625707,0.7352134,0.023362136,0.19107105],"study_design_scores_gemma":[0.00022133581,0.0002189895,0.0011960737,0.00027661675,0.00013160684,0.0010208082,0.00031565808,0.17351817,0.025549503,0.53139555,0.26600695,0.00014875011],"about_ca_topic_score_codex":0.0030330962,"about_ca_topic_score_gemma":0.005001819,"teacher_disagreement_score":0.006047399,"about_ca_system_score_codex":0.0009017057,"about_ca_system_score_gemma":0.0018569432,"threshold_uncertainty_score":0.020230532},"labels":[],"label_agreement":null},{"id":"W2997394441","doi":"10.1609/aaai.v34i05.6292","title":"P-SIF: Document Embeddings Using Partition Averaging","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute for Catastrophic Loss Reduction; Microsoft Research","keywords":"Computer science; Simple (philosophy); Word (group theory); Set (abstract data type); Correctness; Representation (politics); Partition (number theory); Natural language processing; Artificial intelligence; Algorithm; Pattern recognition (psychology); Mathematics; Combinatorics","score_opus":0.13534460733668546,"score_gpt":0.31113987685313105,"score_spread":0.17579526951644558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997394441","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.016257178,0.0010317999,0.97376627,0.00022492159,0.00018133798,0.00019056907,0.001099742,0.005908148,0.0013400207],"genre_scores_gemma":[0.21038893,0.0012341986,0.7725758,0.00031927472,0.00035733895,0.00071462296,0.007361595,0.0008612505,0.006187007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989778,0.00023224732,0.00009210547,0.00034391915,0.0002708142,0.00008326107],"domain_scores_gemma":[0.99824274,0.00065247226,0.00015616919,0.0004695818,0.0004089185,0.00007017555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015753628,0.0018410209,0.0011908562,0.0029356298,0.00058231305,0.0012209748,0.0018495367,0.0012963895,0.003395802],"category_scores_gemma":[0.0069595035,0.00045714766,0.0013273724,0.0033930873,0.00054094405,0.004544405,0.00135818,0.0018241588,0.002595276],"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.00018271622,0.00015728157,0.0018535929,0.00021090018,0.00017599638,0.000104577055,0.00025746654,0.04725923,0.0070631467,0.009052941,0.020771893,0.9129102],"study_design_scores_gemma":[0.00007195415,0.00023334542,0.0012638269,0.000046992478,0.00008394821,0.00035207474,0.00011736301,0.93507874,0.009928769,0.037459668,0.015288122,0.00007528917],"about_ca_topic_score_codex":0.0065984745,"about_ca_topic_score_gemma":0.008332763,"teacher_disagreement_score":0.0065984745,"about_ca_system_score_codex":0.00087632687,"about_ca_system_score_gemma":0.0015132315,"threshold_uncertainty_score":0.013120115},"labels":[],"label_agreement":null},{"id":"W2997405211","doi":"10.1609/aaai.v34i05.6230","title":"Modelling Sentence Pairs via Reinforcement Learning: An Actor-Critic Approach to Learn the Irrelevant Words","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Reinforcement learning; Sentence; Computer science; Artificial intelligence; Natural language processing; Task (project management); Representation (politics); Paraphrase; Inference; Parsing; Similarity (geometry); Machine learning","score_opus":0.13772920933430416,"score_gpt":0.287427590337229,"score_spread":0.14969838100292482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997405211","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.030381924,0.0002902304,0.96638966,0.00046313848,0.00008443658,0.00010507621,0.0000542772,0.0007606376,0.0014707019],"genre_scores_gemma":[0.83648884,0.0001743033,0.15898864,0.0004228963,0.000081908685,0.00037456086,0.00018949047,0.00014032911,0.0031390607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991308,0.00043887348,0.000038731945,0.000205171,0.00011776914,0.00006869898],"domain_scores_gemma":[0.9973732,0.0018780223,0.00021451717,0.00014599673,0.00025587325,0.00013235872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024464026,0.0012616052,0.0014246005,0.00045328206,0.0004073519,0.00082408317,0.0021486816,0.0015238523,0.0020860257],"category_scores_gemma":[0.0077851946,0.0006464272,0.0006454342,0.00041799323,0.0010354379,0.0017240382,0.0011110281,0.0024475805,0.00046708595],"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.00024983336,0.00014809099,0.0011282453,0.00008933666,0.00010282959,0.00018076593,0.00016754091,0.92778933,0.0040708077,0.0097498335,0.0015751483,0.054748323],"study_design_scores_gemma":[0.000009810585,0.000018054754,0.000031795542,0.0000022968936,0.000006263816,0.0000068790555,0.0000032621724,0.9967424,0.00028310667,0.0027767606,0.000115795825,0.0000035511832],"about_ca_topic_score_codex":0.0036829154,"about_ca_topic_score_gemma":0.0040882947,"teacher_disagreement_score":0.0036829154,"about_ca_system_score_codex":0.0009783603,"about_ca_system_score_gemma":0.0011909016,"threshold_uncertainty_score":0.012937963},"labels":[],"label_agreement":null},{"id":"W2997420347","doi":"10.1609/aaai.v34i04.6115","title":"Dual Adversarial Co-Learning for Multi-Domain Text Classification","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Classifier (UML); Artificial intelligence; Labeled data; Adversarial system; Machine learning; Domain (mathematical analysis); Generalization; Dual (grammatical number); Pattern recognition (psychology); Mathematics","score_opus":0.20247617342960006,"score_gpt":0.34109983262040067,"score_spread":0.1386236591908006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997420347","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.018039435,0.00039943852,0.97956026,0.00037551127,0.000052527965,0.0000358308,0.000057198184,0.0005086495,0.0009711685],"genre_scores_gemma":[0.8102205,0.00041626423,0.18142231,0.000523042,0.00021532747,0.00019593492,0.00066480367,0.00013638692,0.006205451],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988073,0.0004504467,0.000049467977,0.0003297068,0.0002371616,0.00012590262],"domain_scores_gemma":[0.9967049,0.0020103643,0.00033943474,0.00045573513,0.00033023657,0.00015937597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023524167,0.0010191017,0.0011531059,0.00078203983,0.00050157786,0.0008056071,0.0017386308,0.0015346315,0.0016271741],"category_scores_gemma":[0.0050635547,0.00038581467,0.0007954486,0.0008945444,0.0013455029,0.0021501726,0.001931744,0.0031314462,0.0007202856],"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.0003615049,0.00027544814,0.0018709699,0.00011472906,0.000096914984,0.00019301141,0.00014280525,0.81129026,0.006478543,0.020252425,0.005293539,0.15362988],"study_design_scores_gemma":[0.00000313258,0.0000144854275,0.000056281708,0.0000021321146,0.000002778498,0.000011204141,0.0000038874837,0.9953323,0.00066941086,0.0036692237,0.00023177835,0.0000032805153],"about_ca_topic_score_codex":0.0019964543,"about_ca_topic_score_gemma":0.0015493577,"teacher_disagreement_score":0.0023524167,"about_ca_system_score_codex":0.0010484912,"about_ca_system_score_gemma":0.0007255072,"threshold_uncertainty_score":0.01244092},"labels":[],"label_agreement":null},{"id":"W2997443382","doi":"10.1609/aaai.v34i06.6551","title":"Active Goal Recognition","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Microsoft Research","keywords":"Expediting; Observer (physics); Computer science; Agency (philosophy); Artificial intelligence; Goal orientation; Landmark; Machine learning; Human–computer interaction; Psychology; Engineering; Social psychology","score_opus":0.13642033691760833,"score_gpt":0.3062379934139301,"score_spread":0.16981765649632177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997443382","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.007743878,0.0001383548,0.98379785,0.0002524175,0.000049629776,0.00012953253,0.00017658928,0.0021850194,0.0055266474],"genre_scores_gemma":[0.32946426,0.0002115639,0.6624735,0.00033165806,0.000052392163,0.00030045875,0.0011018261,0.00042779266,0.0056365733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776924,0.000548858,0.00013853193,0.0007711136,0.0005299763,0.00024220147],"domain_scores_gemma":[0.9956927,0.0017811912,0.0005844246,0.0010201376,0.0006888996,0.00023259844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022047604,0.001308559,0.00091553916,0.0011964781,0.0008550953,0.002425497,0.0030739068,0.0017863835,0.0061395266],"category_scores_gemma":[0.008199077,0.0006013597,0.001929607,0.0005887827,0.0018235928,0.0040457863,0.0034293025,0.0023989254,0.001946985],"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.0009170325,0.00047899797,0.0072733294,0.00088307343,0.0002326784,0.0007460407,0.0024215255,0.0824545,0.029165205,0.34521204,0.02040853,0.50980693],"study_design_scores_gemma":[0.00007659608,0.00024637883,0.0020070355,0.00017328023,0.000121975085,0.00043350208,0.00053013104,0.57405037,0.03379563,0.36191085,0.026534956,0.000119296434],"about_ca_topic_score_codex":0.002826743,"about_ca_topic_score_gemma":0.0034431855,"teacher_disagreement_score":0.0061395266,"about_ca_system_score_codex":0.0009455348,"about_ca_system_score_gemma":0.0018496757,"threshold_uncertainty_score":0.020538747},"labels":[],"label_agreement":null},{"id":"W2997477628","doi":"10.1609/aaai.v34i04.5854","title":"Sequential Recommendation with Relation-Aware Kernelized Self-Attention","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"National Research Foundation of Korea; National Research Foundation","keywords":"Computer science; Probabilistic logic; Machine learning; Recommender system; Skew; Latent Dirichlet allocation; Relation (database); Artificial intelligence; Transformer; Data mining; Topic model; Engineering","score_opus":0.08827867921845198,"score_gpt":0.28651499782918904,"score_spread":0.19823631861073707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997477628","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.06212656,0.0012870576,0.93094844,0.00028070385,0.00008034542,0.00009342577,0.00019551821,0.002830725,0.0021571473],"genre_scores_gemma":[0.86162734,0.00048400575,0.13138929,0.00028323586,0.00013065661,0.000097592136,0.000491275,0.00016914013,0.005327443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983677,0.00042280174,0.00010317915,0.00057625375,0.00038489193,0.00014509894],"domain_scores_gemma":[0.9954183,0.0019396824,0.00033137374,0.0013228367,0.00079684914,0.0001908852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00200328,0.000904486,0.0017178367,0.0010762408,0.0005369262,0.001072784,0.0026522044,0.0012054943,0.0022143691],"category_scores_gemma":[0.0061179427,0.0006438362,0.0014987392,0.001762295,0.00076929,0.0038008203,0.0018943171,0.0015764071,0.0009343841],"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.00081971416,0.00083195604,0.011603944,0.00035922477,0.0005262998,0.00019370057,0.00071386434,0.26987576,0.014379914,0.022514459,0.00727092,0.6709101],"study_design_scores_gemma":[0.000024504843,0.00010271235,0.0011774395,0.000007665494,0.0000480659,0.00007737808,0.00001884125,0.98884124,0.0014900755,0.0072260345,0.0009662732,0.0000197758],"about_ca_topic_score_codex":0.014791819,"about_ca_topic_score_gemma":0.020276546,"teacher_disagreement_score":0.014791819,"about_ca_system_score_codex":0.0012013774,"about_ca_system_score_gemma":0.0011302001,"threshold_uncertainty_score":0.029411435},"labels":[],"label_agreement":null},{"id":"W2997514790","doi":"10.1609/aaai.v34i07.6783","title":"Deep Generative Probabilistic Graph Neural Networks for Scene Graph Generation","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Multimodal Machine Learning Applications","field":"Computer Science","cited_by":57,"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":"Computer science; Artificial intelligence; Scene graph; Probabilistic logic; Generative model; Graph; Theoretical computer science; Minimum bounding box; Pattern recognition (psychology); Generative grammar; Image (mathematics)","score_opus":0.09663262041000328,"score_gpt":0.3077191104554348,"score_spread":0.21108649004543154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997514790","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.012733645,0.00052373804,0.9759931,0.00046224173,0.00008088889,0.000116074574,0.0008456199,0.0070087267,0.0022359649],"genre_scores_gemma":[0.41281572,0.00054243306,0.5704845,0.0010814556,0.0001009989,0.0003766104,0.0067684385,0.0013539406,0.006475891],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999471,0.00010180703,0.000017829178,0.00024649512,0.00010248425,0.00006036154],"domain_scores_gemma":[0.9992747,0.00035885614,0.000065608125,0.00014284096,0.00011331311,0.00004469492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006086453,0.0017122438,0.0010939093,0.0011041794,0.0005104776,0.00094984676,0.0030927677,0.0018103445,0.0049767415],"category_scores_gemma":[0.0025316097,0.00088345865,0.0019419158,0.0010843694,0.0009806022,0.0025010328,0.0014796152,0.002649728,0.0013322968],"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.00012324304,0.00009843989,0.0011564883,0.00018910438,0.00010916438,0.00019173787,0.00012879328,0.7411143,0.005536309,0.024152834,0.0116096595,0.21558991],"study_design_scores_gemma":[0.000010789213,0.0000136326,0.00008013769,0.0000068340146,0.000009519976,0.000028278157,0.000008450414,0.97838116,0.0010977,0.019153811,0.0012033619,0.000006231301],"about_ca_topic_score_codex":0.012749316,"about_ca_topic_score_gemma":0.021529235,"teacher_disagreement_score":0.012749316,"about_ca_system_score_codex":0.0021592593,"about_ca_system_score_gemma":0.0011551584,"threshold_uncertainty_score":0.025350213},"labels":[],"label_agreement":null},{"id":"W2997520586","doi":"10.1609/aaai.v34i03.5632","title":"Relative Attributing Propagation: Interpreting the Comparative Contributions of Individual Units in Deep Neural Networks","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea","keywords":"Deep neural networks; Relevance (law); Attribution; Computer science; Artificial neural network; Segmentation; Artificial intelligence; Perspective (graphical); Psychology; Social psychology","score_opus":0.12844193667783704,"score_gpt":0.31858244567677824,"score_spread":0.1901405089989412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997520586","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.20322077,0.0012050403,0.7859785,0.00077365595,0.00019402013,0.00011896599,0.00021099285,0.0016942414,0.00660382],"genre_scores_gemma":[0.87850636,0.0005058482,0.11830339,0.000113184746,0.00010804511,0.00006216972,0.00018774327,0.00034049287,0.0018727448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987041,0.00049638393,0.00006760889,0.00028937063,0.00031910738,0.00012341277],"domain_scores_gemma":[0.9931009,0.0040819165,0.0008996319,0.00090309134,0.00078799005,0.00022653698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055885627,0.001825485,0.00044849192,0.0027485553,0.00068404974,0.0023602287,0.0014748711,0.0013431278,0.002065136],"category_scores_gemma":[0.022489903,0.0005900523,0.0006649994,0.0018603242,0.0020236878,0.0050571403,0.0024162887,0.002266387,0.0003936101],"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.0012803583,0.00016245004,0.026033208,0.0004790778,0.0002802282,0.0006681758,0.0031585745,0.23137595,0.03957356,0.06314232,0.002684212,0.63116187],"study_design_scores_gemma":[0.000045511682,0.00025006544,0.014333505,0.00016131754,0.00028073252,0.0003272934,0.0006149128,0.7819444,0.040046293,0.15722042,0.0046597943,0.00011583165],"about_ca_topic_score_codex":0.0019436762,"about_ca_topic_score_gemma":0.0021349937,"teacher_disagreement_score":0.0055885627,"about_ca_system_score_codex":0.0009059682,"about_ca_system_score_gemma":0.0007292479,"threshold_uncertainty_score":0.0295555},"labels":[],"label_agreement":null},{"id":"W2997669297","doi":"10.1609/aaai.v34i04.6034","title":"Hierarchically Clustered Representation Learning","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Text and Document Classification Technologies","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":"Kootenay Association for Science & Technology","funders":"National Research Foundation of Korea; National Research Foundation","keywords":"Cluster analysis; Embedding; Representation (politics); Feature learning; Artificial intelligence; Computer science; Abstraction; Hierarchy; Focus (optics); Pattern recognition (psychology); Space (punctuation); Hierarchical clustering; Machine learning","score_opus":0.12446907518370981,"score_gpt":0.31134846949460937,"score_spread":0.18687939431089956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997669297","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.01765343,0.00041798083,0.977234,0.00025648362,0.000036823745,0.00009179264,0.00027185775,0.0021607697,0.0018767917],"genre_scores_gemma":[0.40909275,0.0005290569,0.5785244,0.000602188,0.000101027086,0.0003074866,0.003996459,0.0005528529,0.006293711],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974566,0.0007018608,0.00011009009,0.00093824556,0.00053041166,0.00026271684],"domain_scores_gemma":[0.9975957,0.00070101005,0.00023336972,0.000713034,0.0006273383,0.00012955096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018668808,0.0016340293,0.0014175511,0.0016902897,0.00069976755,0.001653166,0.0028217058,0.0020423322,0.002893978],"category_scores_gemma":[0.006413823,0.00062397565,0.0014814755,0.002123929,0.0011241646,0.0041437712,0.0026125258,0.0025043197,0.0015355984],"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.00020938565,0.00029507955,0.0024233342,0.0003121593,0.0002102575,0.00011046357,0.0003681803,0.35800663,0.011179332,0.06010599,0.01999485,0.54678434],"study_design_scores_gemma":[0.000013736164,0.00006785601,0.00018300883,0.000015241249,0.000017283875,0.000035528632,0.000034740948,0.96769273,0.002689136,0.02771224,0.0015244085,0.000014213127],"about_ca_topic_score_codex":0.005982845,"about_ca_topic_score_gemma":0.007948838,"teacher_disagreement_score":0.005982845,"about_ca_system_score_codex":0.001991119,"about_ca_system_score_gemma":0.001956419,"threshold_uncertainty_score":0.014446676},"labels":[],"label_agreement":null},{"id":"W2997720193","doi":"10.1609/aaai.v34i04.6116","title":"Efficient Projection-Free Online Methods with Stochastic Recursive Gradient","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","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":"Western University","funders":"Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Regret; Logarithm; Projection (relational algebra); Mathematical optimization; Computer science; Estimator; Regular polygon; Convex optimization; Algorithm; Mathematics; Machine learning","score_opus":0.3080010328745577,"score_gpt":0.46401449363521663,"score_spread":0.15601346076065892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997720193","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.0027584052,0.0001979727,0.9951154,0.00010982007,0.00003411398,0.000049660026,0.00002284898,0.00071562047,0.0009960543],"genre_scores_gemma":[0.2403924,0.00041551815,0.7509178,0.00036532275,0.00018162168,0.00053282094,0.0003441227,0.0005375238,0.006312888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987143,0.00045752883,0.00005216731,0.00019239633,0.00043499074,0.0001486297],"domain_scores_gemma":[0.99715555,0.0018050899,0.00020005082,0.000356664,0.00032866685,0.00015392457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016640171,0.001782725,0.0017349437,0.00060491747,0.0005708696,0.0011559784,0.0025379078,0.0018889155,0.0045466362],"category_scores_gemma":[0.0068154708,0.0009517451,0.0009327964,0.0007802099,0.0013351433,0.0021701388,0.0026145095,0.0031814277,0.0017853642],"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.00023956563,0.00020070956,0.00035845189,0.00020954954,0.00008158907,0.000098094264,0.000090592934,0.7544181,0.0036545165,0.032213774,0.005769426,0.20266567],"study_design_scores_gemma":[0.000015876236,0.000017841281,0.000021311613,0.000004653746,0.0000031944182,0.0000127586645,0.0000034434288,0.9949523,0.00040892945,0.004175416,0.0003795134,0.0000047168414],"about_ca_topic_score_codex":0.0041498365,"about_ca_topic_score_gemma":0.005409098,"teacher_disagreement_score":0.0045466362,"about_ca_system_score_codex":0.00073083444,"about_ca_system_score_gemma":0.0026412145,"threshold_uncertainty_score":0.015210032},"labels":[],"label_agreement":null},{"id":"W2997772410","doi":"10.1609/aaai.v34i02.5593","title":"Can We Predict the Election Outcome from Sampled Votes?","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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 Toronto","funders":"","keywords":"Voting; Outcome (game theory); Cardinal voting systems; Majority rule; Group decision-making; Computer science; Set (abstract data type); Focus (optics); Bullet voting; Anti-plurality voting; Scoring rule; Distribution (mathematics); Social choice theory; Decision rule; Mathematical economics; Econometrics; Mathematics; Psychology; Artificial intelligence; Social psychology; Political science; Machine learning","score_opus":0.16506886823427117,"score_gpt":0.27537087784088154,"score_spread":0.11030200960661038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997772410","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.5139837,0.0014422638,0.45740634,0.008146253,0.0005962036,0.00037290028,0.0034575136,0.00092679844,0.013667998],"genre_scores_gemma":[0.97530943,0.00035513748,0.019176427,0.00066050934,0.00023456526,0.00019429479,0.0017869794,0.00007054153,0.002212139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972275,0.0013625016,0.00013219762,0.0006118086,0.0003796814,0.0002862773],"domain_scores_gemma":[0.9757178,0.017899198,0.0016796374,0.0023809117,0.0018727524,0.00044971632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006984872,0.000620333,0.002030932,0.0014039221,0.00061243086,0.002335826,0.0020706435,0.0020224247,0.004707593],"category_scores_gemma":[0.07439241,0.00055542483,0.00071115413,0.0014535243,0.001408682,0.006371943,0.0010259692,0.0026314838,0.0020887852],"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.0017790156,0.0006938317,0.23289393,0.00075413333,0.00077077595,0.0003704021,0.000918672,0.3287406,0.0019400427,0.09957938,0.018097356,0.3134619],"study_design_scores_gemma":[0.00019042859,0.00019986973,0.025785698,0.00011527366,0.000086321495,0.00016016622,0.0002764094,0.79147375,0.0014056746,0.17663446,0.003595909,0.00007602081],"about_ca_topic_score_codex":0.0041680094,"about_ca_topic_score_gemma":0.0053965915,"teacher_disagreement_score":0.006984872,"about_ca_system_score_codex":0.001043198,"about_ca_system_score_gemma":0.00071231736,"threshold_uncertainty_score":0.03693998},"labels":[],"label_agreement":null},{"id":"W2997778743","doi":"10.1609/aaai.v34i01.5406","title":"Predictive Student Modeling in Educational Games with Multi-Task Learning","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Social Sciences and Humanities Research Council of Canada; National Science Foundation","keywords":"Formative assessment; Computer science; Task (project management); TRACE (psycholinguistics); Test (biology); Artificial intelligence; Machine learning; Mathematics education; Psychology","score_opus":0.10956730777478942,"score_gpt":0.30154303697741625,"score_spread":0.19197572920262684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997778743","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.31498432,0.0005222117,0.6801284,0.0006991284,0.00008390794,0.00014202384,0.00025378825,0.0014676619,0.0017186328],"genre_scores_gemma":[0.95235085,0.00012241691,0.04542823,0.00013856277,0.000031522362,0.00012889237,0.00019102267,0.00004591475,0.0015624777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993154,0.00028071212,0.00003546272,0.00020475344,0.00007526713,0.00008838544],"domain_scores_gemma":[0.9976927,0.0016406374,0.0001916029,0.00014215393,0.00021041455,0.00012247602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017975465,0.0011003049,0.0008490292,0.00068886275,0.00037926398,0.0013266766,0.0015736596,0.0011230129,0.0009853796],"category_scores_gemma":[0.0059479107,0.0006603657,0.00084593473,0.0005675813,0.0006875863,0.002054164,0.001366995,0.0022597215,0.00033530185],"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.0002019235,0.00020105726,0.0030979044,0.00005168297,0.00006971252,0.00007208448,0.00025192124,0.929126,0.0013272337,0.0021871787,0.00045592734,0.06295727],"study_design_scores_gemma":[0.0000034702468,0.000021665704,0.00021813849,0.0000023691448,0.000003847963,0.0000041215467,0.00000935705,0.99745935,0.00021519777,0.0019966068,0.00006184676,0.000004036159],"about_ca_topic_score_codex":0.011202693,"about_ca_topic_score_gemma":0.015480112,"teacher_disagreement_score":0.011202693,"about_ca_system_score_codex":0.0012133862,"about_ca_system_score_gemma":0.0009990642,"threshold_uncertainty_score":0.022274971},"labels":[],"label_agreement":null},{"id":"W2997788840","doi":"10.1609/aaai.v34i06.6589","title":"BOWL: Bayesian Optimization for Weight Learning in Probabilistic Soft Logic","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Air Force Research Laboratory; National Science Foundation; Advanced Research Projects Agency; Defense Advanced Research Projects Agency; Institut de Valorisation des Données; Canada First Research Excellence Fund","keywords":"Artificial intelligence; Computer science; Machine learning; Statistical relational learning; Probabilistic logic; Robustness (evolution); Metric (unit); Gaussian process; Data mining; Gaussian; Relational database","score_opus":0.07613362771478273,"score_gpt":0.29558453698937487,"score_spread":0.21945090927459215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997788840","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.0019363048,0.00013317664,0.996256,0.00014485183,0.00001723701,0.000035394027,0.00006148029,0.0006940711,0.000721505],"genre_scores_gemma":[0.18822618,0.00050144305,0.80357933,0.0006665544,0.00014523295,0.0005074683,0.0009292103,0.0010503978,0.0043942044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99659246,0.0011821521,0.0001523531,0.0005192632,0.0013625796,0.00019118053],"domain_scores_gemma":[0.9971091,0.001686748,0.00024622382,0.00028426046,0.000558787,0.00011497534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004964638,0.001655007,0.001927739,0.0021355168,0.00076295814,0.0022305823,0.0032472317,0.0019214978,0.005367938],"category_scores_gemma":[0.015144733,0.0010871529,0.0013778816,0.002307821,0.0014929987,0.00430977,0.0034636094,0.0034359382,0.0018091765],"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.00012458944,0.0002009445,0.0012527923,0.00023452433,0.00015561817,0.00007106106,0.00015005941,0.5548172,0.0023030788,0.0682969,0.010028028,0.36236522],"study_design_scores_gemma":[0.00001024677,0.00001599727,0.000046108642,0.0000129854,0.000006950166,0.000010988055,0.000008420287,0.9675472,0.00052971364,0.030959839,0.0008447562,0.0000069092457],"about_ca_topic_score_codex":0.0051862034,"about_ca_topic_score_gemma":0.007248211,"teacher_disagreement_score":0.005367938,"about_ca_system_score_codex":0.0022525212,"about_ca_system_score_gemma":0.002610057,"threshold_uncertainty_score":0.026255786},"labels":[],"label_agreement":null},{"id":"W2997790181","doi":"10.1609/aaai.v34i04.5821","title":"Robust Stochastic Bandit Algorithms under Probabilistic Unbounded Adversarial Attack","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","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":"Lockheed Martin (Canada)","funders":"Division of Electrical, Communications and Cyber Systems; National Science Foundation","keywords":"Regret; Sublinear function; Probabilistic logic; Attack model; Computer science; Bounded function; Expected value; Algorithm; Adversary; Mathematical optimization; Mathematics; Discrete mathematics; Artificial intelligence; Machine learning; Computer security; Statistics","score_opus":0.4478936109603608,"score_gpt":0.4201507851199051,"score_spread":0.027742825840455676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997790181","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.03041013,0.0004159793,0.9647522,0.00040983193,0.000042906333,0.00006586545,0.00006219766,0.0005298544,0.0033110862],"genre_scores_gemma":[0.8655829,0.00039577088,0.13064879,0.00032379784,0.00008337233,0.00021665823,0.00012314865,0.00011198909,0.0025134753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976162,0.0009844239,0.00010942007,0.00038791506,0.0004956981,0.00040640534],"domain_scores_gemma":[0.99154574,0.0057905964,0.0011776775,0.00077386596,0.00042717424,0.0002849363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037302228,0.0012205841,0.0019601814,0.0007269806,0.0008370581,0.0019440128,0.0020488182,0.0016820768,0.0013306633],"category_scores_gemma":[0.0123781925,0.00055010803,0.0007663362,0.0011075252,0.0018627004,0.0020034926,0.0021268195,0.0021485905,0.0004426282],"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.00013231309,0.00003223642,0.00026685063,0.000033328586,0.000031464002,0.00003129683,0.00003557252,0.96265906,0.0006637439,0.023501094,0.00053901813,0.012074045],"study_design_scores_gemma":[0.000011139499,0.000018294186,0.000033745535,0.000004585763,0.000003622085,0.000013075476,0.0000047008816,0.9881827,0.00022835558,0.011366744,0.0001291817,0.0000037669006],"about_ca_topic_score_codex":0.0027365047,"about_ca_topic_score_gemma":0.0016834507,"teacher_disagreement_score":0.0037302228,"about_ca_system_score_codex":0.0018543792,"about_ca_system_score_gemma":0.0018261558,"threshold_uncertainty_score":0.019727528},"labels":[],"label_agreement":null},{"id":"W2997820257","doi":"10.1609/aaai.v34i07.6628","title":"Diversity Transfer Network for Few-Shot Learning","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute","funders":"National Natural Science Foundation of China","keywords":"Computer science; Artificial intelligence; Transfer of learning; Classifier (UML); Negative transfer; Machine learning; Generative grammar; Feature vector; Code (set theory); Feature (linguistics); Task (project management)","score_opus":0.16750594347475917,"score_gpt":0.29090375327538814,"score_spread":0.12339780980062898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997820257","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.02877291,0.0010318016,0.9645139,0.0004390337,0.000101123645,0.000107947904,0.00022760831,0.0018288057,0.0029767975],"genre_scores_gemma":[0.76287115,0.0006586069,0.22462179,0.00080080057,0.00018015332,0.00046591696,0.0015014488,0.000298448,0.008601658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946886,0.00013137041,0.000021715525,0.00020831153,0.000104691586,0.000065069165],"domain_scores_gemma":[0.9990138,0.00052524987,0.00007130966,0.00015814207,0.00015723931,0.00007430554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012960094,0.001149004,0.0012718176,0.0007843557,0.00067080144,0.00078351196,0.0027909693,0.001900979,0.0031221523],"category_scores_gemma":[0.004285025,0.0005096185,0.00082161644,0.00075148325,0.0011823114,0.0022350557,0.0019473593,0.0026696955,0.0009595626],"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.00023154281,0.00024677638,0.0014767153,0.00022294336,0.0001388566,0.00022455954,0.00021197702,0.6240854,0.01183586,0.019497192,0.007866574,0.33396164],"study_design_scores_gemma":[0.000007268047,0.00002583503,0.000096106036,0.000006386263,0.0000070278047,0.000028341563,0.000007804559,0.98809403,0.0012683353,0.009944808,0.00050739315,0.000006640492],"about_ca_topic_score_codex":0.0040518628,"about_ca_topic_score_gemma":0.0051071034,"teacher_disagreement_score":0.0040518628,"about_ca_system_score_codex":0.0013917151,"about_ca_system_score_gemma":0.0009028087,"threshold_uncertainty_score":0.010444641},"labels":[],"label_agreement":null},{"id":"W2997834681","doi":"10.1609/aaai.v34i02.5592","title":"The Surprising Power of Hiding Information in Facility Location","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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":"Facility location problem; Novelty; Computer science; Line (geometry); Power (physics); Artificial intelligence; Operations research; Mathematics","score_opus":0.10162766712006609,"score_gpt":0.25519604405802315,"score_spread":0.15356837693795705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997834681","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.18314868,0.002040973,0.7706881,0.014435597,0.00016574418,0.00020174711,0.00040719635,0.00044334913,0.028468579],"genre_scores_gemma":[0.95764804,0.00088416843,0.037290618,0.000748932,0.00018717925,0.00015315798,0.000087911896,0.00007010144,0.002929845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9806253,0.012049714,0.00096526864,0.002390478,0.002845968,0.0011234074],"domain_scores_gemma":[0.7970278,0.13878523,0.025500985,0.033787485,0.0032392226,0.0016593181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018174455,0.0008105422,0.0021412708,0.0013393097,0.0020482116,0.0052725533,0.0037181356,0.0061527966,0.004471673],"category_scores_gemma":[0.10750565,0.0012974876,0.0020021638,0.0022371525,0.009523533,0.013383528,0.005444579,0.00662749,0.00077560754],"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.0005568356,0.00013391727,0.0060412646,0.00051721145,0.00032589427,0.0005952472,0.0014598789,0.05528763,0.004359821,0.87816733,0.0034962902,0.049058758],"study_design_scores_gemma":[0.00023632833,0.0001767784,0.0016140834,0.00010439897,0.00016602123,0.00063116255,0.00029312188,0.07524862,0.0033624656,0.9109299,0.007140893,0.0000962363],"about_ca_topic_score_codex":0.0013909361,"about_ca_topic_score_gemma":0.00077214226,"teacher_disagreement_score":0.018174455,"about_ca_system_score_codex":0.0025400163,"about_ca_system_score_gemma":0.0015990622,"threshold_uncertainty_score":0.09611684},"labels":[],"label_agreement":null},{"id":"W2997837663","doi":"10.1609/aaai.v34i04.5852","title":"An Efficient Explorative Sampling Considering the Generative Boundaries of Deep Generative Neural Networks","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Generative Adversarial Networks and Image Synthesis","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":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; National Research Foundation of Korea; National Research Foundation","keywords":"Generative grammar; Computer science; Artificial neural network; Artificial intelligence; Generative model; Set (abstract data type); Sampling (signal processing); Generative adversarial network; Image (mathematics); Mechanism (biology); Perspective (graphical); Adversarial system; Homogeneous; Pattern recognition (psychology); Scheme (mathematics); Machine learning; Computer vision; Mathematics","score_opus":0.10792846815467992,"score_gpt":0.292621238046231,"score_spread":0.1846927698915511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997837663","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.021825556,0.000117090625,0.97687554,0.0000909857,0.000011292559,0.00002980768,0.000014440525,0.0002112469,0.00082398125],"genre_scores_gemma":[0.69939697,0.0001725708,0.29739594,0.00020517145,0.00003546758,0.00014699248,0.00012773316,0.00016825776,0.0023509369],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959165,0.00014101728,0.000016732449,0.0000980583,0.00010052413,0.00005207554],"domain_scores_gemma":[0.9985863,0.0009282467,0.00011689103,0.0001700234,0.00012031666,0.00007819103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013396012,0.00062165107,0.00080097304,0.0005010952,0.00047245843,0.00066775124,0.0010620913,0.0009628036,0.0010526151],"category_scores_gemma":[0.0040649436,0.00054807134,0.0006945076,0.00034897716,0.0013056744,0.0011474792,0.0018566321,0.0011747417,0.00021266317],"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.00016145053,0.00003616265,0.0014785292,0.00006058386,0.000033702985,0.00018641558,0.00021989457,0.8842459,0.012292077,0.033662997,0.00097287446,0.066649385],"study_design_scores_gemma":[0.0000047838957,0.000012292712,0.00005101888,0.0000038184216,0.0000031258992,0.000024763827,0.0000055757496,0.993057,0.0013393156,0.0052895546,0.00020506796,0.0000035990133],"about_ca_topic_score_codex":0.0016971639,"about_ca_topic_score_gemma":0.0016797859,"teacher_disagreement_score":0.0016971639,"about_ca_system_score_codex":0.00078485144,"about_ca_system_score_gemma":0.0007051999,"threshold_uncertainty_score":0.0070845485},"labels":[],"label_agreement":null},{"id":"W2997847174","doi":"10.1609/aaai.v34i05.6430","title":"TreeGen: A Tree-Based Transformer Architecture for Code Generation","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Software Engineering Research","field":"Computer Science","cited_by":163,"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":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Python (programming language); Code generation; Parsing; Programming language; Parse tree; Redundant code; Encoder; Source code; Abstract syntax tree; Artificial intelligence; Theoretical computer science; Operating system","score_opus":0.12118065944043592,"score_gpt":0.30576729455314144,"score_spread":0.1845866351127055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997847174","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.014219388,0.00039002634,0.90267533,0.0002534108,0.000101648766,0.00020032741,0.00091935974,0.077011846,0.0042286096],"genre_scores_gemma":[0.22201927,0.0005611795,0.75683886,0.0005404636,0.00003942374,0.00041871908,0.005590188,0.004716355,0.009275631],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963844,0.00006185934,0.000026164307,0.00012691853,0.00011206323,0.0000344991],"domain_scores_gemma":[0.9992675,0.00029264638,0.000048036447,0.00019821376,0.0001579552,0.000035680845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061657804,0.00076530065,0.00035291,0.00083063764,0.00031468898,0.00065042556,0.0028368186,0.0008061489,0.006474998],"category_scores_gemma":[0.0024711534,0.0006115641,0.00076937285,0.000684381,0.00060817733,0.0027078448,0.001095465,0.0013896041,0.0022832693],"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.0004714823,0.00031545968,0.0032305566,0.0006684947,0.00016045907,0.00034290308,0.00031101945,0.13527605,0.0318538,0.029253528,0.06003231,0.738084],"study_design_scores_gemma":[0.00006061793,0.00011610944,0.00038191333,0.000030211066,0.000053057025,0.00016483432,0.00002541597,0.9347256,0.02671577,0.01779464,0.019902812,0.00002895227],"about_ca_topic_score_codex":0.0072590723,"about_ca_topic_score_gemma":0.01185979,"teacher_disagreement_score":0.0072590723,"about_ca_system_score_codex":0.0010306264,"about_ca_system_score_gemma":0.0014593098,"threshold_uncertainty_score":0.021661043},"labels":[],"label_agreement":null},{"id":"W2997919746","doi":"10.1609/aaai.v34i05.6304","title":"Leveraging Multi-Token Entities in Document-Level Named Entity Recognition","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","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":"Université de Montréal","funders":"Fundamental Research Funds for the Central Universities; Renmin University of China; National Natural Science Foundation of China","keywords":"Security token; Computer science; Context (archaeology); Sentence; Task (project management); Natural language processing; Artificial intelligence; Named-entity recognition; Relevance (law); Annotation; Process (computing); Entity linking; Information retrieval; Knowledge base; Programming language","score_opus":0.24879956231443004,"score_gpt":0.30830610231452815,"score_spread":0.05950654000009811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997919746","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.041372433,0.0029094392,0.9400608,0.000539826,0.00034833152,0.00021903636,0.0019035194,0.008688387,0.0039581917],"genre_scores_gemma":[0.4930029,0.0018202197,0.4846482,0.00053313305,0.00031782893,0.00016694427,0.010121705,0.0005129897,0.008876036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986469,0.00026372308,0.00014675054,0.0006271023,0.00020413875,0.0001113423],"domain_scores_gemma":[0.9975339,0.0010878097,0.00027048288,0.0005628554,0.00045072768,0.00009423119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022196486,0.0011740078,0.0012292495,0.0031392956,0.0006760248,0.0014704682,0.0018464881,0.001499543,0.0020403417],"category_scores_gemma":[0.0042543085,0.00041431276,0.001341505,0.002951437,0.00063670654,0.007075618,0.0017469566,0.0017804353,0.0026023681],"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.00078731484,0.00034713122,0.008835184,0.0007454527,0.00036645308,0.0013666953,0.00059293234,0.039807312,0.061773337,0.01030858,0.020108955,0.8549606],"study_design_scores_gemma":[0.00005103833,0.00030340411,0.009817806,0.00014102674,0.0005723107,0.0018259123,0.0003064707,0.82395625,0.08247399,0.030409893,0.04992615,0.00021584077],"about_ca_topic_score_codex":0.0041031837,"about_ca_topic_score_gemma":0.008044108,"teacher_disagreement_score":0.0041031837,"about_ca_system_score_codex":0.0006700845,"about_ca_system_score_gemma":0.0006846286,"threshold_uncertainty_score":0.011738777},"labels":[],"label_agreement":null},{"id":"W2997940961","doi":"10.1609/aaai.v34i05.6214","title":"Multi-Agent Actor-Critic with Hierarchical Graph Attention Network","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":124,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Ministry of Science and ICT, South Korea; National Research Foundation of Korea; National Research Foundation","keywords":"Computer science; Reinforcement learning; Transferability; Artificial intelligence; Graph; Attention network; Machine learning; Representation (politics); Theoretical computer science","score_opus":0.08352121217448213,"score_gpt":0.28645645522763924,"score_spread":0.2029352430531571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997940961","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.036225203,0.00049453456,0.95548815,0.0006288331,0.00009877664,0.0000716149,0.00007745441,0.00081702083,0.006098394],"genre_scores_gemma":[0.9301597,0.00022084704,0.0632168,0.00026536573,0.000045620585,0.00014516925,0.00011662564,0.00006822373,0.0057617603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999511,0.00015873206,0.000018037897,0.00013015009,0.00010775293,0.000074452364],"domain_scores_gemma":[0.9992144,0.00044391843,0.00008952048,0.00005104996,0.00013505139,0.00006600417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010018655,0.0011331064,0.0009258629,0.0004791618,0.00040966467,0.00078458444,0.001761681,0.0014452395,0.00213229],"category_scores_gemma":[0.002660104,0.00048792802,0.00049845607,0.00055774266,0.0008926905,0.0011047823,0.0010212313,0.0014596177,0.00038420456],"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.00003641118,0.000020197109,0.00026611856,0.000018438917,0.000019567982,0.000039301598,0.000019729468,0.9837605,0.0005146978,0.0054881023,0.0005175354,0.009299433],"study_design_scores_gemma":[0.000003645541,0.000004045719,0.000022467551,7.9000665e-7,0.0000019635204,0.000002071327,8.3503744e-7,0.99870324,0.000062548934,0.0011320217,0.00006525781,0.0000011373612],"about_ca_topic_score_codex":0.01661039,"about_ca_topic_score_gemma":0.0150256455,"teacher_disagreement_score":0.01661039,"about_ca_system_score_codex":0.0014560181,"about_ca_system_score_gemma":0.0015254783,"threshold_uncertainty_score":0.03302741},"labels":[],"label_agreement":null},{"id":"W2997948740","doi":"10.1609/aaai.v34i07.6893","title":"Region-Based Global Reasoning Networks","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Multimodal Machine Learning Applications","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":"Western University","funders":"Higher Education Discipline Innovation Project; National Natural Science Foundation of China","keywords":"Computer science; Benchmark (surveying); Focus (optics); Visual reasoning; Artificial intelligence; Pixel; Semantics (computer science); Action (physics); Machine learning; Geography; Cartography","score_opus":0.07076003573598823,"score_gpt":0.3006842134052787,"score_spread":0.22992417766929046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997948740","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.014586561,0.00055745087,0.97921705,0.00024529395,0.000027757973,0.00006971024,0.00035925614,0.0018352132,0.0031016222],"genre_scores_gemma":[0.50448644,0.0009452432,0.4827731,0.0003818888,0.0000883681,0.00018204747,0.0019168442,0.00035771032,0.008868365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989309,0.00012905271,0.000054308694,0.0005392976,0.00024852488,0.000097973476],"domain_scores_gemma":[0.9988739,0.0003637986,0.00019302146,0.00024128973,0.00025545206,0.00007252484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012105792,0.0016148922,0.0010516108,0.001864012,0.0007821881,0.0019304914,0.0034244661,0.001923851,0.00538397],"category_scores_gemma":[0.0034566133,0.0007096525,0.0017127785,0.0015716426,0.0011115745,0.0045995493,0.0020158668,0.0016746281,0.0013737475],"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.0003031903,0.00014607342,0.0026460649,0.0002871808,0.00020000822,0.0003611961,0.00053817703,0.48764178,0.014058017,0.051797222,0.0074859275,0.43453512],"study_design_scores_gemma":[0.000014996359,0.000042357242,0.00052448665,0.000026080908,0.000073389085,0.000085696025,0.000058257487,0.9538874,0.00455783,0.03713843,0.0035715296,0.000019561063],"about_ca_topic_score_codex":0.009171126,"about_ca_topic_score_gemma":0.01197185,"teacher_disagreement_score":0.009171126,"about_ca_system_score_codex":0.0014120437,"about_ca_system_score_gemma":0.0011306249,"threshold_uncertainty_score":0.018235505},"labels":[],"label_agreement":null},{"id":"W2997949445","doi":"10.1609/aaai.v34i02.5588","title":"Limitations of Incentive Compatibility on Discrete Type Spaces","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","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":"Incentive compatibility; Incentive; Compatibility (geochemistry); Convex hull; Computer science; Mathematical economics; Mathematical optimization; Regular polygon; Mathematics; Microeconomics; Economics; Engineering","score_opus":0.5150986881618568,"score_gpt":0.4138578682538218,"score_spread":0.10124081990803496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997949445","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.026801607,0.0012537477,0.92888427,0.012046503,0.00032170807,0.00033887336,0.00035836524,0.0003186643,0.029676288],"genre_scores_gemma":[0.6759849,0.0018077624,0.30892512,0.0041845716,0.000977937,0.0016111173,0.00034019983,0.00028896928,0.0058793174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9385643,0.036780886,0.0036338484,0.0066331723,0.0125364605,0.0018514129],"domain_scores_gemma":[0.75332314,0.19598024,0.008267901,0.031747263,0.007665648,0.0030157815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.06337902,0.0015792835,0.004505853,0.0012836753,0.0022546742,0.007988353,0.006709893,0.0057125064,0.010711909],"category_scores_gemma":[0.22339402,0.0021167507,0.0030158584,0.0021053096,0.0108881295,0.025472859,0.010524134,0.01645783,0.0016494853],"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.00009825109,0.00006118548,0.0004777267,0.00016734941,0.000041019306,0.00006245291,0.00024606092,0.010721078,0.00035497575,0.96872073,0.0012295984,0.017819518],"study_design_scores_gemma":[0.00007362089,0.000082692204,0.00012821674,0.00008972473,0.000013349218,0.00013010725,0.00006502556,0.031126399,0.00040769854,0.96398413,0.0038712143,0.000027820726],"about_ca_topic_score_codex":0.0006767204,"about_ca_topic_score_gemma":0.00032257516,"teacher_disagreement_score":0.06337902,"about_ca_system_score_codex":0.00233356,"about_ca_system_score_gemma":0.0028295373,"threshold_uncertainty_score":0.33518428},"labels":[],"label_agreement":null},{"id":"W2997999303","doi":"10.1609/aaai.v34i04.6182","title":"Safe Sample Screening for Robust Support Vector Machine","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Face and Expression Recognition","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":"Western University","funders":"Government of Jiangsu Province; National Natural Science Foundation of China","keywords":"Benchmark (surveying); Computer science; Solver; Sample (material); Generalization; Mathematical optimization; Support vector machine; Convex optimization; Machine learning; Artificial intelligence; Regular polygon; Mathematics","score_opus":0.1738317798494326,"score_gpt":0.3038440701750817,"score_spread":0.1300122903256491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997999303","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.0048492905,0.00013611428,0.9931144,0.00014270953,0.000019016526,0.0000715503,0.000039644314,0.0011768631,0.00045039682],"genre_scores_gemma":[0.32278425,0.00027997806,0.67246675,0.0004966934,0.000108969056,0.00067040446,0.00064568274,0.0008455755,0.0017017464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935236,0.0025615487,0.00042203162,0.0008976044,0.0021387748,0.00045650237],"domain_scores_gemma":[0.9845637,0.009577887,0.0011343422,0.0018326612,0.0024697045,0.00042162905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006180972,0.0019450606,0.0017648628,0.0014324432,0.00096992153,0.001720095,0.002612464,0.002169327,0.003089075],"category_scores_gemma":[0.036593456,0.0009951475,0.0016398107,0.0009810517,0.0022290905,0.0027532657,0.003679341,0.0036181184,0.0012835714],"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.0006066126,0.00020935119,0.0033590272,0.00039466706,0.00014817514,0.0005316241,0.00025413488,0.5930447,0.013494591,0.06365458,0.008081537,0.31622103],"study_design_scores_gemma":[0.000018040348,0.00005621881,0.00009589654,0.000013848448,0.000006288398,0.00003763049,0.0000108624445,0.98222095,0.003649565,0.013275291,0.0006036554,0.000011738586],"about_ca_topic_score_codex":0.0018664072,"about_ca_topic_score_gemma":0.0016102102,"teacher_disagreement_score":0.006180972,"about_ca_system_score_codex":0.0008660091,"about_ca_system_score_gemma":0.0030377256,"threshold_uncertainty_score":0.0326885},"labels":[],"label_agreement":null},{"id":"W2998004016","doi":"10.1609/aaai.v34i01.5475","title":"OF-MSRN: Optical Flow-Auxiliary Multi-Task Regression Network for Direct Quantitative Measurement, Segmentation and Motion Estimation","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Cerebrovascular and Carotid Artery Diseases","field":"Medicine","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":"Western University","funders":"National Natural Science Foundation of China","keywords":"Optical flow; Segmentation; Computer science; Artificial intelligence; Computer vision; Motion estimation; Artifact (error); Pattern recognition (psychology); Image (mathematics)","score_opus":0.14019951718911564,"score_gpt":0.33605443310716004,"score_spread":0.1958549159180444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998004016","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.019566357,0.0005452044,0.976716,0.00024276778,0.00008180254,0.000059275277,0.00015149615,0.001405317,0.001231924],"genre_scores_gemma":[0.585676,0.00063488935,0.40325952,0.0006420627,0.00026959364,0.0003246169,0.001231078,0.0003405147,0.0076218517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993703,0.00019411262,0.000024501736,0.00021245223,0.000113842696,0.00008469007],"domain_scores_gemma":[0.99914896,0.0003987985,0.00012331594,0.00008238329,0.0002000516,0.000046412293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015425289,0.0015221193,0.0010861104,0.00067822955,0.00033768444,0.0005712054,0.001671214,0.0013170827,0.0015169343],"category_scores_gemma":[0.0033332044,0.00046317102,0.00095610763,0.00065906165,0.00047096267,0.0010405142,0.0009818624,0.0012842489,0.0005402247],"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.00040616468,0.00028436378,0.0023637326,0.00017345879,0.00018641134,0.00018021918,0.000094394105,0.59195757,0.023861565,0.0039177528,0.0064303214,0.37014404],"study_design_scores_gemma":[0.000005937908,0.000031145486,0.00019363133,0.000003818018,0.000009778498,0.000019503066,0.0000029623884,0.99738413,0.0011837824,0.00076146855,0.00039824026,0.00000571746],"about_ca_topic_score_codex":0.005514313,"about_ca_topic_score_gemma":0.005610209,"teacher_disagreement_score":0.005514313,"about_ca_system_score_codex":0.00078062,"about_ca_system_score_gemma":0.00090975297,"threshold_uncertainty_score":0.010964453},"labels":[],"label_agreement":null},{"id":"W2998030398","doi":"10.1609/aaai.v34i05.6219","title":"Generalized and Sub-Optimal Bipartite Constraints for Conflict-Based Search","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Lockheed Martin; National Science Foundation","keywords":"Bipartite graph; Constraint (computer-aided design); Mathematical optimization; Computer science; Reduction (mathematics); Graph; Pathfinding; Search algorithm; State (computer science); Theoretical computer science; Algorithm; Mathematics; Shortest path problem","score_opus":0.15937628050591027,"score_gpt":0.32233591005917805,"score_spread":0.1629596295532678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998030398","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.004254351,0.00011534916,0.9912533,0.000103789054,0.000022609602,0.000072801166,0.000106723885,0.0003468798,0.0037241806],"genre_scores_gemma":[0.11680385,0.00021573507,0.878936,0.00015895479,0.000028971212,0.00038710373,0.0006966777,0.00036169644,0.0024109774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980404,0.0009991549,0.00006446481,0.00023280493,0.0005370446,0.00012614726],"domain_scores_gemma":[0.99787533,0.0012448152,0.00013484289,0.00039016487,0.0002625936,0.00009229989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013812516,0.0010052812,0.000869785,0.0010884823,0.00067268766,0.0009960785,0.0018024524,0.0010488704,0.00905945],"category_scores_gemma":[0.0062222155,0.0006290172,0.00094936596,0.0018236638,0.001063826,0.0016529323,0.0022962946,0.0023208074,0.0014362884],"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.00013680958,0.00014184274,0.00036866564,0.00030094106,0.000053783344,0.00013812186,0.00015613747,0.69457877,0.0051769703,0.15268007,0.0059926813,0.14027514],"study_design_scores_gemma":[0.00002996286,0.000028132525,0.00007658569,0.000021887372,0.000009321082,0.000047721373,0.000022374192,0.9254269,0.0014750627,0.06784139,0.0050079483,0.000012754036],"about_ca_topic_score_codex":0.0037744364,"about_ca_topic_score_gemma":0.004867443,"teacher_disagreement_score":0.00905945,"about_ca_system_score_codex":0.00083844626,"about_ca_system_score_gemma":0.0015727587,"threshold_uncertainty_score":0.030306935},"labels":[],"label_agreement":null},{"id":"W2998070951","doi":"10.1609/aaai.v34i03.5699","title":"Towards Universal Languages for Tractable Ontology Mediated Query Answering","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Conjunctive query; Computer science; P; Query language; Ontology language; Locality; Ontology; Boolean conjunctive query; Theoretical computer science; Programming language; Artificial intelligence; Information retrieval; Time complexity; Web search query; Sargable; Linguistics; Algorithm; Semantic Web","score_opus":0.09381173772767637,"score_gpt":0.3027292792059528,"score_spread":0.2089175414782764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998070951","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.032989748,0.00049018575,0.95791894,0.0012317862,0.0000449197,0.00017166097,0.00030400496,0.0013618361,0.0054868786],"genre_scores_gemma":[0.51989377,0.0006378992,0.4729747,0.001136633,0.00019430416,0.0005930923,0.000772662,0.00052228523,0.0032746906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9923977,0.0025065015,0.00086869684,0.0015833661,0.0018156463,0.00082812493],"domain_scores_gemma":[0.982451,0.009817774,0.0012011294,0.003629415,0.002388952,0.0005117134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072395327,0.00070721965,0.0011308829,0.0016394585,0.0011960553,0.0039950265,0.0025189777,0.0016113949,0.0023306012],"category_scores_gemma":[0.022015272,0.0013622852,0.0028182555,0.0014752812,0.005382367,0.010302421,0.008360035,0.0053699343,0.0005196725],"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.000049771963,0.000054200766,0.00050977035,0.00024160769,0.000041927826,0.00021832788,0.001902751,0.008426848,0.0050761392,0.96437556,0.0013650021,0.017738195],"study_design_scores_gemma":[0.000044378226,0.000048467115,0.00019419767,0.00010846355,0.00007484767,0.0003352965,0.00064649206,0.08789264,0.008213564,0.88866955,0.013713754,0.00005826791],"about_ca_topic_score_codex":0.0025561713,"about_ca_topic_score_gemma":0.0020145704,"teacher_disagreement_score":0.0072395327,"about_ca_system_score_codex":0.0030558156,"about_ca_system_score_gemma":0.002607915,"threshold_uncertainty_score":0.038286805},"labels":[],"label_agreement":null},{"id":"W2998081612","doi":"10.1609/aaai.v34i05.6513","title":"Reinforced Curriculum Learning on Pre-Trained Neural Machine Translation Models","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":33,"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; Machine learning; Heuristics; Artificial intelligence; Artificial neural network; Reinforcement learning; Machine translation; Curriculum; Task (project management); Set (abstract data type); Sample (material); Baseline (sea)","score_opus":0.07127140276444606,"score_gpt":0.2974927484928364,"score_spread":0.22622134572839037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998081612","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.09941277,0.00089248514,0.89244145,0.000657719,0.00011627058,0.00015499469,0.00015204931,0.0018368278,0.0043353955],"genre_scores_gemma":[0.8632382,0.0003597666,0.1294917,0.00036560636,0.00010216704,0.0004025834,0.00049007684,0.0001787392,0.005371109],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929786,0.00028310015,0.00004073178,0.00020588886,0.00009049668,0.000081879516],"domain_scores_gemma":[0.9958611,0.0027893037,0.0003148709,0.0002681189,0.00060763495,0.00015910596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021659082,0.0013606993,0.0014880693,0.0006674385,0.0005176994,0.0008916087,0.0018060928,0.0014531458,0.0020011798],"category_scores_gemma":[0.010802254,0.00074710115,0.00062636164,0.00064020563,0.0011459499,0.0016818173,0.0013967601,0.002402052,0.00064856734],"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.000084968946,0.000081822305,0.00085195975,0.000077014556,0.000035173452,0.000065109314,0.00007601879,0.9274735,0.0013017965,0.004420809,0.0010516472,0.06448019],"study_design_scores_gemma":[0.000009768115,0.00002382514,0.000046369434,0.000006174077,0.0000043004325,0.000005467509,0.000002911856,0.9973775,0.0003333942,0.0020329517,0.00015451203,0.0000028046422],"about_ca_topic_score_codex":0.0053061265,"about_ca_topic_score_gemma":0.0066595655,"teacher_disagreement_score":0.0053061265,"about_ca_system_score_codex":0.001608183,"about_ca_system_score_gemma":0.0013785312,"threshold_uncertainty_score":0.011668205},"labels":[],"label_agreement":null},{"id":"W2998085019","doi":"10.1609/aaai.v34i05.6308","title":"Bayes-Adaptive Monte-Carlo Planning and Learning for Goal-Oriented Dialogues","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","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":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Iran Telecommunication Research Center; Ministry of Science and ICT, South Korea; Ministry of Trade, Industry and Energy; National Research Foundation","keywords":"Reinforcement learning; Computer science; Artificial intelligence; Machine learning; Task (project management); Negotiation; Bayesian probability; Bayes' theorem; Domain (mathematical analysis); Mathematics","score_opus":0.1257072937796065,"score_gpt":0.29278048377991567,"score_spread":0.16707319000030918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998085019","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.014175839,0.00015151063,0.98300606,0.00020660264,0.000029053552,0.0000527234,0.000025861867,0.00033772708,0.0020146125],"genre_scores_gemma":[0.6508335,0.00017337823,0.34600642,0.0002014359,0.00005187273,0.00025751945,0.00012395722,0.00012453094,0.0022273639],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986143,0.00071887055,0.000064164626,0.00021791672,0.00027581613,0.00010885228],"domain_scores_gemma":[0.99534,0.0037321632,0.00023423,0.00020986052,0.000319283,0.0001644607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002749465,0.00069755065,0.000947461,0.000502684,0.00053699734,0.00081290246,0.0015164027,0.0012171709,0.0025049734],"category_scores_gemma":[0.011400778,0.00064784574,0.00057057315,0.0003881044,0.0013443194,0.0013075679,0.001273081,0.0017577008,0.00044519402],"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.000099214936,0.00005322447,0.000654147,0.00005212015,0.000027460703,0.00005596499,0.00012287777,0.9440146,0.0008897332,0.021864386,0.0005385767,0.031627785],"study_design_scores_gemma":[0.0000061457363,0.0000065767013,0.000026852254,0.0000031373997,0.0000018286543,0.0000045778893,0.0000033827946,0.99288917,0.00018529505,0.0066901552,0.000180499,0.000002400532],"about_ca_topic_score_codex":0.00784755,"about_ca_topic_score_gemma":0.008603603,"teacher_disagreement_score":0.00784755,"about_ca_system_score_codex":0.0013494708,"about_ca_system_score_gemma":0.0020303223,"threshold_uncertainty_score":0.015603721},"labels":[],"label_agreement":null},{"id":"W2998116579","doi":"10.1609/aaai.v34i04.6086","title":"Reinforcement Learning with Perturbed Rewards","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":101,"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":"Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Reinforcement learning; Computer science; Noise (video); Confusion matrix; Artificial intelligence; Convergence (economics); Confusion; Set (abstract data type); Gaussian; Matrix (chemical analysis); Mathematical optimization; Machine learning; Algorithm; Mathematics","score_opus":0.060282473032491304,"score_gpt":0.27529961439256584,"score_spread":0.21501714136007455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998116579","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.024872988,0.00030713016,0.97186637,0.00036534833,0.00005015177,0.000068075984,0.00005753352,0.0005145414,0.0018978504],"genre_scores_gemma":[0.9246601,0.00017345576,0.07204021,0.0002539973,0.00005685918,0.00016827982,0.00012357396,0.00008477795,0.0024386405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975473,0.0010410146,0.0001274863,0.00055338716,0.00047272857,0.00025812173],"domain_scores_gemma":[0.9928646,0.004687838,0.00086045754,0.0005263369,0.0007574988,0.00030323034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030724138,0.0014337711,0.001550443,0.00049449224,0.00045545504,0.0011936896,0.0014780106,0.0013432397,0.0018978321],"category_scores_gemma":[0.015459612,0.0006311451,0.00054151326,0.0003646695,0.0021038724,0.0015865603,0.0016936444,0.002321545,0.00040410765],"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.0001179932,0.000043578537,0.0007508854,0.000053802098,0.00003744979,0.00006317751,0.000056282417,0.9641032,0.000748848,0.016173853,0.00060020725,0.01725067],"study_design_scores_gemma":[0.00001146515,0.000022964825,0.00006585637,0.0000057702377,0.0000044652215,0.000009374304,0.0000036258782,0.99184364,0.00027452954,0.007569454,0.00018446747,0.00000443109],"about_ca_topic_score_codex":0.0035924262,"about_ca_topic_score_gemma":0.002476167,"teacher_disagreement_score":0.0035924262,"about_ca_system_score_codex":0.0015907609,"about_ca_system_score_gemma":0.0015621128,"threshold_uncertainty_score":0.016248643},"labels":[],"label_agreement":null},{"id":"W2998421476","doi":"10.1609/aaai.v34i04.6154","title":"CD-UAP: Class Discriminative Universal Adversarial Perturbation","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Discriminative model; Adversarial system; Computer science; Perturbation (astronomy); Benchmark (surveying); Artificial intelligence","score_opus":0.07347077682599268,"score_gpt":0.2773857039367226,"score_spread":0.20391492711072995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998421476","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.013514984,0.0002641844,0.98158914,0.00020892748,0.00008025765,0.00012001861,0.00007447237,0.0014983426,0.002649632],"genre_scores_gemma":[0.7405849,0.0003187519,0.25135982,0.0006820629,0.00010483585,0.00030601624,0.0004042717,0.00036265684,0.005876716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878925,0.000387753,0.00004293469,0.00029665395,0.00033401736,0.00014940958],"domain_scores_gemma":[0.9983651,0.0008257117,0.00014886989,0.00041936597,0.00015516572,0.000085689986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015051936,0.0015837792,0.0009924354,0.00054172624,0.00044314598,0.00072682725,0.0017184354,0.0012415556,0.0021690526],"category_scores_gemma":[0.004285979,0.00036999927,0.00065526686,0.00037614684,0.001527157,0.0016293151,0.002495226,0.002743182,0.00065178704],"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.0002883146,0.00017003198,0.0015129212,0.00013910465,0.00012842621,0.00021720579,0.00010024045,0.7283475,0.01983527,0.031867616,0.009949785,0.20744368],"study_design_scores_gemma":[0.000009213117,0.00005503216,0.00015671612,0.000007353334,0.000008646582,0.000091037444,0.000009465444,0.983933,0.005265139,0.009200565,0.001254607,0.000009227062],"about_ca_topic_score_codex":0.001142493,"about_ca_topic_score_gemma":0.0013451338,"teacher_disagreement_score":0.0021690526,"about_ca_system_score_codex":0.00086445664,"about_ca_system_score_gemma":0.0006908473,"threshold_uncertainty_score":0.0079603195},"labels":[],"label_agreement":null},{"id":"W2998475654","doi":"10.1609/aaai.v34i04.5835","title":"TellTail: Fast Scoring and Detection of Dense Subgraphs","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science; Pruning; Consistency (knowledge bases); Induced subgraph isomorphism problem; Graph; Ground truth; Theoretical computer science; Algorithm; Combinatorics; Mathematics; Artificial intelligence; Line graph","score_opus":0.05563683306484264,"score_gpt":0.27503513159488513,"score_spread":0.2193982985300425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998475654","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.10357605,0.001430662,0.8484275,0.0013054569,0.00023998033,0.00054804975,0.0065305037,0.033051904,0.004889853],"genre_scores_gemma":[0.48208222,0.00041569516,0.48934063,0.0005733306,0.00016558202,0.0004711526,0.019616771,0.0016736499,0.0056610205],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974184,0.0006660841,0.00014294226,0.0006401924,0.0009301585,0.00020224173],"domain_scores_gemma":[0.99293363,0.0033542248,0.00063034415,0.0016888926,0.0010354758,0.00035751006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022267776,0.0015224607,0.0016075524,0.0035815309,0.0012614208,0.0018426032,0.0034143915,0.0022244663,0.0034927342],"category_scores_gemma":[0.019714722,0.0007994438,0.0011966992,0.0031781418,0.0009724772,0.004135633,0.0032344118,0.0016795228,0.002615027],"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.0011019274,0.0005818642,0.0393235,0.00080955913,0.0005321003,0.0008431074,0.0007877466,0.12947157,0.025211114,0.030875903,0.1594916,0.61096996],"study_design_scores_gemma":[0.00010408615,0.000078083416,0.0023051773,0.000020233883,0.00003112942,0.00034336624,0.00013039476,0.943972,0.006168036,0.039601225,0.0072154743,0.000030779196],"about_ca_topic_score_codex":0.0074709496,"about_ca_topic_score_gemma":0.013847693,"teacher_disagreement_score":0.0074709496,"about_ca_system_score_codex":0.00097094366,"about_ca_system_score_gemma":0.0011887737,"threshold_uncertainty_score":0.014854908},"labels":[],"label_agreement":null},{"id":"W2998503844","doi":"10.1609/aaai.v34i04.5717","title":"Efficient Inference of Optimal Decision Trees","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Heuristics; Inference; Computer science; Decision tree; Incremental decision tree; Tree (set theory); Path (computing); K-ary tree; Class (philosophy); Machine learning; Alternating decision tree; Artificial intelligence; Search tree; Node (physics); Algorithm; Mathematics; Decision tree learning; Mathematical optimization; Tree structure; Search algorithm; Combinatorics; Binary tree","score_opus":0.08163294719885679,"score_gpt":0.31706551243419345,"score_spread":0.23543256523533668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998503844","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.049752437,0.0007043776,0.94215804,0.0010200595,0.000057114634,0.00022497089,0.0013553934,0.0025089262,0.0022187023],"genre_scores_gemma":[0.31573257,0.0003818115,0.6769563,0.00041997444,0.00007842942,0.00030009082,0.0048123244,0.0003137865,0.0010047044],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970356,0.001101676,0.00021821931,0.00068693433,0.00065310556,0.00030441128],"domain_scores_gemma":[0.97959864,0.017639106,0.00052266376,0.000992231,0.0009868019,0.0002605269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029581208,0.0010731202,0.0016268634,0.0020007314,0.0009720386,0.001938466,0.0025026584,0.0015661421,0.0038029419],"category_scores_gemma":[0.030544313,0.0010599928,0.0020631657,0.0017506368,0.0010513169,0.003960944,0.0020980511,0.0027460258,0.00078077544],"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.00085336604,0.0003588003,0.009580669,0.0009546689,0.00022345189,0.0006172317,0.0005495291,0.40966418,0.0070638703,0.060915686,0.012399369,0.49681917],"study_design_scores_gemma":[0.00006631041,0.00004322215,0.00047648727,0.000045752982,0.00004871039,0.00007036701,0.00008082434,0.91419846,0.0020449953,0.08158492,0.0013262664,0.000013612676],"about_ca_topic_score_codex":0.004923295,"about_ca_topic_score_gemma":0.010684041,"teacher_disagreement_score":0.004923295,"about_ca_system_score_codex":0.0019136282,"about_ca_system_score_gemma":0.0032960735,"threshold_uncertainty_score":0.015644193},"labels":[],"label_agreement":null},{"id":"W2998605053","doi":"10.1609/aaai.v34i04.6132","title":"Partial Label Learning with Batch Label Correction","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Consistency (knowledge bases); Artificial intelligence; Machine learning; Set (abstract data type); Multi-label classification; Stability (learning theory)","score_opus":0.1001122140207756,"score_gpt":0.2912905940668809,"score_spread":0.19117838004610532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998605053","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.032132626,0.00040115404,0.958631,0.00029708171,0.00014414791,0.00015181136,0.00019460384,0.0065717865,0.0014757634],"genre_scores_gemma":[0.42534533,0.0002055575,0.5644311,0.00065904297,0.00018306094,0.00032431513,0.0015017877,0.0006497108,0.0067000873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997988,0.00045529378,0.00007506773,0.000810423,0.00048958196,0.00018163455],"domain_scores_gemma":[0.99333453,0.0020958744,0.0005122162,0.002260242,0.0015120641,0.00028500668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025253764,0.0016526483,0.002014742,0.0008515705,0.0011875196,0.0014958391,0.00551633,0.001959894,0.0024403958],"category_scores_gemma":[0.007624056,0.0006431843,0.001006114,0.0011552315,0.0017330223,0.004541608,0.0029256719,0.0036268614,0.0016158021],"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.0009523591,0.0004455413,0.00566482,0.00025254177,0.0001302139,0.00019423325,0.00037754065,0.15394068,0.02074547,0.008697346,0.013776615,0.79482263],"study_design_scores_gemma":[0.000045422177,0.00011147783,0.00038389658,0.000012683776,0.000026214659,0.00008414788,0.000045353092,0.97881925,0.009954377,0.008324006,0.0021655732,0.000027725931],"about_ca_topic_score_codex":0.0069118333,"about_ca_topic_score_gemma":0.011026843,"teacher_disagreement_score":0.0069118333,"about_ca_system_score_codex":0.0013284208,"about_ca_system_score_gemma":0.0026218686,"threshold_uncertainty_score":0.013743222},"labels":[],"label_agreement":null},{"id":"W2998625062","doi":"10.1609/aaai.v34i02.5500","title":"Guiding CDCL SAT Search via Random Exploration amid Conflict Depression","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Heuristics; Heuristic; Computer science; Conflict analysis; Branching (polymer chemistry); Conflict resolution; Theoretical computer science; Artificial intelligence; Psychology; Sociology","score_opus":0.248689481609431,"score_gpt":0.323808705815661,"score_spread":0.07511922420623002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998625062","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.37390068,0.00075886195,0.61618286,0.00085689314,0.000049654383,0.00022391157,0.00012961862,0.0016674843,0.006229992],"genre_scores_gemma":[0.8689692,0.0001014969,0.12909429,0.00032342572,0.000020879854,0.00015866122,0.000175094,0.00008901429,0.0010678766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989152,0.00059219124,0.000044100998,0.00013519058,0.00019403422,0.000119393706],"domain_scores_gemma":[0.9935441,0.0052213804,0.00029171765,0.0004113099,0.00033578768,0.00019575267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002249529,0.0005837576,0.00074907765,0.0007133418,0.00034791068,0.00085449376,0.0014580007,0.00091102556,0.0016298378],"category_scores_gemma":[0.008988019,0.00052382913,0.00044433848,0.0005389785,0.0009653571,0.0011685041,0.0016210536,0.0011175883,0.00028331962],"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.00055836036,0.0002806271,0.008796115,0.00015010146,0.00008990345,0.00019983042,0.00037775957,0.807881,0.006850246,0.020375527,0.0026669009,0.1517737],"study_design_scores_gemma":[0.000060922423,0.00007409532,0.00018739549,0.0000083017685,0.000010978305,0.00002737543,0.000032911852,0.99231213,0.001014463,0.005938082,0.0003282714,0.0000050326466],"about_ca_topic_score_codex":0.0012217992,"about_ca_topic_score_gemma":0.003019818,"teacher_disagreement_score":0.002249529,"about_ca_system_score_codex":0.00059734477,"about_ca_system_score_gemma":0.0012844568,"threshold_uncertainty_score":0.011896789},"labels":[],"label_agreement":null},{"id":"W2998655644","doi":"10.1609/aaai.v34i04.5884","title":"Residual Continual Learning","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Ministry of Science and ICT, South Korea; National Research Foundation of Korea; National Research Foundation","keywords":"Residual; Forgetting; Computer science; Normalization (sociology); Artificial intelligence; Task (project management); Machine learning; Learning network; Convolutional neural network; Deep learning; Artificial neural network; Algorithm; Engineering","score_opus":0.10166282549906423,"score_gpt":0.2867960757735737,"score_spread":0.18513325027450944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998655644","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.018829659,0.0004794831,0.97497034,0.00023553103,0.00011090528,0.000067342684,0.00007552286,0.0021081527,0.0031230466],"genre_scores_gemma":[0.6034182,0.00037560257,0.3836921,0.0005603565,0.00022578545,0.00023627566,0.0005750869,0.00041255887,0.010504105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910283,0.00017540784,0.00004209515,0.00029749968,0.0002754901,0.000106737396],"domain_scores_gemma":[0.99854255,0.0003543232,0.00015456231,0.00042078027,0.00039953276,0.00012832129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016786491,0.0009050179,0.0010983548,0.0008282512,0.0005863067,0.00088700553,0.0033531776,0.0012739301,0.00381993],"category_scores_gemma":[0.0038162414,0.0005185221,0.00067959673,0.0006980664,0.0012966988,0.0026430401,0.0023800624,0.001913791,0.0012812958],"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.0004235347,0.0003650777,0.001830264,0.00022033647,0.00012431107,0.00019793636,0.00022953577,0.2171605,0.01633111,0.027256666,0.008448487,0.7274122],"study_design_scores_gemma":[0.000021337306,0.00010229217,0.00017796026,0.000011359814,0.000011841935,0.00007088546,0.000014692268,0.98356646,0.0035481434,0.009777268,0.0026805163,0.000017248953],"about_ca_topic_score_codex":0.0022272798,"about_ca_topic_score_gemma":0.0025628058,"teacher_disagreement_score":0.00381993,"about_ca_system_score_codex":0.000657805,"about_ca_system_score_gemma":0.0011656737,"threshold_uncertainty_score":0.012778997},"labels":[],"label_agreement":null},{"id":"W2998659916","doi":"10.1609/aaai.v34i05.6355","title":"Revision in Continuous Space: Unsupervised Text Style Transfer without Adversarial Learning","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; Sentence; Adversarial system; Representation (politics); Artificial intelligence; Space (punctuation); Inference; Key (lock); Style (visual arts); Encoder; Transfer of learning; Natural language processing; Transfer (computing); Machine learning","score_opus":0.04887968651990926,"score_gpt":0.2600740986570526,"score_spread":0.21119441213714335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998659916","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.013962709,0.00019793522,0.98296356,0.00012203567,0.00008040898,0.000060447077,0.00006703471,0.0011208074,0.0014251764],"genre_scores_gemma":[0.6995942,0.00035817162,0.28556052,0.0005283657,0.00027652545,0.00025382204,0.00057548383,0.0004891666,0.0123638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999257,0.00024718826,0.000035468358,0.00022362203,0.00018230134,0.000054433567],"domain_scores_gemma":[0.99839455,0.00079012907,0.00016405951,0.00038806468,0.00018641596,0.00007685751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013910335,0.0010092162,0.00077888905,0.00045292315,0.00029568607,0.0006731273,0.0014326498,0.00088524463,0.002933787],"category_scores_gemma":[0.004400633,0.0003778846,0.00083327317,0.0004021606,0.0008700549,0.0015302132,0.0013092845,0.0017144203,0.001230271],"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.00039764485,0.00020109127,0.0011773055,0.00019659115,0.00016860753,0.00027806158,0.00030215987,0.46463138,0.041022677,0.021603903,0.0068093045,0.4632114],"study_design_scores_gemma":[0.000017812274,0.00006611955,0.0002096917,0.0000071393997,0.000013016086,0.000056982637,0.000011586976,0.9834946,0.0063986736,0.008568482,0.0011428096,0.000013034869],"about_ca_topic_score_codex":0.0008777894,"about_ca_topic_score_gemma":0.0010896558,"teacher_disagreement_score":0.002933787,"about_ca_system_score_codex":0.00044726685,"about_ca_system_score_gemma":0.000499318,"threshold_uncertainty_score":0.00981456},"labels":[],"label_agreement":null},{"id":"W2998693894","doi":"10.1609/aaai.v34i04.5918","title":"Differentiable Algorithm for Marginalising Changepoints","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","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":"Kootenay Association for Science & Technology","funders":"Ministry of Science and ICT, South Korea; National Research Foundation of Korea; National Research Foundation","keywords":"Differentiable function; Algorithm; Inference; Series (stratigraphy); Computer science; Mathematics; Artificial intelligence","score_opus":0.1269404337266036,"score_gpt":0.2970119024827202,"score_spread":0.1700714687561166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998693894","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.0013180122,0.000055502558,0.99739647,0.00006193765,0.000015993366,0.000020334865,0.000050527124,0.0008122187,0.00026894384],"genre_scores_gemma":[0.10054164,0.00015752953,0.89492506,0.00015947067,0.00007770053,0.00021917101,0.0006647775,0.0006558319,0.0025988433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987606,0.00030649104,0.00008433578,0.00042918805,0.00031790888,0.00010160435],"domain_scores_gemma":[0.99658525,0.0021541587,0.00023695374,0.0005147041,0.00040742938,0.00010152335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023718353,0.0010662362,0.001335979,0.0016318905,0.00068368117,0.00159166,0.0026369484,0.0017266884,0.008806209],"category_scores_gemma":[0.011638022,0.0009490675,0.0015992267,0.0015627728,0.0013392774,0.0025768466,0.0025555207,0.003694536,0.0025854905],"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.0002860095,0.00012551088,0.002533091,0.00020855016,0.00019365158,0.00026794017,0.00036272692,0.44981378,0.004513194,0.08494369,0.008170069,0.4485818],"study_design_scores_gemma":[0.000026942333,0.000024302468,0.00022679096,0.000012542654,0.00001841326,0.000071648945,0.000021000205,0.94552106,0.0013713359,0.048981305,0.0037060182,0.000018521856],"about_ca_topic_score_codex":0.006971454,"about_ca_topic_score_gemma":0.006120443,"teacher_disagreement_score":0.008806209,"about_ca_system_score_codex":0.0012045227,"about_ca_system_score_gemma":0.001975553,"threshold_uncertainty_score":0.029459655},"labels":[],"label_agreement":null},{"id":"W3005661940","doi":"10.1609/aaai.v35i8.16901","title":"Regret Bounds for Batched Bandits","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Air Force Office of Scientific Research; Office of Naval Research; Institut de Valorisation des Données; Canada First Research Excellence Fund; National Science Foundation","keywords":"Regret; Logarithm; Mathematical optimization; Simple (philosophy); Computer science; Multi-armed bandit; Mathematics; Algorithm; Machine learning","score_opus":0.349858033997507,"score_gpt":0.4633447509370407,"score_spread":0.11348671693953372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005661940","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.011941307,0.0021444762,0.97191554,0.0013733556,0.00031664508,0.0001893313,0.00047132943,0.0012662652,0.010381696],"genre_scores_gemma":[0.53100556,0.003835616,0.44121245,0.0018187301,0.0012238134,0.0012458748,0.0013695594,0.001442951,0.016845463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99263024,0.0022231126,0.0003914096,0.0014564407,0.0022172497,0.0010814888],"domain_scores_gemma":[0.9605368,0.028829664,0.0024857523,0.0046336316,0.0023702346,0.0011438818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010286466,0.004038423,0.003157027,0.0015978013,0.0017765539,0.005220371,0.0057680896,0.003409448,0.011019529],"category_scores_gemma":[0.04718895,0.0014272878,0.002570681,0.0024618637,0.0033665453,0.009119267,0.0045363596,0.008738587,0.0029683204],"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.0011207574,0.00042270892,0.0011110583,0.00049121026,0.00018663799,0.0001376857,0.00019447149,0.75021166,0.004707093,0.1664146,0.01086735,0.06413471],"study_design_scores_gemma":[0.00006229535,0.00008062064,0.00020132808,0.000055906785,0.000041470234,0.000043804972,0.000016595284,0.9140266,0.0013959979,0.082645684,0.0014070488,0.00002262277],"about_ca_topic_score_codex":0.0029563818,"about_ca_topic_score_gemma":0.0031129655,"teacher_disagreement_score":0.011019529,"about_ca_system_score_codex":0.0054177633,"about_ca_system_score_gemma":0.0035212997,"threshold_uncertainty_score":0.054400682},"labels":[],"label_agreement":null},{"id":"W3006406045","doi":"10.1609/aaai.v35i5.16512","title":"Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies","year":2021,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"Institut de Valorisation des Données; Compute Canada; Canadian Institute for Advanced Research","keywords":"Branching (polymer chemistry); Branch and bound; Generalization; Computer science; Tree (set theory); Benchmark (surveying); Search tree; Integer programming; Mathematical optimization; Theoretical computer science; Artificial intelligence; Search algorithm; Mathematics; Algorithm; Combinatorics","score_opus":0.11579523998778825,"score_gpt":0.3423432507773105,"score_spread":0.22654801078952225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006406045","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.045951445,0.00044985695,0.9484079,0.0003356646,0.0000635303,0.0001094498,0.00008631052,0.0010661023,0.0035297154],"genre_scores_gemma":[0.70932627,0.000385541,0.28688288,0.000343371,0.00005303303,0.00048420325,0.00035270938,0.00029738696,0.0018746295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904615,0.00042161084,0.00006145617,0.00018175742,0.00016936728,0.000119654556],"domain_scores_gemma":[0.99394,0.0046329736,0.00041567412,0.00045432532,0.0003421786,0.00021484481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026425563,0.0012909103,0.0013561241,0.00074270985,0.000429329,0.0012422168,0.001671249,0.0017157195,0.0027693599],"category_scores_gemma":[0.014800279,0.0006571202,0.0007355809,0.0008217856,0.0012116381,0.0020633433,0.0016429762,0.0032777027,0.00082975876],"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.000064795,0.000057477166,0.00067122513,0.000040851468,0.00001808344,0.000022221788,0.000039106,0.95818,0.00063706824,0.007852946,0.0007752613,0.03164094],"study_design_scores_gemma":[0.000006956856,0.000015013001,0.000018794066,0.0000064785067,0.0000025465,0.0000036981533,0.0000028038041,0.99574345,0.00020014452,0.0038506843,0.00014726493,0.000002101501],"about_ca_topic_score_codex":0.002320348,"about_ca_topic_score_gemma":0.002583315,"teacher_disagreement_score":0.0027693599,"about_ca_system_score_codex":0.0011580775,"about_ca_system_score_gemma":0.0020965294,"threshold_uncertainty_score":0.013975322},"labels":[],"label_agreement":null},{"id":"W3011483492","doi":"10.1609/aaai.v35i3.16368","title":"Object-Centric Image Generation from Layouts","year":2021,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Université de Montréal","funders":"","keywords":"Computer science; Generator (circuit theory); Object (grammar); Artificial intelligence; Scene graph; Bounding overwatch; Fidelity; Minimum bounding box; Metric (unit); Computer vision; Image (mathematics); Similarity (geometry); Graph; Generative grammar; Theoretical computer science","score_opus":0.07616563558512626,"score_gpt":0.27850507399500796,"score_spread":0.2023394384098817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011483492","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.014689189,0.00016741968,0.9797166,0.00027455558,0.000064187676,0.0000803247,0.00022703246,0.0020405347,0.0027401187],"genre_scores_gemma":[0.56233037,0.0003602684,0.42645952,0.00078329566,0.000088131725,0.00021338329,0.0014878196,0.0010416816,0.007235532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964714,0.000075719705,0.000010452134,0.0001274137,0.00010195879,0.00003718241],"domain_scores_gemma":[0.9992723,0.00027720153,0.00006754014,0.00025199776,0.00008599826,0.00004495095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006628089,0.00097249995,0.0005984948,0.00046375042,0.0001931883,0.0007947675,0.0015717722,0.000997284,0.00320773],"category_scores_gemma":[0.0023629204,0.00048804155,0.0007542601,0.00042859802,0.00086763327,0.0012248317,0.0013814344,0.0016325169,0.0009983102],"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.00013121944,0.00007667024,0.00082368555,0.00015300808,0.00006761532,0.00017670324,0.00008952946,0.85020965,0.03032967,0.019997101,0.0049131983,0.093031995],"study_design_scores_gemma":[0.000014108257,0.000033754408,0.00015690828,0.000009817491,0.000008238099,0.0000913493,0.000010125463,0.9755862,0.010474658,0.011488478,0.002117034,0.000009334954],"about_ca_topic_score_codex":0.0016606965,"about_ca_topic_score_gemma":0.0031919214,"teacher_disagreement_score":0.00320773,"about_ca_system_score_codex":0.00091578736,"about_ca_system_score_gemma":0.00061230594,"threshold_uncertainty_score":0.010730982},"labels":[],"label_agreement":null},{"id":"W3022326288","doi":"10.1609/aaai.v26i1.8195","title":"Generalizing and Executing Plans","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","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":"Plan (archaeology); Generalization; Computer science; Task (project management); Representation (politics); Key (lock); Process (computing); Order (exchange); Artificial intelligence; Management science; Operations research; Computer security; Systems engineering; Engineering; Programming language; Political science; Business; Mathematics","score_opus":0.07715901879387925,"score_gpt":0.2800754265498518,"score_spread":0.20291640775597253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022326288","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.035965364,0.0001582181,0.9582112,0.0004090822,0.000022734232,0.00017713182,0.00015084064,0.0014216867,0.0034837208],"genre_scores_gemma":[0.3029912,0.000544198,0.69203985,0.00017793682,0.00003222178,0.00027594608,0.0007187409,0.00025102065,0.0029689332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988054,0.00033567304,0.00009587423,0.00033863567,0.00032058355,0.000103932034],"domain_scores_gemma":[0.9977489,0.000938584,0.00020520443,0.00088618684,0.0001582464,0.0000628977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001477309,0.0007946062,0.00052532286,0.000594619,0.0004204752,0.0012093253,0.0012099677,0.0007988529,0.0022427922],"category_scores_gemma":[0.0068183406,0.00045249914,0.0010563924,0.00071956316,0.0019159019,0.0030346191,0.0020524773,0.0018092463,0.0004494204],"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.00017722399,0.00009819484,0.0017255696,0.0002698645,0.00008846427,0.0003702295,0.0017641897,0.448423,0.013759118,0.22503804,0.0028571808,0.30542898],"study_design_scores_gemma":[0.000032744996,0.00014867575,0.0006365099,0.00008840053,0.00006628121,0.00020679494,0.00038038314,0.7113339,0.007696954,0.26037174,0.018999344,0.000038353966],"about_ca_topic_score_codex":0.0042314953,"about_ca_topic_score_gemma":0.0048347455,"teacher_disagreement_score":0.0042314953,"about_ca_system_score_codex":0.00085790595,"about_ca_system_score_gemma":0.0011824387,"threshold_uncertainty_score":0.008413732},"labels":[],"label_agreement":null},{"id":"W3024504495","doi":"10.1609/aaai.v33i01.330110087","title":"Classifier-Agnostic Saliency Map Extraction","year":2019,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Visual Attention and Saliency Detection","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Tencent; Canadian Institute for Advanced Research; Nvidia","keywords":"Classifier (UML); Artificial intelligence; Computer science; Pattern recognition (psychology); Saliency map; Computer vision; Image (mathematics)","score_opus":0.06447259583557902,"score_gpt":0.31343511496569887,"score_spread":0.24896251913011985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3024504495","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.021323716,0.0006431082,0.96751684,0.00020449498,0.0001941067,0.00030154974,0.0004128927,0.005344457,0.00405879],"genre_scores_gemma":[0.37017247,0.00069054303,0.61760175,0.0003246186,0.00027043835,0.00036368766,0.0018788602,0.00081189594,0.007885648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991911,0.000066983666,0.00004206404,0.00019822961,0.00036882117,0.00013287796],"domain_scores_gemma":[0.998565,0.0002700644,0.00010109756,0.00022985208,0.0007504737,0.00008361801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079087896,0.0015464453,0.0014919852,0.0034665319,0.00054576225,0.0012278728,0.0015806329,0.0012751155,0.0043143025],"category_scores_gemma":[0.0043027536,0.00066028006,0.001018141,0.00151116,0.00038368258,0.0018658548,0.0013387429,0.0009145989,0.002689965],"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.0002787119,0.00016857723,0.0016817698,0.0004900677,0.00016968176,0.00030498096,0.00014386605,0.01908002,0.22145118,0.005132245,0.020434007,0.7306649],"study_design_scores_gemma":[0.000056454457,0.00027415628,0.007390038,0.000047973037,0.00010867891,0.00076303555,0.00008712631,0.78609455,0.16993058,0.016657291,0.01851101,0.00007907818],"about_ca_topic_score_codex":0.002385048,"about_ca_topic_score_gemma":0.004142786,"teacher_disagreement_score":0.0043143025,"about_ca_system_score_codex":0.00058054936,"about_ca_system_score_gemma":0.0009945447,"threshold_uncertainty_score":0.014432788},"labels":[],"label_agreement":null},{"id":"W3033044509","doi":"10.1609/aaai.v35i5.16484","title":"Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimization","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":125,"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; Polytechnique Montréal","funders":"","keywords":"Combinatorial optimization; Mathematical optimization; Reinforcement learning; Constraint programming; Knapsack problem; Travelling salesman problem; Computer science; Optimization problem; Solver; Heuristics; Context (archaeology); Quadratic assignment problem; Integer programming; Lin–Kernighan heuristic; Mathematics; Stochastic programming; 2-opt; Artificial intelligence","score_opus":0.04400025295225241,"score_gpt":0.2862828622392445,"score_spread":0.24228260928699208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033044509","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.0023860387,0.0006039744,0.9926373,0.00035797714,0.000046385252,0.00004632822,0.000037717236,0.00026248727,0.0036217994],"genre_scores_gemma":[0.31498,0.002035091,0.6761071,0.00069519767,0.00031965185,0.0005744931,0.00032798565,0.00033527752,0.004625275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987225,0.00054982136,0.000069945425,0.00019902694,0.00033650477,0.00012229239],"domain_scores_gemma":[0.99659663,0.0026762984,0.00017427142,0.00018694668,0.00026787637,0.00009799347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020615454,0.0017241177,0.0016913869,0.00088186533,0.0003844722,0.002001118,0.0018783093,0.0016262184,0.0042278017],"category_scores_gemma":[0.0056525255,0.00067905034,0.0010912743,0.0014917993,0.0014516258,0.0016251033,0.001766273,0.0033842914,0.00069767266],"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.000025301237,0.00005626595,0.00032993607,0.00019286267,0.00005277844,0.00006433334,0.000027842301,0.89977,0.00048550215,0.039077234,0.0018399565,0.058077946],"study_design_scores_gemma":[0.000006893112,0.000011969498,0.000026656044,0.000013587414,0.0000055687756,0.000010614828,0.0000039716956,0.9835111,0.00016828609,0.015079818,0.0011573334,0.0000041868407],"about_ca_topic_score_codex":0.0064968294,"about_ca_topic_score_gemma":0.0073797563,"teacher_disagreement_score":0.0064968294,"about_ca_system_score_codex":0.0013514155,"about_ca_system_score_gemma":0.0023399543,"threshold_uncertainty_score":0.014143348},"labels":[],"label_agreement":null},{"id":"W3034674099","doi":"10.1609/aaai.v35i11.17168","title":"Implicit Kernel Attention","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","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":"Kootenay Association for Science & Technology","funders":"National Research Foundation of Korea; National Research Foundation","keywords":"Computer science; Theoretical computer science; Transformer; Artificial intelligence; Machine learning","score_opus":0.057908882148459066,"score_gpt":0.29487738774555106,"score_spread":0.23696850559709198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034674099","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.026081026,0.0012529623,0.96082217,0.00054402306,0.00016071263,0.00007935143,0.00026437594,0.0019696727,0.008825727],"genre_scores_gemma":[0.89350194,0.0009566874,0.08803235,0.00059563573,0.00022014198,0.00011847162,0.0007494948,0.00030220175,0.0155231515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992055,0.0001994478,0.00003216043,0.00025922677,0.00016659783,0.00013702997],"domain_scores_gemma":[0.99858105,0.0006187739,0.000105010884,0.0003664719,0.000258903,0.0000697763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086146774,0.0011052986,0.0009713082,0.00074963074,0.0004060798,0.0011172275,0.0018492119,0.0013963929,0.0065303063],"category_scores_gemma":[0.005120376,0.00036576134,0.00087834615,0.0009765299,0.0007641165,0.0031324464,0.0021629496,0.001482932,0.0011131373],"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.00031308326,0.00029614803,0.0030744844,0.00032024566,0.00024084612,0.00021314657,0.00029361396,0.18222673,0.014376279,0.117639594,0.021014346,0.6599915],"study_design_scores_gemma":[0.000017384586,0.000071982104,0.000983336,0.000019797097,0.0000572374,0.000101972015,0.000031056286,0.92304957,0.0032807924,0.06772166,0.004645033,0.000020310881],"about_ca_topic_score_codex":0.0066444515,"about_ca_topic_score_gemma":0.007538735,"teacher_disagreement_score":0.0066444515,"about_ca_system_score_codex":0.0013951403,"about_ca_system_score_gemma":0.0011020557,"threshold_uncertainty_score":0.021846056},"labels":[],"label_agreement":null},{"id":"W3035582376","doi":"10.1609/aaai.v35i8.16883","title":"Generalized Adversarially Learned Inference","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Generative Adversarial Networks and Image Synthesis","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":"Vector Institute; University of Toronto","funders":"","keywords":"Computer science; Generator (circuit theory); Inference; Discriminator; Consistency (knowledge bases); Latent variable; Flexibility (engineering); Scalability; Tuple; Set (abstract data type); Image (mathematics); Artificial intelligence; Maximization; Encoder; Inpainting; Machine learning; Pattern recognition (psychology); Mathematical optimization; Mathematics","score_opus":0.0827619177343025,"score_gpt":0.30218906407183455,"score_spread":0.21942714633753205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035582376","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.003981484,0.000119188204,0.9923235,0.0001904524,0.000028095936,0.00003459523,0.00009939618,0.00042077742,0.0028025624],"genre_scores_gemma":[0.5920107,0.00046825616,0.390348,0.0006777929,0.00020015123,0.00044525863,0.00086355855,0.00056587235,0.014420518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988513,0.0004327278,0.0000392187,0.0003052962,0.00024653476,0.00012504001],"domain_scores_gemma":[0.99783903,0.0014311126,0.00015278315,0.00034825606,0.00014320602,0.000085696316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018493773,0.0015520377,0.0011706455,0.0005991554,0.00040907462,0.0011802556,0.0022456078,0.0014243915,0.0045431433],"category_scores_gemma":[0.0057114665,0.0007696794,0.0008986515,0.00053617393,0.001774399,0.0016792038,0.0025122317,0.0031827893,0.0010100333],"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.00006257642,0.00003173043,0.00030257198,0.000055308403,0.000044396056,0.0000761127,0.000045718578,0.9144036,0.0015009063,0.058079414,0.0030733503,0.022324258],"study_design_scores_gemma":[0.000005141754,0.000006057762,0.000023995317,0.0000051420384,0.000002789624,0.000011019969,0.0000025576262,0.9803493,0.0003087435,0.018854827,0.0004268184,0.0000036281237],"about_ca_topic_score_codex":0.0028270816,"about_ca_topic_score_gemma":0.004597581,"teacher_disagreement_score":0.0045431433,"about_ca_system_score_codex":0.0013716344,"about_ca_system_score_gemma":0.0013420902,"threshold_uncertainty_score":0.01519835},"labels":[],"label_agreement":null},{"id":"W3035644674","doi":"10.1609/aaai.v35i12.17336","title":"Variational Fair Clustering","year":2021,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Health Systems, Economic Evaluations, Quality of Life","field":"Economics, Econometrics and Finance","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":"École de Technologie Supérieure","funders":"","keywords":"Cluster analysis; Mathematical optimization; Computer science; Scalability; Upper and lower bounds; Convergence (economics); Spectral clustering; Term (time); Lipschitz continuity; Relaxation (psychology); Constrained clustering; Mathematics; Fuzzy clustering; CURE data clustering algorithm; Artificial intelligence","score_opus":0.5151416688732341,"score_gpt":0.4329415794825611,"score_spread":0.08220008939067297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035644674","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.0027811325,0.00020920491,0.9939552,0.00021012888,0.0000622888,0.000057774316,0.000101193546,0.00015482058,0.002468343],"genre_scores_gemma":[0.3577003,0.00073129847,0.62216365,0.0006196271,0.00028289141,0.0004787685,0.00077071163,0.00062928046,0.016623477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996534,0.0012343614,0.0001491807,0.000794478,0.0008853956,0.00040257943],"domain_scores_gemma":[0.99509615,0.002540886,0.00026562883,0.00086983613,0.0009156843,0.00031179498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060115005,0.001440414,0.0020788962,0.0018021436,0.0019462281,0.0036605105,0.00467501,0.0027450742,0.0066988706],"category_scores_gemma":[0.014352875,0.0007804121,0.0017746262,0.0022080075,0.0029268013,0.0040600067,0.0035608695,0.0024977017,0.0011684329],"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.00007595818,0.000055172288,0.00050802546,0.000129251,0.00007292284,0.000079684236,0.00018066348,0.64645886,0.001511999,0.30745974,0.0046017594,0.038865898],"study_design_scores_gemma":[0.0000104379105,0.00001655784,0.000072117604,0.000014670611,0.000008976854,0.000026807757,0.000020503474,0.87537384,0.0005683825,0.1211686,0.0027047226,0.000014487777],"about_ca_topic_score_codex":0.008229191,"about_ca_topic_score_gemma":0.008825325,"teacher_disagreement_score":0.008229191,"about_ca_system_score_codex":0.0041545033,"about_ca_system_score_gemma":0.004037677,"threshold_uncertainty_score":0.031792223},"labels":[],"label_agreement":null},{"id":"W3035799148","doi":"10.1609/aaai.v34i10.7227","title":"LGML: Logic Guided Machine Learning (Student Abstract)","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Rough Sets and Fuzzy Logic","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":"Computer science; Artificial intelligence; Counterexample; Consistency (knowledge bases); Function (biology); Algebraic expression; Phase (matter); Process (computing); Algorithm; Machine learning; Algebraic number; Mathematics; Programming language; Discrete mathematics","score_opus":0.15038087739532124,"score_gpt":0.3190635613215488,"score_spread":0.16868268392622754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035799148","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.0016768544,0.0002345538,0.98067206,0.0008983001,0.0001258408,0.00006175548,0.00029000008,0.011703099,0.004337475],"genre_scores_gemma":[0.097017854,0.00031319103,0.89099944,0.0016149776,0.0002324398,0.00028919242,0.0013247571,0.0013171306,0.0068910443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981211,0.0007054398,0.0001063231,0.00035944296,0.0006076152,0.00010003431],"domain_scores_gemma":[0.997008,0.0015380122,0.00018524237,0.0006540717,0.0004977937,0.000116809955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002372466,0.00087207457,0.0005749048,0.0010991037,0.0004837566,0.0024746526,0.0029581755,0.001668123,0.020137923],"category_scores_gemma":[0.009009409,0.00052377867,0.0010986746,0.0010796264,0.0018468563,0.002975061,0.0033916153,0.0028930039,0.00728317],"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.0002592757,0.00023151794,0.0010881807,0.00045860736,0.00009394353,0.00031238058,0.00024120111,0.088367924,0.005879763,0.21615568,0.06243379,0.62447774],"study_design_scores_gemma":[0.000072845134,0.00007702092,0.00016926925,0.000097985605,0.000019108791,0.00012386094,0.000027056696,0.6655113,0.0074947877,0.27949548,0.046883743,0.000027509417],"about_ca_topic_score_codex":0.0016151468,"about_ca_topic_score_gemma":0.0024853887,"teacher_disagreement_score":0.020137923,"about_ca_system_score_codex":0.0011327649,"about_ca_system_score_gemma":0.0013182742,"threshold_uncertainty_score":0.06736809},"labels":[],"label_agreement":null},{"id":"W3036098004","doi":"10.1609/aaai.v34i10.7272","title":"Combating False Negatives in Adversarial Imitation Learning (Student Abstract)","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","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":"Canadian Institute for Advanced Research","funders":"","keywords":"Adversarial system; Imitation; Computer science; Sample (material); Artificial intelligence; Machine learning; Psychology; Social psychology","score_opus":0.07769480420664557,"score_gpt":0.31635178777044354,"score_spread":0.23865698356379797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036098004","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.042491388,0.0004933256,0.94928324,0.0021458298,0.0002346077,0.00008556908,0.000083226856,0.0009577102,0.0042251362],"genre_scores_gemma":[0.8623354,0.00020275328,0.13166466,0.0009895943,0.00023334622,0.00017723422,0.00014650669,0.00022633003,0.004024194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99548596,0.0022889993,0.00013153152,0.0007195928,0.001141521,0.0002324395],"domain_scores_gemma":[0.96062994,0.02905349,0.002019247,0.00535026,0.002268956,0.0006780997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074203745,0.001061806,0.001362062,0.00054207875,0.0006958224,0.0012994467,0.0019614757,0.0017292358,0.0030009144],"category_scores_gemma":[0.047425445,0.00048201648,0.0005420992,0.00037446865,0.0032035229,0.0029238127,0.0034126248,0.0045885006,0.00087811024],"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.0009858788,0.0003284843,0.007928221,0.00032512055,0.00020887649,0.00042818536,0.00039617557,0.5636884,0.016849915,0.086445704,0.01801456,0.3044005],"study_design_scores_gemma":[0.000023902257,0.00014310534,0.0005082416,0.000021058013,0.00001334263,0.00017399923,0.00001984731,0.95920485,0.0060974774,0.032564577,0.00121144,0.000018214305],"about_ca_topic_score_codex":0.0011045533,"about_ca_topic_score_gemma":0.0010671731,"teacher_disagreement_score":0.0074203745,"about_ca_system_score_codex":0.0008646849,"about_ca_system_score_gemma":0.0008730257,"threshold_uncertainty_score":0.03924316},"labels":[],"label_agreement":null},{"id":"W3037016570","doi":"10.1609/aaai.v34i07.6914","title":"EFANet: Exchangeable Feature Alignment Network for Arbitrary Style Transfer","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Generative Adversarial Networks and Image Synthesis","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 Guelph","funders":"Shenzhen University; National Natural Science Foundation of China","keywords":"Computer science; Statistic; Artificial intelligence; Swap (finance); Pattern recognition (psychology); Feature vector; Feature (linguistics); Matching (statistics); Feature extraction; Graphics; Image (mathematics); Extractor; Mathematics; Computer graphics (images)","score_opus":0.07239168392874401,"score_gpt":0.2596019731351739,"score_spread":0.1872102892064299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037016570","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.018755935,0.0002732888,0.9733594,0.00021202858,0.00009592269,0.00008805769,0.00022209916,0.003103645,0.003889655],"genre_scores_gemma":[0.59412605,0.00033118948,0.38431153,0.0007745231,0.00014844106,0.00039901462,0.0015388814,0.0006306248,0.017739749],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953306,0.000089595145,0.000019366445,0.00014794187,0.00013902839,0.00007096325],"domain_scores_gemma":[0.99959344,0.0001329591,0.000051367133,0.00011278154,0.00007332517,0.000036236128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011250708,0.0012302605,0.00084290374,0.00072936085,0.0004756375,0.00075619965,0.0020206796,0.001361083,0.004655004],"category_scores_gemma":[0.0024025615,0.00039153793,0.0008131283,0.0007329027,0.0007642887,0.0016279845,0.0017747325,0.0018946157,0.0014557441],"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.0003047362,0.00021043478,0.0009715654,0.00010166562,0.000111784306,0.00026605482,0.00014511935,0.45320472,0.01967808,0.022854803,0.011321633,0.49082932],"study_design_scores_gemma":[0.000010438347,0.00003680955,0.00009303367,0.0000046924783,0.000006642424,0.000044012515,0.0000070321025,0.9878256,0.0025559117,0.008255137,0.0011541158,0.0000066686257],"about_ca_topic_score_codex":0.0019663058,"about_ca_topic_score_gemma":0.0024812012,"teacher_disagreement_score":0.004655004,"about_ca_system_score_codex":0.0008195813,"about_ca_system_score_gemma":0.00061857543,"threshold_uncertainty_score":0.015572548},"labels":[],"label_agreement":null},{"id":"W3037031158","doi":"10.1609/aaai.v34i10.7173","title":"Trimodal Attention Module for Multimodal Sentiment Analysis (Student Abstract)","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Sentiment Analysis and Opinion Mining","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é du Québec à Montréal","funders":"","keywords":"Computer science; Modalities; Utterance; Feature (linguistics); Artificial intelligence; Task (project management); Multimodality; Sentiment analysis; Process (computing); Modality (human–computer interaction); Information fusion; Fusion; Artificial neural network; Natural language processing; Machine learning; Linguistics","score_opus":0.0922357668056459,"score_gpt":0.327130698095469,"score_spread":0.23489493128982314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037031158","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.11858909,0.0018246382,0.8490056,0.001208302,0.00073515,0.00028194985,0.0011101577,0.009791041,0.0174541],"genre_scores_gemma":[0.792063,0.00061952276,0.18020461,0.00085991423,0.00038849484,0.00027018666,0.0016938054,0.00024817663,0.023652341],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997626,0.000036097557,0.000009343963,0.00008781479,0.00004272969,0.00006146459],"domain_scores_gemma":[0.9998041,0.000038122387,0.000016665224,0.000023078248,0.00009561965,0.000022515622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005111665,0.0008753918,0.00047524573,0.0007291197,0.00035831434,0.0005755342,0.0008185605,0.00083728426,0.012042343],"category_scores_gemma":[0.0008424317,0.00018741409,0.0007960128,0.000538829,0.00025286738,0.0009879143,0.0009130186,0.00091363594,0.0030790912],"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.0004952936,0.00036243987,0.0026742094,0.00020554551,0.00022145807,0.00022812562,0.00016687608,0.017027102,0.1134287,0.0042078397,0.022930838,0.83805174],"study_design_scores_gemma":[0.000033376247,0.00030405665,0.00607097,0.000049050876,0.00019301967,0.00014606326,0.00009113109,0.9141828,0.061321016,0.007860691,0.009707282,0.00004050483],"about_ca_topic_score_codex":0.004352905,"about_ca_topic_score_gemma":0.0063773156,"teacher_disagreement_score":0.012042343,"about_ca_system_score_codex":0.00055942533,"about_ca_system_score_gemma":0.00051206775,"threshold_uncertainty_score":0.040285647},"labels":[],"label_agreement":null},{"id":"W3037158098","doi":"10.1609/aaai.v34i10.7127","title":"Modelling a Conversational Agent with Complex Emotional Intelligence","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Speech and dialogue systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Conversation; Popularity; Feeling; Dialog system; Task (project management); Natural (archaeology); Emotional intelligence; Computer science; Architecture; Psychology; Cognitive science; Human–computer interaction; Social psychology; Communication; World Wide Web; Dialog box; Engineering","score_opus":0.17617551579434185,"score_gpt":0.2822054156203577,"score_spread":0.10602989982601588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037158098","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.092783794,0.00056358066,0.86715716,0.0014066256,0.00014121261,0.00021684352,0.00024209083,0.0005260408,0.036962613],"genre_scores_gemma":[0.78897065,0.0005678852,0.18692844,0.00018971578,0.00009254548,0.00044369628,0.00022694597,0.00012024605,0.022459855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957687,0.00018315064,0.000025924486,0.00008885096,0.0000681396,0.00005702329],"domain_scores_gemma":[0.9994461,0.00031973544,0.00006526545,0.000032521668,0.00007138679,0.0000649473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007555543,0.0006317746,0.00038907237,0.00040483562,0.00071158155,0.0025680803,0.0010816179,0.0014737402,0.0038850026],"category_scores_gemma":[0.0024032693,0.0005503128,0.0008258775,0.00026321298,0.0010772557,0.0017011653,0.0016816773,0.0010588377,0.0007442009],"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.00013241233,0.00010305784,0.0017054754,0.0001434953,0.00007481747,0.00065438374,0.0013173898,0.79800785,0.005841582,0.17675187,0.0014014577,0.013866192],"study_design_scores_gemma":[0.000015486943,0.000022793765,0.00011772472,0.000010603786,0.000013705722,0.00004611441,0.00007885144,0.97990626,0.00028300707,0.016900528,0.0025960447,0.000008936021],"about_ca_topic_score_codex":0.005699089,"about_ca_topic_score_gemma":0.0044072294,"teacher_disagreement_score":0.005699089,"about_ca_system_score_codex":0.00090212206,"about_ca_system_score_gemma":0.00086675165,"threshold_uncertainty_score":0.012996614},"labels":[],"label_agreement":null},{"id":"W3037187695","doi":"10.1609/aaai.v34i09.7068","title":"AISpace2: An Interactive Visualization Tool for Learning and Teaching Artificial Intelligence","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Universities Space Research Association","keywords":"Python (programming language); Computer science; Visualization; Java; Programming language; Artificial intelligence","score_opus":0.07395202084952299,"score_gpt":0.33647357932639266,"score_spread":0.26252155847686964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037187695","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.0039733876,0.00042181084,0.6894791,0.0009873905,0.00049656554,0.00035726727,0.014927822,0.25861603,0.030740563],"genre_scores_gemma":[0.07440862,0.0012021194,0.77615047,0.0011254564,0.00027199733,0.0019375393,0.038048003,0.06871971,0.03813598],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990086,0.00025056288,0.00006762898,0.0001485006,0.00041946143,0.00010528793],"domain_scores_gemma":[0.9967789,0.0019022422,0.00009204008,0.00038926332,0.00053492654,0.0003026213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014388743,0.0020222198,0.0009627486,0.0023644902,0.0006954624,0.002476551,0.0029608265,0.0013950114,0.11750969],"category_scores_gemma":[0.0066686156,0.00074064854,0.0016982842,0.0018217518,0.00061391963,0.003619157,0.0035658097,0.0030167315,0.020498797],"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.0005925007,0.00030655583,0.0011764156,0.0014058477,0.00013614987,0.00036616068,0.00087131717,0.017460963,0.009900473,0.031748943,0.6478858,0.28814885],"study_design_scores_gemma":[0.0004188196,0.00015993434,0.002012831,0.00032442174,0.000049157716,0.00050555,0.00020405467,0.13734365,0.021801522,0.075552605,0.7614264,0.00020110351],"about_ca_topic_score_codex":0.0025960268,"about_ca_topic_score_gemma":0.0037321015,"teacher_disagreement_score":0.11750969,"about_ca_system_score_codex":0.000769253,"about_ca_system_score_gemma":0.0016677728,"threshold_uncertainty_score":0.39310908},"labels":[],"label_agreement":null},{"id":"W3037204560","doi":"10.1609/aaai.v34i10.7218","title":"Personalized Prediction of Trust Links in Social Networks (Student Abstract)","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Access Control and Trust","field":"Social Sciences","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 Waterloo","funders":"","keywords":"Computer science; Cluster analysis; Domain (mathematical analysis); Social trust; Social network (sociolinguistics); Data science; World Wide Web; Social media; Artificial intelligence; Social capital; Mathematics","score_opus":0.11263340074121828,"score_gpt":0.3407574806887725,"score_spread":0.2281240799475542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037204560","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.71001256,0.00043130826,0.2830244,0.0008151045,0.000085285545,0.00008495904,0.0016060887,0.00060233526,0.0033379162],"genre_scores_gemma":[0.98658365,0.00007216464,0.012042958,0.000020737461,0.000021317368,0.000016719878,0.00041240052,0.000011482892,0.0008186169],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943477,0.00021017015,0.000026714632,0.00015090032,0.00012293243,0.000054517288],"domain_scores_gemma":[0.9964143,0.0018646783,0.0006793807,0.00039970566,0.00042089314,0.00022104665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011321602,0.00031375253,0.00032757744,0.00092707,0.00032728055,0.0007672123,0.00047260703,0.0007990542,0.0014740995],"category_scores_gemma":[0.008050327,0.00015151825,0.0003285047,0.0009828616,0.00028255727,0.0014286531,0.0005129119,0.0007553509,0.00048414478],"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.00071041903,0.0004415916,0.18889722,0.00015139577,0.00026864963,0.0003815811,0.00046630844,0.65185106,0.0057590418,0.008981322,0.007973194,0.13411823],"study_design_scores_gemma":[0.000007761907,0.00006458131,0.0136704305,0.000009352089,0.000020819834,0.00004333602,0.00006355752,0.97867715,0.0014036264,0.005435749,0.00059344334,0.000010121861],"about_ca_topic_score_codex":0.006582864,"about_ca_topic_score_gemma":0.011834186,"teacher_disagreement_score":0.006582864,"about_ca_system_score_codex":0.00069779967,"about_ca_system_score_gemma":0.00020868125,"threshold_uncertainty_score":0.013089061},"labels":[],"label_agreement":null},{"id":"W3037211332","doi":"10.1609/aaai.v34i09.7116","title":"Explaining Image Classifiers Generating Exemplars and Counter-Exemplars from Latent Representations","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Horizon 2020 Framework Programme","keywords":"Artificial intelligence; Computer science; Image (mathematics); Pattern recognition (psychology); Machine learning; Set (abstract data type); Class (philosophy); Counterfactual thinking; Decision tree; Autoencoder; Feature (linguistics); Coherence (philosophical gambling strategy); Fidelity; Probabilistic latent semantic analysis; Mathematics; Artificial neural network; Linguistics; Psychology","score_opus":0.10787770024118251,"score_gpt":0.3035250152619264,"score_spread":0.19564731502074387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037211332","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.05170059,0.00022876447,0.9448766,0.00045843108,0.000039864615,0.00006656296,0.00023339705,0.0008809985,0.001514851],"genre_scores_gemma":[0.7366478,0.00029345037,0.25901383,0.00020814525,0.00004814858,0.00011608618,0.0008217252,0.00011584375,0.002735016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974054,0.00006717164,0.000014247596,0.000081744874,0.000063798994,0.000032510907],"domain_scores_gemma":[0.99915135,0.0004294387,0.000105637926,0.00019681123,0.000086882465,0.000029953215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051048823,0.00063362706,0.00038915026,0.00041275876,0.0002084112,0.0007420021,0.0010766961,0.00095948315,0.002356318],"category_scores_gemma":[0.0024506557,0.00027377074,0.000800722,0.00026850795,0.0006130268,0.0012127957,0.00079736486,0.001057813,0.0003881588],"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.00023228597,0.00012603542,0.004709213,0.0002744766,0.00017187122,0.00080397434,0.00050069613,0.6446383,0.031789653,0.077320114,0.005804763,0.23362863],"study_design_scores_gemma":[0.000008988419,0.000029081542,0.00029015483,0.000011589691,0.000014138529,0.00006942298,0.00002136885,0.9746558,0.0047657145,0.01895735,0.0011678162,0.000008497947],"about_ca_topic_score_codex":0.0012860053,"about_ca_topic_score_gemma":0.0021322647,"teacher_disagreement_score":0.002356318,"about_ca_system_score_codex":0.0005037894,"about_ca_system_score_gemma":0.00037541767,"threshold_uncertainty_score":0.007882655},"labels":[],"label_agreement":null},{"id":"W3037454891","doi":"10.1609/aaai.v34i10.7208","title":"Gifting in Multi-Agent Reinforcement Learning (Student Abstract)","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Experimental Behavioral Economics Studies","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":"Appropriation; Reinforcement learning; Reinforcement; Computer science; Resource (disambiguation); Cognitive science; Artificial intelligence; Psychology; Epistemology; Social psychology","score_opus":0.21832020423111345,"score_gpt":0.3927524565995398,"score_spread":0.17443225236842633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037454891","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.34188607,0.0011320866,0.61617446,0.0062190527,0.0003623648,0.00010951515,0.00006046271,0.00035519848,0.03370088],"genre_scores_gemma":[0.979624,0.00015191431,0.01741835,0.00013457166,0.00004924449,0.000038259077,0.000007798299,0.000013896563,0.0025619413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991186,0.00063676585,0.000022063352,0.00007824249,0.00009347733,0.00005083195],"domain_scores_gemma":[0.99468344,0.0037353558,0.0004685219,0.00035662716,0.00033205125,0.00042411068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027847385,0.000268586,0.00045290843,0.00028037827,0.0005054787,0.00093976705,0.0007225733,0.00078820426,0.004077075],"category_scores_gemma":[0.012544412,0.00013285785,0.0003640328,0.00022850798,0.0016655695,0.0014501453,0.0010036147,0.0013975432,0.00026381644],"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.00024981314,0.00022497443,0.0035208627,0.00014686582,0.00007491821,0.00018643308,0.0003379188,0.42471433,0.0023347372,0.51440626,0.0024115872,0.05139132],"study_design_scores_gemma":[0.000082669285,0.00015320344,0.000756882,0.000025253785,0.000013487901,0.000044661127,0.000054898934,0.73489815,0.0007311576,0.2603942,0.0028304756,0.0000149288335],"about_ca_topic_score_codex":0.0013365123,"about_ca_topic_score_gemma":0.0008420508,"teacher_disagreement_score":0.004077075,"about_ca_system_score_codex":0.0010451702,"about_ca_system_score_gemma":0.00053962803,"threshold_uncertainty_score":0.014727294},"labels":[],"label_agreement":null},{"id":"W3037480037","doi":"10.1609/aaai.v34i10.7149","title":"Complex Emotional Intelligence Learning Using Deep Neural Networks (Student Abstract)","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Digital Communication and Language","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":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Interpretation (philosophy); Artificial intelligence; Representation (politics); Natural language processing; Deep learning; Artificial neural network; Deep neural networks; Data science; Machine learning","score_opus":0.16106942449781972,"score_gpt":0.3321417214757884,"score_spread":0.1710722969779687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037480037","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.20082504,0.0015761295,0.78590375,0.0021135844,0.00025494015,0.00008095729,0.00041729052,0.0013572006,0.0074711055],"genre_scores_gemma":[0.9077451,0.00042277377,0.08599731,0.0003062906,0.000068435285,0.000065386026,0.0004000984,0.00005123411,0.0049434453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983025,0.000051570853,0.000008085663,0.000052673877,0.00002519655,0.000032220334],"domain_scores_gemma":[0.9996803,0.0001452775,0.000038064776,0.000036244328,0.000078251316,0.000021875445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006601357,0.00046138366,0.00024402194,0.00027397388,0.00019683412,0.00079523644,0.0004475178,0.00052546686,0.0017366781],"category_scores_gemma":[0.0020096581,0.00020949481,0.0003330539,0.00037992853,0.00035337155,0.00087514747,0.000760272,0.0013289403,0.00041584863],"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.00021453928,0.0002715268,0.0045456295,0.00014951553,0.00017125145,0.00012977405,0.0002676197,0.42330602,0.013093461,0.01627468,0.008585337,0.53299063],"study_design_scores_gemma":[0.00000362207,0.00001718199,0.0005231181,0.0000076138394,0.0000073189526,0.0000060525003,0.000012248421,0.9915553,0.0008131123,0.0065947925,0.00045621558,0.0000035481564],"about_ca_topic_score_codex":0.0038337926,"about_ca_topic_score_gemma":0.0055662077,"teacher_disagreement_score":0.0038337926,"about_ca_system_score_codex":0.0005498522,"about_ca_system_score_gemma":0.00029518048,"threshold_uncertainty_score":0.007622957},"labels":[],"label_agreement":null},{"id":"W3037507436","doi":"10.1609/aaai.v34i09.7066","title":"Using AI Techniques in a Serious Game for Socio-Moral Reasoning Development","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Adaptation (eye); Computer science; Task (project management); Artificial intelligence; Adaptive learning; Game based learning; Human–computer interaction; Multimedia; Psychology; Engineering","score_opus":0.15483972265684443,"score_gpt":0.33178350719422706,"score_spread":0.17694378453738263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037507436","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.35045385,0.00016607008,0.6223628,0.0006638877,0.00015782031,0.0024702228,0.0003099708,0.005766804,0.01764865],"genre_scores_gemma":[0.54786104,0.00012135911,0.4436045,0.0002934084,0.000022607326,0.0014647943,0.0004703899,0.00015436976,0.006007506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873,0.0006330687,0.000091579575,0.00018589283,0.00023458482,0.00012497847],"domain_scores_gemma":[0.9960905,0.0026233236,0.00019961067,0.0002660203,0.00027889753,0.0005416147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018709102,0.0016964329,0.00057596556,0.00059729576,0.00037633246,0.0018372805,0.0023065335,0.0012257285,0.0055371313],"category_scores_gemma":[0.007528738,0.00048513574,0.0005199711,0.00023907404,0.000778957,0.002054376,0.0018159498,0.0015277236,0.001010555],"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.0049421773,0.017103484,0.013567181,0.0024917587,0.00041798144,0.0028401902,0.012967592,0.14665462,0.18965164,0.061910916,0.018439256,0.5290132],"study_design_scores_gemma":[0.0013595595,0.006437517,0.008002097,0.0003073309,0.0002109915,0.0017810381,0.0013638332,0.808075,0.06039711,0.038123406,0.07369363,0.00024844732],"about_ca_topic_score_codex":0.0012304016,"about_ca_topic_score_gemma":0.0013928316,"teacher_disagreement_score":0.0055371313,"about_ca_system_score_codex":0.00060006464,"about_ca_system_score_gemma":0.00070079794,"threshold_uncertainty_score":0.018523514},"labels":[],"label_agreement":null},{"id":"W3037533539","doi":"10.1609/aaai.v34i07.6833","title":"Learning Cross-Modal Context Graph for Visual Grounding","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Multimodal Machine Learning Applications","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; Ground; Artificial intelligence; Phrase; Graph; Modal; Modular design; Natural language processing; Theoretical computer science; Programming language","score_opus":0.08715630185034338,"score_gpt":0.3538858751306011,"score_spread":0.2667295732802577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037533539","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.057409458,0.00097576994,0.9243962,0.00035908332,0.00012073379,0.00015054997,0.0012774111,0.010926401,0.0043844306],"genre_scores_gemma":[0.6647895,0.00044219592,0.31933233,0.00064305327,0.00010774925,0.00020569922,0.0071598315,0.001036424,0.0062832204],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924576,0.00010588696,0.000021444155,0.00040664375,0.00011760815,0.00010271925],"domain_scores_gemma":[0.9994197,0.00017625003,0.00007251839,0.0001638936,0.00011600978,0.000051628493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005870227,0.0018319294,0.001240217,0.002606648,0.0008389349,0.0010237903,0.0029661888,0.0024289098,0.005064636],"category_scores_gemma":[0.0025679215,0.00059732056,0.0014277276,0.0024274543,0.0011095728,0.0033294098,0.002529755,0.0020491583,0.00200907],"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.00038433346,0.0003597562,0.003393093,0.00040066973,0.00021457291,0.0004194688,0.0003613058,0.19474033,0.037667513,0.023942208,0.023647076,0.71446973],"study_design_scores_gemma":[0.000036166395,0.00008797261,0.0008813867,0.00003313951,0.000041722175,0.000117105956,0.000113807015,0.95200586,0.0060086357,0.03704016,0.0036091753,0.000024840545],"about_ca_topic_score_codex":0.010863184,"about_ca_topic_score_gemma":0.022731025,"teacher_disagreement_score":0.010863184,"about_ca_system_score_codex":0.0010964298,"about_ca_system_score_gemma":0.0010014137,"threshold_uncertainty_score":0.021599889},"labels":[],"label_agreement":null},{"id":"W3037624633","doi":"10.1609/aaai.v34i09.7124","title":"Abstraction and Refinement in Games with Dynamic Weighted Terrain","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Pathfinding; Abstraction; Terrain; Computer science; Programming language; Work (physics); Theoretical computer science; Geography; Epistemology; Engineering; Cartography","score_opus":0.051167445417047715,"score_gpt":0.2847045815880936,"score_spread":0.23353713617104588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037624633","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.08727931,0.00021906396,0.88605803,0.00073900993,0.000059693175,0.00010943347,0.00009910042,0.0002989416,0.025137434],"genre_scores_gemma":[0.7791355,0.00028210596,0.20720154,0.0001143489,0.000032501906,0.00016035102,0.00020879655,0.000119531294,0.012745228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823844,0.00070674904,0.00012678008,0.00028069908,0.00036481005,0.00028250812],"domain_scores_gemma":[0.9973591,0.0015825308,0.00017155304,0.0004369268,0.00017950337,0.0002703068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016121577,0.00082611514,0.0008691289,0.0009890114,0.0014348044,0.0024322036,0.0018358417,0.0013844491,0.006126009],"category_scores_gemma":[0.008796122,0.00075971114,0.0015614132,0.0010570815,0.005069362,0.007594896,0.0058751088,0.0025275405,0.00042188625],"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.000076997305,0.000021478456,0.0004316522,0.00005590162,0.000022166576,0.00011755185,0.0011536073,0.05535916,0.0009255424,0.9303589,0.000595928,0.010881114],"study_design_scores_gemma":[0.00004134181,0.00003447672,0.0001829548,0.000020528252,0.000018164716,0.000051106876,0.00036806535,0.15004827,0.0005106958,0.8436989,0.005006555,0.000018908106],"about_ca_topic_score_codex":0.014180937,"about_ca_topic_score_gemma":0.013616314,"teacher_disagreement_score":0.014180937,"about_ca_system_score_codex":0.0016636051,"about_ca_system_score_gemma":0.001115341,"threshold_uncertainty_score":0.028196752},"labels":[],"label_agreement":null},{"id":"W3037683870","doi":"10.1609/aaai.v34i08.7044","title":"Machine-Learning-Based Functional Microcirculation Analysis","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Sepsis Diagnosis and Treatment","field":"Medicine","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Lawson Health Research Institute","keywords":"Microcirculation; Limiting; Computer science; Segmentation; Artificial intelligence; Task (project management); Current (fluid); Pattern recognition (psychology); Machine learning; Medicine; Engineering","score_opus":0.2111125486558938,"score_gpt":0.334285388207904,"score_spread":0.1231728395520102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037683870","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.047565386,0.00043470753,0.94693816,0.00029013134,0.00006126907,0.0001039756,0.0004455709,0.0028171183,0.0013437105],"genre_scores_gemma":[0.65211564,0.0004552574,0.343256,0.00024166332,0.000077938144,0.0003203959,0.0011329444,0.00023256718,0.0021676726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996449,0.000058335343,0.000024656163,0.000106156906,0.00011441697,0.000051607876],"domain_scores_gemma":[0.9991314,0.00035290033,0.00009413453,0.000073133284,0.00031765286,0.000030824915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000950566,0.0008465225,0.00068335095,0.0015106429,0.00028905063,0.0008458275,0.0010594649,0.00092052587,0.0014267089],"category_scores_gemma":[0.0029287129,0.00024336413,0.0007114795,0.0007500426,0.00041598504,0.0006892489,0.00042350305,0.00073646894,0.0005731384],"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.000306779,0.00028676106,0.009124167,0.00021533525,0.00016490469,0.00028385627,0.000081438484,0.4545903,0.058495324,0.0042459774,0.005994947,0.46621028],"study_design_scores_gemma":[0.0000028713491,0.000023606091,0.0012954571,0.000004179921,0.000007080045,0.0000422062,0.000005208503,0.99028605,0.0067367605,0.0011542079,0.00043365074,0.000008674023],"about_ca_topic_score_codex":0.00510919,"about_ca_topic_score_gemma":0.0036428843,"teacher_disagreement_score":0.00510919,"about_ca_system_score_codex":0.0009401123,"about_ca_system_score_gemma":0.00079840655,"threshold_uncertainty_score":0.010158896},"labels":[],"label_agreement":null},{"id":"W3037776504","doi":"10.1609/aaai.v34i10.7240","title":"Improving First-Order Optimization Algorithms (Student Abstract)","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms 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":"Université du Québec à Montréal","funders":"","keywords":"Convergence (economics); Computer science; Simple (philosophy); Variation (astronomy); Optimization algorithm; Algorithm; Order (exchange); First order; Mathematical optimization; Optimization problem; Mathematics; Applied mathematics","score_opus":0.09028591067846972,"score_gpt":0.3156316506765263,"score_spread":0.2253457399980566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037776504","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.016849916,0.00065215194,0.97590655,0.00021546624,0.00026635066,0.00004231597,0.000026067275,0.001187504,0.0048536276],"genre_scores_gemma":[0.24187489,0.00075091043,0.74417394,0.00022469251,0.00022280855,0.00010159793,0.0001093946,0.000427274,0.012114533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994198,0.00015452395,0.000026094203,0.00009003277,0.0002568954,0.00005268621],"domain_scores_gemma":[0.9985489,0.00076674536,0.00009458903,0.00020407239,0.00033755894,0.000048044312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001371125,0.0007344644,0.00065088377,0.00066347286,0.00032136822,0.00088561204,0.0007481466,0.0007686459,0.0054970738],"category_scores_gemma":[0.0056774914,0.00026009913,0.00056963525,0.00049083325,0.00045042954,0.0008947218,0.0008340894,0.0013580195,0.0019860712],"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.00017246322,0.00022048749,0.00090675865,0.00037013076,0.0000739497,0.00007218893,0.0001525882,0.44186884,0.015797699,0.03176852,0.0064661256,0.5021303],"study_design_scores_gemma":[0.000024225616,0.00012462569,0.00028303917,0.000020686082,0.000012784874,0.00005883084,0.000007662658,0.9792606,0.007847296,0.0071475045,0.005199995,0.000012678464],"about_ca_topic_score_codex":0.0017201508,"about_ca_topic_score_gemma":0.0019168404,"teacher_disagreement_score":0.0054970738,"about_ca_system_score_codex":0.0004195185,"about_ca_system_score_gemma":0.0006988768,"threshold_uncertainty_score":0.018389523},"labels":[],"label_agreement":null},{"id":"W3037779358","doi":"10.1609/aaai.v34i10.7264","title":"Literature Mining for Incorporating Inductive Bias in Biomedical Prediction Tasks (Student Abstract)","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Biomedical Text Mining and Ontologies","field":"Biochemistry, Genetics and Molecular Biology","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":"Université Laval; McGill University","funders":"","keywords":"Leverage (statistics); Inductive bias; Computer science; Machine learning; Relevance (law); Task (project management); Artificial intelligence; Multi-task learning; Feature (linguistics); Training set; Data mining; Data science; Engineering","score_opus":0.1364435877900705,"score_gpt":0.338468309210084,"score_spread":0.2020247214200135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037779358","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.055241853,0.0015776705,0.930488,0.005204334,0.00035437732,0.00032521412,0.0014534083,0.0028598667,0.0024952304],"genre_scores_gemma":[0.36574617,0.00069563085,0.6258029,0.001606986,0.00079959945,0.00055315613,0.002826811,0.00028103148,0.0016878331],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9917823,0.0041539404,0.0008108036,0.0013124509,0.001728481,0.00021199523],"domain_scores_gemma":[0.90041953,0.07959782,0.005262465,0.0070749614,0.0066237687,0.001021463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02444465,0.0007783745,0.0013648551,0.005980645,0.0012171135,0.0028418663,0.0026713363,0.002034845,0.0027907556],"category_scores_gemma":[0.10978236,0.00075502344,0.0014117379,0.005105735,0.0011727146,0.0043086302,0.0038787944,0.0022580782,0.001600924],"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.00085744815,0.0007853141,0.048228502,0.0012670745,0.0006471438,0.00065788516,0.00069290184,0.05996486,0.008056351,0.031914964,0.029740488,0.817187],"study_design_scores_gemma":[0.00017487897,0.00018090886,0.0058076084,0.00037891764,0.00017999746,0.00050103926,0.00015622261,0.83339405,0.01057869,0.13795683,0.010607613,0.00008323811],"about_ca_topic_score_codex":0.0013076725,"about_ca_topic_score_gemma":0.003326838,"teacher_disagreement_score":0.02444465,"about_ca_system_score_codex":0.0010101801,"about_ca_system_score_gemma":0.0024788454,"threshold_uncertainty_score":0.12927723},"labels":[],"label_agreement":null},{"id":"W3037903850","doi":"10.1609/aaai.v34i08.7027","title":"PIDS: An Intelligent Electric Power Management Platform","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Energy Load and Power Forecasting","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":"University of British Columbia","funders":"National Science Council; National Natural Science Foundation of China","keywords":"Electricity; Electric power system; Computer science; Consumption (sociology); Process (computing); Power consumption; Power management; Power (physics); Electric power; Demand response; Business; Environmental economics; Operations research; Operations management; Telecommunications; Risk analysis (engineering); Engineering; Economics; Electrical engineering","score_opus":0.06675763103910648,"score_gpt":0.2556870596545758,"score_spread":0.1889294286154693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037903850","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.18683204,0.0010481168,0.36457425,0.0017875418,0.0006047075,0.0014814889,0.013196652,0.33867913,0.091796026],"genre_scores_gemma":[0.8974984,0.00047458056,0.06502682,0.0005170152,0.000104757,0.00041707326,0.01205575,0.0013100378,0.022595555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997445,0.000028915196,0.000017748205,0.00006762241,0.000098849276,0.00004244462],"domain_scores_gemma":[0.99969196,0.00004271086,0.000035875782,0.00006557952,0.000092655944,0.00007135636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000503618,0.0007481531,0.00037152017,0.00077399943,0.00032902218,0.00082975405,0.0013287719,0.0003281354,0.007857242],"category_scores_gemma":[0.0008730681,0.0002957687,0.00024575627,0.00061747985,0.00028786284,0.0012626685,0.0013410802,0.0007151309,0.0025541235],"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.0028085362,0.00095849927,0.024699746,0.0006312671,0.00021518416,0.0011943525,0.00077061885,0.1116901,0.04697553,0.0199268,0.251924,0.5382053],"study_design_scores_gemma":[0.00038709128,0.00037447896,0.012088756,0.00003910572,0.00007211008,0.00019491906,0.00017690533,0.7872575,0.022517836,0.0121248895,0.16466218,0.000104155304],"about_ca_topic_score_codex":0.004730019,"about_ca_topic_score_gemma":0.003557803,"teacher_disagreement_score":0.007857242,"about_ca_system_score_codex":0.0008110015,"about_ca_system_score_gemma":0.00096147344,"threshold_uncertainty_score":0.026285052},"labels":[],"label_agreement":null},{"id":"W3038075178","doi":"10.1609/aaai.v34i09.7122","title":"The St. Petersburg Paradox: A Fresh Algorithmic Perspective","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Decision-Making and Behavioral Economics","field":"Decision Sciences","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":"McGill University","funders":"","keywords":"Perspective (graphical); Normative; Lottery; Expected utility hypothesis; Valuation (finance); Cognition; Epistemology; Stochastic game; Computer science; Positive economics; Mathematical economics; Psychology; Economics; Artificial intelligence; Philosophy; Microeconomics","score_opus":0.26155700513411934,"score_gpt":0.40065885441190724,"score_spread":0.1391018492777879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038075178","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.046633504,0.012472548,0.7226562,0.08481484,0.0012221535,0.00012258154,0.0005546392,0.0002575318,0.13126607],"genre_scores_gemma":[0.73081475,0.008431254,0.23289555,0.006211663,0.0026774122,0.0003004824,0.0004225077,0.000254827,0.017991541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975829,0.001050302,0.00011999784,0.00051678275,0.0005930783,0.0001369688],"domain_scores_gemma":[0.9905888,0.007251643,0.0004718806,0.00092138303,0.00052257837,0.00024380343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050407844,0.0010116445,0.001275563,0.0022508532,0.0017057259,0.006133992,0.0024526734,0.0034953377,0.0089892],"category_scores_gemma":[0.021457803,0.0006211572,0.0015165312,0.0021523414,0.010146371,0.017593302,0.0035628122,0.007277004,0.0010112167],"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.0000058348746,0.000005709742,0.0000754915,0.000023527016,0.0000050307103,0.000018946308,0.00006463606,0.0011284258,0.000046145793,0.9947068,0.0007407247,0.0031787853],"study_design_scores_gemma":[0.0000035355868,0.0000023624025,0.000030989217,0.000009370897,0.0000018937883,0.000016714064,0.000017636305,0.0027185164,0.000027987455,0.9950647,0.0021026046,0.000003709389],"about_ca_topic_score_codex":0.0013437785,"about_ca_topic_score_gemma":0.0012745715,"teacher_disagreement_score":0.0089892,"about_ca_system_score_codex":0.002086133,"about_ca_system_score_gemma":0.0018192892,"threshold_uncertainty_score":0.030071795},"labels":[],"label_agreement":null},{"id":"W3040628294","doi":"10.1609/aaai.v35i14.17474","title":"Learning Branching Heuristics for Propositional Model Counting","year":2021,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","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":"Vector Institute; University of Toronto","funders":"Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Heuristics; Solver; Computer science; Boolean satisfiability problem; Scalability; Propositional formula; Probabilistic logic; Theoretical computer science; Satisfiability; Algorithm; Propositional variable; Artificial intelligence; Programming language; Intermediate logic","score_opus":0.09233300877692752,"score_gpt":0.3111257048330753,"score_spread":0.21879269605614776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040628294","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.037678745,0.00084029,0.9480177,0.0011896731,0.00011173956,0.00013969136,0.00058848393,0.0045022094,0.0069315066],"genre_scores_gemma":[0.39180103,0.0005389264,0.6005455,0.0008304121,0.00017363277,0.00030640638,0.0020699669,0.0007754156,0.0029586277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977977,0.0009075443,0.00010389216,0.000480749,0.00047277374,0.00023736831],"domain_scores_gemma":[0.98793125,0.009892883,0.00044637514,0.0009419773,0.0005266913,0.00026092984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026626291,0.0014239176,0.0014725036,0.0015772833,0.0008043599,0.0022154304,0.002649829,0.0017509608,0.0051028556],"category_scores_gemma":[0.018901873,0.000988831,0.0015204765,0.0020874955,0.001234545,0.0035273482,0.0016469245,0.0035363652,0.0008102688],"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.00015867355,0.0002067012,0.0016406651,0.00022227208,0.00010089781,0.000111159105,0.00012765704,0.7482133,0.0011562703,0.06332601,0.013565539,0.17117088],"study_design_scores_gemma":[0.000024005767,0.000011060111,0.00005953061,0.000013731204,0.00001063675,0.000012106493,0.000013746716,0.95541525,0.00039475702,0.04326292,0.00077716523,0.000005108292],"about_ca_topic_score_codex":0.007517512,"about_ca_topic_score_gemma":0.01569122,"teacher_disagreement_score":0.007517512,"about_ca_system_score_codex":0.0032192175,"about_ca_system_score_gemma":0.0032233773,"threshold_uncertainty_score":0.023357153},"labels":[],"label_agreement":null},{"id":"W3043086594","doi":"10.1609/aaai.v35i6.16675","title":"Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings","year":2021,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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":"Mathematical economics; Matching (statistics); Nash equilibrium; Mathematics; Rank (graph theory); Social Welfare; Combinatorics; Statistics; Law","score_opus":0.09629689056889318,"score_gpt":0.26726188080499436,"score_spread":0.17096499023610118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043086594","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.2937384,0.00026011452,0.6892258,0.0015172411,0.000050216167,0.00020669229,0.0006143417,0.0006961371,0.013691062],"genre_scores_gemma":[0.7665377,0.00017197822,0.2252583,0.00022431836,0.000046828733,0.00014462737,0.00045854953,0.0001259927,0.0070317336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776196,0.00083307823,0.00012607622,0.0005213994,0.00038230978,0.00037520676],"domain_scores_gemma":[0.9955505,0.002158,0.00045781472,0.001093428,0.00032984748,0.00041045446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003014892,0.000652327,0.0011136816,0.00083622494,0.0012422777,0.0021876008,0.0015317774,0.0011995198,0.0060621174],"category_scores_gemma":[0.014181882,0.00041792588,0.0009882923,0.0014866585,0.0016728682,0.0057404623,0.0020867358,0.0016064798,0.0006214491],"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.00068109104,0.00035920733,0.0046901503,0.00020719852,0.00011479029,0.00018161883,0.00071004627,0.15472901,0.0048918934,0.70179415,0.0052590175,0.12638177],"study_design_scores_gemma":[0.000054241726,0.00007306342,0.0006852407,0.000020571488,0.000024483123,0.00009495673,0.000103682556,0.23816149,0.0015007226,0.756984,0.0022722362,0.000025324924],"about_ca_topic_score_codex":0.0025147267,"about_ca_topic_score_gemma":0.0027200112,"teacher_disagreement_score":0.0060621174,"about_ca_system_score_codex":0.0018498605,"about_ca_system_score_gemma":0.0015101669,"threshold_uncertainty_score":0.020279825},"labels":[],"label_agreement":null},{"id":"W3045642713","doi":"10.1609/aaai.v35i10.17114","title":"FC-GAGA: Fully Connected Gated Graph Architecture for Spatio-Temporal Traffic Forecasting","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Traffic Prediction and Management Techniques","field":"Engineering","cited_by":87,"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; Architecture; Graph; Data mining; Key (lock); Artificial intelligence; Theoretical computer science; Distributed computing; Machine learning","score_opus":0.05689012104607689,"score_gpt":0.2545655123770461,"score_spread":0.19767539133096923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045642713","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.058835316,0.00094100815,0.92946,0.0008872795,0.00017640706,0.00011098205,0.00063361804,0.004837847,0.0041174437],"genre_scores_gemma":[0.8170635,0.00048292373,0.17499308,0.00044901815,0.00008321985,0.00017318985,0.0014479728,0.00021250529,0.0050946046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982435,0.000045152417,0.0000072386274,0.00005844188,0.000033370103,0.000031393756],"domain_scores_gemma":[0.999424,0.00024614503,0.00004267564,0.00011500774,0.00011281363,0.00005943613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062021305,0.0010058772,0.00082417653,0.00076764595,0.00057346356,0.0007097648,0.0024379257,0.0012688199,0.0035849293],"category_scores_gemma":[0.0022049535,0.00044072032,0.0007104198,0.00087005144,0.00078645913,0.0014135642,0.0010649266,0.0016898328,0.0008317176],"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.00009010207,0.00009499501,0.00085094967,0.000053601587,0.00006001777,0.0000599134,0.000046042725,0.8687705,0.0018252021,0.008582576,0.005347191,0.11421887],"study_design_scores_gemma":[0.0000029289754,0.000008144225,0.00005094133,0.0000024344988,0.000003646059,0.000005329655,0.0000023809996,0.99541795,0.00020262125,0.0040643574,0.0002369002,0.0000023161288],"about_ca_topic_score_codex":0.018457992,"about_ca_topic_score_gemma":0.020989737,"teacher_disagreement_score":0.018457992,"about_ca_system_score_codex":0.0011298917,"about_ca_system_score_gemma":0.0014145614,"threshold_uncertainty_score":0.036701083},"labels":[],"label_agreement":null},{"id":"W3087195457","doi":"10.1609/aaai.v35i6.16650","title":"Achieving Proportionality up to the Maximin Item with Indivisible Goods","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI 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":"Conestoga College","funders":"National Research University Higher School of Economics","keywords":"Proportionality (law); Minimax; Benchmark (surveying); Computer science; Mathematical economics; Mathematical optimization; Economics; Microeconomics; Mathematics; Law; Political science","score_opus":0.12997399483738775,"score_gpt":0.2795413397289091,"score_spread":0.14956734489152135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3087195457","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.10248093,0.0003387253,0.8711308,0.0015749554,0.00010428535,0.00022290355,0.00021657631,0.00045616133,0.023474645],"genre_scores_gemma":[0.73873085,0.00030483122,0.25018567,0.00058863475,0.00013983155,0.0003158322,0.00024674548,0.00028886777,0.009198788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99442345,0.0023913912,0.00023520685,0.0012142014,0.0009411967,0.0007945851],"domain_scores_gemma":[0.9884444,0.0066849883,0.0009383483,0.0029127295,0.00044101887,0.0005785557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006234062,0.0012472977,0.001866147,0.0006058577,0.0014763591,0.00367249,0.0027175792,0.0021118673,0.008148094],"category_scores_gemma":[0.026826972,0.0006149846,0.0014134127,0.001621777,0.0027505674,0.009872288,0.004270815,0.0039837435,0.0013458251],"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.0006781463,0.00032618377,0.0017048874,0.00035096047,0.0001456696,0.00023185417,0.0006090984,0.17769341,0.005912814,0.72599274,0.0041708327,0.08218331],"study_design_scores_gemma":[0.00007262682,0.00019248604,0.0003974643,0.00004747116,0.00003768692,0.00019911795,0.00012345334,0.28082207,0.004465103,0.7085721,0.0050431397,0.000027202193],"about_ca_topic_score_codex":0.00086927763,"about_ca_topic_score_gemma":0.00094494177,"teacher_disagreement_score":0.008148094,"about_ca_system_score_codex":0.0018492285,"about_ca_system_score_gemma":0.002101218,"threshold_uncertainty_score":0.032969296},"labels":[],"label_agreement":null},{"id":"W3089350906","doi":"10.1609/aaai.v35i1.16126","title":"CardioGAN: Attentive Generative Adversarial Network with Dual Discriminators for Synthesis of ECG from PPG","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Non-Invasive Vital Sign Monitoring","field":"Engineering","cited_by":83,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Photoplethysmogram; Computer science; Artificial intelligence; Dual (grammatical number); Generator (circuit theory); Generative adversarial network; Wearable computer; Smartwatch; Pattern recognition (psychology); Computer vision; Deep learning; Power (physics); Embedded system","score_opus":0.0417995205250873,"score_gpt":0.24523803889840948,"score_spread":0.20343851837332216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089350906","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.036251508,0.0008034495,0.95777446,0.00041638906,0.00016028338,0.000057821777,0.0001772567,0.0014945221,0.0028643871],"genre_scores_gemma":[0.856189,0.0004426024,0.13329843,0.0007814733,0.0001331416,0.00012607036,0.0007267445,0.00017333502,0.0081291795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997862,0.000066373366,0.000006775327,0.00006908896,0.000045277036,0.000026241149],"domain_scores_gemma":[0.9995216,0.0003307453,0.00003490441,0.000046905006,0.000046136654,0.00001968163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006459062,0.0008571874,0.0004605106,0.000273453,0.00013336519,0.0003073188,0.000784062,0.00069788645,0.0014303364],"category_scores_gemma":[0.0016430927,0.0002942277,0.00043788215,0.0001781872,0.0004355959,0.00048068882,0.00090772007,0.0010989525,0.00042607827],"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.00033762027,0.0001254235,0.0015222173,0.0000993133,0.00010802998,0.00023282439,0.000073007424,0.7827194,0.018632632,0.0059245164,0.0050281053,0.18519695],"study_design_scores_gemma":[0.0000051070506,0.000028893566,0.00015005912,0.0000042796605,0.000006459994,0.0000335863,0.0000024257158,0.9963887,0.0017035942,0.0013455697,0.00032716684,0.0000042877086],"about_ca_topic_score_codex":0.0014977333,"about_ca_topic_score_gemma":0.0020556033,"teacher_disagreement_score":0.0014977333,"about_ca_system_score_codex":0.0003965752,"about_ca_system_score_gemma":0.0002609511,"threshold_uncertainty_score":0.0047849417},"labels":[],"label_agreement":null},{"id":"W3092206109","doi":"10.1609/aaai.v35i11.17203","title":"GraphMix: Improved Training of GNNs for Semi-Supervised Learning","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":113,"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 Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Graph; Convolutional neural network; Theoretical computer science; Artificial intelligence; Machine learning; Regularization (linguistics); Artificial neural network","score_opus":0.0913165739348398,"score_gpt":0.29778026928480694,"score_spread":0.20646369534996714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092206109","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.01931123,0.00035909333,0.96821475,0.00029783684,0.00012416564,0.00011164442,0.0004875567,0.0092995195,0.0017941959],"genre_scores_gemma":[0.31215224,0.0002522084,0.67466134,0.00081139285,0.00013840206,0.0003914555,0.0043605412,0.0017060336,0.005526447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988061,0.00038654794,0.000044340344,0.00045386286,0.00021908707,0.000090125024],"domain_scores_gemma":[0.997497,0.00096580083,0.00020429122,0.00075974443,0.00043738476,0.00013581554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023754034,0.002236879,0.0012936452,0.0017316879,0.00079628173,0.0012563511,0.0036448126,0.002774483,0.0034481776],"category_scores_gemma":[0.008651536,0.000883558,0.0012272841,0.0016817781,0.0015466323,0.003867614,0.0030724313,0.003443753,0.0021291887],"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.0002873327,0.00022528571,0.0023034893,0.00021857688,0.00021560444,0.00012378371,0.00018790243,0.6225448,0.0066542337,0.017892973,0.01382823,0.33551776],"study_design_scores_gemma":[0.000009501038,0.000019432144,0.000099268094,0.000007208218,0.000006047285,0.000012967037,0.000009946733,0.9899386,0.0012689685,0.0077984673,0.0008236477,0.0000058727546],"about_ca_topic_score_codex":0.0081591075,"about_ca_topic_score_gemma":0.015103835,"teacher_disagreement_score":0.0081591075,"about_ca_system_score_codex":0.0014832916,"about_ca_system_score_gemma":0.001762462,"threshold_uncertainty_score":0.016223192},"labels":[],"label_agreement":null},{"id":"W3092429884","doi":"10.1609/aaai.v35i11.17161","title":"Interpretable Sequence Classification via Discrete Optimization","year":2021,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Schwartz/Reisman Emergency Medicine Institute; Vector Institute; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Canada; Vector Institute; Canadian Institute for Advanced Research; Agencia Nacional de Investigación y Desarrollo; Microsoft Research","keywords":"Computer science; Artificial intelligence; Sequence (biology); Automaton; Machine learning; TRACE (psycholinguistics); Class (philosophy); Task (project management); Pattern recognition (psychology); Engineering","score_opus":0.08354368913952419,"score_gpt":0.3199233827761914,"score_spread":0.23637969363666722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092429884","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.022030111,0.0003618586,0.97321635,0.0008017618,0.00006779309,0.000062045016,0.00017001395,0.0012321868,0.002057946],"genre_scores_gemma":[0.74468625,0.00033504338,0.24792051,0.000574151,0.00014799545,0.00040466012,0.0008635903,0.00032054723,0.0047472855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989588,0.0003251532,0.000075178665,0.00036800138,0.00018708587,0.00008579395],"domain_scores_gemma":[0.99453163,0.0042574485,0.00032551138,0.00035238694,0.00043274823,0.00010019618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016159074,0.00097635837,0.0011097674,0.0008904134,0.00037960958,0.0014507938,0.0011839427,0.0016015506,0.0034418947],"category_scores_gemma":[0.009091362,0.0004927285,0.0009045152,0.0006564301,0.0015381946,0.002222716,0.0012988516,0.0025873515,0.00077707344],"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.00010471547,0.00006870055,0.0010264202,0.00012714113,0.000041147337,0.0000965728,0.00012573518,0.8383434,0.0017072551,0.029810902,0.0021323662,0.12641566],"study_design_scores_gemma":[0.0000044483695,0.000010633193,0.00003513268,0.000005743923,0.000002269469,0.000005316061,0.000004564469,0.9813276,0.00023432814,0.018202564,0.00016502003,0.0000024033018],"about_ca_topic_score_codex":0.0030203478,"about_ca_topic_score_gemma":0.0033090618,"teacher_disagreement_score":0.0034418947,"about_ca_system_score_codex":0.00159752,"about_ca_system_score_gemma":0.00128324,"threshold_uncertainty_score":0.011590898},"labels":[],"label_agreement":null},{"id":"W3092446983","doi":"10.1609/aaai.v36i6.20611","title":"Gradient Flow in Sparse Neural Networks and How Lottery Tickets Win","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Neural Network Applications","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 Calgary","funders":"","keywords":"Initialization; Computer science; Pruning; Generalization; Artificial intelligence; Artificial neural network; Inference; Machine learning; Flow (mathematics); Sparse matrix; Lottery; Early stopping; Work flow; Mathematics","score_opus":0.06280376046387758,"score_gpt":0.26998419598391143,"score_spread":0.20718043552003385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092446983","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.17042299,0.0031795693,0.78659993,0.010977714,0.00064873876,0.00009945819,0.00028161725,0.0010606481,0.026729334],"genre_scores_gemma":[0.9258141,0.0010706849,0.05987611,0.0008122965,0.00024675753,0.00012239358,0.00016826438,0.00035502124,0.011534353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948114,0.00022195315,0.000022049098,0.0000965933,0.000090105386,0.000088191606],"domain_scores_gemma":[0.99753004,0.0016657359,0.00022524704,0.00018269212,0.00022455919,0.00017177369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020832336,0.00048258467,0.0008004679,0.0007445403,0.001011953,0.0018353226,0.0011930197,0.0017311374,0.006288683],"category_scores_gemma":[0.013201946,0.0006276377,0.00050503155,0.0004908389,0.0021872958,0.0049277055,0.0014621518,0.0021470748,0.00067914545],"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.00028635853,0.00008918748,0.002875344,0.00015391268,0.00007751122,0.00018321448,0.00030810552,0.43193904,0.0014757613,0.4607673,0.012806059,0.08903825],"study_design_scores_gemma":[0.000028907472,0.000043553468,0.00041245724,0.00004146542,0.0000129850005,0.000053309574,0.00006433956,0.6520996,0.0006211806,0.34440398,0.0022011234,0.000017033954],"about_ca_topic_score_codex":0.0037978184,"about_ca_topic_score_gemma":0.0037439263,"teacher_disagreement_score":0.006288683,"about_ca_system_score_codex":0.0011316097,"about_ca_system_score_gemma":0.0008540802,"threshold_uncertainty_score":0.021037698},"labels":[],"label_agreement":null},{"id":"W3092832386","doi":"10.1609/aaai.v35i3.16342","title":"Vid-ODE: Continuous-Time Video Generation with Neural Ordinary Differential Equation","year":2021,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Vision and Imaging","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":"Kootenay Association for Science & Technology","funders":"","keywords":"Ode; Computer science; Extrapolation; Frame (networking); Interpolation (computer graphics); Pixel; Artificial intelligence; Encoder; Computer vision; Ordinary differential equation; Video processing; Range (aeronautics); Algorithm; Differential equation; Mathematics; Image (mathematics); Applied mathematics","score_opus":0.08078057342638968,"score_gpt":0.29939127115302844,"score_spread":0.21861069772663877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092832386","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.0063249734,0.00029808327,0.98850304,0.00011872016,0.00011122763,0.000057628844,0.00013856277,0.0025620982,0.0018856014],"genre_scores_gemma":[0.33425018,0.0004499716,0.655615,0.00031823557,0.000080326994,0.00022965451,0.0008035918,0.0005826098,0.0076704426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982566,0.000026807862,0.0000106461675,0.000046745758,0.000072954004,0.00001723008],"domain_scores_gemma":[0.9996222,0.00019616423,0.000036311863,0.000046093584,0.00007123967,0.000027836148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005876536,0.00056775654,0.0005111385,0.0002942583,0.00019600634,0.00058879843,0.0015012423,0.00097480236,0.0028415557],"category_scores_gemma":[0.002276738,0.0003407464,0.0005435577,0.0002499524,0.00030618088,0.0007787681,0.0009087316,0.0011942362,0.00069813954],"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.00013208736,0.00008086552,0.00081256806,0.0001578977,0.000052910753,0.000221567,0.00007510035,0.77608854,0.012546323,0.014393896,0.006488334,0.18894996],"study_design_scores_gemma":[0.0000050220983,0.0000063989546,0.000022938822,0.000002629654,0.000001499381,0.00001624755,0.0000010794797,0.9972529,0.001168368,0.00080493203,0.0007154382,0.0000026320301],"about_ca_topic_score_codex":0.005920595,"about_ca_topic_score_gemma":0.0060471147,"teacher_disagreement_score":0.005920595,"about_ca_system_score_codex":0.0006863104,"about_ca_system_score_gemma":0.00073552236,"threshold_uncertainty_score":0.011772275},"labels":[],"label_agreement":null},{"id":"W3093469769","doi":"10.1609/aaai.v36i9.21192","title":"On the Fairness of Causal Algorithmic Recourse","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Ethics and Social Impacts of AI","field":"Social Sciences","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Bundesministerium für Bildung und Forschung; Engineering and Physical Sciences Research Council; Mozilla Foundation; Leverhulme Trust; DeepMind","keywords":"Counterfactual thinking; Computer science; Classifier (UML); Perspective (graphical); Fairness measure; Artificial intelligence; Machine learning; Social psychology; Psychology; Throughput","score_opus":0.1413813037997515,"score_gpt":0.36724022511616067,"score_spread":0.22585892131640917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093469769","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.13694829,0.0009006854,0.8233615,0.009311192,0.00026296076,0.00024366769,0.00025767283,0.00022132158,0.028492652],"genre_scores_gemma":[0.92699236,0.00020674693,0.068270884,0.00091301446,0.00019812549,0.00022772307,0.000095829695,0.00011224149,0.0029831384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9592384,0.028439716,0.0015139434,0.0048086653,0.004299776,0.0016994247],"domain_scores_gemma":[0.7781263,0.170021,0.012591282,0.02685972,0.008813222,0.0035883589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.050070323,0.00077874656,0.0014479478,0.0015603037,0.0031267921,0.0059684278,0.002323902,0.0033315495,0.0053317095],"category_scores_gemma":[0.21271496,0.00046783322,0.00091816427,0.0012876034,0.010744362,0.008183373,0.0054019997,0.0044464837,0.0005372894],"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.0002822636,0.00010161412,0.0087239165,0.000108580454,0.00008930886,0.00012553208,0.0012140267,0.051341362,0.0007607219,0.8982223,0.0015288405,0.037501544],"study_design_scores_gemma":[0.00004399286,0.00006251865,0.0014900742,0.000052566058,0.00002433289,0.00006625344,0.0001969,0.0824761,0.0007603035,0.91188294,0.0029150527,0.000028965716],"about_ca_topic_score_codex":0.0025874267,"about_ca_topic_score_gemma":0.0023830633,"teacher_disagreement_score":0.050070323,"about_ca_system_score_codex":0.0039655613,"about_ca_system_score_gemma":0.005520645,"threshold_uncertainty_score":0.26480037},"labels":[],"label_agreement":null},{"id":"W3094049233","doi":"10.1609/aaai.v35i13.17371","title":"Amnesiac Machine Learning","year":2021,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Privacy-Preserving Technologies in Data","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 Waterloo","funders":"","keywords":"Computer science; Inference; General Data Protection Regulation; Computer security; Inversion (geology); Artificial intelligence; European union; Training set; Machine learning; Data Protection Act 1998; Business","score_opus":0.10297534371776143,"score_gpt":0.3104291401143369,"score_spread":0.2074537963965755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094049233","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.10657706,0.0022613204,0.8455113,0.0099798255,0.00028615686,0.00022264442,0.00063852273,0.005109336,0.029413838],"genre_scores_gemma":[0.8759817,0.0011837966,0.10493955,0.0017165276,0.00018101216,0.00018880122,0.0005857986,0.00024381484,0.01497902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953009,0.0014608522,0.00033674185,0.00088389195,0.0016854572,0.00033221743],"domain_scores_gemma":[0.97943467,0.006317366,0.0018474758,0.01075302,0.0012900819,0.00035744472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039049662,0.00071316643,0.0007009823,0.00079222873,0.00069992756,0.0019125956,0.001910956,0.0012690617,0.00466656],"category_scores_gemma":[0.02663742,0.00036810225,0.00068001886,0.0006054349,0.0033432106,0.00542366,0.003699972,0.00319974,0.0014881174],"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.00048886886,0.00034214937,0.011880714,0.00044418956,0.00033210474,0.0008028815,0.0010440606,0.04124249,0.011896871,0.22991055,0.033873897,0.6677412],"study_design_scores_gemma":[0.00007888687,0.00031459227,0.0048349933,0.000213112,0.00014810133,0.0031066826,0.00033606804,0.36329186,0.03402848,0.53674626,0.05679928,0.00010154586],"about_ca_topic_score_codex":0.0013380412,"about_ca_topic_score_gemma":0.0013041644,"teacher_disagreement_score":0.00466656,"about_ca_system_score_codex":0.0011197516,"about_ca_system_score_gemma":0.0016033509,"threshold_uncertainty_score":0.020651698},"labels":[],"label_agreement":null},{"id":"W3109558947","doi":"10.1609/aaai.v35i14.17527","title":"DialogBERT: Discourse-Aware Response Generation via Learning to Recover and Rank Utterances","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University","keywords":"Computer science; Utterance; Security token; Transformer; Natural language processing; Coherence (philosophical gambling strategy); Artificial intelligence; Conversation; Speech recognition; Language model; Psychology; Communication","score_opus":0.07664952376012893,"score_gpt":0.3068271529254254,"score_spread":0.23017762916529647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3109558947","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.020331366,0.00045258683,0.93991417,0.00029655933,0.0001668291,0.0003732147,0.0006733037,0.034518346,0.0032735746],"genre_scores_gemma":[0.43814814,0.00025592136,0.5354759,0.00054887857,0.00015562598,0.00092337426,0.0031380297,0.0016489357,0.01970513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989774,0.00048252984,0.0000239457,0.00029180292,0.00014570117,0.000078742436],"domain_scores_gemma":[0.9988217,0.00066267385,0.00006080066,0.00019869242,0.00015636397,0.000099698475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017812304,0.0016961964,0.000710213,0.00074740656,0.0004543393,0.0007317335,0.0020352295,0.0013232726,0.0071984855],"category_scores_gemma":[0.0039185295,0.00052212627,0.00068706984,0.0003500481,0.00054200925,0.0014922731,0.0019870128,0.0018409865,0.0038962378],"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.0011073264,0.00054527284,0.0014848452,0.00045283904,0.00014218717,0.00025964945,0.0009884704,0.07738575,0.04024076,0.007228626,0.034671325,0.8354929],"study_design_scores_gemma":[0.00007806466,0.00023504233,0.00051608693,0.00002579487,0.000033893462,0.00012448491,0.00016471974,0.96389383,0.017562324,0.0077187014,0.009601683,0.00004546156],"about_ca_topic_score_codex":0.0030550617,"about_ca_topic_score_gemma":0.0058852714,"teacher_disagreement_score":0.0071984855,"about_ca_system_score_codex":0.00062286924,"about_ca_system_score_gemma":0.00091303507,"threshold_uncertainty_score":0.02408135},"labels":[],"label_agreement":null},{"id":"W3109677567","doi":"10.1609/aaai.v35i13.17394","title":"Contract Scheduling With Predictions","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Fondation Mathématique Jacques Hadamard","keywords":"Computer science; Adversarial system; Robustness (evolution); Scheduling (production processes); Binary number; Consistency (knowledge bases); Mathematical optimization; Operations research; Artificial intelligence; Mathematics","score_opus":0.07369333998191974,"score_gpt":0.2945374869621534,"score_spread":0.2208441469802337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3109677567","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.047584917,0.00045213272,0.94384253,0.00069704803,0.00020701547,0.00019064339,0.0002605657,0.0011493524,0.0056157773],"genre_scores_gemma":[0.86836576,0.00032018204,0.12616415,0.00021908148,0.00021109547,0.00015829511,0.00031894076,0.0002372591,0.004005199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949733,0.0016862721,0.0003089259,0.00086459774,0.0015339674,0.0006328708],"domain_scores_gemma":[0.97852874,0.011947664,0.0020448691,0.0049537914,0.0015966531,0.00092822756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076667266,0.0010799267,0.0013187539,0.00052653305,0.0010057258,0.0021479474,0.0022092904,0.0011424168,0.0038279973],"category_scores_gemma":[0.031070134,0.00060764083,0.0006533219,0.0008697771,0.0024497092,0.00374985,0.0023440744,0.002515332,0.00076450687],"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.0010751386,0.00013979756,0.0022707132,0.00021156264,0.00006794016,0.00030799623,0.00036421558,0.73361427,0.005405271,0.19155475,0.0049216677,0.06006661],"study_design_scores_gemma":[0.000045510802,0.00008886498,0.000158118,0.00001529535,0.00001275981,0.00005477455,0.00002853806,0.9346783,0.0022952373,0.060216025,0.002387785,0.000018696895],"about_ca_topic_score_codex":0.0028545652,"about_ca_topic_score_gemma":0.0018512319,"teacher_disagreement_score":0.0076667266,"about_ca_system_score_codex":0.0017538263,"about_ca_system_score_gemma":0.0035560927,"threshold_uncertainty_score":0.040546},"labels":[],"label_agreement":null},{"id":"W3110181803","doi":"10.1609/aaai.v35i8.16820","title":"Decentralized Multi-Agent Linear Bandits with Safety Constraints","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","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 British Columbia","funders":"National Science Foundation","keywords":"Regret; Computer science; Mathematical optimization; Network topology; Upper and lower bounds; Bipartite graph; Linear programming; Graph; Telecommunications network; Mathematics; Theoretical computer science; Computer network; Machine learning","score_opus":0.26689795052528154,"score_gpt":0.43374491983382724,"score_spread":0.1668469693085457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110181803","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.048802845,0.00022306108,0.94667536,0.00039435868,0.000049331044,0.000054967768,0.000059033082,0.00015647321,0.0035845523],"genre_scores_gemma":[0.9198722,0.00024280464,0.07560096,0.00014443188,0.000087174165,0.00014297277,0.000096991396,0.00005767875,0.003754807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989379,0.0004389432,0.000031648462,0.00021573988,0.00020509267,0.00017064053],"domain_scores_gemma":[0.9966627,0.0019692418,0.00056452333,0.00033087103,0.0002888703,0.00018382545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012896445,0.00080753135,0.001001897,0.00030692795,0.00062297756,0.0010918129,0.0012140648,0.0011009832,0.0019741491],"category_scores_gemma":[0.005873162,0.0003716897,0.00052507134,0.000507453,0.0010908492,0.0016075845,0.0014209247,0.0014759796,0.00032685432],"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.00009740643,0.000044167668,0.00039710698,0.00005743265,0.000025443012,0.00006151179,0.000040915394,0.95262444,0.0013208168,0.036590263,0.0004893997,0.008251049],"study_design_scores_gemma":[0.000012670062,0.0000283412,0.000055143257,0.0000032815142,0.0000035776902,0.00001079264,0.00000946443,0.9875501,0.00029792712,0.011656518,0.00036858727,0.0000037108898],"about_ca_topic_score_codex":0.0024437262,"about_ca_topic_score_gemma":0.0015869002,"teacher_disagreement_score":0.0024437262,"about_ca_system_score_codex":0.00095076486,"about_ca_system_score_gemma":0.0011810389,"threshold_uncertainty_score":0.0068983436},"labels":[],"label_agreement":null},{"id":"W3110664450","doi":"10.1609/aaai.v35i15.17601","title":"MASKER: Masked Keyword Regularization for Reliable Text Classification","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","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":"Kootenay Association for Science & Technology","funders":"Defense Acquisition Program Administration; Agency for Defense Development","keywords":"Computer science; Regularization (linguistics); Artificial intelligence; Inference; Natural language processing; Context (archaeology); Generalization; Domain (mathematical analysis); Code (set theory); Pattern recognition (psychology); Speech recognition; Machine learning; Mathematics; Set (abstract data type)","score_opus":0.10858455132910795,"score_gpt":0.2992483494078932,"score_spread":0.19066379807878525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110664450","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.033733457,0.0006561287,0.9444998,0.00066014536,0.0002405967,0.00015286476,0.0007749643,0.01750641,0.0017756298],"genre_scores_gemma":[0.3464859,0.0003622357,0.63830674,0.0008092491,0.00030763826,0.0005019471,0.0030953262,0.0021538998,0.007977019],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858826,0.00039613634,0.00009729808,0.00043516548,0.00034744595,0.00013562405],"domain_scores_gemma":[0.9975714,0.001067624,0.00024741414,0.0006111818,0.0003799964,0.00012232432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002424701,0.0016997133,0.0010976718,0.0010942959,0.0006611468,0.0011613204,0.0022730366,0.0019581935,0.0041497382],"category_scores_gemma":[0.009747388,0.0005732201,0.0010943656,0.00083332596,0.0008050945,0.0030225369,0.0019233257,0.0026339216,0.004216004],"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.0012120511,0.00052135414,0.004077036,0.00046135177,0.00022324796,0.00048614602,0.00067497394,0.13445495,0.09920325,0.015822034,0.049389344,0.69347435],"study_design_scores_gemma":[0.000042434225,0.00008153687,0.0005100917,0.000022621209,0.000018956363,0.00011516705,0.000044428,0.96620643,0.018345742,0.010356054,0.004224127,0.000032490676],"about_ca_topic_score_codex":0.0030331467,"about_ca_topic_score_gemma":0.005786602,"teacher_disagreement_score":0.0041497382,"about_ca_system_score_codex":0.0008247124,"about_ca_system_score_gemma":0.0014556202,"threshold_uncertainty_score":0.01388222},"labels":[],"label_agreement":null},{"id":"W3110846353","doi":"10.1609/aaai.v35i16.17680","title":"Reinforced Multi-Teacher Selection for Knowledge Distillation","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":121,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bottleneck; Distillation; Computer science; Artificial intelligence; Inference; Machine learning; Selection (genetic algorithm); Learning cycle; Natural language processing; Mathematics education; Mathematics","score_opus":0.13650346173500516,"score_gpt":0.3305311318721846,"score_spread":0.19402767013717942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110846353","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.04144417,0.00058570376,0.9503056,0.00040724373,0.00008085468,0.00012369428,0.00013909097,0.004950334,0.001963233],"genre_scores_gemma":[0.6683879,0.00027227588,0.32399166,0.0005194155,0.0001299748,0.00038534874,0.0006924685,0.00059415586,0.00502689],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910957,0.00034928808,0.000039789986,0.00023832251,0.0001478297,0.00011517447],"domain_scores_gemma":[0.9980246,0.0011893607,0.00011687443,0.0003154099,0.0002441794,0.00010969101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015297367,0.0015097182,0.0013457381,0.00074015395,0.0007453372,0.0008011486,0.002488753,0.0015710306,0.0029447987],"category_scores_gemma":[0.0056873737,0.0007635451,0.00080057245,0.00087435317,0.00096026325,0.0025008519,0.0020130666,0.0025026489,0.0012442328],"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.00062676944,0.00036275288,0.0018790275,0.00021372347,0.000121869314,0.0002624163,0.00034201427,0.45255697,0.014576033,0.011970977,0.007217062,0.5098704],"study_design_scores_gemma":[0.000026978829,0.00004439475,0.000092757815,0.0000063191214,0.000011760656,0.00002520927,0.000015067966,0.9910313,0.003254833,0.0047097616,0.0007734829,0.00000821286],"about_ca_topic_score_codex":0.0033638137,"about_ca_topic_score_gemma":0.0076831346,"teacher_disagreement_score":0.0033638137,"about_ca_system_score_codex":0.0008102839,"about_ca_system_score_gemma":0.001584682,"threshold_uncertainty_score":0.0098513365},"labels":[],"label_agreement":null},{"id":"W3110902746","doi":"10.1609/aaai.v35i10.17109","title":"Warm Starting CMA-ES for Hyperparameter Optimization","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"National Institute of Advanced Industrial Science and Technology","keywords":"Bayesian optimization; Hyperparameter; Computer science; Adaptation (eye); Initialization; Machine learning; CMA-ES; Artificial intelligence; Task (project management); Random search; Bayesian probability; Algorithm; Evolution strategy; Evolutionary algorithm","score_opus":0.09431824299911165,"score_gpt":0.31262217584602,"score_spread":0.21830393284690833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110902746","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.01228857,0.0006657021,0.98259556,0.0002499668,0.000111137044,0.000069557136,0.00005115383,0.0010083572,0.0029599206],"genre_scores_gemma":[0.464156,0.0005167061,0.5270991,0.0009351543,0.00020735357,0.00069103227,0.0005617102,0.0007446367,0.0050883433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893016,0.0004995769,0.000054164033,0.0002089621,0.00019054198,0.000116568204],"domain_scores_gemma":[0.9970892,0.0019389327,0.00017676581,0.0002964519,0.00035408043,0.00014461808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001924177,0.0020305251,0.0017866597,0.0008989936,0.00076632964,0.0013719107,0.0017266102,0.0020352441,0.005520637],"category_scores_gemma":[0.008041586,0.0007929822,0.0013606217,0.0008094392,0.0013508177,0.0015815422,0.0020754288,0.0033787873,0.0017155071],"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.00015635573,0.000093066825,0.00059946906,0.00011408353,0.00009317952,0.00009186483,0.00009173525,0.9164827,0.003052871,0.010831092,0.0029485063,0.06544506],"study_design_scores_gemma":[0.000017214099,0.000027896427,0.000079692574,0.000012359076,0.0000069573725,0.00001301859,0.000009870989,0.9935787,0.00056423293,0.0049915905,0.00068945164,0.000008954068],"about_ca_topic_score_codex":0.0035696388,"about_ca_topic_score_gemma":0.003530051,"teacher_disagreement_score":0.005520637,"about_ca_system_score_codex":0.00065140915,"about_ca_system_score_gemma":0.0018857457,"threshold_uncertainty_score":0.01846838},"labels":[],"label_agreement":null},{"id":"W3110986327","doi":"10.1609/aaai.v35i16.17713","title":"CARE: Commonsense-Aware Emotional Response Generation with Latent Concepts","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"BC Research (Canada)","funders":"Nanyang Technological University; National Research Foundation Singapore; National Research Foundation","keywords":"Rationality; Construct (python library); Computer science; Field (mathematics); Cognitive psychology; Commonsense reasoning; Neglect; Focus (optics); Commonsense knowledge; Artificial intelligence; Cognitive science; Psychology; Epistemology; Knowledge base","score_opus":0.10740496312420665,"score_gpt":0.3075754435097127,"score_spread":0.20017048038550606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110986327","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.030953364,0.00050747226,0.9628081,0.0007353191,0.00010045953,0.00024844464,0.00017721552,0.0021850572,0.0022846316],"genre_scores_gemma":[0.7478228,0.00023440474,0.24505255,0.0006837361,0.00011470206,0.0006226506,0.0005136988,0.00020130014,0.0047540898],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980033,0.001089452,0.00006574924,0.00048830314,0.0002335577,0.00011960229],"domain_scores_gemma":[0.9960381,0.0027305863,0.0002704719,0.00047316667,0.00027851074,0.00020912812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002839928,0.0010960209,0.00075119286,0.0006647184,0.00049521413,0.0011451413,0.0017994643,0.0014050277,0.0029271313],"category_scores_gemma":[0.010598033,0.00047129023,0.0012537767,0.00042204678,0.0011382619,0.0024070388,0.0022785638,0.0024627866,0.0008203326],"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.0011974162,0.0010909695,0.008624764,0.00055196404,0.00038566903,0.0004736735,0.0030651442,0.35457864,0.030654414,0.059188675,0.015243148,0.52494556],"study_design_scores_gemma":[0.00004935995,0.00009346866,0.0005471979,0.000016286564,0.000033558186,0.000063805106,0.00007047705,0.96926033,0.0024652383,0.025625149,0.0017477258,0.00002737973],"about_ca_topic_score_codex":0.0021735902,"about_ca_topic_score_gemma":0.0031526273,"teacher_disagreement_score":0.0029271313,"about_ca_system_score_codex":0.00092618313,"about_ca_system_score_gemma":0.00069577363,"threshold_uncertainty_score":0.015019119},"labels":[],"label_agreement":null},{"id":"W3111359078","doi":"10.1609/aaai.v35i5.16483","title":"A SAT-based Resolution of Lam's Problem","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Data Management and Algorithms","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":"Wilfrid Laurier University; University of Windsor; University of Waterloo; Carleton University","funders":"","keywords":"Satisfiability; Consistency (knowledge bases); Projective test; Projective plane; Resolution (logic); Computer science; Code (set theory); Plane (geometry); Boolean satisfiability problem; Theoretical computer science; Algorithm; Mathematics; Discrete mathematics; Programming language; Algebra over a field; Pure mathematics; Geometry","score_opus":0.0691774485863179,"score_gpt":0.2791805394646435,"score_spread":0.21000309087832558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111359078","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.04150371,0.0009058472,0.863188,0.012627466,0.0011505254,0.0007522453,0.0015784423,0.0064153774,0.07187833],"genre_scores_gemma":[0.25179058,0.00053047156,0.7170798,0.003446586,0.00035618132,0.0006054381,0.0019562296,0.0008181333,0.023416542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99239963,0.003022178,0.00038232593,0.0013463997,0.0018912443,0.0009582248],"domain_scores_gemma":[0.9866671,0.007927891,0.00058542966,0.0023441878,0.002234526,0.00024093741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005654557,0.0009359202,0.00095641916,0.0017707631,0.003677328,0.0030290226,0.004363047,0.002423889,0.014416442],"category_scores_gemma":[0.031680454,0.0011812779,0.0033614857,0.0023321752,0.0035976223,0.005482144,0.0063147023,0.006519323,0.00395348],"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.0005028477,0.00030665883,0.0024891985,0.00084562233,0.00022426323,0.0014344032,0.0016996616,0.027781522,0.010409813,0.69148904,0.07771645,0.1851005],"study_design_scores_gemma":[0.0004720423,0.0003798554,0.0011161701,0.00044415673,0.00038285257,0.0015521662,0.0015118555,0.2295531,0.041675214,0.5355406,0.18710703,0.00026497993],"about_ca_topic_score_codex":0.0071188663,"about_ca_topic_score_gemma":0.007091935,"teacher_disagreement_score":0.014416442,"about_ca_system_score_codex":0.00250428,"about_ca_system_score_gemma":0.005753268,"threshold_uncertainty_score":0.048227847},"labels":[],"label_agreement":null},{"id":"W3111446732","doi":"10.1609/aaai.v35i14.17549","title":"Unsupervised Learning of Discourse Structures using a Tree Autoencoder","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Computer science; Autoencoder; Parsing; Artificial intelligence; Natural language processing; Tree (set theory); Set (abstract data type); Tree structure; Task (project management); Process (computing); Parse tree; Annotation; Deep learning; Binary tree","score_opus":0.10659551351510793,"score_gpt":0.323993007079681,"score_spread":0.21739749356457305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111446732","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.03166223,0.00030240128,0.96444625,0.00025736078,0.000054149867,0.000054937806,0.00021756337,0.0016592091,0.0013459175],"genre_scores_gemma":[0.46746126,0.0004888614,0.52341026,0.00026644816,0.00011285042,0.00026632292,0.0018424573,0.0002627765,0.0058886902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995763,0.00014634419,0.000019158118,0.00016417552,0.000054226777,0.00003982885],"domain_scores_gemma":[0.99891114,0.0007778173,0.0000628704,0.00007593055,0.00014304659,0.000029226132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009272683,0.00067007204,0.00058303645,0.0008375887,0.00036932915,0.00064742914,0.0008196868,0.00084250944,0.0012637356],"category_scores_gemma":[0.0022567904,0.00047941832,0.0008473639,0.00063016504,0.00051237654,0.0012614712,0.00084953866,0.0018840913,0.0007438606],"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.00021087365,0.00020521093,0.0018869514,0.00019303741,0.00016794013,0.00022016287,0.00052345585,0.34149712,0.03280178,0.017998481,0.004896228,0.59939873],"study_design_scores_gemma":[0.0000058822357,0.000017690476,0.00023934766,0.000011037231,0.000012233389,0.000013150909,0.000018147544,0.9918223,0.0030311777,0.0041151503,0.00070843747,0.0000054386433],"about_ca_topic_score_codex":0.003409156,"about_ca_topic_score_gemma":0.008003305,"teacher_disagreement_score":0.003409156,"about_ca_system_score_codex":0.0006354104,"about_ca_system_score_gemma":0.0009271981,"threshold_uncertainty_score":0.006778598},"labels":[],"label_agreement":null},{"id":"W3111605110","doi":"10.1609/aaai.v35i8.16859","title":"Provable Benefits of Overparameterization in Model Compression: From Double Descent to Pruning Neural Networks","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","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 British Columbia","funders":"National Science Foundation","keywords":"Pruning; Computer science; Artificial neural network; Feature (linguistics); Deep neural networks; Parameterized complexity; Artificial intelligence; Machine learning; Algorithm","score_opus":0.0892116449821859,"score_gpt":0.275641139043692,"score_spread":0.18642949406150608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111605110","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.080197185,0.00097115996,0.9116947,0.0025149153,0.00006408146,0.000061259896,0.00012231345,0.0006129516,0.0037614722],"genre_scores_gemma":[0.85557866,0.0010971621,0.13904029,0.0012714881,0.00023512225,0.00025488154,0.0003315711,0.00041440892,0.001776397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99622524,0.0019081562,0.00018196643,0.0005469191,0.0008565606,0.0002811602],"domain_scores_gemma":[0.9528137,0.03710758,0.0022112522,0.0057853847,0.0014077575,0.00067432603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007926587,0.0016617981,0.0016947364,0.0010273835,0.0009935806,0.0018727311,0.0022211792,0.002366393,0.0017877563],"category_scores_gemma":[0.08696115,0.0011155832,0.0009989643,0.00083678495,0.004456955,0.0051720818,0.005704106,0.0057996996,0.00039678637],"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.00045927253,0.0002415634,0.007393306,0.00035412732,0.00017848845,0.0007538245,0.00063937646,0.67253816,0.008248529,0.23395352,0.005432114,0.069807805],"study_design_scores_gemma":[0.00002683787,0.00009179308,0.000533875,0.00006748719,0.00001802392,0.00015337346,0.00005082661,0.8755259,0.001567796,0.12119982,0.0007447865,0.00001959813],"about_ca_topic_score_codex":0.0015590043,"about_ca_topic_score_gemma":0.0017317646,"teacher_disagreement_score":0.007926587,"about_ca_system_score_codex":0.001392079,"about_ca_system_score_gemma":0.0012639216,"threshold_uncertainty_score":0.041920304},"labels":[],"label_agreement":null},{"id":"W3111857876","doi":"10.1609/aaai.v35i6.16702","title":"Hindsight and Sequential Rationality of Correlated Play","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; University of Alberta","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Alberta Machine Intelligence Institute; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Hindsight bias; Rationality; Mathematical economics; Computer science; Counterfactual thinking; Regret; Bounded rationality; Fictitious play; Game theory; Artificial intelligence; Mathematics; Epistemology; Machine learning; Psychology; Cognitive psychology; Social psychology","score_opus":0.08312385965456567,"score_gpt":0.3069914782112599,"score_spread":0.2238676185566942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111857876","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.23298119,0.00036194755,0.7028697,0.0033258107,0.0000666169,0.00023891855,0.00013504666,0.0003118999,0.05970877],"genre_scores_gemma":[0.9595006,0.00011226793,0.037058588,0.00024385145,0.000027684835,0.00014149751,0.000045581415,0.000040198003,0.0028296304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9856711,0.007752326,0.0007552203,0.0021769593,0.0024099639,0.0012345015],"domain_scores_gemma":[0.96682346,0.020542713,0.0038382679,0.004986405,0.0028122482,0.0009968807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013337291,0.00062567845,0.0009470725,0.00089494005,0.0010560619,0.0039881165,0.001599701,0.0015637461,0.0031237197],"category_scores_gemma":[0.04827412,0.00041092004,0.0011228534,0.0005952649,0.008502314,0.0038380981,0.002866233,0.0027189497,0.00043288126],"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.00011655092,0.000052541833,0.0032096775,0.000051281306,0.00005800917,0.00009885711,0.00064606825,0.03217167,0.0007164792,0.94820154,0.00060374464,0.014073616],"study_design_scores_gemma":[0.000048579477,0.000052271087,0.001009362,0.00002943986,0.000020690648,0.000069274494,0.00013580981,0.08211793,0.0007380546,0.9143433,0.0014103156,0.000024862802],"about_ca_topic_score_codex":0.0039560255,"about_ca_topic_score_gemma":0.0029516106,"teacher_disagreement_score":0.013337291,"about_ca_system_score_codex":0.0025149563,"about_ca_system_score_gemma":0.0033784376,"threshold_uncertainty_score":0.07053512},"labels":[],"label_agreement":null},{"id":"W3111889198","doi":"10.1609/aaai.v35i14.17473","title":"Bayes DistNet - A Robust Neural Network for Algorithm Runtime Distribution Predictions","year":2021,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI 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 Alberta","funders":"","keywords":"Computer science; Algorithm; Solver; Bayesian probability; Constraint (computer-aided design); State (computer science); Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.06105650913797547,"score_gpt":0.278330767030751,"score_spread":0.21727425789277552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111889198","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.021428077,0.0014858766,0.9659615,0.0011745013,0.00020366763,0.000109360095,0.0007631235,0.003786769,0.0050870655],"genre_scores_gemma":[0.6456522,0.0011817695,0.3295605,0.0012702323,0.00035858253,0.0005597501,0.0032998484,0.0006587717,0.017458454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987344,0.00033920727,0.00006430123,0.00037711358,0.00035612375,0.00012885603],"domain_scores_gemma":[0.99722964,0.001622267,0.00025869938,0.00027649826,0.00051288423,0.00010007496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025493843,0.0012461209,0.0013893507,0.0012121606,0.00054693344,0.0016571956,0.0030986804,0.0018580244,0.004582461],"category_scores_gemma":[0.010757091,0.0009634385,0.000735041,0.0012573651,0.0009622267,0.0025429162,0.0016825973,0.002958014,0.0014080415],"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.00026185828,0.00012687892,0.0018137677,0.00009841483,0.000104913015,0.000052551768,0.00004320009,0.7626496,0.0009786815,0.01803026,0.007628375,0.20821145],"study_design_scores_gemma":[0.0000040046148,0.000008487793,0.00005349089,0.00000765975,0.000003430608,0.0000044138355,0.000001743183,0.99450135,0.00019756543,0.0048433784,0.00037141846,0.0000030230983],"about_ca_topic_score_codex":0.023256332,"about_ca_topic_score_gemma":0.03125307,"teacher_disagreement_score":0.023256332,"about_ca_system_score_codex":0.0024030851,"about_ca_system_score_gemma":0.0025622537,"threshold_uncertainty_score":0.04624194},"labels":[],"label_agreement":null},{"id":"W3112044954","doi":"10.1609/aaai.v35i9.16960","title":"Personalized Cross-Silo Federated Learning on Non-IID Data","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":659,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; Huawei Technologies (Canada); Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Hong Kong Baptist University","keywords":"Computer science; Benchmark (surveying); Heuristic; Pairwise comparison; Convergence (economics); Federated learning; Deep learning; Machine learning; Artificial intelligence; Artificial neural network; Data mining","score_opus":0.1532262172409678,"score_gpt":0.3559079458792938,"score_spread":0.202681728638326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112044954","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.036519747,0.0003797735,0.9588316,0.000976406,0.0000828283,0.0001200096,0.00021978239,0.0016999097,0.0011698834],"genre_scores_gemma":[0.76012427,0.00022320206,0.2327758,0.00081616757,0.0001483198,0.00026524308,0.0008643629,0.00025327902,0.004529359],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948725,0.0022099302,0.00024832503,0.001487884,0.0007524734,0.00042886217],"domain_scores_gemma":[0.9863999,0.0057479697,0.0007594251,0.005396006,0.0011738427,0.00052285846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00983317,0.0015488296,0.0030541182,0.0009695108,0.0015999692,0.002904011,0.0046595046,0.0031182943,0.0022175952],"category_scores_gemma":[0.026360618,0.0009825395,0.0012041872,0.0016599497,0.0026360971,0.0084882965,0.0061404714,0.00502368,0.0012346844],"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.000830785,0.00057727477,0.005654008,0.00017935452,0.00027285764,0.00042714467,0.0005153498,0.71621543,0.0034518728,0.031988364,0.008502781,0.23138478],"study_design_scores_gemma":[0.00001979274,0.000057857673,0.0002124649,0.000009077596,0.000012218375,0.000055293905,0.00006793811,0.96230996,0.0012304756,0.035303988,0.0007095221,0.000011291833],"about_ca_topic_score_codex":0.0027599682,"about_ca_topic_score_gemma":0.0035638805,"teacher_disagreement_score":0.00983317,"about_ca_system_score_codex":0.0019994208,"about_ca_system_score_gemma":0.0022127735,"threshold_uncertainty_score":0.052003384},"labels":[],"label_agreement":null},{"id":"W3112776819","doi":"10.1609/aaai.v35i14.17485","title":"Segatron: Segment-Aware Transformer for Language Modeling and Understanding","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Peng Cheng Laboratory","keywords":"Computer science; Transformer; Language model; Security token; Perplexity; Sentence; Artificial intelligence; Natural language processing; Speech recognition; Voltage; Engineering","score_opus":0.14032639263289431,"score_gpt":0.30855227845219885,"score_spread":0.16822588581930453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112776819","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.014765628,0.0005723407,0.7880742,0.00035271567,0.00023762102,0.00028651961,0.0127467625,0.17846559,0.0044985833],"genre_scores_gemma":[0.21348387,0.00083473546,0.6855058,0.0005805014,0.00009818526,0.0008086819,0.073481426,0.010361533,0.01484518],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944156,0.00012495341,0.000040837916,0.00025067193,0.000085601125,0.000056343477],"domain_scores_gemma":[0.9991672,0.00035330682,0.000042689502,0.00025451047,0.0001324684,0.000049865124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009042917,0.0024046665,0.00070253684,0.0015245466,0.0005266982,0.0014423679,0.0025811412,0.0010963117,0.015980463],"category_scores_gemma":[0.0032291997,0.0009990685,0.0021034682,0.0011061149,0.0005420442,0.0042814254,0.0018771251,0.0027593276,0.011124589],"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.00071316963,0.00030164432,0.0031992604,0.0010486825,0.00033534341,0.00045181366,0.0006482136,0.07660989,0.028828707,0.021049235,0.16648339,0.7003306],"study_design_scores_gemma":[0.000082140235,0.0001256624,0.0005332865,0.000043756852,0.000073508025,0.0002662509,0.00014374465,0.9187769,0.021260653,0.021739809,0.03689483,0.000059406568],"about_ca_topic_score_codex":0.011175122,"about_ca_topic_score_gemma":0.026260972,"teacher_disagreement_score":0.015980463,"about_ca_system_score_codex":0.0013130564,"about_ca_system_score_gemma":0.001986592,"threshold_uncertainty_score":0.053459942},"labels":[],"label_agreement":null},{"id":"W3116083993","doi":"10.1609/aaai.v35i15.17627","title":"Learning Contextual Representations for Semantic Parsing with Generation-Augmented Pre-Training","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":75,"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; Natural language processing; Utterance; Artificial intelligence; Parsing; Leverage (statistics); Schema (genetic algorithms); SQL; Language model; Information retrieval; Programming language","score_opus":0.15111855803125188,"score_gpt":0.331868255043637,"score_spread":0.1807496970123851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116083993","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.074059814,0.0009637151,0.8864401,0.00073125924,0.00015013547,0.00021100635,0.0022953886,0.031971864,0.0031765925],"genre_scores_gemma":[0.5316002,0.0004263009,0.44721952,0.00076466973,0.00009455292,0.0005598839,0.0150497835,0.0013946125,0.0028904886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896896,0.00042629227,0.000046310124,0.0003600055,0.00010208521,0.00009639945],"domain_scores_gemma":[0.9971615,0.0017874589,0.00009862869,0.00060967775,0.0002732773,0.000069441274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015223157,0.0016910913,0.0007848316,0.0008336882,0.0005226561,0.0008366901,0.002103564,0.0012765737,0.004466098],"category_scores_gemma":[0.005753723,0.00071705296,0.00107611,0.0010018508,0.000791762,0.003025438,0.0016860475,0.0031869537,0.0018593541],"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.00052002235,0.0005345633,0.005356467,0.00048807292,0.0001877165,0.00045512017,0.0007177239,0.37865898,0.016996084,0.010956855,0.031118805,0.5540097],"study_design_scores_gemma":[0.000031155912,0.000081946535,0.000540661,0.00002339437,0.000038001144,0.00006157292,0.00009011119,0.97646654,0.0076659806,0.011240388,0.0037430336,0.000017181383],"about_ca_topic_score_codex":0.00649394,"about_ca_topic_score_gemma":0.01714286,"teacher_disagreement_score":0.00649394,"about_ca_system_score_codex":0.0010177798,"about_ca_system_score_gemma":0.0017494173,"threshold_uncertainty_score":0.01494056},"labels":[],"label_agreement":null},{"id":"W3118394271","doi":"10.1609/aaai.v35i11.17166","title":"Solving Common-Payoff Games with Approximate Policy Iteration","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","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":"Université de Montréal; University of Alberta","funders":"","keywords":"Reinforcement learning; Computer science; Stochastic game; Scalability; Artificial intelligence; Common knowledge (logic); Scale (ratio); Mathematical optimization; Mathematical economics; Mathematics","score_opus":0.04921359465533086,"score_gpt":0.28882868471805523,"score_spread":0.23961509006272436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118394271","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.026910858,0.00018857357,0.966407,0.0004552162,0.000040739174,0.000083847175,0.000039864204,0.00045853347,0.005415401],"genre_scores_gemma":[0.7468053,0.00017551906,0.24793416,0.000305024,0.000050534738,0.00034693268,0.00013899208,0.0001250662,0.0041183326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987458,0.00050285767,0.00006186396,0.00024553927,0.00025770508,0.00018609816],"domain_scores_gemma":[0.9946477,0.004128562,0.00031404095,0.00036882827,0.00029679967,0.00024407277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023133766,0.0011976748,0.0016489358,0.00062044093,0.0006138362,0.0013216346,0.0015947022,0.0016087889,0.002347057],"category_scores_gemma":[0.010751815,0.0007520452,0.0006743508,0.00054473145,0.0020582215,0.0019340779,0.0023110667,0.002634974,0.0004301044],"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.00007579671,0.00006756953,0.00071549363,0.000060566912,0.000043404805,0.000046001667,0.00009594943,0.918689,0.0003528968,0.052788556,0.0009772474,0.026087502],"study_design_scores_gemma":[0.000013794904,0.0000144726755,0.00002649962,0.000004860173,0.0000031681989,0.000005985622,0.000008366132,0.97595745,0.00013948913,0.02357583,0.00024688835,0.0000032892915],"about_ca_topic_score_codex":0.0060786745,"about_ca_topic_score_gemma":0.007838199,"teacher_disagreement_score":0.0060786745,"about_ca_system_score_codex":0.0018123913,"about_ca_system_score_gemma":0.002990687,"threshold_uncertainty_score":0.013149917},"labels":[],"label_agreement":null},{"id":"W3118624083","doi":"10.1609/aaai.v35i7.16761","title":"Learning Intuitive Physics with Multimodal Generative Models","year":2021,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Music Technology and Sound Studies","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":"York University; McGill University","funders":"","keywords":"Computer science; Artificial intelligence; Object (grammar); Computer vision; Human–computer interaction; Autoencoder; Motion (physics); Perception; Tactile sensor; Modality (human–computer interaction); Generative model; Modalities; Generative grammar; Deep learning; Robot","score_opus":0.08675555381351376,"score_gpt":0.2865257242889408,"score_spread":0.19977017047542706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118624083","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.031115765,0.00027148915,0.9650325,0.0004670917,0.000033012224,0.000036115413,0.00014508655,0.0005902194,0.0023087065],"genre_scores_gemma":[0.8485339,0.0004213498,0.14438714,0.00037601194,0.000114552764,0.00023135594,0.00045229658,0.00025733552,0.0052260654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997149,0.000109398636,0.000009072558,0.00008602773,0.000049769664,0.000030754916],"domain_scores_gemma":[0.99846905,0.0012177798,0.00009764171,0.00009391204,0.00006506921,0.000056463174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009076435,0.00088043505,0.00085556146,0.00081136747,0.00038156734,0.0012052808,0.0010558205,0.0013398986,0.0033297609],"category_scores_gemma":[0.004122966,0.001092511,0.0013586391,0.00044079762,0.0012293619,0.0015482332,0.0017500153,0.001755027,0.00036643128],"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.000042766915,0.000029662566,0.000894457,0.00005308944,0.000056250265,0.00006853407,0.00010645959,0.939123,0.0010642289,0.033755742,0.00087757496,0.023928279],"study_design_scores_gemma":[0.000004329704,0.0000060335815,0.00005880163,0.000003913148,0.00000254178,0.000006518751,0.000004696019,0.98271203,0.000059123548,0.016968083,0.00017092361,0.0000029459611],"about_ca_topic_score_codex":0.006185147,"about_ca_topic_score_gemma":0.008799714,"teacher_disagreement_score":0.006185147,"about_ca_system_score_codex":0.0010408052,"about_ca_system_score_gemma":0.00060577656,"threshold_uncertainty_score":0.012298286},"labels":[],"label_agreement":null},{"id":"W3119519251","doi":"10.1609/aaai.v35i16.17681","title":"What's the Best Place for an AI Conference, Vancouver or _______: Why Completing Comparative Questions is Difficult","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Competence (human resources); Artificial intelligence; sort; Natural language processing; Benchmark (surveying); Set (abstract data type); Task (project management); Language model; Machine learning; Cognitive science; Psychology; Information retrieval","score_opus":0.20765916333050938,"score_gpt":0.36477807941224205,"score_spread":0.15711891608173267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119519251","genre_codex":"other","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.1865802,0.011196064,0.027711945,0.09881852,0.0062001743,0.00042472532,0.022103913,0.007116349,0.6398482],"genre_scores_gemma":[0.6952793,0.005767223,0.043406542,0.0051122108,0.0008747542,0.0002214436,0.02562975,0.001252831,0.22245595],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993579,0.0002195016,0.000030905325,0.00015697203,0.0001302013,0.00010456522],"domain_scores_gemma":[0.99753004,0.00066305394,0.00012824059,0.00020783328,0.00078048796,0.00069047505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013002687,0.00056387635,0.00041393752,0.0007662399,0.0032267051,0.0045204894,0.0007929296,0.0015209964,0.04888696],"category_scores_gemma":[0.007582098,0.00025518617,0.00033317774,0.0014677515,0.00096611807,0.0035302844,0.0009270457,0.0021529284,0.01137626],"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.00047451715,0.00015789612,0.014469725,0.00065984274,0.000083050414,0.0006339146,0.0026890626,0.004381315,0.0033709554,0.02303216,0.6434322,0.30661538],"study_design_scores_gemma":[0.00006335695,0.000088167086,0.028612195,0.00049470627,0.000054176468,0.0004165666,0.0076354565,0.012076243,0.004215505,0.029315904,0.9169004,0.00012744415],"about_ca_topic_score_codex":0.17785506,"about_ca_topic_score_gemma":0.41248897,"teacher_disagreement_score":0.17785506,"about_ca_system_score_codex":0.0037287928,"about_ca_system_score_gemma":0.0038791772,"threshold_uncertainty_score":0.35363966},"labels":[],"label_agreement":null},{"id":"W3119545471","doi":"10.1609/aaai.v35i5.16553","title":"Knowledge-Enhanced Top-K Recommendation in Poincaré Ball","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Recommender Systems and Techniques","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":"Interpretability; Computer science; Recommender system; Knowledge graph; Learning to rank; Graph; Regularization (linguistics); Artificial intelligence; Machine learning; Information retrieval; Theoretical computer science; Ranking (information retrieval)","score_opus":0.08167864707999131,"score_gpt":0.32108447212529523,"score_spread":0.23940582504530392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119545471","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.055052027,0.0023012096,0.928969,0.00097215566,0.00020185416,0.00013987697,0.0005179591,0.0013033529,0.010542571],"genre_scores_gemma":[0.78331774,0.0018513968,0.19542606,0.000838098,0.0003243892,0.0002332327,0.0017298835,0.00018691385,0.016092215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983323,0.00058829656,0.00009690074,0.00037625188,0.0004529736,0.00015328656],"domain_scores_gemma":[0.996646,0.0017138617,0.00021268426,0.000547727,0.0007204492,0.00015929088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019506504,0.0007224786,0.0025445605,0.0017100974,0.0010634987,0.0017963535,0.0035029575,0.0018037184,0.006237557],"category_scores_gemma":[0.007334649,0.0007533923,0.0012962229,0.0030519424,0.0015262745,0.0027975156,0.0016957872,0.0013690542,0.0024526988],"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.00044524926,0.0002126161,0.0023848894,0.0002278257,0.00014134434,0.00025552014,0.00021077006,0.79843664,0.0014124094,0.0592303,0.010715445,0.12632704],"study_design_scores_gemma":[0.000014737174,0.000022966808,0.00017157379,0.0000071005165,0.000007521895,0.000019822488,0.0000082303995,0.986534,0.0001649202,0.012355617,0.00068455574,0.000009059537],"about_ca_topic_score_codex":0.05936041,"about_ca_topic_score_gemma":0.03136255,"teacher_disagreement_score":0.05936041,"about_ca_system_score_codex":0.0019420461,"about_ca_system_score_gemma":0.0018259177,"threshold_uncertainty_score":0.11802977},"labels":[],"label_agreement":null},{"id":"W3120177330","doi":"10.1609/aaai.v35i12.17258","title":"Towards Generalized Implementation of Wasserstein Distance in GANs","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Neuroimaging Techniques and Applications","field":"Medicine","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":"Université de Montréal","funders":"Shanghai Jiao Tong University; National Natural Science Foundation of China","keywords":"Duality (order theory); Lipschitz continuity; Mathematics; Constraint (computer-aided design); Duality gap; Sobolev space; Strong duality; Applied mathematics; Perturbation function; Mathematical optimization; Pure mathematics; Mathematical analysis; Optimization problem; Geometry","score_opus":0.16416688522055034,"score_gpt":0.41593591733574564,"score_spread":0.2517690321151953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120177330","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.0070818323,0.00020504392,0.9896017,0.00017943479,0.000039737566,0.000026253656,0.000051714196,0.0006688381,0.002145537],"genre_scores_gemma":[0.44290158,0.0005641292,0.548641,0.0007022523,0.00011588462,0.00020390033,0.0005751141,0.00067308237,0.0056230384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987864,0.0006000501,0.000046462847,0.00021298479,0.00025257524,0.0001016535],"domain_scores_gemma":[0.9989918,0.0004992772,0.00006643944,0.0002025967,0.0001749445,0.000064995824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022701737,0.0010276062,0.0010694243,0.00046296333,0.00027675543,0.0009815299,0.0015560618,0.001224206,0.0021612563],"category_scores_gemma":[0.0051828367,0.00044157103,0.0006346572,0.0005384052,0.0008249442,0.0020322043,0.0021406512,0.002679479,0.00076541735],"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.0001565392,0.000102383055,0.00097559736,0.00014720077,0.000074794894,0.000120264995,0.00015067644,0.6282478,0.0067729503,0.19102892,0.00606282,0.16616015],"study_design_scores_gemma":[0.0000066034663,0.000020360623,0.000052178493,0.000007487327,0.0000036980005,0.000022357015,0.000005563737,0.9683415,0.00089105417,0.029285353,0.0013592137,0.0000046176806],"about_ca_topic_score_codex":0.0021482622,"about_ca_topic_score_gemma":0.0031539206,"teacher_disagreement_score":0.0022701737,"about_ca_system_score_codex":0.0009821352,"about_ca_system_score_gemma":0.00101814,"threshold_uncertainty_score":0.012005985},"labels":[],"label_agreement":null},{"id":"W3120266904","doi":"10.1609/aaai.v35i1.16123","title":"Queue-Learning: A Reinforcement Learning Approach for Providing Quality of Service","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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":"Computer science; Queueing theory; Reinforcement learning; Quality of service; Probabilistic logic; Queue; Service (business); Distributed computing; Controller (irrigation); Computer network; Artificial intelligence","score_opus":0.10823393950558702,"score_gpt":0.31468509961001045,"score_spread":0.20645116010442344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120266904","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.012057425,0.00032902125,0.98504215,0.00028918273,0.0000744085,0.000049239017,0.000036145582,0.0005223868,0.0015999448],"genre_scores_gemma":[0.85590094,0.0004008381,0.13970132,0.00033764704,0.00010364897,0.00018379414,0.00008515384,0.000087370296,0.003199253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994733,0.00016619649,0.000026856978,0.00011249301,0.00013930873,0.00008199548],"domain_scores_gemma":[0.9985297,0.00089164556,0.00013928622,0.000066434746,0.00026403085,0.00010889392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016451839,0.00079678727,0.0009186456,0.00040718378,0.00030692937,0.0007193369,0.002071085,0.0009896877,0.0017787726],"category_scores_gemma":[0.0043156263,0.00032490664,0.0004210847,0.00040258616,0.00094167347,0.0008910763,0.00092773844,0.0020671445,0.0002683994],"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.000079793084,0.00009870004,0.0006650088,0.000055277913,0.000039457445,0.00003148073,0.000042281474,0.94525605,0.0011489269,0.009569143,0.0010042601,0.04200965],"study_design_scores_gemma":[0.000006843964,0.000017358489,0.00002735944,0.0000017653609,0.0000030410713,0.0000023997757,0.0000011153387,0.9980439,0.00013761685,0.0016361391,0.00012031508,0.0000021763194],"about_ca_topic_score_codex":0.009503297,"about_ca_topic_score_gemma":0.0073023974,"teacher_disagreement_score":0.009503297,"about_ca_system_score_codex":0.00147209,"about_ca_system_score_gemma":0.0018710535,"threshold_uncertainty_score":0.018895984},"labels":[],"label_agreement":null},{"id":"W3121004253","doi":"10.1609/aaai.v35i17.17758","title":"Predicting Forest Fire Using Remote Sensing Data And Machine Learning","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Fire effects on ecosystems","field":"Environmental Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"National Supercomputing Centre Singapore; National Research Foundation Singapore; National Research Foundation","keywords":"Deforestation (computer science); Baseline (sea); Computer science; Receiver operating characteristic; Climate change; Machine learning; Remote sensing; Random forest; Environmental science; Artificial intelligence; Geography; Ecology","score_opus":0.08513471316666049,"score_gpt":0.283141911570352,"score_spread":0.19800719840369152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121004253","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.90336376,0.0010317572,0.088795066,0.00065380306,0.00012246077,0.00010168265,0.0010173363,0.0014042694,0.0035098686],"genre_scores_gemma":[0.9710793,0.00020541028,0.02725939,0.000046071844,0.00005169367,0.00002422367,0.0007879559,0.000011844298,0.00053416844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997191,0.00007442924,0.000026196907,0.00007722334,0.00006910916,0.000033914574],"domain_scores_gemma":[0.99892515,0.0006355566,0.0001294748,0.0000859719,0.00018189911,0.00004192818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094254414,0.0007973474,0.00046652686,0.0016063558,0.00025351797,0.0006644438,0.0004773233,0.000639529,0.0005697349],"category_scores_gemma":[0.0028317596,0.00021165397,0.00048629043,0.0008289772,0.00020763704,0.00087154214,0.0002969834,0.00064269133,0.00033137054],"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.00026069544,0.00072782213,0.09404802,0.000085408545,0.0001650868,0.0002270996,0.000046672463,0.6292338,0.0045596794,0.00053247384,0.0018293713,0.2682839],"study_design_scores_gemma":[0.0000038444355,0.000023568646,0.008964725,0.000006314757,0.000010214722,0.000021444299,0.000017219067,0.98939055,0.0009914618,0.00040540055,0.00015894984,0.000006349014],"about_ca_topic_score_codex":0.015904473,"about_ca_topic_score_gemma":0.015772238,"teacher_disagreement_score":0.015904473,"about_ca_system_score_codex":0.00052492926,"about_ca_system_score_gemma":0.00039785774,"threshold_uncertainty_score":0.03162384},"labels":[],"label_agreement":null},{"id":"W3125222291","doi":"10.1609/aaai.v35i6.16715","title":"Solution Concepts in Hierarchical Games Under Bounded Rationality With Applications to Autonomous Driving","year":2021,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Autonomous Vehicle Technology and Safety","field":"Engineering","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 Waterloo","funders":"","keywords":"Bounded rationality; Computer science; Context (archaeology); Bounded function; Set (abstract data type); Intersection (aeronautics); Game theory; Mathematical optimization; Artificial intelligence; Mathematical economics; Mathematics; Engineering","score_opus":0.04590703961343839,"score_gpt":0.298804343829207,"score_spread":0.2528973042157686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125222291","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.074068844,0.0005972999,0.9187022,0.0011391338,0.000047982245,0.000101777194,0.0002771926,0.00015855047,0.0049070995],"genre_scores_gemma":[0.8341733,0.0006882966,0.16122587,0.0002486157,0.000083072846,0.0003147212,0.00042769825,0.00006847888,0.0027700234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983339,0.0008062866,0.000116998315,0.00030711337,0.00024863041,0.00018715311],"domain_scores_gemma":[0.99221694,0.0056319935,0.0009984432,0.00027291986,0.00046697428,0.00041270966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035217095,0.0011833401,0.0009939636,0.0015157538,0.0007657399,0.0019166751,0.0016919401,0.0011972608,0.002764994],"category_scores_gemma":[0.014418536,0.0005251169,0.0015265986,0.0010711388,0.00254748,0.0031575477,0.0019434792,0.0019119604,0.00019340008],"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.00003097019,0.000046011068,0.0014100859,0.00010528524,0.00004708144,0.00006159839,0.000321493,0.56053686,0.00035581616,0.4284258,0.0006832664,0.007975712],"study_design_scores_gemma":[0.000012902983,0.000018576648,0.00020507493,0.000015681238,0.0000073643896,0.0000074640216,0.000066734334,0.7459238,0.000074677206,0.2532275,0.00043056897,0.000009551055],"about_ca_topic_score_codex":0.020751562,"about_ca_topic_score_gemma":0.0127626415,"teacher_disagreement_score":0.020751562,"about_ca_system_score_codex":0.0029262158,"about_ca_system_score_gemma":0.0024627738,"threshold_uncertainty_score":0.041261554},"labels":[],"label_agreement":null},{"id":"W3127215335","doi":"10.1609/aaai.v35i9.16969","title":"Show, Attend and Distill: Knowledge Distillation via Attention-based Feature Matching","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":145,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Distillation; Computer science; Feature (linguistics); Matching (statistics); Artificial intelligence; Machine learning; Selection (genetic algorithm); Control (management); Knowledge transfer; Mathematics; Knowledge management; Statistics","score_opus":0.04860094291411718,"score_gpt":0.2885622224527176,"score_spread":0.23996127953860044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127215335","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.035491988,0.00052693917,0.95174587,0.00036119248,0.00009236396,0.00012389025,0.00038032886,0.008487231,0.002790229],"genre_scores_gemma":[0.4952637,0.00032904002,0.49273708,0.0006515748,0.000085827734,0.00022474153,0.0017549177,0.0008628013,0.008090291],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946326,0.000118302916,0.000025084393,0.00020734927,0.000118261174,0.00006765273],"domain_scores_gemma":[0.9991441,0.0003755638,0.00006320071,0.0002696593,0.00008819676,0.00005928641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008660458,0.0011631055,0.0009957151,0.001376051,0.00075288524,0.001002372,0.0027884752,0.0017022914,0.004592468],"category_scores_gemma":[0.0035650115,0.0005859807,0.0009447217,0.0012136931,0.0010621808,0.004673275,0.0027743513,0.0020744326,0.0014017345],"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.00039527952,0.00033976414,0.0010662191,0.000237819,0.00013081449,0.0002602775,0.00030253996,0.12134302,0.026207749,0.019064238,0.011914214,0.8187381],"study_design_scores_gemma":[0.00003393022,0.000089277164,0.0002836657,0.000014251036,0.000028137647,0.00009109097,0.000044660406,0.9521351,0.016421486,0.027126368,0.003706516,0.000025582116],"about_ca_topic_score_codex":0.0049229404,"about_ca_topic_score_gemma":0.006928398,"teacher_disagreement_score":0.0049229404,"about_ca_system_score_codex":0.0007201168,"about_ca_system_score_gemma":0.0010045441,"threshold_uncertainty_score":0.015363395},"labels":[],"label_agreement":null},{"id":"W3128669723","doi":"10.1609/aaai.v35i13.17368","title":"Agent Incentives: A Causal Perspective","year":2021,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Soundness; Incentive; Completeness (order theory); Perspective (graphical); Computer science; Value (mathematics); Control (management); Influence diagram; Risk analysis (engineering); Microeconomics; Economics; Data mining; Artificial intelligence; Mathematics; Machine learning; Business","score_opus":0.09902962670770805,"score_gpt":0.3214071807500529,"score_spread":0.22237755404234488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128669723","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.0027177131,0.00054844044,0.977023,0.002140793,0.0000803323,0.000072643714,0.00014137576,0.00011009042,0.017165627],"genre_scores_gemma":[0.49362385,0.002454651,0.49181578,0.0009394875,0.00063104654,0.000719406,0.00028419253,0.00019869622,0.009332945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99156255,0.004610688,0.0003892355,0.0011103918,0.0017908369,0.0005364023],"domain_scores_gemma":[0.96531194,0.0263732,0.002711551,0.002536617,0.0021434082,0.0009232889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010351285,0.0016269687,0.001361789,0.0055481144,0.0022368769,0.006447739,0.0024150352,0.0040815347,0.013424624],"category_scores_gemma":[0.034144413,0.0011401805,0.0021686638,0.0031582802,0.007901903,0.012821588,0.0032762012,0.004101793,0.0010346959],"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.0000032291225,0.000005849695,0.00009958248,0.000022208775,0.000009212302,0.000019413872,0.000063470026,0.004325387,0.000053945012,0.9932423,0.00018678501,0.0019686988],"study_design_scores_gemma":[0.0000069474922,0.000009329137,0.000063256644,0.000027506523,0.000011818241,0.000024957018,0.00003436434,0.012423219,0.00011981996,0.98232424,0.004946398,0.00000811963],"about_ca_topic_score_codex":0.0033835066,"about_ca_topic_score_gemma":0.0019511693,"teacher_disagreement_score":0.013424624,"about_ca_system_score_codex":0.0038773168,"about_ca_system_score_gemma":0.0027085275,"threshold_uncertainty_score":0.05474347},"labels":[],"label_agreement":null},{"id":"W3128954025","doi":"10.1609/aaai.v35i9.16964","title":"Variance Penalized On-Policy and Off-Policy Actor-Critic","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","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":"Mila - Quebec Artificial Intelligence Institute; McGill University","funders":"","keywords":"Variance (accounting); Convergence (economics); Computer science; Reinforcement learning; Estimator; Moment (physics); Markov decision process; Expected return; Mathematical optimization; Minimum-variance unbiased estimator; Variance risk premium; Econometrics; Mathematics; Artificial intelligence; Markov process; Statistics; Economics","score_opus":0.06320478828266483,"score_gpt":0.3209269653549211,"score_spread":0.25772217707225625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128954025","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.017822072,0.00031753452,0.9762512,0.00026758396,0.000088723515,0.000064603955,0.00002805924,0.00067865074,0.004481612],"genre_scores_gemma":[0.7630672,0.00026860778,0.22678596,0.00030326465,0.00009311245,0.00019336081,0.00012977447,0.00034897643,0.0088097425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868923,0.00053932704,0.000056997218,0.00023680249,0.00034030588,0.00013732068],"domain_scores_gemma":[0.99647814,0.002016432,0.00042161412,0.00041314427,0.0004894939,0.0001812038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025409698,0.0013201771,0.0014454776,0.00061314163,0.00040923222,0.0012523565,0.0019972678,0.0016924394,0.00237633],"category_scores_gemma":[0.008129375,0.00062507467,0.00054489763,0.0004913334,0.00136537,0.0011068976,0.0014058623,0.0021095835,0.0005695066],"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.00011251285,0.00008143034,0.00049642334,0.000043492557,0.00004199445,0.000043114644,0.000037265887,0.9329308,0.0010647958,0.012173716,0.0012476629,0.0517268],"study_design_scores_gemma":[0.00000779591,0.00002194675,0.00004871882,0.000004365188,0.000003565268,0.000009727238,0.000002198583,0.9970605,0.00036664796,0.0021832709,0.00028760513,0.0000036794625],"about_ca_topic_score_codex":0.0029983004,"about_ca_topic_score_gemma":0.003178384,"teacher_disagreement_score":0.0029983004,"about_ca_system_score_codex":0.0012956836,"about_ca_system_score_gemma":0.0019661384,"threshold_uncertainty_score":0.013438106},"labels":[],"label_agreement":null},{"id":"W3131546278","doi":"10.1609/aaai.v35i13.17378","title":"How RL Agents Behave When Their Actions Are Modified","year":2021,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reinforcement learning; Action (physics); Supervisor; Markov decision process; Computer science; Process (computing); Q-learning; Reinforcement; Control (management); Risk analysis (engineering); Intervention (counseling); Artificial intelligence; Markov process; Psychology; Business; Social psychology; Mathematics; Political science; Law","score_opus":0.21135287046727055,"score_gpt":0.31668126810195774,"score_spread":0.10532839763468718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131546278","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.3597941,0.00053444266,0.61315346,0.0038699303,0.00017328406,0.00011328937,0.00016372178,0.0014413317,0.020756375],"genre_scores_gemma":[0.97106665,0.00019992219,0.025625268,0.00020314081,0.000017995622,0.00004727331,0.00005068659,0.00011503723,0.0026741105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881375,0.0005999251,0.00004860388,0.00019616712,0.00019908992,0.00014255207],"domain_scores_gemma":[0.9972362,0.0013430384,0.00041384532,0.00051399716,0.00031778408,0.00017518485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017577402,0.00036203896,0.00035679864,0.00025860092,0.000302238,0.0014443637,0.0007712796,0.0011768528,0.0014348645],"category_scores_gemma":[0.011139401,0.00032945754,0.00030330982,0.00015760734,0.00148596,0.002329903,0.0006589775,0.0010548403,0.0005703611],"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.00020054048,0.00009209545,0.009564803,0.000121170146,0.00014380009,0.00031894867,0.0006763741,0.8431384,0.0110527715,0.085722886,0.0024659906,0.046502277],"study_design_scores_gemma":[0.00003405642,0.00004473866,0.0013251912,0.000024529545,0.000021402559,0.00007143507,0.00012004104,0.9293588,0.002218972,0.06513131,0.0016214354,0.000028141183],"about_ca_topic_score_codex":0.004133081,"about_ca_topic_score_gemma":0.0024473208,"teacher_disagreement_score":0.004133081,"about_ca_system_score_codex":0.0008522718,"about_ca_system_score_gemma":0.00079485454,"threshold_uncertainty_score":0.00929594},"labels":[],"label_agreement":null},{"id":"W313246375","doi":"10.1609/aaai.v24i1.7496","title":"A Cross-Entropy Method that Optimizes Partially Decomposable Problems: A New Way to Interpret NMR Spectra","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Metabolomics and Mass Spectrometry Studies","field":"Biochemistry, Genetics and Molecular Biology","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":"University of Alberta","funders":"","keywords":"Computer science; Chemical shift; Task (project management); Entropy (arrow of time); Cluster (spacecraft); NMR spectra database; Set (abstract data type); Mathematical optimization; Spectral line; Algorithm; Mathematics; Chemistry; Physics; Engineering","score_opus":0.04420601080142196,"score_gpt":0.3271655349635237,"score_spread":0.28295952416210174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W313246375","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.0043083085,0.00013097207,0.994585,0.00012880853,0.000027622098,0.000024517656,0.000030497587,0.00027259227,0.00049175473],"genre_scores_gemma":[0.18207182,0.00024565178,0.81292635,0.0004868769,0.00014714788,0.00025682827,0.00042025602,0.00034058612,0.0031044544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988894,0.0005241915,0.00007150241,0.00019461667,0.00025535517,0.000065133674],"domain_scores_gemma":[0.997759,0.0014015919,0.00019062718,0.00018660918,0.00035206135,0.000110077264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036822455,0.0014499341,0.0014928543,0.0011845687,0.0005384396,0.0011482927,0.0014497656,0.0018631137,0.0019177163],"category_scores_gemma":[0.005437872,0.00064766704,0.0011836354,0.0008660285,0.0010751325,0.0017840721,0.0022193096,0.0020666872,0.000387837],"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.00013845431,0.00012290389,0.0011939327,0.00015284366,0.00022565616,0.0001422749,0.00011776817,0.8385092,0.0078052944,0.021200942,0.0030900436,0.1273007],"study_design_scores_gemma":[0.0000072634493,0.00001947786,0.00007839649,0.000004388953,0.000005832223,0.00001385764,0.000004105854,0.99544454,0.00073621975,0.003306017,0.00037410224,0.0000057644293],"about_ca_topic_score_codex":0.00267087,"about_ca_topic_score_gemma":0.002784511,"teacher_disagreement_score":0.0036822455,"about_ca_system_score_codex":0.00074425375,"about_ca_system_score_gemma":0.0014005684,"threshold_uncertainty_score":0.019473791},"labels":[],"label_agreement":null},{"id":"W3134121230","doi":"10.1609/aaai.v35i13.17339","title":"Inference-Based Deterministic Messaging For Multi-Agent Communication","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Opinion Dynamics and Social Influence","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Communication source; Computer science; Inference; Distributed computing; Multi-agent system; Artificial intelligence; Computer network","score_opus":0.13142570326487557,"score_gpt":0.37000482510437244,"score_spread":0.23857912183949687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134121230","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.019313779,0.00016360843,0.9777346,0.00048051117,0.0000445149,0.000044953977,0.000029742589,0.00030766762,0.0018805498],"genre_scores_gemma":[0.8807707,0.00020040078,0.11612584,0.00017253845,0.000089098525,0.0001647256,0.00007862311,0.00006686594,0.0023310746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982279,0.0007905609,0.00008116842,0.0003771163,0.0003986511,0.00012459986],"domain_scores_gemma":[0.9889831,0.008231203,0.001048836,0.0009986864,0.00050574844,0.000232453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002991742,0.0005682392,0.0010283857,0.0005254273,0.00092769996,0.00089021283,0.0022270363,0.0015616079,0.0016731413],"category_scores_gemma":[0.017846707,0.00052899873,0.00055530947,0.0005061682,0.0015085521,0.0021003296,0.0015998252,0.0023636646,0.0003414446],"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.000090821784,0.00005180439,0.00055758527,0.000066939625,0.000024116243,0.00006588378,0.00013683345,0.90928227,0.001765855,0.06530556,0.0008114404,0.021840889],"study_design_scores_gemma":[0.0000079916745,0.00001547493,0.0000586431,0.0000029156836,0.0000024125943,0.0000063592497,0.000005177474,0.98588413,0.0002509474,0.013560871,0.00020133256,0.0000038083647],"about_ca_topic_score_codex":0.0030360608,"about_ca_topic_score_gemma":0.003001909,"teacher_disagreement_score":0.0030360608,"about_ca_system_score_codex":0.0015739729,"about_ca_system_score_gemma":0.0014854883,"threshold_uncertainty_score":0.015821993},"labels":[],"label_agreement":null},{"id":"W3135151133","doi":"10.1609/aaai.v36i8.20817","title":"Consistency Regularization for Adversarial Robustness","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","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":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; Korea Advanced Institute of Science and Technology; National Research Foundation of Korea; National Research Foundation","keywords":"Overfitting; Robustness (evolution); Regularization (linguistics); Computer science; Adversarial system; Artificial intelligence; Early stopping; Machine learning; Deep neural networks; Regularization perspectives on support vector machines; Deep learning; Artificial neural network; Mathematics; Inverse problem","score_opus":0.05603997000771983,"score_gpt":0.2877849246909347,"score_spread":0.23174495468321488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135151133","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.0045012715,0.0003482067,0.99065876,0.00044065688,0.00008611169,0.000061040264,0.00008458534,0.0006831855,0.0031361387],"genre_scores_gemma":[0.58075875,0.0011139554,0.40292436,0.0016826409,0.0005134198,0.00072952185,0.0008724886,0.0014676822,0.009937112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9965875,0.0013579223,0.00016796935,0.0006052271,0.0010190951,0.00026229676],"domain_scores_gemma":[0.99176276,0.005104348,0.00065510726,0.0015489281,0.0006989573,0.00022989411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005240268,0.0019254558,0.0013758714,0.0009912212,0.000837607,0.0014880508,0.0022677341,0.002211723,0.0047057024],"category_scores_gemma":[0.02077631,0.0006505979,0.001436339,0.00074746046,0.003060271,0.0024600355,0.0042441534,0.0064907013,0.0013974108],"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.00019872231,0.00010739226,0.0017010812,0.00029817375,0.00017252818,0.00018186461,0.00013562648,0.7518003,0.011587883,0.14037389,0.010021536,0.083420984],"study_design_scores_gemma":[0.000015183784,0.000058926224,0.00025986653,0.000047676014,0.00001557254,0.00008947705,0.000012627008,0.9382761,0.003842465,0.053856086,0.0035021545,0.000023872166],"about_ca_topic_score_codex":0.0013429322,"about_ca_topic_score_gemma":0.0011593562,"teacher_disagreement_score":0.005240268,"about_ca_system_score_codex":0.0013937299,"about_ca_system_score_gemma":0.0013548422,"threshold_uncertainty_score":0.027713478},"labels":[],"label_agreement":null},{"id":"W3135588428","doi":"10.1609/aaai.v35i6.16690","title":"Necessarily Optimal One-Sided Matchings","year":2021,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Matching (statistics); Focus (optics); Preference; Rank (graph theory); Pareto optimal; Pareto principle; Prefix; Computer science; Mathematical economics; Mathematics; Optimal matching; Mathematical optimization; Combinatorics; Multi-objective optimization; Statistics","score_opus":0.14875177980413837,"score_gpt":0.2815930916186124,"score_spread":0.13284131181447403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135588428","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.25546756,0.0004815718,0.72084355,0.0020904057,0.00008467908,0.00030401492,0.001071293,0.00058226584,0.019074688],"genre_scores_gemma":[0.7490366,0.0003610614,0.23987365,0.000562212,0.00011851801,0.00029924992,0.0012729692,0.00016262675,0.008313096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99300474,0.0031112172,0.00042476354,0.0017710546,0.0009367618,0.0007515418],"domain_scores_gemma":[0.97541106,0.016793128,0.001979332,0.0033635746,0.0010684072,0.0013845739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058896835,0.0008393623,0.0025203798,0.0008248613,0.0015269491,0.0024001237,0.0027050779,0.0026757836,0.0081366915],"category_scores_gemma":[0.032926437,0.00077090744,0.0013314779,0.0020749094,0.0023701796,0.0069922484,0.002673025,0.0024301035,0.0013684774],"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.0011569018,0.00072908134,0.0041200146,0.00064135715,0.00021335791,0.00037083597,0.0007271076,0.22151148,0.003945953,0.63672715,0.01026041,0.11959641],"study_design_scores_gemma":[0.00012280753,0.00016444344,0.0004002452,0.000027949185,0.00002788268,0.00015779781,0.000103993465,0.34233302,0.0012893657,0.6534002,0.0019477645,0.000024489933],"about_ca_topic_score_codex":0.00107401,"about_ca_topic_score_gemma":0.001297264,"teacher_disagreement_score":0.0081366915,"about_ca_system_score_codex":0.0017977622,"about_ca_system_score_gemma":0.0018849631,"threshold_uncertainty_score":0.031148016},"labels":[],"label_agreement":null},{"id":"W3136757919","doi":"10.1609/aaai.v35i14.17469","title":"Policy-Guided Heuristic Search with Guarantees","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Compute Canada; Canadian Institute for Advanced Research","keywords":"Incremental heuristic search; Beam search; Heuristic; Best-first search; Computer science; Mathematical optimization; Function (biology); Bidirectional search; Search algorithm; Quality (philosophy); Search cost; Null-move heuristic; Algorithm; Artificial intelligence; Mathematics; Economics","score_opus":0.09946954893367661,"score_gpt":0.3333868331638339,"score_spread":0.23391728423015729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136757919","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.031972196,0.00045357266,0.95570546,0.00070647843,0.00007399683,0.0001127136,0.000091891314,0.0013188147,0.009564936],"genre_scores_gemma":[0.6772691,0.0005350187,0.31624523,0.00044475112,0.00008081519,0.00035907706,0.00028641146,0.00033338668,0.0044462304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977284,0.00083802,0.0001340901,0.00032476106,0.0006678125,0.00030695254],"domain_scores_gemma":[0.98901063,0.007901855,0.00073369103,0.0013109653,0.0007146278,0.00032830253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029557534,0.0012980736,0.0014133144,0.00083302945,0.0006578884,0.0015878562,0.0015898538,0.0020369473,0.0037748304],"category_scores_gemma":[0.018609706,0.0006742297,0.00079697144,0.0009266011,0.001961401,0.0024789139,0.0022208854,0.0028294714,0.0008684451],"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.00019271925,0.00009877487,0.0007272753,0.00012896894,0.000040782503,0.0000603877,0.0000861032,0.88004154,0.0015387882,0.06883226,0.0023552487,0.04589716],"study_design_scores_gemma":[0.000039396564,0.000044677636,0.00005535566,0.000016332076,0.0000064383025,0.00001934583,0.000012370981,0.973224,0.0005146245,0.025253208,0.000808684,0.0000056034382],"about_ca_topic_score_codex":0.0032696102,"about_ca_topic_score_gemma":0.0031064793,"teacher_disagreement_score":0.0037748304,"about_ca_system_score_codex":0.0018198184,"about_ca_system_score_gemma":0.0045040143,"threshold_uncertainty_score":0.015631676},"labels":[],"label_agreement":null},{"id":"W3137721922","doi":"10.1609/aaai.v35i17.17829","title":"Deep Discourse Analysis for Generating Personalized Feedback in Intelligent Tutor Systems","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":16,"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; TUTOR; Artificial intelligence; Classifier (UML); Graph; Intelligent tutoring system; Process (computing); Personalized learning; Natural language processing; Human–computer interaction; Teaching method; Mathematics education; Cooperative learning; Theoretical computer science; Psychology","score_opus":0.10135030651859706,"score_gpt":0.323220521530623,"score_spread":0.22187021501202592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137721922","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.089329265,0.00069032685,0.90168923,0.0006923892,0.000051690542,0.00013791613,0.00030383925,0.005125215,0.0019800626],"genre_scores_gemma":[0.6902216,0.0002468706,0.305762,0.00015295952,0.000052480995,0.00018003212,0.0006423116,0.00025087176,0.0024908641],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979838,0.0010776477,0.00011620305,0.0003762316,0.00032366384,0.00012230605],"domain_scores_gemma":[0.99502003,0.0035275137,0.00033309145,0.00025719684,0.00074270077,0.00011947482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024880914,0.0009839807,0.00069765234,0.0020021114,0.0006732739,0.0012610796,0.0012879702,0.0013474912,0.0020487334],"category_scores_gemma":[0.010019339,0.0004306084,0.0005276275,0.0009417807,0.00069892575,0.0024572648,0.0014001161,0.0012484674,0.0006245289],"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.00046739413,0.00038978274,0.0037015183,0.00051051803,0.00009674325,0.00030573164,0.0026741961,0.25914684,0.03619902,0.012857224,0.0050220215,0.678629],"study_design_scores_gemma":[0.000016644146,0.000049379636,0.0003746889,0.00001516207,0.000015871265,0.000016101272,0.00014356109,0.97726405,0.009415928,0.011367942,0.0013103046,0.000010355461],"about_ca_topic_score_codex":0.004821803,"about_ca_topic_score_gemma":0.0064787786,"teacher_disagreement_score":0.004821803,"about_ca_system_score_codex":0.0016542107,"about_ca_system_score_gemma":0.0011224417,"threshold_uncertainty_score":0.013158441},"labels":[],"label_agreement":null},{"id":"W3162696321","doi":"10.1609/aaai.v36i2.20012","title":"SCTN: Sparse Convolution-Transformer Network for Scene Flow Estimation","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"King Abdullah University of Science and Technology","keywords":"Point cloud; Computer science; Convolution (computer science); Transformer; Artificial intelligence; Optical flow; Algorithm; Computer vision; Pattern recognition (psychology); Artificial neural network; Image (mathematics)","score_opus":0.06960887381939476,"score_gpt":0.3081054479267099,"score_spread":0.23849657410731515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3162696321","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.009497067,0.00010476874,0.9874889,0.000073414376,0.000035563055,0.000036083842,0.00013613705,0.0018092431,0.00081883295],"genre_scores_gemma":[0.4328202,0.0003592457,0.5587171,0.0003030537,0.00009507495,0.0001929156,0.0021160727,0.00036644438,0.005029885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996846,0.000043125863,0.000014796607,0.00009496122,0.00010423822,0.000058320526],"domain_scores_gemma":[0.9996445,0.000108287175,0.000044605502,0.000067873036,0.000101425605,0.000033361364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060248707,0.0012009684,0.0008722084,0.001089705,0.00041724477,0.0006405193,0.001965955,0.0009353373,0.0025817808],"category_scores_gemma":[0.0019128906,0.0005549502,0.0008571106,0.001121091,0.0005799582,0.0017866708,0.0013019193,0.001388278,0.0007681235],"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.00024647772,0.00014777518,0.001793804,0.000094332085,0.000093780975,0.000119104516,0.00008918474,0.49217102,0.018634386,0.011202491,0.006967572,0.4684401],"study_design_scores_gemma":[0.0000037896993,0.000011728946,0.0000827563,0.0000019765791,0.0000037816844,0.000013588388,0.000003005528,0.9964407,0.001445108,0.0015887845,0.00040145507,0.000003352912],"about_ca_topic_score_codex":0.016764097,"about_ca_topic_score_gemma":0.016389644,"teacher_disagreement_score":0.016764097,"about_ca_system_score_codex":0.0010235665,"about_ca_system_score_gemma":0.0013939138,"threshold_uncertainty_score":0.033333063},"labels":[],"label_agreement":null},{"id":"W3169728738","doi":"10.1609/aaai.v36i7.20701","title":"Fast and Robust Online Inference with Stochastic Gradient Descent via Random Scaling","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Economic and Social Research Council; National Research Foundation of Korea; Seoul National University; National Research Foundation; Compute Canada; Ministry of Education; McMaster University","keywords":"Stochastic gradient descent; Resampling; Inference; Computer science; Leverage (statistics); Gradient descent; Mathematics; Algorithm; Artificial intelligence; Artificial neural network","score_opus":0.05517963036051056,"score_gpt":0.2658407778660295,"score_spread":0.21066114750551895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169728738","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.00090232684,0.000052271895,0.9984792,0.00005964209,0.00002384154,0.000016520318,0.000014778864,0.00024315587,0.0002082742],"genre_scores_gemma":[0.113946,0.00023956448,0.88288933,0.0002382228,0.0002211556,0.0003443421,0.00026958677,0.00039764732,0.0014542493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99639386,0.0017099986,0.00017599213,0.0006185053,0.0009429285,0.00015868784],"domain_scores_gemma":[0.9894918,0.007020532,0.0008227081,0.0012158293,0.001225981,0.00022317898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055194204,0.0016724182,0.0022776339,0.0014232532,0.0007283113,0.0016500353,0.0027908285,0.0016240808,0.0023084371],"category_scores_gemma":[0.02872387,0.0011086836,0.0011783369,0.001376269,0.0018835848,0.0025701516,0.0026513694,0.0034775832,0.0011433542],"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.000103127015,0.00014882161,0.0014187262,0.00018198756,0.00020006095,0.00015262303,0.000105673025,0.7113774,0.0038763671,0.1227767,0.0044229855,0.1552356],"study_design_scores_gemma":[0.000011377983,0.00001721255,0.000070542985,0.000005771065,0.0000046077334,0.00001428941,0.0000023833995,0.9825256,0.00038023852,0.016405411,0.00055398344,0.000008684621],"about_ca_topic_score_codex":0.004439688,"about_ca_topic_score_gemma":0.0045696306,"teacher_disagreement_score":0.0055194204,"about_ca_system_score_codex":0.001035512,"about_ca_system_score_gemma":0.0031558299,"threshold_uncertainty_score":0.029189825},"labels":[],"label_agreement":null},{"id":"W3170371439","doi":"10.1609/aaai.v36i7.20758","title":"Control-Oriented Model-Based Reinforcement Learning with Implicit Differentiation","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Vector Institute; University of Toronto; Université de Montréal","funders":"Compute Canada","keywords":"Reinforcement learning; Bellman equation; Computer science; Context (archaeology); Function (biology); Task (project management); Class (philosophy); Value (mathematics); Likelihood function; Maximum likelihood; Reinforcement; Control (management); Artificial intelligence; Mathematical optimization; Machine learning; Estimation theory; Mathematics; Statistics; Economics; Algorithm","score_opus":0.03202434377017425,"score_gpt":0.25509131036248905,"score_spread":0.2230669665923148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170371439","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.0151896775,0.0001006874,0.9822948,0.00019348349,0.000020848938,0.000037869748,0.0000150797,0.00026979749,0.0018777142],"genre_scores_gemma":[0.9021251,0.00008327632,0.09509165,0.00015683706,0.000023270655,0.00013693499,0.000039761333,0.00006596928,0.0022773123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990988,0.00036201434,0.000048332837,0.00015452514,0.00022948967,0.000106842264],"domain_scores_gemma":[0.9969928,0.001892639,0.00035507107,0.00027506857,0.00033336857,0.00015099907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024287964,0.0011221322,0.0012609,0.00037228988,0.00037673357,0.0013077429,0.0017829619,0.0014450819,0.0022045423],"category_scores_gemma":[0.0070998026,0.0005770535,0.00050743966,0.00037468967,0.0017437439,0.0016546493,0.002072338,0.002477608,0.00039897245],"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.000056346486,0.00005302559,0.00027345066,0.00004463925,0.000021376478,0.000048313235,0.00005910481,0.9586526,0.0009495644,0.0245665,0.00027739818,0.014997627],"study_design_scores_gemma":[0.000007685009,0.000016560594,0.000012899334,0.0000028810457,0.0000021258802,0.0000043682458,0.000001128098,0.994749,0.00016472899,0.0049646664,0.00007170239,0.0000022219238],"about_ca_topic_score_codex":0.0027318802,"about_ca_topic_score_gemma":0.0024414803,"teacher_disagreement_score":0.0027318802,"about_ca_system_score_codex":0.0012207906,"about_ca_system_score_gemma":0.0015601076,"threshold_uncertainty_score":0.012844861},"labels":[],"label_agreement":null},{"id":"W3173628900","doi":"10.1609/aaai.v35i15.17632","title":"Progressive Multi-task Learning with Controlled Information Flow for Joint Entity and Relation Extraction","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":55,"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 Ottawa","funders":"Beijing Advanced Innovation Center for Big Data and Brain Computing; Fundamental Research Funds for the Central Universities; State Key Laboratory of Software Development Environment; National Natural Science Foundation of China","keywords":"Multi-task learning; Computer science; Benchmark (surveying); Artificial intelligence; Task (project management); Machine learning; Joint (building); Relation (database); Representation (politics); Relationship extraction; Exploit; Feature learning; Information extraction; Data mining","score_opus":0.06065020142216308,"score_gpt":0.2900157999577008,"score_spread":0.22936559853553773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173628900","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.030626453,0.00039980205,0.9661419,0.00029398137,0.000042162264,0.00010328066,0.000105239575,0.0011855752,0.0011015921],"genre_scores_gemma":[0.77046883,0.00031217345,0.22374976,0.0003808668,0.00008846661,0.00039401354,0.0005649702,0.00014239176,0.0038985696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991893,0.00025857618,0.000046260786,0.00026752084,0.00013983129,0.0000985018],"domain_scores_gemma":[0.9979929,0.0010154379,0.00018886897,0.00046353182,0.0002212054,0.00011811175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025063262,0.0012891269,0.0011185516,0.00062013295,0.00051473087,0.00089478696,0.0026726958,0.0014204849,0.0019651065],"category_scores_gemma":[0.005921136,0.00061226304,0.0012039584,0.0010658021,0.0010308233,0.0034206407,0.0025998,0.0031426551,0.00069459964],"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.00048878626,0.00066512666,0.0019442678,0.00023035756,0.00016212347,0.00026466526,0.0003203789,0.65104735,0.012359104,0.019012725,0.004114731,0.30939034],"study_design_scores_gemma":[0.000013106546,0.000042032847,0.000095790514,0.0000034281336,0.0000092362,0.00001374174,0.000005975875,0.9882541,0.001156661,0.010118827,0.00028158908,0.0000055704995],"about_ca_topic_score_codex":0.0039484305,"about_ca_topic_score_gemma":0.004711137,"teacher_disagreement_score":0.0039484305,"about_ca_system_score_codex":0.0010844376,"about_ca_system_score_gemma":0.0014195578,"threshold_uncertainty_score":0.013254881},"labels":[],"label_agreement":null},{"id":"W3173964589","doi":"10.1609/aaai.v35i14.17550","title":"Dynamic Hybrid Relation Exploration Network for Cross-Domain Context-Dependent Semantic Parsing","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Parsing; Artificial intelligence; Natural language processing; Context (archaeology); Representation (politics); Graph; Focus (optics); Relation (database); Dependency grammar; Domain (mathematical analysis); Natural language understanding; Conversation; Natural language; Theoretical computer science; Data mining","score_opus":0.09084251400592146,"score_gpt":0.3157267080256453,"score_spread":0.22488419401972382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173964589","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.04584973,0.0019712118,0.9379827,0.000991918,0.0000954507,0.00015698411,0.0016859486,0.0063218824,0.004944169],"genre_scores_gemma":[0.62537247,0.0010582658,0.35498697,0.0007318965,0.00011533708,0.0003821751,0.0066586537,0.000656054,0.010038253],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879116,0.00034355762,0.000054169515,0.0005248034,0.00018862769,0.0000977649],"domain_scores_gemma":[0.9984302,0.00092650845,0.00009536011,0.0002662757,0.00021040929,0.000071263916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017850277,0.00096224324,0.0009573983,0.0026085677,0.0009124237,0.0012062944,0.0023583097,0.0016068339,0.0035939834],"category_scores_gemma":[0.004950858,0.00060049404,0.0012755078,0.0028420882,0.0009266002,0.004509495,0.0023009344,0.001864848,0.0011842765],"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.0006688091,0.00041020542,0.00677051,0.0003612232,0.00024709446,0.00072423136,0.0011662863,0.38028434,0.00908223,0.072718486,0.022553502,0.50501317],"study_design_scores_gemma":[0.00001425756,0.000025446001,0.00043727166,0.000019725312,0.00004015802,0.0000873503,0.000069436675,0.9567845,0.0015499152,0.03633885,0.0046140915,0.000018965886],"about_ca_topic_score_codex":0.01754799,"about_ca_topic_score_gemma":0.028987622,"teacher_disagreement_score":0.01754799,"about_ca_system_score_codex":0.0014847734,"about_ca_system_score_gemma":0.002078714,"threshold_uncertainty_score":0.034891725},"labels":[],"label_agreement":null},{"id":"W3173999950","doi":"10.1609/aaai.v35i16.17654","title":"On Scalar Embedding of Relative Positions in Attention Models","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","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 Ottawa","funders":"Beijing Advanced Innovation Center for Big Data and Brain Computing; Fundamental Research Funds for the Central Universities; State Key Laboratory of Software Development Environment; National Natural Science Foundation of China","keywords":"Embedding; Computer science; Probabilistic logic; Encoding (memory); Scalar (mathematics); Artificial intelligence; Transformer; Heuristic; Pattern recognition (psychology); Algorithm; Mathematics","score_opus":0.08892781869382743,"score_gpt":0.3121096265494795,"score_spread":0.22318180785565206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173999950","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.020289376,0.00032433184,0.97675735,0.00036206772,0.000035311758,0.00002354072,0.00013359933,0.0005269207,0.001547604],"genre_scores_gemma":[0.79161775,0.0008855307,0.20165078,0.00030256668,0.00015324862,0.000117301846,0.00046123503,0.00021171778,0.0045997854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991026,0.00038810552,0.00005619324,0.00023249329,0.00013981329,0.0000808476],"domain_scores_gemma":[0.9977075,0.0012694622,0.00020891921,0.00047487003,0.00023280164,0.00010638288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015980698,0.00072969834,0.0006426689,0.0007803533,0.00034159695,0.0010846251,0.001391857,0.0008912083,0.0035067615],"category_scores_gemma":[0.009150921,0.00049953314,0.00065336487,0.0011523498,0.0013054643,0.0051715616,0.0025793642,0.0020211893,0.0005621055],"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.00031411205,0.00007714035,0.001603415,0.00017216303,0.000054180167,0.00012273407,0.00046630317,0.35272375,0.0055415262,0.37996024,0.0031910806,0.2557734],"study_design_scores_gemma":[0.0000132700825,0.000048052418,0.00023202054,0.000013321996,0.000010538093,0.000035275392,0.000022471726,0.83455116,0.001036238,0.16292243,0.0011019793,0.0000132257355],"about_ca_topic_score_codex":0.0034404788,"about_ca_topic_score_gemma":0.0030932762,"teacher_disagreement_score":0.0035067615,"about_ca_system_score_codex":0.0012567904,"about_ca_system_score_gemma":0.0007593474,"threshold_uncertainty_score":0.011731267},"labels":[],"label_agreement":null},{"id":"W3174139848","doi":"10.1609/aaai.v35i9.16967","title":"IB-GAN: Disentangled Representation Learning with Information Bottleneck Generative Adversarial Networks","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Generative Adversarial Networks and Image Synthesis","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":"Kootenay Association for Science & Technology","funders":"Defense Acquisition Program Administration; Agency for Defense Development","keywords":"Representation (politics); Bottleneck; Generator (circuit theory); Computer science; Information bottleneck method; Layer (electronics); Generative grammar; Artificial intelligence; Quality (philosophy); Space (punctuation); Mutual information; Power (physics); Materials science","score_opus":0.032913505239313176,"score_gpt":0.2531786174233732,"score_spread":0.22026511218406003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174139848","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.0075611486,0.00039415967,0.987727,0.00021947223,0.00004699832,0.000040069655,0.00021948185,0.001210418,0.0025812571],"genre_scores_gemma":[0.6124198,0.000762835,0.36959136,0.0010501128,0.00015101333,0.0003988427,0.002692557,0.00076547975,0.012167953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951243,0.0001870607,0.000014341984,0.00012458244,0.00010622061,0.00005545992],"domain_scores_gemma":[0.99942565,0.00031189198,0.00004588642,0.00011294773,0.000069418114,0.000034256187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00108431,0.001463496,0.0010362318,0.00049180037,0.00022612629,0.00083840673,0.0019580678,0.0009209162,0.0025087963],"category_scores_gemma":[0.002084329,0.0005159761,0.00094368716,0.000482939,0.0008657867,0.0013438642,0.0014605096,0.0025437132,0.0009311239],"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.00012961039,0.00007667907,0.00086461776,0.00008158965,0.00010494248,0.00011234102,0.000063646214,0.8541371,0.0056805564,0.030341018,0.0077920393,0.100615814],"study_design_scores_gemma":[0.0000073237165,0.000015937901,0.000045448127,0.0000059569334,0.000005128273,0.000020403386,0.0000024442031,0.99060094,0.0007703811,0.0077076512,0.00081410306,0.000004221779],"about_ca_topic_score_codex":0.0020748551,"about_ca_topic_score_gemma":0.004006996,"teacher_disagreement_score":0.0025087963,"about_ca_system_score_codex":0.0007004241,"about_ca_system_score_gemma":0.0007138933,"threshold_uncertainty_score":0.008392751},"labels":[],"label_agreement":null},{"id":"W3174204509","doi":"10.1609/aaai.v35i18.17873","title":"Logic Guided Genetic Algorithms (Student Abstract)","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","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":"Perimeter Institute; University of Waterloo; University of Toronto","funders":"","keywords":"Conjunction (astronomy); Computer science; A priori and a posteriori; Set (abstract data type); Algorithm; Genetic algorithm; Function (biology); Fraction (chemistry); Symbolic regression; Data set; State (computer science); Artificial intelligence; Machine learning; Genetic programming; Programming language","score_opus":0.14011594457512389,"score_gpt":0.3638528095070106,"score_spread":0.22373686493188671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174204509","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.015288117,0.00017759572,0.97781926,0.00030318458,0.000069508504,0.000061146486,0.00012270753,0.000915189,0.0052433056],"genre_scores_gemma":[0.2844932,0.00018285374,0.7085978,0.00055622205,0.00007365313,0.000321965,0.0005276082,0.00025156347,0.0049950876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992823,0.00030968527,0.000030072699,0.00016681032,0.00014579957,0.000065437845],"domain_scores_gemma":[0.9985191,0.0010103553,0.00009511157,0.00015261561,0.00018770034,0.000035042416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001106301,0.00075446354,0.00070926914,0.0008199579,0.00032254134,0.000991683,0.0013413394,0.0012739422,0.0051022144],"category_scores_gemma":[0.004242169,0.0003258335,0.00073169754,0.0007906883,0.0010653787,0.00076344726,0.001054896,0.0011726359,0.00097235496],"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.00010040186,0.00010524463,0.0011760526,0.00012378681,0.00007757189,0.00008910836,0.00011325124,0.7794283,0.002279293,0.049206447,0.004054069,0.1632464],"study_design_scores_gemma":[0.000029624724,0.00003242482,0.00008562598,0.000014166193,0.000008997524,0.000017315613,0.000008876787,0.98019046,0.00065229525,0.01733856,0.0016162493,0.0000053892268],"about_ca_topic_score_codex":0.0031695806,"about_ca_topic_score_gemma":0.0031834187,"teacher_disagreement_score":0.0051022144,"about_ca_system_score_codex":0.0008479519,"about_ca_system_score_gemma":0.0010861135,"threshold_uncertainty_score":0.017068624},"labels":[],"label_agreement":null},{"id":"W3174209100","doi":"10.1609/aaai.v35i5.16485","title":"Necessary and Sufficient Conditions for Avoiding Reopenings in Best First Suboptimal Search with General Bounding Functions","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Bounded function; Bounding overwatch; Constant (computer programming); Computer science; Heuristic; Differentiable function; Piecewise; Mathematical optimization; Piecewise linear function; Incremental heuristic search; Function (biology); Mathematics; Search algorithm; Beam search; Artificial intelligence","score_opus":0.09174042424760195,"score_gpt":0.3268076675045277,"score_spread":0.23506724325692577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174209100","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.043338086,0.0007588634,0.9468781,0.00043856006,0.00007864596,0.00022321526,0.00010191061,0.00068665436,0.0074959593],"genre_scores_gemma":[0.7281723,0.00064136897,0.26751024,0.00040208176,0.00008465089,0.00038704128,0.00028299994,0.00037800195,0.0021413798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943158,0.0021281699,0.0004027005,0.00071792275,0.0013156867,0.0011197632],"domain_scores_gemma":[0.9599716,0.029786207,0.003216871,0.002633944,0.00285398,0.0015374754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009819887,0.0014034136,0.0020021142,0.0017840442,0.0010706012,0.0027435082,0.0022784804,0.0019691563,0.0045859595],"category_scores_gemma":[0.06106146,0.0010813773,0.0011252005,0.001142314,0.002863502,0.005619586,0.00301075,0.0035533987,0.0006679657],"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.00048490535,0.00028487144,0.0034453757,0.00060396903,0.00009969572,0.00043937712,0.00046896734,0.6581234,0.0065540466,0.22450715,0.0052977623,0.09969048],"study_design_scores_gemma":[0.00006715258,0.00022511033,0.0005884598,0.00009117616,0.000028905439,0.00017815336,0.000112494374,0.93310237,0.0027615586,0.061021827,0.0017892614,0.000033551143],"about_ca_topic_score_codex":0.0029037404,"about_ca_topic_score_gemma":0.0019490515,"teacher_disagreement_score":0.009819887,"about_ca_system_score_codex":0.0017245552,"about_ca_system_score_gemma":0.004373537,"threshold_uncertainty_score":0.05193311},"labels":[],"label_agreement":null},{"id":"W3174302393","doi":"10.1609/aaai.v35i10.17105","title":"Precision-based Boosting","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"AdaBoost; Boosting (machine learning); Classifier (UML); Computer science; Artificial intelligence; Mistake; Pattern recognition (psychology); Word error rate; Machine learning; Class (philosophy)","score_opus":0.07738616526443978,"score_gpt":0.3108552515835713,"score_spread":0.23346908631913152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174302393","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.0070880665,0.004112831,0.9763499,0.00025518922,0.00053607393,0.00015431036,0.00023380973,0.0026861476,0.008583606],"genre_scores_gemma":[0.32298362,0.0047076438,0.6464412,0.0009221067,0.0017876859,0.00038753042,0.0017449298,0.0008602413,0.020165032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99557805,0.0009438283,0.00019326007,0.0008660101,0.0021060621,0.00031286213],"domain_scores_gemma":[0.9962819,0.0010976332,0.00023896412,0.00067373266,0.001594405,0.000113358496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046792477,0.0017252933,0.0027130637,0.0024411979,0.001006869,0.0020698544,0.0025059865,0.0016090048,0.005171385],"category_scores_gemma":[0.009952225,0.00073765276,0.0016614802,0.0027713834,0.0007545358,0.0018871021,0.001566301,0.0023357482,0.004893981],"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.0002586863,0.00016988798,0.0024918497,0.00036457521,0.0003797586,0.00007086477,0.00006829429,0.100535765,0.005160771,0.015069446,0.024449069,0.850981],"study_design_scores_gemma":[0.00012858909,0.00052336836,0.003593607,0.00018202841,0.00034624024,0.0006609113,0.000034359047,0.87046754,0.013489118,0.036212344,0.07425791,0.00010404885],"about_ca_topic_score_codex":0.002421439,"about_ca_topic_score_gemma":0.0021696887,"teacher_disagreement_score":0.005171385,"about_ca_system_score_codex":0.0007602188,"about_ca_system_score_gemma":0.0012691456,"threshold_uncertainty_score":0.024746537},"labels":[],"label_agreement":null},{"id":"W3174355057","doi":"10.1609/aaai.v35i11.17163","title":"DIBS: Diversity Inducing Information Bottleneck in Model Ensembles","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","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":"Université de Montréal; Vector Institute; University of Toronto","funders":"","keywords":"MNIST database; Computer science; Generalization; Machine learning; Artificial intelligence; Benchmark (surveying); Information bottleneck method; Bayesian probability; Bottleneck; Artificial neural network; Data mining; Mutual information; Mathematics; Geography","score_opus":0.07016165741512634,"score_gpt":0.2809434166131086,"score_spread":0.21078175919798228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174355057","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.02910574,0.00075263437,0.9653918,0.00052757957,0.00009353756,0.00008114448,0.00018142918,0.002274457,0.0015917354],"genre_scores_gemma":[0.7382812,0.00063723215,0.25271118,0.0010980258,0.00026924053,0.00043852496,0.0014698247,0.00082935323,0.0042654434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772125,0.0008835623,0.00011837095,0.0004424275,0.00061224523,0.0002220931],"domain_scores_gemma":[0.9939354,0.0033782583,0.00044876136,0.0012130963,0.00063978316,0.0003847288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005081934,0.0020391392,0.0025142233,0.00097465457,0.00095608295,0.0016141697,0.003206262,0.0019656331,0.0024057557],"category_scores_gemma":[0.014512838,0.0010742132,0.0014752608,0.00095779024,0.001416423,0.0035692998,0.00510316,0.0047805645,0.0009273253],"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.000255062,0.00014780762,0.0016131242,0.0001244685,0.00017056105,0.00015857548,0.00013448556,0.86168337,0.003496365,0.017751874,0.0055272933,0.108936995],"study_design_scores_gemma":[0.000009197842,0.000028655824,0.00006466373,0.000009477721,0.000008708682,0.00002205299,0.000006111578,0.99014574,0.0010492953,0.008291015,0.00035920116,0.000005894837],"about_ca_topic_score_codex":0.0041053337,"about_ca_topic_score_gemma":0.0046106465,"teacher_disagreement_score":0.005081934,"about_ca_system_score_codex":0.0016373292,"about_ca_system_score_gemma":0.0020544415,"threshold_uncertainty_score":0.026876152},"labels":[],"label_agreement":null},{"id":"W3174364973","doi":"10.1609/aaai.v35i7.16745","title":"Improving the Performance-Compatibility Tradeoff with Personalized Objective Functions","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Israel Science Foundation; Canadian Institute for Advanced Research","keywords":"Compatibility (geochemistry); Computer science; Machine learning; Artificial intelligence; Engineering","score_opus":0.05643723675586477,"score_gpt":0.26463388635323043,"score_spread":0.20819664959736567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174364973","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.2928345,0.00063631416,0.6997732,0.000948952,0.000058221736,0.00017397586,0.0000823025,0.0019588664,0.0035336884],"genre_scores_gemma":[0.88682806,0.00013539285,0.11103448,0.00022451225,0.000056974885,0.00011999558,0.000103731916,0.0001963345,0.0013004161],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942774,0.00294048,0.00028063726,0.0009797533,0.0011312733,0.0003905142],"domain_scores_gemma":[0.9815947,0.0111824265,0.0010355229,0.0047124554,0.0010089279,0.00046611775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009417833,0.0017740019,0.0013021879,0.0008121224,0.0006846547,0.00169405,0.002220915,0.0025562197,0.0013083982],"category_scores_gemma":[0.027621236,0.0008755636,0.0008881565,0.0007457458,0.0010456234,0.005481458,0.0023723294,0.0033875238,0.00056769274],"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.00048880046,0.0009853336,0.009710599,0.000095542295,0.00026082486,0.00014859354,0.0003476199,0.8209553,0.009320169,0.0055370415,0.0015462354,0.15060386],"study_design_scores_gemma":[0.00003933399,0.00025722032,0.002094998,0.000009184868,0.000045487803,0.000072835166,0.000043375843,0.98572034,0.0037074802,0.007426595,0.00054970774,0.00003348889],"about_ca_topic_score_codex":0.002179154,"about_ca_topic_score_gemma":0.0024590117,"teacher_disagreement_score":0.009417833,"about_ca_system_score_codex":0.0011549453,"about_ca_system_score_gemma":0.0012007442,"threshold_uncertainty_score":0.049806833},"labels":[],"label_agreement":null},{"id":"W3174397558","doi":"10.1609/aaai.v35i3.16282","title":"Patch-Wise Attention Network for Monocular Depth Estimation","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"SK Hynix","keywords":"Artificial intelligence; Computer science; Monocular; Merge (version control); Computer vision; Convolutional neural network; Benchmark (surveying); Depth map; Feature (linguistics); Pattern recognition (psychology); Image (mathematics); Geography","score_opus":0.07354100882156708,"score_gpt":0.3248202371189472,"score_spread":0.25127922829738014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174397558","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.06354776,0.004564425,0.91797704,0.0005129136,0.0002964218,0.00010599093,0.000740184,0.0070627606,0.0051924936],"genre_scores_gemma":[0.7803073,0.0016609642,0.20353317,0.0008517772,0.00031142635,0.00013359153,0.0018516387,0.000321609,0.011028474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971503,0.00002735642,0.000009496697,0.000108972876,0.000069097354,0.000069995775],"domain_scores_gemma":[0.99978334,0.000070879694,0.00002474278,0.000029180352,0.000073364296,0.000018454715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030945803,0.0012215129,0.0010223965,0.0008846742,0.00032693907,0.0004931086,0.0017519915,0.0010115048,0.0027284303],"category_scores_gemma":[0.0009932294,0.0004007438,0.00061507925,0.0009677126,0.00030970626,0.0011104351,0.0009666401,0.0010111203,0.0006298261],"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.00032235534,0.00017349503,0.0014710159,0.00014521401,0.00016902054,0.00018803995,0.00007968151,0.20227039,0.026840864,0.0032078759,0.015257998,0.74987406],"study_design_scores_gemma":[0.00001099726,0.00004047007,0.0006635177,0.0000073220526,0.000027382297,0.00005560651,0.000009443055,0.991561,0.004348244,0.002152651,0.0011147923,0.000008631724],"about_ca_topic_score_codex":0.027828805,"about_ca_topic_score_gemma":0.028239168,"teacher_disagreement_score":0.027828805,"about_ca_system_score_codex":0.0012055914,"about_ca_system_score_gemma":0.0009618702,"threshold_uncertainty_score":0.055333674},"labels":[],"label_agreement":null},{"id":"W3174526153","doi":"10.1609/aaai.v35i1.16138","title":"A Hierarchical Approach to Multi-Event Survival Analysis","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning in Healthcare","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institutes of Health; Genentech; IXICO; H. Lundbeck A/S; Servier; Eisai; Northern California Institute for Research and Education; Pfizer; Biogen; BioClinica; F. Hoffmann-La Roche; University of Southern California; Novartis Pharmaceuticals Corporation; U.S. Department of Defense; Eli Lilly and Company; Bristol-Myers Squibb; Foundation for the National Institutes of Health; Alzheimer's Disease Neuroimaging Initiative; Meso Scale Diagnostics; National Institute on Aging; Alzheimer's Association; National Institute of Biomedical Imaging and Bioengineering; Canadian Institutes of Health Research; National Science Foundation","keywords":"Event (particle physics); Consistency (knowledge bases); Covariate; Survival analysis; Statistics; Computer science; Econometrics; Mathematics; Artificial intelligence","score_opus":0.11747464675601126,"score_gpt":0.35322557142946936,"score_spread":0.2357509246734581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174526153","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.008097435,0.0009495225,0.98542506,0.0005153364,0.00012508173,0.00015721504,0.0019198369,0.0019194112,0.00089101266],"genre_scores_gemma":[0.36229226,0.0009992442,0.6194428,0.0007728504,0.00063282234,0.0007416715,0.009430752,0.0005857826,0.005101723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943144,0.0024174005,0.00040716366,0.0015817991,0.00091190555,0.00036736001],"domain_scores_gemma":[0.98687243,0.008231923,0.001149831,0.0017980646,0.0014717183,0.00047601867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010038295,0.0012680275,0.0018217127,0.0039692204,0.0011164099,0.0018379225,0.0035675839,0.001750061,0.005141006],"category_scores_gemma":[0.02196644,0.00069227413,0.003802021,0.0035917233,0.0008846957,0.001939759,0.0025541782,0.003457537,0.0019551336],"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.0005400514,0.00037037555,0.050963968,0.00078147114,0.0017963604,0.0008193614,0.0011855307,0.3992244,0.003028853,0.05697205,0.027849108,0.4564685],"study_design_scores_gemma":[0.000039324645,0.00008806619,0.006136761,0.00007214763,0.00018360978,0.00018667647,0.00009156115,0.9096603,0.00056907843,0.07544313,0.0074608265,0.00006855103],"about_ca_topic_score_codex":0.023062315,"about_ca_topic_score_gemma":0.03319656,"teacher_disagreement_score":0.023062315,"about_ca_system_score_codex":0.0017729687,"about_ca_system_score_gemma":0.0028343147,"threshold_uncertainty_score":0.053088248},"labels":[],"label_agreement":null},{"id":"W3174585579","doi":"10.1609/aaai.v36i4.20284","title":"The Perils of Learning Before Optimizing","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Machine Intelligence Institute; Compute Canada; Defense Advanced Research Projects Agency; Canadian Institute for Advanced Research; Nvidia","keywords":"A priori and a posteriori; Computer science; Range (aeronautics); Function (biology); Task (project management); Mathematical optimization; Optimization problem; Machine learning; Artificial intelligence; Algorithm; Mathematics","score_opus":0.05691481360200981,"score_gpt":0.31127061990211113,"score_spread":0.25435580630010135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174585579","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.019910598,0.0022551143,0.9557393,0.008259889,0.00039592077,0.000107749715,0.000106815605,0.0017958783,0.011428701],"genre_scores_gemma":[0.41224802,0.002643548,0.5697505,0.0047115693,0.0009254671,0.00041952642,0.0003390541,0.0011739767,0.007788348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921617,0.003841904,0.00034941707,0.001516103,0.0015982514,0.0005327123],"domain_scores_gemma":[0.95589995,0.034489106,0.0010491373,0.006202098,0.0016123235,0.0007473781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01352443,0.0028334402,0.0023461662,0.00079083303,0.001425896,0.0042981203,0.0030182435,0.0045276755,0.005611971],"category_scores_gemma":[0.054382958,0.0016281495,0.0014494032,0.0012956033,0.0052721533,0.012319066,0.004629307,0.011600795,0.00256956],"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.00096056535,0.00042244466,0.0025523866,0.00053108303,0.00017134522,0.00021171078,0.0004078233,0.5314948,0.0021063336,0.25500152,0.012480243,0.19365978],"study_design_scores_gemma":[0.000063311694,0.00017449503,0.0003343686,0.00007946474,0.000027419203,0.00005582619,0.000051639112,0.8060045,0.001759471,0.18758582,0.003827975,0.00003574154],"about_ca_topic_score_codex":0.0037176795,"about_ca_topic_score_gemma":0.0030328727,"teacher_disagreement_score":0.01352443,"about_ca_system_score_codex":0.0023580582,"about_ca_system_score_gemma":0.004034821,"threshold_uncertainty_score":0.07152486},"labels":[],"label_agreement":null},{"id":"W3174600408","doi":"10.1609/aaai.v35i9.16982","title":"Deep Probabilistic Canonical Correlation Analysis","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Generative Adversarial Networks and Image Synthesis","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 Alberta","funders":"","keywords":"Canonical correlation; Probabilistic logic; Artificial intelligence; Generative grammar; Inference; Computer science; Representation (politics); Generative model; Set (abstract data type); Latent variable model; Latent variable; Interpretation (philosophy); Machine learning; Algorithm; Mathematics","score_opus":0.04804200418101987,"score_gpt":0.27169572563000577,"score_spread":0.2236537214489859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174600408","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.0032782499,0.00024418405,0.9945405,0.00020085611,0.000029505625,0.000012747074,0.00009589481,0.00025065197,0.0013474089],"genre_scores_gemma":[0.561054,0.0013332668,0.42532682,0.0006665931,0.00028938075,0.00023229944,0.0010851831,0.0004525412,0.009559835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833494,0.0006225203,0.000049355072,0.0003671208,0.00044307916,0.00018292482],"domain_scores_gemma":[0.9979527,0.00090377574,0.00026136046,0.00038690426,0.00036490636,0.00013030609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021746545,0.0009385443,0.0013421669,0.0013742063,0.0005369047,0.0019003059,0.0021989087,0.001352315,0.0033037786],"category_scores_gemma":[0.005262759,0.00093803956,0.0019333141,0.0016071406,0.0017632489,0.002532195,0.002915294,0.0030374483,0.0008302128],"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.00005918487,0.000041979165,0.0012145609,0.00008837345,0.00016412763,0.00014598163,0.0001336883,0.5085898,0.0028781753,0.4110353,0.005319892,0.07032894],"study_design_scores_gemma":[0.0000032844573,0.000008531543,0.00013390237,0.000007941436,0.000008879002,0.000031805543,0.000005158132,0.94103724,0.0003905668,0.057332624,0.0010291424,0.000010918069],"about_ca_topic_score_codex":0.007237696,"about_ca_topic_score_gemma":0.007965502,"teacher_disagreement_score":0.007237696,"about_ca_system_score_codex":0.001532774,"about_ca_system_score_gemma":0.0019700655,"threshold_uncertainty_score":0.014391124},"labels":[],"label_agreement":null},{"id":"W3174683006","doi":"10.1609/aaai.v35i15.17567","title":"Quantum-inspired Neural Network for Conversational Emotion Recognition","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Neural Networks and Reservoir Computing","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":"Université de Montréal","funders":"European Commission","keywords":"Computer science; Conversation; Quantum; Context (archaeology); Analogy; Task (project management); Benchmarking; Perspective (graphical); Artificial neural network; Process (computing); Artificial intelligence; Psychology; Communication; Engineering; Linguistics","score_opus":0.10550571912730111,"score_gpt":0.2893750050929338,"score_spread":0.18386928596563268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174683006","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.11206831,0.0018634977,0.8756057,0.0016027223,0.00026543546,0.00007000183,0.00053570524,0.00090015674,0.0070885043],"genre_scores_gemma":[0.9092852,0.00040673363,0.086305596,0.00023840234,0.0000786619,0.000099479505,0.000428634,0.000066669134,0.003090611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973625,0.000095359275,0.0000118659045,0.00007101573,0.000051302355,0.00003416789],"domain_scores_gemma":[0.99965394,0.00017374186,0.000040176525,0.00004680602,0.00006789044,0.000017432465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053312135,0.00033710946,0.0003583958,0.00027435392,0.00030052898,0.00060224306,0.00082139566,0.00056933076,0.0019861308],"category_scores_gemma":[0.002423375,0.00014777729,0.00029701428,0.0004061497,0.00043920294,0.0012706865,0.00071492686,0.0010381686,0.00039421523],"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.0005393819,0.00022821249,0.003397648,0.00031041232,0.000183291,0.0001476334,0.0004551549,0.5512083,0.048022904,0.0791756,0.009878374,0.30645302],"study_design_scores_gemma":[0.0000023914859,0.000009845494,0.0002991388,0.000003749483,0.0000060707202,0.000007918195,0.0000116685,0.98531383,0.0015500834,0.012098189,0.0006909028,0.000006274426],"about_ca_topic_score_codex":0.002823394,"about_ca_topic_score_gemma":0.0027841402,"teacher_disagreement_score":0.002823394,"about_ca_system_score_codex":0.00076808105,"about_ca_system_score_gemma":0.00044202438,"threshold_uncertainty_score":0.006644249},"labels":[],"label_agreement":null},{"id":"W3174686248","doi":"10.1609/aaai.v35i5.16575","title":"Inductive Graph Neural Networks for Spatiotemporal Kriging","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":151,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Institut de Valorisation des Données","keywords":"Kriging; Adjacency matrix; Computer science; Graph; Adjacency list; Artificial neural network; Artificial intelligence; Scalability; Machine learning; Data mining; Algorithm; Theoretical computer science","score_opus":0.10448264763483878,"score_gpt":0.3354707719017566,"score_spread":0.23098812426691784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174686248","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.0034749499,0.00026965412,0.99464333,0.00020573096,0.000028468263,0.000020990681,0.00012422077,0.00046952328,0.00076308317],"genre_scores_gemma":[0.46447906,0.0012365005,0.52633256,0.00035287542,0.00012139931,0.00041559758,0.0011638734,0.00033362422,0.0055645597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995597,0.00014746617,0.000024320354,0.00012641858,0.00010177394,0.00004029245],"domain_scores_gemma":[0.998485,0.000977529,0.00013899377,0.0001424421,0.00021616094,0.0000397856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087035744,0.0009821553,0.00079279556,0.0008606202,0.0004538952,0.0006583058,0.0015261496,0.0009895995,0.0018508874],"category_scores_gemma":[0.0049893004,0.00065976515,0.0008346531,0.0013095477,0.00091222336,0.001275633,0.0010691044,0.0024844478,0.00058959954],"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.000011941426,0.0000104915025,0.00025111667,0.000032476513,0.000017712864,0.0000202127,0.000021548505,0.965974,0.0004535624,0.0103116585,0.00053480436,0.02236048],"study_design_scores_gemma":[0.0000010319628,0.0000025276715,0.000029333993,0.0000026469365,0.0000016290485,0.0000028775166,0.0000022694728,0.9929092,0.00016429687,0.0065793726,0.00030230178,0.0000024254193],"about_ca_topic_score_codex":0.019882359,"about_ca_topic_score_gemma":0.024172813,"teacher_disagreement_score":0.019882359,"about_ca_system_score_codex":0.0017148531,"about_ca_system_score_gemma":0.0011837764,"threshold_uncertainty_score":0.039533257},"labels":[],"label_agreement":null},{"id":"W3174700868","doi":"10.1609/aaai.v35i9.16978","title":"Linearly Replaceable Filters for Deep Network Channel Pruning","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Ministry of Science and ICT, South Korea; Electronics and Telecommunications Research Institute","keywords":"FLOPS; Computer science; Pruning; Convolutional neural network; Deep learning; Filter (signal processing); Algorithm; Artificial intelligence; Compensation (psychology); Channel (broadcasting); Computer engineering; Pattern recognition (psychology); Parallel computing; Computer vision; Telecommunications","score_opus":0.08086057145799233,"score_gpt":0.3017327517650332,"score_spread":0.2208721803070409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174700868","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.027730567,0.00056429335,0.96787864,0.000100458456,0.00007534107,0.00003084308,0.000058871363,0.0018069334,0.0017541046],"genre_scores_gemma":[0.4140406,0.00059200375,0.57829815,0.00027685813,0.00012617394,0.00010545002,0.0003797582,0.00033352815,0.005847495],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992781,0.00010872195,0.000041178173,0.0001377664,0.0003200005,0.000114247],"domain_scores_gemma":[0.9990281,0.00034204667,0.00010001833,0.000254492,0.00023400587,0.000041343585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007588334,0.0009822269,0.00071353454,0.0007852943,0.00047836386,0.00062708434,0.0012326579,0.00095842505,0.0024425816],"category_scores_gemma":[0.0024551465,0.00031728033,0.00063224806,0.0006112981,0.0006681224,0.0014730478,0.0007742266,0.0014221504,0.000868139],"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.00058051053,0.00022273848,0.0018495674,0.00017015281,0.00012801948,0.0003911278,0.00013154224,0.203242,0.10877203,0.025840193,0.0069750943,0.65169704],"study_design_scores_gemma":[0.000027254626,0.00011508567,0.00032470026,0.000018674893,0.000043764405,0.00020105187,0.000022382617,0.92742085,0.058693163,0.006853538,0.0062561394,0.000023404496],"about_ca_topic_score_codex":0.0035818713,"about_ca_topic_score_gemma":0.0062503982,"teacher_disagreement_score":0.0035818713,"about_ca_system_score_codex":0.00063860114,"about_ca_system_score_gemma":0.0011734299,"threshold_uncertainty_score":0.008171201},"labels":[],"label_agreement":null},{"id":"W3174773165","doi":"10.1609/aaai.v35i18.17902","title":"A Deep Learning Framework for Improving Lameness Identification in Dairy Cattle","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Animal Behavior and Welfare Studies","field":"Veterinary","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":"McGill University; Université du Québec à Montréal","funders":"","keywords":"Lameness; Convolutional neural network; Deep learning; Gait; Computer science; Dairy cattle; Artificial intelligence; Architecture; Identification (biology); Test set; Machine learning; Physical medicine and rehabilitation; Medicine; Animal science; Geography; Biology; Surgery; Ecology","score_opus":0.12730611940133896,"score_gpt":0.3709377031059512,"score_spread":0.24363158370461224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174773165","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.16393752,0.0007961845,0.8315699,0.000318972,0.000050149807,0.000069071626,0.00036148328,0.0013979138,0.0014987253],"genre_scores_gemma":[0.7955393,0.00035245018,0.19878426,0.00021788763,0.00004491544,0.00010276718,0.0011249472,0.00005134658,0.0037821424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998043,0.000038807502,0.0000099337685,0.000056503424,0.000044980545,0.000045625835],"domain_scores_gemma":[0.99972326,0.00008342506,0.000028480259,0.000022510903,0.00011927601,0.000022987819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008806071,0.00047453685,0.00038379125,0.000537123,0.00021822313,0.00043691669,0.0008122703,0.00062894163,0.00081661047],"category_scores_gemma":[0.0010399618,0.00023961946,0.00040500486,0.0003548984,0.00026983395,0.0004449687,0.0006714256,0.0007376925,0.00023540678],"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.00023691505,0.0003204143,0.006460223,0.000069211565,0.0001269165,0.000112156486,0.0000839576,0.5902527,0.019673547,0.0025684522,0.0026408357,0.3774547],"study_design_scores_gemma":[0.000003376616,0.000033083375,0.00049910555,0.0000036917083,0.000007151903,0.000007229103,0.000005730931,0.997595,0.0010996382,0.00048210498,0.0002608092,0.0000030980634],"about_ca_topic_score_codex":0.014994381,"about_ca_topic_score_gemma":0.015763536,"teacher_disagreement_score":0.014994381,"about_ca_system_score_codex":0.0006813561,"about_ca_system_score_gemma":0.0010279415,"threshold_uncertainty_score":0.029814184},"labels":[],"label_agreement":null},{"id":"W3174820339","doi":"10.1609/aaai.v35i2.16211","title":"Towards Universal Physical Attacks on Single Object Tracking","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Artificial intelligence; Computer vision; BitTorrent tracker; Computer science; Camouflage; Video tracking; Feature (linguistics); Pattern recognition (psychology); Object (grammar); Eye tracking","score_opus":0.08011184715313713,"score_gpt":0.3143710254128679,"score_spread":0.23425917825973075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174820339","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.119309545,0.0005208173,0.87281704,0.0005252657,0.00009097819,0.00006942681,0.000084098225,0.0013801825,0.0052026906],"genre_scores_gemma":[0.9321299,0.00026118103,0.06564746,0.0002104282,0.00003950904,0.000042845488,0.00010242169,0.00009329675,0.0014729734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833363,0.00051119865,0.000081642924,0.00033199074,0.00055793294,0.00018367065],"domain_scores_gemma":[0.99599504,0.0019148861,0.00055851525,0.001152784,0.0002330706,0.00014567073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019822782,0.0008381791,0.000793987,0.0004996803,0.00037729176,0.00072739576,0.00076737173,0.0011489694,0.0012832828],"category_scores_gemma":[0.009029739,0.00036571288,0.0005764999,0.00030410377,0.0020116887,0.001917698,0.0029015983,0.0016643718,0.0003852098],"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.00048652274,0.00010372684,0.0021800133,0.000164748,0.00009857386,0.0004174533,0.0002071296,0.77338773,0.07476114,0.049789973,0.002823432,0.09557957],"study_design_scores_gemma":[0.00001988362,0.00014829142,0.00055620156,0.000018256365,0.000011084594,0.0002386475,0.000024742545,0.96903807,0.016175989,0.012154018,0.0015965553,0.000018240738],"about_ca_topic_score_codex":0.0006168272,"about_ca_topic_score_gemma":0.00035893742,"teacher_disagreement_score":0.0019822782,"about_ca_system_score_codex":0.00068371807,"about_ca_system_score_gemma":0.00042973313,"threshold_uncertainty_score":0.010483384},"labels":[],"label_agreement":null},{"id":"W3174884755","doi":"10.1609/aaai.v35i13.17424","title":"A Complexity-theoretic Analysis of Green Pickup-and-Delivery Problems","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pickup; Heuristics; Computer science; Range (aeronautics); Mathematical optimization; Vehicle routing problem; Computational complexity theory; Routing (electronic design automation); Mathematics; Algorithm; Engineering; Artificial intelligence","score_opus":0.08345310543386872,"score_gpt":0.2718103838468567,"score_spread":0.18835727841298797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174884755","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.06529591,0.003315757,0.84389096,0.011970915,0.0002918594,0.00027247492,0.0013016283,0.00028857362,0.07337179],"genre_scores_gemma":[0.80900025,0.004425987,0.15670158,0.0015956354,0.0013554735,0.0006443674,0.0016598877,0.00031388688,0.024302848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976954,0.00068692624,0.000084389845,0.000413674,0.0007500139,0.00036956414],"domain_scores_gemma":[0.9916011,0.0066445954,0.00044128284,0.00047190604,0.00047505964,0.00036603297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019184904,0.0012993847,0.0010632718,0.0016117042,0.0013637085,0.0039625806,0.0022635271,0.0016678292,0.0065765153],"category_scores_gemma":[0.011158447,0.00063348934,0.0016835605,0.002073792,0.0028831542,0.006714894,0.0025026451,0.0050436193,0.0007501453],"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.000110024266,0.0001297068,0.0008359416,0.00034447716,0.00006043967,0.00016269188,0.00029198296,0.19878934,0.0015904192,0.766159,0.010689821,0.02083625],"study_design_scores_gemma":[0.000023375394,0.000035959925,0.0005275707,0.00003734661,0.00002419255,0.000102984326,0.00011262621,0.40105227,0.0005342166,0.5894862,0.0080412915,0.000021889107],"about_ca_topic_score_codex":0.0031661445,"about_ca_topic_score_gemma":0.0020116034,"teacher_disagreement_score":0.0065765153,"about_ca_system_score_codex":0.004324487,"about_ca_system_score_gemma":0.001800692,"threshold_uncertainty_score":0.03137648},"labels":[],"label_agreement":null},{"id":"W3175078852","doi":"10.1609/aaai.v35i1.16168","title":"Riemannian Embedding Banks for Common Spatial Patterns with EEG-based SPD Neural Networks","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","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":"Kootenay Association for Science & Technology","funders":"Ministry of Science and ICT, South Korea; National Research Foundation of Korea; National Research Foundation","keywords":"Embedding; Artificial intelligence; Riemannian geometry; Computer science; Riemannian manifold; Manifold (fluid mechanics); Artificial neural network; Pattern recognition (psychology); Generalization; Deep learning; Nonlinear dimensionality reduction; Feature (linguistics); Feature vector; Context (archaeology); Metric (unit); Mathematics; Algorithm; Pure mathematics; Dimensionality reduction; Mathematical analysis; Geography","score_opus":0.0723957588379945,"score_gpt":0.31274546004032233,"score_spread":0.24034970120232785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175078852","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.008412656,0.00026172292,0.9900563,0.00016118852,0.00003389345,0.00003502792,0.000048936414,0.0004307372,0.0005595023],"genre_scores_gemma":[0.37564102,0.0006608745,0.6176909,0.00039625476,0.00010069318,0.00038811757,0.00064590963,0.00020242449,0.0042738663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991603,0.00026214708,0.000074516014,0.00023086726,0.00020604435,0.00006606255],"domain_scores_gemma":[0.9987161,0.0004508334,0.00014906404,0.00027246473,0.00033867965,0.00007284379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014677976,0.0013839824,0.0012117635,0.0008363724,0.00041717218,0.00094668,0.0019781562,0.0012692533,0.0025336791],"category_scores_gemma":[0.0047940407,0.0008450618,0.0011779183,0.0012379021,0.00096094044,0.0023135133,0.0026370399,0.0021122461,0.001228875],"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.00015870603,0.00014023679,0.0016218084,0.00016308017,0.00019302432,0.0001712815,0.00022502753,0.53733027,0.011127936,0.027371746,0.0054616495,0.4160352],"study_design_scores_gemma":[0.00000302199,0.000014327974,0.000085551146,0.0000031343063,0.0000043593122,0.000015731865,0.0000055217765,0.99563295,0.0005176293,0.003404976,0.0003083613,0.0000042858455],"about_ca_topic_score_codex":0.004367735,"about_ca_topic_score_gemma":0.0053300457,"teacher_disagreement_score":0.004367735,"about_ca_system_score_codex":0.0007791262,"about_ca_system_score_gemma":0.0009761931,"threshold_uncertainty_score":0.008684635},"labels":[],"label_agreement":null},{"id":"W3175289964","doi":"10.1609/aaai.v35i7.16775","title":"Algebra of Modular Systems: Containment and Equivalence","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Modular design; Homomorphism; Algebra over a field; Equivalence (formal languages); Computer science; Universal algebra; Class (philosophy); Containment (computer programming); Mathematics; Discrete mathematics; Programming language; Pure mathematics; Artificial intelligence","score_opus":0.07069733516030524,"score_gpt":0.2791984966351453,"score_spread":0.20850116147484005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175289964","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.07459688,0.0011483654,0.86349475,0.0027137268,0.00015287886,0.0003301374,0.00059697434,0.0006148389,0.05635153],"genre_scores_gemma":[0.80737334,0.0007986054,0.18239707,0.00062556175,0.00039611387,0.0003766909,0.0011025353,0.00012861112,0.006801491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99284077,0.0021582565,0.0006839196,0.0015314127,0.002140485,0.00064515753],"domain_scores_gemma":[0.98709863,0.007888865,0.0011866455,0.001530495,0.0015848625,0.0007105075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046939747,0.00044894702,0.0007134795,0.0019705887,0.0018968225,0.004306614,0.0016212959,0.0012680546,0.0070619457],"category_scores_gemma":[0.016851075,0.00064503634,0.0016792078,0.0017258766,0.00676347,0.012445884,0.0052275076,0.0034274533,0.0007096924],"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.000014037992,0.000019009893,0.00022689297,0.00003519001,0.000009050022,0.00006752163,0.0002707537,0.0017091398,0.00033089134,0.9909991,0.000562467,0.005755928],"study_design_scores_gemma":[0.000014377538,0.000012995987,0.00013732896,0.000013902321,0.000007353125,0.00009770713,0.000089129375,0.010828146,0.00048798925,0.9847536,0.0035484543,0.000008949345],"about_ca_topic_score_codex":0.0022708953,"about_ca_topic_score_gemma":0.0012244665,"teacher_disagreement_score":0.0070619457,"about_ca_system_score_codex":0.0022935367,"about_ca_system_score_gemma":0.0014586353,"threshold_uncertainty_score":0.02482438},"labels":[],"label_agreement":null},{"id":"W3175312069","doi":"10.1609/aaai.v35i13.17369","title":"Individual Fairness in Kidney Exchange Programs","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Organ Donation and Transplantation","field":"Medicine","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canada First Research Excellence Fund; Institut de Valorisation des Données; Compute Canada","keywords":"Solver; Computer science; Mathematical optimization; Kidney transplant; Selection (genetic algorithm); Vulnerability (computing); Process (computing); Constraint (computer-aided design); Kidney transplantation; Medicine; Mathematics; Transplantation; Machine learning; Surgery; Computer security","score_opus":0.1025052322303667,"score_gpt":0.31811328914568326,"score_spread":0.21560805691531656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175312069","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.1298121,0.0005673105,0.8576769,0.001441153,0.000057946483,0.00030829638,0.00016178937,0.00027744795,0.009697073],"genre_scores_gemma":[0.74952364,0.00028487865,0.24712303,0.00018469628,0.00003655461,0.00028386846,0.0000981373,0.00010524691,0.0023600059],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9915155,0.00546977,0.00025237,0.00078373373,0.001102695,0.00087600155],"domain_scores_gemma":[0.97381455,0.022114523,0.0014292115,0.0009161912,0.0010289414,0.0006966779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011996646,0.0006729079,0.0013137726,0.00076491863,0.0013538188,0.0026594768,0.0013871779,0.0012648562,0.0031495164],"category_scores_gemma":[0.031134875,0.00049183785,0.0008651418,0.0010290816,0.0019647651,0.002546369,0.00220058,0.0020021447,0.0001797126],"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.0002662002,0.00013748875,0.002656941,0.00012170053,0.00003949697,0.0000833374,0.0003125564,0.84311736,0.0006601654,0.108133964,0.00074870954,0.043722123],"study_design_scores_gemma":[0.0000618807,0.00012488558,0.00044975764,0.000040660183,0.000025240271,0.000033219,0.00017890584,0.86520493,0.0013247224,0.13074577,0.0017915511,0.000018540131],"about_ca_topic_score_codex":0.005924275,"about_ca_topic_score_gemma":0.005632663,"teacher_disagreement_score":0.011996646,"about_ca_system_score_codex":0.002568309,"about_ca_system_score_gemma":0.004972212,"threshold_uncertainty_score":0.06344509},"labels":[],"label_agreement":null},{"id":"W3175400448","doi":"10.1609/aaai.v35i17.17830","title":"Random Forests for Opponent Hand Estimation in Gin Rummy","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","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 Toronto","funders":"","keywords":"Heuristics; Random forest; Adversary; Computer science; Artificial intelligence; Simple (philosophy); Machine learning; Classifier (UML); Fictitious play; Game theory; Mathematics; Computer security; Mathematical economics","score_opus":0.08798144882918432,"score_gpt":0.32476330913354723,"score_spread":0.2367818603043629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175400448","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.277831,0.0013801287,0.6930957,0.0013170762,0.0002484799,0.00035109438,0.0025664747,0.013451739,0.009758325],"genre_scores_gemma":[0.79390913,0.00012955024,0.19871604,0.00034876572,0.000069036294,0.00021100357,0.0028351734,0.00044540438,0.0033359248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873656,0.00056387915,0.000047027468,0.00030988915,0.00015860939,0.00018409839],"domain_scores_gemma":[0.996662,0.0023324045,0.00021277615,0.0003795128,0.00026056432,0.00015268518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029960575,0.0012887936,0.0008464604,0.0011837679,0.000801841,0.0010534328,0.0016573463,0.0015406323,0.003740618],"category_scores_gemma":[0.008837383,0.00056217995,0.00090209674,0.00055343634,0.0006910392,0.0015094631,0.0011441065,0.0022156853,0.0013279717],"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.0010281341,0.0005282974,0.012290589,0.00017491452,0.00016442436,0.00022558364,0.00023945449,0.78943396,0.0039486075,0.012238657,0.013414944,0.16631244],"study_design_scores_gemma":[0.000024317193,0.000029105231,0.00050651643,0.000009234264,0.0000057244083,0.000019277602,0.000015192559,0.99036205,0.00073105807,0.007694814,0.0005950655,0.000007617081],"about_ca_topic_score_codex":0.012727128,"about_ca_topic_score_gemma":0.024459762,"teacher_disagreement_score":0.012727128,"about_ca_system_score_codex":0.0011833721,"about_ca_system_score_gemma":0.0010507196,"threshold_uncertainty_score":0.025306106},"labels":[],"label_agreement":null},{"id":"W3175559358","doi":"10.1609/aaai.v35i1.16108","title":"Asynchronous Stochastic Gradient Descent for Extreme-Scale Recommender Systems","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Stochastic Gradient Optimization Techniques","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é de Montréal","funders":"","keywords":"Computer science; Asynchronous communication; Stochastic gradient descent; Normalization (sociology); Terabyte; Recommender system; Scale (ratio); Machine learning; Data mining; Artificial neural network","score_opus":0.11355235592447331,"score_gpt":0.29060971179869205,"score_spread":0.17705735587421872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175559358","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.017355746,0.0005399767,0.97891974,0.0005290939,0.00011976874,0.000059376845,0.0001302942,0.0009144469,0.0014315486],"genre_scores_gemma":[0.6711597,0.00074364484,0.31807706,0.0007298661,0.0003832827,0.00040635685,0.0009811565,0.0003380486,0.0071808035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986792,0.0004941866,0.000084249725,0.00030117054,0.0002941847,0.0001469389],"domain_scores_gemma":[0.9972447,0.0015073863,0.00021258749,0.00026113994,0.00060067885,0.0001735562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026359542,0.0013507754,0.001967929,0.0005781118,0.00077583967,0.0011725539,0.0021653487,0.0015682158,0.002262148],"category_scores_gemma":[0.008251673,0.0009497034,0.000909214,0.0009243719,0.001143357,0.0012545891,0.0014086035,0.0023646995,0.0010101036],"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.00011798262,0.00006768707,0.0008537696,0.00007852227,0.000058480597,0.00006159993,0.00004955593,0.95708776,0.00088418473,0.008753443,0.0029385989,0.029048368],"study_design_scores_gemma":[0.000006546652,0.000007363604,0.000046462337,0.0000017694421,0.0000020529803,0.000002638916,0.0000015313653,0.99750465,0.00006798978,0.0022014945,0.00015543347,0.0000020916339],"about_ca_topic_score_codex":0.012184085,"about_ca_topic_score_gemma":0.011671621,"teacher_disagreement_score":0.012184085,"about_ca_system_score_codex":0.0012242525,"about_ca_system_score_gemma":0.0018326098,"threshold_uncertainty_score":0.024226308},"labels":[],"label_agreement":null},{"id":"W3175570208","doi":"10.1609/aaai.v35i12.17323","title":"Multi-task Learning by Leveraging the Semantic Information","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"Computer science; Leverage (statistics); Artificial intelligence; Machine learning; Task (project management); Divergence (linguistics); Multi-task learning; Matching (statistics); Semantic space; Kullback–Leibler divergence; Semantic matching; Generalization; Mathematics; Statistics","score_opus":0.0598701591180961,"score_gpt":0.27602168735278787,"score_spread":0.21615152823469178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175570208","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.020607268,0.0005373235,0.9758522,0.00045149022,0.00008332994,0.00012927434,0.00013359371,0.0010506711,0.0011549009],"genre_scores_gemma":[0.59276086,0.00041113392,0.40033054,0.0009115582,0.00031425254,0.00045589215,0.001254723,0.0003714195,0.0031897307],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99637586,0.0011568454,0.00019511957,0.0012846749,0.00067758036,0.0003098763],"domain_scores_gemma":[0.9945497,0.0030824828,0.0004264842,0.0008951022,0.0006897323,0.0003564905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049209837,0.0023530861,0.0024241335,0.0019969512,0.0011544252,0.0020314741,0.0034656825,0.0029121258,0.0018594699],"category_scores_gemma":[0.0130420895,0.0007503347,0.001784467,0.0019589579,0.0015753732,0.005736191,0.004844936,0.004358952,0.0010192639],"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.0006880096,0.0010519226,0.0042702584,0.0005050526,0.00036267957,0.00029263156,0.00056355936,0.3670233,0.016805964,0.016683187,0.008306423,0.58344704],"study_design_scores_gemma":[0.00003343735,0.00009256541,0.0004547068,0.00001570319,0.000029870778,0.00006555913,0.000057295223,0.96364135,0.002746224,0.03172916,0.0011089834,0.00002510248],"about_ca_topic_score_codex":0.002905435,"about_ca_topic_score_gemma":0.0032647017,"teacher_disagreement_score":0.0049209837,"about_ca_system_score_codex":0.0012568831,"about_ca_system_score_gemma":0.0023329097,"threshold_uncertainty_score":0.026024997},"labels":[],"label_agreement":null},{"id":"W3175602168","doi":"10.1609/aaai.v35i8.16816","title":"Learned Bi-Resolution Image Coding using Generalized Octave Convolutions","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Codec; Artificial intelligence; Octave (electronics); Image resolution; Image compression; Coding (social sciences); Entropy encoding; Algorithm; Pattern recognition (psychology); Data compression; Image (mathematics); Mathematics; Image processing","score_opus":0.1618050627648651,"score_gpt":0.3543548842080234,"score_spread":0.19254982144315833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175602168","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.027654547,0.00022704435,0.970425,0.000066607514,0.000024578056,0.000021526972,0.000043496457,0.00038297646,0.0011542559],"genre_scores_gemma":[0.45062402,0.00056095695,0.54332006,0.0001692494,0.000040368446,0.00007572926,0.00028271883,0.000100308025,0.0048266007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980766,0.000033846973,0.000012096995,0.000038160353,0.00008590511,0.000022437463],"domain_scores_gemma":[0.9996339,0.000103254155,0.00004378135,0.00008605194,0.000109872286,0.000023169225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033817795,0.00042924838,0.0004001769,0.0004424164,0.00015949285,0.00043295493,0.00062456314,0.0004621395,0.0012716576],"category_scores_gemma":[0.0010629416,0.00015867903,0.00039196908,0.00052994804,0.00042101523,0.00093516486,0.00068640657,0.00075142743,0.00034731335],"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.00028696263,0.00013096843,0.0008163037,0.0001284125,0.00008871999,0.00017169798,0.00013559674,0.29295933,0.1137857,0.034458883,0.0023392343,0.55469817],"study_design_scores_gemma":[0.0000062007302,0.00003549349,0.00017078244,0.000006693727,0.000008564657,0.000092890354,0.000006581685,0.9796575,0.016564488,0.0024374635,0.0010034655,0.00000989884],"about_ca_topic_score_codex":0.0024272592,"about_ca_topic_score_gemma":0.0037094653,"teacher_disagreement_score":0.0024272592,"about_ca_system_score_codex":0.00039851991,"about_ca_system_score_gemma":0.0005380666,"threshold_uncertainty_score":0.0048263073},"labels":[],"label_agreement":null},{"id":"W3175752186","doi":"10.1609/aaai.v35i12.17235","title":"Self-Supervised Attention-Aware Reinforcement Learning","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Visual Attention and Saliency Detection","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":"McGill University","funders":"","keywords":"Computer science; Reinforcement learning; Artificial intelligence; Machine learning; Generalization; Task (project management); Visualization; Context (archaeology); Supervised learning; Object (grammar); Transfer of learning; Artificial neural network","score_opus":0.059180956656682965,"score_gpt":0.29466605082701486,"score_spread":0.2354850941703319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175752186","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.06438265,0.0001533681,0.9312891,0.00025247355,0.000052183903,0.00006782414,0.000049658272,0.0011785559,0.0025742701],"genre_scores_gemma":[0.93691117,0.000050908853,0.06053671,0.00014923954,0.000031736345,0.00007789073,0.000071958464,0.000080993705,0.002089359],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999619,0.00010462695,0.000016868535,0.00012410713,0.00007265775,0.00006261597],"domain_scores_gemma":[0.9981027,0.0009995967,0.000234275,0.00021283168,0.0003285461,0.00012208267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010607934,0.00076192204,0.0007869667,0.00038735868,0.0002547328,0.0005929786,0.0015448844,0.00083007035,0.0017283519],"category_scores_gemma":[0.004936132,0.00032089185,0.00036161297,0.00024856758,0.0009394743,0.0011659996,0.0010271173,0.0011719994,0.0003283585],"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.00015095575,0.00016011315,0.0023372069,0.00008742199,0.00006011973,0.00008456309,0.00012146431,0.869237,0.008137617,0.01040308,0.002370924,0.10684944],"study_design_scores_gemma":[0.0000062522035,0.000016693526,0.000073608324,0.0000020030618,0.0000025604188,0.000006113927,0.0000027769795,0.997006,0.0007407842,0.0020292215,0.000112103,0.000001951609],"about_ca_topic_score_codex":0.0027259365,"about_ca_topic_score_gemma":0.0033989989,"teacher_disagreement_score":0.0027259365,"about_ca_system_score_codex":0.000870993,"about_ca_system_score_gemma":0.0009410402,"threshold_uncertainty_score":0.0063194633},"labels":[],"label_agreement":null},{"id":"W3175853876","doi":"10.1609/aaai.v35i11.17159","title":"Online Class-Incremental Continual Learning with Adversarial Shapley Value","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":175,"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":"Forgetting; Computer science; Machine learning; Class (philosophy); Artificial intelligence; Adversarial system; Memory footprint; Task (project management); Stability (learning theory); Engineering","score_opus":0.05678288123306853,"score_gpt":0.2831853711185195,"score_spread":0.22640248988545097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175853876","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.066441014,0.0008056259,0.9273199,0.00055946247,0.00010861366,0.00010993065,0.00013786842,0.0020319135,0.002485689],"genre_scores_gemma":[0.8699688,0.00023935948,0.1235368,0.00043758142,0.00011821906,0.00014299896,0.00038099033,0.00017193196,0.00500335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890685,0.0003735574,0.000058098027,0.00031857946,0.00023666667,0.00010629047],"domain_scores_gemma":[0.99617106,0.0020935063,0.00030051902,0.0008075978,0.00042558127,0.00020168527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003223598,0.0012770243,0.0018906567,0.000657025,0.0005722673,0.0010963379,0.003903857,0.001779827,0.0027900059],"category_scores_gemma":[0.006947002,0.0005460815,0.00093613827,0.0006307428,0.0017686421,0.0036940954,0.0026064645,0.003318869,0.0007364998],"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.00037048056,0.0002669166,0.0016735207,0.00012755835,0.0001376663,0.000115532195,0.00015760702,0.7816913,0.003280417,0.016386427,0.0039035482,0.19188902],"study_design_scores_gemma":[0.000008773543,0.000037362784,0.00006060035,0.0000042694533,0.0000048945785,0.000016687456,0.000005856647,0.9922259,0.00059904036,0.0068540433,0.0001763568,0.000006247254],"about_ca_topic_score_codex":0.0023264405,"about_ca_topic_score_gemma":0.002733754,"teacher_disagreement_score":0.003903857,"about_ca_system_score_codex":0.0011425889,"about_ca_system_score_gemma":0.0011082529,"threshold_uncertainty_score":0.01704824},"labels":[],"label_agreement":null},{"id":"W3175886919","doi":"10.1609/aaai.v35i6.16687","title":"Aggregating Binary Judgments Ranked by Accuracy","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Binary number; Ranking (information retrieval); Computer science; Data mining; Distortion (music); Ground truth; Binary data; Machine learning; Artificial intelligence; Algorithm; Mathematics","score_opus":0.10230192761163202,"score_gpt":0.27713216749757885,"score_spread":0.17483023988594681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175886919","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.13676675,0.0008429061,0.851039,0.002063153,0.00019031693,0.00022158951,0.0007362898,0.00048250647,0.007657411],"genre_scores_gemma":[0.77040255,0.0003754158,0.22397156,0.00031959222,0.00041667942,0.00018080672,0.0012263554,0.00010809856,0.0029990333],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98623335,0.006389545,0.000812377,0.002648212,0.0031272515,0.00078929926],"domain_scores_gemma":[0.9560213,0.028173802,0.00475443,0.0055246665,0.0045094383,0.0010162976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017823953,0.0014305061,0.0024859998,0.0039052593,0.0012018969,0.0040992787,0.0023246163,0.0019838298,0.003169373],"category_scores_gemma":[0.059236977,0.00060305896,0.00090539514,0.0033081528,0.0014813818,0.004890028,0.002830918,0.0027812847,0.0008904252],"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.0012998936,0.0005250988,0.042433675,0.0005436092,0.0005985903,0.0003137641,0.0021111595,0.2101894,0.0050387927,0.14036705,0.01073041,0.58584857],"study_design_scores_gemma":[0.000096895215,0.00029045026,0.010303683,0.00013854196,0.00013882406,0.00012233353,0.00040915314,0.72999185,0.004208666,0.24931729,0.0048479713,0.00013437464],"about_ca_topic_score_codex":0.003893798,"about_ca_topic_score_gemma":0.0047715297,"teacher_disagreement_score":0.017823953,"about_ca_system_score_codex":0.001580414,"about_ca_system_score_gemma":0.0012204656,"threshold_uncertainty_score":0.094263196},"labels":[],"label_agreement":null},{"id":"W3176028257","doi":"10.1609/aaai.v35i9.16995","title":"Visual Concept Reasoning Networks","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI 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":"Université de Montréal","funders":"","keywords":"Computer science; Artificial intelligence; Merge (version control); Exploit; Visual reasoning; Cognitive neuroscience of visual object recognition; Convolutional neural network; Graph; Segmentation; Spatial intelligence; Pattern recognition (psychology); Machine learning; Theoretical computer science; Object (grammar); Information retrieval","score_opus":0.04798050538982407,"score_gpt":0.32445388860814633,"score_spread":0.27647338321832227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176028257","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.0199746,0.0006647072,0.96999997,0.00047465283,0.000099094985,0.00012246355,0.00055119145,0.0024241083,0.00568926],"genre_scores_gemma":[0.52496046,0.0008397748,0.46164984,0.000740905,0.00011662359,0.000332397,0.0020492503,0.00017342776,0.009137363],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949825,0.00007390585,0.00003060455,0.0002372331,0.00010603439,0.000053982418],"domain_scores_gemma":[0.99933654,0.00024697985,0.00007897293,0.0001413181,0.00015127812,0.00004480242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007326988,0.00095021154,0.00048491955,0.0007336927,0.00041348103,0.0012611606,0.0030642091,0.0013556883,0.0052724835],"category_scores_gemma":[0.0027000576,0.000520424,0.0011727365,0.0006948291,0.000791375,0.0026151475,0.0012694491,0.0016364137,0.0011998871],"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.00030630652,0.00019872715,0.0012628367,0.00037143394,0.00016551677,0.00023835983,0.00022919473,0.30048618,0.024630126,0.0836769,0.011152208,0.5772822],"study_design_scores_gemma":[0.000021626449,0.000047403482,0.00028413595,0.000022679415,0.00004222619,0.00008216279,0.000017310287,0.94179463,0.006204535,0.046466507,0.0050030565,0.00001377632],"about_ca_topic_score_codex":0.0046110777,"about_ca_topic_score_gemma":0.0055136625,"teacher_disagreement_score":0.0052724835,"about_ca_system_score_codex":0.0011656488,"about_ca_system_score_gemma":0.0008677958,"threshold_uncertainty_score":0.017638206},"labels":[],"label_agreement":null},{"id":"W3176185023","doi":"10.1609/aaai.v35i12.17264","title":"Adversarial Partial Multi-Label Learning with Label Disambiguation","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Artificial intelligence; Machine learning; Feature (linguistics); Encoder; Minimax; Generative adversarial network; Feature vector; Adversarial system; Deep learning; Pattern recognition (psychology); Mathematics","score_opus":0.1163529464583123,"score_gpt":0.3151711112700287,"score_spread":0.19881816481171644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176185023","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.02691586,0.00047691757,0.96907324,0.0004960708,0.00007052853,0.00005063689,0.00021751807,0.0010747596,0.0016244411],"genre_scores_gemma":[0.83069414,0.0002773875,0.16170083,0.0007668305,0.0001205034,0.00017474766,0.0011875517,0.00021977503,0.0048581404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984896,0.0006809551,0.000039708833,0.000433644,0.00023001058,0.00012599648],"domain_scores_gemma":[0.9969152,0.0018651033,0.00027519537,0.00060555607,0.00021368542,0.00012517716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002372571,0.0015110617,0.0014922069,0.00054166093,0.00049272174,0.0010298477,0.0023226088,0.0016419315,0.0017723123],"category_scores_gemma":[0.004858369,0.00055924087,0.0009794221,0.00074492896,0.002079836,0.0023958506,0.0026682168,0.0029044019,0.0005550367],"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.00026566876,0.00008465877,0.0012408257,0.00009985854,0.00007210528,0.00014499058,0.0001185543,0.9063198,0.0031681515,0.019778829,0.004398352,0.064308256],"study_design_scores_gemma":[0.0000065840172,0.000017923005,0.000061408165,0.0000052068413,0.0000047484896,0.000019498944,0.000005143231,0.98871815,0.0006422682,0.010195956,0.0003178444,0.0000052469636],"about_ca_topic_score_codex":0.0019042487,"about_ca_topic_score_gemma":0.0026688334,"teacher_disagreement_score":0.002372571,"about_ca_system_score_codex":0.0009560935,"about_ca_system_score_gemma":0.0008104363,"threshold_uncertainty_score":0.012547553},"labels":[],"label_agreement":null},{"id":"W3176211557","doi":"10.1609/aaai.v35i13.17380","title":"Interpreting Deep Neural Networks with Relative Sectional Propagation by Analyzing Comparative Gradients and Hostile Activations","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; Korea University","keywords":"Attribution; Computer science; Pascal (unit); Discriminative model; Backpropagation; Artificial intelligence; Artificial neural network; Relevance (law); Class (philosophy); Deep neural networks; Machine learning; Psychology; Social psychology","score_opus":0.04886274500150767,"score_gpt":0.2847071500924836,"score_spread":0.23584440509097593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176211557","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.10924765,0.000358625,0.8861132,0.00033713438,0.000082448125,0.000047426773,0.0001790339,0.0014783812,0.002156027],"genre_scores_gemma":[0.8741141,0.00037477489,0.122553974,0.00009963624,0.00006165099,0.000041812007,0.00029607577,0.00018337536,0.002274558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981505,0.000049095626,0.000010808622,0.00005077321,0.000048843813,0.00002534791],"domain_scores_gemma":[0.99930215,0.00022997703,0.00014242511,0.000117123294,0.0001632068,0.000045093297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011250301,0.0012037525,0.00023200209,0.00095446664,0.00023470218,0.0010862947,0.0006679775,0.00056239485,0.0011809674],"category_scores_gemma":[0.003727266,0.00036445228,0.00044896395,0.00058750855,0.0006746893,0.0018241258,0.0010294322,0.0012234924,0.0002411677],"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.00031288038,0.000112644506,0.015202939,0.00018998097,0.00016596704,0.0003668038,0.00041882298,0.543095,0.04716826,0.025658246,0.003343775,0.36396468],"study_design_scores_gemma":[0.000005495281,0.000024217108,0.0022029215,0.000013198319,0.000021816495,0.00003348926,0.000035435347,0.97483903,0.0075592957,0.014656425,0.0005982317,0.000010354363],"about_ca_topic_score_codex":0.0029966715,"about_ca_topic_score_gemma":0.0045725815,"teacher_disagreement_score":0.0029966715,"about_ca_system_score_codex":0.00050683325,"about_ca_system_score_gemma":0.00057607476,"threshold_uncertainty_score":0.0059584975},"labels":[],"label_agreement":null},{"id":"W3176369597","doi":"10.1609/aaai.v35i17.17798","title":"Over-MAP: Structural Attention Mechanism and Automated Semantic Segmentation Ensembled for Uncertainty Prediction","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning in Materials Science","field":"Materials Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Measure (data warehouse); Segmentation; Identification (biology); Artificial intelligence; Machine learning; Scale (ratio); Data mining; Mechanism (biology); Cartography","score_opus":0.035474395202786654,"score_gpt":0.30719239121368397,"score_spread":0.2717179960108973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176369597","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.10511111,0.0009703783,0.8867081,0.0007687948,0.00010273306,0.00006551999,0.00030769332,0.002934839,0.003030816],"genre_scores_gemma":[0.8769164,0.00019549477,0.12043674,0.00026444008,0.000119132244,0.000112200156,0.0006259921,0.00027461883,0.0010549246],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971641,0.000706356,0.00013155535,0.0007357623,0.00097233226,0.00028981912],"domain_scores_gemma":[0.9885328,0.0059840255,0.0011452397,0.002059009,0.0017322265,0.0005467519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054316344,0.0010716342,0.0013827955,0.002663484,0.0011677681,0.0024600602,0.0031465848,0.0027688346,0.0023837606],"category_scores_gemma":[0.025139628,0.0005485689,0.000857033,0.0015001884,0.0017920783,0.0063283457,0.00549024,0.0026634182,0.00050265214],"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.0011020396,0.00033952983,0.022254491,0.00030388997,0.00030968394,0.0002796326,0.0006365425,0.3890416,0.0131029645,0.08065538,0.006330057,0.48564425],"study_design_scores_gemma":[0.000010457212,0.00006409258,0.0013607653,0.000021241518,0.00001962366,0.000057533263,0.00003920043,0.9589771,0.0047561326,0.033660028,0.001012911,0.000020891488],"about_ca_topic_score_codex":0.0032082847,"about_ca_topic_score_gemma":0.0033389549,"teacher_disagreement_score":0.0054316344,"about_ca_system_score_codex":0.0015886659,"about_ca_system_score_gemma":0.0015854615,"threshold_uncertainty_score":0.028725564},"labels":[],"label_agreement":null},{"id":"W3176425931","doi":"10.1609/aaai.v35i3.16353","title":"Semantic Grouping Network for Video Captioning","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Multimodal Machine Learning Applications","field":"Computer Science","cited_by":148,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science; Interpretability; Closed captioning; Margin (machine learning); Word (group theory); Redundancy (engineering); Phrase; Artificial intelligence; Natural language processing; Speech recognition; Image (mathematics); Machine learning","score_opus":0.06834906582068068,"score_gpt":0.31396189647539346,"score_spread":0.2456128306547128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176425931","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.048060298,0.0029064948,0.9294325,0.0006551074,0.00039939347,0.00038807536,0.0013315782,0.0079670325,0.008859577],"genre_scores_gemma":[0.57201034,0.0017600555,0.405378,0.0005890199,0.00039951853,0.00045516537,0.0060517294,0.00049671927,0.012859441],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993431,0.00018330087,0.00003164765,0.00021790592,0.00014092779,0.000083102925],"domain_scores_gemma":[0.9992931,0.0002443895,0.00009670693,0.000113574635,0.00019680013,0.00005538766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011218971,0.001958558,0.0010002828,0.0023765315,0.00069407723,0.000765211,0.0019194402,0.0016548525,0.004047051],"category_scores_gemma":[0.0033610142,0.0004003341,0.000961724,0.0020863484,0.0007031387,0.0024392933,0.0011934203,0.0012848184,0.0015784828],"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.00076754234,0.00025286313,0.0015283506,0.00037212844,0.00013110736,0.00038992584,0.00032107113,0.2122558,0.024381498,0.009351962,0.018160919,0.7320869],"study_design_scores_gemma":[0.000019705627,0.00014063186,0.00052651,0.00003374656,0.00006076972,0.00012457333,0.00008453285,0.97081876,0.0106593575,0.010629371,0.0068742023,0.000027948801],"about_ca_topic_score_codex":0.0066175237,"about_ca_topic_score_gemma":0.0061041047,"teacher_disagreement_score":0.0066175237,"about_ca_system_score_codex":0.0015446226,"about_ca_system_score_gemma":0.00076652865,"threshold_uncertainty_score":0.013538778},"labels":[],"label_agreement":null},{"id":"W3176432538","doi":"10.1609/aaai.v35i1.16087","title":"Towered Actor Critic For Handling Multiple Action Types In Reinforcement Learning For Drug Discovery","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Receptor Mechanisms and Signaling","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Mila - Quebec Artificial Intelligence Institute; Canadian Institute for Advanced Research; University of Alberta","funders":"University of Alberta; FedDev Ontario; Alberta Machine Intelligence Institute; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Reinforcement learning; Computer science; Pipeline (software); Action (physics); Artificial intelligence; Drug discovery; Space (punctuation); Machine learning; Programming language; Bioinformatics","score_opus":0.06874953863389731,"score_gpt":0.3136991647026755,"score_spread":0.24494962606877818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176432538","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.011878284,0.00046515733,0.9810488,0.00026208392,0.00012056498,0.000069324306,0.00010087473,0.0017178559,0.004336924],"genre_scores_gemma":[0.7359469,0.0003736355,0.2562863,0.00036874326,0.000120163895,0.00025199197,0.00029663238,0.0002984444,0.0060571404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907255,0.0003714529,0.00006235053,0.0001794919,0.00022314492,0.00009086998],"domain_scores_gemma":[0.9976279,0.0016357668,0.00015218898,0.00016680676,0.00028038406,0.00013689218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027823152,0.001199128,0.001051699,0.0005644132,0.0004924174,0.0008889545,0.001767767,0.0011973828,0.004276417],"category_scores_gemma":[0.005963036,0.000485678,0.00079702534,0.0004932327,0.0011858168,0.0010953638,0.0011103806,0.00252093,0.000658538],"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.00012046567,0.00002855681,0.0004503326,0.000062260115,0.00004183484,0.00006882287,0.0000310475,0.9658343,0.0010669761,0.008359973,0.0011620783,0.02277329],"study_design_scores_gemma":[0.000011209088,0.000019419986,0.000023132665,0.000003571199,0.0000055840123,0.000006743189,0.0000015878458,0.9970072,0.0002961537,0.0022818814,0.0003401235,0.0000034865961],"about_ca_topic_score_codex":0.009524968,"about_ca_topic_score_gemma":0.010763486,"teacher_disagreement_score":0.009524968,"about_ca_system_score_codex":0.0015856578,"about_ca_system_score_gemma":0.0021002067,"threshold_uncertainty_score":0.018939078},"labels":[],"label_agreement":null},{"id":"W3176515086","doi":"10.1609/aaai.v35i6.16710","title":"Market-Based Explanations of Collective Decisions","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Core (optical fiber); Axiom; Proportionality (law); Construct (python library); Mathematical economics; Computer science; Economics; Actuarial science; Operations research; Law and economics; Microeconomics; Law; Political science; Mathematics","score_opus":0.14318251301595522,"score_gpt":0.2824055527762517,"score_spread":0.13922303976029646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176515086","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.08005794,0.001126269,0.6905607,0.022171235,0.00041817004,0.00022508974,0.00047102178,0.00030347772,0.20466608],"genre_scores_gemma":[0.9263474,0.0005223131,0.051869277,0.0010319874,0.0003416179,0.00029320677,0.00019637139,0.00007284989,0.019325025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982253,0.000819143,0.000065049964,0.00029440058,0.00032847552,0.00026765477],"domain_scores_gemma":[0.9965089,0.001899175,0.0004898172,0.0004777042,0.00038431404,0.0002401878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035642784,0.0005001117,0.0005464137,0.0012423783,0.0015106034,0.0029174292,0.0019606992,0.0027732144,0.017915146],"category_scores_gemma":[0.008551831,0.0002740371,0.0012507454,0.0009744231,0.003192046,0.005774169,0.0017494472,0.0015762962,0.0010253805],"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.0000053238027,0.000007876419,0.00011348227,0.000014018396,0.00000440954,0.00003166964,0.00008877593,0.003329945,0.00005786701,0.99410594,0.00072939193,0.0015113995],"study_design_scores_gemma":[0.000014812151,0.0000055797814,0.00009221987,0.000005778713,0.0000026730472,0.000016057691,0.00004971289,0.014019526,0.000049986298,0.98289907,0.0028403895,0.000004150411],"about_ca_topic_score_codex":0.0025013587,"about_ca_topic_score_gemma":0.0021635601,"teacher_disagreement_score":0.017915146,"about_ca_system_score_codex":0.0019111544,"about_ca_system_score_gemma":0.00094487565,"threshold_uncertainty_score":0.059932172},"labels":[],"label_agreement":null},{"id":"W3176616156","doi":"10.1609/aaai.v35i16.17722","title":"Neural Sentence Ordering Based on Constraint Graphs","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":13,"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 Montréal","funders":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Sentence; Computer science; Constraint (computer-aided design); Graph; Artificial intelligence; Benchmark (surveying); Natural language processing; Code (set theory); Theoretical computer science; Mathematics; Programming language","score_opus":0.08688291472376188,"score_gpt":0.2864605725247814,"score_spread":0.19957765780101955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176616156","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.10904259,0.0017271398,0.8505158,0.001122314,0.00038856623,0.00056148705,0.007815985,0.014399312,0.014426838],"genre_scores_gemma":[0.5865705,0.0010726596,0.36957315,0.0006086677,0.00027940425,0.00045035823,0.024842272,0.0009682414,0.01563482],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994338,0.00012528093,0.000036201574,0.00021881639,0.00013285638,0.000053040454],"domain_scores_gemma":[0.99917275,0.00032777915,0.00011721539,0.00011625697,0.0002054087,0.000060562666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044193363,0.0012099693,0.000565029,0.0022328352,0.00046577773,0.00080351107,0.0010695817,0.0006723336,0.0050572506],"category_scores_gemma":[0.0029422867,0.0003655773,0.00090790004,0.0020112358,0.0004413783,0.002606192,0.00079670944,0.0013930743,0.001502694],"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.00057769,0.00038715245,0.0037867003,0.0006649546,0.0001893527,0.00044422862,0.00045732094,0.112018295,0.031821188,0.027501399,0.048319846,0.77383184],"study_design_scores_gemma":[0.0000709441,0.0001528624,0.0027470673,0.00005782392,0.000105421896,0.00019344139,0.00016492985,0.90830684,0.012288839,0.062409814,0.013454599,0.000047468366],"about_ca_topic_score_codex":0.011119196,"about_ca_topic_score_gemma":0.024723494,"teacher_disagreement_score":0.011119196,"about_ca_system_score_codex":0.0010574491,"about_ca_system_score_gemma":0.0015911813,"threshold_uncertainty_score":0.022108912},"labels":[],"label_agreement":null},{"id":"W3176655069","doi":"10.1609/aaai.v35i5.16539","title":"PREMERE: Meta-Reweighting via Self-Ensembling for Point-of-Interest Recommendation","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Recommender Systems and Techniques","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":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea","keywords":"Weighting; Computer science; Benchmark (surveying); Recommender system; Scheme (mathematics); Meta learning (computer science); Artificial intelligence; Point of interest; Data mining; Point (geometry); Metamodeling; Machine learning; Metadata; Information retrieval; World Wide Web; Mathematics","score_opus":0.2633691770941545,"score_gpt":0.33752387805012446,"score_spread":0.07415470095596993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176655069","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.03524279,0.0018341913,0.95707816,0.00027514534,0.00021355308,0.0001330596,0.0002078622,0.003543758,0.001471456],"genre_scores_gemma":[0.508481,0.0006922054,0.4833772,0.00076978444,0.0002613582,0.0003615478,0.0012347994,0.00047487454,0.0043471176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988164,0.0004134884,0.00007570066,0.00034174384,0.00025775103,0.00009487196],"domain_scores_gemma":[0.99723744,0.0013314915,0.0001482649,0.00062193436,0.0005493275,0.0001115103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032337354,0.0014892628,0.0024301533,0.0014823299,0.0006303269,0.0010705241,0.0033654447,0.0019674862,0.0017679612],"category_scores_gemma":[0.009016129,0.0008431311,0.0011629825,0.0012516654,0.00077251496,0.0024575863,0.001289238,0.0021364712,0.0011596445],"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.00043823614,0.00054915226,0.0064567258,0.00027288948,0.00055824715,0.00018991367,0.00033365883,0.41600525,0.011508797,0.0072773127,0.012438844,0.543971],"study_design_scores_gemma":[0.000025428793,0.00009143237,0.00031642255,0.0000139971335,0.000034638382,0.000047244426,0.000009870769,0.9947777,0.0011709969,0.0025616249,0.00093348353,0.000017167235],"about_ca_topic_score_codex":0.0069945855,"about_ca_topic_score_gemma":0.013231292,"teacher_disagreement_score":0.0069945855,"about_ca_system_score_codex":0.00083737395,"about_ca_system_score_gemma":0.0009321612,"threshold_uncertainty_score":0.017101824},"labels":[],"label_agreement":null},{"id":"W3176690543","doi":"10.1609/aaai.v35i18.17945","title":"SecDD: Efficient and Secure Method for Remotely Training Neural Networks (Student Abstract)","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","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 Waterloo","funders":"","keywords":"Overfitting; Leverage (statistics); Computer science; Deep neural networks; Training (meteorology); Artificial neural network; Adversarial system; Machine learning; Artificial intelligence; Vulnerability (computing); Deep learning; Computer network; Distributed computing; Computer security","score_opus":0.07787970669094256,"score_gpt":0.34495881990182703,"score_spread":0.26707911321088446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176690543","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.004788397,0.00009141875,0.9911288,0.00028233655,0.00009124741,0.00003606746,0.000069796486,0.0023399093,0.0011720182],"genre_scores_gemma":[0.28904185,0.00019577733,0.69882643,0.00048696875,0.00018120625,0.00031481948,0.0005820701,0.00093320553,0.009437607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989027,0.00032909267,0.00007380337,0.00020035794,0.00040843134,0.00008556443],"domain_scores_gemma":[0.9980963,0.00066896185,0.000101553145,0.0008012775,0.0002601633,0.00007159951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019034214,0.0007693098,0.00077355845,0.00048266473,0.0004867314,0.0009454213,0.001449593,0.0012693978,0.008446374],"category_scores_gemma":[0.0062990827,0.000528911,0.0007254038,0.0003652526,0.0013788687,0.0017971514,0.0033198253,0.0028028109,0.002914917],"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.00060680014,0.00014802419,0.0016033776,0.00019800062,0.000114125,0.0003808726,0.00015528743,0.3202751,0.026924089,0.09223756,0.024927229,0.53242946],"study_design_scores_gemma":[0.00004357203,0.000057972476,0.00009171865,0.000014993979,0.0000068330387,0.00011956733,0.000012031833,0.95270514,0.011373823,0.031387918,0.004174295,0.0000120983605],"about_ca_topic_score_codex":0.0006845062,"about_ca_topic_score_gemma":0.0013745577,"teacher_disagreement_score":0.008446374,"about_ca_system_score_codex":0.0006742837,"about_ca_system_score_gemma":0.0011134545,"threshold_uncertainty_score":0.02825588},"labels":[],"label_agreement":null},{"id":"W3176904788","doi":"10.1609/aaai.v35i5.16507","title":"Satisfiability and Algorithms for Non-uniform Random k-SAT","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI 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":"Satisfiability; Boolean satisfiability problem; Algorithm; Range (aeronautics); Benchmark (surveying); Maximum satisfiability problem; Mathematics; Class (philosophy); Computer science; Probability distribution; Theoretical computer science; Discrete mathematics; Boolean function; Artificial intelligence; Statistics","score_opus":0.06496425787849228,"score_gpt":0.29735266906284086,"score_spread":0.23238841118434858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176904788","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.01782356,0.0004043794,0.97348726,0.0012061757,0.00006688491,0.00019449096,0.00022413094,0.0015737438,0.0050193924],"genre_scores_gemma":[0.2439012,0.0004183554,0.74692214,0.00060048816,0.00018367103,0.0005853683,0.0012728542,0.0005146728,0.0056012636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99534935,0.0018961268,0.00037215816,0.0012666458,0.0006896262,0.000426231],"domain_scores_gemma":[0.981817,0.01402767,0.0009576076,0.0022368105,0.00069497287,0.0002658516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048905243,0.001191705,0.0014580619,0.0019058934,0.001555756,0.0028062635,0.0044021,0.0024642327,0.009257021],"category_scores_gemma":[0.031856913,0.0010676348,0.0027940592,0.003111766,0.0027555528,0.007120909,0.003948785,0.0040662447,0.0020569016],"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.00039787358,0.0003670802,0.0025852614,0.00061398145,0.00018945886,0.00017564392,0.00046133026,0.38996893,0.0022778634,0.4256324,0.009866674,0.16746354],"study_design_scores_gemma":[0.00009818301,0.000033454693,0.00020722226,0.000030906558,0.000031722087,0.00008708826,0.0000488328,0.65868205,0.0011880015,0.33806032,0.0015134428,0.00001880117],"about_ca_topic_score_codex":0.002845068,"about_ca_topic_score_gemma":0.0053034266,"teacher_disagreement_score":0.009257021,"about_ca_system_score_codex":0.0029006759,"about_ca_system_score_gemma":0.002595481,"threshold_uncertainty_score":0.030967832},"labels":[],"label_agreement":null},{"id":"W3176904855","doi":"10.1609/aaai.v35i15.17608","title":"On the Softmax Bottleneck of Recurrent Language Models","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Western Canada Research Grid; Compute Canada","keywords":"Perplexity; Softmax function; Bottleneck; Rank (graph theory); Computer science; Monotonic function; Word (group theory); Correlation; Language model; Mathematics; Artificial intelligence; Artificial neural network; Combinatorics","score_opus":0.10595509279220487,"score_gpt":0.2987821668527856,"score_spread":0.1928270740605807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176904855","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.04657959,0.001027933,0.94560826,0.0011210921,0.000071683986,0.000040622494,0.00020298081,0.0013047816,0.0040429565],"genre_scores_gemma":[0.88682276,0.001568538,0.10084964,0.000711217,0.0002605008,0.00026126314,0.0007769778,0.00054423045,0.00820482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973597,0.0014376523,0.00012610632,0.00043011765,0.00039904463,0.00024741777],"domain_scores_gemma":[0.9846042,0.012572356,0.00061916857,0.00092216616,0.0009699545,0.00031220246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0079770405,0.0014743031,0.0016187609,0.0009919953,0.00074653,0.0022423847,0.0020089229,0.0017783873,0.0034191245],"category_scores_gemma":[0.034188684,0.0012533242,0.0010970446,0.0009420485,0.0017594729,0.0062038903,0.0027034201,0.004213871,0.0014086008],"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.00049838657,0.0001229758,0.0017142933,0.0002429454,0.00013407345,0.00028243518,0.00031290035,0.7751242,0.0042505106,0.11632879,0.004117387,0.09687114],"study_design_scores_gemma":[0.000007196802,0.000026837593,0.00012213878,0.000014027517,0.000008133074,0.000020924734,0.000010464587,0.96591914,0.00077188737,0.03275678,0.00033236446,0.000009987245],"about_ca_topic_score_codex":0.0064134495,"about_ca_topic_score_gemma":0.004854272,"teacher_disagreement_score":0.0079770405,"about_ca_system_score_codex":0.0017141642,"about_ca_system_score_gemma":0.0015659424,"threshold_uncertainty_score":0.042187095},"labels":[],"label_agreement":null},{"id":"W3176913318","doi":"10.1609/aaai.v35i6.16680","title":"Convergence Analysis of No-Regret Bidding Algorithms in Repeated Auctions","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":16,"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":"Regret; Common value auction; Bidding; Nash equilibrium; Best response; Mathematical economics; Convergence (economics); Equilibrium selection; Computer science; Mathematical optimization; Sequence (biology); Iterated function; Mathematics; Repeated game; Economics; Game theory; Machine learning; Microeconomics; Statistics","score_opus":0.2145083290659143,"score_gpt":0.4085916857618047,"score_spread":0.1940833566958904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176913318","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.1127524,0.0011418003,0.8746548,0.0010648142,0.00010263872,0.00017461149,0.000095808675,0.00034345698,0.009669637],"genre_scores_gemma":[0.89867336,0.0005973688,0.09454784,0.00031434273,0.00011114269,0.0003336399,0.00017478097,0.00025430505,0.004993336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99353373,0.0036997567,0.00029666696,0.00064588495,0.0012179328,0.00060603913],"domain_scores_gemma":[0.9391504,0.049143318,0.0034668522,0.002420791,0.004440534,0.001378189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013653233,0.0014474563,0.0020374923,0.0014566462,0.0009678989,0.0021211589,0.0028035678,0.001822868,0.0027302813],"category_scores_gemma":[0.07371103,0.0008821498,0.0013464892,0.00087539473,0.0026017136,0.0032941003,0.0020416386,0.0027669535,0.0005652439],"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.00038341555,0.00021225521,0.00320736,0.0002048698,0.00016276422,0.0001298977,0.0002693112,0.82201266,0.0016125143,0.15239881,0.0016363402,0.017769793],"study_design_scores_gemma":[0.000014948259,0.000039692382,0.00015725763,0.0000139383865,0.000009104338,0.000020720598,0.000018868926,0.9700457,0.00024092298,0.029258685,0.00017182362,0.000008417214],"about_ca_topic_score_codex":0.00264258,"about_ca_topic_score_gemma":0.0014123754,"teacher_disagreement_score":0.013653233,"about_ca_system_score_codex":0.0022468367,"about_ca_system_score_gemma":0.0024404933,"threshold_uncertainty_score":0.07220608},"labels":[],"label_agreement":null},{"id":"W3177112732","doi":"10.1609/aaai.v35i13.17384","title":"Explaining Convolutional Neural Networks through Attribution-Based Input Sampling and Block-Wise Feature Aggregation","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":33,"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; Convolutional neural network; Artificial intelligence; Visualization; Aggregate (composite); Block (permutation group theory); Stability (learning theory); Machine learning; Sampling (signal processing); Data mining; Field (mathematics); Pattern recognition (psychology); Computer vision; Mathematics","score_opus":0.086346229526242,"score_gpt":0.3024044179087386,"score_spread":0.21605818838249663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3177112732","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.030400068,0.00025802018,0.9647959,0.00021092437,0.000024360284,0.00005616944,0.00021736429,0.003336333,0.000700828],"genre_scores_gemma":[0.6287213,0.0003399058,0.36658886,0.00014627479,0.00006585417,0.00015422095,0.0014638356,0.00043899074,0.0020806899],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992455,0.000210773,0.000053397067,0.00022741752,0.00018893408,0.00007403387],"domain_scores_gemma":[0.9974214,0.0012294065,0.0003228641,0.0006557928,0.0002953213,0.00007531013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013780035,0.001207529,0.00089143415,0.0016756065,0.00039471235,0.0013131246,0.0015031928,0.0009112044,0.002382057],"category_scores_gemma":[0.007203974,0.00044464032,0.0013997535,0.0013654128,0.0007236321,0.0025136694,0.0020131643,0.0013732237,0.00041661027],"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.00031637342,0.00014961134,0.009573424,0.00029759415,0.0002525497,0.00037914191,0.00067718007,0.34478068,0.014366686,0.033889588,0.005901011,0.58941615],"study_design_scores_gemma":[0.000015509739,0.000028571289,0.00077314314,0.000018392677,0.000036659192,0.000054479806,0.000034356737,0.9722076,0.004732583,0.020932315,0.0011546081,0.000011773851],"about_ca_topic_score_codex":0.0034428877,"about_ca_topic_score_gemma":0.005590203,"teacher_disagreement_score":0.0034428877,"about_ca_system_score_codex":0.0009639297,"about_ca_system_score_gemma":0.0008220707,"threshold_uncertainty_score":0.007968843},"labels":[],"label_agreement":null},{"id":"W3177140187","doi":"10.1609/aaai.v35i2.16266","title":"Deep Low-Contrast Image Enhancement using Structure Tensor Representation","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Image Enhancement 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":"Nexen (Canada)","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea","keywords":"Contrast (vision); Structure tensor; Image (mathematics); Computer science; Artificial intelligence; Representation (politics); Ground truth; Tensor (intrinsic definition); Pattern recognition (psychology); Function (biology); Deep learning; Image quality; Mathematics; Geometry","score_opus":0.05306238292628465,"score_gpt":0.3160405930976323,"score_spread":0.2629782101713477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3177140187","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.013465753,0.00043523873,0.98322994,0.00014929513,0.00004074439,0.0000395092,0.000058242047,0.0011084335,0.0014728158],"genre_scores_gemma":[0.32727867,0.0009413912,0.66280305,0.00036148026,0.00008248653,0.00009287911,0.00042266262,0.00035485488,0.007662553],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997745,0.000034253964,0.000009135814,0.00004626003,0.00009686753,0.00003884823],"domain_scores_gemma":[0.9996617,0.00009350967,0.00005739686,0.00006945961,0.00008816968,0.000029716162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006739355,0.0010658776,0.00071872567,0.0005861279,0.00022240535,0.00095881877,0.0010695684,0.0007901652,0.0020536028],"category_scores_gemma":[0.0012305212,0.00036353237,0.0007789328,0.00039221093,0.0005938081,0.0016372879,0.001174882,0.0017113334,0.00068212446],"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.00033810528,0.00020821302,0.0010820411,0.00036085927,0.0001429494,0.00024787415,0.00012715504,0.2968374,0.2044745,0.017015455,0.0049396297,0.47422576],"study_design_scores_gemma":[0.000010951836,0.000087158296,0.000271765,0.000017418262,0.000026410406,0.00012779517,0.000008666517,0.94449615,0.048471548,0.0040911795,0.0023771487,0.000013811542],"about_ca_topic_score_codex":0.0016863903,"about_ca_topic_score_gemma":0.0024295824,"teacher_disagreement_score":0.0020536028,"about_ca_system_score_codex":0.00060100644,"about_ca_system_score_gemma":0.00053343194,"threshold_uncertainty_score":0.006869912},"labels":[],"label_agreement":null},{"id":"W3177194733","doi":"10.1609/aaai.v35i1.16114","title":"Programmatic Strategies for Real-Time Strategy Games","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Division of Mathematical Sciences; Centro de Ciências Matemáticas Aplicadas à Indústria; Compute Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Canadian Institute for Advanced Research","keywords":"Computer science; Predictability; Rendering (computer graphics); Domain (mathematical analysis); Combinatorial game theory; Theoretical computer science; Game theory; Artificial intelligence; Sequential game","score_opus":0.09010801286729087,"score_gpt":0.32662128122570616,"score_spread":0.2365132683584153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3177194733","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.021437913,0.0000883714,0.9682571,0.00017679617,0.000026491909,0.00016685174,0.00008985316,0.002540695,0.0072160494],"genre_scores_gemma":[0.26983672,0.00015973598,0.7241328,0.000115230425,0.000013023309,0.000374791,0.0002392747,0.0005438028,0.004584599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993389,0.00023048632,0.00008518046,0.00010043317,0.00019635414,0.000048578353],"domain_scores_gemma":[0.9987985,0.0007913682,0.000100837875,0.00011356011,0.00014193552,0.000053739488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086641556,0.0006538654,0.00027651884,0.00047844616,0.00034147844,0.0012286806,0.0008997302,0.00052981067,0.0059814923],"category_scores_gemma":[0.0052462644,0.00032710776,0.0005379897,0.0002472602,0.0012832572,0.0011480865,0.0008648632,0.00094557396,0.0007058498],"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.00018944088,0.00022716651,0.0013204998,0.00067697396,0.00003864459,0.00025241362,0.0014349414,0.15090723,0.029209694,0.6371563,0.0036818634,0.17490482],"study_design_scores_gemma":[0.00013458308,0.00020919196,0.0003628393,0.00013684644,0.000045616896,0.00025239983,0.00024259367,0.70489305,0.031326234,0.20759663,0.05475943,0.00004062036],"about_ca_topic_score_codex":0.0016937687,"about_ca_topic_score_gemma":0.0024803728,"teacher_disagreement_score":0.0059814923,"about_ca_system_score_codex":0.0009847536,"about_ca_system_score_gemma":0.0011088591,"threshold_uncertainty_score":0.020010114},"labels":[],"label_agreement":null},{"id":"W3177337627","doi":"10.1609/aaai.v35i14.17524","title":"Analogy Training Multilingual Encoders","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"H. Lundbeck A/S; Natural Sciences and Engineering Research Council of Canada; Lundbeckfonden","keywords":"Analogy; Computer science; Natural language processing; Encoder; Sentence; Artificial intelligence; Word (group theory); Encoding (memory); Linguistics","score_opus":0.1549327852651082,"score_gpt":0.3235714892127046,"score_spread":0.16863870394759642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3177337627","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.115667626,0.0009706043,0.8475153,0.0006271271,0.00046754064,0.00021404286,0.0019656657,0.014179009,0.018393045],"genre_scores_gemma":[0.6646568,0.00045592684,0.30589476,0.0005907896,0.00018281084,0.00037676812,0.007655439,0.00094841246,0.019238245],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900913,0.00025353156,0.000058099322,0.00039853374,0.0001708732,0.00010978456],"domain_scores_gemma":[0.9984358,0.0005003202,0.000056443576,0.00042225956,0.00050428155,0.000080877595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001015749,0.0010339017,0.0006891218,0.0007829671,0.0006514318,0.00093922764,0.0015835892,0.0007290929,0.008361525],"category_scores_gemma":[0.0051741092,0.00047908642,0.00071251765,0.00076101866,0.0005236349,0.0027571202,0.0022122746,0.0019500481,0.0033467792],"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.00042951183,0.00039141937,0.0057171383,0.00039968904,0.0001915426,0.00041992485,0.000571743,0.09722338,0.02651792,0.04842462,0.03290292,0.7868102],"study_design_scores_gemma":[0.00009706498,0.00019301871,0.0010507299,0.00004141095,0.000082207196,0.0002309462,0.00020910343,0.90887725,0.025157444,0.042838965,0.021180509,0.000041312258],"about_ca_topic_score_codex":0.0041344627,"about_ca_topic_score_gemma":0.0115187215,"teacher_disagreement_score":0.008361525,"about_ca_system_score_codex":0.00070396037,"about_ca_system_score_gemma":0.0016038578,"threshold_uncertainty_score":0.027972043},"labels":[],"label_agreement":null},{"id":"W3177367299","doi":"10.1609/aaai.v35i16.17642","title":"Encoding Syntactic Knowledge in Transformer Encoder for Intent Detection and Slot Filling","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","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":"Vector Institute; University of Toronto","funders":"","keywords":"Computer science; Transformer; Security token; Encoder; Inference; Parsing; ENCODE; Artificial intelligence; F1 score; Benchmark (surveying); Speech recognition; Natural language processing; Pattern recognition (psychology); Voltage","score_opus":0.10334458186460796,"score_gpt":0.30684030738651535,"score_spread":0.2034957255219074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3177367299","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.054362,0.00093988294,0.9192593,0.0006301166,0.00034619583,0.00017081617,0.0018973151,0.016262673,0.0061316625],"genre_scores_gemma":[0.7286578,0.0007285285,0.2547856,0.00063996087,0.00014865183,0.00025772423,0.0050958595,0.00065417466,0.009031758],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996661,0.00006390001,0.000022084876,0.00012042218,0.000067646324,0.00005991189],"domain_scores_gemma":[0.99903786,0.00044446113,0.000055499975,0.00017598976,0.00023535256,0.000050918716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008568734,0.001278769,0.00077890756,0.0010714929,0.00033074844,0.0010134117,0.0017599377,0.00099521,0.0037246607],"category_scores_gemma":[0.0026806337,0.0005944632,0.0010689521,0.00077837816,0.0006323197,0.0035117152,0.0012100961,0.0018503837,0.0026583096],"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.00083239394,0.0005660716,0.008116238,0.00048465678,0.0001870096,0.00053865876,0.0005998186,0.08744125,0.04385919,0.021501485,0.023911053,0.8119622],"study_design_scores_gemma":[0.000037155678,0.00011222162,0.00093160715,0.000045746874,0.00012457451,0.00021327242,0.00006517791,0.9456095,0.025795275,0.02106118,0.0059620524,0.000042139534],"about_ca_topic_score_codex":0.0063129645,"about_ca_topic_score_gemma":0.011727501,"teacher_disagreement_score":0.0063129645,"about_ca_system_score_codex":0.0007399251,"about_ca_system_score_gemma":0.001708936,"threshold_uncertainty_score":0.01255244},"labels":[],"label_agreement":null},{"id":"W3177370677","doi":"10.1609/aaai.v35i18.17927","title":"Solving JumpIN’ Using Zero-Dependency Reinforcement Learning (Student Abstract)","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","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 Ottawa","funders":"","keywords":"Reinforcement learning; Computer science; Dependency grammar; Python (programming language); Interpretability; Dependency (UML); GRASP; Modular design; Backtracking; Artificial intelligence; Algorithm; Programming language","score_opus":0.08900379891208272,"score_gpt":0.31973577856656876,"score_spread":0.23073197965448605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3177370677","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.083978236,0.00004489669,0.89861715,0.00055446615,0.00008374641,0.0001521995,0.00014003154,0.005161967,0.011267314],"genre_scores_gemma":[0.75485533,0.00003053054,0.23882967,0.00024435742,0.000018102603,0.00019869833,0.00020036753,0.000342552,0.005280323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995264,0.00015073695,0.00002379836,0.00009524592,0.00011364688,0.00009010525],"domain_scores_gemma":[0.9986726,0.0008368267,0.00009559727,0.00016581727,0.00012398064,0.000105297695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012312967,0.0004995131,0.00049861835,0.00021385003,0.00034101517,0.00062768615,0.0014159429,0.0007629989,0.009138077],"category_scores_gemma":[0.004190159,0.0002826594,0.0005435396,0.00016121802,0.0011604445,0.0010450607,0.0016061073,0.0013831042,0.0007659168],"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.00049646624,0.0005175594,0.004018009,0.00023824483,0.000074755735,0.00025272518,0.00024789872,0.7808319,0.0077554705,0.06729143,0.007868478,0.13040714],"study_design_scores_gemma":[0.000028055094,0.00003289665,0.00012306955,0.0000049482173,0.0000030601364,0.000011366383,0.000006436433,0.98621714,0.0020900615,0.010748271,0.0007300874,0.0000045392594],"about_ca_topic_score_codex":0.0038585074,"about_ca_topic_score_gemma":0.0045918645,"teacher_disagreement_score":0.009138077,"about_ca_system_score_codex":0.00068585336,"about_ca_system_score_gemma":0.001234799,"threshold_uncertainty_score":0.030569911},"labels":[],"label_agreement":null},{"id":"W3177376760","doi":"10.1609/aaai.v35i17.17780","title":"Deeplite NeutrinoTM: A BlackBox Framework for Constrained Deep Learning Model Optimization","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Computational Physics and Python Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Deep learning; Artificial intelligence; Python (programming language); Software deployment; Benchmark (surveying); Pipeline (software); Machine learning; Leverage (statistics); Edge device; Software engineering; Cloud computing","score_opus":0.06545282396602257,"score_gpt":0.30902403594371675,"score_spread":0.24357121197769416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3177376760","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.0027099047,0.00048244908,0.967745,0.0005182892,0.00013043857,0.00006935949,0.0007111602,0.023315495,0.0043179635],"genre_scores_gemma":[0.12117351,0.000804308,0.85199124,0.0013136661,0.00012750392,0.0006740678,0.0038047298,0.010278699,0.009832185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945146,0.0001326253,0.000026623211,0.000103659826,0.00021645705,0.00006914867],"domain_scores_gemma":[0.9993868,0.00028112173,0.0000408608,0.00012715055,0.00011066084,0.000053412357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016605692,0.0015921444,0.0009100699,0.0005511766,0.00049082347,0.001556013,0.003165317,0.0018259422,0.014862496],"category_scores_gemma":[0.0044941194,0.001034552,0.0012747736,0.0005262187,0.0009912627,0.0023191771,0.0028349024,0.004513307,0.004769689],"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.00030983376,0.00016715076,0.0011176307,0.00046036323,0.00019846651,0.00018212832,0.00008630201,0.62170154,0.006644168,0.08278754,0.09150473,0.19484007],"study_design_scores_gemma":[0.000030407504,0.00002233821,0.000045514877,0.000021271024,0.000006602061,0.000026252708,0.0000046976625,0.97024554,0.0021516199,0.017241966,0.01019187,0.000011966137],"about_ca_topic_score_codex":0.005638758,"about_ca_topic_score_gemma":0.0129048405,"teacher_disagreement_score":0.014862496,"about_ca_system_score_codex":0.0014509783,"about_ca_system_score_gemma":0.0029647604,"threshold_uncertainty_score":0.04972005},"labels":[],"label_agreement":null},{"id":"W3181012797","doi":"10.1609/aaai.v36i6.20660","title":"Learning Expected Emphatic Traces for Deep RL","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","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":"McGill University","funders":"","keywords":"Computer science; Weighting; Scalability; Convergence (economics); Stability (learning theory); Artificial intelligence; Machine learning; Sampling (signal processing); Sample (material); Artificial neural network; Baseline (sea); Key (lock); Variance (accounting); Algorithm; Computer vision","score_opus":0.0655002341992619,"score_gpt":0.2902482295044936,"score_spread":0.22474799530523168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181012797","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.017422672,0.00008106986,0.98075575,0.00015527038,0.000023136465,0.00003076936,0.000045621113,0.0006974584,0.0007882821],"genre_scores_gemma":[0.80523545,0.00012708569,0.19023274,0.00018003,0.000041106767,0.0002207219,0.00024925347,0.0002416313,0.003472049],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994128,0.00019409033,0.000046568308,0.00013037371,0.00014491846,0.000071269256],"domain_scores_gemma":[0.9959472,0.0026691856,0.0003020169,0.00041096707,0.00046645055,0.00020416103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019976052,0.0010371582,0.00092167425,0.0006188543,0.00038452717,0.001056403,0.0017566192,0.0009589416,0.0025197698],"category_scores_gemma":[0.014162529,0.0007893209,0.00044504358,0.00043997524,0.0012043167,0.002203086,0.0019219276,0.0023268922,0.0004432451],"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.00016515538,0.00006257475,0.0009740539,0.00006988085,0.000033119835,0.00006179462,0.00010075701,0.9214735,0.0017543158,0.01815574,0.0007895121,0.056359705],"study_design_scores_gemma":[0.000005146296,0.000010983843,0.000027751237,0.0000030754709,0.0000014262631,0.0000036052381,0.0000032306486,0.99348336,0.00029969422,0.006070542,0.00008890963,0.0000022683914],"about_ca_topic_score_codex":0.0033657022,"about_ca_topic_score_gemma":0.0047495323,"teacher_disagreement_score":0.0033657022,"about_ca_system_score_codex":0.001159165,"about_ca_system_score_gemma":0.0014515277,"threshold_uncertainty_score":0.010564446},"labels":[],"label_agreement":null},{"id":"W3196522557","doi":"10.1609/aaai.v36i11.21459","title":"Fair Conformal Predictors for Applications in Medical Imaging","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI in cancer detection","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":"Polytechnique Montréal","funders":"","keywords":"Interpretability; Deep learning; Transparency (behavior); Artificial intelligence; Machine learning; Computer science; Data science; Field (mathematics); Mathematics; Computer security","score_opus":0.039484529412755605,"score_gpt":0.2989227623119308,"score_spread":0.2594382328991752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196522557","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.015645076,0.001620869,0.9675289,0.0036364428,0.00019636462,0.00012946484,0.00032183362,0.0017266901,0.009194402],"genre_scores_gemma":[0.70373625,0.0015735899,0.2883037,0.0007803549,0.0003616284,0.00030432714,0.0004539848,0.0004972211,0.003988916],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99376535,0.0032137327,0.00024392558,0.0007942237,0.0017727694,0.00021007273],"domain_scores_gemma":[0.9669369,0.024636736,0.0018334638,0.004196228,0.0018250569,0.00057165924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009625744,0.000785258,0.0007035261,0.0012190024,0.0009177375,0.0032151332,0.0014137931,0.0020138563,0.008816887],"category_scores_gemma":[0.081110805,0.0005352964,0.0006371563,0.0015424041,0.00267592,0.004022524,0.0039215623,0.0025401565,0.0014317525],"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.00058198743,0.00011329837,0.0075725922,0.00038542776,0.000083794796,0.0002962655,0.0007918758,0.30402938,0.0037131943,0.27626714,0.014800372,0.39136472],"study_design_scores_gemma":[0.000055451586,0.0001227609,0.0012061271,0.00016640515,0.000024529338,0.0002130716,0.00014828453,0.5560247,0.005946305,0.41476446,0.021274427,0.000053447377],"about_ca_topic_score_codex":0.0020889342,"about_ca_topic_score_gemma":0.0021094007,"teacher_disagreement_score":0.009625744,"about_ca_system_score_codex":0.0018489602,"about_ca_system_score_gemma":0.0016169862,"threshold_uncertainty_score":0.05090642},"labels":[],"label_agreement":null},{"id":"W3197581510","doi":"10.1609/aaai.v36i10.21306","title":"Retrieve, Caption, Generate: Visual Grounding for Enhancing Commonsense in Text Generation Models","year":2022,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Multimodal Machine Learning Applications","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 Waterloo","funders":"","keywords":"Commonsense reasoning; Closed captioning; Computer science; Fluency; Transformer; Commonsense knowledge; Generative grammar; Artificial intelligence; Natural language processing; Image (mathematics); Linguistics; Engineering; Knowledge extraction","score_opus":0.14225812018072292,"score_gpt":0.355538293976938,"score_spread":0.21328017379621506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197581510","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.0639674,0.0003749466,0.8950602,0.00070105185,0.00014972046,0.000375411,0.0012770433,0.026275108,0.01181908],"genre_scores_gemma":[0.546347,0.00019165024,0.44422346,0.00033235952,0.00005413192,0.00025086076,0.0025970975,0.0017165602,0.004286891],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994905,0.00020583704,0.000022940903,0.00013836006,0.000105896135,0.000036311787],"domain_scores_gemma":[0.9975936,0.0014932082,0.000108707005,0.0005459148,0.0001797743,0.00007880077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013963026,0.0011098958,0.0004023778,0.0009306184,0.00033361954,0.001447661,0.0015110457,0.0011145974,0.009763787],"category_scores_gemma":[0.007630596,0.00035376492,0.0007883688,0.00044507984,0.0008111649,0.0031746423,0.0017509143,0.0013877334,0.0020080646],"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.0006743526,0.00054421107,0.002388068,0.0007461716,0.000114208684,0.0006642825,0.0016763039,0.20927805,0.052570254,0.051779725,0.021898152,0.65766615],"study_design_scores_gemma":[0.00007672538,0.00016639703,0.0003832192,0.000042008494,0.00004611166,0.00020595377,0.0001560229,0.9070722,0.04190309,0.035865646,0.0140478015,0.000034911824],"about_ca_topic_score_codex":0.001896586,"about_ca_topic_score_gemma":0.003145586,"teacher_disagreement_score":0.009763787,"about_ca_system_score_codex":0.00065090926,"about_ca_system_score_gemma":0.0004935744,"threshold_uncertainty_score":0.032663107},"labels":[],"label_agreement":null},{"id":"W3197957534","doi":"10.1609/aaai.v36i3.20144","title":"UCTransNet: Rethinking the Skip Connections in U-Net from a Channel-Wise Perspective with Transformer","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":1017,"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":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Segmentation; Encoder; Computer science; Transformer; Channel (broadcasting); Artificial intelligence; Ambiguity; Pattern recognition (psychology); Computer network; Programming language; Engineering","score_opus":0.05825692916390028,"score_gpt":0.2837522452940704,"score_spread":0.2254953161301701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197957534","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.018278196,0.0007995296,0.95422214,0.00036775574,0.00025589447,0.00018716676,0.000626556,0.018794687,0.006468083],"genre_scores_gemma":[0.3752828,0.00092349853,0.6005806,0.0011831467,0.00015229046,0.0003979425,0.0041758064,0.0031478987,0.014156051],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951386,0.000076464836,0.000031520878,0.00019586443,0.0001006195,0.000081697435],"domain_scores_gemma":[0.99950445,0.00014031134,0.000036046757,0.00012935237,0.00013552315,0.00005425997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009794902,0.0019468497,0.0009192598,0.0013846443,0.0008036271,0.0017108921,0.0026340391,0.0015141375,0.006838202],"category_scores_gemma":[0.0022708965,0.0007149384,0.0010229752,0.0010647745,0.0011252648,0.0037321192,0.0025577997,0.001660747,0.0025336733],"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.0008064823,0.0002114551,0.0030221133,0.00049239973,0.00026049858,0.000554436,0.0004473291,0.12596741,0.030853208,0.041261807,0.033033814,0.76308906],"study_design_scores_gemma":[0.00004836182,0.00014876288,0.000571354,0.000058621365,0.000093789655,0.00026275005,0.00010308474,0.91971415,0.031600807,0.027438335,0.019910904,0.000049047198],"about_ca_topic_score_codex":0.01094941,"about_ca_topic_score_gemma":0.017903823,"teacher_disagreement_score":0.01094941,"about_ca_system_score_codex":0.0014239271,"about_ca_system_score_gemma":0.0019760835,"threshold_uncertainty_score":0.022876084},"labels":[],"label_agreement":null},{"id":"W3199348969","doi":"10.1609/aaai.v36i6.20567","title":"Deconvolutional Density Network: Modeling Free-Form Conditional Distributions","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Gaussian Processes and Bayesian Inference","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; University of Jinan; National Natural Science Foundation of China","keywords":"Deconvolution; Computer science; Curse of dimensionality; Discretization; Conditional probability distribution; A priori and a posteriori; Algorithm; Artificial neural network; Density estimation; Artificial intelligence; Multivariate statistics; Machine learning; Data mining; Mathematics; Statistics","score_opus":0.05418182185245969,"score_gpt":0.26589894993699853,"score_spread":0.21171712808453885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199348969","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.0060431994,0.0001934106,0.9923034,0.00015446941,0.000020423233,0.000019924859,0.00009335865,0.0003356467,0.00083626155],"genre_scores_gemma":[0.46202946,0.00076664786,0.52966106,0.00035973932,0.00008109189,0.00020211267,0.0006811974,0.00017794482,0.006040755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948055,0.00019740628,0.000020676214,0.00012377379,0.00012714902,0.000050441122],"domain_scores_gemma":[0.9983032,0.0010397903,0.00012373448,0.00017164617,0.00029695526,0.000064618325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021442499,0.0006827699,0.00074584916,0.00070864114,0.0003911913,0.0008653281,0.0019672418,0.0012372531,0.0017191332],"category_scores_gemma":[0.0068656737,0.0005107472,0.00071897643,0.00086562295,0.0009659624,0.0020131827,0.001394484,0.0018510786,0.00044725958],"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.00011282049,0.00004605517,0.001592088,0.000067249624,0.000057871104,0.000078505676,0.0000757623,0.8842573,0.0015684008,0.031723708,0.0021397902,0.07828035],"study_design_scores_gemma":[0.0000023264324,0.0000028812715,0.00007099394,0.0000036180625,0.0000027219405,0.000012378168,0.000002473354,0.99395645,0.00029727045,0.005324978,0.0003200004,0.000003856181],"about_ca_topic_score_codex":0.014450202,"about_ca_topic_score_gemma":0.011166758,"teacher_disagreement_score":0.014450202,"about_ca_system_score_codex":0.0013360038,"about_ca_system_score_gemma":0.001586144,"threshold_uncertainty_score":0.02873218},"labels":[],"label_agreement":null},{"id":"W3200439183","doi":"10.1609/aaai.v36i10.21322","title":"BROS: A Pre-trained Language Model Focusing on Text and Layout for Better Key Information Extraction from Documents","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":120,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science; Key (lock); Natural language processing; Task (project management); Space (punctuation); Artificial intelligence; Masking (illustration); Information extraction; Language model; Semantics (computer science); Information retrieval","score_opus":0.048441363007867104,"score_gpt":0.30151575368776345,"score_spread":0.25307439067989634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200439183","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.043104798,0.0021887997,0.8723886,0.00068919855,0.00078602467,0.0005605002,0.005868124,0.06819866,0.006215296],"genre_scores_gemma":[0.22315226,0.0010481264,0.7164442,0.0010954649,0.00030570364,0.0008425877,0.031557124,0.0015298598,0.024024662],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923694,0.00013983996,0.000054848515,0.0003145583,0.00015370181,0.00010027124],"domain_scores_gemma":[0.9984743,0.0005983987,0.0000996888,0.00029208214,0.00043663575,0.00009887557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013993804,0.0024418077,0.0012953564,0.0025173642,0.00048492948,0.0013910056,0.0030158896,0.0017846104,0.0070207887],"category_scores_gemma":[0.002824639,0.0007798419,0.0017080479,0.0013679581,0.00053632597,0.003953326,0.0016076664,0.002628723,0.007925421],"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.0007048042,0.00047096546,0.0018206452,0.0007721414,0.00030838017,0.000304377,0.00018479241,0.05006388,0.051830184,0.0038378895,0.06878596,0.82091606],"study_design_scores_gemma":[0.00012734489,0.0002765126,0.0010898325,0.000057267785,0.000093224844,0.0002668659,0.00013018564,0.9455866,0.03200076,0.0027934627,0.017493302,0.0000846174],"about_ca_topic_score_codex":0.01229339,"about_ca_topic_score_gemma":0.022686183,"teacher_disagreement_score":0.01229339,"about_ca_system_score_codex":0.0008689368,"about_ca_system_score_gemma":0.0022086063,"threshold_uncertainty_score":0.024443686},"labels":[],"label_agreement":null},{"id":"W3200731348","doi":"10.1609/aaai.v36i5.20452","title":"Generalized Dynamic Cognitive Hierarchy Models for Strategic Driving Behavior","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Cognitive Science and Mapping","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":"Bounded rationality; Computer science; Satisficing; Hierarchy; Population; Bounded function; Game theory; Artificial intelligence; Management science; Mathematical economics; Mathematics; Engineering; Economics","score_opus":0.1370598135374808,"score_gpt":0.3292617432872713,"score_spread":0.1922019297497905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200731348","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.06822989,0.00047747296,0.9107646,0.0012409593,0.00006066634,0.00011151536,0.0005091326,0.00032979503,0.01827605],"genre_scores_gemma":[0.9064704,0.00026498435,0.08862141,0.00018376681,0.000036559242,0.000233204,0.0003012708,0.000045858884,0.0038426318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904174,0.0004637986,0.000043476146,0.00018107427,0.00012409403,0.00014574641],"domain_scores_gemma":[0.99792576,0.0011907934,0.000273156,0.00019638489,0.0002363233,0.00017755674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001387921,0.0007910772,0.00055941654,0.00093093415,0.0006508252,0.001681514,0.0016249168,0.00096158247,0.004055884],"category_scores_gemma":[0.005344356,0.00028493736,0.0010860949,0.000768402,0.0014770854,0.0022120576,0.0012303231,0.0013615063,0.00051071675],"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.00004106567,0.000040411425,0.0017296418,0.00007146349,0.00005644764,0.0001293738,0.000835193,0.3833161,0.00085452944,0.59933746,0.0016406142,0.011947587],"study_design_scores_gemma":[0.0000104431365,0.000018820572,0.00031480673,0.00000785688,0.000009714775,0.000023024462,0.00009164296,0.6534891,0.000058940597,0.3444562,0.0015083692,0.000011073237],"about_ca_topic_score_codex":0.019003123,"about_ca_topic_score_gemma":0.017632458,"teacher_disagreement_score":0.019003123,"about_ca_system_score_codex":0.0023722574,"about_ca_system_score_gemma":0.001412867,"threshold_uncertainty_score":0.037785053},"labels":[],"label_agreement":null},{"id":"W3203627589","doi":"10.1609/aaai.v36i1.19958","title":"Convolutional Neural Network Compression through Generalized Kronecker Product Decomposition","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Neural Network Applications","field":"Computer Science","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":"Huawei Technologies (Canada); University of Waterloo","funders":"","keywords":"Convolutional neural network; Computer science; Kronecker product; Kronecker delta; Decomposition; Pruning; Convolution (computer science); Layer (electronics); Tensor product; Algorithm; Artificial intelligence; Pattern recognition (psychology); Artificial neural network; Mathematics","score_opus":0.07785216731124393,"score_gpt":0.3236004177940165,"score_spread":0.24574825048277255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203627589","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.050261,0.00060289155,0.94261765,0.00023734763,0.000116958305,0.00005428899,0.00028177776,0.0018442535,0.0039838282],"genre_scores_gemma":[0.5003103,0.001041218,0.49017006,0.00025371622,0.00014641474,0.00017189365,0.0014389681,0.00036877004,0.0060986513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996093,0.00007924137,0.000030987834,0.000054927117,0.00018217547,0.00004335845],"domain_scores_gemma":[0.99932075,0.00016090675,0.000060797745,0.00027415756,0.00015515761,0.000028290948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006089232,0.00081241655,0.0004978998,0.0008137837,0.00024170431,0.0007105251,0.0006638843,0.0004152453,0.0023035202],"category_scores_gemma":[0.0021422359,0.00021997561,0.00044406677,0.001042593,0.00058909593,0.0016129054,0.00088076823,0.0010835882,0.0008848352],"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.00032577556,0.0001466257,0.0011478252,0.00019090033,0.000075895885,0.0003711773,0.00016722808,0.32176813,0.04680615,0.07818515,0.0123178465,0.5384972],"study_design_scores_gemma":[0.000017075516,0.00007175074,0.00028203137,0.000017888366,0.0000143002835,0.00015065649,0.000026462112,0.95506823,0.0187549,0.021102773,0.004479878,0.000013988667],"about_ca_topic_score_codex":0.0019593756,"about_ca_topic_score_gemma":0.0026227443,"teacher_disagreement_score":0.0023035202,"about_ca_system_score_codex":0.00038368773,"about_ca_system_score_gemma":0.0007307101,"threshold_uncertainty_score":0.0077059865},"labels":[],"label_agreement":null},{"id":"W3205784920","doi":"10.1609/aaai.v36i8.20874","title":"Hindsight Network Credit Assignment: Efficient Credit Assignment in Networks of Discrete Stochastic Units","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Backpropagation; Hindsight bias; Computer science; Estimator; Artificial neural network; Function (biology); Artificial intelligence; Variance (accounting); Mathematical optimization; Mathematics; Economics; Statistics","score_opus":0.05522808581807579,"score_gpt":0.26579053390657126,"score_spread":0.21056244808849547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205784920","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.0401289,0.00023062556,0.9566074,0.0004872998,0.00005142405,0.00006264723,0.000051313775,0.00057523395,0.0018051497],"genre_scores_gemma":[0.8321287,0.00016658711,0.16272567,0.00027882238,0.0000717768,0.00014049382,0.000117424606,0.00012572762,0.004244805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993881,0.00023453688,0.000028571296,0.00016172206,0.00011826492,0.00006869511],"domain_scores_gemma":[0.997335,0.0015309533,0.00026052474,0.00039628736,0.00032113958,0.00015604043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00160755,0.0007257184,0.0009809892,0.0004872098,0.000568132,0.00090773473,0.0018348973,0.0014402672,0.002951315],"category_scores_gemma":[0.011276164,0.00042118967,0.00035917346,0.0005810005,0.0013579077,0.0022746183,0.0016657336,0.00221707,0.0003814777],"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.0001502948,0.000102349244,0.0019400418,0.00008976909,0.00004715275,0.00007141021,0.00015708037,0.7990278,0.0028948733,0.046138298,0.0023935686,0.14698733],"study_design_scores_gemma":[0.0000074875975,0.0000145413005,0.00009382362,0.000005043309,0.000003416339,0.000010098627,0.000005017878,0.98277307,0.0007519485,0.01603604,0.0002955383,0.0000039915117],"about_ca_topic_score_codex":0.0047247396,"about_ca_topic_score_gemma":0.0051205335,"teacher_disagreement_score":0.0047247396,"about_ca_system_score_codex":0.0012327672,"about_ca_system_score_gemma":0.0013168945,"threshold_uncertainty_score":0.009873152},"labels":[],"label_agreement":null},{"id":"W3206580908","doi":"10.1609/aaai.v36i4.20293","title":"Finding Backdoors to Integer Programs: A Monte Carlo Tree Search Framework","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Backdoor; Computer science; Integer programming; Benchmark (surveying); Search tree; Monte Carlo method; Theoretical computer science; Tree (set theory); Integer (computer science); Mathematical optimization; Algorithm; Mathematics; Search algorithm; Combinatorics","score_opus":0.09239255901222973,"score_gpt":0.3095931301770247,"score_spread":0.217200571164795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206580908","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.009297681,0.00056969567,0.9856574,0.0004959896,0.00005011295,0.00010911375,0.00015263741,0.0006339921,0.003033358],"genre_scores_gemma":[0.28611684,0.00077157776,0.7077187,0.00054028543,0.00016162201,0.0006080391,0.0007453244,0.00046530936,0.0028722992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786645,0.0010630015,0.00007043822,0.00024790803,0.0005340462,0.00021830351],"domain_scores_gemma":[0.99210405,0.006302189,0.00043778308,0.00044553037,0.0004761122,0.00023422808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035736896,0.0011238444,0.001689828,0.0019315521,0.0008755324,0.002258711,0.0021712822,0.002180073,0.004369562],"category_scores_gemma":[0.015019883,0.0010776289,0.0020661603,0.0023950327,0.0020576809,0.0026007276,0.0019159748,0.0035477018,0.0007582858],"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.00008766163,0.00008161157,0.0008639908,0.00009445762,0.00006287124,0.00007107673,0.00007059412,0.88414174,0.0004988604,0.07928481,0.002482503,0.032259848],"study_design_scores_gemma":[0.000010266414,0.000013059373,0.00002917381,0.000012004933,0.000005687475,0.000011073383,0.000006113454,0.97790295,0.00009919809,0.021277657,0.0006287403,0.0000041269004],"about_ca_topic_score_codex":0.006026135,"about_ca_topic_score_gemma":0.008624146,"teacher_disagreement_score":0.006026135,"about_ca_system_score_codex":0.0019360044,"about_ca_system_score_gemma":0.0032623378,"threshold_uncertainty_score":0.01889968},"labels":[],"label_agreement":null},{"id":"W3206689743","doi":"10.1609/aaai.v36i10.21323","title":"Non-autoregressive Translation with Layer-Wise Prediction and Deep Supervision","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"DeepMind; Compute Canada; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Machine translation; Autoregressive model; Inference; Computer science; Transformer; Translation (biology); Artificial intelligence; BLEU; Machine learning; Artificial neural network; Econometrics; Mathematics; Engineering; Voltage","score_opus":0.0423277031369836,"score_gpt":0.27712261504520214,"score_spread":0.23479491190821855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206689743","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.028847024,0.000791526,0.9558993,0.0006366577,0.00016729532,0.0000441655,0.00041541594,0.010020923,0.0031776077],"genre_scores_gemma":[0.59602934,0.00069856405,0.3899154,0.0006215579,0.0001546311,0.00012685747,0.0022250288,0.0008105575,0.009418105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999355,0.00020821848,0.00004157683,0.00019840493,0.000121128774,0.00007557603],"domain_scores_gemma":[0.99877983,0.0005356051,0.000081240796,0.00033267296,0.00023023505,0.000040421208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014790496,0.0012805478,0.00094479905,0.00046928035,0.00036132854,0.0010189813,0.0016574621,0.0009317367,0.0037028277],"category_scores_gemma":[0.0040768213,0.0006318384,0.00086679915,0.00093192945,0.0005970473,0.0029029024,0.0008473796,0.0024492305,0.0030955211],"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.0005713195,0.00024493333,0.0020303228,0.000279758,0.00027123804,0.00023672223,0.00014310445,0.4186108,0.022998648,0.015538066,0.016393077,0.522682],"study_design_scores_gemma":[0.000021228372,0.00003695814,0.00014628774,0.000008317203,0.000029976689,0.00004081513,0.000008987125,0.9868786,0.0057700523,0.0058199954,0.0012300942,0.0000087162625],"about_ca_topic_score_codex":0.008760117,"about_ca_topic_score_gemma":0.015741238,"teacher_disagreement_score":0.008760117,"about_ca_system_score_codex":0.000643138,"about_ca_system_score_gemma":0.0016774439,"threshold_uncertainty_score":0.017418265},"labels":[],"label_agreement":null},{"id":"W3206932362","doi":"10.1609/aaai.v35i5.16534","title":"Graph-Enhanced Multi-Task Learning of Multi-Level Transition Dynamics for Session-based Recommendation","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":105,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; Wilfrid Laurier University","funders":"Science and Technology Planning Project of Guangdong Province; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Session (web analytics); Graph; Interdependence; Relation (database); Task (project management); Dynamics (music); Context (archaeology); Transition (genetics); Encoder; Embedding; Machine learning; Artificial intelligence; Theoretical computer science; Data mining; World Wide Web","score_opus":0.1274622808664918,"score_gpt":0.33038982320967747,"score_spread":0.20292754234318566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206932362","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.047771372,0.0008796177,0.94805545,0.00029988668,0.000057755162,0.0000544922,0.00032293444,0.0015783918,0.0009801008],"genre_scores_gemma":[0.8632634,0.00047271128,0.13008942,0.0002962768,0.00010285221,0.00012098547,0.0013768352,0.00015568062,0.004121794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993864,0.00017244543,0.000028210281,0.00025111728,0.00008549614,0.0000762211],"domain_scores_gemma":[0.9981456,0.001124444,0.00015345738,0.00025580556,0.0002067231,0.000114041904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010659335,0.00085256255,0.0010695532,0.00090650783,0.00040666515,0.00058983924,0.001840794,0.0013972444,0.001978595],"category_scores_gemma":[0.0043748366,0.0005918014,0.0011205967,0.0014154973,0.00047340983,0.0019807373,0.0009838683,0.002137188,0.00087404036],"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.00047354,0.00048259363,0.007603698,0.0002581927,0.00029211133,0.00021671725,0.00031898767,0.6250968,0.011373321,0.012092934,0.007402984,0.3343882],"study_design_scores_gemma":[0.000006784283,0.000027859414,0.0004358349,0.00000286029,0.000013705243,0.00001515888,0.000006423413,0.99490696,0.0003925021,0.003926455,0.0002594665,0.0000059488957],"about_ca_topic_score_codex":0.014313444,"about_ca_topic_score_gemma":0.024099104,"teacher_disagreement_score":0.014313444,"about_ca_system_score_codex":0.00087783247,"about_ca_system_score_gemma":0.00091779785,"threshold_uncertainty_score":0.028460205},"labels":[],"label_agreement":null},{"id":"W3207058314","doi":"10.1609/aaai.v36i10.21308","title":"Language Modelling via Learning to Rank","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Vector Institute","funders":"Natural Sciences and Engineering Research Council of Canada; Vector Institute","keywords":"Perplexity; Computer science; Language model; Transformer; Natural language processing; Artificial intelligence; Probabilistic logic; Entropy (arrow of time); Machine learning; Rank (graph theory); Ranking (information retrieval); Mathematics","score_opus":0.07286834451957244,"score_gpt":0.28741439635267724,"score_spread":0.2145460518331048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207058314","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.010537541,0.0004543177,0.97929907,0.0006839253,0.00008723248,0.000057340316,0.0005436781,0.00526363,0.0030733286],"genre_scores_gemma":[0.5003977,0.00069935026,0.4775813,0.0007265804,0.00033677623,0.0003972575,0.0039788596,0.000930877,0.014951234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811816,0.00091365754,0.000082174935,0.00043769053,0.00030636313,0.0001418636],"domain_scores_gemma":[0.99527234,0.0030164823,0.00026062346,0.00070657424,0.0006019359,0.0001420862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019977742,0.0013080755,0.00088231545,0.0013111987,0.0006316051,0.0022150867,0.0019199764,0.0014070261,0.0056891777],"category_scores_gemma":[0.009500859,0.00048622064,0.0011224215,0.0009962915,0.00077642064,0.0030659896,0.0018350378,0.0025154396,0.005738337],"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.00023750037,0.00016835357,0.0016680283,0.0002890913,0.00013990144,0.00017526273,0.000270066,0.46762595,0.004981708,0.045905877,0.018819053,0.45971927],"study_design_scores_gemma":[0.000013242231,0.00003437788,0.00010705865,0.000012718179,0.000010389496,0.000034491244,0.000019893509,0.95900536,0.0017184786,0.0369519,0.0020763117,0.000015744055],"about_ca_topic_score_codex":0.0049154665,"about_ca_topic_score_gemma":0.008937541,"teacher_disagreement_score":0.0056891777,"about_ca_system_score_codex":0.0010604989,"about_ca_system_score_gemma":0.001312722,"threshold_uncertainty_score":0.01903218},"labels":[],"label_agreement":null},{"id":"W3207257408","doi":"10.1609/aaai.v35i5.16576","title":"Knowledge-Enhanced Hierarchical Graph Transformer Network for Multi-Behavior Recommendation","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":227,"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":"Science and Technology Planning Project of Guangdong Province; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Recommender system; Embedding; Graph; Information retrieval; Human–computer interaction; Artificial intelligence; Theoretical computer science","score_opus":0.14926738950897395,"score_gpt":0.3568089371099405,"score_spread":0.20754154760096655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207257408","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.035872597,0.0013218044,0.9539064,0.0005340898,0.00009712817,0.00008360564,0.0011256153,0.002986872,0.0040719174],"genre_scores_gemma":[0.79752916,0.0011531698,0.18598804,0.0005695293,0.000091701746,0.00018950409,0.0036746613,0.00018778008,0.010616378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997131,0.000063845575,0.000012678145,0.000114279836,0.000057064415,0.000039036506],"domain_scores_gemma":[0.9994665,0.0002541886,0.00004895879,0.000089935886,0.000109173976,0.00003130367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004162627,0.0009068374,0.0006761801,0.0008256477,0.00029131758,0.0005294563,0.0015876263,0.0009403116,0.0030471815],"category_scores_gemma":[0.0022657274,0.0004937991,0.0008920621,0.0012307363,0.00037368338,0.0014861659,0.00076142274,0.0014075703,0.0011301355],"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.00024274628,0.00023340073,0.0034021975,0.00024651372,0.00021250163,0.00017887034,0.00014381217,0.57427675,0.0070780567,0.013941272,0.010665179,0.38937876],"study_design_scores_gemma":[0.0000058507107,0.000019197889,0.00024779447,0.000006007786,0.000018577213,0.00002091335,0.000007054249,0.9932073,0.0004890112,0.0054465374,0.0005264207,0.000005301882],"about_ca_topic_score_codex":0.024996009,"about_ca_topic_score_gemma":0.04138912,"teacher_disagreement_score":0.024996009,"about_ca_system_score_codex":0.0011248516,"about_ca_system_score_gemma":0.0007924202,"threshold_uncertainty_score":0.049701035},"labels":[],"label_agreement":null},{"id":"W3208296466","doi":"10.1609/aaai.v36i8.20891","title":"Convergence and Optimality of Policy Gradient Methods in Weakly Smooth Settings","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Convergence (economics); Gradient method; Computer science; Mathematical optimization; Applied mathematics; Work (physics); Rate of convergence; Mathematics; Economics; Physics; Telecommunications","score_opus":0.23281244621401168,"score_gpt":0.4911329585570102,"score_spread":0.2583205123429986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208296466","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.024333846,0.00069754344,0.96709543,0.00079798297,0.0000519944,0.000095849,0.000049879072,0.00019098862,0.0066864435],"genre_scores_gemma":[0.74499625,0.0016573153,0.24335086,0.00039185557,0.00015135536,0.0005825658,0.0001745735,0.00040702787,0.008288264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973193,0.0015876562,0.000104668565,0.00029440335,0.000482801,0.0002112402],"domain_scores_gemma":[0.9853217,0.011930564,0.0005757585,0.0005202619,0.0011777256,0.00047395058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007945873,0.0013141794,0.0013431452,0.0015333273,0.00080532127,0.0022870742,0.0011249,0.0018420113,0.0026661353],"category_scores_gemma":[0.04089117,0.00068418763,0.0010899184,0.0006457492,0.0038677647,0.002685139,0.003990862,0.0036292989,0.0006911429],"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.00017910125,0.00008575827,0.0013092085,0.00023819493,0.000054035765,0.00012371824,0.00034206643,0.47748497,0.0019947544,0.49006218,0.0016029832,0.026523076],"study_design_scores_gemma":[0.000018012503,0.000034773922,0.00013364243,0.000039520946,0.0000057221537,0.00001636267,0.00002437124,0.9075592,0.00045217722,0.09120892,0.00049818755,0.000009193886],"about_ca_topic_score_codex":0.0023595372,"about_ca_topic_score_gemma":0.001065901,"teacher_disagreement_score":0.007945873,"about_ca_system_score_codex":0.0016785525,"about_ca_system_score_gemma":0.0023186046,"threshold_uncertainty_score":0.042022347},"labels":[],"label_agreement":null},{"id":"W3213051863","doi":"10.1609/aaai.v36i7.20749","title":"The Role of Adaptive Optimizers for Honest Private Hyperparameter Selection","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":14,"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":"Hyperparameter; Computer science; Machine learning; Hyperparameter optimization; Artificial intelligence; Selection (genetic algorithm); Set (abstract data type); Support vector machine","score_opus":0.0663728056188518,"score_gpt":0.28269165460683227,"score_spread":0.21631884898798048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213051863","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.013402331,0.00031407413,0.9828729,0.00073084864,0.00005350793,0.000059168655,0.000024278577,0.0003611515,0.0021817186],"genre_scores_gemma":[0.63239175,0.0006536309,0.3598167,0.0010224462,0.00026362683,0.00036466456,0.00010894927,0.0006084607,0.0047697793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98992187,0.0060556694,0.00046329622,0.0013766257,0.0017085279,0.00047401412],"domain_scores_gemma":[0.9745788,0.016148107,0.0018803803,0.005511014,0.0011333685,0.0007484288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013499426,0.0015789157,0.0018123033,0.00067141,0.00094233535,0.0030005306,0.0027031978,0.0027242105,0.0023974858],"category_scores_gemma":[0.06268795,0.0009590134,0.0009369414,0.00063659396,0.0052318014,0.0058771,0.005206833,0.0063552875,0.0010076689],"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.0005141865,0.00013431764,0.0025002433,0.00024412505,0.0001702544,0.0003546329,0.00049404876,0.40093344,0.011209581,0.49537745,0.0038412253,0.084226504],"study_design_scores_gemma":[0.00004832659,0.00009224238,0.0001472176,0.000042467866,0.000018169976,0.000101157435,0.000036278434,0.8272002,0.0044896007,0.16589962,0.0018999228,0.00002476425],"about_ca_topic_score_codex":0.00037130012,"about_ca_topic_score_gemma":0.00032208904,"teacher_disagreement_score":0.013499426,"about_ca_system_score_codex":0.0012840342,"about_ca_system_score_gemma":0.0018395518,"threshold_uncertainty_score":0.071392655},"labels":[],"label_agreement":null},{"id":"W3213163682","doi":"10.1609/aaai.v35i2.16250","title":"Exploiting Relationship for Complex-scene Image Generation","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Scene graph; Computer science; Generator (circuit theory); Artificial intelligence; Discriminator; Object (grammar); Generative grammar; Spatial relation; Image (mathematics); Computer vision; Semantics (computer science); Graph; Consistency (knowledge bases); Pattern recognition (psychology); Theoretical computer science","score_opus":0.2131523915101248,"score_gpt":0.3214655293031366,"score_spread":0.1083131377930118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213163682","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.016601818,0.00019886596,0.9794023,0.00018711666,0.00003391599,0.00004356565,0.000084039,0.0012935144,0.0021548788],"genre_scores_gemma":[0.6511813,0.0002884475,0.34071618,0.00053209905,0.00005562729,0.00013835423,0.00069883035,0.00064493774,0.0057441825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996549,0.00009222091,0.000009421013,0.00012816579,0.00007926826,0.000036097386],"domain_scores_gemma":[0.9994836,0.00026283026,0.00005405421,0.00010860884,0.000056572146,0.00003428952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064023095,0.0008590615,0.00048609386,0.00045415835,0.00025279482,0.0006040858,0.0011728683,0.00077941397,0.0027823057],"category_scores_gemma":[0.0016379039,0.0004474617,0.0006331073,0.00036902382,0.0006349425,0.0009832756,0.0011083696,0.0011785406,0.00076299236],"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.00016544954,0.000104004364,0.0012279411,0.00012521344,0.000067077744,0.00031226865,0.00017508851,0.72532505,0.030031646,0.020480296,0.00587942,0.21610668],"study_design_scores_gemma":[0.000007104252,0.000017294915,0.000102275626,0.000003937818,0.00000627575,0.00005526725,0.0000084124695,0.99002457,0.0031127776,0.0056156972,0.0010414267,0.0000050679696],"about_ca_topic_score_codex":0.0017196105,"about_ca_topic_score_gemma":0.0029183729,"teacher_disagreement_score":0.0027823057,"about_ca_system_score_codex":0.0006567677,"about_ca_system_score_gemma":0.00036275105,"threshold_uncertainty_score":0.009307742},"labels":[],"label_agreement":null},{"id":"W3213716849","doi":"10.1609/aaai.v36i11.21559","title":"Introducing Variational Autoencoders to High School Students","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Generative Adversarial Networks and Image Synthesis","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":"Generative grammar; Computer science; Artificial intelligence; Deep learning; Metaphor; Curriculum; Field (mathematics); The arts; Mathematics education; Visual arts; Sociology; Psychology; Mathematics; Pedagogy; Art","score_opus":0.037293034625104596,"score_gpt":0.27852846016074256,"score_spread":0.24123542553563798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213716849","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.715894,0.0008758639,0.17799602,0.008377617,0.0006690148,0.0011187725,0.0004456332,0.002967364,0.09165576],"genre_scores_gemma":[0.7901584,0.00097230845,0.16146688,0.0017928855,0.00010560142,0.0008108786,0.00044885123,0.000349542,0.04389474],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99916434,0.0002994885,0.000043206725,0.00015409556,0.00012631051,0.00021261029],"domain_scores_gemma":[0.99821883,0.00075281406,0.000093182556,0.0001312369,0.00024838775,0.00055562623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014919754,0.0013675139,0.00059432274,0.00058377767,0.0013609126,0.0029662917,0.0016396021,0.0016858355,0.013460904],"category_scores_gemma":[0.0039801695,0.00046358135,0.00068386365,0.00030113154,0.0014530005,0.0019445679,0.002898809,0.0031935652,0.0028329056],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008943196,0.026121393,0.03527683,0.0018874389,0.00011589044,0.0038955063,0.052075855,0.034694985,0.055666756,0.13918322,0.111324735,0.5388631],"study_design_scores_gemma":[0.00045122282,0.005821615,0.015186402,0.0012220423,0.00010547606,0.0026423063,0.029085474,0.08489212,0.06748374,0.16010009,0.6326697,0.00033988376],"about_ca_topic_score_codex":0.0010541431,"about_ca_topic_score_gemma":0.0026569953,"teacher_disagreement_score":0.013460904,"about_ca_system_score_codex":0.0011123832,"about_ca_system_score_gemma":0.0010687633,"threshold_uncertainty_score":0.04503119},"labels":[],"label_agreement":null},{"id":"W3216138846","doi":"10.1609/aaai.v36i6.20570","title":"Clustering Interval-Censored Time-Series for Disease Phenotyping","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning in Healthcare","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":"Michael J. Fox Foundation for Parkinson's Research; National Science Foundation","keywords":"Censoring (clinical trials); Computer science; Cluster analysis; Time series; Machine learning; Artificial intelligence; Robustness (evolution); Data mining; Pattern recognition (psychology); Statistics; Mathematics","score_opus":0.06313939212152986,"score_gpt":0.31034072463362816,"score_spread":0.2472013325120983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216138846","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.05191746,0.00063274696,0.9450918,0.0006756726,0.00005553004,0.00003512062,0.000522888,0.00064699707,0.00042183534],"genre_scores_gemma":[0.8189285,0.0007134354,0.17600216,0.00031199236,0.000133928,0.000106778025,0.0022938377,0.00014100321,0.00136841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987827,0.0005653294,0.000070269634,0.0003512112,0.00015940814,0.00007112678],"domain_scores_gemma":[0.99184215,0.005521746,0.0008049883,0.0012207854,0.00036434122,0.00024612554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004804688,0.0005333905,0.0008709813,0.0011260132,0.000412257,0.0009762276,0.0017146555,0.0012899032,0.0011334113],"category_scores_gemma":[0.015456447,0.00034994847,0.0009179124,0.0015084917,0.001076513,0.0011231856,0.0010951171,0.002257814,0.00041423278],"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.00029656087,0.0001351636,0.027976112,0.00018926375,0.00019010092,0.00022946343,0.00042836962,0.8321831,0.0051268423,0.031982645,0.0035954998,0.09766693],"study_design_scores_gemma":[0.0000075441435,0.000020426281,0.0020824517,0.000012019276,0.000012794124,0.000046601486,0.000019855877,0.9766327,0.0007545561,0.019748436,0.00064859574,0.00001406291],"about_ca_topic_score_codex":0.003657267,"about_ca_topic_score_gemma":0.004875778,"teacher_disagreement_score":0.004804688,"about_ca_system_score_codex":0.0009962479,"about_ca_system_score_gemma":0.0008970201,"threshold_uncertainty_score":0.025409937},"labels":[],"label_agreement":null},{"id":"W340734473","doi":"10.1609/aaai.v28i1.9050","title":"Schedule-Based Robotic Search for Multiple Residents in a Retirement Home Environment","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto; Deutscher Akademischer Austauschdienst","keywords":"Schedule; USB; Plan (archaeology); Computer science; Order (exchange); Robot; Recreation; Operations research; Artificial intelligence; Business; Engineering; Finance; Geography","score_opus":0.07801174600256178,"score_gpt":0.280347239729494,"score_spread":0.20233549372693221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W340734473","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.26827013,0.00032562696,0.7273583,0.00023958829,0.000026320264,0.00010719129,0.00012086072,0.0008169758,0.0027349764],"genre_scores_gemma":[0.8581876,0.000096796255,0.13898283,0.00004440328,0.000008812723,0.00010910134,0.00011398091,0.000055879224,0.0024005263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998242,0.00005518299,0.0000067458677,0.000041791183,0.000042289248,0.000029705494],"domain_scores_gemma":[0.99967575,0.00015805426,0.000053751926,0.000026470607,0.000038048885,0.00004793395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004121346,0.00046560503,0.0006450972,0.0004127385,0.00040182853,0.00032202332,0.0007525499,0.0006038314,0.0018161028],"category_scores_gemma":[0.001234418,0.00037271497,0.00043680132,0.00029696105,0.0004648137,0.00060118636,0.0007606996,0.00034062643,0.00020449093],"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.000188916,0.000063667794,0.0014414503,0.000065047054,0.0000356971,0.00014067297,0.00014846724,0.9522842,0.0031199947,0.0039415383,0.00075627543,0.037813995],"study_design_scores_gemma":[0.00002409473,0.000094576724,0.0004052329,0.000004502894,0.000010186892,0.00004093433,0.000052952655,0.99529135,0.00077060354,0.002703246,0.0005956404,0.0000066054135],"about_ca_topic_score_codex":0.006259966,"about_ca_topic_score_gemma":0.007916914,"teacher_disagreement_score":0.006259966,"about_ca_system_score_codex":0.0005144309,"about_ca_system_score_gemma":0.0010904382,"threshold_uncertainty_score":0.012447059},"labels":[],"label_agreement":null},{"id":"W36639351","doi":"10.1609/aaai.v25i1.7850","title":"Integrating Rules and Description Logics by Circumscription","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Circumscription; Semantics (computer science); Stable model semantics; Logic programming; Answer set programming; Non-monotonic logic; Well-founded semantics; Set (abstract data type); Computer science; Mathematics; Artificial intelligence; Theoretical computer science; Programming language; Denotational semantics; Operational semantics","score_opus":0.11592488744407466,"score_gpt":0.263017775786242,"score_spread":0.14709288834216738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W36639351","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.0057076295,0.00075716595,0.9830383,0.001271035,0.000092421535,0.0000603041,0.00006484114,0.00025225917,0.008755969],"genre_scores_gemma":[0.28468654,0.0015499312,0.7056258,0.0013388877,0.00035401795,0.00034096293,0.00024791306,0.00025744978,0.005598533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936259,0.002668552,0.0007005616,0.001002566,0.0016091564,0.00039338143],"domain_scores_gemma":[0.9921467,0.003937713,0.0009098854,0.0019551453,0.00064047746,0.00041017498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006885884,0.00090711744,0.001051036,0.0028920523,0.0011207113,0.005824704,0.002325115,0.0017978462,0.0023265225],"category_scores_gemma":[0.00834419,0.0008035792,0.002266814,0.0023447324,0.0076731513,0.014985038,0.0047680824,0.003792713,0.00061729737],"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.00000858155,0.000012827059,0.00009142017,0.000035282003,0.000008920057,0.000051879535,0.00035440113,0.0019119802,0.00053422165,0.98968583,0.0001877506,0.0071167382],"study_design_scores_gemma":[0.00000893897,0.0000148079025,0.00003616328,0.000037616453,0.000014127899,0.00007339932,0.000056062625,0.011741176,0.001464928,0.97569954,0.010838938,0.000014380919],"about_ca_topic_score_codex":0.0018007597,"about_ca_topic_score_gemma":0.0014070161,"teacher_disagreement_score":0.006885884,"about_ca_system_score_codex":0.002210792,"about_ca_system_score_gemma":0.001588725,"threshold_uncertainty_score":0.03641647},"labels":[],"label_agreement":null},{"id":"W37002918","doi":"10.1609/aaai.v28i1.9124","title":"Maximum Satisfiability Using Core-Guided MaxSAT Resolution","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":120,"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":"Maximum satisfiability problem; Boolean satisfiability problem; Solver; Resolution (logic); Satisfiability; Inference; Algorithm; Computer science; Sequence (biology); Core (optical fiber); Mathematics; Mathematical optimization; Artificial intelligence","score_opus":0.2078896805235524,"score_gpt":0.3593631138283615,"score_spread":0.1514734333048091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W37002918","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.023627799,0.0004895989,0.96018904,0.00062259857,0.00009195686,0.00018325062,0.00032091784,0.002326085,0.012148713],"genre_scores_gemma":[0.27604532,0.00037092058,0.7167009,0.0005757175,0.00009439624,0.0003207787,0.0009771193,0.0005719052,0.004342875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983997,0.00059586717,0.00008340396,0.00025923076,0.0004955422,0.00016618558],"domain_scores_gemma":[0.9967705,0.0023356336,0.00018924488,0.00035590108,0.00028437673,0.00006438076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015260043,0.0009988515,0.0007740721,0.0009238485,0.00050863746,0.0013852313,0.0016376668,0.0010693423,0.006400469],"category_scores_gemma":[0.0075879632,0.00079829927,0.0012819256,0.0012419997,0.0012243137,0.0025637983,0.002350011,0.0022000629,0.00084920926],"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.00031243433,0.00022776908,0.0008036304,0.0007704227,0.00015450123,0.00038888722,0.0002830611,0.5943039,0.010762391,0.1529502,0.015420101,0.22362271],"study_design_scores_gemma":[0.00010674381,0.000048619848,0.000104026265,0.000056060027,0.000032833646,0.00010394445,0.000052888907,0.8813563,0.00674223,0.105800144,0.005579362,0.000016889033],"about_ca_topic_score_codex":0.0020172813,"about_ca_topic_score_gemma":0.0046214564,"teacher_disagreement_score":0.006400469,"about_ca_system_score_codex":0.00094189955,"about_ca_system_score_gemma":0.0019749214,"threshold_uncertainty_score":0.021411717},"labels":[],"label_agreement":null},{"id":"W41314287","doi":"10.1609/aaai.v28i1.9100","title":"A Novel Single-DBN Generative Model for Optimizing POMDP Controllers by Probabilistic Inference","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Partially observable Markov decision process; Inference; Computer science; Probabilistic logic; Generative model; Benchmark (surveying); Graphical model; Artificial intelligence; Machine learning; Generative grammar; Markov model; Markov chain","score_opus":0.07558307285019203,"score_gpt":0.2955255551993101,"score_spread":0.2199424823491181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W41314287","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.0020378344,0.0000482616,0.99634176,0.00010320434,0.000015749023,0.000022534687,0.000067998786,0.00018617607,0.0011764739],"genre_scores_gemma":[0.38286212,0.00028663076,0.61212873,0.00026945042,0.000056735873,0.00040350432,0.00039692593,0.00024017374,0.0033558314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905306,0.0002508698,0.000047598347,0.00024507617,0.00030957672,0.0000937727],"domain_scores_gemma":[0.99864644,0.00085190707,0.00011662092,0.0001764923,0.00013522962,0.00007324097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016831984,0.0007774408,0.0012834381,0.000595604,0.0004993244,0.0013604707,0.0028331373,0.001289337,0.004168785],"category_scores_gemma":[0.0041963197,0.00078318716,0.0014152965,0.00094872835,0.0014673274,0.001855534,0.0018155962,0.0025837289,0.0005939909],"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.000019482715,0.000019507683,0.00016614454,0.00003893042,0.000018122879,0.000028725099,0.000034335048,0.95282054,0.0005126283,0.034126237,0.00046651613,0.011748964],"study_design_scores_gemma":[0.000004416294,0.000003885327,0.0000134616985,0.000002665598,0.0000030682922,0.000005874629,0.0000025336226,0.9915208,0.00013396287,0.008083026,0.00022347737,0.0000027426672],"about_ca_topic_score_codex":0.008939974,"about_ca_topic_score_gemma":0.011557507,"teacher_disagreement_score":0.008939974,"about_ca_system_score_codex":0.0018428303,"about_ca_system_score_gemma":0.0026208262,"threshold_uncertainty_score":0.017775893},"labels":[],"label_agreement":null},{"id":"W4200631513","doi":"10.1609/aaai.v36i10.21325","title":"Predicting Above-Sentence Discourse Structure Using Distant Supervision from Topic Segmentation","year":2022,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Natural language processing; Computer science; Paragraph; Sentence; Parsing; Artificial intelligence; Automatic summarization; Segmentation; Task (project management); Semantic role labeling; Linguistics","score_opus":0.09739871542539401,"score_gpt":0.33011612829842624,"score_spread":0.23271741287303221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200631513","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.48323777,0.004369478,0.48723307,0.0017210052,0.00038116841,0.00028424588,0.0062359544,0.007350455,0.0091868555],"genre_scores_gemma":[0.8655366,0.0006526701,0.1172544,0.00015289089,0.00036697977,0.0001811691,0.011066326,0.000326082,0.004462893],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993451,0.00024920554,0.00003489426,0.00025185445,0.0000614904,0.00005740813],"domain_scores_gemma":[0.99600357,0.002631008,0.00037281855,0.00024367236,0.0005821594,0.00016673587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012608058,0.0010064533,0.0005593376,0.0019909532,0.0007728003,0.001081976,0.0006702397,0.0011344381,0.002449255],"category_scores_gemma":[0.004931436,0.0003922715,0.0006789248,0.0011603704,0.00038902546,0.0021244476,0.0008883677,0.0014640411,0.0021963008],"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.0021147283,0.0008138742,0.038721118,0.00118238,0.00030158524,0.0010034565,0.0048697162,0.06647521,0.09946089,0.009764893,0.039628394,0.7356638],"study_design_scores_gemma":[0.000087015185,0.00021965067,0.015340385,0.00010345852,0.00016172256,0.00018571687,0.0006856148,0.92850614,0.026678579,0.015581858,0.0123991985,0.000050743023],"about_ca_topic_score_codex":0.0037733498,"about_ca_topic_score_gemma":0.008955548,"teacher_disagreement_score":0.0037733498,"about_ca_system_score_codex":0.00059062004,"about_ca_system_score_gemma":0.0009635864,"threshold_uncertainty_score":0.0081935525},"labels":[],"label_agreement":null},{"id":"W4200632679","doi":"10.1609/aaai.v36i4.20301","title":"Sample Average Approximation for Stochastic Optimization with Dependent Data: Performance Guarantees and Tractability","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Huawei Technologies (Canada); University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Estimator; Stochastic approximation; Stochastic optimization; Stochastic gradient descent; Bounded function; Iterated function; Mathematics; Applied mathematics; Mathematical optimization; Monotone polygon; Asymptotically optimal algorithm; Consistency (knowledge bases); Computer science; Discrete mathematics; Artificial neural network; Mathematical analysis; Artificial intelligence; Statistics","score_opus":0.07742442528774132,"score_gpt":0.2772157989378486,"score_spread":0.19979137365010727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200632679","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.0060837315,0.00017957426,0.99272823,0.000191086,0.000011678106,0.000030578394,0.000030725783,0.00013556785,0.00060883316],"genre_scores_gemma":[0.46310395,0.00086810085,0.531521,0.00034324525,0.00012139873,0.0007602269,0.00061733526,0.00032920192,0.0023354993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969253,0.0014985921,0.00015135443,0.00045663153,0.0007946577,0.00017337852],"domain_scores_gemma":[0.9741018,0.021184834,0.0011976211,0.0017754196,0.001365754,0.0003746512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009381009,0.0017005516,0.002023089,0.00119421,0.00091363344,0.0017664294,0.0024996889,0.0022686883,0.0014620299],"category_scores_gemma":[0.04587028,0.0009688626,0.0015816204,0.0014712246,0.002290162,0.0030165107,0.0030041416,0.004228982,0.0004160877],"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.0001096333,0.00009893612,0.001306084,0.00015195248,0.00010238887,0.00007054548,0.0001203043,0.8794118,0.0012987191,0.09261483,0.0007436489,0.023971094],"study_design_scores_gemma":[0.0000061334317,0.000015787533,0.00006857595,0.00000747102,0.0000038477983,0.000009287315,0.000004853675,0.9852748,0.00025454233,0.014210311,0.00014114725,0.0000031991133],"about_ca_topic_score_codex":0.0050354875,"about_ca_topic_score_gemma":0.0039770342,"teacher_disagreement_score":0.009381009,"about_ca_system_score_codex":0.002143906,"about_ca_system_score_gemma":0.0030343926,"threshold_uncertainty_score":0.049612105},"labels":[],"label_agreement":null},{"id":"W4200633215","doi":"10.1609/aaai.v36i10.21293","title":"From Good to Best: Two-Stage Training for Cross-Lingual Machine Reading Comprehension","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Artificial intelligence; Set (abstract data type); Natural language processing; Reading (process); Comprehension; Task (project management); Resource (disambiguation); Reading comprehension; Machine learning; Recall; Precision and recall; Linguistics","score_opus":0.172198085721702,"score_gpt":0.3666931078557866,"score_spread":0.19449502213408462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200633215","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.31117898,0.0032467418,0.643713,0.0027078628,0.00043954354,0.001013821,0.0015954344,0.026678981,0.009425698],"genre_scores_gemma":[0.7401291,0.00023654172,0.2467435,0.0015985481,0.00017151628,0.00076316233,0.0044452376,0.00075615215,0.0051562143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960335,0.0013683754,0.0002546047,0.0015017196,0.0004567903,0.0003851183],"domain_scores_gemma":[0.98595285,0.009406245,0.00041581952,0.0016736413,0.0020011198,0.00055030425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008368791,0.0033921266,0.0021620183,0.002058301,0.0012136376,0.0024514638,0.005534811,0.004948859,0.0062203137],"category_scores_gemma":[0.02096722,0.0015742539,0.0017834082,0.0012413568,0.001371187,0.005462499,0.004925737,0.006330049,0.003291523],"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.0025920123,0.0020842187,0.021247933,0.000613252,0.0005915003,0.00068767084,0.0012621536,0.194021,0.016424121,0.004473211,0.023245059,0.73275775],"study_design_scores_gemma":[0.0000949644,0.00030394405,0.0011303338,0.000035652258,0.00006458161,0.00007576365,0.00010707645,0.9868129,0.004878275,0.0054868986,0.0009710355,0.00003874991],"about_ca_topic_score_codex":0.005241988,"about_ca_topic_score_gemma":0.008757806,"teacher_disagreement_score":0.008368791,"about_ca_system_score_codex":0.0014354562,"about_ca_system_score_gemma":0.0019994979,"threshold_uncertainty_score":0.044258893},"labels":[],"label_agreement":null},{"id":"W4200633747","doi":"10.1609/aaai.v36i11.21443","title":"Word Embeddings via Causal Inference: Gender Bias Reducing and Semantic Information Preserving","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Economic and Social Research Council; Social Sciences and Humanities Research Council of Canada","keywords":"Debiasing; Computer science; Word (group theory); Natural language processing; Artificial intelligence; Inference; Causal inference; Focus (optics); Semantic similarity; Oracle; Cognitive psychology; Psychology; Linguistics; Cognitive science; Mathematics","score_opus":0.07089615856085248,"score_gpt":0.31148861091298646,"score_spread":0.240592452352134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200633747","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.04328872,0.0006518725,0.94940025,0.00061040616,0.0001801016,0.00009056526,0.00052123494,0.0021997783,0.0030571201],"genre_scores_gemma":[0.6219087,0.00071133627,0.36627105,0.0007162453,0.00029241445,0.00016870664,0.0022046524,0.0006335439,0.0070933895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984603,0.00058718503,0.000111424946,0.0003930107,0.00032120713,0.00012691629],"domain_scores_gemma":[0.9963238,0.0014092149,0.00042531887,0.0010866342,0.00066656014,0.000088497975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023987372,0.0010435778,0.0006696698,0.001566325,0.0006683016,0.0010608202,0.00102704,0.001010506,0.0034934643],"category_scores_gemma":[0.013208948,0.000388932,0.0007963364,0.0014642007,0.0010102951,0.0032306106,0.0020461455,0.0014775039,0.0015554952],"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.000363797,0.00024090064,0.006903694,0.00024204933,0.00012772657,0.00031826692,0.00083765405,0.02650423,0.014445042,0.0515242,0.013285193,0.8852072],"study_design_scores_gemma":[0.000112167756,0.00020238834,0.003672195,0.00012030538,0.00017737372,0.00059983414,0.0007237704,0.68460155,0.028269662,0.26115048,0.020266624,0.0001037386],"about_ca_topic_score_codex":0.0020673552,"about_ca_topic_score_gemma":0.003997539,"teacher_disagreement_score":0.0034934643,"about_ca_system_score_codex":0.00055817154,"about_ca_system_score_gemma":0.0014477754,"threshold_uncertainty_score":0.012685895},"labels":[],"label_agreement":null},{"id":"W4200635486","doi":"10.1609/aaai.v36i3.20243","title":"MAGIC: Multimodal relAtional Graph adversarIal inferenCe for Diverse and Unpaired Text-Based Image Captioning","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Multimodal Machine Learning Applications","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":"Université de Montréal","funders":"National Key Research and Development Program of China","keywords":"Closed captioning; Computer science; Artificial intelligence; Natural language processing; Inference; MAGIC (telescope); Sentence; Image (mathematics)","score_opus":0.05780263208315548,"score_gpt":0.305284387201188,"score_spread":0.24748175511803253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200635486","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.014386917,0.00033779413,0.9795951,0.0004727744,0.00007907456,0.000099877,0.00032839822,0.0020084088,0.0026917227],"genre_scores_gemma":[0.7034452,0.0003299986,0.2819254,0.0011302847,0.00017209351,0.00034567635,0.0022164052,0.00062405196,0.009810957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994143,0.00021350745,0.000015977987,0.00019335256,0.00010484283,0.000057979385],"domain_scores_gemma":[0.998293,0.0011825267,0.00011766948,0.00019305477,0.00013903517,0.0000747336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001236833,0.0013334157,0.0007893664,0.000525208,0.00043169552,0.0006855665,0.0022486825,0.0016379943,0.0050987247],"category_scores_gemma":[0.0048719277,0.0005833043,0.00086914294,0.00041181763,0.0011216273,0.0013583241,0.0017053605,0.0024897736,0.00097637187],"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.00015121067,0.000075339856,0.00048871257,0.00011830975,0.00006377142,0.00020026583,0.00009904956,0.90134597,0.0047918144,0.014488218,0.0071359635,0.07104137],"study_design_scores_gemma":[0.000005011759,0.000013743991,0.000039523904,0.0000039442666,0.000004185653,0.000017501183,0.0000049342566,0.99389267,0.0008308754,0.004825522,0.0003582805,0.0000037480966],"about_ca_topic_score_codex":0.0031740675,"about_ca_topic_score_gemma":0.004654467,"teacher_disagreement_score":0.0050987247,"about_ca_system_score_codex":0.0010622441,"about_ca_system_score_gemma":0.00057441456,"threshold_uncertainty_score":0.017056942},"labels":[],"label_agreement":null},{"id":"W4221147182","doi":"10.1609/aaai.v36i1.19919","title":"Efficient Virtual View Selection for 3D Hand Pose Estimation","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":38,"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":"National Natural Science Foundation of China","keywords":"Pose; Computer science; Artificial intelligence; Benchmark (surveying); 3D pose estimation; Computer vision; Virtual reality; Selection (genetic algorithm); Fuse (electrical); Estimation; View synthesis; Machine learning; Engineering","score_opus":0.06293838602982643,"score_gpt":0.2955593304913327,"score_spread":0.23262094446150627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221147182","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.02794112,0.00067512324,0.96669745,0.00007146233,0.00006272047,0.00004801132,0.00026788784,0.003029641,0.001206535],"genre_scores_gemma":[0.56455183,0.00064816704,0.4288503,0.00022775859,0.00012287719,0.00013086686,0.0019981214,0.0003749164,0.003095129],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869233,0.00019662872,0.00005044597,0.000419573,0.0004628483,0.00017813973],"domain_scores_gemma":[0.99934775,0.00016771328,0.00007344676,0.0001739464,0.00018073992,0.000056362587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007703247,0.0020464142,0.0018713074,0.0014054358,0.00042953776,0.00081203034,0.0017192668,0.00094170263,0.0032922158],"category_scores_gemma":[0.0021586264,0.0007546325,0.0013113699,0.0010350198,0.00050918054,0.001614524,0.0027431143,0.0012666984,0.0016672878],"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.0006655702,0.00015832856,0.0030505012,0.0001397254,0.00016929458,0.00020130303,0.00012648456,0.088915214,0.09314336,0.0018956651,0.00617382,0.80536085],"study_design_scores_gemma":[0.000030787545,0.00013194898,0.0018972552,0.000019158948,0.00005222824,0.00027920605,0.000048724243,0.96788365,0.02470932,0.0028198045,0.0020983624,0.000029538658],"about_ca_topic_score_codex":0.004338831,"about_ca_topic_score_gemma":0.008098153,"teacher_disagreement_score":0.004338831,"about_ca_system_score_codex":0.00042608904,"about_ca_system_score_gemma":0.0006885473,"threshold_uncertainty_score":0.011013508},"labels":[],"label_agreement":null},{"id":"W4221149139","doi":"10.1609/aaai.v36i6.20542","title":"FisheyeHDK: Hyperbolic Deformable Kernel Learning for Ultra-Wide Field-of-View Image Recognition","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Neural Network Applications","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":"Thales (Canada)","funders":"","keywords":"Artificial intelligence; Kernel (algebra); Convolution (computer science); Computer vision; Computer science; Euclidean geometry; Convolutional neural network; Distortion (music); Pattern recognition (psychology); Cognitive neuroscience of visual object recognition; Mathematics; Artificial neural network; Object (grammar); Geometry","score_opus":0.07102955172633385,"score_gpt":0.3064330249673988,"score_spread":0.23540347324106498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221149139","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.03363513,0.00039286749,0.9620466,0.00009251486,0.00004108432,0.00004966493,0.00018024494,0.0024849784,0.0010768574],"genre_scores_gemma":[0.5578021,0.00053606986,0.43435463,0.00018809485,0.000028736853,0.00010361238,0.0010987151,0.00033079623,0.005557272],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996357,0.000047410715,0.000018731327,0.00013924728,0.00010735319,0.00005160396],"domain_scores_gemma":[0.9995839,0.00007918979,0.00005532996,0.00016070879,0.00009600662,0.000024839119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052336196,0.00073586626,0.00061168126,0.000514189,0.00019696799,0.0005593403,0.0014117197,0.0007413596,0.0015493496],"category_scores_gemma":[0.0015562678,0.0003399048,0.00059668155,0.0005357884,0.00041469646,0.0015084026,0.001158281,0.00093037984,0.00074227364],"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.00021380704,0.00013140663,0.002354922,0.00014879747,0.0001534084,0.00017436847,0.00011189218,0.21290515,0.055056162,0.006891815,0.0055003585,0.716358],"study_design_scores_gemma":[0.000006059683,0.000040755778,0.0007443033,0.0000067442825,0.000009846358,0.00009599011,0.000015441703,0.9796367,0.016045865,0.001990728,0.001392404,0.000015132005],"about_ca_topic_score_codex":0.0065890914,"about_ca_topic_score_gemma":0.006904678,"teacher_disagreement_score":0.0065890914,"about_ca_system_score_codex":0.00079799735,"about_ca_system_score_gemma":0.00054500747,"threshold_uncertainty_score":0.013101459},"labels":[],"label_agreement":null},{"id":"W4221152138","doi":"10.1609/aaai.v36i8.20890","title":"Interpretable Domain Adaptation for Hidden Subdomain Alignment in the Context of Pre-trained Source Models","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","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":"Université Laval","funders":"","keywords":"Computer science; Exploit; Leverage (statistics); Interpretability; Domain adaptation; Domain (mathematical analysis); Artificial intelligence; Machine learning; Transformation (genetics); Context (archaeology); Maximization; Data mining; Adaptation (eye); Pattern recognition (psychology); Classifier (UML); Mathematics; Mathematical optimization","score_opus":0.07656031427760422,"score_gpt":0.28523607339203366,"score_spread":0.20867575911442943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221152138","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.012191762,0.00021752682,0.9858372,0.00011487941,0.00003143289,0.000039475148,0.000057153462,0.00083890656,0.0006716349],"genre_scores_gemma":[0.5423358,0.0003977578,0.45073512,0.00038561624,0.00012832122,0.00023880154,0.0012876542,0.0005296894,0.0039612586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888486,0.00042533016,0.000049623734,0.0003976418,0.00016548851,0.0000770306],"domain_scores_gemma":[0.9975452,0.0012993421,0.00020933792,0.0005196382,0.00030325507,0.00012331225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001930214,0.0012308916,0.0011597135,0.0011392744,0.0005730347,0.0012106103,0.0014843054,0.0012706533,0.0017018499],"category_scores_gemma":[0.0057020104,0.0004646803,0.0012376992,0.0009959674,0.0010767797,0.0020930495,0.002244293,0.0033216227,0.0010162591],"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.00045865652,0.0003710989,0.0047422354,0.00024654358,0.0002142734,0.00044040306,0.0007514026,0.42191112,0.024876783,0.024405304,0.00756548,0.51401675],"study_design_scores_gemma":[0.0000083637715,0.000025527543,0.00036843558,0.000012063326,0.000012946355,0.00005232704,0.00004229147,0.97978485,0.0028264795,0.01576126,0.0010940921,0.000011312685],"about_ca_topic_score_codex":0.0019397165,"about_ca_topic_score_gemma":0.0023460423,"teacher_disagreement_score":0.0019397165,"about_ca_system_score_codex":0.0008598406,"about_ca_system_score_gemma":0.0009908114,"threshold_uncertainty_score":0.010208011},"labels":[],"label_agreement":null},{"id":"W4221162731","doi":"10.1609/aaai.v36i9.21275","title":"Sparsification of Decomposable Submodular Functions","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Precursory Research for Embryonic Science and Technology; Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Submodular set function; Cardinality (data modeling); Matroid; Complement (music); Mathematics; Function (biology); Simple (philosophy); Time complexity; Discrete mathematics; Combinatorics; Computer science; Data mining","score_opus":0.08783125934303422,"score_gpt":0.2769420356941431,"score_spread":0.1891107763511089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221162731","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.12964702,0.00059007376,0.86059153,0.00086736213,0.0000624733,0.00020833434,0.0005712372,0.0016863071,0.005775782],"genre_scores_gemma":[0.61916435,0.0004700954,0.37374756,0.00037965752,0.00012153646,0.0002985197,0.0017096266,0.00037173973,0.0037368506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876034,0.00040583403,0.000057547484,0.00028597866,0.00031047396,0.00017986703],"domain_scores_gemma":[0.99539787,0.002662033,0.00035782528,0.0011627122,0.00024803422,0.00017145998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015280719,0.0014361789,0.0016296866,0.0006713703,0.00042335776,0.0013070618,0.0013858982,0.0010208401,0.0036482674],"category_scores_gemma":[0.0067696325,0.00050881424,0.001135676,0.0010314918,0.0010759716,0.002604897,0.0018471368,0.0021676682,0.0008694507],"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.0006860306,0.00032950216,0.0021433174,0.00034073467,0.00010961823,0.00034156008,0.00021461367,0.6656404,0.016152646,0.04929719,0.010565788,0.25417867],"study_design_scores_gemma":[0.00004018284,0.00006936242,0.00022151945,0.000015877178,0.000010644134,0.00011579144,0.000045246863,0.95861477,0.00362606,0.03609014,0.0011422659,0.000008087589],"about_ca_topic_score_codex":0.001354483,"about_ca_topic_score_gemma":0.002334775,"teacher_disagreement_score":0.0036482674,"about_ca_system_score_codex":0.0010096509,"about_ca_system_score_gemma":0.0011783269,"threshold_uncertainty_score":0.012204707},"labels":[],"label_agreement":null},{"id":"W4224090047","doi":"10.1609/aaai.v36i10.21343","title":"Text Revision By On-the-Fly Representation Optimization","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Natural Language Processing 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":"McGill University","funders":"National Key Research and Development Program of China; Chinese University of Hong Kong","keywords":"Computer science; Natural language processing; Artificial intelligence; Transformer; Representation (politics); Inference; Natural language; Feature learning; Formality; Sequence (biology); Language model; Linguistics","score_opus":0.05825150952747766,"score_gpt":0.3112337834735554,"score_spread":0.25298227394607775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224090047","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.023624584,0.0002465228,0.96276045,0.00022043813,0.00012577277,0.00016936849,0.00018877149,0.010875431,0.0017886482],"genre_scores_gemma":[0.4033385,0.00024052213,0.58090466,0.00045735057,0.00020949543,0.00034581093,0.0019050697,0.0023391317,0.010259581],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985746,0.0003208538,0.00010617034,0.00046469455,0.00039046974,0.00014315163],"domain_scores_gemma":[0.9964676,0.0013634026,0.00029632702,0.0011289178,0.0006075929,0.00013614431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014961896,0.0015396836,0.001354997,0.00090359576,0.00058348756,0.00138254,0.0024381715,0.0012392404,0.005671051],"category_scores_gemma":[0.007951388,0.00048315316,0.0013948088,0.00075231225,0.0010561746,0.0027069899,0.002317675,0.0020270825,0.0035859493],"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.00047088633,0.00027943827,0.00097525446,0.00027565326,0.00008987323,0.00039288195,0.0003674972,0.19460437,0.039853062,0.011396542,0.016492696,0.7348018],"study_design_scores_gemma":[0.00007330868,0.000112378715,0.00019562595,0.000011244018,0.000040792267,0.00017948616,0.000081093014,0.9580597,0.02238117,0.01372876,0.0051150895,0.000021353764],"about_ca_topic_score_codex":0.0014172292,"about_ca_topic_score_gemma":0.0022726732,"teacher_disagreement_score":0.005671051,"about_ca_system_score_codex":0.0007054278,"about_ca_system_score_gemma":0.0012534849,"threshold_uncertainty_score":0.018971562},"labels":[],"label_agreement":null},{"id":"W4225692987","doi":"10.1609/aaai.v36i9.21224","title":"Solving Disjunctive Temporal Networks with Uncertainty under Restricted Time-Based Controllability Using Tree Search and Graph Neural Networks","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","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":"Safran Electronics (Canada)","funders":"","keywords":"Controllability; Leverage (statistics); Computer science; Graph; Scheduling (production processes); Benchmark (surveying); Search tree; Artificial intelligence; Search algorithm; Theoretical computer science; Mathematical optimization; Algorithm; Mathematics","score_opus":0.04851391012186594,"score_gpt":0.2713783142420653,"score_spread":0.22286440412019937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225692987","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.14095636,0.0005220196,0.85022795,0.0009915099,0.00006547233,0.00012617957,0.00037835518,0.00089435774,0.0058378153],"genre_scores_gemma":[0.78075457,0.00030214497,0.21507937,0.0002469728,0.00005529755,0.00020717991,0.0005766604,0.00016412335,0.002613775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999488,0.00016124816,0.00002760789,0.00013373375,0.00010698536,0.000082338185],"domain_scores_gemma":[0.9954152,0.0038570582,0.00029825207,0.00012692442,0.00020520178,0.00009743074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094997894,0.0010287022,0.00078286853,0.00057178724,0.0004852335,0.0009748664,0.001053364,0.0012534788,0.0025063716],"category_scores_gemma":[0.005606957,0.00051271537,0.0009369936,0.00073394313,0.0009789398,0.0018424726,0.0009449089,0.0016152182,0.00014681715],"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.000032288135,0.00002290535,0.00032097043,0.000046612702,0.000017483031,0.00004272424,0.000021174554,0.98306966,0.00045967812,0.0065296846,0.00036360585,0.009073301],"study_design_scores_gemma":[0.000008536292,0.000010859846,0.000033773602,0.0000026073549,0.0000036362715,0.000005662633,0.000008632969,0.9929731,0.0002018639,0.0066347104,0.00011501255,0.0000016867357],"about_ca_topic_score_codex":0.01690426,"about_ca_topic_score_gemma":0.024398202,"teacher_disagreement_score":0.01690426,"about_ca_system_score_codex":0.001637843,"about_ca_system_score_gemma":0.0019287466,"threshold_uncertainty_score":0.033611715},"labels":[],"label_agreement":null},{"id":"W4225832902","doi":"10.1609/aaai.v36i7.20745","title":"Top-Down Deep Clustering with Multi-Generator GANs","year":2022,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Generative Adversarial Networks and Image Synthesis","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":"Esri (Canada)","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Cluster analysis; Computer science; Generator (circuit theory); Artificial intelligence; Data mining; Hierarchical clustering; Embedding; Classifier (UML); Hierarchy; Brown clustering; Spectral clustering; Tree (set theory); Pattern recognition (psychology); Machine learning; Fuzzy clustering; Canopy clustering algorithm; Power (physics); Mathematics","score_opus":0.07021922864840058,"score_gpt":0.28183157062333425,"score_spread":0.21161234197493367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225832902","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.009030064,0.00018727969,0.9873467,0.00012700458,0.00003001603,0.000034023065,0.00010602586,0.0013919191,0.0017469568],"genre_scores_gemma":[0.5082582,0.00033296022,0.47794464,0.00055946293,0.000096765536,0.00019409083,0.0014541689,0.0009482955,0.010211308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947244,0.00013881724,0.000018862793,0.00017794018,0.00012573738,0.000066338165],"domain_scores_gemma":[0.99930775,0.00027811882,0.000059960024,0.00018740502,0.00011580833,0.00005105083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084610644,0.0011242036,0.0009574842,0.0007398912,0.00045988595,0.0008737069,0.0017810056,0.0010336171,0.0027334772],"category_scores_gemma":[0.002108584,0.0006004022,0.001078078,0.00078413746,0.00080811325,0.0012201559,0.0013938985,0.0020698435,0.0012320863],"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.00008679589,0.000054583732,0.0006229558,0.000060450504,0.000072876064,0.000067591805,0.00007367129,0.86585087,0.0060653975,0.023690837,0.005132046,0.09822194],"study_design_scores_gemma":[0.0000033230679,0.000007725811,0.00004923272,0.000003220579,0.0000033886706,0.000012929024,0.0000044151016,0.99144137,0.0010733048,0.006962361,0.00043508387,0.0000037996072],"about_ca_topic_score_codex":0.003912909,"about_ca_topic_score_gemma":0.007760294,"teacher_disagreement_score":0.003912909,"about_ca_system_score_codex":0.0013042358,"about_ca_system_score_gemma":0.00079294667,"threshold_uncertainty_score":0.009462953},"labels":[],"label_agreement":null},{"id":"W4225848424","doi":"10.1609/aaai.v36i7.20764","title":"Blockwise Sequential Model Learning for Partially Observable Reinforcement Learning","year":2022,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI 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":"Kootenay Association for Science & Technology","funders":"National Research Foundation of Korea; National Research Foundation","keywords":"Reinforcement learning; Observable; Computer science; Latent variable; Block (permutation group theory); Artificial intelligence; Artificial neural network; Markov process; Machine learning; Markov decision process; Variable (mathematics); Algorithm; Mathematics","score_opus":0.14809175079995085,"score_gpt":0.3238548945512752,"score_spread":0.17576314375132435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225848424","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.0068768174,0.00009073036,0.99205595,0.00008720047,0.000026589823,0.000020081678,0.000026489444,0.00021378598,0.0006023544],"genre_scores_gemma":[0.7916082,0.000246586,0.20283595,0.00017814273,0.00007014209,0.00028296444,0.00023596476,0.00011659667,0.0044254856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995104,0.00017247109,0.00002170628,0.0001112224,0.00012799632,0.00005622754],"domain_scores_gemma":[0.9991456,0.00047640022,0.00009709202,0.00008657957,0.00013729972,0.00005700054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010962235,0.0007516913,0.001128079,0.00030992838,0.00030959497,0.0005918344,0.0013533257,0.0008977058,0.0026928214],"category_scores_gemma":[0.00276718,0.0005176463,0.00055229646,0.00033473014,0.00074297044,0.0012146606,0.0010543634,0.0016275893,0.00038491483],"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.00005360716,0.000040010967,0.00035513312,0.000048885206,0.000032556214,0.000039079863,0.0000416469,0.9455801,0.001424288,0.021971194,0.0007156216,0.029697884],"study_design_scores_gemma":[0.000002711454,0.000008786444,0.000014368893,8.638907e-7,0.0000013072217,0.0000023261607,7.221093e-7,0.9971042,0.000102754064,0.0026524211,0.00010838584,0.00000118832],"about_ca_topic_score_codex":0.0056050858,"about_ca_topic_score_gemma":0.006285844,"teacher_disagreement_score":0.0056050858,"about_ca_system_score_codex":0.000936331,"about_ca_system_score_gemma":0.00139827,"threshold_uncertainty_score":0.0111448765},"labels":[],"label_agreement":null},{"id":"W4225999490","doi":"10.1609/aaai.v36i9.21184","title":"Cosine Model Watermarking against Ensemble Distillation","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Internet Traffic Analysis and Secure E-voting","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":"McMaster University; Simon Fraser University; Huawei Technologies (Canada)","funders":"","keywords":"Digital watermarking; Distillation; Computer science; Ensemble forecasting; Focus (optics); Task (project management); Image (mathematics); Artificial intelligence; Algorithm; Machine learning; Data mining; Engineering; Chemistry; Chromatography","score_opus":0.057064649985151775,"score_gpt":0.2672449593726166,"score_spread":0.21018030938746485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225999490","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.10663339,0.0013217891,0.881717,0.00069407583,0.00027988534,0.00009067251,0.00029001455,0.0012051808,0.007767957],"genre_scores_gemma":[0.85013133,0.00072475785,0.14211956,0.00023416687,0.00021427887,0.00008389417,0.0005670106,0.00015422585,0.005770757],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794,0.00049032114,0.00011958832,0.00036264712,0.00084785174,0.00023960434],"domain_scores_gemma":[0.99534696,0.001453987,0.00037984285,0.0022042799,0.00050745375,0.000107471875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002545956,0.0010839599,0.00135274,0.0010294218,0.00080055295,0.0011919083,0.0009389522,0.0016442796,0.002160808],"category_scores_gemma":[0.010959645,0.0003242528,0.00071682886,0.0013650814,0.001266308,0.00354539,0.0029962785,0.0019043791,0.001016476],"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.0011890765,0.00015891415,0.0020200743,0.0002544379,0.00015394618,0.00039682628,0.00020323182,0.33119857,0.0818873,0.15206979,0.0068480023,0.42361984],"study_design_scores_gemma":[0.000033284974,0.00012794626,0.00030648982,0.000021394408,0.00002348036,0.0002327697,0.000031288506,0.92162055,0.04384046,0.029705554,0.004026526,0.000030216794],"about_ca_topic_score_codex":0.0005995647,"about_ca_topic_score_gemma":0.0006623587,"teacher_disagreement_score":0.002545956,"about_ca_system_score_codex":0.0005159375,"about_ca_system_score_gemma":0.0007022768,"threshold_uncertainty_score":0.013464451},"labels":[],"label_agreement":null},{"id":"W4226042751","doi":"10.1609/aaai.v36i2.20047","title":"Self-Supervised Spatiotemporal Representation Learning by Exploiting Video Continuity","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Human Pose and Action Recognition","field":"Computer Science","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":"University of Manitoba; Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Representation (politics); Feature learning; Context (archaeology); Artificial intelligence; Task (project management); Action (physics); Property (philosophy); Perception; Machine learning","score_opus":0.0675899898834621,"score_gpt":0.2891671634956185,"score_spread":0.2215771736121564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226042751","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.07525347,0.00018423561,0.9219969,0.00020534062,0.000026226033,0.00005198413,0.00009646459,0.0008899919,0.0012953227],"genre_scores_gemma":[0.86364865,0.00016227762,0.13254279,0.00016970385,0.000075777934,0.00007546926,0.0006633421,0.00013671584,0.0025253606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995685,0.00009566424,0.00001847926,0.00017980514,0.00008590692,0.000051575695],"domain_scores_gemma":[0.9986468,0.00048896554,0.00024655624,0.00030751535,0.00022250126,0.00008768258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008834111,0.000611294,0.0006362979,0.00067172805,0.00027171802,0.00068564847,0.0014143687,0.0008132069,0.00128868],"category_scores_gemma":[0.00338224,0.0004000285,0.00049397565,0.0006504485,0.00087261613,0.002210731,0.0012874354,0.0013559937,0.0003283907],"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.00039702453,0.00027679084,0.0041000517,0.00013505979,0.000109608976,0.00016069108,0.00028872496,0.516474,0.03104628,0.01644068,0.0048538554,0.42571726],"study_design_scores_gemma":[0.000006235689,0.00003427795,0.00018376583,0.0000028298218,0.000004146321,0.000015043992,0.00000816901,0.9944541,0.0018901868,0.0031863218,0.00021227928,0.0000026069442],"about_ca_topic_score_codex":0.0028157684,"about_ca_topic_score_gemma":0.0032570765,"teacher_disagreement_score":0.0028157684,"about_ca_system_score_codex":0.00064987503,"about_ca_system_score_gemma":0.00081301323,"threshold_uncertainty_score":0.0055987835},"labels":[],"label_agreement":null},{"id":"W4226065536","doi":"10.1609/aaai.v36i9.21199","title":"Online Search with Best-Price and Query-Based Predictions","year":2022,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; Fondation Mathématique Jacques Hadamard; Agence Nationale de la Recherche","keywords":"Computer science; Sequence (biology); Competitive analysis; Upper and lower bounds; Online algorithm; Function (biology); Mathematical optimization; Data mining; Algorithm; Mathematics","score_opus":0.26305058705952034,"score_gpt":0.4146352830478472,"score_spread":0.15158469598832686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226065536","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.22654456,0.0017257823,0.7622059,0.0018465753,0.0000918013,0.00022733852,0.0004640563,0.0015800961,0.005313987],"genre_scores_gemma":[0.92442137,0.00028974455,0.07238005,0.0002864036,0.00012403399,0.00013540185,0.00032838888,0.00011028035,0.0019241939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936121,0.0026835008,0.00042454796,0.0014813897,0.0010988049,0.0006996933],"domain_scores_gemma":[0.92222375,0.06508727,0.004880245,0.00493909,0.001822657,0.0010470299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008984168,0.001994351,0.0042745173,0.0011474601,0.0011749538,0.0034769399,0.0045272517,0.0050226366,0.0032926553],"category_scores_gemma":[0.053788483,0.0011999736,0.00087793113,0.0021649194,0.003379751,0.009892654,0.002646348,0.003543894,0.0009375102],"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.0015125372,0.0004000539,0.002691323,0.00018951188,0.000093538234,0.000182637,0.00023193938,0.9292405,0.001314127,0.01862144,0.0015685053,0.043953884],"study_design_scores_gemma":[0.000037632075,0.00008180414,0.00022406821,0.0000081345715,0.000011782047,0.00003918639,0.000018780154,0.98625344,0.0005065982,0.01265983,0.0001465611,0.000012209285],"about_ca_topic_score_codex":0.004722807,"about_ca_topic_score_gemma":0.0035464934,"teacher_disagreement_score":0.008984168,"about_ca_system_score_codex":0.0021557126,"about_ca_system_score_gemma":0.0025907808,"threshold_uncertainty_score":0.047513366},"labels":[],"label_agreement":null},{"id":"W4226105092","doi":"10.1609/aaai.v36i2.20111","title":"Decompose the Sounds and Pixels, Recompose the Events","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Speech and Audio Processing","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; University of Waterloo","funders":"","keywords":"Event (particle physics); Computer science; Margin (machine learning); Decomposition; Function (biology); Artificial intelligence; State (computer science); Architecture; Audio visual; Categorization; Natural language processing; Machine learning; Algorithm","score_opus":0.05858571058833668,"score_gpt":0.28212709151836346,"score_spread":0.2235413809300268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226105092","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.02369165,0.00025341852,0.97109467,0.00016508621,0.000107084874,0.00006419252,0.000337299,0.0022334852,0.0020531432],"genre_scores_gemma":[0.41613814,0.00049302867,0.5708888,0.00026069328,0.00019662254,0.00012097291,0.0024466594,0.00042524637,0.009029882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963117,0.000047743946,0.000013888266,0.00018143564,0.00007931326,0.00004631418],"domain_scores_gemma":[0.9995503,0.00010474975,0.000050966213,0.00014685193,0.00010090501,0.00004614841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005613337,0.0012228464,0.0006482793,0.00085205986,0.00033750513,0.00091220334,0.0018473846,0.0007132126,0.0031736],"category_scores_gemma":[0.0018958469,0.00037075754,0.0006736539,0.0007680785,0.000506424,0.0022260763,0.001415378,0.001599168,0.0019599444],"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.00039659423,0.0001975767,0.0031529053,0.00010907736,0.00006739122,0.00015519629,0.00018332359,0.07664308,0.034487545,0.0066502695,0.0053721354,0.8725849],"study_design_scores_gemma":[0.000013132984,0.000118628814,0.0023221355,0.00001884438,0.000033829463,0.0001558805,0.00009521118,0.94705874,0.027534299,0.013233547,0.009389844,0.00002581867],"about_ca_topic_score_codex":0.0026686848,"about_ca_topic_score_gemma":0.0046241707,"teacher_disagreement_score":0.0031736,"about_ca_system_score_codex":0.0004436103,"about_ca_system_score_gemma":0.0005758601,"threshold_uncertainty_score":0.01061672},"labels":[],"label_agreement":null},{"id":"W4226150786","doi":"10.1609/aaai.v36i2.20010","title":"Adversarial Attack for Asynchronous Event-Based Data","year":2022,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","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":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea","keywords":"Adversarial system; Asynchronous communication; Computer science; Artificial intelligence; Event (particle physics); Robustness (evolution); Deep learning; Set (abstract data type); Machine learning; Deep neural networks; Data mining","score_opus":0.17045644340709656,"score_gpt":0.37420678574071875,"score_spread":0.2037503423336222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226150786","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.049657244,0.00026801397,0.94499284,0.00064451847,0.00012235972,0.00010004212,0.00026112745,0.0010854908,0.002868426],"genre_scores_gemma":[0.9340363,0.00017164912,0.061789364,0.000414495,0.000060480073,0.00014005827,0.0005086504,0.00012948528,0.0027496198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835545,0.0005006627,0.000096059055,0.00038144446,0.0004848838,0.00018156353],"domain_scores_gemma":[0.9948096,0.0033906875,0.00044365195,0.0009177589,0.0003052661,0.00013300093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023835544,0.0009849867,0.0008193643,0.0004887797,0.0005191264,0.0007654298,0.0014191563,0.0012944809,0.0020411965],"category_scores_gemma":[0.009216587,0.00040579017,0.00088882184,0.00033316694,0.0015317723,0.0020571493,0.0028871435,0.003009575,0.00041390874],"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.00028464865,0.000057097954,0.001325693,0.000060513306,0.000059631013,0.00019874635,0.00007356842,0.93297344,0.0048803743,0.023411537,0.0030011323,0.033673596],"study_design_scores_gemma":[0.000008801999,0.000026365044,0.0001276733,0.000005929055,0.0000041637772,0.000037676855,0.0000070336187,0.98665816,0.0021871633,0.01041726,0.00051396666,0.0000058155138],"about_ca_topic_score_codex":0.00137401,"about_ca_topic_score_gemma":0.0011692417,"teacher_disagreement_score":0.0023835544,"about_ca_system_score_codex":0.0010795308,"about_ca_system_score_gemma":0.0006676252,"threshold_uncertainty_score":0.0126056075},"labels":[],"label_agreement":null},{"id":"W4226167551","doi":"10.1609/aaai.v36i8.20894","title":"A Multi-Agent Reinforcement Learning Approach for Efficient Client Selection in Federated Learning","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":100,"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":"Reinforcement learning; Computer science; Federated learning; Latency (audio); Selection (genetic algorithm); Artificial intelligence; Distributed computing; Machine learning","score_opus":0.09936742032616244,"score_gpt":0.30934394574276675,"score_spread":0.2099765254166043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226167551","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.01687954,0.00010069304,0.9806743,0.0002467482,0.000030743548,0.00005752235,0.000025342402,0.0007821748,0.0012028225],"genre_scores_gemma":[0.8550471,0.00006702258,0.14231464,0.00021688308,0.000032700787,0.00014255696,0.000060188122,0.000074003365,0.002044947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868613,0.00051086,0.000057464236,0.00029277414,0.0002734807,0.00017920615],"domain_scores_gemma":[0.99723417,0.0013200832,0.00028351363,0.00045053166,0.00047312267,0.000238536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002634578,0.00083675626,0.0012561339,0.00043416818,0.0007238835,0.0009882433,0.0024986512,0.0012322635,0.0018447083],"category_scores_gemma":[0.0068235477,0.0004394672,0.00046002716,0.00045781056,0.0011810355,0.0016959123,0.0019238786,0.0018331514,0.00039768993],"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.00014570296,0.00015963531,0.00092006824,0.000039466075,0.000040887786,0.00013895014,0.00008422843,0.93892765,0.0019429007,0.01323999,0.0014634264,0.042896986],"study_design_scores_gemma":[0.000007383515,0.000014395619,0.000022591206,0.0000016729534,0.0000019927572,0.0000091883285,0.0000036474023,0.9972293,0.00024327105,0.0023294063,0.00013495095,0.0000022318357],"about_ca_topic_score_codex":0.0040274863,"about_ca_topic_score_gemma":0.0039725774,"teacher_disagreement_score":0.0040274863,"about_ca_system_score_codex":0.0010756073,"about_ca_system_score_gemma":0.0016942427,"threshold_uncertainty_score":0.013933182},"labels":[],"label_agreement":null},{"id":"W4226193037","doi":"10.1609/aaai.v36i11.21452","title":"Evaluating Explainable AI on a Multi-Modal Medical Imaging Task: Can Existing Algorithms Fulfill Clinical Requirements?","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Simon Fraser University","funders":"BC Cancer Foundation; Compute Canada; Nvidia","keywords":"Computer science; Modality (human–computer interaction); Artificial intelligence; Modal; Leverage (statistics); Machine learning; Metric (unit); Feature (linguistics); Medical imaging; Data mining; Engineering","score_opus":0.2772565168370234,"score_gpt":0.4433974170613346,"score_spread":0.16614090022431122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226193037","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.48833263,0.0062644808,0.48477513,0.0069029327,0.00026725745,0.0014849124,0.0024862222,0.00392649,0.0055600186],"genre_scores_gemma":[0.80969566,0.00057999894,0.18655954,0.0005827784,0.00004576119,0.00038083558,0.0016394184,0.00014775472,0.00036825018],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9836806,0.011145258,0.0012003818,0.0016725844,0.0019769736,0.00032410427],"domain_scores_gemma":[0.83941567,0.14027332,0.005039849,0.0071480772,0.006980615,0.0011425323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020917442,0.0014050364,0.0009226261,0.0022189189,0.0005735975,0.003182898,0.0018477917,0.0023408215,0.0023599414],"category_scores_gemma":[0.15714428,0.0003565698,0.0012425362,0.0011068353,0.0012622962,0.0030055041,0.0018784798,0.0022128609,0.00044664013],"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.0035009685,0.00091588445,0.07999068,0.003680315,0.0014631535,0.00043458128,0.0027589889,0.19533159,0.010798216,0.010978185,0.008981859,0.68116564],"study_design_scores_gemma":[0.00041566213,0.0016133719,0.019216262,0.0005272975,0.00056575733,0.0005347724,0.001238969,0.9198194,0.014395175,0.035199966,0.0063344445,0.00013884855],"about_ca_topic_score_codex":0.0028831076,"about_ca_topic_score_gemma":0.0047353623,"teacher_disagreement_score":0.020917442,"about_ca_system_score_codex":0.0019733189,"about_ca_system_score_gemma":0.003037727,"threshold_uncertainty_score":0.11062336},"labels":[],"label_agreement":null},{"id":"W4226200202","doi":"10.1609/aaai.v36i4.20294","title":"Learning to Search in Local Branching","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Leverage (statistics); Local search (optimization); Mathematical optimization; Heuristic; Computer science; Linear programming; Mathematics; Integer programming; Algorithm; Constraint (computer-aided design); Local optimum; Artificial intelligence","score_opus":0.05860159410969267,"score_gpt":0.3077845184515558,"score_spread":0.24918292434186312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226200202","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.059144333,0.0003464857,0.93661815,0.00030468855,0.000028041652,0.0000618009,0.000031060066,0.00044603203,0.003019456],"genre_scores_gemma":[0.8036363,0.0003237264,0.1925968,0.00033608155,0.0000585989,0.0002859716,0.0001510236,0.00015641283,0.0024551044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990926,0.0003682306,0.000044703316,0.00021800447,0.000170901,0.0001056434],"domain_scores_gemma":[0.99509877,0.0034778889,0.000470869,0.0003861466,0.00038023683,0.00018621054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026242253,0.0008850309,0.0013465643,0.00061098963,0.0004952814,0.00093849597,0.0015509702,0.0010142355,0.0019394903],"category_scores_gemma":[0.012266936,0.00060907647,0.00064849993,0.000524942,0.0017557441,0.0016791917,0.002175935,0.0016626519,0.00034491942],"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.00007335099,0.00004862211,0.0012553418,0.00006536147,0.00003236621,0.00005698385,0.000086745014,0.94645655,0.0011584051,0.026587931,0.00060668454,0.023571776],"study_design_scores_gemma":[0.000010404938,0.000026249521,0.000048187245,0.0000070243905,0.0000042499128,0.0000069115845,0.0000063349003,0.9905098,0.00021184058,0.009004281,0.00016232347,0.000002318175],"about_ca_topic_score_codex":0.0024885705,"about_ca_topic_score_gemma":0.0030009826,"teacher_disagreement_score":0.0026242253,"about_ca_system_score_codex":0.00091568707,"about_ca_system_score_gemma":0.001411619,"threshold_uncertainty_score":0.013878405},"labels":[],"label_agreement":null},{"id":"W4226246254","doi":"10.1609/aaai.v36i11.21438","title":"Interpretable Low-Resource Legal Decision Making","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Law","field":"Social Sciences","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Government of Canada","keywords":"Interpretability; Deep learning; Artificial intelligence; Computer science; Machine learning; Task (project management); Resource (disambiguation); Confusion; Trademark; Data science; Engineering","score_opus":0.06607011868209936,"score_gpt":0.34963110939826536,"score_spread":0.28356099071616603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226246254","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.0480879,0.00043853142,0.9186525,0.0059924196,0.00014794085,0.00013704925,0.0008797624,0.001618465,0.02404555],"genre_scores_gemma":[0.80521464,0.0004212995,0.18279813,0.0006984072,0.00015125153,0.00013760345,0.0011788962,0.0001759881,0.009223663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720395,0.0010611541,0.00016894376,0.0005478447,0.000778915,0.00023927698],"domain_scores_gemma":[0.988813,0.0074813,0.0009919669,0.0014103556,0.00094524166,0.00035814973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034326937,0.0006783307,0.0009307736,0.000934385,0.00088920264,0.0041765664,0.0022164362,0.002092972,0.011898775],"category_scores_gemma":[0.025551012,0.0005917738,0.00077222503,0.00070347387,0.0022060417,0.005631619,0.0033449202,0.0037372003,0.0016821809],"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.00033689357,0.0003382897,0.0035204522,0.00035866103,0.0000669329,0.0006418273,0.00075793685,0.3952908,0.0038750912,0.32301685,0.016446725,0.25534958],"study_design_scores_gemma":[0.00001937168,0.00002474549,0.0003383277,0.00005715709,0.000011586568,0.00005973183,0.00009159295,0.7491187,0.0020968255,0.24344128,0.004723046,0.000017559534],"about_ca_topic_score_codex":0.0044990056,"about_ca_topic_score_gemma":0.007881079,"teacher_disagreement_score":0.011898775,"about_ca_system_score_codex":0.0023748926,"about_ca_system_score_gemma":0.0033954133,"threshold_uncertainty_score":0.039805412},"labels":[],"label_agreement":null},{"id":"W4226285081","doi":"10.1609/aaai.v36i9.21278","title":"A Novel Approach to Solving Goal-Achieving Problems for Board Games","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","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 Alberta","funders":"","keywords":"Heuristics; Computer science; Solver; Set (abstract data type); Null (SQL); Relevance (law); Adversary; Theoretical computer science; Programming language; Computer security; Data mining","score_opus":0.09993743544183452,"score_gpt":0.29884306306842945,"score_spread":0.19890562762659492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226285081","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.010510761,0.00016098114,0.97256756,0.0003743791,0.000059817994,0.00014374312,0.000053985008,0.00066955964,0.01545912],"genre_scores_gemma":[0.12547962,0.00027645254,0.8629394,0.00023712472,0.000059352456,0.00022798277,0.00019103687,0.00019727479,0.010391811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999428,0.00015683459,0.00003325793,0.00013358858,0.0001667971,0.00008153086],"domain_scores_gemma":[0.999647,0.00017130777,0.00003108123,0.00005119358,0.000054402124,0.000044901473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068524905,0.0012257133,0.000528599,0.0007163205,0.0007183974,0.0012014934,0.0019761897,0.00096386176,0.007325472],"category_scores_gemma":[0.0021033578,0.0004419258,0.001115018,0.0005489515,0.0015991887,0.0019506216,0.0022941532,0.002494603,0.0013975651],"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.00017054698,0.00024113999,0.0012618469,0.0006346601,0.00007515537,0.00017462052,0.00082068756,0.20049807,0.0133567825,0.4509308,0.011823688,0.32001197],"study_design_scores_gemma":[0.00016032105,0.00043706724,0.0005409639,0.00010354601,0.000066578694,0.00028661767,0.00030547354,0.7082902,0.007764048,0.2183085,0.06369359,0.000043151555],"about_ca_topic_score_codex":0.002576533,"about_ca_topic_score_gemma":0.0040973406,"teacher_disagreement_score":0.007325472,"about_ca_system_score_codex":0.0007813057,"about_ca_system_score_gemma":0.0013759761,"threshold_uncertainty_score":0.024506152},"labels":[],"label_agreement":null},{"id":"W4226336143","doi":"10.1609/aaai.v36i4.20324","title":"Meta-Learning for Online Update of Recommender Systems","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; National Research Foundation of Korea; National Research Foundation","keywords":"Recommender system; Computer science; Flexibility (engineering); Machine learning; Artificial intelligence; Focus (optics); Meta learning (computer science); Information retrieval","score_opus":0.21117849390145052,"score_gpt":0.32568591056848245,"score_spread":0.11450741666703193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226336143","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.008387997,0.0011874633,0.9884448,0.00033458363,0.000054772892,0.00006568555,0.000088747875,0.0005100796,0.0009259734],"genre_scores_gemma":[0.6516968,0.0011735134,0.34265357,0.00041302943,0.00028504315,0.00046540762,0.00042574573,0.00016134724,0.0027255577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968149,0.0014863571,0.0002602243,0.00064798124,0.000612473,0.00017810828],"domain_scores_gemma":[0.98717785,0.009233765,0.0008007491,0.0012991404,0.0012439283,0.00024466222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006242726,0.0015778443,0.002615435,0.0017132065,0.00070324994,0.002001859,0.0038371817,0.0025505424,0.0017022331],"category_scores_gemma":[0.023837753,0.0012380223,0.0014725268,0.0014551926,0.001222674,0.003730196,0.0016491651,0.0033972661,0.0007264702],"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.00017727943,0.00015017028,0.0023391347,0.0002208215,0.00026442664,0.00009314055,0.00018297756,0.8545013,0.0011521237,0.024171185,0.0016644057,0.11508302],"study_design_scores_gemma":[0.000011732488,0.000033137392,0.00010539199,0.000012924139,0.000021233123,0.000017890095,0.0000063692873,0.9913031,0.00033380397,0.0077353497,0.00040916778,0.000009887258],"about_ca_topic_score_codex":0.005299134,"about_ca_topic_score_gemma":0.007422202,"teacher_disagreement_score":0.006242726,"about_ca_system_score_codex":0.0019430602,"about_ca_system_score_gemma":0.0013288992,"threshold_uncertainty_score":0.033015072},"labels":[],"label_agreement":null},{"id":"W4226428024","doi":"10.1609/aaai.v36i11.21465","title":"Knowledge Sharing via Domain Adaptation in Customs Fraud Detection","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Imbalanced Data Classification Techniques","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":"Kootenay Association for Science & Technology","funders":"Ministry of Science and ICT, South Korea; Institute for Basic Science; National Research Foundation","keywords":"Safeguarding; Business; Adaptation (eye); Revenue; Knowledge sharing; Tax revenue; Computer security; Knowledge management; Finance; Computer science; Public economics; Economics","score_opus":0.08251334886681946,"score_gpt":0.3011480409752738,"score_spread":0.21863469210845435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226428024","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.3398902,0.000873851,0.64380336,0.0017091526,0.00017298349,0.00084394903,0.00058968185,0.0050068684,0.007109913],"genre_scores_gemma":[0.84729314,0.00021041417,0.1492727,0.00036754605,0.00006918346,0.0002346487,0.00076476455,0.000072678646,0.0017148999],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942948,0.0024842934,0.00037732674,0.0016561924,0.00081374036,0.000373696],"domain_scores_gemma":[0.98595226,0.0059962436,0.0013052622,0.0050244126,0.0011938176,0.00052811747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008751454,0.0007989842,0.0010727273,0.003228187,0.0012187801,0.002438307,0.0026326291,0.0018919313,0.0010262795],"category_scores_gemma":[0.020450493,0.0005525787,0.0008755945,0.0036038018,0.0015066895,0.006741649,0.005234281,0.0019073071,0.0005893116],"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.00072474394,0.0026865674,0.031883013,0.00024073877,0.00037111153,0.0007327445,0.0023486319,0.14949276,0.015534158,0.007799505,0.006586609,0.7815995],"study_design_scores_gemma":[0.00006224629,0.00019259797,0.008292142,0.000051377556,0.00012562671,0.00038833168,0.0010731936,0.93798375,0.014153354,0.028823305,0.008784829,0.00006921707],"about_ca_topic_score_codex":0.0041590137,"about_ca_topic_score_gemma":0.0029790495,"teacher_disagreement_score":0.008751454,"about_ca_system_score_codex":0.0010475083,"about_ca_system_score_gemma":0.0016676252,"threshold_uncertainty_score":0.04628265},"labels":[],"label_agreement":null},{"id":"W4226450763","doi":"10.1609/aaai.v36i7.20700","title":"Augmentation-Free Self-Supervised Learning on Graphs","year":2022,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","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":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; Korea Advanced Institute of Science and Technology","keywords":"Computer science; Cluster analysis; Graph; Hyperparameter; Artificial intelligence; Machine learning; Semantics (computer science); Node (physics); Theoretical computer science; Programming language","score_opus":0.07924101591751169,"score_gpt":0.3003966368884876,"score_spread":0.2211556209709759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226450763","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.021949574,0.00020899804,0.9744057,0.00020792412,0.000028095332,0.000062152954,0.00016302417,0.0019788966,0.0009956677],"genre_scores_gemma":[0.5653653,0.00034130938,0.42778635,0.0004669495,0.00012806727,0.0003248307,0.0017004313,0.00050717714,0.0033796933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843985,0.0006678446,0.00005434814,0.0005070529,0.00023345939,0.000097460594],"domain_scores_gemma":[0.9953923,0.0022011409,0.0003688447,0.0013812734,0.00048491394,0.00017156338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018475754,0.0010558622,0.001278668,0.001553207,0.0005809294,0.0008454045,0.0026383458,0.001410619,0.0013769817],"category_scores_gemma":[0.0066021946,0.00067635026,0.0010774292,0.0011469327,0.0020583782,0.002966354,0.0022878402,0.0019467422,0.0007911006],"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.00025536766,0.00022726673,0.0025457728,0.00036825865,0.00015426711,0.00026174512,0.0004278529,0.62930906,0.014406861,0.04299191,0.009905982,0.2991456],"study_design_scores_gemma":[0.000008805766,0.00002337718,0.000164669,0.000008279489,0.000005990014,0.000038500722,0.000014524929,0.9688798,0.0016215208,0.028521681,0.00070559426,0.0000071710224],"about_ca_topic_score_codex":0.001618996,"about_ca_topic_score_gemma":0.0031674437,"teacher_disagreement_score":0.0026383458,"about_ca_system_score_codex":0.00075533724,"about_ca_system_score_gemma":0.0007227034,"threshold_uncertainty_score":0.009771049},"labels":[],"label_agreement":null},{"id":"W4229004105","doi":"10.1609/aaai.v36i11.21464","title":"Learning Economic Indicators by Aggregating Multi-Level Geospatial Information","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Impact of Light on Environment and Health","field":"Environmental 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":"Kootenay Association for Science & Technology","funders":"Samsung; Institute for Basic Science; Korea Advanced Institute of Science and Technology; National Research Foundation of Korea; National Research Foundation","keywords":"Geospatial analysis; Computer science; Poverty; Population; Geography; Data science; Cartography; Economic growth; Economics","score_opus":0.04478052494054327,"score_gpt":0.267624209869025,"score_spread":0.22284368492848175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229004105","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.47127584,0.0005745629,0.5169876,0.0017996783,0.00008810792,0.0000521261,0.0026767645,0.0008964139,0.0056488747],"genre_scores_gemma":[0.96769273,0.00023910706,0.029092181,0.00009284596,0.00003255093,0.000028325358,0.0015052626,0.000021914413,0.0012951504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979895,0.00004608529,0.0000118111,0.000072347626,0.000039616312,0.00003121238],"domain_scores_gemma":[0.99942565,0.00021773404,0.00014412355,0.00007913981,0.000094548464,0.000038701495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047861604,0.0005357808,0.00037602228,0.0012386256,0.00015076868,0.00093837356,0.00057157414,0.0003941553,0.0010551236],"category_scores_gemma":[0.0023432437,0.0002565298,0.0004419734,0.0018386733,0.00036635637,0.0019514423,0.0010290209,0.0011008395,0.00030748322],"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.00013527455,0.00034131535,0.16374221,0.00010997555,0.00032144928,0.00011307387,0.00019953196,0.5584916,0.0022034305,0.013322861,0.006180912,0.25483844],"study_design_scores_gemma":[0.000004925162,0.000020517049,0.014239516,0.000016618571,0.000026377218,0.00001136235,0.00005310756,0.9710485,0.00068904506,0.012641557,0.0012379229,0.000010571954],"about_ca_topic_score_codex":0.008123802,"about_ca_topic_score_gemma":0.016630927,"teacher_disagreement_score":0.008123802,"about_ca_system_score_codex":0.000743559,"about_ca_system_score_gemma":0.00036813034,"threshold_uncertainty_score":0.016153038},"labels":[],"label_agreement":null},{"id":"W4280643089","doi":"10.1609/aaai.v36i6.20558","title":"Feedback Gradient Descent: Efficient and Stable Optimization with Orthogonality for DNNs","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Human Pose and Action Recognition","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":"Kootenay Association for Science & Technology","funders":"Defense Acquisition Program Administration; Agency for Defense Development","keywords":"Stiefel manifold; Orthogonality; Tangent bundle; Stability (learning theory); Gradient descent; Manifold (fluid mechanics); Computer science; Discretization; Mathematical optimization; Tangent vector; Mathematics; Applied mathematics; Tangent; Control theory (sociology); Algorithm; Tangent space; Artificial neural network; Artificial intelligence; Mathematical analysis; Machine learning; Geometry","score_opus":0.060313936774506687,"score_gpt":0.2617351034577038,"score_spread":0.2014211666831971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280643089","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.008492569,0.00017855375,0.98957497,0.000099880664,0.00003845623,0.000036611997,0.000036198708,0.0006481159,0.0008946703],"genre_scores_gemma":[0.37913233,0.00032078684,0.6156759,0.0002663052,0.000073213785,0.00028330353,0.00032780098,0.00047227996,0.0034480535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994772,0.00015813639,0.000034404038,0.0000924604,0.00018463717,0.000053118387],"domain_scores_gemma":[0.9993193,0.0003013291,0.00007227154,0.00008359695,0.00016728489,0.000056225053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012841161,0.0012798785,0.0010014594,0.00058445265,0.00043946702,0.00073264644,0.0013197139,0.0011971565,0.0016961416],"category_scores_gemma":[0.0040868954,0.00062350207,0.0005710334,0.00056526007,0.00092867017,0.0012718806,0.001642804,0.0015024587,0.00058527436],"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.00017089788,0.00010337178,0.0008708816,0.0001448915,0.000077225435,0.00010545957,0.00009994801,0.7662828,0.01218425,0.03421343,0.0041605327,0.18158633],"study_design_scores_gemma":[0.0000054276,0.000010810121,0.000023754219,0.0000031358873,0.0000016204059,0.000005752645,0.0000021266833,0.99619687,0.00059696665,0.002887137,0.00026408784,0.0000022761863],"about_ca_topic_score_codex":0.0051592807,"about_ca_topic_score_gemma":0.006451944,"teacher_disagreement_score":0.0051592807,"about_ca_system_score_codex":0.0010558125,"about_ca_system_score_gemma":0.0017159154,"threshold_uncertainty_score":0.010258496},"labels":[],"label_agreement":null},{"id":"W4283789357","doi":"10.1609/aaai.v36i9.21226","title":"A Distributional Framework for Risk-Sensitive End-to-End Planning in Continuous MDPs","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Water resources management and optimization","field":"Engineering","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":"Vector Institute; University of Toronto","funders":"","keywords":"Computer science; Leverage (statistics); Mathematical optimization; Backpropagation; CVAR; Novelty; Expected shortfall; Artificial intelligence; Artificial neural network; Risk management; Mathematics","score_opus":0.039551612922116626,"score_gpt":0.26515336469849804,"score_spread":0.22560175177638142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283789357","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.002537095,0.00010978102,0.99613047,0.00015716603,0.00001595341,0.000016741385,0.000031510728,0.00012391817,0.0008773315],"genre_scores_gemma":[0.57855415,0.00084875437,0.41406482,0.00039367608,0.00012996279,0.00048913504,0.00031433592,0.00042215906,0.004783103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984053,0.0006454157,0.0000945545,0.00028392643,0.0004139902,0.00015689689],"domain_scores_gemma":[0.99635386,0.0023945875,0.00028783528,0.00027932183,0.00048553053,0.00019885696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032272313,0.0016345971,0.001646828,0.0009447365,0.0006341696,0.001676169,0.0023553844,0.001633771,0.0028874113],"category_scores_gemma":[0.007857361,0.00097385916,0.0012472633,0.0008950504,0.0021193943,0.0024588807,0.0031274238,0.0032950758,0.00037918118],"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.0000093835315,0.000010529875,0.000088556386,0.000022683485,0.000011548481,0.000018837254,0.000019196443,0.974679,0.00017213695,0.020771615,0.00020533895,0.003991264],"study_design_scores_gemma":[0.0000029926898,0.000012499712,0.000019847848,0.000005273998,0.0000029317905,0.0000054477055,0.000003922496,0.984038,0.0001267187,0.015547698,0.00023142905,0.0000033128902],"about_ca_topic_score_codex":0.0060342373,"about_ca_topic_score_gemma":0.0051689446,"teacher_disagreement_score":0.0060342373,"about_ca_system_score_codex":0.0022026005,"about_ca_system_score_gemma":0.002964748,"threshold_uncertainty_score":0.017067432},"labels":[],"label_agreement":null},{"id":"W4283789759","doi":"10.1609/aaai.v36i10.21332","title":"Search and Learn: Improving Semantic Coverage for Data-to-Text Generation","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Bundesministerium für Bildung und Forschung; Compute Canada; Technische Universität Kaiserslautern; Canadian Institute for Advanced Research; DeepMind; Nvidia","keywords":"Computer science; Inference; Focus (optics); Artificial intelligence; Limiting; Cover (algebra); Quality (philosophy); Training set; Language model; Natural language processing; Information retrieval; Machine learning","score_opus":0.2087035607689111,"score_gpt":0.3334275307102393,"score_spread":0.12472396994132817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283789759","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.0775306,0.0018903511,0.8806764,0.00089412014,0.00016628024,0.00028575628,0.0017044714,0.033118717,0.0037334159],"genre_scores_gemma":[0.59798145,0.0005174453,0.38663185,0.00091215665,0.00017625754,0.00043640804,0.0075165136,0.0022464863,0.0035813279],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981027,0.0006669054,0.0001281386,0.00053873076,0.0004309215,0.00013257534],"domain_scores_gemma":[0.99334455,0.0047368235,0.00027162858,0.0009204653,0.0005624467,0.00016399281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023187094,0.0012786083,0.0015767976,0.0019920385,0.000741813,0.001314774,0.0021720468,0.0017520755,0.004044173],"category_scores_gemma":[0.016027184,0.0006412526,0.0010832177,0.0014287205,0.0010283426,0.0052339407,0.002729187,0.001763876,0.0018334647],"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.0011914439,0.0008376741,0.005690843,0.0007875567,0.00018649192,0.00073615764,0.0010920719,0.17206366,0.02135267,0.013670403,0.03878034,0.74361074],"study_design_scores_gemma":[0.000094177754,0.00008900845,0.00037010043,0.000027605,0.00003944569,0.0001416999,0.000083738276,0.9731986,0.009907241,0.012395594,0.0036321438,0.000020684696],"about_ca_topic_score_codex":0.004297231,"about_ca_topic_score_gemma":0.006493174,"teacher_disagreement_score":0.004297231,"about_ca_system_score_codex":0.0010167466,"about_ca_system_score_gemma":0.001347214,"threshold_uncertainty_score":0.013529122},"labels":[],"label_agreement":null},{"id":"W4283790221","doi":"10.1609/aaai.v36i10.21369","title":"Post-OCR Document Correction with Large Ensembles of Character Sequence-to-Sequence Models","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Handwritten Text Recognition Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Dalhousie University; Consejo de Investigación, Universidad Nacional de Salta; Consejo Nacional de Investigaciones Científicas y Técnicas; Compute Canada","keywords":"Sequence (biology); Computer science; Optical character recognition; Character (mathematics); Artificial intelligence; Code (set theory); Natural language processing; Task (project management); Process (computing); Pattern recognition (psychology); Speech recognition; Image (mathematics); Mathematics; Programming language","score_opus":0.07268029614619377,"score_gpt":0.29639702582878513,"score_spread":0.22371672968259138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283790221","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.039792005,0.00079595327,0.94716847,0.00026195165,0.00029201058,0.00012834951,0.0002555643,0.009959968,0.001345699],"genre_scores_gemma":[0.4001292,0.00051207567,0.5840236,0.00051646394,0.000306493,0.0002124684,0.0018785127,0.0015266594,0.010894562],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982868,0.00024801717,0.00010135442,0.00059342803,0.00061751815,0.00015280159],"domain_scores_gemma":[0.9954548,0.0012727851,0.00037309405,0.0012731373,0.0014534623,0.00017279816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018848957,0.0019553795,0.001567188,0.0013645893,0.00082173664,0.0012270825,0.0023181008,0.0016445285,0.0026586612],"category_scores_gemma":[0.0064700185,0.00080042443,0.0016629171,0.0009841402,0.0005782124,0.0024013983,0.001382359,0.0028887787,0.0032477628],"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.00041528943,0.00020786277,0.00336409,0.0001504255,0.00031575875,0.0002615209,0.0001856009,0.19949429,0.053351346,0.0016565036,0.005738848,0.7348585],"study_design_scores_gemma":[0.000010212223,0.00010062439,0.00089412177,0.000017664095,0.00005271167,0.00014836036,0.00003517434,0.9615311,0.031284492,0.0019481143,0.003947073,0.000030345322],"about_ca_topic_score_codex":0.0077207624,"about_ca_topic_score_gemma":0.015110753,"teacher_disagreement_score":0.0077207624,"about_ca_system_score_codex":0.00091318,"about_ca_system_score_gemma":0.0014998163,"threshold_uncertainty_score":0.015351653},"labels":[],"label_agreement":null},{"id":"W4283790576","doi":"10.1609/aaai.v36i10.21340","title":"From Fully Trained to Fully Random Embeddings: Improving Neural Machine Translation with Compact Word Embedding Tables","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Natural Language Processing 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":"McGill University; Thomson Reuters (Canada)","funders":"","keywords":"Computer science; Embedding; Machine translation; Word (group theory); Word embedding; Natural language processing; Artificial intelligence; Context (archaeology); Artificial neural network; Task (project management); Key (lock); Language model; Speech recognition; Mathematics","score_opus":0.03792903244196088,"score_gpt":0.29245507295840056,"score_spread":0.2545260405164397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283790576","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.1300249,0.002354999,0.8464744,0.0006742985,0.00043589674,0.00012101975,0.00091318495,0.014710803,0.004290365],"genre_scores_gemma":[0.59752625,0.001036682,0.3869179,0.0005391847,0.00023161381,0.00028040883,0.0052529573,0.0010086083,0.0072063454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918896,0.00031428895,0.00009158217,0.00018563237,0.00016307428,0.000056475812],"domain_scores_gemma":[0.99772996,0.0011174551,0.00015055173,0.0005784644,0.00037406894,0.00004954599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001331958,0.0012973568,0.0011103975,0.0006773446,0.00031266978,0.0012776094,0.0012841919,0.0010317115,0.0038294645],"category_scores_gemma":[0.007882078,0.0005212794,0.00063184835,0.0011737149,0.0004968648,0.0048467754,0.0014303412,0.0014053214,0.003698566],"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.0005528746,0.00027292673,0.0010769105,0.00029342485,0.00013243099,0.00028219927,0.00017543788,0.32911032,0.016793348,0.009971699,0.012049641,0.6292888],"study_design_scores_gemma":[0.000038729824,0.00013021336,0.00018118,0.000019670008,0.000024208417,0.00007566519,0.000028248898,0.9816976,0.0059475964,0.009344322,0.00249516,0.000017439295],"about_ca_topic_score_codex":0.0021340197,"about_ca_topic_score_gemma":0.0033528209,"teacher_disagreement_score":0.0038294645,"about_ca_system_score_codex":0.00045843743,"about_ca_system_score_gemma":0.0006869913,"threshold_uncertainty_score":0.012810886},"labels":[],"label_agreement":null},{"id":"W4283790997","doi":"10.1609/aaai.v36i11.21461","title":"Gender and Racial Stereotype Detection in Legal Opinion Word Embeddings","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Law","field":"Social Sciences","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":"Thomson Reuters (Canada)","funders":"","keywords":"Word (group theory); Stereotype (UML); Harm; Natural language processing; Computer science; Artificial intelligence; Domain (mathematical analysis); Psychology; Social psychology; Linguistics","score_opus":0.10991918777270078,"score_gpt":0.3575881682297158,"score_spread":0.24766898045701502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283790997","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.8338046,0.0007151274,0.15354231,0.0012851532,0.00034547728,0.000104416475,0.0023624785,0.0006051695,0.0072352574],"genre_scores_gemma":[0.96920544,0.00015905238,0.027283184,0.00018251468,0.00006383948,0.00006949372,0.0017835451,0.00006896225,0.0011838005],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9988574,0.0005022773,0.00011269935,0.00021588466,0.0002080622,0.00010376719],"domain_scores_gemma":[0.9946509,0.0030834388,0.0006048759,0.0005502633,0.0010226613,0.00008793866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016910278,0.00054446876,0.00021775132,0.0013270015,0.00035603976,0.0011043457,0.00025636793,0.00064014795,0.0020578718],"category_scores_gemma":[0.015020969,0.00016846567,0.00033520247,0.001140363,0.0005409832,0.0023353803,0.0010349705,0.0010391496,0.0008371087],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073713297,0.0003277731,0.19562912,0.0005638895,0.00022095439,0.0006756705,0.0066353553,0.01861336,0.050485052,0.026328187,0.016451709,0.6833318],"study_design_scores_gemma":[0.00007522619,0.0005269668,0.17779729,0.0004281269,0.00027326818,0.0017468901,0.009121666,0.59557825,0.05390218,0.113818996,0.04654991,0.00018119685],"about_ca_topic_score_codex":0.0014176928,"about_ca_topic_score_gemma":0.0026021516,"teacher_disagreement_score":0.0020578718,"about_ca_system_score_codex":0.00040752708,"about_ca_system_score_gemma":0.00036176175,"threshold_uncertainty_score":0.0089431405},"labels":[],"label_agreement":null},{"id":"W4283791154","doi":"10.1609/aaai.v36i11.21593","title":"Annotation Cost-Sensitive Deep Active Learning with Limited Data (Student Abstract)","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"MNIST database; Computer science; Artificial intelligence; Annotation; Deep learning; Active learning (machine learning); Machine learning; Context (archaeology); Task (project management); Labeled data; Biology; Engineering","score_opus":0.07314071175042759,"score_gpt":0.31633812135045475,"score_spread":0.24319740960002717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283791154","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.028811844,0.0008470501,0.96281916,0.0020183658,0.00038493847,0.00008202538,0.0004846074,0.0018709206,0.0026811971],"genre_scores_gemma":[0.57629836,0.00063703954,0.3939891,0.0013010398,0.0008035922,0.00035836702,0.00273788,0.0007414428,0.0231332],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980262,0.000825918,0.00008526545,0.00054571783,0.0003487036,0.00016808386],"domain_scores_gemma":[0.990045,0.006286006,0.00036874224,0.001654075,0.0012477328,0.00039839986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005173429,0.000951396,0.0013257104,0.0007247125,0.0007061334,0.0022851676,0.0030860018,0.0027017747,0.0060807923],"category_scores_gemma":[0.014395325,0.00066337484,0.0009471451,0.0008737618,0.0014717844,0.0030876657,0.0030281185,0.0038278056,0.0017376018],"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.0011154698,0.0005046806,0.0025737754,0.00030690635,0.00014631724,0.00031020204,0.00028633975,0.23075175,0.017290356,0.032081272,0.037725836,0.6769072],"study_design_scores_gemma":[0.000031997133,0.000060872084,0.0002851982,0.00002239797,0.00001315983,0.000050354018,0.00002023289,0.967508,0.008246022,0.021057578,0.0026887741,0.000015432586],"about_ca_topic_score_codex":0.0038148835,"about_ca_topic_score_gemma":0.005693679,"teacher_disagreement_score":0.0060807923,"about_ca_system_score_codex":0.0012015348,"about_ca_system_score_gemma":0.0010317395,"threshold_uncertainty_score":0.027360022},"labels":[],"label_agreement":null},{"id":"W4283791599","doi":"10.1609/aaai.v36i11.21655","title":"Integer and Constraint Programming Revisited for Mutually Orthogonal Latin Squares (Student Abstract)","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI 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":"University of Windsor; Carleton University","funders":"","keywords":"Integer programming; Constraint (computer-aided design); Integer (computer science); Constraint programming; Computer science; Latin square; Constraint satisfaction problem; Order (exchange); Orthogonal array; Mathematics; Scheme (mathematics); Mathematical optimization; Programming language; Artificial intelligence","score_opus":0.058133838320357914,"score_gpt":0.3001416664436412,"score_spread":0.2420078281232833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283791599","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.033155885,0.000888794,0.931929,0.0025573208,0.0002729141,0.00014456533,0.00030383232,0.0003181182,0.030429566],"genre_scores_gemma":[0.16283157,0.00039604388,0.8294893,0.0005632946,0.00014876694,0.0002038006,0.00022583576,0.00024158729,0.005899768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791354,0.0010037082,0.00008954182,0.0002623566,0.0005235677,0.00020730475],"domain_scores_gemma":[0.9932875,0.005384711,0.0003851202,0.00033598344,0.00045551467,0.00015118562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002909304,0.00063376536,0.00072169653,0.0007958566,0.00095124874,0.0023605847,0.0011100825,0.0010166242,0.009268994],"category_scores_gemma":[0.012030428,0.0006255875,0.0010703364,0.0020580315,0.0018943849,0.002160809,0.0019117657,0.0029810015,0.00091090583],"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.00013294816,0.00014603797,0.00073399744,0.00024373308,0.0000545421,0.0003264675,0.00022867449,0.23893318,0.0017385435,0.65527976,0.01002281,0.09215927],"study_design_scores_gemma":[0.000054621072,0.000046139525,0.00014434363,0.00006893513,0.0000174531,0.00011783085,0.00013821616,0.69691414,0.0029533496,0.28463924,0.014876866,0.000028828637],"about_ca_topic_score_codex":0.004857581,"about_ca_topic_score_gemma":0.0055588353,"teacher_disagreement_score":0.009268994,"about_ca_system_score_codex":0.0012342581,"about_ca_system_score_gemma":0.001910817,"threshold_uncertainty_score":0.031007886},"labels":[],"label_agreement":null},{"id":"W4283791892","doi":"10.1609/aaai.v36i7.20744","title":"What Can We Learn Even from the Weakest? Learning Sketches for Programmatic Strategies","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Compute Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Canadian Institute for Advanced Research","keywords":"Sketch; Computer science; Cloning (programming); Action (physics); Artificial intelligence; Human–computer interaction; Programming language; Algorithm","score_opus":0.09476838440004962,"score_gpt":0.31058380478221725,"score_spread":0.21581542038216764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283791892","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.08307689,0.0019407686,0.90179074,0.0025735798,0.00020041205,0.00014473128,0.00021850938,0.0017398248,0.008314485],"genre_scores_gemma":[0.5618934,0.0014827054,0.42778128,0.0006672893,0.000094673705,0.000254089,0.00039997307,0.0003810983,0.007045584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989826,0.00035453466,0.00006983565,0.0002695779,0.00024404438,0.00007940381],"domain_scores_gemma":[0.99416983,0.004001196,0.00026997027,0.0010190068,0.00031626812,0.00022370608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022545883,0.0011772016,0.00077570917,0.00057042175,0.00043101743,0.0015702619,0.0013059065,0.0011970003,0.0050539766],"category_scores_gemma":[0.020907352,0.0007410569,0.0009975643,0.00022806502,0.002086394,0.006101887,0.0019417013,0.0024037687,0.0011932122],"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.00041933983,0.00022214165,0.0069752666,0.0015754703,0.0003370419,0.000348631,0.0013101202,0.23398598,0.020435663,0.25627884,0.0059832362,0.47212827],"study_design_scores_gemma":[0.00011539811,0.0004464552,0.00087138516,0.0003341146,0.00013592967,0.00030292606,0.0003465516,0.5277596,0.015143406,0.43059194,0.023865223,0.00008705915],"about_ca_topic_score_codex":0.0006625083,"about_ca_topic_score_gemma":0.0011602875,"teacher_disagreement_score":0.0050539766,"about_ca_system_score_codex":0.0005996673,"about_ca_system_score_gemma":0.0006078436,"threshold_uncertainty_score":0.016907215},"labels":[],"label_agreement":null},{"id":"W4283792384","doi":"10.1609/aaai.v36i11.21524","title":"Learning Space-Time Crop Yield Patterns with Zigzag Persistence-Based LSTM: Toward More Reliable Digital Agriculture Insurance","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Remote Sensing in Agriculture","field":"Environmental Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Agriculture and Agri-Food Canada","funders":"Division of Electrical, Communications and Cyber Systems; Agriculture and Agri-Food Canada; Nuclear Safety and Security Commission; National Aeronautics and Space Administration; National Science Foundation","keywords":"Computer science; Variety (cybernetics); Big data; Crop insurance; Data science; Agriculture; Scalability; Artificial intelligence; Machine learning; Data mining; Geography; Database","score_opus":0.03106702647326351,"score_gpt":0.21359715400373963,"score_spread":0.18253012753047612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283792384","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.15112136,0.0008714949,0.8403183,0.0010476351,0.00015908433,0.000030974337,0.00044581637,0.0026615544,0.003343701],"genre_scores_gemma":[0.8981002,0.000442461,0.098604694,0.00029181116,0.000053074433,0.000037681166,0.00046667457,0.000075590244,0.0019278326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99992573,0.000012595845,0.0000048111724,0.00002660736,0.000017181066,0.000013184806],"domain_scores_gemma":[0.9997212,0.00013855536,0.000040143917,0.0000339194,0.00005322954,0.0000128542815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032857174,0.00037055844,0.00025134202,0.00028592243,0.00012203918,0.0005608019,0.00074337056,0.0004873902,0.0007486752],"category_scores_gemma":[0.0011797054,0.00020507102,0.00025336017,0.00049260876,0.00029164352,0.0010062817,0.00052629196,0.0009804216,0.00027228828],"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.0001780703,0.000103676975,0.003579736,0.00009167375,0.00009877626,0.00011640208,0.00015731128,0.59584236,0.015167708,0.004393514,0.0035527863,0.3767179],"study_design_scores_gemma":[0.00000354513,0.000013900688,0.00047697756,0.000005222008,0.0000077471095,0.000009981401,0.000011549568,0.99376124,0.0013095085,0.0039653117,0.00043130593,0.0000037096597],"about_ca_topic_score_codex":0.0044259927,"about_ca_topic_score_gemma":0.0062115327,"teacher_disagreement_score":0.0044259927,"about_ca_system_score_codex":0.00045944058,"about_ca_system_score_gemma":0.0004096985,"threshold_uncertainty_score":0.008800507},"labels":[],"label_agreement":null},{"id":"W4283792637","doi":"10.1609/aaai.v36i11.21591","title":"Multi-Dimension Attention for Multi-Turn Dialog Generation (Student Abstract)","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Dialog box; Dimension (graph theory); Computer science; Generative grammar; Scope (computer science); Generative model; Artificial intelligence; Process (computing); Dialog system; Natural language processing; Semantic interpretation; Speech recognition; Programming language; Mathematics; World Wide Web","score_opus":0.2006134807242427,"score_gpt":0.3464957192817173,"score_spread":0.1458822385574746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283792637","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.13969073,0.0008964765,0.8526291,0.0010314597,0.00017395156,0.00008875481,0.00023473821,0.0016606704,0.0035940988],"genre_scores_gemma":[0.9401259,0.00018800731,0.054934356,0.00022458885,0.00007664555,0.000105582796,0.00019039788,0.000091868234,0.004062757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996296,0.00016660006,0.000012719689,0.00010589067,0.000034102006,0.000051003415],"domain_scores_gemma":[0.99876714,0.0009202151,0.00005998671,0.00007709,0.000115972965,0.00005960333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012495398,0.00054215395,0.0005051647,0.00045990568,0.00037008978,0.0006245738,0.001052411,0.0009907396,0.0031011929],"category_scores_gemma":[0.0027189597,0.00034667063,0.0009106671,0.00038595524,0.0005719589,0.0009600231,0.0012139948,0.0015175627,0.00051545945],"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.00035398762,0.00017365116,0.002330375,0.00011124658,0.00013314701,0.00024716728,0.000493772,0.77284515,0.011674315,0.018421084,0.0031575104,0.19005854],"study_design_scores_gemma":[0.000004511222,0.00001658737,0.00019649311,0.0000027209383,0.000007072393,0.000016300053,0.0000050749004,0.9955396,0.0005841331,0.0034603311,0.0001622622,0.0000048816055],"about_ca_topic_score_codex":0.007739891,"about_ca_topic_score_gemma":0.008144091,"teacher_disagreement_score":0.007739891,"about_ca_system_score_codex":0.0009334032,"about_ca_system_score_gemma":0.0005642933,"threshold_uncertainty_score":0.015389681},"labels":[],"label_agreement":null},{"id":"W4283792669","doi":"10.1609/aaai.v36i10.21386","title":"Supervising Model Attention with Human Explanations for Robust Natural Language Inference","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Azrieli Foundation","keywords":"Computer science; Premise; Inference; Artificial intelligence; Natural (archaeology); Task (project management); Punctuation; Natural language; Natural language processing; Focus (optics); Language model; Machine learning; Linguistics","score_opus":0.11284071439454472,"score_gpt":0.31577590586730336,"score_spread":0.20293519147275862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283792669","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.052186023,0.0008409338,0.934971,0.0011284221,0.0001020803,0.00015897777,0.00020472534,0.008078294,0.0023296694],"genre_scores_gemma":[0.7772051,0.0002346528,0.21826543,0.0007872792,0.00014431607,0.00017649797,0.0006178156,0.00046420164,0.0021046796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974688,0.0012479803,0.00008910045,0.0006963563,0.0003472985,0.0001504321],"domain_scores_gemma":[0.98779035,0.008216796,0.00060627493,0.0022949176,0.0007854195,0.0003062196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046649324,0.0013711948,0.0010502111,0.0009251531,0.00056920137,0.0014656815,0.0027464346,0.0021489463,0.0038510002],"category_scores_gemma":[0.024486259,0.00081616745,0.001004936,0.00070614106,0.0013689655,0.0036124568,0.0026633965,0.004356109,0.0013522324],"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.0008731686,0.0006842437,0.010058071,0.00045633086,0.00033990567,0.0003348166,0.0017353774,0.29755968,0.02552943,0.017947556,0.015260734,0.6292207],"study_design_scores_gemma":[0.00005852709,0.000074921285,0.000906023,0.000025306572,0.000043416356,0.00007947381,0.00007258608,0.96445847,0.004664514,0.026933217,0.0026588095,0.000024699373],"about_ca_topic_score_codex":0.0073189256,"about_ca_topic_score_gemma":0.014839629,"teacher_disagreement_score":0.0073189256,"about_ca_system_score_codex":0.0013893249,"about_ca_system_score_gemma":0.0019382917,"threshold_uncertainty_score":0.02467078},"labels":[],"label_agreement":null},{"id":"W4283793872","doi":"10.1609/aaai.v36i11.21564","title":"Artificial Intelligence Approaches to Build Ticket to Ride Maps","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","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":"MacEwan University","funders":"","keywords":"Monte Carlo tree search; Computer science; Ticket; Bipartite graph; Graph; Tree (set theory); Focus (optics); Game tree; Theoretical computer science; Artificial intelligence; Monte Carlo method; Game theory; Sequential game; Mathematics; Computer security","score_opus":0.2200438509806717,"score_gpt":0.3086271385962788,"score_spread":0.08858328761560713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283793872","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.029673502,0.00025420077,0.95714563,0.00024055429,0.00004347304,0.00030287183,0.00005955317,0.001254665,0.011025485],"genre_scores_gemma":[0.2611406,0.0002516961,0.734345,0.00011394993,0.000016033533,0.0003668641,0.00022551758,0.00024525292,0.0032951126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881387,0.0004983354,0.000045952416,0.00016766493,0.00038655076,0.00008765134],"domain_scores_gemma":[0.9975987,0.0014048866,0.00016878691,0.00043281273,0.0002741543,0.000120707475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001523346,0.0013055371,0.0005572399,0.0012275242,0.00065235037,0.0014301764,0.0021504683,0.00087368855,0.0048809918],"category_scores_gemma":[0.005332127,0.00081615575,0.0008616606,0.000717675,0.0014010452,0.001982178,0.001771807,0.0015260886,0.0008624791],"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.00007177816,0.00022989787,0.0013310538,0.00027287588,0.000082295315,0.00012468126,0.00033504696,0.8249776,0.0044348133,0.06240891,0.0015483566,0.104182675],"study_design_scores_gemma":[0.00003744954,0.00012826339,0.0003147914,0.000025121486,0.000034077453,0.00009011488,0.00012089089,0.95202,0.0028256634,0.034046687,0.010342428,0.000014630973],"about_ca_topic_score_codex":0.004785181,"about_ca_topic_score_gemma":0.005921605,"teacher_disagreement_score":0.0048809918,"about_ca_system_score_codex":0.0011735499,"about_ca_system_score_gemma":0.0011655827,"threshold_uncertainty_score":0.016328573},"labels":[],"label_agreement":null},{"id":"W4283793952","doi":"10.1609/aaai.v36i8.20815","title":"Generalized Equivariance and Preferential Labeling for GNN Node Classification","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China; Innovation and Technology Commission; Compute Canada; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Node (physics); Computer science; Embedding; Property (philosophy); Identity (music); Graph; Theoretical computer science; Data mining; Artificial intelligence","score_opus":0.12324925854859284,"score_gpt":0.3161050023193992,"score_spread":0.19285574377080636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283793952","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.034231335,0.00021069603,0.96274734,0.00040748314,0.000045677854,0.00010227086,0.00015757138,0.00075985095,0.0013377854],"genre_scores_gemma":[0.48478827,0.0002805278,0.5093497,0.00048343677,0.00011490505,0.00026058799,0.001127956,0.00022770869,0.0033668699],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99580944,0.00175808,0.0002503741,0.0012985906,0.0006273226,0.00025616103],"domain_scores_gemma":[0.9841171,0.008120421,0.0011463669,0.0044954843,0.0016810192,0.00043961566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005018571,0.0009958906,0.0015726553,0.0016688909,0.0016401089,0.0014526049,0.003310602,0.002014926,0.0020144514],"category_scores_gemma":[0.020101035,0.00071045564,0.0011130791,0.002574813,0.002502719,0.005242737,0.0030170283,0.003511038,0.0009290024],"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.00069250027,0.00028544385,0.009156895,0.00027481443,0.00015478524,0.00028256836,0.00056626805,0.42131528,0.007059795,0.10934747,0.007900618,0.4429636],"study_design_scores_gemma":[0.000018288214,0.00004321241,0.00029139422,0.000009920908,0.000017302455,0.00008723729,0.00003861736,0.9346433,0.002089249,0.0618039,0.00094195746,0.00001558746],"about_ca_topic_score_codex":0.0045090606,"about_ca_topic_score_gemma":0.007489827,"teacher_disagreement_score":0.005018571,"about_ca_system_score_codex":0.0021717502,"about_ca_system_score_gemma":0.0020826359,"threshold_uncertainty_score":0.026541114},"labels":[],"label_agreement":null},{"id":"W4283794045","doi":"10.1609/aaai.v36i11.21581","title":"Socially Intelligent Affective AI","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Psychiatry, Mental Health, Neuroscience","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Affect (linguistics); Affective computing; Feeling; Context (archaeology); Computer science; Plan (archaeology); Focus (optics); Event (particle physics); Emotion detection; Cognitive psychology; Task (project management); Artificial intelligence; Social intelligence; Human–computer interaction; Psychology; Social psychology; Emotion recognition; Communication; Engineering","score_opus":0.06390683959934182,"score_gpt":0.3183797135092722,"score_spread":0.25447287390993034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283794045","genre_codex":"other","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.042047758,0.006484158,0.3237155,0.038813412,0.0019576438,0.00021530465,0.00022842245,0.00078502734,0.5857528],"genre_scores_gemma":[0.85277164,0.003639281,0.07883273,0.0053701825,0.0008373487,0.00027671512,0.00025942503,0.000191197,0.057821386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988674,0.00052947144,0.000046820514,0.00018962454,0.00025479228,0.0001119041],"domain_scores_gemma":[0.99886924,0.0004164795,0.00009577946,0.00020078698,0.00024165177,0.00017612037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013365059,0.0005544474,0.00028061305,0.00050374045,0.0013612729,0.0037616214,0.00074746256,0.0011740017,0.0062038815],"category_scores_gemma":[0.003235099,0.0002401368,0.00049274776,0.00030099778,0.0037197163,0.002485734,0.0025906505,0.001737255,0.0015694234],"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.000033478675,0.000057734356,0.0011862962,0.00020881552,0.000046446636,0.0001649606,0.0019657135,0.0047340817,0.004278198,0.91903603,0.017006716,0.0512815],"study_design_scores_gemma":[0.000017593275,0.0000456552,0.001293315,0.00007978728,0.00002984955,0.00025017714,0.0012861165,0.021741325,0.001438509,0.84758365,0.12619714,0.000036863494],"about_ca_topic_score_codex":0.0012411872,"about_ca_topic_score_gemma":0.0010662671,"teacher_disagreement_score":0.0062038815,"about_ca_system_score_codex":0.0012920648,"about_ca_system_score_gemma":0.00082014577,"threshold_uncertainty_score":0.020754099},"labels":[],"label_agreement":null},{"id":"W4283794051","doi":"10.1609/aaai.v36i7.20762","title":"Bag Graph: Multiple Instance Learning Using Bayesian Graph Neural Networks","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministère de la Défense Nationale","keywords":"Computer science; Artificial intelligence; Machine learning; Graph; Pooling; Artificial neural network; Bayesian network; Theoretical computer science","score_opus":0.06644305000915629,"score_gpt":0.2860817504712997,"score_spread":0.2196387004621434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283794051","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.008624728,0.0004212707,0.9870724,0.00037474773,0.00005605897,0.00007987427,0.0003267025,0.0019046622,0.0011396329],"genre_scores_gemma":[0.41702563,0.0007294419,0.5711225,0.00092724996,0.00018153158,0.00037756504,0.0037422916,0.00069795334,0.0051957616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872774,0.0004854899,0.000043710974,0.00039975782,0.00025002108,0.00009331421],"domain_scores_gemma":[0.9979214,0.0010575242,0.0002375565,0.000357985,0.00027944136,0.00014604855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018451358,0.0015745753,0.0016919209,0.0019892496,0.0007447518,0.0019118484,0.0039868173,0.0029553347,0.0037958836],"category_scores_gemma":[0.00768796,0.00095402333,0.0013397927,0.0023409831,0.0009597336,0.0053024357,0.002447862,0.0035268671,0.0015461493],"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.00028600232,0.0002824885,0.0023529097,0.00021275961,0.00020329854,0.00016900878,0.00017184427,0.5901714,0.002009974,0.04453014,0.014249719,0.34536055],"study_design_scores_gemma":[0.000009184468,0.000015292659,0.00009321067,0.000010229358,0.000009840677,0.00001803848,0.000009019899,0.9670008,0.00035240062,0.031769,0.0007057594,0.0000072801467],"about_ca_topic_score_codex":0.0071202484,"about_ca_topic_score_gemma":0.010125841,"teacher_disagreement_score":0.0071202484,"about_ca_system_score_codex":0.0016446015,"about_ca_system_score_gemma":0.0011631836,"threshold_uncertainty_score":0.014157593},"labels":[],"label_agreement":null},{"id":"W4283794072","doi":"10.1609/aaai.v36i11.21679","title":"NeuralArTS: Structuring Neural Architecture Search with Type Theory (Student Abstract)","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Neural Networks and Applications","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 Toronto","funders":"","keywords":"Structuring; Computer science; Architecture; Set (abstract data type); Convolutional neural network; Artificial neural network; Task (project management); Artificial intelligence; Scratch; Space (punctuation); Type (biology); Machine learning; Theoretical computer science; Engineering; Programming language","score_opus":0.052022085327000415,"score_gpt":0.29159257454656373,"score_spread":0.2395704892195633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283794072","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.005697976,0.00026672287,0.9844892,0.0004021978,0.00013731734,0.000080977064,0.00010793808,0.0014111175,0.0074064406],"genre_scores_gemma":[0.15692236,0.00039931832,0.83075505,0.00053179165,0.00022314444,0.0004015407,0.00044748557,0.00093832746,0.009380962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829656,0.0007046647,0.00015324715,0.00029390908,0.0004197545,0.000131925],"domain_scores_gemma":[0.9965738,0.0018380996,0.00020419502,0.000828579,0.0004019585,0.00015347355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032624092,0.00060124707,0.00092566654,0.0011763239,0.0010125489,0.0031825078,0.0024496594,0.0014532434,0.011925435],"category_scores_gemma":[0.010046182,0.00061441894,0.0020044118,0.0011469121,0.0033100448,0.004421889,0.0035795625,0.002730437,0.002791937],"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.00018436706,0.00008552126,0.0010462872,0.00018307315,0.000069229565,0.00014066146,0.0002196419,0.09903857,0.0022994587,0.7432684,0.011929886,0.14153488],"study_design_scores_gemma":[0.000044908644,0.000073943964,0.000093254974,0.000062778236,0.000022702534,0.00009797646,0.000042769083,0.42577022,0.003143687,0.55612713,0.014493582,0.000027116497],"about_ca_topic_score_codex":0.0017020458,"about_ca_topic_score_gemma":0.002493003,"teacher_disagreement_score":0.011925435,"about_ca_system_score_codex":0.0013124133,"about_ca_system_score_gemma":0.0015010142,"threshold_uncertainty_score":0.03989452},"labels":[],"label_agreement":null},{"id":"W4283794091","doi":"10.1609/aaai.v36i1.19938","title":"PatchUp: A Feature-Space Block-Level Regularization Technique for Convolutional Neural Networks","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; McGill University; Université de Montréal","funders":"Compute Canada; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Convolutional neural network; Artificial intelligence; Regularization (linguistics); Robustness (evolution); Pattern recognition (psychology); Feature vector; Generalization; Block (permutation group theory); Deep neural networks; Deep learning; Machine learning; Mathematics","score_opus":0.05613656257909424,"score_gpt":0.2852592275984625,"score_spread":0.22912266501936826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283794091","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.013005402,0.00022517194,0.98369795,0.00013913248,0.000030900155,0.00006710418,0.00009103445,0.0018543702,0.0008890732],"genre_scores_gemma":[0.3632815,0.00037770116,0.6278802,0.00039116514,0.0000955737,0.00042159122,0.0008223343,0.000787145,0.0059427307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995541,0.00013361574,0.000020846315,0.00008515965,0.0001519976,0.000054228003],"domain_scores_gemma":[0.999356,0.00019663297,0.00007793501,0.0002166588,0.000111567024,0.0000413346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001210649,0.00098548,0.0008202153,0.00055045576,0.00042470338,0.00040565748,0.0014223495,0.0010573772,0.0019128259],"category_scores_gemma":[0.0025147195,0.00042690808,0.0007514596,0.0005359713,0.0007742115,0.0010152531,0.001471205,0.0022180723,0.0006364389],"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.00035127538,0.00028470246,0.002205917,0.00021054495,0.0002741685,0.0001801334,0.00019342951,0.5061443,0.0636306,0.035482336,0.015333447,0.37570912],"study_design_scores_gemma":[0.000014929776,0.0000618517,0.0001988197,0.000007995526,0.000012108479,0.00004360913,0.0000057192856,0.98569447,0.007993415,0.0039206324,0.0020378844,0.000008548451],"about_ca_topic_score_codex":0.0030547788,"about_ca_topic_score_gemma":0.0052571706,"teacher_disagreement_score":0.0030547788,"about_ca_system_score_codex":0.00057159783,"about_ca_system_score_gemma":0.0009104711,"threshold_uncertainty_score":0.006402552},"labels":[],"label_agreement":null},{"id":"W4283794194","doi":"10.1609/aaai.v36i5.20524","title":"Using Conditional Independence for Belief Revision","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Belief revision; Dependency (UML); Independence (probability theory); Conditional independence; Computer science; Domain (mathematical analysis); ENCODE; Operator (biology); Knowledge base; Belief structure; Artificial intelligence; Theoretical computer science; Mathematics","score_opus":0.1380607233127197,"score_gpt":0.3326342931215088,"score_spread":0.19457356980878907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283794194","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.006644134,0.00009315212,0.9879775,0.00049870036,0.00004293254,0.000087409906,0.00007017363,0.00024284906,0.0043431805],"genre_scores_gemma":[0.5714574,0.0002080767,0.42420954,0.0005091697,0.0002303778,0.00050027523,0.00019911275,0.000109956265,0.0025761789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98278886,0.008617284,0.0010613191,0.0019978639,0.004848071,0.0006865815],"domain_scores_gemma":[0.950882,0.033009645,0.003141027,0.0071396134,0.0049347053,0.0008929459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017110089,0.0010146309,0.0009548549,0.0024762743,0.0011954665,0.003270224,0.0022311637,0.0012004788,0.004094808],"category_scores_gemma":[0.054366853,0.0007656092,0.0025529624,0.0015474587,0.004890787,0.0056605954,0.004664078,0.004256666,0.00055700843],"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.000105574196,0.000073753006,0.00090238126,0.00021373852,0.00014641487,0.00017836463,0.0009362239,0.034422718,0.002284606,0.918591,0.0010298297,0.04111534],"study_design_scores_gemma":[0.000053331147,0.00011978998,0.00037309714,0.000073908646,0.000074683216,0.000118634554,0.000082752995,0.16871203,0.0022609693,0.8245909,0.0034647144,0.00007517635],"about_ca_topic_score_codex":0.0026412308,"about_ca_topic_score_gemma":0.0028637662,"teacher_disagreement_score":0.017110089,"about_ca_system_score_codex":0.0024814797,"about_ca_system_score_gemma":0.0022729177,"threshold_uncertainty_score":0.0904879},"labels":[],"label_agreement":null},{"id":"W4283796458","doi":"10.1609/aaai.v36i11.21625","title":"Code Representation Learning Using Prüfer Sequences (Student Abstract)","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Software Engineering 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 British Columbia","funders":"","keywords":"Computer science; Representation (politics); Sequence (biology); Syntax; Abstract syntax; Code (set theory); Encoding (memory); Natural language processing; Source code; Artificial intelligence; Lossless compression; Abstract syntax tree; Programming language; Tree (set theory); Scheme (mathematics); Artificial neural network; Theoretical computer science; Data compression; Mathematics","score_opus":0.14454852823829395,"score_gpt":0.36782651393995397,"score_spread":0.22327798570166002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283796458","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.0834218,0.000171873,0.9090769,0.00043717405,0.000088901535,0.0000883588,0.00036749378,0.004048568,0.002298927],"genre_scores_gemma":[0.5737356,0.0002160309,0.41907513,0.00019791297,0.000048786842,0.00017765506,0.0013531788,0.0002441716,0.004951478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996568,0.00009230705,0.000020123283,0.00010484647,0.00009458413,0.00003134503],"domain_scores_gemma":[0.9987809,0.00045995356,0.00015702899,0.0002858466,0.0002557183,0.000060459406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005167469,0.0004806437,0.0002895507,0.00060117204,0.00024704673,0.00055040774,0.0007593586,0.0005845853,0.0031535008],"category_scores_gemma":[0.004273302,0.00018751221,0.00036429716,0.0005598912,0.00047119617,0.0023151075,0.00080906134,0.0011003378,0.0010400113],"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.00044869597,0.00019793732,0.0020970257,0.00016049216,0.00003054173,0.00017533683,0.00021517285,0.17565098,0.032179274,0.03898038,0.0072945375,0.74256957],"study_design_scores_gemma":[0.000017768656,0.00014164146,0.0002484951,0.000014632792,0.000008907357,0.000077047545,0.000020402817,0.9599905,0.016495964,0.019700151,0.0032719157,0.00001263829],"about_ca_topic_score_codex":0.0028395609,"about_ca_topic_score_gemma":0.0025244758,"teacher_disagreement_score":0.0031535008,"about_ca_system_score_codex":0.00046416634,"about_ca_system_score_gemma":0.0007757916,"threshold_uncertainty_score":0.010549545},"labels":[],"label_agreement":null},{"id":"W4283797178","doi":"10.1609/aaai.v36i2.20061","title":"SpikeConverter: An Efficient Conversion Framework Zipping the Gap between Artificial Neural Networks and Spiking Neural Networks","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Memory and Neural Computing","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Key Research and Development Program of China; Shanghai Jiao Tong University; National Natural Science Foundation of China; Institute for Catastrophic Loss Reduction","keywords":"Spiking neural network; Computer science; Artificial neural network; Artificial intelligence; Spike (software development); Inference; Pattern recognition (psychology); Machine learning","score_opus":0.06553404433713134,"score_gpt":0.2765627105121829,"score_spread":0.21102866617505156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283797178","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.03512762,0.00062535185,0.944805,0.00019515316,0.00013030338,0.0001221115,0.0002467706,0.015102317,0.0036453134],"genre_scores_gemma":[0.53140813,0.0006856127,0.45920962,0.0004821636,0.0001065889,0.00032931947,0.001087408,0.0011884532,0.005502702],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999653,0.000054009673,0.00002465735,0.00007722494,0.0001531545,0.000037977366],"domain_scores_gemma":[0.9996445,0.00010306646,0.000027677597,0.00011968193,0.00007115503,0.00003388308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006260593,0.0007760389,0.0006635383,0.00081200054,0.0003829691,0.00096606824,0.002025153,0.000667283,0.0047566174],"category_scores_gemma":[0.0017957115,0.000398538,0.00072666514,0.00062164455,0.0005196899,0.0017498712,0.001806055,0.0014711258,0.0010717416],"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.00051972014,0.00026304123,0.0018196543,0.00024702802,0.00018353695,0.0004487751,0.00018800428,0.23827684,0.046954438,0.037663244,0.010666085,0.6627697],"study_design_scores_gemma":[0.000028102619,0.00008429295,0.0002215444,0.000010067289,0.00001631264,0.0001132366,0.00001815958,0.96956325,0.01426547,0.012070067,0.0035917792,0.000017638306],"about_ca_topic_score_codex":0.0021753688,"about_ca_topic_score_gemma":0.0029320077,"teacher_disagreement_score":0.0047566174,"about_ca_system_score_codex":0.00055152026,"about_ca_system_score_gemma":0.0007820901,"threshold_uncertainty_score":0.015912533},"labels":[],"label_agreement":null},{"id":"W4283797436","doi":"10.1609/aaai.v36i11.21647","title":"A Model for the Prediction of Lifetime Profit Estimate of Dairy Cattle (Student Abstract)","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Food Supply Chain Traceability","field":"Agricultural and Biological Sciences","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":"Université du Québec à Montréal","funders":"","keywords":"Univariate; Profit (economics); Autoregressive integrated moving average; Computer science; Dairy cattle; Time series; Multivariate statistics; Econometrics; Machine learning; Economics; Geography","score_opus":0.1069467520729744,"score_gpt":0.3025395071189891,"score_spread":0.1955927550460147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283797436","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.6098629,0.0018260534,0.3772332,0.001485075,0.00033510095,0.00007365644,0.001808492,0.0015258664,0.00584954],"genre_scores_gemma":[0.9795813,0.00021507923,0.014134301,0.0000855686,0.000038678336,0.00006649831,0.0005327224,0.000022630951,0.005323247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999864,0.000024435509,0.000009053495,0.000053619187,0.000018244298,0.00003061867],"domain_scores_gemma":[0.9997009,0.00014982489,0.000032156066,0.000011119857,0.00008742868,0.000018497401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073385047,0.0005501051,0.0004689141,0.0003481038,0.00026164495,0.00056620204,0.0010348039,0.0009108407,0.0029472176],"category_scores_gemma":[0.0011050997,0.00027719486,0.0005298859,0.00040052136,0.00025056393,0.00054755074,0.00044764602,0.00093082414,0.00043894426],"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.00027634762,0.00010283477,0.005639204,0.000054741693,0.000073689276,0.00009835498,0.00005374139,0.9453072,0.0022386196,0.0016240432,0.0014355407,0.0430957],"study_design_scores_gemma":[0.0000028736645,0.000013148097,0.0005186613,0.0000028354114,0.000005173657,0.000004560479,0.0000027586732,0.9988254,0.00015827805,0.00037646212,0.00008768429,0.0000022769768],"about_ca_topic_score_codex":0.029029515,"about_ca_topic_score_gemma":0.021515477,"teacher_disagreement_score":0.029029515,"about_ca_system_score_codex":0.0009751516,"about_ca_system_score_gemma":0.00067776494,"threshold_uncertainty_score":0.05772108},"labels":[],"label_agreement":null},{"id":"W4283797513","doi":"10.1609/aaai.v36i10.21428","title":"Unsupervised Sentence Representation via Contrastive Learning with Mixing Negatives","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Fundamental Research Funds for the Central Universities; State Key Laboratory of Software Development Environment; National Natural Science Foundation of China; Leverhulme Trust","keywords":"Computer science; Sentence; Artificial intelligence; Representation (politics); Natural language processing; Task (project management); Feature learning; Similarity (geometry); Transfer of learning; Unsupervised learning; Process (computing); Machine learning; Pattern recognition (psychology); Image (mathematics)","score_opus":0.06820739762611006,"score_gpt":0.28246644336630633,"score_spread":0.21425904574019627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283797513","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.055493265,0.00029125263,0.93938243,0.0005845635,0.00007747587,0.00012568645,0.00016921802,0.0013985181,0.0024776182],"genre_scores_gemma":[0.7077226,0.00020121127,0.28251043,0.0009395079,0.000201546,0.00041288292,0.0011574548,0.0003273368,0.006526984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987382,0.00052063836,0.00005683782,0.00039832576,0.00021681703,0.000069215544],"domain_scores_gemma":[0.9969681,0.0017779766,0.00024091275,0.00040915346,0.00047120923,0.0001326247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022315884,0.0012236737,0.0009705824,0.00092686294,0.0006068878,0.0012295364,0.0021208115,0.0013784518,0.002270404],"category_scores_gemma":[0.007983832,0.000490346,0.0008503343,0.0005815771,0.0014437945,0.0032240332,0.002410583,0.0025804404,0.0010604615],"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.0008038707,0.00062505406,0.0050572003,0.00037991727,0.00017462789,0.00045123472,0.0009279402,0.23501262,0.05185749,0.05842924,0.012200104,0.63408077],"study_design_scores_gemma":[0.00002459983,0.0001285058,0.00027733305,0.000013099593,0.000017869044,0.000068102556,0.000033476797,0.9704515,0.0053003114,0.022380568,0.0012897974,0.00001475702],"about_ca_topic_score_codex":0.00079691556,"about_ca_topic_score_gemma":0.0016864054,"teacher_disagreement_score":0.002270404,"about_ca_system_score_codex":0.000754029,"about_ca_system_score_gemma":0.00065350655,"threshold_uncertainty_score":0.0118018985},"labels":[],"label_agreement":null},{"id":"W4283797648","doi":"10.1609/aaai.v36i9.21183","title":"Incorporating Item Frequency for Differentially Private Set Union","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Differential privacy; Set (abstract data type); Computer science; Differential (mechanical device); Limit (mathematics); Sampling (signal processing); Greedy algorithm; European union; Data mining; Artificial intelligence; Mathematics; Algorithm; Telecommunications; Economics; Engineering","score_opus":0.09852285707948452,"score_gpt":0.30453005114242454,"score_spread":0.20600719406294002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283797648","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.02596613,0.00047136552,0.96983814,0.00082263094,0.00006599317,0.00023050669,0.00022476238,0.0005585329,0.0018219345],"genre_scores_gemma":[0.67043644,0.0005082772,0.32327625,0.0006253616,0.00033060668,0.0006107499,0.00053723645,0.00020106944,0.0034740076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9681779,0.015887663,0.0015821203,0.0048578917,0.0076746,0.0018199035],"domain_scores_gemma":[0.91673607,0.04131825,0.0058206185,0.031426072,0.0030442502,0.0016547918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026204927,0.0017717261,0.0043082093,0.0028831805,0.0026740322,0.005191924,0.0091627715,0.004762273,0.003566399],"category_scores_gemma":[0.068562195,0.0014174464,0.0028849423,0.005357017,0.005293068,0.020357547,0.010190448,0.006125074,0.0013052411],"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.0025370966,0.0011506621,0.008071437,0.0005422906,0.00052087166,0.00056161796,0.0015839766,0.4028581,0.0106430985,0.3109044,0.00622266,0.25440383],"study_design_scores_gemma":[0.00018561515,0.00046675082,0.00071961473,0.00006467496,0.00011470182,0.0006464805,0.00020537534,0.7534393,0.0069272984,0.23167498,0.00544716,0.0001081733],"about_ca_topic_score_codex":0.00076584343,"about_ca_topic_score_gemma":0.000576659,"teacher_disagreement_score":0.026204927,"about_ca_system_score_codex":0.0037043267,"about_ca_system_score_gemma":0.0026055658,"threshold_uncertainty_score":0.13858658},"labels":[],"label_agreement":null},{"id":"W4283797864","doi":"10.1609/aaai.v36i9.21262","title":"MIP-GNN: A Data-Driven Framework for Guiding Combinatorial Solvers","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":33,"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; Polytechnique Montréal; Mila - Quebec Artificial Intelligence Institute; University of Toronto","funders":"Deutscher Akademischer Austauschdienst","keywords":"Solver; Heuristics; Computer science; Integer programming; Bipartite graph; Leverage (statistics); Variable (mathematics); Graph; Theoretical computer science; Heuristic; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics; Programming language","score_opus":0.16559871495142212,"score_gpt":0.3409592441482524,"score_spread":0.1753605291968303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283797864","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.0030705584,0.00019928238,0.98593545,0.0004375201,0.00008391762,0.00011493151,0.0006992905,0.0055975714,0.0038614532],"genre_scores_gemma":[0.07785539,0.00024652356,0.91416824,0.00061871135,0.00008679553,0.0006677448,0.0022816972,0.0019063859,0.0021685543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987563,0.00048785133,0.00006442749,0.0002658657,0.00029889404,0.00012678308],"domain_scores_gemma":[0.99675107,0.0020176882,0.00021841789,0.0003746806,0.00049520726,0.00014294991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024836455,0.0022324251,0.0012416621,0.0012358439,0.00068147824,0.0022421821,0.0041967365,0.0021067115,0.01037633],"category_scores_gemma":[0.013376579,0.001413867,0.0015359299,0.0011607833,0.0013521983,0.002327127,0.0029044775,0.004453408,0.0031181474],"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.00008139798,0.00007400988,0.00089751295,0.00020953883,0.00004862684,0.00007214357,0.000053973763,0.9066914,0.00086956064,0.030512968,0.011530261,0.048958562],"study_design_scores_gemma":[0.000013638773,0.0000069555754,0.000022344593,0.00001354843,0.0000029195512,0.0000067872284,0.000005647906,0.98466647,0.0002786063,0.0131440675,0.0018352066,0.0000037121563],"about_ca_topic_score_codex":0.006842284,"about_ca_topic_score_gemma":0.017033665,"teacher_disagreement_score":0.01037633,"about_ca_system_score_codex":0.0016794876,"about_ca_system_score_gemma":0.0041774227,"threshold_uncertainty_score":0.034712315},"labels":[],"label_agreement":null},{"id":"W4283797949","doi":"10.1609/aaai.v36i9.21233","title":"Stochastic Goal Recognition Design Problems with Suboptimal Agents","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","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":"National Science Foundation","keywords":"Ambiguity; Computer science; Generalization; Observability; Action (physics); Benchmark (surveying); Artificial intelligence; Range (aeronautics); Mathematical optimization; Observer (physics); Machine learning; Mathematics; Engineering","score_opus":0.12589060475098662,"score_gpt":0.27620741389932374,"score_spread":0.15031680914833712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283797949","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.02878604,0.00019111793,0.9682109,0.00032701803,0.000027181539,0.00009602345,0.00005120484,0.00014664074,0.0021637888],"genre_scores_gemma":[0.77943194,0.00020970411,0.21597113,0.00026699767,0.000039031303,0.00039465225,0.0001809194,0.00007600863,0.0034297307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967443,0.0012747523,0.0002544877,0.00085495133,0.0005395367,0.00033191298],"domain_scores_gemma":[0.9903702,0.0067091817,0.0011940624,0.0005818868,0.0007517188,0.0003929081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004409973,0.0015235005,0.0017380168,0.0006875556,0.00064747635,0.0015808986,0.0013541837,0.002257133,0.0023528433],"category_scores_gemma":[0.01344803,0.0010002409,0.0014447276,0.00048100392,0.0021091078,0.0016916889,0.002409604,0.0020672292,0.00030051605],"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.00007635644,0.000037863614,0.0006466106,0.000085054475,0.00004034606,0.00008578094,0.00007757426,0.9611997,0.00091422733,0.025116716,0.00031785766,0.011402037],"study_design_scores_gemma":[0.000027076147,0.00005664916,0.00009688965,0.000012365358,0.000011707954,0.000019560275,0.000017776574,0.9761681,0.00047481546,0.022749515,0.0003566661,0.000008837965],"about_ca_topic_score_codex":0.0035670502,"about_ca_topic_score_gemma":0.0026752914,"teacher_disagreement_score":0.004409973,"about_ca_system_score_codex":0.002000957,"about_ca_system_score_gemma":0.0018061317,"threshold_uncertainty_score":0.023322403},"labels":[],"label_agreement":null},{"id":"W4283797980","doi":"10.1609/aaai.v36i5.20443","title":"Worst-Case Voting When the Stakes Are High","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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 Toronto","funders":"","keywords":"Distortion (music); Multiplicative function; Social choice theory; Bounding overwatch; Voting; Social welfare function; Metric (unit); Function (biology); Class (philosophy); Mathematical economics; Range (aeronautics); Anti-plurality voting; Outcome (game theory); Social Welfare; Welfare; Computer science; Mathematics; Cardinal voting systems; Economics; Artificial intelligence; Political science","score_opus":0.13407582137355206,"score_gpt":0.25368124232547595,"score_spread":0.11960542095192389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283797980","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.31175172,0.00055291556,0.66765505,0.0016356985,0.00008329943,0.00012447945,0.0006512487,0.00017974873,0.01736596],"genre_scores_gemma":[0.95284647,0.00020730344,0.043692686,0.0001331988,0.000053873562,0.00008741716,0.0003333448,0.000047043344,0.002598834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98656243,0.006659826,0.0007680915,0.0021772254,0.0025364866,0.0012959691],"domain_scores_gemma":[0.9492637,0.031268146,0.005203867,0.011769665,0.0015402978,0.0009543325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01323757,0.0008688705,0.0022858884,0.0009923441,0.0008946945,0.0051996703,0.0029029744,0.0015230625,0.004009501],"category_scores_gemma":[0.062084224,0.0006338693,0.001119557,0.00159666,0.00256554,0.006000219,0.0025895012,0.0035265756,0.00062140287],"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.00068755844,0.0002270064,0.0103205275,0.00016640262,0.00031960732,0.00029762465,0.00036776633,0.43074298,0.002960174,0.49321753,0.0024448645,0.058248054],"study_design_scores_gemma":[0.000047011705,0.0001286118,0.002924878,0.000028832552,0.00005198771,0.0002773417,0.0002028487,0.47125053,0.0024991003,0.5200012,0.0025429334,0.000044725435],"about_ca_topic_score_codex":0.0016164535,"about_ca_topic_score_gemma":0.0022428476,"teacher_disagreement_score":0.01323757,"about_ca_system_score_codex":0.0028435546,"about_ca_system_score_gemma":0.0011514736,"threshold_uncertainty_score":0.0700078},"labels":[],"label_agreement":null},{"id":"W4283798873","doi":"10.1609/aaai.v36i7.20776","title":"I-SEA: Importance Sampling and Expected Alignment-Based Deep Distance Metric Learning for Time Series Analysis and Embedding","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Time Series Analysis and Forecasting","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 Waterloo","funders":"National Science Foundation","keywords":"Metric (unit); Computer science; Embedding; Series (stratigraphy); Sampling (signal processing); Cluster analysis; Artificial intelligence; Machine learning; Curse of dimensionality; Sampling distribution; Similarity (geometry); Time series; Parametric statistics; Representation (politics); Data mining; Pattern recognition (psychology); Mathematics; Statistics","score_opus":0.03897733383321407,"score_gpt":0.2763712171303408,"score_spread":0.23739388329712674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283798873","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.0066606663,0.000254645,0.99203295,0.00012421442,0.000033277265,0.000036948495,0.000058601756,0.00045719405,0.00034148723],"genre_scores_gemma":[0.36623564,0.00073451316,0.6280196,0.00038611869,0.0001749862,0.0004397433,0.0011346391,0.0003638504,0.0025109078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853146,0.0005594283,0.00011882689,0.00029563278,0.00040620522,0.00008838156],"domain_scores_gemma":[0.9957749,0.0022865934,0.00037106778,0.00058525766,0.0007506004,0.00023160406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028378451,0.0016101787,0.0019201182,0.0015256666,0.00057881535,0.0013346933,0.00316937,0.001506967,0.0015254762],"category_scores_gemma":[0.0126967095,0.0007168268,0.0011004417,0.0017548575,0.0013933736,0.0035608811,0.0035702477,0.0034441478,0.00073865487],"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.0002374142,0.00021901993,0.0038353235,0.00024106487,0.0001840446,0.00014339725,0.00023922222,0.5818803,0.0048933844,0.05786719,0.0059364033,0.34432334],"study_design_scores_gemma":[0.000005351682,0.00003299197,0.00009326678,0.000005887187,0.000003895597,0.000023008353,0.0000074489044,0.9870517,0.00057210715,0.011792873,0.0004039309,0.000007530229],"about_ca_topic_score_codex":0.0034698595,"about_ca_topic_score_gemma":0.004625938,"teacher_disagreement_score":0.0034698595,"about_ca_system_score_codex":0.001247473,"about_ca_system_score_gemma":0.0014099544,"threshold_uncertainty_score":0.0150081515},"labels":[],"label_agreement":null},{"id":"W4283799331","doi":"10.1609/aaai.v36i10.21382","title":"Generation-Focused Table-Based Intermediate Pre-training for Free-Form Question Answering","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","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 Waterloo","funders":"","keywords":"Computer science; Question answering; Table (database); Leverage (statistics); Schema (genetic algorithms); Artificial intelligence; Natural language processing; Ask price; Language model; Task (project management); Information retrieval; Data mining","score_opus":0.13912443110804626,"score_gpt":0.3130940979136808,"score_spread":0.17396966680563455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283799331","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.042030696,0.0015214602,0.9213971,0.0006253482,0.00028275684,0.0005503043,0.0024735574,0.025314191,0.005804642],"genre_scores_gemma":[0.4617139,0.000685788,0.501414,0.0015310217,0.00016355624,0.0012336946,0.022638505,0.0011172212,0.00950226],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990609,0.000310507,0.00005233453,0.00036399742,0.00010943191,0.00010281628],"domain_scores_gemma":[0.9974597,0.0016622392,0.00007644696,0.00039377838,0.00029847416,0.00010934387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013276006,0.0018043006,0.00083460147,0.00086905184,0.0004450843,0.0010952735,0.0024768277,0.0020651969,0.012436083],"category_scores_gemma":[0.005583252,0.0005337048,0.0015498667,0.0007007372,0.000718765,0.0028599342,0.0019690504,0.003175181,0.0048583923],"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.0007307037,0.0006617621,0.004448628,0.0009129642,0.0001571286,0.0005961311,0.0009928201,0.14058612,0.03023801,0.0122644575,0.049612187,0.7587991],"study_design_scores_gemma":[0.00011045881,0.0004400065,0.0010465636,0.00008741228,0.00007867702,0.00028500348,0.00023657246,0.9389282,0.019821847,0.022762913,0.016160822,0.000041474228],"about_ca_topic_score_codex":0.0038163862,"about_ca_topic_score_gemma":0.007199038,"teacher_disagreement_score":0.012436083,"about_ca_system_score_codex":0.00092645147,"about_ca_system_score_gemma":0.0014583437,"threshold_uncertainty_score":0.04160285},"labels":[],"label_agreement":null},{"id":"W4283800411","doi":"10.1609/aaai.v36i9.21220","title":"Sample-Efficient Iterative Lower Bound Optimization of Deep Reactive Policies for Planning in Continuous MDPs","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Research Foundation Singapore; National Research Foundation","keywords":"Computer science; Mathematical optimization; Variance (accounting); Maximization; Iterative learning control; Upper and lower bounds; Parametric statistics; Sample (material); Markov decision process; Optimization problem; Artificial intelligence; Algorithm; Mathematics; Control (management)","score_opus":0.04515529792387129,"score_gpt":0.3091709383972863,"score_spread":0.264015640473415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283800411","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.020254297,0.00023918232,0.9760576,0.00026817078,0.000026564967,0.00005166956,0.00005780324,0.00061075663,0.0024338535],"genre_scores_gemma":[0.73984975,0.00023198254,0.25608873,0.0002638424,0.000032962547,0.0003455139,0.00028348557,0.0003474547,0.0025562923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993111,0.0002433826,0.0000323608,0.00012818906,0.00017806591,0.000106786014],"domain_scores_gemma":[0.9964557,0.0026885474,0.0002576832,0.00018485289,0.00027074406,0.00014246747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018381121,0.0013585343,0.0013412104,0.00054165267,0.0004388265,0.0009585877,0.0012775626,0.001297332,0.002490437],"category_scores_gemma":[0.00798416,0.0008822725,0.0006692108,0.00047639484,0.0015522948,0.0012633668,0.0016936315,0.0024036726,0.00039564588],"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.000028099288,0.000015823527,0.00013310894,0.000026411242,0.000007952328,0.000014360776,0.000017560693,0.9899143,0.00020016562,0.0030907525,0.00025496166,0.006296539],"study_design_scores_gemma":[0.000004371062,0.0000082701345,0.000012619726,0.000003522693,0.0000013305597,0.000001874578,0.0000026639113,0.99788624,0.00012603278,0.0018654517,0.00008652793,0.0000011475316],"about_ca_topic_score_codex":0.009502151,"about_ca_topic_score_gemma":0.0106583815,"teacher_disagreement_score":0.009502151,"about_ca_system_score_codex":0.0017323863,"about_ca_system_score_gemma":0.002800903,"threshold_uncertainty_score":0.01889366},"labels":[],"label_agreement":null},{"id":"W4283800421","doi":"10.1609/aaai.v36i11.21485","title":"Toward a New Science of Common Sense","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Epistemology, Ethics, and Metaphysics","field":"Arts and Humanities","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":"Common sense; Commonsense knowledge; Context (archaeology); Perspective (graphical); Epistemology; Common knowledge (logic); Simple (philosophy); Computer science; Artificial intelligence; History; Philosophy; Knowledge base","score_opus":0.24207004612749122,"score_gpt":0.32494956778369083,"score_spread":0.0828795216561996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283800421","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010582892,0.023744136,0.6427156,0.19554842,0.003576991,0.0001378922,0.00035815718,0.0004151862,0.12292072],"genre_scores_gemma":[0.64037025,0.01895405,0.28742394,0.02395704,0.0075549344,0.0008876049,0.0006715519,0.0006228011,0.019557782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96779245,0.017709201,0.0016367732,0.0054793856,0.006247863,0.0011343642],"domain_scores_gemma":[0.9249065,0.048527904,0.003587392,0.0122766225,0.007841348,0.0028601128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03999657,0.001427203,0.0028266408,0.009905843,0.007166018,0.020327995,0.0055329893,0.008314674,0.005237403],"category_scores_gemma":[0.05050962,0.0010601954,0.0028578695,0.0057894588,0.08009899,0.05442817,0.013677257,0.01826551,0.0018033029],"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.000005430693,0.00000558887,0.00011152611,0.000048398164,0.000011232661,0.000021464843,0.0007488002,0.00021688876,0.000034420882,0.9941823,0.0013782077,0.0032357825],"study_design_scores_gemma":[0.0000030739416,0.0000033372794,0.00003163564,0.00004094643,0.0000026388473,0.000020264251,0.00025416666,0.0004400777,0.000027614575,0.98859555,0.010574115,0.0000066902585],"about_ca_topic_score_codex":0.003906393,"about_ca_topic_score_gemma":0.0020453434,"teacher_disagreement_score":0.03999657,"about_ca_system_score_codex":0.008406988,"about_ca_system_score_gemma":0.008180602,"threshold_uncertainty_score":0.21152467},"labels":[],"label_agreement":null},{"id":"W4283800840","doi":"10.1609/aaai.v36i1.19923","title":"Event-Image Fusion Stereo Using Cross-Modality Feature Propagation","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Memory and Neural Computing","field":"Engineering","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":"Kootenay Association for Science & Technology","funders":"Ministry of Science and ICT, South Korea; Agency for Defense Development; National Research Foundation of Korea; National Research Foundation","keywords":"Artificial intelligence; Computer vision; Computer science; Feature (linguistics); Stereopsis; Event (particle physics); Visual odometry; Pixel; Pattern recognition (psychology); Motion blur; Image (mathematics); Robot","score_opus":0.07048611108253894,"score_gpt":0.3204239899933323,"score_spread":0.2499378789107934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283800840","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.015693003,0.00014524662,0.9801784,0.00009493392,0.00007589081,0.000058003898,0.00022895851,0.0016426743,0.0018829296],"genre_scores_gemma":[0.59395707,0.00025996592,0.39821872,0.00034378658,0.0001130312,0.00013464148,0.0010852541,0.0001563612,0.0057312273],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995882,0.000035906975,0.000014799682,0.00013919391,0.00016377466,0.000058206555],"domain_scores_gemma":[0.9996258,0.00004604713,0.000045520952,0.00007451036,0.0001809629,0.000027060187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004844255,0.0009343592,0.0007310344,0.0009019318,0.0003601477,0.000629562,0.0014319201,0.0009293424,0.002867843],"category_scores_gemma":[0.0011794616,0.00040033564,0.00075512234,0.0010206661,0.00036849163,0.0015571491,0.0015820008,0.0011356787,0.0007899375],"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.00039609105,0.00028856707,0.0016539664,0.000115233845,0.00015441037,0.00022099457,0.00012054622,0.20611727,0.05928808,0.008636277,0.0072593642,0.7157491],"study_design_scores_gemma":[0.000012277038,0.000055728025,0.0005841565,0.000005897934,0.000018720997,0.000064838096,0.000012895756,0.9795567,0.014276147,0.0039327247,0.0014661958,0.000013690384],"about_ca_topic_score_codex":0.0066519678,"about_ca_topic_score_gemma":0.009243757,"teacher_disagreement_score":0.0066519678,"about_ca_system_score_codex":0.0008627064,"about_ca_system_score_gemma":0.00096862216,"threshold_uncertainty_score":0.013226509},"labels":[],"label_agreement":null},{"id":"W4283800865","doi":"10.1609/aaai.v36i11.21595","title":"A Multimodal Fusion-Based LNG Detection for Monitoring Energy Facilities (Student Abstract)","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Oil Spill Detection and Mitigation","field":"Environmental 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":true,"ca_institutions":"IntelliView Technologies (Canada); Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Liquefied natural gas; Fuse (electrical); Transformer; Infrared; Fossil fuel; Fusion; Computer science; Natural gas; Environmental science; Systems engineering; Engineering; Process engineering; Waste management; Electrical engineering","score_opus":0.04360313648313464,"score_gpt":0.2748511147392235,"score_spread":0.2312479782560889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283800865","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.20027815,0.00052114076,0.79194814,0.00037006146,0.00010700892,0.00009071791,0.00034125798,0.0022062615,0.004137251],"genre_scores_gemma":[0.77862847,0.00025115453,0.2172466,0.00017039599,0.00004401579,0.000051085804,0.00034067777,0.000038346392,0.003229266],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998311,0.000025136787,0.0000047231706,0.00005459594,0.000054612607,0.000029829982],"domain_scores_gemma":[0.9999174,0.000015382648,0.0000075514968,0.0000095834475,0.00004067025,0.000009540844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033599223,0.00040225452,0.0003981789,0.00058507273,0.00021017286,0.00035672315,0.00043851498,0.0005118655,0.0013017909],"category_scores_gemma":[0.00034448697,0.00012821403,0.0004573288,0.00035049306,0.00020351486,0.00043915646,0.00058415614,0.00033990704,0.00040911933],"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.00059911713,0.00022780622,0.0080449255,0.00013578952,0.000090504844,0.0003736579,0.00013294231,0.03541205,0.41045153,0.0016032137,0.0035501255,0.53937835],"study_design_scores_gemma":[0.000023152077,0.00027244675,0.006769795,0.000014033876,0.00006170631,0.00033875147,0.00006595948,0.88085616,0.108003475,0.00087658415,0.0026847315,0.00003315588],"about_ca_topic_score_codex":0.002689975,"about_ca_topic_score_gemma":0.0042225295,"teacher_disagreement_score":0.002689975,"about_ca_system_score_codex":0.00027697557,"about_ca_system_score_gemma":0.00023536372,"threshold_uncertainty_score":0.005348623},"labels":[],"label_agreement":null},{"id":"W4283801145","doi":"10.1609/aaai.v36i5.20420","title":"A Little Charity Guarantees Fair Connected Graph Partitioning","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Partition (number theory); Combinatorics; Fair division; Graph; Mathematics; Vertex connectivity; Connected component; Binary logarithm; Discrete mathematics; Computer science; Mathematical economics","score_opus":0.10955420127919167,"score_gpt":0.25774105692514465,"score_spread":0.14818685564595296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283801145","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.19213282,0.00042140015,0.79253966,0.001816848,0.000118925826,0.00013233257,0.00028912636,0.001337487,0.011211454],"genre_scores_gemma":[0.87330925,0.00022041125,0.1203779,0.0004643516,0.0001073954,0.000154361,0.00028568748,0.00031780882,0.004762743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99638915,0.0012352228,0.00013213107,0.0008409185,0.0006515875,0.00075101043],"domain_scores_gemma":[0.97869176,0.012301126,0.0013081005,0.005192914,0.0012263637,0.0012797595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044230814,0.0011250649,0.0015484699,0.00094621116,0.0021407146,0.0024116887,0.002508375,0.0017121262,0.005209872],"category_scores_gemma":[0.02833228,0.00075667753,0.001004267,0.0014206594,0.0029448238,0.0075272024,0.0036027948,0.0026357046,0.00089857617],"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.0017882929,0.00028077335,0.0039665196,0.0003411611,0.00010593936,0.0003223506,0.0009231749,0.4883868,0.020114072,0.3907612,0.009937942,0.08307178],"study_design_scores_gemma":[0.00010062296,0.00013272367,0.0003754178,0.000027365944,0.000033974975,0.0002087706,0.0001556444,0.66163015,0.006427853,0.3269736,0.0039078435,0.00002609447],"about_ca_topic_score_codex":0.0024501067,"about_ca_topic_score_gemma":0.002638819,"teacher_disagreement_score":0.005209872,"about_ca_system_score_codex":0.0021839484,"about_ca_system_score_gemma":0.0020991066,"threshold_uncertainty_score":0.023391783},"labels":[],"label_agreement":null},{"id":"W4283801158","doi":"10.1609/aaai.v36i7.20696","title":"Learning Losses for Strategic Classification","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Corruption and Economic Development","field":"Social Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Vector Institute","keywords":"Computer science; Artificial intelligence; Machine learning; Graph; Sample (material); Perspective (graphical); Similarity (geometry); Function (biology); Graph theory; Theoretical computer science; Mathematics","score_opus":0.24424449350300867,"score_gpt":0.3599918962834953,"score_spread":0.11574740278048665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283801158","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.043987736,0.00071704056,0.94703865,0.002024752,0.00010894339,0.00016772246,0.0002997365,0.00039248486,0.005262933],"genre_scores_gemma":[0.81089014,0.00091503345,0.17227145,0.0012117773,0.00040333543,0.0008917192,0.0015186805,0.0002863286,0.011611565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99508625,0.002124747,0.00030015575,0.0009094652,0.0011659921,0.00041341418],"domain_scores_gemma":[0.96404094,0.02825898,0.002128064,0.0031005817,0.0016922064,0.00077928737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009348279,0.001533425,0.0017090305,0.0015705506,0.00080226245,0.0025090121,0.0023588839,0.0030871872,0.0049737482],"category_scores_gemma":[0.047383558,0.00046392507,0.0011161786,0.0012633355,0.0033295185,0.005467628,0.002922056,0.0044825976,0.0010204581],"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.0004134287,0.0002884295,0.003934658,0.00030099833,0.00016158274,0.00021412011,0.00018665417,0.6071964,0.0016237324,0.27637872,0.007747798,0.101553544],"study_design_scores_gemma":[0.000020794547,0.00007901732,0.00038690693,0.000024646728,0.00001299174,0.000041279163,0.00002288273,0.8136716,0.0005034585,0.18439509,0.00082837127,0.000012989734],"about_ca_topic_score_codex":0.0010810395,"about_ca_topic_score_gemma":0.0008841753,"teacher_disagreement_score":0.009348279,"about_ca_system_score_codex":0.0030106653,"about_ca_system_score_gemma":0.0015743086,"threshold_uncertainty_score":0.049439013},"labels":[],"label_agreement":null},{"id":"W4283801939","doi":"10.1609/aaai.v36i5.20419","title":"The Metric Distortion of Multiwinner Voting","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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":"Distortion (music); Voting; Metric (unit); Mathematics; Computer science; Political science; Economics; Telecommunications; Law; Operations management; Politics","score_opus":0.09066704021046244,"score_gpt":0.26105593484932416,"score_spread":0.1703888946388617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283801939","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.061898757,0.0023711568,0.8949883,0.0026111272,0.00027484438,0.00014067777,0.0006302745,0.0002182668,0.03686665],"genre_scores_gemma":[0.8929925,0.0016070529,0.09373875,0.0005103822,0.00028823616,0.00024754676,0.00045584078,0.00021969147,0.009939966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9868221,0.0057545006,0.0009104916,0.0019943535,0.0035141888,0.0010042092],"domain_scores_gemma":[0.9642152,0.01926851,0.0034159315,0.00923872,0.002776832,0.0010847943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009101919,0.00093668076,0.0021555186,0.0015936951,0.0012617691,0.0045884633,0.0035964346,0.0019599828,0.005909206],"category_scores_gemma":[0.058994047,0.0006153426,0.0016236819,0.001962828,0.004836005,0.008305647,0.004295805,0.0035392193,0.00095955713],"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.00013250393,0.000022709904,0.0011758896,0.00010203842,0.000058946258,0.0001324097,0.00019678364,0.07831911,0.0006541613,0.89641273,0.0020415743,0.020751094],"study_design_scores_gemma":[0.000024151077,0.000065780354,0.0005100664,0.000039233084,0.000016866634,0.00023163739,0.00006987813,0.17274572,0.0006552268,0.8203701,0.005235465,0.000035801524],"about_ca_topic_score_codex":0.0021034952,"about_ca_topic_score_gemma":0.0010887188,"teacher_disagreement_score":0.009101919,"about_ca_system_score_codex":0.0045874445,"about_ca_system_score_gemma":0.0014480499,"threshold_uncertainty_score":0.048136115},"labels":[],"label_agreement":null},{"id":"W4283802141","doi":"10.1609/aaai.v36i9.21219","title":"Planning to Avoid Side Effects","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Vector Institute; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; Microsoft Research","keywords":"Computer science; Side effect (computer science); Context (archaeology); Agency (philosophy); Risk analysis (engineering); Lead (geology); Relation (database); Management science; Business; Engineering; Epistemology; Data mining","score_opus":0.0592639208155509,"score_gpt":0.29161868043928074,"score_spread":0.23235475962372984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283802141","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.0937328,0.00037838725,0.8830438,0.0012527197,0.00009688594,0.00025147802,0.00010595059,0.0012148668,0.0199231],"genre_scores_gemma":[0.7211326,0.00033649808,0.27277416,0.00035604718,0.000041311945,0.00028330926,0.00019457619,0.0004936061,0.004387735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970085,0.001251507,0.00014745933,0.00029486537,0.0009016892,0.00039591422],"domain_scores_gemma":[0.9907032,0.0062936866,0.0006354791,0.0015118597,0.0006524115,0.00020333141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031645573,0.001237549,0.0006455268,0.0006154203,0.0008300106,0.001343069,0.0009688838,0.0008041866,0.005162064],"category_scores_gemma":[0.016269995,0.0006913313,0.0010424401,0.00047084864,0.0028848147,0.0022146695,0.0025551952,0.0020433909,0.0005674209],"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.0005221831,0.0002332037,0.00367934,0.00066647213,0.00020601833,0.00062308984,0.0011037576,0.53056276,0.013517193,0.29720986,0.0036461249,0.14803003],"study_design_scores_gemma":[0.000085987704,0.00026665052,0.00080508535,0.00013366262,0.00014026236,0.00025423872,0.00027339702,0.45422503,0.014700334,0.5206226,0.0084524155,0.000040414172],"about_ca_topic_score_codex":0.0018214345,"about_ca_topic_score_gemma":0.0029106752,"teacher_disagreement_score":0.005162064,"about_ca_system_score_codex":0.0009083192,"about_ca_system_score_gemma":0.0026740383,"threshold_uncertainty_score":0.017268836},"labels":[],"label_agreement":null},{"id":"W4283802608","doi":"10.1609/aaai.v36i10.21292","title":"ContrastNet: A Contrastive Learning Framework for Few-Shot Text Classification","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":93,"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 Ottawa","funders":"Fundamental Research Funds for the Central Universities; State Key Laboratory of Software Development Environment; National Natural Science Foundation of China","keywords":"Overfitting; Discriminative model; Computer science; Artificial intelligence; Natural language processing; Machine learning; Task (project management); Representation (politics); Feature learning; Regularization (linguistics); Class (philosophy); Pattern recognition (psychology); Artificial neural network","score_opus":0.12852492276051675,"score_gpt":0.32681015371591216,"score_spread":0.1982852309553954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283802608","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.019939419,0.000863248,0.9752128,0.0002810063,0.000089657115,0.00014668981,0.00030401387,0.0018697664,0.0012934317],"genre_scores_gemma":[0.4663683,0.0006576645,0.52223474,0.0007535798,0.00026528168,0.00056731893,0.0024637629,0.0003965629,0.006292847],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898297,0.00034227906,0.000042452717,0.00040707312,0.00016533265,0.00005997902],"domain_scores_gemma":[0.9980117,0.001157484,0.00016934752,0.00028021148,0.0002850373,0.00009616436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024662216,0.0012193513,0.0011469219,0.0019372423,0.00057434535,0.0010858942,0.0031227488,0.0018323368,0.0020666588],"category_scores_gemma":[0.0060286056,0.0004347505,0.000998158,0.0011152135,0.0011157028,0.0031536808,0.0018181344,0.0026772576,0.0009153821],"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.0006311301,0.00065416755,0.005424569,0.0004668237,0.00032581188,0.00031899463,0.000514699,0.21330766,0.018578991,0.03293346,0.011418507,0.7154252],"study_design_scores_gemma":[0.000017996204,0.00012118944,0.00043654797,0.000020020274,0.00002312222,0.00006018097,0.000031556112,0.9724299,0.0029520825,0.021564623,0.0023280971,0.0000146985],"about_ca_topic_score_codex":0.0021063597,"about_ca_topic_score_gemma":0.0039966777,"teacher_disagreement_score":0.0031227488,"about_ca_system_score_codex":0.0012289961,"about_ca_system_score_gemma":0.0007209136,"threshold_uncertainty_score":0.013042748},"labels":[],"label_agreement":null},{"id":"W4283802714","doi":"10.1609/aaai.v36i9.21176","title":"Decentralized Mean Field Games","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Vector Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo; University of Alberta; Alberta Machine Intelligence Institute; Compute Canada; Government of Canada; Vector Institute; Canadian Institute for Advanced Research","keywords":"Reinforcement learning; Computer science; Field (mathematics); Aggregate (composite); Artificial intelligence; Scale (ratio); Decentralised system; Autonomous agent; Point (geometry); Multi-agent system; Mean field theory; Mathematical optimization; Machine learning; Control (management); Mathematics","score_opus":0.1947019900839855,"score_gpt":0.39377064024378694,"score_spread":0.19906865015980144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283802714","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.06491769,0.00031469358,0.91455567,0.0015077579,0.00015400373,0.00018956573,0.00033715102,0.00044004794,0.017583542],"genre_scores_gemma":[0.90469205,0.00025377359,0.07924653,0.00045129628,0.00011383721,0.0003802065,0.00031052242,0.00009364985,0.014458012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835473,0.00068807864,0.000058173886,0.00038914394,0.0002791979,0.00023066242],"domain_scores_gemma":[0.99743325,0.0014087815,0.0003553089,0.00026106677,0.00027873678,0.00026292875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017473907,0.0008200911,0.0014984395,0.0005777367,0.0009054487,0.0014226414,0.0020418717,0.0021123225,0.005904723],"category_scores_gemma":[0.0059347562,0.0004853374,0.0009378774,0.00053366565,0.0016393508,0.0022029267,0.001957956,0.0017527547,0.00056623906],"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.00014609192,0.00008762001,0.00080506183,0.000105226354,0.0000802342,0.00021977033,0.00013750489,0.69282806,0.001762041,0.28119364,0.005159432,0.017475363],"study_design_scores_gemma":[0.00003893812,0.00002888653,0.0001438708,0.0000066836146,0.000006951974,0.000032932214,0.000019588655,0.89857256,0.00019473556,0.0992401,0.0017024691,0.000012278321],"about_ca_topic_score_codex":0.0035267298,"about_ca_topic_score_gemma":0.0032096547,"teacher_disagreement_score":0.005904723,"about_ca_system_score_codex":0.0016641595,"about_ca_system_score_gemma":0.0015109509,"threshold_uncertainty_score":0.019753277},"labels":[],"label_agreement":null},{"id":"W4283802782","doi":"10.1609/aaai.v36i9.21194","title":"Fast Sparse Decision Tree Optimization via Reference Ensembles","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Institute on Drug Abuse; Natural Sciences and Engineering Research Council of Canada; U.S. Department of Energy; National Science Foundation","keywords":"Computer science; Decision tree; Tree (set theory); Machine learning; Black box; Incremental decision tree; Artificial intelligence; Optimization problem; Decision tree learning; Mathematical optimization; Algorithm; Mathematics","score_opus":0.07408020904507641,"score_gpt":0.2941409187407192,"score_spread":0.2200607096956428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283802782","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.011178888,0.0007234213,0.9824537,0.00056433544,0.00011514824,0.000047363945,0.00019894427,0.00172206,0.002996024],"genre_scores_gemma":[0.41284457,0.00085958495,0.57285976,0.0009867232,0.00038868492,0.00033606673,0.0026790374,0.0010936962,0.007951848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979068,0.0008196919,0.00008701224,0.0004088433,0.00057151564,0.00020621413],"domain_scores_gemma":[0.9939122,0.0038621984,0.0002586606,0.0008953641,0.0008069193,0.00026467972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027283952,0.0012771465,0.0024590995,0.00096990017,0.0009144602,0.0019420868,0.0022503436,0.0021382286,0.00674798],"category_scores_gemma":[0.014859216,0.0008713798,0.0014069048,0.0014118516,0.00097234896,0.0034024264,0.0029878817,0.004032484,0.0035757585],"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.00020916802,0.0001138996,0.0009866053,0.00014490027,0.00009101529,0.00010235984,0.00013451892,0.7251918,0.0018594266,0.045387357,0.019182883,0.20659612],"study_design_scores_gemma":[0.0000129980235,0.000017076782,0.00005341798,0.000013663797,0.0000062138292,0.000013890915,0.000007876673,0.97374445,0.00034123988,0.024761824,0.0010214089,0.0000059549197],"about_ca_topic_score_codex":0.0040687677,"about_ca_topic_score_gemma":0.0070126555,"teacher_disagreement_score":0.00674798,"about_ca_system_score_codex":0.0011832927,"about_ca_system_score_gemma":0.0016972376,"threshold_uncertainty_score":0.022574306},"labels":[],"label_agreement":null},{"id":"W4283805152","doi":"10.1609/aaai.v36i2.20123","title":"Improving Zero-Shot Phrase Grounding via Reasoning on External Knowledge and Spatial Relations","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Multimodal Machine Learning Applications","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":"Queen's University","funders":"","keywords":"Phrase; Computer science; Noun phrase; Artificial intelligence; Ground; Visual reasoning; Natural language processing; Modal; Noun; Engineering","score_opus":0.04921381018470201,"score_gpt":0.30577594182359497,"score_spread":0.25656213163889297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283805152","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.067057796,0.001368768,0.89387447,0.0006804366,0.00017099382,0.00030815921,0.0030719943,0.026425123,0.007042196],"genre_scores_gemma":[0.44418505,0.0006731374,0.52865285,0.00087741023,0.000113245376,0.00014827917,0.016525768,0.0010903468,0.0077339406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882096,0.00013875798,0.0000546286,0.00050420745,0.00033908043,0.0001422554],"domain_scores_gemma":[0.9982109,0.0008473943,0.00012345644,0.0004909037,0.00024664047,0.00008074033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010057268,0.0022043379,0.0014525454,0.0022830311,0.0009323304,0.0016887682,0.0038174684,0.0020272126,0.0062722885],"category_scores_gemma":[0.0047575925,0.00060298917,0.0014856658,0.0017756214,0.0015534282,0.0074845646,0.003992333,0.0025760024,0.002341981],"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.00042007735,0.0005517828,0.003788483,0.0005608319,0.0001653922,0.0006319305,0.00055309356,0.059228346,0.030855415,0.019293176,0.031691615,0.85225976],"study_design_scores_gemma":[0.000100460085,0.00026673308,0.0016637902,0.00009013656,0.00015182696,0.00039744558,0.00056745956,0.86852133,0.035718493,0.08109743,0.011368083,0.000056813995],"about_ca_topic_score_codex":0.0143044265,"about_ca_topic_score_gemma":0.029964017,"teacher_disagreement_score":0.0143044265,"about_ca_system_score_codex":0.0012570496,"about_ca_system_score_gemma":0.0019255604,"threshold_uncertainty_score":0.028442323},"labels":[],"label_agreement":null},{"id":"W4283805190","doi":"10.1609/aaai.v36i4.20280","title":"Undercover Boolean Matrix Factorization with MaxSAT","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut Universitaire de Gériatrie de Montréal; Université du Québec à Montréal","funders":"","keywords":"Maximum satisfiability problem; Logical matrix; Factorization; Matrix (chemical analysis); Mathematics; Implicant; Combinatorics; Discrete mathematics; Block (permutation group theory); Product (mathematics); Algorithm; Boolean function; Computer science; Boolean expression; Group (periodic table); Physics; Chemistry","score_opus":0.05503056819948492,"score_gpt":0.2889159486216709,"score_spread":0.23388538042218598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283805190","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.035100773,0.00043546292,0.9526215,0.00096649415,0.00008740394,0.00012823592,0.00084087986,0.002900348,0.0069187363],"genre_scores_gemma":[0.49758255,0.00046152665,0.49149624,0.0008394255,0.00018799996,0.00031855315,0.0028638672,0.00071586954,0.005533919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759966,0.00080549315,0.00009874262,0.00052956445,0.0006440062,0.00032256692],"domain_scores_gemma":[0.99432003,0.0033741568,0.0004129554,0.001385481,0.000381413,0.00012594699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001668806,0.0015121,0.0014031022,0.0008772045,0.0009291999,0.0023721952,0.0017000028,0.001691469,0.008899666],"category_scores_gemma":[0.0127725825,0.0007567216,0.0015743746,0.0013841703,0.0014589847,0.004974876,0.0024360304,0.0024596306,0.0019359196],"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.0008834945,0.00025734818,0.0023251853,0.00048576723,0.0001390603,0.00038425447,0.00039475935,0.54319817,0.007910819,0.14770663,0.029026235,0.2672884],"study_design_scores_gemma":[0.000055035638,0.00006260847,0.00018555656,0.00003722513,0.000017633496,0.00013491341,0.00007141137,0.85037005,0.0035116354,0.14270824,0.0028274346,0.000018236115],"about_ca_topic_score_codex":0.0032329145,"about_ca_topic_score_gemma":0.005969401,"teacher_disagreement_score":0.008899666,"about_ca_system_score_codex":0.0016142857,"about_ca_system_score_gemma":0.0020871945,"threshold_uncertainty_score":0.029772341},"labels":[],"label_agreement":null},{"id":"W4283806425","doi":"10.1609/aaai.v36i5.20534","title":"First Order Rewritability in Ontology-Mediated Querying in Horn Description Logics","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Semantic Web and Ontologies","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":"Datalog; Description logic; Computer science; Rewriting; Ontology; Web Ontology Language; Conjunctive query; Construct (python library); Theoretical computer science; Relational database; Programming language; Semantic Web; Information retrieval","score_opus":0.10003360314563155,"score_gpt":0.28315077481482015,"score_spread":0.18311717166918862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283806425","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.018944815,0.00043317763,0.97317916,0.00067356095,0.000055927347,0.00012043359,0.00014229913,0.0004771502,0.0059733554],"genre_scores_gemma":[0.4485992,0.000708004,0.5404895,0.00078790466,0.00017621875,0.00027595926,0.0007041473,0.00039210857,0.007866921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927412,0.0029904344,0.0005701161,0.0011911473,0.0019368896,0.0005701634],"domain_scores_gemma":[0.9858577,0.009810443,0.0006358522,0.002249123,0.0012017066,0.0002452095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009645019,0.00061741157,0.00084356335,0.0016421902,0.0013217272,0.0039007156,0.002647292,0.0015049673,0.0030254177],"category_scores_gemma":[0.023241935,0.00089593703,0.0026588687,0.0018624832,0.0051452196,0.008202467,0.0042037647,0.0036051665,0.0005480212],"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.00006115225,0.00004570959,0.0003072356,0.0001727884,0.000035294997,0.00035568906,0.0014795818,0.023120122,0.0025515838,0.95161563,0.00079390197,0.019461364],"study_design_scores_gemma":[0.000032188593,0.000043381868,0.00010460441,0.000062771716,0.00004761396,0.00016043143,0.00023662524,0.12370078,0.008394508,0.8583463,0.008822258,0.00004853593],"about_ca_topic_score_codex":0.0069619194,"about_ca_topic_score_gemma":0.0051329373,"teacher_disagreement_score":0.009645019,"about_ca_system_score_codex":0.00386423,"about_ca_system_score_gemma":0.0020570778,"threshold_uncertainty_score":0.051008344},"labels":[],"label_agreement":null},{"id":"W4283807683","doi":"10.1609/aaai.v36i6.20618","title":"Reinforcement Learning Based Dynamic Model Combination for Time Series Forecasting","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":55,"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":"Reinforcement learning; Computer science; Machine learning; Artificial intelligence; Time series; Series (stratigraphy); Ensemble learning; Raw data; Ensemble forecasting; Selection (genetic algorithm)","score_opus":0.0729605973150735,"score_gpt":0.2881855701715623,"score_spread":0.21522497285648884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283807683","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.029607845,0.0005899113,0.9670662,0.0002575409,0.00005780731,0.000055272652,0.00004237881,0.0007268409,0.0015961574],"genre_scores_gemma":[0.9163886,0.00025228612,0.0813618,0.0001529313,0.000058672013,0.00012338576,0.0001245391,0.00006167144,0.0014761373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990608,0.00031873496,0.00005308375,0.00021591998,0.00023779212,0.000113630456],"domain_scores_gemma":[0.9981658,0.0010876054,0.00024114926,0.00012814353,0.000275929,0.000101375874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023776465,0.0010812305,0.0015851839,0.0007365794,0.00045067843,0.00080398365,0.0012692931,0.0009354762,0.0013762586],"category_scores_gemma":[0.0047851377,0.0006206849,0.00083647325,0.00067038054,0.0006260319,0.0011763031,0.001072362,0.0020031102,0.0002752479],"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.00004144579,0.00005284708,0.0005672842,0.000021678887,0.000051783776,0.000044609762,0.00003099085,0.96879,0.0008581267,0.0021077085,0.00038801882,0.027045561],"study_design_scores_gemma":[0.0000023204136,0.000010524335,0.000036463218,0.0000012863751,0.0000035430098,0.000003508254,0.0000010887484,0.9990262,0.00012868612,0.0007019112,0.00008216283,0.000002301695],"about_ca_topic_score_codex":0.007793649,"about_ca_topic_score_gemma":0.005847155,"teacher_disagreement_score":0.007793649,"about_ca_system_score_codex":0.0010737736,"about_ca_system_score_gemma":0.0010972165,"threshold_uncertainty_score":0.015496552},"labels":[],"label_agreement":null},{"id":"W4283810932","doi":"10.1609/aaai.v36i5.20485","title":"From Actions to Programs as Abstract Actual Causes","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","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":"Toronto Metropolitan University; University of Regina; York University","funders":"","keywords":"Abstraction; Causality (physics); Causation; Computer science; Programming language; Action (physics); Situation calculus; Sequence (biology); Theoretical computer science; Epistemology","score_opus":0.12145030703466844,"score_gpt":0.3222884280208421,"score_spread":0.20083812098617368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283810932","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.016677273,0.00092524453,0.9582851,0.0019089847,0.0001209316,0.00011180782,0.0002009756,0.0005023161,0.021267507],"genre_scores_gemma":[0.5244575,0.0027579907,0.45821133,0.0013159728,0.00047382835,0.00064322515,0.00061530643,0.00046640224,0.011058392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956091,0.0020655384,0.00025668312,0.00064366456,0.0009823216,0.0004426391],"domain_scores_gemma":[0.9946203,0.003140105,0.00049958134,0.00097540807,0.00052992476,0.00023478005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004133004,0.0008723526,0.0005078118,0.0026848414,0.0013119114,0.0047205416,0.0015117992,0.0015361463,0.004980435],"category_scores_gemma":[0.010749493,0.00092771504,0.002036453,0.0016870815,0.008843413,0.012247676,0.0054288306,0.004369813,0.0005069272],"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.000006144352,0.0000051705415,0.00016861879,0.000038009683,0.0000089331625,0.000077802266,0.0005542867,0.0030741272,0.00018077358,0.9924886,0.00027362822,0.0031238226],"study_design_scores_gemma":[0.000006769318,0.00000800408,0.00010971025,0.000028133445,0.000018317574,0.00003884882,0.00013169098,0.0075209565,0.00033488518,0.9835603,0.008234989,0.000007350619],"about_ca_topic_score_codex":0.003396033,"about_ca_topic_score_gemma":0.0031813039,"teacher_disagreement_score":0.004980435,"about_ca_system_score_codex":0.0021559934,"about_ca_system_score_gemma":0.0021554427,"threshold_uncertainty_score":0.021857679},"labels":[],"label_agreement":null},{"id":"W4283812303","doi":"10.1609/aaai.v36i11.21658","title":"Towards One Shot Search Space Poisoning in Neural Architecture Search (Student Abstract)","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Exploit; Robustness (evolution); Architecture; Computer science; Space (punctuation); Artificial intelligence; Machine learning; Shot (pellet); Computer security; Artificial neural network; Data mining; Geography; Operating system","score_opus":0.12110724663107772,"score_gpt":0.3499893014507844,"score_spread":0.22888205481970667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283812303","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.6687947,0.00085139263,0.319613,0.0008163086,0.00014552669,0.00011189696,0.00011488463,0.0030298813,0.006522465],"genre_scores_gemma":[0.9649697,0.000067544315,0.03364418,0.00014288361,0.000014559402,0.0000253782,0.00005696812,0.00006570349,0.0010129767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991918,0.00032188784,0.00004171587,0.00012917127,0.00021535908,0.00010005628],"domain_scores_gemma":[0.9967866,0.001798826,0.0003207592,0.000683487,0.00029205458,0.0001182666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001928005,0.0005301494,0.00049333007,0.00042138947,0.00030278284,0.0006191709,0.00087436184,0.0010295009,0.0012905655],"category_scores_gemma":[0.007864308,0.00023701778,0.00036167572,0.00028985395,0.0014547242,0.0015673386,0.0012342257,0.0014429752,0.00029350963],"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.00078627886,0.000288232,0.003798633,0.00014469076,0.00016313694,0.0002640318,0.00015026916,0.8634263,0.02925575,0.015914531,0.003294189,0.08251399],"study_design_scores_gemma":[0.00003252168,0.00026969943,0.00030213143,0.000008999271,0.000012391204,0.00007121858,0.0000244346,0.98067445,0.012109122,0.006121407,0.0003657437,0.000007841179],"about_ca_topic_score_codex":0.0011809265,"about_ca_topic_score_gemma":0.0013716638,"teacher_disagreement_score":0.001928005,"about_ca_system_score_codex":0.00056520675,"about_ca_system_score_gemma":0.00060181326,"threshold_uncertainty_score":0.010196388},"labels":[],"label_agreement":null},{"id":"W4283813030","doi":"10.1609/aaai.v36i4.20296","title":"The SoftCumulative Constraint with Quadratic Penalty","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Penalty method; Mathematical optimization; Constraint (computer-aided design); Computer science; Quadratic equation; Quadratic growth; Scheduling (production processes); Decomposition; Function (biology); Algorithm; Mathematics","score_opus":0.05134186170215016,"score_gpt":0.2721420053701765,"score_spread":0.22080014366802636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283813030","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.014258874,0.0001568975,0.97352284,0.00050906034,0.00017355215,0.000083659994,0.0000873043,0.0006359296,0.010571868],"genre_scores_gemma":[0.26723596,0.00025413185,0.71536076,0.0006624316,0.00015619326,0.00018957275,0.000364688,0.00070019654,0.015076033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997801,0.0004235696,0.00010788593,0.00044079358,0.00095379265,0.0002729026],"domain_scores_gemma":[0.9950368,0.0022926342,0.00041562194,0.0010571245,0.0008935597,0.0003042864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023877532,0.0011087086,0.00095626153,0.0012273559,0.0015388444,0.0026254372,0.0023241176,0.0015377472,0.0103369495],"category_scores_gemma":[0.012082751,0.0005358094,0.0010694503,0.0017441284,0.002292414,0.0035324185,0.0029453447,0.0031149194,0.0014040826],"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.0002938298,0.00015227843,0.0014170168,0.00026065475,0.00006401682,0.0002647701,0.00018503817,0.21888687,0.006204836,0.5122241,0.015516205,0.24453044],"study_design_scores_gemma":[0.00003833881,0.000048826096,0.00024199372,0.00005186647,0.000018224877,0.00013406288,0.000041288586,0.83012927,0.0056415065,0.1497671,0.013849539,0.00003801449],"about_ca_topic_score_codex":0.004961327,"about_ca_topic_score_gemma":0.0057080262,"teacher_disagreement_score":0.0103369495,"about_ca_system_score_codex":0.0013479488,"about_ca_system_score_gemma":0.0027477397,"threshold_uncertainty_score":0.03458047},"labels":[],"label_agreement":null},{"id":"W4283813651","doi":"10.1609/aaai.v36i11.21455","title":"COVID-EENet: Predicting Fine-Grained Impact of COVID-19 on Local Economies","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"COVID-19 Pandemic Impacts","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":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; National Research Foundation of Korea; National Research Foundation","keywords":"Coronavirus disease 2019 (COVID-19); Scale (ratio); Set (abstract data type); Granularity; Database transaction; Economic impact analysis; Economies of scale; Business; Data science; Computer science; Economics; Marketing; Geography; Database; Microeconomics; Cartography","score_opus":0.12946194848246015,"score_gpt":0.32642126463701976,"score_spread":0.1969593161545596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283813651","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.750794,0.0034281204,0.13237618,0.0086499,0.0010230861,0.00030177084,0.085181795,0.005502814,0.012742334],"genre_scores_gemma":[0.8960369,0.0007626135,0.036404178,0.00074126566,0.00019524561,0.00014190299,0.060819414,0.00015629662,0.0047421665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980575,0.000048511814,0.000013907207,0.0000619425,0.00002729867,0.000042538886],"domain_scores_gemma":[0.9995065,0.00015838945,0.00008721175,0.00007735637,0.000097052456,0.00007340968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078391784,0.0008649597,0.00043852103,0.0012127911,0.00026246495,0.0009206986,0.0011449705,0.0011863547,0.0026582037],"category_scores_gemma":[0.0032559016,0.00029648238,0.00076000404,0.00085718324,0.00035291404,0.0016421089,0.0011283127,0.0018116677,0.0006462178],"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.00034775143,0.00041409486,0.16271086,0.00028121483,0.0003144986,0.00045447776,0.00009112469,0.6908899,0.0015652598,0.0060864007,0.06958757,0.06725688],"study_design_scores_gemma":[0.000030435074,0.000042587464,0.012744217,0.000037075693,0.000018936644,0.00005374829,0.000058746664,0.9766441,0.00068714365,0.005112009,0.0045532803,0.000017634942],"about_ca_topic_score_codex":0.025138488,"about_ca_topic_score_gemma":0.046152323,"teacher_disagreement_score":0.025138488,"about_ca_system_score_codex":0.0010496726,"about_ca_system_score_gemma":0.00088168425,"threshold_uncertainty_score":0.049984336},"labels":[],"label_agreement":null},{"id":"W4283815286","doi":"10.1609/aaai.v36i3.20267","title":"RETRACTED: Pan-Sharpening with Customized Transformer and Invertible Neural Network","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Image Fusion Techniques","field":"Engineering","cited_by":117,"is_retracted":true,"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":"University of Science and Technology of China; National Natural Science Foundation of China","keywords":"Sharpening; Panchromatic film; Computer science; Artificial intelligence; Multispectral image; Convolutional neural network; Transformer; Artificial neural network; Pattern recognition (psychology); Computer vision; Engineering","score_opus":0.030376311306991956,"score_gpt":0.24445493062226537,"score_spread":0.21407861931527342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283815286","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023112578,0.0019996373,0.9449346,0.0020716854,0.006529484,0.0001576361,0.0003406658,0.0072327964,0.013620903],"genre_scores_gemma":[0.37082565,0.0024889363,0.531234,0.0029728687,0.0032968617,0.00016993083,0.0020668285,0.0023373626,0.08460756],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995036,0.00005214022,0.000033472083,0.00012690821,0.0002422842,0.00004156565],"domain_scores_gemma":[0.9993266,0.00010692126,0.000049356677,0.00016653907,0.00030749672,0.000043217242],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0008778024,0.0010172253,0.0004928596,0.0006202482,0.00039635616,0.0009789845,0.0018666773,0.0014842524,0.009711402],"category_scores_gemma":[0.0026167475,0.00030712318,0.0007135811,0.00041811256,0.00056266563,0.0023934518,0.0015101008,0.0020285193,0.0030090585],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043546795,0.00008210191,0.0010665772,0.00042167393,0.00010791536,0.0010987446,0.00024503228,0.020841464,0.1014704,0.0157448,0.060048625,0.7984373],"study_design_scores_gemma":[0.00009261602,0.00024797983,0.0019082839,0.000085679836,0.00015719068,0.0018133001,0.0001742895,0.6328563,0.1564257,0.018822001,0.1873,0.000116657895],"about_ca_topic_score_codex":0.0013984831,"about_ca_topic_score_gemma":0.0019519002,"teacher_disagreement_score":0.9985157,"about_ca_system_score_codex":0.00038519214,"about_ca_system_score_gemma":0.00052887446,"threshold_uncertainty_score":0.03248793},"labels":[],"label_agreement":null},{"id":"W4283815468","doi":"10.1609/aaai.v36i6.20639","title":"A Generalized Bootstrap Target for Value-Learning, Efficiently Combining Value and Feature Predictions","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; McGill University; Mila - Quebec Artificial Intelligence Institute","funders":"Fonds de recherche du Québec – Nature et technologies; Compute Canada; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Bootstrapping (finance); Computer science; Reinforcement learning; Successor cardinal; Value (mathematics); Artificial intelligence; Bellman equation; Machine learning; Function (biology); Generality; Feature (linguistics); Mathematics; Econometrics; Mathematical optimization","score_opus":0.05540860206408431,"score_gpt":0.2917252413087566,"score_spread":0.23631663924467228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283815468","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.0055186446,0.000054861754,0.9932458,0.00008843128,0.000015382917,0.000030674444,0.000025139132,0.00043805497,0.00058303896],"genre_scores_gemma":[0.48161668,0.00012843766,0.5148178,0.00021266722,0.00008660222,0.00034947874,0.00025967165,0.00036094067,0.002167726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977884,0.00083404797,0.000103627775,0.00045619925,0.0006664688,0.0001512652],"domain_scores_gemma":[0.99230266,0.0045664525,0.0005706104,0.0013409415,0.000944791,0.00027452176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051881354,0.0013277441,0.0017483075,0.0008848289,0.0005041694,0.0018974049,0.0034608392,0.0018339396,0.003488737],"category_scores_gemma":[0.026638178,0.000851788,0.0009731524,0.0009636231,0.0017514344,0.0045461417,0.0037996122,0.0032085546,0.0010964036],"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.00036398118,0.00024316223,0.0028919692,0.00016571481,0.000150352,0.00013495293,0.00022558394,0.682734,0.0063243755,0.08194112,0.0029700492,0.22185467],"study_design_scores_gemma":[0.000007857966,0.000040732488,0.00010178779,0.000010857704,0.000008485288,0.000021217784,0.0000055816313,0.981124,0.0013513572,0.016805688,0.00051325624,0.000009210896],"about_ca_topic_score_codex":0.0021459074,"about_ca_topic_score_gemma":0.002051418,"teacher_disagreement_score":0.0051881354,"about_ca_system_score_codex":0.0013403038,"about_ca_system_score_gemma":0.0016236727,"threshold_uncertainty_score":0.027437806},"labels":[],"label_agreement":null},{"id":"W4283815594","doi":"10.1609/aaai.v36i3.20276","title":"Efficient Model-Driven Network for Shadow Removal","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Image Enhancement Techniques","field":"Computer Science","cited_by":58,"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":"University of Science and Technology of China; National Natural Science Foundation of China","keywords":"Shadow (psychology); Interpretability; Computer science; Artificial intelligence; Convolutional neural network; Task (project management); Computer vision; Deep learning; Point (geometry); Shadow mapping; FLOPS; Image (mathematics); Algorithm; Mathematics","score_opus":0.07048946113948087,"score_gpt":0.29685503739243746,"score_spread":0.22636557625295659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283815594","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.017391175,0.00038176466,0.97568464,0.00017508556,0.000074058655,0.000044242057,0.00014353592,0.0031854296,0.0029200776],"genre_scores_gemma":[0.6413545,0.0004234352,0.34260875,0.0004414994,0.0000842485,0.00015116243,0.0010721615,0.000630275,0.013233889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982834,0.000016492231,0.0000053772715,0.00005022305,0.00006525517,0.0000343867],"domain_scores_gemma":[0.9998472,0.00004292233,0.000016438338,0.000029920413,0.00004818731,0.00001530488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024719705,0.00087148434,0.00073554204,0.00034843315,0.0003029165,0.00047271317,0.0014115127,0.0006985791,0.0033320691],"category_scores_gemma":[0.0006316816,0.00048467002,0.0007278066,0.00033957636,0.00032851912,0.00081428903,0.001006389,0.0012229285,0.00079015654],"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.0001186693,0.00006697268,0.00046129627,0.00008555405,0.00006543106,0.00010712047,0.00004310412,0.77232563,0.020571683,0.0043051415,0.0054461625,0.19640322],"study_design_scores_gemma":[0.000002129763,0.0000044627677,0.00002576801,9.560108e-7,0.0000027262538,0.000008037979,0.0000014905878,0.9977804,0.001099097,0.0007460663,0.00032727778,0.0000016023854],"about_ca_topic_score_codex":0.011658877,"about_ca_topic_score_gemma":0.021422146,"teacher_disagreement_score":0.011658877,"about_ca_system_score_codex":0.0010443586,"about_ca_system_score_gemma":0.0014212378,"threshold_uncertainty_score":0.023182034},"labels":[],"label_agreement":null},{"id":"W4283816319","doi":"10.1609/aaai.v36i4.20295","title":"Analysis of Pure Literal Elimination Rule for Non-uniform Random (MAX) k-SAT Problem with an Arbitrary Degree Distribution","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Maritime Ports and Logistics","field":"Engineering","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":"Simon Fraser University","funders":"","keywords":"Literal (mathematical logic); Satisfiability; Degree (music); Heuristics; Range (aeronautics); Mathematics; Distribution (mathematics); Random variable; Variable (mathematics); Uniform distribution (continuous); Algorithm; Computer science; Mathematical optimization; Statistics; Mathematical analysis","score_opus":0.04248425484725595,"score_gpt":0.25789617085683286,"score_spread":0.2154119160095769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283816319","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.6542678,0.00079091004,0.33412915,0.0008251483,0.000055707795,0.00021194795,0.0004385666,0.0010168971,0.008263871],"genre_scores_gemma":[0.9353504,0.00019592035,0.061842665,0.0001711888,0.000032820295,0.00010047435,0.00054522767,0.0001625709,0.0015988586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963825,0.0013474156,0.00013930173,0.0006368566,0.0008656203,0.00062827684],"domain_scores_gemma":[0.9757319,0.019906327,0.0013014824,0.0014099296,0.0012096735,0.00044067757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004502836,0.00045946485,0.0009428895,0.0010107177,0.00063685427,0.0014729643,0.0023239364,0.0009548368,0.0023984783],"category_scores_gemma":[0.022123452,0.00036861672,0.0009949409,0.0012191086,0.0012355767,0.0019658678,0.0007935994,0.0014641003,0.0002840932],"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.0006546067,0.00040971584,0.014322981,0.00026501296,0.00015409893,0.0004795411,0.00021244815,0.86081034,0.009072665,0.059856128,0.0038189518,0.049943417],"study_design_scores_gemma":[0.000023121898,0.000086235545,0.0011995307,0.0000071647087,0.000018737011,0.00013655503,0.00004031627,0.9836574,0.0020353375,0.012532991,0.00025423916,0.000008340244],"about_ca_topic_score_codex":0.0029347928,"about_ca_topic_score_gemma":0.0032899166,"teacher_disagreement_score":0.004502836,"about_ca_system_score_codex":0.0013448347,"about_ca_system_score_gemma":0.0015222526,"threshold_uncertainty_score":0.023813546},"labels":[],"label_agreement":null},{"id":"W4283818626","doi":"10.1609/aaai.v36i2.20102","title":"SyncTalkFace: Talking Face Generation with Precise Lip-Syncing via Audio-Lip Memory","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science; Leverage (statistics); Speech recognition; Synchronization (alternating current); Visualization; Artificial intelligence; Sound quality; Audio visual; Representation (politics); Face (sociological concept); Computer vision; Multimedia; Channel (broadcasting)","score_opus":0.050826251865490946,"score_gpt":0.260706983795317,"score_spread":0.20988073192982604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283818626","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.043068156,0.00080873247,0.94173723,0.00021816856,0.00023831708,0.00013542378,0.00026948444,0.005615606,0.007908934],"genre_scores_gemma":[0.62906307,0.0004440563,0.35440192,0.0004143659,0.00013913341,0.00018554491,0.00078570127,0.0006643934,0.013901872],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99979895,0.000029083569,0.0000075474272,0.00006933909,0.00007115747,0.000023943347],"domain_scores_gemma":[0.9998128,0.000070510556,0.000011908783,0.000050771694,0.000033968543,0.00002008271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036385277,0.0005571693,0.00052568427,0.00034034596,0.00020864702,0.000633618,0.0013201087,0.00077172107,0.006694633],"category_scores_gemma":[0.0009927333,0.00025794443,0.0004655928,0.00017244737,0.00027004397,0.0007850848,0.0010580865,0.00059548795,0.0016752086],"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.00074739504,0.00017353086,0.00069805735,0.00023916674,0.00008929997,0.00054336875,0.00024043347,0.06236721,0.14477803,0.007182825,0.009255465,0.77368534],"study_design_scores_gemma":[0.000057874473,0.00017961267,0.0005970383,0.000027230033,0.000040551815,0.00066475524,0.000067186855,0.91145253,0.07410073,0.0044103526,0.008364643,0.000037568556],"about_ca_topic_score_codex":0.0011232081,"about_ca_topic_score_gemma":0.0015217403,"teacher_disagreement_score":0.006694633,"about_ca_system_score_codex":0.00023495025,"about_ca_system_score_gemma":0.00030840628,"threshold_uncertainty_score":0.02239579},"labels":[],"label_agreement":null},{"id":"W4283819012","doi":"10.1609/aaai.v36i4.20305","title":"Parameterized Approximation Algorithms for K-center Clustering and Variants","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Combinatorics; Approximation algorithm; Center (category theory); Parameterized complexity; Complement (music); Upper and lower bounds; Mathematics; RADIUS; Dimension (graph theory); Generalization; Time complexity; Exponential time hypothesis; Euclidean geometry; Polynomial; VC dimension; Discrete mathematics; Mathematical analysis; Geometry; Crystallography; Computer science","score_opus":0.1178774763026291,"score_gpt":0.2868589415746862,"score_spread":0.16898146527205712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283819012","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.017546246,0.0019990848,0.96645665,0.0011657829,0.00022042592,0.00022510508,0.0007924349,0.0042431825,0.0073510394],"genre_scores_gemma":[0.23144084,0.0018204474,0.75122553,0.00085120974,0.0003413212,0.0005499005,0.0038098362,0.0014801085,0.008480868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99520785,0.0008550658,0.00029680712,0.0017550553,0.0012188349,0.0006662518],"domain_scores_gemma":[0.9935098,0.0020375883,0.00056221883,0.0026103973,0.00094203424,0.00033791747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025336517,0.0027309654,0.0024883067,0.001789251,0.0019339821,0.0037763603,0.007884499,0.0035192287,0.00729003],"category_scores_gemma":[0.014240547,0.0010812326,0.0024740265,0.0057931566,0.0018712672,0.0092414785,0.005251869,0.0047084778,0.0035879044],"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.00093369867,0.00049724465,0.0020192554,0.0008361866,0.00024684012,0.00013344274,0.00054459047,0.50093895,0.004834659,0.1843947,0.042457763,0.2621627],"study_design_scores_gemma":[0.00009662197,0.00008282757,0.0002950213,0.000049029364,0.00005399658,0.00017686286,0.00011938755,0.85391647,0.0022974608,0.13202581,0.0108429855,0.000043569624],"about_ca_topic_score_codex":0.009797476,"about_ca_topic_score_gemma":0.012050384,"teacher_disagreement_score":0.009797476,"about_ca_system_score_codex":0.0063730055,"about_ca_system_score_gemma":0.004126811,"threshold_uncertainty_score":0.046239614},"labels":[],"label_agreement":null},{"id":"W4283820844","doi":"10.1609/aaai.v36i1.20001","title":"Towards Versatile Pedestrian Detector with Multisensory-Matching and Multispectral Recalling Memory","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Video Surveillance and Tracking Methods","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":"Kootenay Association for Science & Technology","funders":"Defense Acquisition Program Administration","keywords":"Multispectral image; Pedestrian detection; Computer science; Modality (human–computer interaction); Detector; Computer vision; Artificial intelligence; Modal; Modalities; Pedestrian; Engineering; Telecommunications","score_opus":0.0715672072654312,"score_gpt":0.2957103954905862,"score_spread":0.224143188225155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283820844","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.042587098,0.00047969553,0.9540205,0.00011005983,0.00008773103,0.000067361114,0.00007707758,0.0013765624,0.0011938055],"genre_scores_gemma":[0.39570528,0.0006175167,0.5971595,0.0005451292,0.000121689875,0.00013360125,0.00041475712,0.00015239781,0.0051501486],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994618,0.000079116566,0.00002891441,0.00016648776,0.00018965075,0.00007397734],"domain_scores_gemma":[0.9993241,0.00011671642,0.00009753333,0.00018395337,0.00020377652,0.00007384226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010324921,0.0009112917,0.0011873381,0.000978605,0.00033390976,0.0009110369,0.0018634533,0.0011421987,0.0015099023],"category_scores_gemma":[0.001708535,0.00047867355,0.00088435906,0.0008210662,0.0005596429,0.0020241358,0.0018602588,0.0009193163,0.0011420192],"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.0009573738,0.00031265998,0.0023826158,0.00025190157,0.00014684632,0.0002690069,0.00013861188,0.023739913,0.3412193,0.007974547,0.0037926522,0.6188145],"study_design_scores_gemma":[0.000050136674,0.0005243819,0.0019941586,0.00002966157,0.00013816841,0.0011182796,0.00005277827,0.7264596,0.25741217,0.004956268,0.007178615,0.00008580356],"about_ca_topic_score_codex":0.00076860195,"about_ca_topic_score_gemma":0.0009017551,"teacher_disagreement_score":0.0018634533,"about_ca_system_score_codex":0.00042714927,"about_ca_system_score_gemma":0.0005522494,"threshold_uncertainty_score":0.0054603815},"labels":[],"label_agreement":null},{"id":"W4283820924","doi":"10.1609/aaai.v36i3.20261","title":"Handling Slice Permutations Variability in Tensor Recovery","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Tensor (intrinsic definition); Subspace topology; Algorithm; Exploit; Tensor contraction; Computer science; Mathematics; Exact solutions in general relativity; Artificial intelligence; Pure mathematics; Mathematical analysis","score_opus":0.12533328613039185,"score_gpt":0.34758533996514046,"score_spread":0.2222520538347486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283820924","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.02611085,0.00011485782,0.97260743,0.00013766965,0.000030628038,0.000031269017,0.000027436367,0.00027681014,0.0006630383],"genre_scores_gemma":[0.53420687,0.0002860817,0.46281797,0.00019370571,0.00010658962,0.00010260913,0.0003199244,0.0004588019,0.0015073657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99668723,0.0011153092,0.00026312197,0.0005827798,0.0011132885,0.00023823245],"domain_scores_gemma":[0.98365146,0.008439644,0.0015848854,0.0046811816,0.0012913715,0.00035140093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003661636,0.00080581254,0.0009639955,0.00070072414,0.0012191416,0.0014776017,0.0011701143,0.0012518687,0.001324536],"category_scores_gemma":[0.022477902,0.00049893593,0.0008817372,0.0010244811,0.002138076,0.0042693694,0.002302198,0.002049129,0.00041937118],"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.0008268117,0.0001495971,0.0075632744,0.00037044584,0.00016589164,0.0008379676,0.0008124208,0.42839512,0.07869116,0.13534668,0.0030192493,0.34382135],"study_design_scores_gemma":[0.000012392517,0.00013915774,0.000808815,0.000015707363,0.000022359438,0.00039524684,0.000094000214,0.9115473,0.034763206,0.049462978,0.0026968562,0.000042004387],"about_ca_topic_score_codex":0.0013736075,"about_ca_topic_score_gemma":0.0017669803,"teacher_disagreement_score":0.003661636,"about_ca_system_score_codex":0.00057704665,"about_ca_system_score_gemma":0.001667399,"threshold_uncertainty_score":0.019364774},"labels":[],"label_agreement":null},{"id":"W4283821931","doi":"10.1609/aaai.v36i6.20642","title":"Cross-Domain Few-Shot Graph Classification","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","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":"Autodesk (Canada)","funders":"","keywords":"Computer science; Encoder; Domain adaptation; Graph; Artificial intelligence; Metric (unit); Task (project management); Machine learning; Domain (mathematical analysis); Theoretical computer science; Transfer of learning; Feature (linguistics); Pattern recognition (psychology); Mathematics; Classifier (UML)","score_opus":0.1337759251364533,"score_gpt":0.32966337636611137,"score_spread":0.19588745122965806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283821931","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.61111194,0.005732844,0.35527965,0.0011223041,0.0006945479,0.000494346,0.0072538736,0.011491549,0.0068189474],"genre_scores_gemma":[0.8693368,0.00039107335,0.10560686,0.0004243849,0.00012297163,0.00020189602,0.020051235,0.0005543535,0.0033104173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692506,0.0008499315,0.000121052006,0.001444006,0.0004038778,0.00025611048],"domain_scores_gemma":[0.99169415,0.00431028,0.0005265353,0.0022149875,0.00079574465,0.0004583037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037905783,0.002311346,0.001707266,0.003146815,0.00097441504,0.0016686455,0.004011596,0.0028011254,0.0016289427],"category_scores_gemma":[0.015219149,0.00040040395,0.0012972604,0.0023953177,0.0012365987,0.003845582,0.002692577,0.0029564602,0.0011405667],"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.0015211821,0.002344985,0.030537343,0.0015081688,0.0010191383,0.0009293924,0.00034229748,0.46252364,0.01712869,0.0072437334,0.04740116,0.42750028],"study_design_scores_gemma":[0.00005618677,0.00032535673,0.005287711,0.000040540308,0.00007237859,0.00040052205,0.00020090576,0.96396583,0.011344408,0.0144807575,0.0037830994,0.000042305353],"about_ca_topic_score_codex":0.005443249,"about_ca_topic_score_gemma":0.007191987,"teacher_disagreement_score":0.005443249,"about_ca_system_score_codex":0.0014256428,"about_ca_system_score_gemma":0.00082633283,"threshold_uncertainty_score":0.020046711},"labels":[],"label_agreement":null},{"id":"W4283822869","doi":"10.1609/aaai.v36i6.20563","title":"Active Sampling for Text Classification with Subinstance Level Queries","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute for Catastrophic Loss Reduction; University of Wisconsin-Madison","keywords":"Computer science; Sample (material); Labeled data; Artificial intelligence; Annotation; Machine learning; Salient; Class (philosophy); Domain (mathematical analysis); Selection (genetic algorithm); Task (project management); Data mining; Information retrieval","score_opus":0.16211629431123747,"score_gpt":0.3247130027261861,"score_spread":0.1625967084149486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283822869","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.010208142,0.00060086994,0.98583466,0.00046578294,0.000054466112,0.00018657748,0.00022012774,0.0015290579,0.0009002748],"genre_scores_gemma":[0.39577997,0.0005742026,0.5938556,0.0009600855,0.0007566781,0.0011877094,0.0025104692,0.00049812975,0.0038771413],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944224,0.0025861934,0.00030660257,0.0011639796,0.0012207357,0.00030018785],"domain_scores_gemma":[0.98198867,0.0136546735,0.00083454093,0.0017938169,0.0012585118,0.0004697291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007830972,0.0015238486,0.0028689574,0.0019286355,0.0010476505,0.0031542073,0.0046145082,0.0028279286,0.0033627653],"category_scores_gemma":[0.024261236,0.00073494716,0.0013565103,0.00274521,0.0016999487,0.005312563,0.0023940403,0.0035365769,0.001562498],"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.0013751371,0.0009596645,0.004330903,0.0004757457,0.00014365955,0.00028717925,0.00085611857,0.42644957,0.009899519,0.06304444,0.015031591,0.47714642],"study_design_scores_gemma":[0.000033098102,0.00004349834,0.00011013684,0.000007369496,0.000006341704,0.000022707136,0.00002533669,0.9738008,0.00088280137,0.023913637,0.0011472922,0.000007070001],"about_ca_topic_score_codex":0.0026693488,"about_ca_topic_score_gemma":0.0035284262,"teacher_disagreement_score":0.007830972,"about_ca_system_score_codex":0.0018306167,"about_ca_system_score_gemma":0.0015925127,"threshold_uncertainty_score":0.041414678},"labels":[],"label_agreement":null},{"id":"W4285364563","doi":"10.1609/aaai.v26i1.8241","title":"Generalized Sampling and Variance in Counterfactual Regret Minimization","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Sports Analytics and Performance","field":"Economics, Econometrics and Finance","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta; Alberta Innovates; Western Canada Research Grid; Compute Canada","keywords":"Estimator; Mathematics; Bias of an estimator; Regret; Counterfactual thinking; Tree traversal; Variance (accounting); Mathematical optimization; Minimum-variance unbiased estimator; Consistent estimator; Sampling (signal processing); Statistics; Computer science; Algorithm","score_opus":0.13375818936523787,"score_gpt":0.2826692167360921,"score_spread":0.1489110273708542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285364563","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.011865495,0.00035239998,0.9858278,0.00033475412,0.00003246131,0.00005765569,0.000031654054,0.00018795687,0.0013099024],"genre_scores_gemma":[0.560349,0.0005658131,0.43547955,0.00050284446,0.00016508788,0.0005114177,0.00022534774,0.00027626907,0.0019246652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9873046,0.009420256,0.0003385133,0.001042744,0.0014485989,0.00044529038],"domain_scores_gemma":[0.94457084,0.04752479,0.0019472352,0.0036854635,0.0018360721,0.00043558245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018624673,0.0012024759,0.0019058017,0.001531431,0.00093442644,0.0022558533,0.0023948846,0.0015383016,0.0016732655],"category_scores_gemma":[0.09424555,0.0009960111,0.0012453751,0.0016112905,0.0034407384,0.0043054405,0.0024503225,0.0027604038,0.0002893633],"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.00018263973,0.00006369001,0.0024919875,0.00009892878,0.0001377554,0.00008853764,0.00016470032,0.71295166,0.00051663426,0.2538442,0.0010836506,0.028375573],"study_design_scores_gemma":[0.000028875636,0.000029395751,0.00025308537,0.000026310001,0.000014292118,0.000024402978,0.000012324583,0.91074353,0.0004839459,0.08794025,0.0004294785,0.000014122066],"about_ca_topic_score_codex":0.004846812,"about_ca_topic_score_gemma":0.004689357,"teacher_disagreement_score":0.018624673,"about_ca_system_score_codex":0.0028467823,"about_ca_system_score_gemma":0.0022695917,"threshold_uncertainty_score":0.09849787},"labels":[],"label_agreement":null},{"id":"W4286898972","doi":"10.1609/aaai.v37i8.26169","title":"ProxyBO: Accelerating Neural Architecture Search via Bayesian Optimization with Zero-Cost Proxies","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Data Classification","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":"Mila - Quebec Artificial Intelligence Institute; HEC Montréal","funders":"National Natural Science Foundation of China","keywords":"Computer science; Bayesian optimization; Bayesian probability; Architecture; Task (project management); Generalization; Search cost; Zero (linguistics); Machine learning; Artificial intelligence; Engineering; Mathematics","score_opus":0.07634166923046799,"score_gpt":0.3028746530710318,"score_spread":0.2265329838405638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286898972","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.026940452,0.0014099666,0.95755565,0.000678338,0.0001418583,0.00017252394,0.0001678813,0.0061843893,0.0067488905],"genre_scores_gemma":[0.48102066,0.0006619571,0.50584,0.0010781937,0.00012376171,0.00054142077,0.00084293145,0.0012274474,0.008663579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907184,0.0002827294,0.00004213819,0.0001835537,0.00026452335,0.00015515166],"domain_scores_gemma":[0.99859744,0.0006715854,0.00011796305,0.00019746221,0.00028880904,0.00012678177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014090912,0.0016653903,0.0015225122,0.00068270945,0.00058137416,0.0011575563,0.0023860706,0.0017780946,0.006332834],"category_scores_gemma":[0.006034435,0.0008074555,0.00083528255,0.0006972845,0.0010741778,0.0020275377,0.0016837328,0.0028465416,0.0019138996],"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.0002858388,0.00021675281,0.0019962655,0.0003160334,0.00012469295,0.000087737055,0.00009794938,0.69525445,0.0058017755,0.016392644,0.013320743,0.2661051],"study_design_scores_gemma":[0.000029658131,0.00004297442,0.000110887304,0.000014526507,0.000014070552,0.000013193502,0.000011350907,0.99375534,0.00076327706,0.0042272992,0.001010892,0.0000065958043],"about_ca_topic_score_codex":0.012819952,"about_ca_topic_score_gemma":0.022049826,"teacher_disagreement_score":0.012819952,"about_ca_system_score_codex":0.0015325937,"about_ca_system_score_gemma":0.0036475963,"threshold_uncertainty_score":0.025490642},"labels":[],"label_agreement":null},{"id":"W4293029109","doi":"10.1609/aaai.v30i1.10077","title":"Solving the Station Repacking Problem","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Solver; Computer science; Mathematical optimization; Reuse; Set (abstract data type); Auction algorithm; Graph; Integer programming; Incentive compatibility; Incentive; Theoretical computer science; Algorithm; Common value auction; Mathematics; Economics; Auction theory; Engineering; Programming language","score_opus":0.21657504311728926,"score_gpt":0.3919628146510241,"score_spread":0.17538777153373486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293029109","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.19560204,0.0009647349,0.74815065,0.0037603718,0.00033252084,0.0005163654,0.00088726525,0.0008979,0.048888206],"genre_scores_gemma":[0.6625237,0.00078772084,0.3193238,0.00059475657,0.00013114115,0.00035944377,0.0012285305,0.00025440854,0.014796458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822944,0.0008816978,0.000069342896,0.00030307812,0.00027283578,0.00024359541],"domain_scores_gemma":[0.9940322,0.0046015657,0.00039259726,0.00041763872,0.00035020505,0.00020579093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002878303,0.0008802523,0.001034475,0.00065923913,0.0013008671,0.0017076221,0.0022243646,0.00262662,0.0118774185],"category_scores_gemma":[0.011301695,0.00060026255,0.0011269528,0.0011666201,0.0012503958,0.002937367,0.0015795752,0.0024591614,0.0009861506],"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.00026106602,0.0003046329,0.0020681273,0.0002883725,0.00012761756,0.00038409678,0.00026056284,0.84560126,0.0012347768,0.08466376,0.008942369,0.055863462],"study_design_scores_gemma":[0.00012157944,0.00022669301,0.00045799708,0.000050729483,0.000053045333,0.0002043332,0.0003947425,0.9270729,0.0019429295,0.060528066,0.0089214025,0.000025568666],"about_ca_topic_score_codex":0.007964455,"about_ca_topic_score_gemma":0.007240574,"teacher_disagreement_score":0.0118774185,"about_ca_system_score_codex":0.0010561182,"about_ca_system_score_gemma":0.0022704245,"threshold_uncertainty_score":0.039733946},"labels":[],"label_agreement":null},{"id":"W4294969213","doi":"10.1609/aaai.v35i11.17171","title":"`Less Than One'-Shot Learning: Learning N Classes From M < N Samples","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":14,"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":"Shot (pellet); Class (philosophy); Artificial intelligence; Task (project management); Computer science; Machine learning; Training (meteorology); One shot; Artificial neural network; Engineering","score_opus":0.20659696630416155,"score_gpt":0.315659843378008,"score_spread":0.10906287707384646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294969213","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.04144813,0.0005326082,0.9527136,0.000996668,0.00015741959,0.00029459817,0.0002596044,0.0019504128,0.0016469852],"genre_scores_gemma":[0.53624254,0.00036966056,0.4515408,0.0016570514,0.0003491991,0.0004890393,0.0016647002,0.0002863924,0.0074005583],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985952,0.00037795637,0.00008200067,0.0005938585,0.00021047879,0.00014055881],"domain_scores_gemma":[0.9966299,0.0016283006,0.00022260868,0.00091769145,0.00030646377,0.00029502253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002658575,0.0015439527,0.002812312,0.0006768897,0.00112813,0.0014096482,0.0052950466,0.003703924,0.0038779397],"category_scores_gemma":[0.007549838,0.00091489305,0.0012795519,0.00094811304,0.002288158,0.0061808373,0.0036857298,0.0038371924,0.0010686518],"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.0012729283,0.0011730625,0.00528868,0.0006323374,0.00041134952,0.00045046821,0.0006406671,0.20199408,0.015722016,0.023534877,0.018854385,0.73002523],"study_design_scores_gemma":[0.00005948194,0.00022861548,0.00079328765,0.000027123746,0.000045255612,0.00017708779,0.00009465005,0.9408795,0.0063541587,0.04919506,0.002100868,0.000044872093],"about_ca_topic_score_codex":0.006208773,"about_ca_topic_score_gemma":0.0074389274,"teacher_disagreement_score":0.006208773,"about_ca_system_score_codex":0.0013089561,"about_ca_system_score_gemma":0.0014412071,"threshold_uncertainty_score":0.01406008},"labels":[],"label_agreement":null},{"id":"W4294974580","doi":"10.1609/aaai.v35i18.17900","title":"Gradient-Based Localization and Spatial Attention for Confidence Measure in Fine-Grained Recognition using Deep Neural Networks","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","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":"Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Measure (data warehouse); Artificial intelligence; Machine learning; Deep learning; Deep neural networks; Sampling (signal processing); Artificial neural network; Identification (biology); Segmentation; Retraining; Data mining; Pattern recognition (psychology); Computer vision","score_opus":0.07838287262522826,"score_gpt":0.2953814345206495,"score_spread":0.21699856189542127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294974580","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.022126578,0.00036429972,0.9758093,0.00028849085,0.000027554266,0.000024196266,0.000052558382,0.00063079235,0.0006762782],"genre_scores_gemma":[0.8310186,0.00034113208,0.16643861,0.00023461545,0.00013609965,0.00012716939,0.00023305645,0.00026610907,0.0012045096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750346,0.000753002,0.00016580538,0.0005900066,0.00077459664,0.00021315391],"domain_scores_gemma":[0.98453414,0.010216622,0.0015496806,0.0017787808,0.0013927254,0.0005279801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057639894,0.0009832334,0.001286806,0.0026231133,0.0006159475,0.0019581143,0.0025828248,0.0020597617,0.002035307],"category_scores_gemma":[0.033417158,0.0005716801,0.0007932304,0.0013922421,0.0028866413,0.0047938814,0.0045207,0.003085418,0.00039786624],"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.00040199637,0.00013763859,0.0038596862,0.00017196444,0.00008931493,0.00009541569,0.00022246044,0.7049349,0.006069214,0.09441179,0.00229328,0.1873124],"study_design_scores_gemma":[0.0000047762996,0.000024463317,0.0002666384,0.00001117585,0.000004602324,0.000016364469,0.0000054254397,0.97283465,0.0015951807,0.025032423,0.00019285448,0.000011470298],"about_ca_topic_score_codex":0.0022999966,"about_ca_topic_score_gemma":0.0017895475,"teacher_disagreement_score":0.0057639894,"about_ca_system_score_codex":0.0019230401,"about_ca_system_score_gemma":0.0010098501,"threshold_uncertainty_score":0.030483246},"labels":[],"label_agreement":null},{"id":"W4295846892","doi":"10.1609/aaai.v25i1.7885","title":"Market Manipulation with Outside Incentives","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Incentive; Distrust; Microeconomics; Order (exchange); Welfare; Stochastic game; Information aggregation; Outcome (game theory); Economics; Private information retrieval; Business; Computer science; Market economy","score_opus":0.3065758022861427,"score_gpt":0.3691759365714204,"score_spread":0.06260013428527772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295846892","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.269189,0.0012679981,0.50138944,0.007706512,0.00033061256,0.0006583895,0.00030478495,0.00050077174,0.21865256],"genre_scores_gemma":[0.95659506,0.0002488892,0.030499008,0.0006851549,0.00013563137,0.00031420775,0.000088111025,0.000059770788,0.0113742035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99226564,0.0036407313,0.0004246563,0.0012620601,0.0015137234,0.0008931283],"domain_scores_gemma":[0.9750616,0.012928464,0.0043594767,0.0054082074,0.0013529211,0.0008894535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070625013,0.0012366493,0.0013620289,0.0009124046,0.0017577183,0.004948333,0.0016574708,0.0037453405,0.010111905],"category_scores_gemma":[0.028933777,0.00071960874,0.0012209144,0.0006258723,0.0038930194,0.008444625,0.004267641,0.0030396117,0.0010752553],"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.00031260317,0.00030151763,0.0025265727,0.00027860038,0.00017253085,0.00074720295,0.0009301543,0.017508408,0.0090772305,0.9371955,0.0024469767,0.028502753],"study_design_scores_gemma":[0.0002143959,0.00029410474,0.0019350159,0.00012811617,0.0001321093,0.0005114218,0.00038475692,0.10845507,0.0071303616,0.8590658,0.021669239,0.00007967236],"about_ca_topic_score_codex":0.00074813707,"about_ca_topic_score_gemma":0.0004763835,"teacher_disagreement_score":0.010111905,"about_ca_system_score_codex":0.0017146686,"about_ca_system_score_gemma":0.0015131594,"threshold_uncertainty_score":0.037350476},"labels":[],"label_agreement":null},{"id":"W4296942682","doi":"10.1609/aaai.v30i1.10180","title":"Factorization Ranking Model for Move Prediction in the Game of Go","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ranking (information retrieval); Computer science; Factorization; Artificial intelligence; Machine learning; Preference; Computation; Process (computing); Algorithm; Mathematics; Statistics","score_opus":0.10763938493795917,"score_gpt":0.3094855580878762,"score_spread":0.20184617314991704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296942682","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.07511655,0.00044181268,0.91614157,0.0007159526,0.00010919383,0.0001684653,0.00055058306,0.0008708619,0.0058849985],"genre_scores_gemma":[0.8471246,0.00032126965,0.13725795,0.00023581083,0.00008006641,0.0002980198,0.0010902275,0.00013007692,0.013461941],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990264,0.0003094796,0.000038969312,0.0002908426,0.00015738502,0.00017682351],"domain_scores_gemma":[0.9983064,0.0009637361,0.0002138306,0.00011329867,0.00023747278,0.00016528119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013767758,0.0012300847,0.0014611371,0.0012868384,0.00082523236,0.0010903977,0.0022227776,0.001427345,0.0074806237],"category_scores_gemma":[0.0050353347,0.00038744858,0.0010050888,0.0010146507,0.0009216285,0.0028933273,0.0009692241,0.0019498263,0.0011916709],"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.00032563854,0.00025791238,0.008407276,0.00018285448,0.000115632356,0.0002446406,0.0003316161,0.79484564,0.0017815091,0.07105072,0.0067115095,0.11574503],"study_design_scores_gemma":[0.000007658809,0.000034525125,0.0003993175,0.0000053728763,0.000008325651,0.000016481785,0.000019010498,0.9871492,0.00009765038,0.011844071,0.0004078799,0.000010475962],"about_ca_topic_score_codex":0.026552541,"about_ca_topic_score_gemma":0.035083625,"teacher_disagreement_score":0.026552541,"about_ca_system_score_codex":0.0015932331,"about_ca_system_score_gemma":0.0014968066,"threshold_uncertainty_score":0.052795947},"labels":[],"label_agreement":null},{"id":"W4298049763","doi":"10.1609/aaai.v31i1.10592","title":"The Positronic Economist: A Computational System for Analyzing Economic Mechanisms","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision 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 British Columbia","funders":"","keywords":"Python (programming language); Computer science; Graph; Theoretical computer science; Programming language; Mechanism (biology); Software; Action (physics); Software engineering; Artificial intelligence; Epistemology","score_opus":0.16592107418539456,"score_gpt":0.39102332533550005,"score_spread":0.2251022511501055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298049763","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.006676675,0.00010605912,0.85947645,0.0006902968,0.00011935218,0.00038723767,0.0061339536,0.11129291,0.015117128],"genre_scores_gemma":[0.13116536,0.0004987653,0.8181226,0.00082168693,0.0001128967,0.0021079532,0.008926752,0.022291355,0.01595268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937207,0.00015583097,0.0000526642,0.00014731874,0.00020126716,0.00007095893],"domain_scores_gemma":[0.9979321,0.0011621987,0.00015900224,0.0003988122,0.00022951042,0.00011837451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018532755,0.00091362384,0.0008545703,0.0014739878,0.00074779673,0.0022825664,0.003324265,0.0010233846,0.029446322],"category_scores_gemma":[0.00823743,0.0013647842,0.0016705674,0.0010244235,0.0012815344,0.0039413986,0.003289457,0.0024914036,0.0058278367],"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.00087050983,0.00043956863,0.007969965,0.0016076382,0.00039564742,0.0007331172,0.00077437935,0.13699947,0.00749343,0.45992854,0.2399398,0.14284801],"study_design_scores_gemma":[0.0002973806,0.00006322448,0.00091759104,0.00011422421,0.00007784862,0.0003469943,0.000052383602,0.6871271,0.0068887067,0.12832858,0.17568567,0.00010032519],"about_ca_topic_score_codex":0.0046127765,"about_ca_topic_score_gemma":0.005138565,"teacher_disagreement_score":0.029446322,"about_ca_system_score_codex":0.0017433423,"about_ca_system_score_gemma":0.003914528,"threshold_uncertainty_score":0.09850782},"labels":[],"label_agreement":null},{"id":"W4300847318","doi":"10.1609/aaai.v29i1.9363","title":"TDS+: Improving Temperature Discovery Search","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Game theory; Algorithm; Mathematics; Mathematical optimization; Theoretical computer science; Mathematical economics","score_opus":0.10757399461640049,"score_gpt":0.31572006443464384,"score_spread":0.20814606981824335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300847318","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.017355315,0.0007182428,0.96843576,0.00044143014,0.0002978926,0.0001754972,0.00028183416,0.0040008705,0.008293203],"genre_scores_gemma":[0.26274234,0.0006707626,0.7208931,0.0006818989,0.00024350634,0.0005137364,0.0011475942,0.0013443114,0.011762746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769706,0.0006892096,0.00013075964,0.00043992625,0.00077686895,0.00026618803],"domain_scores_gemma":[0.99605393,0.002054738,0.00025625227,0.00071381114,0.00065620977,0.00026509704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022691793,0.0014419237,0.0021834956,0.001571853,0.001145695,0.0019642052,0.0038334087,0.0019545094,0.009464282],"category_scores_gemma":[0.011887322,0.00086909457,0.0019780707,0.0019264732,0.0016587299,0.003875115,0.004135242,0.00289433,0.003375764],"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.00073140685,0.00037941107,0.002240454,0.00041938786,0.0001671325,0.00016280766,0.00024111249,0.49191594,0.0048585692,0.10914815,0.027181841,0.36255378],"study_design_scores_gemma":[0.00010400434,0.00008382366,0.00011065906,0.00001863792,0.000028424854,0.00007055073,0.000022757,0.9601638,0.0011936148,0.03264536,0.0055411384,0.000017145512],"about_ca_topic_score_codex":0.0059508607,"about_ca_topic_score_gemma":0.0059917127,"teacher_disagreement_score":0.009464282,"about_ca_system_score_codex":0.0018410147,"about_ca_system_score_gemma":0.0041756737,"threshold_uncertainty_score":0.031661212},"labels":[],"label_agreement":null},{"id":"W4301753623","doi":"10.1609/aaai.v26i2.18961","title":"Statistical Anomaly Detection for Train Fleets","year":2012,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bombardier (Canada)","funders":"","keywords":"Anomaly detection; Train; Euros; Computer science; Anomaly (physics); Event (particle physics); Component (thermodynamics); Real-time computing; Data mining; Geography","score_opus":0.07159672911517209,"score_gpt":0.3064512555109514,"score_spread":0.23485452639577933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301753623","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.052391414,0.000068697984,0.9423886,0.00008720757,0.000030381601,0.000035332083,0.00031480665,0.0041148155,0.00056876073],"genre_scores_gemma":[0.63139004,0.00009997803,0.3650927,0.00004019383,0.00005161724,0.00010022584,0.0013643426,0.00033070872,0.0015301714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986821,0.00021954675,0.00009407497,0.00024572926,0.00063246983,0.00012609697],"domain_scores_gemma":[0.9967374,0.0014160272,0.0004412971,0.00042130696,0.00084793754,0.00013602556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011829681,0.0006222219,0.0006155575,0.0027912797,0.00041841218,0.0007428087,0.0012705771,0.00059936556,0.0014579063],"category_scores_gemma":[0.007622382,0.00032043082,0.00067057065,0.0018217701,0.0004697279,0.0013441682,0.000793444,0.0009969629,0.00041482077],"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.00023238383,0.00013992081,0.024323594,0.00009890696,0.00015679986,0.00039776968,0.0002380097,0.63038766,0.026884343,0.015929911,0.0037305655,0.29748017],"study_design_scores_gemma":[0.000003525295,0.0000154401,0.0012435083,0.000001938279,0.0000038982403,0.000059388567,0.00000921844,0.9921038,0.0022253317,0.0035322797,0.000793583,0.000008172205],"about_ca_topic_score_codex":0.0067858174,"about_ca_topic_score_gemma":0.0048373574,"teacher_disagreement_score":0.0067858174,"about_ca_system_score_codex":0.0006650279,"about_ca_system_score_gemma":0.0007067035,"threshold_uncertainty_score":0.013492644},"labels":[],"label_agreement":null},{"id":"W4301846827","doi":"10.1609/aaai.v27i1.8509","title":"Conference Committees","year":2013,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office National d'études et de Recherches Aérospatiales; Menzies Centre for Australian Studies, King's College London, University of London; Consejo Superior de Investigaciones Científicas; Queens College, City University of New York; University at Buffalo; University of California, Los Angeles; Stony Brook University; Région Normandie; Singapore Management University; Ariel University; Université de Lyon; University of Illinois at Urbana-Champaign; Universität Stuttgart; Université Paris-Est Créteil Val-de-Marne; Universitat de Lleida; Universität Ulm; Office of Naval Research; Libera Università di Bolzano; Université de Montpellier; Rheinische Friedrich-Wilhelms-Universität Bonn; Akademia Górniczo-Hutnicza im. Stanislawa Staszica; Universiteit van Tilburg; German University in Cairo; Università degli Studi di Brescia; Universität Mannheim; Università degli Studi di Verona; Technische Universität Berlin; Universidade do Porto; Université Claude Bernard Lyon 1; Aristotle University of Thessaloniki; Universität Zürich; Universidad de Oviedo; Technion-Israel Institute of Technology; National and Kapodistrian University of Athens; Universitetet i Bergen; National Institutes of Health; Chinese University of Hong Kong; Centre National de la Recherche Scientifique; Microsoft Research Asia; University of Waterloo; Sapienza Università di Roma; Politechnika Poznańska; Universität Leipzig; Tsinghua University; Lawrence Berkeley National Laboratory; KU Leuven; Technological University Dublin; Universidad Politécnica de Madrid; University of Toronto; Örebro Universitet; University of Maryland, Baltimore County; Hebrew University of Jerusalem; Michigan Technological University; Albert-Ludwigs-Universität Freiburg; Jet Propulsion Laboratory; Technische Universität Dresden; Pohang University of Science and Technology; Chinese Academy of Sciences; Universität Bielefeld; Boeing; Loyola Marymount University; Vrije Universiteit Amsterdam; Temple University; Universiteit Utrecht; Université de Fribourg; Google; University of Wisconsin-Madison; Universiteit van Amsterdam; Aberystwyth University; RMIT University; Monash University; École Polytechnique Fédérale de Lausanne; Shanghai Jiao Tong University; Raytheon Company; University College Cork; University of Galway; Queen's University Belfast; Universidad de Chile; University of Pittsburgh; Loughborough University; University of Oxford; City University of New York; Ulsan National Institute of Science and Technology; Freie Universität Berlin; University of Rochester; Indian Council of Agricultural Research; King's College London; Imperial College London; University of Alberta; University of Texas at Dallas; Universität Siegen; Indian Institute of Technology Delhi; Inyuvesi Yakwazulu-Natali; Space Telescope Science Institute; Instituto Superior Técnico; Universität Trier; Florida Institute of Technology; Northwestern University; Macalester College; University of Memphis; Eidgenössische Technische Hochschule Zürich; Southeast University; Institut national de recherche en informatique et en automatique (INRIA); University of Essex; University of Denver; Universidade de São Paulo; Queen's University; Oregon State University; Universität Bremen; Carnegie Mellon University; New Mexico State University; Siemens; Bucknell University; State University of New York; University of Pennsylvania; University of Patras; Universität Basel; Pennsylvania State University; Universität Kassel; National Institute of Informatics; Case Western Reserve University; Harvard University; University of Aberdeen; Ben-Gurion University of the Negev; Lehigh University; Johns Hopkins University; North Carolina State University; University of Washington; Microsoft Research; Univerzita Karlova v Praze; Colorado State University; Bard College; Universiteit Maastricht; University of New South Wales; Università della Calabria; University of Crete; California Institute of Technology; National University of Ireland; University of Tulsa; Rensselaer Polytechnic Institute; Tulane University; Griffith University; Harvey Mudd College; Universitat Pompeu Fabra; Arizona State University; Brown University; Universidade Federal do Rio de Janeiro; Georgia Institute of Technology; Rice University; Wake Forest University; Ohio State University; Nanyang Technological University; National Aeronautics and Space Administration; University of Oklahoma; University of Southern California; Carleton College; University of Western Macedonia; Purdue University; Vanderbilt University; York University; George Mason University; Euskal Herriko Unibertsitatea; Massachusetts Institute of Technology; Sandia National Laboratories; Washington State University; Boston College; Technische Universiteit Delft; University of Southampton","keywords":"Political science","score_opus":0.12955216219586754,"score_gpt":0.24836006488245113,"score_spread":0.11880790268658359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301846827","genre_codex":"other","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.0014514765,0.043144207,0.01420149,0.080269344,0.38137946,0.0070563694,0.034150843,0.005481003,0.43286583],"genre_scores_gemma":[0.0077267867,0.02489935,0.009319053,0.017093962,0.11919958,0.007594352,0.037985582,0.0021765633,0.7740048],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9917869,0.0015197232,0.00084730017,0.0011230343,0.0038586804,0.000864352],"domain_scores_gemma":[0.9026133,0.00385421,0.0036433304,0.0035696877,0.060986217,0.025333239],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.012437758,0.0022630114,0.0025450434,0.0075479876,0.00426174,0.011469008,0.004613065,0.0055803517,0.56083924],"category_scores_gemma":[0.027322764,0.001038081,0.0019941612,0.006166604,0.00072187366,0.0039412864,0.0030523094,0.0046911864,0.5315025],"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.000042308668,0.000022717364,0.00007299791,0.00027351317,0.000007716621,0.000019378524,0.000011737315,0.000061005114,0.00022373773,0.00048369443,0.9712189,0.027562387],"study_design_scores_gemma":[0.00003085276,0.000022194137,0.0004154487,0.0002845445,0.000010433498,0.0000526374,0.000035266323,0.00015293375,0.00019363675,0.00073464226,0.9980513,0.000016091022],"about_ca_topic_score_codex":0.0017979743,"about_ca_topic_score_gemma":0.00337148,"teacher_disagreement_score":0.56083924,"about_ca_system_score_codex":0.0029071427,"about_ca_system_score_gemma":0.009994232,"threshold_uncertainty_score":0.62640953},"labels":[],"label_agreement":null},{"id":"W4302612654","doi":"10.1609/aaai.v28i1.9088","title":"Partial Satisfaction Planning under Time Uncertainty with Control on When Objectives Can Be Aborted","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","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é du Québec à Montréal","funders":"","keywords":"Abort; Plan (archaeology); Control (management); Computer science; Duration (music); Operations research; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.1135055389110616,"score_gpt":0.3560724364594953,"score_spread":0.24256689754843372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4302612654","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.075697035,0.00039371752,0.9146385,0.00051088654,0.00005102569,0.000109988585,0.00012361443,0.0005116613,0.007963529],"genre_scores_gemma":[0.88306195,0.00020681076,0.113965675,0.00013512975,0.000042634896,0.00013860909,0.00013764208,0.000104218336,0.0022073565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973278,0.0010018973,0.00015191645,0.00036333184,0.0007969484,0.00035813393],"domain_scores_gemma":[0.9903268,0.0066909557,0.0009552026,0.0008679922,0.000764781,0.0003943126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038185206,0.00088053034,0.0008386888,0.00040524625,0.0007274491,0.0015071314,0.001072458,0.0005517998,0.00203696],"category_scores_gemma":[0.0119932275,0.00057536305,0.00074349844,0.0006105466,0.0019707219,0.0024450864,0.0017062991,0.0018249925,0.00020085856],"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.00047235578,0.000071172646,0.0012325692,0.0001533459,0.00008310219,0.00027828172,0.00060876,0.8300922,0.0050273812,0.101265125,0.0011077102,0.059608012],"study_design_scores_gemma":[0.00004513734,0.0001411233,0.00043847773,0.000026101949,0.000035435296,0.0000544126,0.00009566006,0.87159157,0.0032266157,0.12213107,0.0021876185,0.000026816491],"about_ca_topic_score_codex":0.0039611356,"about_ca_topic_score_gemma":0.0041788234,"teacher_disagreement_score":0.0039611356,"about_ca_system_score_codex":0.0011909418,"about_ca_system_score_gemma":0.0019174744,"threshold_uncertainty_score":0.02019453},"labels":[],"label_agreement":null},{"id":"W4375923538","doi":"10.1609/aaai.v29i1.9747","title":"Representation Discovery for MDPs Using Bisimulation Metrics","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI 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":"Bisimulation; Metric (unit); Computer science; Representation (politics); Computation; Convergence (economics); Sequence (biology); Markov decision process; Theoretical computer science; State space; Metric space; State (computer science); Algorithm; Mathematical optimization; Markov process; Mathematics","score_opus":0.32708109989517187,"score_gpt":0.3819641333340382,"score_spread":0.05488303343886636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4375923538","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.0029028435,0.00003921657,0.9961915,0.000057209723,0.0000064560054,0.000056517878,0.000045707937,0.00025957296,0.0004408929],"genre_scores_gemma":[0.119715504,0.00013464202,0.8785263,0.000055408684,0.0000150107,0.0004267398,0.00040301358,0.00018495985,0.00053840736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99665785,0.0011451303,0.00026324173,0.0005822236,0.001159517,0.00019203349],"domain_scores_gemma":[0.9927435,0.0046186056,0.00064751913,0.0009613684,0.00086149876,0.00016748685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034727363,0.0015332184,0.0014895721,0.0027177783,0.000955721,0.0021673269,0.0023042767,0.0014509341,0.0031481124],"category_scores_gemma":[0.020425286,0.00096712646,0.0023109403,0.0018189248,0.001647089,0.004114798,0.0040998165,0.002533501,0.00076227135],"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.00007893367,0.00007064181,0.00078795105,0.00021534562,0.00006470475,0.00009754047,0.00026080027,0.6964738,0.0026137636,0.16700666,0.0010746975,0.13125521],"study_design_scores_gemma":[0.000010266696,0.000025334895,0.000037192396,0.000020302856,0.00000752741,0.000020198913,0.000021193106,0.9425176,0.0012075566,0.055049926,0.0010733422,0.000009611668],"about_ca_topic_score_codex":0.0048081847,"about_ca_topic_score_gemma":0.004785617,"teacher_disagreement_score":0.0048081847,"about_ca_system_score_codex":0.0024200906,"about_ca_system_score_gemma":0.0032211076,"threshold_uncertainty_score":0.0183658},"labels":[],"label_agreement":null},{"id":"W4382202654","doi":"10.1609/aaai.v37i11.26623","title":"A Graph Fusion Approach for Cross-Lingual Machine Reading Comprehension","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Leverage (statistics); Syntax; Natural language processing; Artificial intelligence; Machine translation; Graph; Benchmark (surveying); Rule-based machine translation; Knowledge graph; Comprehension; Theoretical computer science; Programming language","score_opus":0.08442248157411145,"score_gpt":0.34648846138502365,"score_spread":0.2620659798109122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382202654","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.013175587,0.0007939536,0.97307354,0.00050871744,0.000100204124,0.00015249332,0.0005725118,0.008557894,0.0030651293],"genre_scores_gemma":[0.29984742,0.0009225904,0.68142325,0.00068028976,0.00023589938,0.0004120214,0.007481789,0.0012649684,0.0077316454],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981798,0.00059663487,0.00008257209,0.00076014997,0.00026130828,0.00011951181],"domain_scores_gemma":[0.99703634,0.0013201286,0.00017242822,0.0006770476,0.0006908109,0.00010327096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020272348,0.002071777,0.0016165137,0.0044843596,0.0012764375,0.0013770832,0.0030236433,0.0027421687,0.0059264298],"category_scores_gemma":[0.0060994322,0.0007653072,0.0023507231,0.0036142236,0.0011446893,0.005312752,0.003237432,0.0031536585,0.0036408096],"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.00025389154,0.00042486127,0.0016363796,0.00042011778,0.00028037542,0.0005234382,0.00086469506,0.08325958,0.020405356,0.02482302,0.020655649,0.8464527],"study_design_scores_gemma":[0.00003737815,0.00014802883,0.0011928184,0.00004033879,0.00011034781,0.0001563918,0.00027356678,0.88856,0.008306906,0.090745255,0.010377167,0.000051670515],"about_ca_topic_score_codex":0.008603383,"about_ca_topic_score_gemma":0.012245582,"teacher_disagreement_score":0.008603383,"about_ca_system_score_codex":0.0015454405,"about_ca_system_score_gemma":0.0016839156,"threshold_uncertainty_score":0.019825876},"labels":[],"label_agreement":null},{"id":"W4382202705","doi":"10.1609/aaai.v37i11.26486","title":"Adversarial Word Dilution as Text Data Augmentation in Low-Resource Regime","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","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 Ottawa","funders":"Fundamental Research Funds for the Central Universities; State Key Laboratory of Software Development Environment","keywords":"Benchmark (surveying); Word (group theory); Computer science; Mixing (physics); Embedding; Resource (disambiguation); Artificial intelligence; Adversarial system; Process (computing); Natural language processing; Word embedding; Class (philosophy); Machine learning; Data mining; Mathematics","score_opus":0.1281727623387476,"score_gpt":0.3286053743921488,"score_spread":0.2004326120534012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382202705","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.05119413,0.00081801,0.9414651,0.00084053655,0.00019519683,0.00019161297,0.00033423537,0.0017473426,0.0032139395],"genre_scores_gemma":[0.7924888,0.00046455237,0.1959961,0.0010047633,0.00024657467,0.00060775864,0.0011564159,0.0002991594,0.0077358824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987601,0.000542925,0.00007218083,0.00029204428,0.00023692749,0.00009591286],"domain_scores_gemma":[0.99481046,0.0036473526,0.00035137616,0.000707453,0.00035597538,0.00012733018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023987794,0.0017123977,0.0012773868,0.00052997,0.00045732528,0.00088493427,0.0017061408,0.0014201291,0.0029523617],"category_scores_gemma":[0.009880307,0.0005109532,0.00085596426,0.0005814154,0.0021022232,0.0027433294,0.0028486252,0.00274975,0.0012582876],"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.000766985,0.00027744548,0.0024711355,0.00040596706,0.0000991047,0.00040327464,0.0002977972,0.7521851,0.023953997,0.02793911,0.009521735,0.18167837],"study_design_scores_gemma":[0.000024581557,0.00009596217,0.00015646858,0.000020959234,0.000014302269,0.00007289939,0.000017541463,0.9768797,0.006427346,0.014651978,0.0016227227,0.000015501324],"about_ca_topic_score_codex":0.0007427991,"about_ca_topic_score_gemma":0.000949601,"teacher_disagreement_score":0.0029523617,"about_ca_system_score_codex":0.0006811292,"about_ca_system_score_gemma":0.0005812991,"threshold_uncertainty_score":0.012686074},"labels":[],"label_agreement":null},{"id":"W4382202736","doi":"10.1609/aaai.v37i10.26371","title":"Learning to Shape Rewards Using a Game of Two Partners","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; University of Alberta; UK Research and Innovation; Alberta Machine Intelligence Institute; Compute Canada; Canadian Institute for Advanced Research","keywords":"Reinforcement learning; Computer science; Task (project management); Function (biology); Convergence (economics); Construct (python library); Markov decision process; Artificial intelligence; State (computer science); Domain (mathematical analysis); Machine learning; Markov process; Algorithm; Mathematics; Engineering","score_opus":0.15084227496424973,"score_gpt":0.37279789706808497,"score_spread":0.22195562210383524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382202736","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.092864364,0.0001195796,0.8928725,0.0007025832,0.00004799591,0.0003020561,0.000057466204,0.00055365334,0.012479752],"genre_scores_gemma":[0.8495136,0.00008640532,0.14352928,0.00021103362,0.000019240491,0.00038067737,0.00005069852,0.000066775414,0.00614219],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989791,0.00048081172,0.00004521236,0.00018639583,0.00017659995,0.00013191049],"domain_scores_gemma":[0.9972474,0.0017552455,0.00027469202,0.00022732321,0.00016499285,0.00033027958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017828947,0.0012486486,0.0008365549,0.00034218872,0.0007252915,0.001009763,0.0016016337,0.0017300649,0.0048851063],"category_scores_gemma":[0.006974917,0.0005172927,0.00068444916,0.0002411776,0.0019498272,0.0016775014,0.0021765716,0.0017616642,0.00055435044],"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.00027136927,0.00022061073,0.0014562544,0.00009497629,0.000072385265,0.00034470414,0.00038129243,0.88352305,0.004889905,0.0694508,0.0012484343,0.038046125],"study_design_scores_gemma":[0.000047946844,0.000085206244,0.00010442823,0.00001021002,0.000009220837,0.000037155933,0.000027860211,0.9792367,0.0007736336,0.018644521,0.0010115207,0.0000116119045],"about_ca_topic_score_codex":0.0029411567,"about_ca_topic_score_gemma":0.0029876686,"teacher_disagreement_score":0.0048851063,"about_ca_system_score_codex":0.0010351903,"about_ca_system_score_gemma":0.0015709059,"threshold_uncertainty_score":0.016342282},"labels":[],"label_agreement":null},{"id":"W4382202851","doi":"10.1609/aaai.v37i11.26579","title":"Multi-Mask Label Mapping for Prompt-Based Learning","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Text and Document Classification Technologies","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 Ottawa","funders":"Fundamental Research Funds for the Central Universities; State Key Laboratory of Software Development Environment","keywords":"Computer science; Natural language processing; Artificial intelligence; Task (project management); Context (archaeology); Exploit; Word (group theory); Machine learning; Linguistics","score_opus":0.19232711549277473,"score_gpt":0.3382618546859622,"score_spread":0.14593473919318747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382202851","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.031297546,0.0002705848,0.95893204,0.00037582693,0.000106908854,0.00014984739,0.00019507213,0.007569248,0.0011030061],"genre_scores_gemma":[0.55770063,0.00015939798,0.432741,0.0007697555,0.00014963976,0.00045212146,0.0011993035,0.000496053,0.00633209],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839383,0.0005980635,0.00006870876,0.0005519769,0.00026771272,0.000119784614],"domain_scores_gemma":[0.9952878,0.0023049372,0.00026646862,0.0012064391,0.0005964495,0.00033789387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024039918,0.0016039158,0.0014695654,0.00078009494,0.0009005016,0.0012357786,0.0039875936,0.0030019644,0.0044873576],"category_scores_gemma":[0.011153188,0.0006324361,0.0008863761,0.0007873507,0.0013512123,0.004965818,0.0031327412,0.0037061665,0.0021238138],"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.0013351041,0.0010356711,0.0034666199,0.00036971332,0.00007048858,0.00039585243,0.0007750186,0.11160705,0.033547394,0.01601753,0.011888554,0.8194909],"study_design_scores_gemma":[0.00004926635,0.00031485196,0.0003804709,0.000016937794,0.00002074536,0.00011988535,0.0001073921,0.9541438,0.012918,0.029058231,0.0028371385,0.000033344942],"about_ca_topic_score_codex":0.0014790483,"about_ca_topic_score_gemma":0.0028597508,"teacher_disagreement_score":0.0044873576,"about_ca_system_score_codex":0.0010233388,"about_ca_system_score_gemma":0.0015407351,"threshold_uncertainty_score":0.015011728},"labels":[],"label_agreement":null},{"id":"W4382202912","doi":"10.1609/aaai.v37i10.26412","title":"Privacy Attacks on Schedule-Driven Data","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; York University","funders":"Bundesministerium für Bildung und Forschung","keywords":"Computer science; Adversary; Schedule; Scheduling (production processes); Benchmark (surveying); Adversary model; Operations research; Private information retrieval; Computer security; Mathematical optimization; Engineering; Mathematics","score_opus":0.2273735092927441,"score_gpt":0.3630738150849743,"score_spread":0.13570030579223022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382202912","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.09028168,0.00057063525,0.8995262,0.0024838995,0.00017959466,0.00030557657,0.0010740581,0.0009788686,0.0045994916],"genre_scores_gemma":[0.86987156,0.00038768002,0.1252743,0.00057440647,0.00017275485,0.00038145197,0.0007933835,0.00019954839,0.0023448851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9743755,0.011727072,0.0017454933,0.0031597519,0.007658663,0.0013336403],"domain_scores_gemma":[0.9065884,0.048497777,0.008310647,0.031633146,0.003762665,0.0012073551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015339946,0.0009849083,0.0013849094,0.0014272261,0.0017360465,0.0036542744,0.002583424,0.0026626254,0.001399961],"category_scores_gemma":[0.06501328,0.000987386,0.0017028602,0.0022671216,0.0039012008,0.008409907,0.0041414914,0.0049482514,0.00041501975],"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.00104404,0.00023626005,0.004308388,0.00037559876,0.0002711583,0.00061666075,0.0013624156,0.52427167,0.009004347,0.37372345,0.0055716923,0.07921435],"study_design_scores_gemma":[0.00007564572,0.00019745274,0.0006323563,0.00005347506,0.00005072283,0.00036690515,0.00021287601,0.6902932,0.011135762,0.2887566,0.008173585,0.000051427047],"about_ca_topic_score_codex":0.0012698155,"about_ca_topic_score_gemma":0.0009991303,"teacher_disagreement_score":0.015339946,"about_ca_system_score_codex":0.0034984446,"about_ca_system_score_gemma":0.003917619,"threshold_uncertainty_score":0.08112633},"labels":[],"label_agreement":null},{"id":"W4382202917","doi":"10.1609/aaai.v37i9.26264","title":"USDNL: Uncertainty-Based Single Dropout in Noisy Label Learning","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Data Classification","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 Calgary","funders":"Wuhan University; National Natural Science Foundation of China","keywords":"Computer science; Dropout (neural networks); Machine learning; Artificial intelligence; Entropy (arrow of time); Computation; Artificial neural network; Cross entropy; Overhead (engineering); Deep neural networks; Selection (genetic algorithm); Algorithm; Pattern recognition (psychology)","score_opus":0.10593084394319452,"score_gpt":0.3191468016734711,"score_spread":0.21321595773027657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382202917","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.010483303,0.00025843934,0.9863201,0.00027939453,0.000049589602,0.00011348564,0.00011917309,0.0017932807,0.0005832052],"genre_scores_gemma":[0.4885997,0.0004575493,0.5019729,0.0010820162,0.00021870242,0.00064192613,0.0017544039,0.000756345,0.0045164586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744993,0.0008518485,0.00018263374,0.00060208264,0.0006864351,0.00022700973],"domain_scores_gemma":[0.9946672,0.002919556,0.00060830644,0.00084585324,0.0007045101,0.00025464565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063367984,0.001693925,0.0018575107,0.0010522075,0.0010199827,0.0015527072,0.0039039426,0.0023822633,0.0021581366],"category_scores_gemma":[0.015353464,0.0008869894,0.0011719888,0.00095738156,0.0024394859,0.004057803,0.00524084,0.003944455,0.00067313795],"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.0007216073,0.00031414558,0.00391596,0.0003770087,0.00016962898,0.00029175082,0.00038480602,0.56394887,0.0053940336,0.045311037,0.009305319,0.3698658],"study_design_scores_gemma":[0.000031341,0.000051470477,0.00017011058,0.000026046258,0.000012318821,0.000030347926,0.00001667385,0.98066956,0.0027821534,0.015328617,0.0008688945,0.000012529974],"about_ca_topic_score_codex":0.0050693937,"about_ca_topic_score_gemma":0.0068296683,"teacher_disagreement_score":0.0063367984,"about_ca_system_score_codex":0.0031674465,"about_ca_system_score_gemma":0.002989392,"threshold_uncertainty_score":0.033512592},"labels":[],"label_agreement":null},{"id":"W4382203029","doi":"10.1609/aaai.v37i8.26196","title":"A Fair Generative Model Using LeCam Divergence","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Computational and Text Analysis Methods","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":"Kootenay Association for Science & Technology","funders":"Ministry of Science and ICT, South Korea; Korea Advanced Institute of Science and Technology; National Research Foundation of Korea; Institute for Information and Communications Technology Promotion; Korea Customs Service; National Research Foundation","keywords":"Benchmark (surveying); Divergence (linguistics); Measure (data warehouse); Computer science; Set (abstract data type); Range (aeronautics); Generative grammar; Sample size determination; Generative model; Statistical power; Sample (material); Machine learning; Data mining; Artificial intelligence; Statistics; Mathematics","score_opus":0.29306004426602666,"score_gpt":0.4240172083587,"score_spread":0.13095716409267333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382203029","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.015837135,0.0002263171,0.9799033,0.0007776402,0.00006272576,0.00008265702,0.00014549278,0.00019666221,0.0027679887],"genre_scores_gemma":[0.7503682,0.00047665255,0.22788529,0.0013484218,0.00023528222,0.0007976622,0.00079127366,0.00049279066,0.017604565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971444,0.0014784903,0.00008233068,0.00060141255,0.00042809715,0.0002652294],"domain_scores_gemma":[0.9886861,0.008469721,0.0006201065,0.0008902553,0.00084890204,0.00048492762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0098479865,0.0011421372,0.0018361527,0.0011903192,0.0012545252,0.0032616497,0.0038103722,0.002617518,0.005204398],"category_scores_gemma":[0.025451316,0.0008081637,0.0012924438,0.00095320743,0.0034034064,0.0036094033,0.003483979,0.0034374914,0.00085070025],"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.000076812146,0.000051632567,0.0014456047,0.00005463679,0.000044454184,0.000118492055,0.00023081816,0.7171284,0.00097604113,0.2620576,0.0025269217,0.015288654],"study_design_scores_gemma":[0.00000943363,0.000013336566,0.000081523904,0.000010965056,0.000005453511,0.00001916453,0.000011389313,0.9316923,0.00020627287,0.06742388,0.00051518105,0.000011186613],"about_ca_topic_score_codex":0.005130228,"about_ca_topic_score_gemma":0.004888413,"teacher_disagreement_score":0.0098479865,"about_ca_system_score_codex":0.0029832614,"about_ca_system_score_gemma":0.0021909622,"threshold_uncertainty_score":0.052081764},"labels":[],"label_agreement":null},{"id":"W4382203111","doi":"10.1609/aaai.v37i8.26186","title":"Fast Convergence in Learning Two-Layer Neural Networks with Separable Data","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Science Foundation","keywords":"Overfitting; Generalization; Convergence (economics); Separable space; Applied mathematics; Stability (learning theory); Mathematics; Artificial neural network; Gradient descent; Stochastic gradient descent; Exponential function; Exponential stability; Computer science; Mathematical optimization; Algorithm; Artificial intelligence; Mathematical analysis; Nonlinear system; Machine learning","score_opus":0.11363951927513236,"score_gpt":0.32079958893637917,"score_spread":0.2071600696612468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382203111","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.04574298,0.00043150043,0.951525,0.00034026962,0.000028976587,0.000038629205,0.000039928014,0.00041880427,0.0014338433],"genre_scores_gemma":[0.7271969,0.00036625375,0.2675828,0.00026131028,0.00003400374,0.00020039998,0.00020208619,0.00021220642,0.0039440463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902105,0.0004004205,0.000062515704,0.0001881658,0.00021701335,0.00011086536],"domain_scores_gemma":[0.99483997,0.0037423302,0.0002886072,0.00041477164,0.00058734603,0.00012691278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004486981,0.0011341799,0.00090171007,0.00063427084,0.00035259422,0.00077117485,0.0013520077,0.0011226417,0.0012321022],"category_scores_gemma":[0.01876759,0.0006961265,0.0005860508,0.00057952997,0.0020368872,0.0028502361,0.0023493997,0.0021878518,0.00026146887],"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.000114867194,0.00003115271,0.00083581416,0.00010185895,0.000040124858,0.000056069373,0.000106881715,0.9285754,0.0017346838,0.037004698,0.00052479707,0.030873682],"study_design_scores_gemma":[0.0000044797143,0.000016151143,0.00005032993,0.000004938935,0.0000019309484,0.000006610853,0.000004094716,0.9893022,0.0004197492,0.010088807,0.000098574776,0.0000021563646],"about_ca_topic_score_codex":0.006481566,"about_ca_topic_score_gemma":0.0046946853,"teacher_disagreement_score":0.006481566,"about_ca_system_score_codex":0.0020413927,"about_ca_system_score_gemma":0.0013719203,"threshold_uncertainty_score":0.023729682},"labels":[],"label_agreement":null},{"id":"W4382203390","doi":"10.1609/aaai.v37i8.26168","title":"Neighbor Contrastive Learning on Learnable Graph Augmentation","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Hainan University; National Natural Science Foundation of China","keywords":"Computer science; Graph; Artificial intelligence; False positive paradox; Theoretical computer science; Machine learning; Pattern recognition (psychology)","score_opus":0.06447864412558238,"score_gpt":0.29985043420944374,"score_spread":0.23537179008386136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382203390","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.03383708,0.00045689312,0.9585601,0.00032666136,0.00008191885,0.00011364958,0.00028614968,0.00445687,0.0018806778],"genre_scores_gemma":[0.5506953,0.0003635327,0.4370157,0.0009404516,0.0001790667,0.00039694773,0.002409258,0.0008162482,0.0071834093],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885416,0.00033870837,0.000033485507,0.00046397542,0.00020635658,0.0001033086],"domain_scores_gemma":[0.99725693,0.0012294693,0.00027886615,0.0007363798,0.00034711813,0.00015118491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001410386,0.001975336,0.0017305524,0.0014255091,0.0006175961,0.001013574,0.003444316,0.0019541653,0.003207454],"category_scores_gemma":[0.005597925,0.00073846546,0.0011619976,0.0011442896,0.0017186907,0.0035337396,0.002844005,0.0030973153,0.001469564],"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.0004211552,0.00040755302,0.0024176077,0.00030171327,0.00011499487,0.00027353884,0.00029986864,0.39427033,0.015983172,0.024029184,0.014085215,0.54739565],"study_design_scores_gemma":[0.00001775185,0.00006708685,0.00016711272,0.000009960146,0.00000973016,0.00005229041,0.000017214725,0.9841485,0.0026293204,0.011891729,0.0009795536,0.000009854382],"about_ca_topic_score_codex":0.0024082598,"about_ca_topic_score_gemma":0.004261024,"teacher_disagreement_score":0.003444316,"about_ca_system_score_codex":0.0012240637,"about_ca_system_score_gemma":0.0007755462,"threshold_uncertainty_score":0.010729969},"labels":[],"label_agreement":null},{"id":"W4382237408","doi":"10.1609/aaai.v37i7.26019","title":"I’m Me, We’re Us, and I’m Us: Tri-directional Contrastive Learning on Hypergraphs","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Samsung; Ministry of Science and ICT, South Korea; Korea Advanced Institute of Science and Technology","keywords":"Computer science; Contrast (vision); Generalization; Node (physics); Artificial intelligence; Representation (politics); Competitor analysis; Machine learning; Unsupervised learning; Code (set theory); Feature learning; Simple (philosophy); Natural language processing; Mathematics","score_opus":0.059133068894256034,"score_gpt":0.28863630579420063,"score_spread":0.2295032368999446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382237408","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.11659259,0.0018876411,0.87027484,0.001468291,0.0000946949,0.00013059635,0.0009572602,0.0027140095,0.0058800858],"genre_scores_gemma":[0.69383144,0.00059980847,0.2947019,0.0012119071,0.00015442223,0.00020637037,0.0032815882,0.00053482124,0.005477802],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784327,0.001175877,0.0000583238,0.00059802795,0.00021935879,0.00010518437],"domain_scores_gemma":[0.99306583,0.0038009456,0.0005761705,0.0015325401,0.0006793184,0.0003451621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002892417,0.0009777579,0.0007441484,0.0016663475,0.00081607216,0.0015524937,0.0018405425,0.0017028328,0.0022360852],"category_scores_gemma":[0.010168083,0.00053148536,0.0008902305,0.0014914562,0.0020018837,0.0043956907,0.0024038842,0.0033555352,0.0010657152],"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.0011045525,0.000385342,0.016480342,0.0005698685,0.0002993814,0.00047882274,0.0013555296,0.25020358,0.013996843,0.08732248,0.023076652,0.60472655],"study_design_scores_gemma":[0.000051022485,0.000118336146,0.0014541603,0.00006149647,0.000039506762,0.00019771345,0.00013368855,0.8799828,0.004181957,0.107824095,0.005921592,0.00003357481],"about_ca_topic_score_codex":0.0034129235,"about_ca_topic_score_gemma":0.0059075872,"teacher_disagreement_score":0.0034129235,"about_ca_system_score_codex":0.0014963071,"about_ca_system_score_gemma":0.00073050894,"threshold_uncertainty_score":0.015296757},"labels":[],"label_agreement":null},{"id":"W4382237530","doi":"10.1609/aaai.v37i7.26004","title":"A Gift from Label Smoothing: Robust Training with Adaptive Label Smoothing via Auxiliary Classifier under Label Noise","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Data Classification","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":"Kootenay Association for Science & Technology","funders":"Defense Acquisition Program Administration; Agency for Defense Development","keywords":"Computer science; Smoothing; Artificial intelligence; Overfitting; Regularization (linguistics); Robustness (evolution); Lipschitz continuity; Machine learning; Classifier (UML); Extractor; Pattern recognition (psychology); Computation; Trimming; Artificial neural network; Algorithm; Mathematics; Computer vision; Engineering","score_opus":0.18662960904574635,"score_gpt":0.309557591752239,"score_spread":0.12292798270649266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382237530","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.0076315487,0.00015423541,0.9896282,0.00027903265,0.000057685964,0.00003927248,0.000052561354,0.0016652421,0.0004922374],"genre_scores_gemma":[0.20562065,0.00029133027,0.78643215,0.0010322317,0.00025843966,0.00025312504,0.0007088392,0.0007439347,0.00465934],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975896,0.00073081075,0.00010468435,0.00072051707,0.00067782786,0.00017653771],"domain_scores_gemma":[0.99316484,0.0023950692,0.0005149697,0.0025558202,0.0010429146,0.00032636462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004546608,0.0016131495,0.0020979242,0.0012357726,0.0010077093,0.0017888859,0.0030094648,0.0033095698,0.0021359294],"category_scores_gemma":[0.01443987,0.0007447351,0.0015269332,0.0013397429,0.0023253507,0.0036563931,0.0034464544,0.004922473,0.0017343608],"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.0010812059,0.00040191505,0.003969096,0.00024103784,0.00023204603,0.00030239436,0.00047733006,0.3159873,0.046995983,0.047637466,0.018111952,0.5645623],"study_design_scores_gemma":[0.000036638743,0.00006482378,0.00021070152,0.000015391095,0.000020188503,0.000059385373,0.000016611217,0.9741269,0.0073245177,0.015940696,0.0021604642,0.00002362554],"about_ca_topic_score_codex":0.0032245861,"about_ca_topic_score_gemma":0.00451033,"teacher_disagreement_score":0.004546608,"about_ca_system_score_codex":0.0011188063,"about_ca_system_score_gemma":0.0024170175,"threshold_uncertainty_score":0.02404505},"labels":[],"label_agreement":null},{"id":"W4382239166","doi":"10.1609/aaai.v37i6.25920","title":"Optimal Decision Diagrams for Classification","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Compute Canada","keywords":"Odds; Computer science; Perspective (graphical); Decision tree; Influence diagram; Integer programming; Stability (learning theory); Context (archaeology); Linear programming; Machine learning; Mathematical optimization; Artificial intelligence; Algorithm; Mathematics","score_opus":0.14460793450471177,"score_gpt":0.34340750509157486,"score_spread":0.1987995705868631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382239166","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.0054637506,0.00052882405,0.9914767,0.00039413112,0.000043236232,0.000056970246,0.00016915503,0.0001562545,0.0017109732],"genre_scores_gemma":[0.30525023,0.0010712229,0.68861175,0.00034774185,0.00018477511,0.0005506778,0.00087238103,0.0002003377,0.0029108045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99219793,0.00450002,0.00049313327,0.0011902757,0.0012807607,0.00033791535],"domain_scores_gemma":[0.9731309,0.022800881,0.0011294386,0.0010512352,0.0014339149,0.00045361227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006623181,0.0011816904,0.0014175093,0.0020087385,0.0007576383,0.0030129964,0.0014715357,0.0016972368,0.005955268],"category_scores_gemma":[0.03652141,0.00073431566,0.0013910745,0.0017550129,0.001689462,0.0041316934,0.0019745005,0.0037036794,0.00096172903],"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.00016390035,0.00009193648,0.0016078773,0.00031263696,0.000062798514,0.00006702461,0.00021837515,0.42219684,0.0007990479,0.46708468,0.0035871344,0.10380775],"study_design_scores_gemma":[0.000016879074,0.000032919757,0.00011136324,0.000044279364,0.0000113097585,0.000027200262,0.000020189531,0.67798924,0.0004032548,0.3178746,0.003457121,0.0000115849425],"about_ca_topic_score_codex":0.0022307893,"about_ca_topic_score_gemma":0.0025180792,"teacher_disagreement_score":0.006623181,"about_ca_system_score_codex":0.0025739842,"about_ca_system_score_gemma":0.002011637,"threshold_uncertainty_score":0.035027146},"labels":[],"label_agreement":null},{"id":"W4382239171","doi":"10.1609/aaai.v37i6.25941","title":"Interpolating Graph Pair to Regularize Graph Classification","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":14,"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 Ottawa","funders":"","keywords":"Computer science; Artificial intelligence; Theoretical computer science; Graph; Leverage (statistics); Algorithm; Pattern recognition (psychology); Machine learning","score_opus":0.10427452839819401,"score_gpt":0.3131700700418429,"score_spread":0.20889554164364887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382239171","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.034371898,0.000120771234,0.96260625,0.00021270086,0.000044377597,0.000048988004,0.000090460904,0.0014162036,0.0010884131],"genre_scores_gemma":[0.50851715,0.00017398738,0.48571458,0.0003194751,0.00007722425,0.00020434553,0.0006379246,0.00044563308,0.003909685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993611,0.00018896458,0.000023662948,0.00020904168,0.00015489671,0.00006227641],"domain_scores_gemma":[0.99843043,0.000597916,0.00018838896,0.00052122155,0.00016843298,0.000093593684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010971961,0.0011419061,0.0008791919,0.0010152691,0.0005193316,0.00073455676,0.0017917388,0.0013794572,0.0024162703],"category_scores_gemma":[0.0047657546,0.0005412413,0.00096182985,0.0010362205,0.0013891284,0.0023152782,0.0020091217,0.0022935716,0.0008358716],"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.00028918416,0.00022212224,0.0028729392,0.00019641664,0.000112623304,0.00013423595,0.00021954656,0.665026,0.029060764,0.048914686,0.004847833,0.24810363],"study_design_scores_gemma":[0.0000079342735,0.00004312085,0.00014658872,0.0000054569705,0.000007930726,0.000029086123,0.000012306904,0.98138547,0.004030612,0.01323507,0.0010891742,0.0000073518586],"about_ca_topic_score_codex":0.0014854613,"about_ca_topic_score_gemma":0.00252759,"teacher_disagreement_score":0.0024162703,"about_ca_system_score_codex":0.00075436936,"about_ca_system_score_gemma":0.0006352887,"threshold_uncertainty_score":0.008083284},"labels":[],"label_agreement":null},{"id":"W4382239200","doi":"10.1609/aaai.v37i6.25834","title":"Normalizing Flow Ensembles for Rich Aleatoric and Epistemic Uncertainty Modeling","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Uncertainty quantification; Computer science; Measurement uncertainty; Benchmark (surveying); Robustness (evolution); Artificial intelligence; Machine learning; Mathematics; Statistics","score_opus":0.09900523982385097,"score_gpt":0.30629800525944373,"score_spread":0.20729276543559277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382239200","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.014373725,0.000102904596,0.98409677,0.0001178497,0.000026546835,0.000022761697,0.00007429059,0.00041807335,0.0007671929],"genre_scores_gemma":[0.66706103,0.00029168715,0.3289682,0.00026375285,0.00015603498,0.00019837025,0.0007264786,0.00039516564,0.0019393187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909854,0.00031407832,0.000043371027,0.00021875906,0.0002432712,0.00008194707],"domain_scores_gemma":[0.99635786,0.0021314444,0.0003615294,0.00054857525,0.0004631101,0.0001374731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034984446,0.0015286934,0.001044883,0.0015924005,0.0008610008,0.0015726965,0.0014617237,0.0013363067,0.0013326324],"category_scores_gemma":[0.012603901,0.000626304,0.0010765232,0.0007183309,0.0013769751,0.003524061,0.0023587348,0.002653562,0.00028901233],"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.00004628866,0.000034346558,0.0017737481,0.000035073987,0.000053604505,0.00004102329,0.00009095731,0.9253731,0.0014828427,0.021456633,0.00071768597,0.04889471],"study_design_scores_gemma":[0.0000018976848,0.000008478821,0.00013074913,0.0000067834185,0.0000042557044,0.000010348657,0.0000060195553,0.9859737,0.00058664265,0.012883763,0.00038047772,0.0000068500194],"about_ca_topic_score_codex":0.00506021,"about_ca_topic_score_gemma":0.0058159963,"teacher_disagreement_score":0.00506021,"about_ca_system_score_codex":0.0012139995,"about_ca_system_score_gemma":0.0012847284,"threshold_uncertainty_score":0.018501818},"labels":[],"label_agreement":null},{"id":"W4382239271","doi":"10.1609/aaai.v37i6.25864","title":"The Sufficiency of Off-Policyness and Soft Clipping: PPO Is Still Insufficient according to an Off-Policy Measure","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Alberta Machine Intelligence Institute","keywords":"Clipping (morphology); Computer science; Space (punctuation); Metric (unit); Measure (data warehouse); Mathematical optimization; Sigmoid function; Code (set theory); Function (biology); Algorithm; Mathematics; Data mining; Artificial intelligence; Economics; Operations management; Programming language","score_opus":0.1051787284617897,"score_gpt":0.34265991363007636,"score_spread":0.23748118516828665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382239271","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.07217481,0.0010469449,0.9125005,0.002105315,0.00023782584,0.00015791315,0.00017394352,0.00086931087,0.0107334405],"genre_scores_gemma":[0.85290474,0.00049504347,0.13966514,0.0012918502,0.00020427868,0.00030816198,0.00030724143,0.00047709674,0.004346514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965593,0.0011708566,0.00025707323,0.00068320084,0.00090241275,0.0004271451],"domain_scores_gemma":[0.9769598,0.017572047,0.0011924908,0.0018195291,0.0014387197,0.0010174839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006092813,0.0014090316,0.0025301618,0.0007949966,0.0009953713,0.0025316651,0.0019292387,0.002744474,0.0037007385],"category_scores_gemma":[0.042211458,0.00074774894,0.0007523607,0.0006247009,0.0030511837,0.0043464494,0.0033548705,0.0046407185,0.0005215592],"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.0008140879,0.00040611826,0.0059023225,0.00078968547,0.00020265854,0.000560746,0.0005362919,0.7064517,0.0059812544,0.1321394,0.009447197,0.13676849],"study_design_scores_gemma":[0.000043722885,0.00024230462,0.00062428496,0.00010575093,0.000024237246,0.00016403565,0.0000641161,0.94264275,0.002341168,0.05200065,0.0017196496,0.000027243601],"about_ca_topic_score_codex":0.002211566,"about_ca_topic_score_gemma":0.0012906644,"teacher_disagreement_score":0.006092813,"about_ca_system_score_codex":0.0011980325,"about_ca_system_score_gemma":0.0030357665,"threshold_uncertainty_score":0.03222227},"labels":[],"label_agreement":null},{"id":"W4382239398","doi":"10.1609/aaai.v37i5.25713","title":"Partitioning Friends Fairly","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Core (optical fiber); Axiom; Group (periodic table); Mathematical economics; Computer science; Mathematics","score_opus":0.15226759351797622,"score_gpt":0.281829402677441,"score_spread":0.12956180915946477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382239398","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.23793517,0.001409797,0.66919595,0.004957297,0.0003606233,0.000935458,0.0019773978,0.0016256389,0.08160272],"genre_scores_gemma":[0.82003003,0.0005867628,0.13771847,0.0005769447,0.00017449615,0.00035410986,0.0019773731,0.0004931508,0.038088713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964721,0.001214418,0.00012465869,0.0012657773,0.00050130254,0.00042184727],"domain_scores_gemma":[0.9938573,0.0026319127,0.00039289484,0.002056985,0.0004375024,0.00062342297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024878853,0.0008805882,0.0015527797,0.00114124,0.004769995,0.0030364795,0.0032751954,0.0023898862,0.031685937],"category_scores_gemma":[0.014236184,0.0007803359,0.0010830505,0.00220285,0.0016350253,0.010105062,0.0040526805,0.001291981,0.0042344313],"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.0012771741,0.00035021963,0.0048492546,0.00052402826,0.00032444915,0.00089609716,0.0029884793,0.15747307,0.0036903166,0.55864114,0.054886855,0.21409893],"study_design_scores_gemma":[0.00023745785,0.0001651234,0.0016547929,0.00008794495,0.00019477113,0.00070014276,0.002189447,0.35748684,0.005096448,0.5350104,0.09711086,0.00006574397],"about_ca_topic_score_codex":0.00492195,"about_ca_topic_score_gemma":0.008266523,"teacher_disagreement_score":0.031685937,"about_ca_system_score_codex":0.0019630129,"about_ca_system_score_gemma":0.0013693405,"threshold_uncertainty_score":0.106000066},"labels":[],"label_agreement":null},{"id":"W4382239476","doi":"10.1609/aaai.v37i6.25886","title":"Opposite Online Learning via Sequentially Integrated Stochastic Gradient Descent Estimators","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China; Jinan Science and Technology Bureau","keywords":"Stochastic gradient descent; Estimator; Statistic; Computer science; Test statistic; Inference; Statistical hypothesis testing; Gradient descent; Construct (python library); Constant (computer programming); Artificial intelligence; Statistical inference; Machine learning; Mathematical optimization; Mathematics; Statistics; Artificial neural network","score_opus":0.241087663382757,"score_gpt":0.4270665249868488,"score_spread":0.18597886160409177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382239476","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.009351777,0.00009891339,0.98949265,0.00012543357,0.0000298235,0.000045700614,0.000020656342,0.00025766005,0.0005773291],"genre_scores_gemma":[0.49381995,0.00022535284,0.50160223,0.0004005214,0.00017284944,0.00036797687,0.00029341225,0.00016953194,0.002948252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99589694,0.0019420859,0.00022080842,0.00076766027,0.0009076551,0.00026495947],"domain_scores_gemma":[0.99043864,0.0065336376,0.00078701996,0.000824872,0.0010892315,0.00032661582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056413896,0.0011079632,0.002119473,0.0009315206,0.0005369943,0.0014234979,0.0022867043,0.0014790229,0.0015201654],"category_scores_gemma":[0.022315381,0.00077842345,0.0008086821,0.0008772229,0.0020751583,0.0020846268,0.002051909,0.0021312758,0.00049109466],"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.0005660324,0.0003286145,0.0064324415,0.00025707492,0.00021504084,0.00023428412,0.00019338471,0.58660513,0.0051587485,0.09241804,0.0029515966,0.30463952],"study_design_scores_gemma":[0.000028953418,0.00005341671,0.00017493397,0.0000058592323,0.000010160814,0.000028222656,0.0000049050823,0.98976094,0.00080559,0.008811607,0.0003064994,0.000008851009],"about_ca_topic_score_codex":0.0024549214,"about_ca_topic_score_gemma":0.0021263508,"teacher_disagreement_score":0.0056413896,"about_ca_system_score_codex":0.0009935338,"about_ca_system_score_gemma":0.0024236597,"threshold_uncertainty_score":0.029834867},"labels":[],"label_agreement":null},{"id":"W4382239580","doi":"10.1609/aaai.v37i5.25704","title":"Class Fairness in Online Matching","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Precursory Research for Embryonic Science and Technology; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Minimax; AKA; Matching (statistics); Bipartite graph; Class (philosophy); Mathematics; Set (abstract data type); Upper and lower bounds; Combinatorics; Computer science; Discrete mathematics; Mathematical economics; Artificial intelligence; Statistics; Graph","score_opus":0.14182090050570234,"score_gpt":0.29490744411552744,"score_spread":0.1530865436098251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382239580","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.061990406,0.00036384456,0.92876834,0.0006883906,0.00011473547,0.00015269895,0.0002055565,0.00038865663,0.0073273587],"genre_scores_gemma":[0.80357754,0.00028952095,0.18927324,0.0003163906,0.00024567763,0.00020417973,0.00022310208,0.00017140123,0.005698883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925599,0.002822297,0.00028819055,0.0018736606,0.0013354053,0.0011205368],"domain_scores_gemma":[0.9770808,0.01446274,0.0013686179,0.0046243025,0.0013751747,0.0010883758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008030088,0.0009315436,0.0019905525,0.001136779,0.0022692052,0.0031678805,0.0042177783,0.0017738609,0.0062454008],"category_scores_gemma":[0.033231713,0.00050827087,0.0011785142,0.0018936791,0.0025429924,0.009068718,0.003424969,0.0026161228,0.0006996641],"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.001130929,0.0004040079,0.0034491897,0.00028001014,0.000118605705,0.00012578892,0.0006466966,0.30174148,0.0044297283,0.551651,0.0049137995,0.13110878],"study_design_scores_gemma":[0.00007434612,0.00012797436,0.0004301156,0.00002228808,0.000030980373,0.00009484325,0.00009065866,0.62922364,0.0026073128,0.36284867,0.004427128,0.000021945214],"about_ca_topic_score_codex":0.0028640206,"about_ca_topic_score_gemma":0.002064733,"teacher_disagreement_score":0.008030088,"about_ca_system_score_codex":0.0035360977,"about_ca_system_score_gemma":0.0029186031,"threshold_uncertainty_score":0.042467654},"labels":[],"label_agreement":null},{"id":"W4382239581","doi":"10.1609/aaai.v37i4.25527","title":"Graphs, Constraints, and Search for the Abstraction and Reasoning Corpus","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","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; Theoretical computer science; Artificial intelligence; Graph; Beam search; Machine learning; Search algorithm; Programming language","score_opus":0.11763710036881757,"score_gpt":0.32067466856801335,"score_spread":0.20303756819919577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382239581","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.06371859,0.0008383889,0.9167995,0.002259314,0.000071194576,0.00035351358,0.0018349718,0.006127964,0.007996583],"genre_scores_gemma":[0.2552053,0.00041493977,0.73705095,0.00036190965,0.000026217349,0.00026003638,0.0037106688,0.0008476023,0.0021224776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99670464,0.0016145111,0.00016763636,0.00063396664,0.0007236386,0.00015567982],"domain_scores_gemma":[0.9906887,0.006287751,0.0004790243,0.0018458955,0.00048177224,0.00021693794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032824886,0.00095560396,0.00089241285,0.0018911095,0.0013012926,0.0032104235,0.0023706553,0.0018733452,0.006751785],"category_scores_gemma":[0.018292377,0.0008312973,0.001496776,0.0028143027,0.0033164786,0.009216117,0.0031764235,0.00364196,0.0010776109],"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.0005172952,0.00028006203,0.0027373894,0.0010741886,0.00012316756,0.00039841942,0.0012575053,0.23032235,0.0074664797,0.43961838,0.024728091,0.2914768],"study_design_scores_gemma":[0.000096874675,0.00009016951,0.00057091477,0.000091378075,0.00004320538,0.00014631392,0.00044955005,0.52343374,0.007652839,0.44447187,0.022905113,0.0000480185],"about_ca_topic_score_codex":0.007037593,"about_ca_topic_score_gemma":0.009937043,"teacher_disagreement_score":0.007037593,"about_ca_system_score_codex":0.001992779,"about_ca_system_score_gemma":0.0030976406,"threshold_uncertainty_score":0.022586942},"labels":[],"label_agreement":null},{"id":"W4382239594","doi":"10.1609/aaai.v37i6.25857","title":"Scalable and Globally Optimal Generalized L₁ K-center Clustering via Constraint Generation in Mixed Integer Linear Programming","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"University of Toronto","funders":"","keywords":"Cluster analysis; Computer science; Benchmark (surveying); Integer programming; Scalability; Linear programming; Automatic summarization; Mathematical optimization; Outlier; CURE data clustering algorithm; Correlation clustering; Algorithm; Data mining; Mathematics; Artificial intelligence; Database","score_opus":0.0907548475982762,"score_gpt":0.28658786339137116,"score_spread":0.19583301579309495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382239594","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.007829816,0.00019842427,0.98886126,0.0002752054,0.000035122906,0.00008143836,0.00010829052,0.0005894685,0.0020209136],"genre_scores_gemma":[0.17922813,0.00022447886,0.81673115,0.0003196154,0.0000657763,0.0003812621,0.00060905615,0.0003605707,0.0020799567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866474,0.0005050569,0.000058746544,0.00035457636,0.00027346675,0.00014350135],"domain_scores_gemma":[0.9973941,0.0016567665,0.00025651263,0.00019615957,0.00039566337,0.000100792546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020044271,0.001827201,0.0017046073,0.0007589712,0.000854745,0.0017108276,0.0020345973,0.0014992144,0.002383985],"category_scores_gemma":[0.005803723,0.0009332676,0.0010391605,0.0016084351,0.0011197813,0.0016043733,0.002093652,0.0025383823,0.0008320937],"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.000057326622,0.000039594674,0.00034353946,0.000086666754,0.000028884055,0.00006102462,0.000057975874,0.9524358,0.0007008425,0.009892808,0.0031353482,0.033160184],"study_design_scores_gemma":[0.000009761628,0.0000109730845,0.000025748233,0.0000052933083,0.0000028122954,0.0000071902737,0.000012801459,0.994023,0.00026971605,0.005232486,0.0003965388,0.0000037453544],"about_ca_topic_score_codex":0.007834629,"about_ca_topic_score_gemma":0.009283425,"teacher_disagreement_score":0.007834629,"about_ca_system_score_codex":0.0013551925,"about_ca_system_score_gemma":0.0025018572,"threshold_uncertainty_score":0.015578091},"labels":[],"label_agreement":null},{"id":"W4382239691","doi":"10.1609/aaai.v37i4.25643","title":"Heterogeneous Graph Learning for Multi-Modal Medical Data Analysis","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI in cancer detection","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":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; National Research Foundation of Korea; National Research Foundation","keywords":"Computer science; Modal; Modalities; Graph; Medical diagnosis; Fuse (electrical); Artificial intelligence; Data mining; Machine learning; Theoretical computer science; Medicine","score_opus":0.21205819958701175,"score_gpt":0.37601068456775266,"score_spread":0.16395248498074091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382239691","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.004941615,0.000509093,0.9927071,0.0003912861,0.00002283193,0.0000498466,0.00031713131,0.0006460332,0.00041509335],"genre_scores_gemma":[0.34790787,0.001284152,0.64382243,0.00072993006,0.00019921844,0.00032216575,0.003336652,0.00034745937,0.0020500878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846834,0.0005910377,0.00006246896,0.00048163286,0.00029876828,0.00009769845],"domain_scores_gemma":[0.99732083,0.0014862834,0.00031855115,0.00042900344,0.00028430048,0.00016110245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022407337,0.0013699685,0.0012586568,0.0045790668,0.00082641625,0.001247814,0.0023006925,0.0016381168,0.001948646],"category_scores_gemma":[0.0064742835,0.00074461306,0.0018842708,0.0033767072,0.0012990215,0.0022920596,0.0024075096,0.0022882158,0.00060503505],"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.00016474884,0.00019114245,0.004357599,0.00036473392,0.00041806445,0.00032308875,0.00027779068,0.6065902,0.005847378,0.042076074,0.009167421,0.33022177],"study_design_scores_gemma":[0.00000737674,0.000015201794,0.0003353302,0.000011786424,0.00002264646,0.00004187131,0.000027772703,0.9466908,0.0006453776,0.05086003,0.0013300553,0.000011786986],"about_ca_topic_score_codex":0.00855818,"about_ca_topic_score_gemma":0.013939067,"teacher_disagreement_score":0.00855818,"about_ca_system_score_codex":0.0020410488,"about_ca_system_score_gemma":0.0013675953,"threshold_uncertainty_score":0.017016768},"labels":[],"label_agreement":null},{"id":"W4382239700","doi":"10.1609/aaai.v37i6.25825","title":"PiCor: Multi-Task Deep Reinforcement Learning with Policy Correction","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","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 Alberta","funders":"","keywords":"Reinforcement learning; Task (project management); Computer science; Constraint (computer-aided design); Set (abstract data type); Artificial intelligence; Interference (communication); Machine learning; Channel (broadcasting); Mathematics; Engineering","score_opus":0.06260084640833517,"score_gpt":0.2989850664917558,"score_spread":0.23638422008342064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382239700","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.009938279,0.00023902832,0.98372847,0.00019358874,0.00007603156,0.000116524425,0.000059375732,0.0037682531,0.0018804754],"genre_scores_gemma":[0.6186112,0.00020518208,0.3733476,0.00062327774,0.00008507055,0.00041750973,0.0002990174,0.00045710828,0.0059539266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992281,0.00019023634,0.000038971008,0.0001879379,0.00022725659,0.0001274467],"domain_scores_gemma":[0.9989567,0.00039053013,0.00014488726,0.0002259854,0.0001668737,0.00011502459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019264293,0.0012190447,0.0013468945,0.00034398554,0.000389271,0.00076838845,0.003089683,0.0014245014,0.0027491995],"category_scores_gemma":[0.0038477767,0.00066508155,0.00056737516,0.00033077525,0.0009797805,0.0013172759,0.0019327125,0.0027292701,0.0007552951],"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.00025287102,0.00029248046,0.00088636193,0.00014307829,0.00010856945,0.00010716529,0.000053835032,0.80589086,0.0048122094,0.010408999,0.005087529,0.17195615],"study_design_scores_gemma":[0.000018288061,0.000039475966,0.000039800645,0.0000032429043,0.0000041047124,0.000009552774,0.0000015124575,0.99746144,0.00072498026,0.0012915626,0.00040126237,0.000004830844],"about_ca_topic_score_codex":0.005203695,"about_ca_topic_score_gemma":0.006875366,"teacher_disagreement_score":0.005203695,"about_ca_system_score_codex":0.0009635744,"about_ca_system_score_gemma":0.002451269,"threshold_uncertainty_score":0.01034683},"labels":[],"label_agreement":null},{"id":"W4382239711","doi":"10.1609/aaai.v37i6.25948","title":"Estimating Regression Predictive Distributions with Sample Networks","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto; Université de Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"Institut de Valorisation des Données","keywords":"Parametric statistics; Range (aeronautics); Computer science; Divergence (linguistics); Parametric model; Regression; Posterior predictive distribution; Sample (material); Statistics; Data mining; Econometrics; Artificial intelligence; Mathematics; Bayesian linear regression; Engineering","score_opus":0.05379158691958716,"score_gpt":0.3014396315167004,"score_spread":0.24764804459711323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382239711","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.033651154,0.00033783814,0.9629416,0.00037857782,0.000032813743,0.000035216093,0.00021460622,0.0015375138,0.0008706144],"genre_scores_gemma":[0.800835,0.0005378508,0.1928405,0.0004665078,0.0001551269,0.00024000279,0.0017408906,0.00047911512,0.0027050446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986935,0.00046301793,0.00005539039,0.00038307495,0.00030796468,0.00009702773],"domain_scores_gemma":[0.9923808,0.005387161,0.000543962,0.00080726424,0.00073154265,0.00014918807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033947472,0.0015171791,0.0012724246,0.0012608777,0.000501894,0.0015522017,0.002027809,0.0013432852,0.0018750171],"category_scores_gemma":[0.018774634,0.0010076646,0.0009552849,0.0010226844,0.0012578184,0.004061808,0.0018781412,0.0034121547,0.00068557076],"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.00013098824,0.000057770772,0.0030990432,0.000055864977,0.000074317926,0.000084782485,0.000079812606,0.90551394,0.00096797786,0.016709307,0.0021635108,0.071062736],"study_design_scores_gemma":[0.0000040510517,0.000006222293,0.00011698481,0.0000058676887,0.000003060657,0.000008100662,0.0000054828033,0.9867142,0.00025002784,0.01269122,0.00019102101,0.0000037332672],"about_ca_topic_score_codex":0.0058898735,"about_ca_topic_score_gemma":0.008202603,"teacher_disagreement_score":0.0058898735,"about_ca_system_score_codex":0.0015959115,"about_ca_system_score_gemma":0.0011153856,"threshold_uncertainty_score":0.017953396},"labels":[],"label_agreement":null},{"id":"W4382239735","doi":"10.1609/aaai.v37i5.25707","title":"Voting with Preference Intensities","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Voting; Preference; Aggregate (composite); Ranking (information retrieval); Distortion (music); Set (abstract data type); Welfare; Economics; Econometrics; Anti-plurality voting; Cardinal voting systems; Microeconomics; Mathematical economics; Computer science; Information retrieval; Political science; Law","score_opus":0.18775751783590278,"score_gpt":0.2621696590128404,"score_spread":0.07441214117693762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382239735","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.072741166,0.00028539347,0.90870565,0.00094591256,0.00009178926,0.00027425538,0.00033103858,0.00021399053,0.016410785],"genre_scores_gemma":[0.8056867,0.00031456904,0.186919,0.00034593887,0.00015196456,0.00042072558,0.000381176,0.00007876956,0.0057010306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9846675,0.007597271,0.0012143935,0.0023015435,0.0034273593,0.00079195015],"domain_scores_gemma":[0.9826214,0.008347073,0.0019510303,0.0046603763,0.0017600651,0.00065999763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008292209,0.00085017795,0.0017382122,0.0011158304,0.00067257776,0.0032909391,0.0023716704,0.0012721671,0.0059017013],"category_scores_gemma":[0.043398738,0.0006448618,0.0011099164,0.0019861734,0.0017796973,0.0049910047,0.0029365136,0.002546386,0.0009501323],"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.00050037616,0.00015084971,0.0054631485,0.00019759596,0.00022677792,0.0001047033,0.00049045123,0.10367965,0.0062074754,0.72698164,0.003192094,0.1528052],"study_design_scores_gemma":[0.0001330225,0.00018759449,0.00153637,0.00003684529,0.00009397018,0.00013887747,0.00013722153,0.2728895,0.0030149007,0.7150451,0.006738977,0.00004760724],"about_ca_topic_score_codex":0.00066660414,"about_ca_topic_score_gemma":0.00077218714,"teacher_disagreement_score":0.008292209,"about_ca_system_score_codex":0.0014714614,"about_ca_system_score_gemma":0.0009766904,"threshold_uncertainty_score":0.04385394},"labels":[],"label_agreement":null},{"id":"W4382239737","doi":"10.1609/aaai.v37i4.25595","title":"Structure Aware Incremental Learning with Personalized Imitation Weights for Recommender Systems","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":14,"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; Recommender system; Forgetting; Machine learning; Artificial intelligence; Imitation; Data mining","score_opus":0.0907367597237587,"score_gpt":0.3040456835329652,"score_spread":0.21330892380920646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382239737","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.08181622,0.002406886,0.908878,0.000537223,0.0001567892,0.0001894219,0.00017988763,0.0029385728,0.0028970249],"genre_scores_gemma":[0.8015294,0.00063888374,0.1939272,0.0003689511,0.00012221349,0.00021549662,0.0004588669,0.000106967374,0.0026319807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999361,0.00020766407,0.000042743166,0.0001599007,0.00016953202,0.000059224396],"domain_scores_gemma":[0.9974516,0.0015177897,0.0001492842,0.0003683431,0.0004310157,0.00008204295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015356,0.0010848674,0.0013970014,0.0007076039,0.0005253141,0.0006112637,0.0027181765,0.0013085951,0.0014038841],"category_scores_gemma":[0.007876774,0.0006523607,0.0006805135,0.0007522732,0.00064308685,0.0020660136,0.0009321114,0.00188499,0.0006644508],"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.00027125518,0.0004602125,0.0034811657,0.00023186224,0.0002110409,0.00016225046,0.0002079514,0.6342378,0.0070776707,0.004872955,0.0044025495,0.34438318],"study_design_scores_gemma":[0.000017950395,0.00006946563,0.00024306172,0.0000053743847,0.00002174827,0.000028560777,0.0000087532635,0.9959608,0.0011232792,0.0019654646,0.000546048,0.0000095976675],"about_ca_topic_score_codex":0.011884802,"about_ca_topic_score_gemma":0.018247822,"teacher_disagreement_score":0.011884802,"about_ca_system_score_codex":0.00078168744,"about_ca_system_score_gemma":0.00089819694,"threshold_uncertainty_score":0.023631275},"labels":[],"label_agreement":null},{"id":"W4382239744","doi":"10.1609/aaai.v37i4.25607","title":"Learning from the Wisdom of Crowds: Exploiting Similar Sessions for Session Search","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Information Retrieval and Search Behavior","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Session (web analytics); Computer science; Information retrieval; Ranking (information retrieval); Search engine; Task (project management); Nearest neighbor search; The Internet; World Wide Web; Data mining","score_opus":0.18866038893056497,"score_gpt":0.3514729421803055,"score_spread":0.16281255324974053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382239744","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.3699495,0.009339725,0.59910583,0.0028860916,0.00048355505,0.00056130555,0.0023588988,0.0031841518,0.012130942],"genre_scores_gemma":[0.9533575,0.00087646785,0.040074565,0.00042635537,0.00036270474,0.00013651655,0.0012413241,0.000111906316,0.003412743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983973,0.0005529905,0.000091327915,0.00047605246,0.0003155277,0.00016680156],"domain_scores_gemma":[0.9955243,0.0026170788,0.00045525655,0.0006431974,0.0004609389,0.00029929777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029387006,0.0013198402,0.0022723954,0.0036337054,0.001245593,0.0015852359,0.0028083124,0.0018245121,0.0015258524],"category_scores_gemma":[0.009965648,0.00057000783,0.001865417,0.003338244,0.0010126194,0.0044811843,0.0018352738,0.0018429883,0.0006918365],"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.0012860834,0.00097472896,0.04577449,0.00063394924,0.00093954423,0.0006954488,0.0017006735,0.51012355,0.0044229724,0.029938806,0.022515353,0.3809944],"study_design_scores_gemma":[0.000035403657,0.0000937098,0.0021892053,0.000021100608,0.00007750093,0.00009700894,0.00008555605,0.96552634,0.00033371273,0.029430011,0.0020800645,0.000030340629],"about_ca_topic_score_codex":0.022517547,"about_ca_topic_score_gemma":0.025244037,"teacher_disagreement_score":0.022517547,"about_ca_system_score_codex":0.0017855495,"about_ca_system_score_gemma":0.00171968,"threshold_uncertainty_score":0.044772983},"labels":[],"label_agreement":null},{"id":"W4382239954","doi":"10.1609/aaai.v37i5.25757","title":"Better Peer Grading through Bayesian Inference","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley; Alberta Machine Intelligence Institute; Compute Canada; Defense Advanced Research Projects Agency; University of British Columbia; Canadian Institute for Advanced Research","keywords":"Grading (engineering); Computer science; Inference; Interpretability; Rubric; Robustness (evolution); Machine learning; Bayesian probability; Probabilistic logic; Bayesian inference; Artificial intelligence; Mathematics; Mathematics education","score_opus":0.07531137878603723,"score_gpt":0.3286441539662129,"score_spread":0.25333277518017566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382239954","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.07000143,0.0004583084,0.9177708,0.0016592502,0.00011826944,0.00018581976,0.00035913775,0.0024932192,0.00695367],"genre_scores_gemma":[0.7929531,0.0002443527,0.20019515,0.00034583022,0.00016391787,0.0001625824,0.0005341604,0.00030137354,0.005099591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9860292,0.007815825,0.00061850494,0.0021637534,0.00292386,0.00044883275],"domain_scores_gemma":[0.97069585,0.017608764,0.0024762952,0.0045156614,0.004167813,0.00053553615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016340489,0.0011189326,0.0019114371,0.0024728396,0.0013065595,0.0041951463,0.0024029491,0.001909368,0.003969164],"category_scores_gemma":[0.07992797,0.0007547569,0.0008858821,0.0018281578,0.00090447906,0.0063576126,0.0025857855,0.0028331508,0.0016199943],"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.00039749025,0.00047136805,0.017276846,0.00021678845,0.00032792083,0.00016599616,0.0013155852,0.5361344,0.0024785008,0.060130216,0.011541665,0.36954316],"study_design_scores_gemma":[0.000036032776,0.00004392243,0.0017604588,0.000019757612,0.00003076083,0.000026346484,0.00008436505,0.94409096,0.0009885399,0.05059536,0.0022885173,0.000035100333],"about_ca_topic_score_codex":0.012775908,"about_ca_topic_score_gemma":0.012688613,"teacher_disagreement_score":0.016340489,"about_ca_system_score_codex":0.0022543676,"about_ca_system_score_gemma":0.00209155,"threshold_uncertainty_score":0.086417854},"labels":[],"label_agreement":null},{"id":"W4382239995","doi":"10.1609/aaai.v37i4.25636","title":"MSDC: Exploiting Multi-State Power Consumption in Non-intrusive Load Monitoring Based on a Dual-CNN Model","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Smart Grid Energy Management","field":"Engineering","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":"123 Certification (Canada)","funders":"National Natural Science Foundation of China","keywords":"Conditional random field; Computer science; Dual (grammatical number); State (computer science); Generalization; Power consumption; Artificial intelligence; Power (physics); Machine learning; Algorithm; Mathematics","score_opus":0.08998531909022335,"score_gpt":0.2933630415716923,"score_spread":0.20337772248146896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382239995","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.16331312,0.0014628237,0.81991553,0.00081368256,0.00020309577,0.000076422475,0.0011713034,0.004792731,0.008251243],"genre_scores_gemma":[0.9323702,0.00034074148,0.0570918,0.00029740104,0.00005158665,0.000063154854,0.0013588608,0.00009029379,0.008335984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998983,0.000010619389,0.0000037937718,0.000045277142,0.000020514786,0.000021480928],"domain_scores_gemma":[0.9998783,0.00003792761,0.000016647351,0.000023421653,0.00003329237,0.000010444416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002633937,0.0008389845,0.0004584477,0.00036058764,0.00015899497,0.00044940796,0.0012098075,0.0005018983,0.0013844406],"category_scores_gemma":[0.0005811764,0.00036755542,0.00042136377,0.00037285697,0.0002723729,0.0009027481,0.000540508,0.0009547045,0.00035923335],"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.00024142404,0.00016199543,0.004082525,0.00007475538,0.00010810091,0.00016460895,0.00004726734,0.7521385,0.009771871,0.004592068,0.0059885406,0.22262836],"study_design_scores_gemma":[0.0000019973857,0.000006766329,0.00017973602,0.0000017922473,0.0000046679143,0.0000072171592,0.0000013028783,0.9984365,0.0006667077,0.0005012182,0.00019019842,0.0000017983888],"about_ca_topic_score_codex":0.01311674,"about_ca_topic_score_gemma":0.021113763,"teacher_disagreement_score":0.01311674,"about_ca_system_score_codex":0.0007482725,"about_ca_system_score_gemma":0.0006210074,"threshold_uncertainty_score":0.026080787},"labels":[],"label_agreement":null},{"id":"W4382240030","doi":"10.1609/aaai.v37i4.25538","title":"Learning Representations of Bi-level Knowledge Graphs for Reasoning beyond Link Prediction","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea","keywords":"Link (geometry); Computer science; Artificial intelligence; Computer network","score_opus":0.1040917765387271,"score_gpt":0.33803667578493823,"score_spread":0.23394489924621115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382240030","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.042441662,0.0014518778,0.9444051,0.00087821815,0.00014313989,0.00014452722,0.0035200156,0.0049340893,0.0020815],"genre_scores_gemma":[0.6753044,0.0012769562,0.30381572,0.00065737835,0.00013454951,0.00026542076,0.015111411,0.00029238698,0.003141734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988613,0.00021603586,0.000071919334,0.0005493443,0.00022811058,0.00007320742],"domain_scores_gemma":[0.9968579,0.0015401507,0.00037820055,0.0008688767,0.00021591346,0.00013885477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092937826,0.0018958767,0.0010928758,0.0032164245,0.0005070512,0.0016697152,0.0027700132,0.0021119034,0.0032800196],"category_scores_gemma":[0.007074141,0.00067910826,0.0017909867,0.0035042579,0.00079800334,0.0075946734,0.0026549213,0.0039472585,0.0012635527],"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.00041468386,0.00057243294,0.007941531,0.00069476495,0.00041808616,0.000668168,0.000488494,0.345814,0.006613986,0.038160842,0.022462385,0.5757506],"study_design_scores_gemma":[0.000021361035,0.000053311374,0.0009499046,0.00005142506,0.000068451205,0.00011410171,0.00008449694,0.914254,0.0015090578,0.07915512,0.0037126697,0.000026070298],"about_ca_topic_score_codex":0.007526216,"about_ca_topic_score_gemma":0.01192371,"teacher_disagreement_score":0.007526216,"about_ca_system_score_codex":0.0013741389,"about_ca_system_score_gemma":0.0009289631,"threshold_uncertainty_score":0.014964819},"labels":[],"label_agreement":null},{"id":"W4382240086","doi":"10.1609/aaai.v37i4.25565","title":"Signed Laplacian Graph Neural Networks","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; HEC Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"Samsung; Natural Sciences and Engineering Research Council of Canada; Institut de Valorisation des Données; China Scholarship Council; Tencent; Microsoft Research; National Natural Science Foundation of China; Canadian Institute for Advanced Research; People's Government of Jilin Province","keywords":"Computer science; Signed graph; Theoretical computer science; Graph; Spectral graph theory; Laplacian matrix; Laplace operator; Line graph; Voltage graph; Algorithm; Mathematics","score_opus":0.060660420897220214,"score_gpt":0.2864185040554346,"score_spread":0.2257580831582144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382240086","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.031429842,0.0004748315,0.96280026,0.0004619336,0.00012262835,0.000040680676,0.00017675229,0.00056653615,0.003926602],"genre_scores_gemma":[0.8169652,0.0009540861,0.17131984,0.00050388044,0.00013904122,0.0001188871,0.00072388205,0.0001574405,0.009117616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956113,0.00013295152,0.0000211188,0.00010453234,0.00013713377,0.00004310935],"domain_scores_gemma":[0.99892175,0.0005090527,0.00016448162,0.00012489557,0.0002326233,0.000047291895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069206266,0.00071177486,0.00055335823,0.0009885291,0.000285992,0.00096082786,0.0014667761,0.0010469905,0.0023582939],"category_scores_gemma":[0.0052731787,0.00025156667,0.00046980046,0.0009384396,0.00080187724,0.0025140666,0.0009008925,0.0011984103,0.0005794391],"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.00009741208,0.00007437625,0.0010844776,0.00016628705,0.00005350136,0.00010386941,0.00010630481,0.67303795,0.006310861,0.09893529,0.0047187125,0.21531096],"study_design_scores_gemma":[0.000002968662,0.000012837072,0.00009417099,0.0000049261284,0.000004003616,0.000017185683,0.0000075459925,0.97139376,0.00055997644,0.02734482,0.0005522522,0.000005623182],"about_ca_topic_score_codex":0.0020674565,"about_ca_topic_score_gemma":0.0028223149,"teacher_disagreement_score":0.0023582939,"about_ca_system_score_codex":0.0008075879,"about_ca_system_score_gemma":0.000547304,"threshold_uncertainty_score":0.007889271},"labels":[],"label_agreement":null},{"id":"W4382240129","doi":"10.1609/aaai.v37i3.25407","title":"Class Overwhelms: Mutual Conditional Blended-Target Domain Adaptation","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Categorical variable; Discriminator; Mutual information; Pattern recognition (psychology); Conditional probability distribution; Computer science; Artificial intelligence; Classifier (UML); Domain (mathematical analysis); Feature (linguistics); Mathematics; Machine learning; Statistics","score_opus":0.08402993613928378,"score_gpt":0.2946167539703175,"score_spread":0.21058681783103372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382240129","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.040171638,0.00043239177,0.95356506,0.00022439496,0.00009507363,0.000058608806,0.00016751075,0.0028581845,0.0024271745],"genre_scores_gemma":[0.75000274,0.00021417771,0.24076767,0.00069595914,0.00011023956,0.00017490346,0.0010117535,0.0004722506,0.006550366],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987978,0.00033804192,0.000042247288,0.00043524825,0.00027740805,0.0001092668],"domain_scores_gemma":[0.99861205,0.00045779382,0.000109017834,0.00042896526,0.0002912148,0.00010098688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013165365,0.0009262806,0.0009847883,0.0007107276,0.0005450755,0.0009863648,0.0021061,0.0011374626,0.002267677],"category_scores_gemma":[0.0038203457,0.00039686318,0.00090548623,0.0008496301,0.00084425975,0.0023426064,0.0028267254,0.0027554438,0.0012515825],"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.0005628198,0.00042830218,0.004608235,0.00015387239,0.00023453319,0.00024055084,0.0004239984,0.2039925,0.032192778,0.01563397,0.011528599,0.72999984],"study_design_scores_gemma":[0.000015341684,0.00004608081,0.00069675397,0.00000828729,0.000017573784,0.000089784095,0.000049573464,0.9793108,0.0064756456,0.010828547,0.0024418922,0.000019694568],"about_ca_topic_score_codex":0.0022366832,"about_ca_topic_score_gemma":0.0028219447,"teacher_disagreement_score":0.002267677,"about_ca_system_score_codex":0.0006811325,"about_ca_system_score_gemma":0.00073673594,"threshold_uncertainty_score":0.007586181},"labels":[],"label_agreement":null},{"id":"W4382240209","doi":"10.1609/aaai.v37i4.25626","title":"Show Me the Way! Bilevel Search for Synthesizing Programmatic Strategies","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Canadian Institute for Advanced Research","keywords":"Computer science; Space (punctuation); Function (biology); Search algorithm; Set (abstract data type); Differentiable function; Bilevel optimization; Feature (linguistics); Evaluation function; Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Optimization problem; Programming language","score_opus":0.18579268984963782,"score_gpt":0.3534989015197543,"score_spread":0.1677062116701165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382240209","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.0393364,0.00050273596,0.9489499,0.00045824426,0.00006829633,0.000114752635,0.00007647236,0.0011653712,0.009327856],"genre_scores_gemma":[0.41121036,0.00040004717,0.5813571,0.00025744695,0.000024498451,0.00043974,0.00017888451,0.00039603026,0.005735881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940467,0.00020426715,0.00004431558,0.00012531946,0.00014824473,0.000073183284],"domain_scores_gemma":[0.99897826,0.00066867325,0.00008086608,0.00009089468,0.000115366536,0.00006598472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012637061,0.0010535552,0.00070924003,0.0007160334,0.00060805824,0.0014121722,0.00092653435,0.0011314928,0.0058222776],"category_scores_gemma":[0.006119442,0.00050804537,0.00080910645,0.00047373888,0.0015646546,0.0015970911,0.0015533905,0.0015355905,0.0009438643],"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.00023004119,0.0001383472,0.0021793346,0.00040679603,0.0000854595,0.0002296235,0.00049113965,0.6393704,0.008331365,0.1628347,0.003162985,0.18253988],"study_design_scores_gemma":[0.000046188277,0.00010488524,0.00010012974,0.000060103714,0.000022639973,0.00006100156,0.00008442584,0.9318534,0.0023990984,0.059642572,0.005610514,0.000015042704],"about_ca_topic_score_codex":0.0020854988,"about_ca_topic_score_gemma":0.0027134612,"teacher_disagreement_score":0.0058222776,"about_ca_system_score_codex":0.0008648253,"about_ca_system_score_gemma":0.0012233742,"threshold_uncertainty_score":0.019477427},"labels":[],"label_agreement":null},{"id":"W4382240624","doi":"10.1609/aaai.v37i1.25078","title":"AVCAffe: A Large Scale Audio-Visual Dataset of Cognitive Load and Affect for Remote Work","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Work-Family Balance Challenges","field":"Social Sciences","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Vector Institute","funders":"Mitacs; Queen's University","keywords":"Cognitive load; Affect (linguistics); Computer science; Cognition; Work (physics); Arousal; The Internet; Benchmark (surveying); Valence (chemistry); Scale (ratio); Multimedia; Psychology; World Wide Web; Social psychology; Engineering","score_opus":0.09818126640063123,"score_gpt":0.3803283001195937,"score_spread":0.28214703371896244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382240624","genre_codex":"dataset","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.219469,0.0023560158,0.016780274,0.0012548675,0.00097312906,0.0011089831,0.7276702,0.006137064,0.024250472],"genre_scores_gemma":[0.23796579,0.0006567099,0.022747878,0.00070896297,0.00033515124,0.0018070332,0.72702503,0.00040294396,0.008350483],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99937683,0.00014368107,0.000046306945,0.00016964145,0.00016727872,0.00009625073],"domain_scores_gemma":[0.9987576,0.0003548209,0.00011189009,0.00024578607,0.00031312075,0.00021669205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004809675,0.0011836434,0.0005179116,0.001645737,0.000616814,0.0011398601,0.0012003811,0.0015252242,0.0057385657],"category_scores_gemma":[0.002955759,0.0002191905,0.00072381354,0.001135331,0.00031273684,0.0007818532,0.0012139678,0.0011063274,0.00444812],"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.0019907737,0.0015860469,0.08687849,0.0024785504,0.00044554405,0.0011299839,0.002046126,0.007985781,0.020071052,0.0018935936,0.704478,0.16901605],"study_design_scores_gemma":[0.00038008482,0.0007091472,0.5283157,0.0006373362,0.00016400884,0.001561815,0.0032183835,0.03591145,0.008319273,0.0054433714,0.41496748,0.00037182335],"about_ca_topic_score_codex":0.0126995435,"about_ca_topic_score_gemma":0.043128338,"teacher_disagreement_score":0.0126995435,"about_ca_system_score_codex":0.00069419737,"about_ca_system_score_gemma":0.00047767008,"threshold_uncertainty_score":0.02525127},"labels":[],"label_agreement":null},{"id":"W4382317589","doi":"10.1609/aaai.v37i8.26101","title":"AIO-P: Expanding Neural Performance Predictors beyond Image Classification","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Neural Networks and Applications","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":"Huawei Technologies (Canada); University of Alberta","funders":"","keywords":"Image (mathematics); Artificial intelligence; Computer science; Pattern recognition (psychology)","score_opus":0.08262618844954439,"score_gpt":0.3043537326942959,"score_spread":0.2217275442447515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382317589","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.07409608,0.0009561217,0.9057358,0.0005426945,0.00016905722,0.00020568621,0.00040081132,0.01209216,0.0058016],"genre_scores_gemma":[0.67192954,0.0006046061,0.31662738,0.0004662469,0.00015089316,0.0005279527,0.0016154035,0.0009933641,0.0070845876],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914443,0.00014874489,0.00004076236,0.00022698307,0.00030670152,0.00013243455],"domain_scores_gemma":[0.99568814,0.0019420261,0.00041855633,0.00078046793,0.0010038891,0.00016692233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002194876,0.0021156874,0.00096039317,0.000957479,0.00048173653,0.0012003096,0.0022050561,0.0010581566,0.0033384839],"category_scores_gemma":[0.009648759,0.0006721712,0.000502909,0.0010195305,0.0006343993,0.0030047272,0.0019255329,0.003248904,0.0016590947],"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.00035286168,0.00042114314,0.008125302,0.00019013934,0.000107743006,0.000086793254,0.00008465762,0.36438242,0.009872144,0.0048097665,0.010335434,0.6012315],"study_design_scores_gemma":[0.000016719088,0.00012912237,0.0008700322,0.00001797856,0.000020665646,0.000020545835,0.000014544454,0.9874764,0.0063843084,0.0037625523,0.0012720468,0.000015114698],"about_ca_topic_score_codex":0.0037043109,"about_ca_topic_score_gemma":0.007854045,"teacher_disagreement_score":0.0037043109,"about_ca_system_score_codex":0.0006326836,"about_ca_system_score_gemma":0.0021622982,"threshold_uncertainty_score":0.011607766},"labels":[],"label_agreement":null},{"id":"W4382317605","doi":"10.1609/aaai.v37i9.26334","title":"Optimal Sparse Regression Trees","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Institute on Drug Abuse; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Regression; Statistics; Mathematics; Computer science","score_opus":0.10977304209321331,"score_gpt":0.31343853793222004,"score_spread":0.20366549583900673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382317605","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.010566682,0.00082518475,0.9802075,0.000904142,0.0000911904,0.000057355042,0.00037065434,0.0007890528,0.0061882543],"genre_scores_gemma":[0.43127385,0.0022088445,0.5496313,0.0011245427,0.00057366194,0.00050046877,0.0034914901,0.0010632785,0.010132588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968118,0.0011624256,0.00014417416,0.00068483304,0.00085193664,0.00034492725],"domain_scores_gemma":[0.98997444,0.0075562773,0.000461763,0.00087208714,0.0008982342,0.00023720859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022574994,0.0011871662,0.0019292176,0.0010209797,0.0009108325,0.0018194218,0.0015580857,0.0017658451,0.0062769596],"category_scores_gemma":[0.02513642,0.0008753856,0.0011029883,0.0018427076,0.0015094178,0.0039171297,0.002460877,0.0035311666,0.0022363276],"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.000201003,0.00013925102,0.0014216789,0.00040468728,0.0000797471,0.00017972589,0.00023080363,0.52848345,0.0032256653,0.24168509,0.028732732,0.19521612],"study_design_scores_gemma":[0.000029505474,0.00003254541,0.0001649303,0.000041322408,0.000013235061,0.00005119189,0.000032775464,0.81286883,0.00071690854,0.18265937,0.0033789887,0.000010443468],"about_ca_topic_score_codex":0.0017708787,"about_ca_topic_score_gemma":0.0033393917,"teacher_disagreement_score":0.0062769596,"about_ca_system_score_codex":0.0011118544,"about_ca_system_score_gemma":0.0017387642,"threshold_uncertainty_score":0.020998538},"labels":[],"label_agreement":null},{"id":"W4382317608","doi":"10.1609/aaai.v37i13.26891","title":"Learning Logical Reasoning Using an Intelligent Tutoring System: A Hybrid Approach to Student Modeling","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Artificial intelligence; Bayesian network; Initialization; Machine learning; Inference; Knowledge representation and reasoning; Intelligent tutoring system; Process (computing); Semantic reasoner; Tracing; Logical reasoning; Natural language processing; Programming language","score_opus":0.16672204582327355,"score_gpt":0.33012580335023817,"score_spread":0.16340375752696462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382317608","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.069032215,0.00008624205,0.9249318,0.0002622921,0.0000099426525,0.00012681645,0.000055688215,0.00089040154,0.0046045687],"genre_scores_gemma":[0.5719558,0.00011980447,0.42347196,0.00010479751,0.000012705066,0.00022279742,0.00014242882,0.00006862879,0.0039011526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852955,0.0007602285,0.00007309502,0.00025622852,0.00032862235,0.00005218617],"domain_scores_gemma":[0.9977258,0.0013075642,0.00012762565,0.00035175617,0.00039333553,0.000093991526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019138678,0.0006221051,0.00064045185,0.00097079336,0.0004154486,0.002364209,0.0018222706,0.0011155503,0.0023755152],"category_scores_gemma":[0.006349551,0.00041618652,0.0008210286,0.0008106325,0.0005500409,0.003372542,0.0015917129,0.001033655,0.0005518353],"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.00038749774,0.0009808093,0.014886131,0.00027814414,0.00031708472,0.00026768676,0.0041109077,0.49600264,0.015876072,0.055852536,0.0012894279,0.40975103],"study_design_scores_gemma":[0.0000113292945,0.00007690655,0.00054068275,0.000013233746,0.000028493554,0.000040109644,0.000100241465,0.98681927,0.002027974,0.008883028,0.0014454655,0.000013385286],"about_ca_topic_score_codex":0.0029467705,"about_ca_topic_score_gemma":0.006153062,"teacher_disagreement_score":0.0029467705,"about_ca_system_score_codex":0.0010564332,"about_ca_system_score_gemma":0.0009942974,"threshold_uncertainty_score":0.010121584},"labels":[],"label_agreement":null},{"id":"W4382317638","doi":"10.1609/aaai.v37i13.26993","title":"Flaky Performances When Pretraining on Relational Databases (Student Abstract)","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","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":"Canadian Institute for Advanced Research; HEC Montréal; Université de Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Porting; Leverage (statistics); Relational database; Node (physics); Conjecture; Graph; Artificial intelligence; Natural language processing; Theoretical computer science; Data mining; Programming language; Mathematics","score_opus":0.1693824668639811,"score_gpt":0.3406220593983447,"score_spread":0.17123959253436363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382317638","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.82353175,0.0032570888,0.12886319,0.0034721594,0.00063123903,0.0003058389,0.0025661218,0.018019201,0.019353457],"genre_scores_gemma":[0.9430175,0.00026688987,0.045688596,0.00063889794,0.00006492627,0.00010866004,0.0044725216,0.00048408858,0.0052578948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836296,0.00045599247,0.00010030601,0.0006259128,0.00024546107,0.0002094404],"domain_scores_gemma":[0.99425274,0.003144501,0.00024980374,0.0013962649,0.0007030698,0.00025350344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003930741,0.0015145651,0.00071955216,0.000672773,0.0005458414,0.0013610221,0.0018422551,0.0018692013,0.0054213074],"category_scores_gemma":[0.015370932,0.00039085865,0.0006789151,0.00060464855,0.0008839732,0.0037812882,0.0017944836,0.0023417182,0.0023032792],"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.0024901112,0.0010611233,0.015284713,0.0008199406,0.0004564908,0.00032277103,0.00035836283,0.32098216,0.021826075,0.0030753785,0.027790666,0.6055321],"study_design_scores_gemma":[0.00006768715,0.0007191924,0.0038428272,0.00007063249,0.00006267243,0.00011671325,0.000186559,0.957865,0.029704202,0.004443958,0.0028914574,0.000029048428],"about_ca_topic_score_codex":0.009608816,"about_ca_topic_score_gemma":0.012890095,"teacher_disagreement_score":0.009608816,"about_ca_system_score_codex":0.0011288482,"about_ca_system_score_gemma":0.0009298331,"threshold_uncertainty_score":0.020788014},"labels":[],"label_agreement":null},{"id":"W4382317639","doi":"10.1609/aaai.v37i13.26946","title":"Lightweight Transformer for Multi-Modal Object Detection (Student Abstract)","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Infrared Target Detection Methodologies","field":"Engineering","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; Modal; Object detection; Information fusion; Artificial intelligence; Transformer; Sensor fusion; Fusion; Real-time computing; Computer vision; Computer engineering; Data mining; Pattern recognition (psychology); Engineering; Voltage","score_opus":0.15523342339198462,"score_gpt":0.3477127746424042,"score_spread":0.19247935125041957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382317639","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.0076066796,0.000054205288,0.9903593,0.00003652268,0.00002650701,0.00002491595,0.000025062967,0.0011775412,0.0006891613],"genre_scores_gemma":[0.39618284,0.00014489156,0.5981135,0.00012641597,0.00005405349,0.00007778478,0.0002162942,0.00021956573,0.004864648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965787,0.00006056821,0.000015630283,0.00006388517,0.00016179783,0.000040253693],"domain_scores_gemma":[0.9994524,0.00019471318,0.000040695984,0.0001272864,0.00014961475,0.000035180234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006913208,0.0005032567,0.00043123175,0.00040175597,0.00025485695,0.00064374966,0.0009223142,0.0005771156,0.008815703],"category_scores_gemma":[0.0013692863,0.00016414383,0.0004637073,0.00038779745,0.00038190253,0.0014798068,0.0011841108,0.0006572088,0.001962373],"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.0008310378,0.00022246281,0.00097061525,0.0002229549,0.000056453984,0.00024031929,0.00008681787,0.060195837,0.26766905,0.025784029,0.006751128,0.6369693],"study_design_scores_gemma":[0.000034319844,0.0002393008,0.00038846055,0.000008059905,0.00001960679,0.00032233226,0.000026691314,0.86928695,0.11428941,0.010848225,0.004521568,0.000015049945],"about_ca_topic_score_codex":0.0007306618,"about_ca_topic_score_gemma":0.0011057962,"teacher_disagreement_score":0.008815703,"about_ca_system_score_codex":0.00030971278,"about_ca_system_score_gemma":0.0003994815,"threshold_uncertainty_score":0.029491484},"labels":[],"label_agreement":null},{"id":"W4382317641","doi":"10.1609/aaai.v37i13.26862","title":"Towards Safe Mechanical Ventilation Treatment Using Deep Offline Reinforcement Learning","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Respiratory Support and Mechanisms","field":"Medicine","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"University of Toronto; McGill University","keywords":"Reinforcement learning; Task (project management); Computer science; Ventilation (architecture); Key (lock); Artificial intelligence; Mechanical ventilation; Reinforcement; Machine learning; Medicine; Engineering; Computer security","score_opus":0.1632443224181052,"score_gpt":0.35843211964110655,"score_spread":0.19518779722300136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382317641","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.1553208,0.0014171599,0.8310015,0.0020625966,0.00018366321,0.00022138405,0.00039475877,0.0047537163,0.004644471],"genre_scores_gemma":[0.92781395,0.00014412422,0.06918217,0.00057849777,0.000045459907,0.00010129628,0.00029874,0.00010190702,0.0017338465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993274,0.00028029925,0.000031984615,0.00015452632,0.00011663881,0.00008926443],"domain_scores_gemma":[0.9977069,0.0015565822,0.00021019972,0.00014118037,0.00023417629,0.00015094646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017301069,0.0010545332,0.00081440934,0.00031341737,0.0002732656,0.0006882813,0.0011694027,0.0012666803,0.0017987655],"category_scores_gemma":[0.006703793,0.00036588253,0.000467961,0.00014553456,0.0008032056,0.000805725,0.001036613,0.001741233,0.00047601832],"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.00044538963,0.00030310242,0.0042233155,0.000117140866,0.000058083693,0.00015402268,0.0000721386,0.8861134,0.0028847298,0.002110307,0.0044411654,0.099077135],"study_design_scores_gemma":[0.00004395994,0.00008461024,0.0001611193,0.0000088367415,0.0000056408144,0.000017761642,0.000006829716,0.9967434,0.0007867833,0.0017869138,0.00035029592,0.0000039115653],"about_ca_topic_score_codex":0.004192866,"about_ca_topic_score_gemma":0.0046536056,"teacher_disagreement_score":0.004192866,"about_ca_system_score_codex":0.00086868345,"about_ca_system_score_gemma":0.0016281466,"threshold_uncertainty_score":0.009149849},"labels":[],"label_agreement":null},{"id":"W4382317665","doi":"10.1609/aaai.v37i13.26859","title":"MobilePTX: Sparse Coding for Pneumothorax Detection Given Limited Training Examples","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Ultrasound in Clinical Applications","field":"Medicine","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 Toronto","funders":"Advanced Research Projects Agency; Defense Advanced Research Projects Agency; U.S. Department of Defense","keywords":"Computer science; Medical diagnosis; Coding (social sciences); Pneumothorax; Artificial intelligence; Machine learning; Classifier (UML); Training set; Pattern recognition (psychology); Medicine; Radiology","score_opus":0.28874039400425244,"score_gpt":0.3873159476451354,"score_spread":0.09857555364088294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382317665","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.07803798,0.0007552761,0.9085786,0.0006678032,0.0001834495,0.00017350158,0.0009608428,0.007930047,0.0027125708],"genre_scores_gemma":[0.5353582,0.0005816649,0.45232812,0.0004869726,0.00020152332,0.00034822334,0.0038944085,0.0003431938,0.0064577376],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999597,0.00009793266,0.000020411688,0.00010966086,0.00012775605,0.000047319303],"domain_scores_gemma":[0.9987005,0.0008501307,0.00006117019,0.00012447745,0.0002094483,0.000054301083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009169822,0.00066092727,0.000576745,0.0006169043,0.00021371896,0.0004443755,0.0010068853,0.00096020324,0.002833066],"category_scores_gemma":[0.0067879483,0.0002751057,0.0003280653,0.0005278212,0.00029906412,0.0010172408,0.00081803685,0.0009708252,0.0010860421],"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.0008085301,0.00026125557,0.0025144476,0.00023462925,0.00007100927,0.000340753,0.00012906277,0.15889567,0.029465932,0.0026269425,0.019086828,0.785565],"study_design_scores_gemma":[0.00002875829,0.00007921434,0.00045993656,0.00000942143,0.0000059643735,0.00006125625,0.000013548125,0.992811,0.0042455043,0.0012832719,0.0009963545,0.0000057066695],"about_ca_topic_score_codex":0.0051220134,"about_ca_topic_score_gemma":0.0057176463,"teacher_disagreement_score":0.0051220134,"about_ca_system_score_codex":0.00037056458,"about_ca_system_score_gemma":0.000660676,"threshold_uncertainty_score":0.010184407},"labels":[],"label_agreement":null},{"id":"W4382317845","doi":"10.1609/aaai.v37i13.26869","title":"High-Throughput, High-Performance Deep Learning-Driven Light Guide Plate Surface Visual Quality Inspection Tailored for Real-World Manufacturing Environments","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Industrial Vision Systems and Defect Detection","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Workflow; Visual inspection; Throughput; Deep learning; Artificial intelligence; Computer science; Quality (philosophy); Consistency (knowledge bases); Computer vision; Database","score_opus":0.05683405684072034,"score_gpt":0.30154922528395306,"score_spread":0.2447151684432327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382317845","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.07923582,0.00032070506,0.8949891,0.0003062133,0.00009236825,0.0002377015,0.00061125035,0.019333461,0.0048734127],"genre_scores_gemma":[0.6321315,0.00020775254,0.35763854,0.00041082394,0.000022872087,0.00022978551,0.0020846874,0.00055828405,0.0067157303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99969053,0.000021468968,0.000009360163,0.000080082915,0.00014488894,0.00005364932],"domain_scores_gemma":[0.9996953,0.00006254178,0.00003323486,0.00004697808,0.0001189013,0.000043051412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036431281,0.0010417099,0.00046568515,0.00042079136,0.00020047494,0.0006206195,0.0019036343,0.00064281904,0.0023990648],"category_scores_gemma":[0.0009203421,0.0003988749,0.00047100507,0.00025859155,0.00040588574,0.0008702368,0.0012067558,0.0012347407,0.0009028801],"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.00046447286,0.0004058188,0.0055172015,0.00046401928,0.00013268986,0.000522471,0.0001812165,0.51351243,0.14846961,0.004319348,0.015272134,0.3107385],"study_design_scores_gemma":[0.000013683656,0.00006036591,0.00045935067,0.000006240107,0.000007073827,0.000032393185,0.0000097127195,0.97902864,0.01847895,0.00079576764,0.0010972836,0.000010563539],"about_ca_topic_score_codex":0.005261828,"about_ca_topic_score_gemma":0.009710751,"teacher_disagreement_score":0.005261828,"about_ca_system_score_codex":0.00096038304,"about_ca_system_score_gemma":0.001372578,"threshold_uncertainty_score":0.010462403},"labels":[],"label_agreement":null},{"id":"W4382317858","doi":"10.1609/aaai.v37i8.26150","title":"DisGUIDE: Disagreement-Guided Data-Free Model Extraction","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"University of Waterloo; Purdue University; National Science Foundation","keywords":"Computer science; Generator (circuit theory); Data mining; Machine learning; Data extraction; Scheme (mathematics); Artificial intelligence; Power (physics)","score_opus":0.2242784790751523,"score_gpt":0.38195678724580584,"score_spread":0.15767830817065354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382317858","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.046286147,0.00045044138,0.9371069,0.0009602673,0.00012941325,0.00016542138,0.00039990558,0.012248957,0.0022524453],"genre_scores_gemma":[0.7090938,0.0002160613,0.2808828,0.001200257,0.00013289497,0.00025933413,0.0022052443,0.0011894925,0.004820131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99611735,0.0014759296,0.0002141633,0.00070997514,0.0012083168,0.00027415948],"domain_scores_gemma":[0.9910782,0.0031212044,0.0005071017,0.004454737,0.00063948386,0.00019927387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004237098,0.001538763,0.0015562818,0.0009120248,0.00083460734,0.0015320902,0.0032267447,0.0022607967,0.0025988854],"category_scores_gemma":[0.018019715,0.0007238963,0.0012205167,0.0007327554,0.002108631,0.0059799305,0.0065972335,0.003989219,0.002170681],"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.0013655779,0.0005255935,0.007789437,0.00032150297,0.0004279864,0.0007446003,0.0007671892,0.44405788,0.036981743,0.046858374,0.03270234,0.4274577],"study_design_scores_gemma":[0.000049544735,0.00010268785,0.0002097025,0.000011325365,0.000016785663,0.000196753,0.0000419223,0.9614763,0.014589649,0.020410413,0.0028744151,0.000020432311],"about_ca_topic_score_codex":0.0015141389,"about_ca_topic_score_gemma":0.0018427381,"teacher_disagreement_score":0.004237098,"about_ca_system_score_codex":0.001075177,"about_ca_system_score_gemma":0.0014376459,"threshold_uncertainty_score":0.022408187},"labels":[],"label_agreement":null},{"id":"W4382317874","doi":"10.1609/aaai.v37i8.26102","title":"GENNAPE: Towards Generalized Neural Architecture Performance Estimators","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","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":"Huawei Technologies (Canada); University of Alberta","funders":"","keywords":"Computer science; Artificial neural network; Artificial intelligence; Architecture; Network architecture; Estimator; Graph; Machine learning; Time delay neural network; Theoretical computer science; Mathematics","score_opus":0.06564785021917369,"score_gpt":0.29487975873710165,"score_spread":0.22923190851792796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382317874","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.050677013,0.00076731853,0.9420155,0.00020909033,0.00005050089,0.000066030734,0.00030418663,0.0043072705,0.0016029762],"genre_scores_gemma":[0.7101797,0.0003544919,0.28420246,0.00027994,0.000052915868,0.00025661156,0.0015348783,0.0006747249,0.002464265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992168,0.00022521,0.000036294714,0.00023894961,0.0002046333,0.00007809086],"domain_scores_gemma":[0.9975419,0.0012495889,0.00026770323,0.00037652254,0.00049188174,0.00007245508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021404233,0.0014943463,0.0008268456,0.0010382585,0.00025842717,0.0008953072,0.0020607018,0.0010558446,0.0014926866],"category_scores_gemma":[0.008669328,0.0005068055,0.0004850918,0.0005777216,0.0007215298,0.001590773,0.0013346284,0.0019294932,0.00058417174],"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.00011342684,0.00006524243,0.0045904247,0.00012401861,0.00012213059,0.000047307745,0.00005710138,0.8228774,0.004445152,0.0052964687,0.0028291803,0.15943208],"study_design_scores_gemma":[0.0000052398204,0.000031537118,0.00034267807,0.000009482824,0.0000080591735,0.0000121641515,0.000006668635,0.99455535,0.0013963197,0.0032816974,0.0003454529,0.000005294113],"about_ca_topic_score_codex":0.0040548155,"about_ca_topic_score_gemma":0.0073072696,"teacher_disagreement_score":0.0040548155,"about_ca_system_score_codex":0.0009381567,"about_ca_system_score_gemma":0.0012101734,"threshold_uncertainty_score":0.0113197565},"labels":[],"label_agreement":null},{"id":"W4382317875","doi":"10.1609/aaai.v37i12.26748","title":"Revisiting the Importance of Amplifying Bias for Debiasing","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","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":"Kootenay Association for Science & Technology","funders":"Ministry of Science and ICT, South Korea; Korea Advanced Institute of Science and Technology; Institute for Information and Communications Technology Promotion; Electronics and Telecommunications Research Institute","keywords":"Debiasing; Selection bias; Computer science; Artificial intelligence; Classifier (UML); Sampling bias; Non-response bias; Training set; Sample (material); Statistics; Machine learning; Sample size determination; Psychology; Mathematics; Social psychology","score_opus":0.18407786617459618,"score_gpt":0.35457081368631754,"score_spread":0.17049294751172137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382317875","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.124821946,0.0031680255,0.86564213,0.000914019,0.0002681911,0.0002034644,0.00015814784,0.0025701246,0.0022539601],"genre_scores_gemma":[0.6021904,0.00103385,0.3895822,0.0010437398,0.00024887832,0.00023947775,0.0006090305,0.0006693007,0.0043830834],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977525,0.00053777115,0.00023361082,0.0006342853,0.00065150746,0.00019026798],"domain_scores_gemma":[0.9906288,0.0044273282,0.0007549581,0.0021100373,0.0018718957,0.00020697177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005136572,0.001703432,0.0013847788,0.0010412952,0.0006999646,0.0013460226,0.0023617675,0.0015633054,0.0018707705],"category_scores_gemma":[0.020840954,0.0006136464,0.000966246,0.0008013513,0.001897899,0.0033489813,0.0023013372,0.0027862117,0.00093927205],"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.0009815111,0.00043732455,0.014675311,0.00069702184,0.00026100408,0.00028344968,0.00078820577,0.13347232,0.09910589,0.010987541,0.0051027876,0.73320764],"study_design_scores_gemma":[0.00009847152,0.00058889686,0.0050279377,0.00016171299,0.00015477333,0.00039583223,0.00016564502,0.90131056,0.07146418,0.010767299,0.00978982,0.0000748789],"about_ca_topic_score_codex":0.0032979427,"about_ca_topic_score_gemma":0.0052175936,"teacher_disagreement_score":0.005136572,"about_ca_system_score_codex":0.00074792857,"about_ca_system_score_gemma":0.0012076809,"threshold_uncertainty_score":0.027165055},"labels":[],"label_agreement":null},{"id":"W4382317916","doi":"10.1609/aaai.v37i13.27088","title":"AnoViz: A Visual Inspection Tool of Anomalies in Multivariate Time Series","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Data Visualization and Analytics","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":"Kootenay Association for Science & Technology","funders":"Samsung","keywords":"Anomaly detection; Visualization; Computer science; Rendering (computer graphics); Multivariate statistics; Series (stratigraphy); Data mining; Anomaly (physics); Data visualization; Visual inspection; Time series; Artificial intelligence; Geology; Machine learning; Physics","score_opus":0.05910017496436031,"score_gpt":0.32531417720003053,"score_spread":0.2662140022356702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382317916","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026989419,0.00063647435,0.8473354,0.0009874415,0.00030341517,0.00015497893,0.007984209,0.110441454,0.005167115],"genre_scores_gemma":[0.31658232,0.0013101872,0.6563989,0.0004406983,0.0003100827,0.00038513375,0.01006698,0.00961663,0.004889084],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99940443,0.00013243868,0.00005993358,0.00009166939,0.00025912462,0.00005236371],"domain_scores_gemma":[0.99604696,0.0022876624,0.0005014811,0.00039849395,0.0005934576,0.00017199873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017569436,0.0012747045,0.0006397235,0.0048640138,0.00047345995,0.0019774325,0.001064272,0.0007002425,0.0116255],"category_scores_gemma":[0.008915297,0.00038021643,0.00081716356,0.0017640062,0.00032398212,0.0028982067,0.00212755,0.0014616527,0.0015100216],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001750781,0.00025322317,0.017623246,0.0018987529,0.00040996907,0.001892561,0.0042750943,0.044248644,0.056397993,0.04850223,0.17493384,0.64781356],"study_design_scores_gemma":[0.00022809865,0.00028266996,0.016398994,0.0005005841,0.00016941018,0.0018529352,0.001096019,0.6084169,0.03937945,0.07854174,0.25275657,0.00037660068],"about_ca_topic_score_codex":0.0033214192,"about_ca_topic_score_gemma":0.0032556185,"teacher_disagreement_score":0.0116255,"about_ca_system_score_codex":0.00034292057,"about_ca_system_score_gemma":0.0007240867,"threshold_uncertainty_score":0.038891196},"labels":[],"label_agreement":null},{"id":"W4382317969","doi":"10.1609/aaai.v37i12.26779","title":"DeepGemini: Verifying Dependency Fairness for Deep Neural Network","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Japan Society for the Promotion of Science; Canada First Research Excellence Fund; JST-Mirai Program; University of Alberta; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Counterexample; Heuristics; Certification; Scalability; Deep neural networks; Benchmark (surveying); Key (lock); Fairness measure; Artificial neural network; Artificial intelligence; Computer security; Mathematics","score_opus":0.08482360610997083,"score_gpt":0.31933126912160475,"score_spread":0.23450766301163392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382317969","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.0501229,0.00057515135,0.93908715,0.0008616158,0.00017219625,0.00019692867,0.00056848506,0.00570887,0.00270672],"genre_scores_gemma":[0.7480003,0.00032031166,0.24635346,0.00083164574,0.00010333956,0.0003872656,0.0010541428,0.0006864857,0.0022629737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99251705,0.0023565013,0.00049045583,0.0016128778,0.0022100746,0.00081311393],"domain_scores_gemma":[0.97744274,0.014722084,0.0015290984,0.0034050746,0.0022850782,0.00061588973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009021072,0.0017235318,0.0012485583,0.0013017941,0.0013586171,0.002192729,0.0038924094,0.001799967,0.0039294846],"category_scores_gemma":[0.04352696,0.000952695,0.0022308582,0.0006893822,0.003537555,0.0046573486,0.0048524663,0.0052424907,0.0005160307],"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.0009478742,0.00022506152,0.009682186,0.00052835647,0.0001851062,0.00029336274,0.00027942378,0.7413438,0.01012705,0.10345192,0.005102355,0.1278335],"study_design_scores_gemma":[0.000031702955,0.000057616704,0.00020684836,0.000026837426,0.000018146213,0.000031805193,0.000018030943,0.9477547,0.00523602,0.045836043,0.00076967623,0.0000125865],"about_ca_topic_score_codex":0.008609929,"about_ca_topic_score_gemma":0.014080643,"teacher_disagreement_score":0.009021072,"about_ca_system_score_codex":0.005049775,"about_ca_system_score_gemma":0.008002029,"threshold_uncertainty_score":0.04770857},"labels":[],"label_agreement":null},{"id":"W4382318018","doi":"10.1609/aaai.v37i12.26682","title":"Bugs in the Data: How ImageNet Misrepresents Biodiversity","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Species Distribution and Climate Change","field":"Environmental Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Goddard Space Flight Center; Canadian Institute for Advanced Research","keywords":"Benchmarking; Computer science; Artificial intelligence; Set (abstract data type); Machine learning; Image (mathematics); Biodiversity; Wildlife; Object (grammar); Pattern recognition (psychology); Ecology; Biology","score_opus":0.2291688641169977,"score_gpt":0.3201386821196012,"score_spread":0.09096981800260354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382318018","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.81305736,0.0063249683,0.103039056,0.016385298,0.0019547122,0.0004204935,0.02677554,0.0064294576,0.02561327],"genre_scores_gemma":[0.9296278,0.00068446726,0.037903756,0.003177668,0.0002538589,0.0001683579,0.023872007,0.0013730968,0.0029389663],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9904659,0.0033703414,0.0007471765,0.0018805355,0.0031090553,0.0004270416],"domain_scores_gemma":[0.96724665,0.01829285,0.0037243653,0.005482796,0.00483027,0.0004231331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011561195,0.0007578442,0.00064869254,0.004119093,0.001065021,0.003003145,0.0019906806,0.0014964845,0.0013134292],"category_scores_gemma":[0.06010477,0.0004995441,0.00043515163,0.0044948985,0.0022655388,0.004084342,0.0020520233,0.001295821,0.00090075517],"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.0008635608,0.00026054395,0.4602767,0.0011781204,0.0005386524,0.0017784329,0.0065671154,0.038245074,0.0069624283,0.023875615,0.1753023,0.28415146],"study_design_scores_gemma":[0.00010407289,0.0002654832,0.32419574,0.0014018548,0.00033176714,0.00635613,0.0102089,0.3161183,0.027704962,0.08307217,0.2299617,0.0002788553],"about_ca_topic_score_codex":0.016756263,"about_ca_topic_score_gemma":0.024379624,"teacher_disagreement_score":0.016756263,"about_ca_system_score_codex":0.0021876635,"about_ca_system_score_gemma":0.0009520053,"threshold_uncertainty_score":0.061142206},"labels":[],"label_agreement":null},{"id":"W4382318104","doi":"10.1609/aaai.v37i8.26107","title":"Exploring the Interaction between Local and Global Latent Configurations for Clustering Single-Cell RNA-Seq: A Unified Perspective","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Single-cell and spatial transcriptomics","field":"Biochemistry, Genetics and Molecular Biology","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":"Université du Québec à Montréal","funders":"","keywords":"Cluster analysis; Computer science; Data mining; Feature (linguistics); Randomness; Artificial intelligence; Probabilistic logic; Machine learning; Mathematics","score_opus":0.195684400432532,"score_gpt":0.3144757722884025,"score_spread":0.11879137185587052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382318104","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.032410327,0.00046774745,0.96594226,0.00019251848,0.0000131332345,0.000023142913,0.00009540687,0.00037880713,0.00047656873],"genre_scores_gemma":[0.5930199,0.0011419125,0.40245494,0.00026980546,0.00007749291,0.00013109513,0.00093868107,0.00033297835,0.0016331983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991315,0.0002663824,0.000038283943,0.00029178616,0.0001849996,0.00008712492],"domain_scores_gemma":[0.9978375,0.001124665,0.00026494893,0.000384374,0.0002452287,0.00014335432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020580003,0.0009084992,0.0011682565,0.0014676313,0.0006677672,0.001981416,0.0019951314,0.0013618687,0.00077519007],"category_scores_gemma":[0.0050740684,0.0007938683,0.0010321105,0.0015915312,0.0018122602,0.0030835206,0.0020322187,0.0015105868,0.00045327947],"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.00019774583,0.000104830186,0.007863,0.00026136526,0.00020195913,0.00022289038,0.000393774,0.7791821,0.02698028,0.050389085,0.0019269319,0.13227609],"study_design_scores_gemma":[0.000005919956,0.00002206636,0.000680341,0.000009568307,0.000015425412,0.000039512975,0.00004673717,0.9734893,0.002703484,0.02241306,0.0005528467,0.000021809261],"about_ca_topic_score_codex":0.004885357,"about_ca_topic_score_gemma":0.0087971985,"teacher_disagreement_score":0.004885357,"about_ca_system_score_codex":0.0012141209,"about_ca_system_score_gemma":0.0014127963,"threshold_uncertainty_score":0.010883868},"labels":[],"label_agreement":null},{"id":"W4382318126","doi":"10.1609/aaai.v37i8.26162","title":"Self-Supervised Audio-Visual Representation Learning with Relaxed Cross-Modal Synchronicity","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Music and Audio Processing","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Vector Institute","funders":"Mitacs","keywords":"Computer science; Modal; Synchronicity; Artificial intelligence; Representation (politics); Asynchronous communication; Speech recognition; Feature learning; Pattern recognition (psychology); Action (physics); Natural language processing; Machine learning","score_opus":0.06273058182013519,"score_gpt":0.32566606840387435,"score_spread":0.26293548658373916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382318126","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.072660774,0.0008613592,0.9090573,0.00040517273,0.00017748386,0.00016598929,0.0008454303,0.010943165,0.004883382],"genre_scores_gemma":[0.7553485,0.00028051165,0.2265174,0.0008688748,0.00021948761,0.0003449342,0.0057287356,0.00062830426,0.01006328],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991003,0.00019439841,0.00003350999,0.00041407323,0.0001568774,0.00010088499],"domain_scores_gemma":[0.9984823,0.00047368094,0.00017398631,0.00047054008,0.00028977718,0.000109631685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012418075,0.0016864698,0.0010591949,0.0008476861,0.0004012574,0.0009062307,0.0031853619,0.00173259,0.0031219325],"category_scores_gemma":[0.0040901494,0.00057398365,0.0011336829,0.0008756892,0.0009636626,0.0020361266,0.0020820166,0.0026028042,0.0016840501],"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.0006034346,0.0006783886,0.0026343882,0.00030342568,0.00028853366,0.00019121803,0.00022045076,0.32294953,0.02634136,0.005114672,0.020832833,0.61984175],"study_design_scores_gemma":[0.00002667866,0.00009838516,0.0003428041,0.0000101834175,0.000017507191,0.000044207212,0.000020855636,0.9906968,0.0041171596,0.003653086,0.0009621337,0.0000102181475],"about_ca_topic_score_codex":0.004220868,"about_ca_topic_score_gemma":0.007475428,"teacher_disagreement_score":0.004220868,"about_ca_system_score_codex":0.0007728265,"about_ca_system_score_gemma":0.0010427401,"threshold_uncertainty_score":0.010443926},"labels":[],"label_agreement":null},{"id":"W4382318178","doi":"10.1609/aaai.v37i8.26146","title":"Hypernetworks for Zero-Shot Transfer in Reinforcement Learning","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","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":"McGill University; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Reinforcement learning; Computer science; Transfer of learning; Context (archaeology); Artificial intelligence; Task (project management); Set (abstract data type); Machine learning; Bellman equation; Mathematical optimization; Mathematics","score_opus":0.1140650363566056,"score_gpt":0.30957506420392306,"score_spread":0.19551002784731747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382318178","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.018676808,0.0002566974,0.9774799,0.00026555324,0.00004794067,0.00006642163,0.00006974748,0.0007707645,0.0023661314],"genre_scores_gemma":[0.8593943,0.00019500482,0.13393341,0.00031570374,0.00005250466,0.00044746156,0.00024766193,0.00021965626,0.005194176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999393,0.00025207337,0.000030490804,0.00015622184,0.00010031607,0.000067895315],"domain_scores_gemma":[0.9973998,0.001837236,0.00016728933,0.0002544436,0.00022618838,0.000115141425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020385145,0.0010906268,0.0009612848,0.00060578604,0.00046875796,0.0008578492,0.0020938045,0.0016336371,0.004278556],"category_scores_gemma":[0.00820599,0.0006409981,0.00057507196,0.00041584703,0.001576023,0.0021864353,0.0019187743,0.0028337233,0.00060496357],"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.00007849577,0.00005240587,0.00035155212,0.000048119186,0.00002790287,0.000056691497,0.00006242241,0.942253,0.0010475498,0.017404236,0.0009242505,0.037693422],"study_design_scores_gemma":[0.000005128734,0.000016085136,0.000023842536,0.0000044859466,0.0000020305736,0.0000050967674,0.0000033352496,0.98861825,0.00024967937,0.010895156,0.00017413031,0.0000028352474],"about_ca_topic_score_codex":0.0030298275,"about_ca_topic_score_gemma":0.0033187335,"teacher_disagreement_score":0.004278556,"about_ca_system_score_codex":0.0015638891,"about_ca_system_score_gemma":0.00090009416,"threshold_uncertainty_score":0.014313221},"labels":[],"label_agreement":null},{"id":"W4382318220","doi":"10.1609/aaai.v37i12.26713","title":"OpenMapFlow: A Library for Rapid Map Creation with Machine Learning and Remote Sensing Data","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Land Use and Ecosystem Services","field":"Environmental 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":"McGill University; Mila - Quebec Artificial Intelligence Institute","funders":"Goddard Space Flight Center; Nuclear Safety and Security Commission; United States Agency for International Development; National Aeronautics and Space Administration","keywords":"Computer science; Python (programming language); Workflow; Machine learning; Pipeline (software); Cloud computing; Artificial intelligence; Set (abstract data type); Binary number; Data mining; Database","score_opus":0.06794881109381214,"score_gpt":0.28157617495344295,"score_spread":0.21362736385963083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382318220","genre_codex":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019921386,0.00014141852,0.33972323,0.00036018452,0.00025377236,0.00031037943,0.04368955,0.6076915,0.005837753],"genre_scores_gemma":[0.06441703,0.00081929244,0.5620263,0.0012277918,0.00021184579,0.0028362349,0.19461572,0.16252695,0.011318815],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988476,0.00012751619,0.000099691744,0.00031762355,0.00045861874,0.00014890534],"domain_scores_gemma":[0.99741435,0.0008571561,0.00023698132,0.00068711827,0.0005166353,0.00028778025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002225026,0.0025256528,0.0013474784,0.0025492436,0.0010724993,0.0029647383,0.0052116024,0.0010521635,0.036136754],"category_scores_gemma":[0.008880391,0.0019421043,0.0026707393,0.0028860234,0.0012710528,0.005390759,0.005160301,0.0040359455,0.020148605],"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.000589764,0.0003441031,0.0051478064,0.0011293637,0.00031503837,0.00041879519,0.0005277188,0.03772002,0.004655437,0.018331926,0.73982406,0.19099595],"study_design_scores_gemma":[0.00048554642,0.00009392879,0.004576146,0.00030312606,0.00006870234,0.0003179986,0.00015415614,0.4206727,0.02711836,0.10650214,0.43935135,0.0003558781],"about_ca_topic_score_codex":0.010271937,"about_ca_topic_score_gemma":0.011182354,"teacher_disagreement_score":0.036136754,"about_ca_system_score_codex":0.0015298619,"about_ca_system_score_gemma":0.0036871189,"threshold_uncertainty_score":0.120889485},"labels":[],"label_agreement":null},{"id":"W4382318225","doi":"10.1609/aaai.v37i13.26968","title":"Towards Safe Reinforcement Learning via OOD Dynamics Detection in Autonomous Driving System (Student Abstract)","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thales (Canada)","funders":"","keywords":"Reinforcement learning; Software deployment; Variety (cybernetics); Relevance (law); Computer science; Dynamics (music); Artificial intelligence; Reinforcement; Function (biology); State (computer science); Human–computer interaction; Psychology; Social psychology; Algorithm","score_opus":0.03409419949122906,"score_gpt":0.28847391439392367,"score_spread":0.2543797149026946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382318225","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.165525,0.00020417196,0.8301618,0.00040692667,0.000057908877,0.000074682954,0.000038900176,0.001898952,0.0016317354],"genre_scores_gemma":[0.93801486,0.000026085363,0.060855336,0.000078544734,0.0000125184115,0.000040472063,0.000031049894,0.000040896444,0.0009002095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974936,0.000072411676,0.000011514765,0.00006120162,0.00005440998,0.000051043204],"domain_scores_gemma":[0.99890053,0.0005571041,0.00012717948,0.0000779553,0.00023538285,0.00010181522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009684667,0.0005284753,0.0005976523,0.00032465244,0.0002857328,0.00048708095,0.00076036365,0.00058869744,0.0008611345],"category_scores_gemma":[0.0028205037,0.00029054453,0.0003118532,0.00013267758,0.0005418458,0.000461132,0.0009241434,0.00088480196,0.00020206757],"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.00018234624,0.00014348477,0.0037085724,0.00005039172,0.000043140775,0.00014114726,0.00012013631,0.8588034,0.0069625825,0.0032915547,0.0010611911,0.12549204],"study_design_scores_gemma":[0.0000036934753,0.000019842215,0.00007459031,0.0000010736641,0.0000010842655,0.0000036761367,0.0000021226738,0.99901533,0.00041296126,0.00040757834,0.000056813158,0.0000011583485],"about_ca_topic_score_codex":0.0064469907,"about_ca_topic_score_gemma":0.0038308545,"teacher_disagreement_score":0.0064469907,"about_ca_system_score_codex":0.0005282598,"about_ca_system_score_gemma":0.0008794098,"threshold_uncertainty_score":0.0128189325},"labels":[],"label_agreement":null},{"id":"W4382318232","doi":"10.1609/aaai.v37i9.26266","title":"Disentangled Representation for Causal Mediation Analysis","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Causal Inference Techniques","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; University of South Australia","keywords":"Confounding; Mediation; Latent variable; Causal inference; Observational study; Econometrics; Causality (physics); Representation (politics); Computer science; Outcome (game theory); Structural equation modeling; Affect (linguistics); Mechanism (biology); Causal model; Artificial intelligence; Machine learning; Psychology; Statistics; Mathematics","score_opus":0.3166754638276828,"score_gpt":0.45770785517093737,"score_spread":0.14103239134325457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382318232","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.007287476,0.0011030348,0.98970276,0.0005169216,0.000055775407,0.000047882764,0.00029102268,0.00032003428,0.00067504623],"genre_scores_gemma":[0.5799923,0.0026385402,0.40833706,0.0011765009,0.00030629808,0.0007413793,0.0021473747,0.00024415136,0.004416507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976411,0.0014495545,0.00010774722,0.00042038277,0.00023325284,0.00014803946],"domain_scores_gemma":[0.99434245,0.0046309195,0.00023600103,0.00046340784,0.00024435832,0.0000829088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043224073,0.0010448227,0.001307642,0.001032959,0.00038908125,0.0010078317,0.0018662119,0.0013296905,0.0039273426],"category_scores_gemma":[0.015142343,0.00058803987,0.0019563958,0.0011255865,0.0009091161,0.0018404925,0.0019218543,0.0031725771,0.00038660847],"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.00040745144,0.00026097367,0.008702382,0.00073373056,0.0012536345,0.00032027316,0.0005559577,0.42772815,0.0032015743,0.13995305,0.0075085512,0.40937433],"study_design_scores_gemma":[0.00003654181,0.00004433263,0.0009280935,0.00006872249,0.00012364952,0.00005232521,0.00003473203,0.87977004,0.00072874886,0.11565476,0.002537858,0.000020186404],"about_ca_topic_score_codex":0.0057905647,"about_ca_topic_score_gemma":0.00717713,"teacher_disagreement_score":0.0057905647,"about_ca_system_score_codex":0.00091867754,"about_ca_system_score_gemma":0.0017809753,"threshold_uncertainty_score":0.022859335},"labels":[],"label_agreement":null},{"id":"W4382318270","doi":"10.1609/aaai.v37i8.26145","title":"Diffusing Gaussian Mixtures for Generating Categorical Data","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Categorical variable; Computer science; Generative grammar; Generative model; Probabilistic logic; Domain (mathematical analysis); Artificial intelligence; Gaussian; Mixture model; Machine learning; Focus (optics); Data mining; Mathematics","score_opus":0.16489061443883313,"score_gpt":0.3306756981985165,"score_spread":0.16578508375968337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382318270","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.015845584,0.00021505736,0.98179907,0.00033119015,0.0000372229,0.00009092676,0.00018859933,0.00064170867,0.00085069856],"genre_scores_gemma":[0.5387798,0.00044185386,0.4561494,0.0003899873,0.000073503805,0.0003718622,0.0012984925,0.00029438277,0.0022007034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980362,0.0009781616,0.000071585506,0.00034645703,0.00047227694,0.00009519222],"domain_scores_gemma":[0.99076194,0.0068219346,0.00045466638,0.0010814706,0.0006387174,0.00024116195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061404514,0.00081723824,0.0008747977,0.0014275782,0.00058596034,0.0016179843,0.0018409202,0.0016170909,0.0026095146],"category_scores_gemma":[0.021135598,0.00052746007,0.0010982335,0.0011458348,0.0016076511,0.0025584043,0.0021732333,0.0028179528,0.00080306095],"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.00024256989,0.000086208165,0.0027136232,0.00015476518,0.000071169,0.000098653196,0.00020786448,0.8177719,0.004880931,0.10747843,0.002354253,0.06393967],"study_design_scores_gemma":[0.000012273041,0.000022373677,0.00015897701,0.000010529502,0.0000050999574,0.000032984986,0.000011656497,0.9734528,0.0016641936,0.024001868,0.00061412685,0.000013133904],"about_ca_topic_score_codex":0.003283158,"about_ca_topic_score_gemma":0.0031577537,"teacher_disagreement_score":0.0061404514,"about_ca_system_score_codex":0.0019457418,"about_ca_system_score_gemma":0.00084910286,"threshold_uncertainty_score":0.03247422},"labels":[],"label_agreement":null},{"id":"W4382318276","doi":"10.1609/aaai.v37i13.26958","title":"Transformer-Based Named Entity Recognition for French Using Adversarial Adaptation to Similar Domain Corpora (Student Abstract)","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Mitacs","keywords":"Named-entity recognition; Computer science; Adversarial system; Transformer; Domain adaptation; Artificial intelligence; Natural language processing; Adaptation (eye); Named entity; Generalization; Engineering; Mathematics","score_opus":0.19473394769154673,"score_gpt":0.33628809076837773,"score_spread":0.141554143076831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382318276","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.122241296,0.00061944214,0.8657774,0.0007060538,0.0001992966,0.00015225628,0.00079614477,0.0060596764,0.0034483923],"genre_scores_gemma":[0.8105492,0.00034611914,0.17560846,0.00054625905,0.00010908419,0.00014710161,0.0042756377,0.00036543733,0.008052728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988803,0.00051229575,0.00003972384,0.00035583918,0.000113711605,0.000098077144],"domain_scores_gemma":[0.99818975,0.0010260855,0.00010393099,0.00039365847,0.00023257457,0.00005404162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002505866,0.0009410658,0.0007793705,0.0008407816,0.0004789161,0.0008037991,0.0011463882,0.001056158,0.0015692395],"category_scores_gemma":[0.0036554427,0.0002683472,0.0011090165,0.0008663825,0.0007458573,0.0015118272,0.0012757618,0.0015573307,0.0011040847],"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.00048650824,0.00024499654,0.003331398,0.00010552395,0.0002670544,0.0005292177,0.00022501698,0.6133045,0.018841272,0.006393769,0.011985185,0.34428552],"study_design_scores_gemma":[0.0000070066576,0.000033672397,0.0004755265,0.0000044714197,0.000012299003,0.000051163028,0.000016834103,0.9918791,0.0048928126,0.0015736246,0.0010400944,0.000013389305],"about_ca_topic_score_codex":0.009994798,"about_ca_topic_score_gemma":0.0099500455,"teacher_disagreement_score":0.009994798,"about_ca_system_score_codex":0.0008162961,"about_ca_system_score_gemma":0.00047453257,"threshold_uncertainty_score":0.019873261},"labels":[],"label_agreement":null},{"id":"W4382318308","doi":"10.1609/aaai.v37i13.26963","title":"Transformer-Based Multi-Hop Question Generation (Student Abstract)","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computer science; Transformer; Language model; Hop (telecommunications); Sentence; Natural language generation; Question answering; Natural language processing; Artificial intelligence; Task (project management); Text generation; Natural language; Telecommunications; Engineering","score_opus":0.16284411487804265,"score_gpt":0.35000643063140036,"score_spread":0.1871623157533577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382318308","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.031977568,0.0010749393,0.927321,0.0009965403,0.0002751591,0.0007047419,0.0026156984,0.030333487,0.004700812],"genre_scores_gemma":[0.4612801,0.00034683058,0.52045417,0.00068264094,0.00012152869,0.00041252602,0.008395587,0.00079096784,0.007515592],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998708,0.00046824547,0.000083640516,0.00046365187,0.00019577054,0.00008065968],"domain_scores_gemma":[0.9971174,0.0017589929,0.00010627851,0.0004992652,0.0003930408,0.00012499737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020742537,0.00085485703,0.00071378786,0.0012283395,0.0003883694,0.0010134846,0.0021536096,0.0016843267,0.007247573],"category_scores_gemma":[0.006505536,0.0003814855,0.0016528197,0.00069857616,0.0006512031,0.0024608744,0.001841155,0.001594445,0.0026859078],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009599385,0.00065200153,0.0042382414,0.0008985084,0.00017198829,0.00088285666,0.000829492,0.16077973,0.023512574,0.025671642,0.052830845,0.72857225],"study_design_scores_gemma":[0.00009609888,0.00013771687,0.00044325288,0.000023576898,0.0000451877,0.00029295022,0.00005187138,0.95916057,0.011068818,0.019426936,0.009230082,0.000022924462],"about_ca_topic_score_codex":0.0042088316,"about_ca_topic_score_gemma":0.0058428324,"teacher_disagreement_score":0.007247573,"about_ca_system_score_codex":0.00097020296,"about_ca_system_score_gemma":0.00096833514,"threshold_uncertainty_score":0.0242455},"labels":[],"label_agreement":null},{"id":"W4382318343","doi":"10.1609/aaai.v37i12.26751","title":"Rethinking Label Refurbishment: Model Robustness under Label Noise","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Robustness (evolution); Generalization; Computer science; Regularization (linguistics); Deep neural networks; Artificial neural network; Artificial intelligence; Noise (video); Machine learning; Pattern recognition (psychology); Mathematics","score_opus":0.1653035614116124,"score_gpt":0.3342900065389262,"score_spread":0.1689864451273138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382318343","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.11637509,0.0009998672,0.87682366,0.0017491056,0.00014566618,0.00012722047,0.00021296543,0.002162491,0.0014040272],"genre_scores_gemma":[0.8227336,0.00039387113,0.17150064,0.0012598762,0.00019056964,0.00019450442,0.0006428421,0.00057472073,0.0025094512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99583626,0.0019087404,0.00017253251,0.0011719407,0.0006197559,0.0002907886],"domain_scores_gemma":[0.9795154,0.012063592,0.0017635033,0.0049292287,0.0012819907,0.00044622566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011464197,0.0019231673,0.0017342947,0.0009829496,0.0012635984,0.0024251968,0.004789218,0.0034762067,0.001334882],"category_scores_gemma":[0.04120133,0.000914296,0.0016766629,0.0007229663,0.0034773727,0.0053435983,0.0044263727,0.0066156816,0.0005593392],"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.0009613781,0.00032224666,0.011673814,0.00022268931,0.0002793131,0.00028398898,0.0008318559,0.80439353,0.00981494,0.027596362,0.004627426,0.13899252],"study_design_scores_gemma":[0.00003667264,0.000049402395,0.00039307115,0.000019781444,0.000017834218,0.00004088383,0.00002433354,0.9783589,0.0019224255,0.018611189,0.0005051359,0.000020322323],"about_ca_topic_score_codex":0.0077183,"about_ca_topic_score_gemma":0.00724839,"teacher_disagreement_score":0.011464197,"about_ca_system_score_codex":0.001827816,"about_ca_system_score_gemma":0.0018395591,"threshold_uncertainty_score":0.06062919},"labels":[],"label_agreement":null},{"id":"W4382318382","doi":"10.1609/aaai.v37i13.26943","title":"Latent Space Evolution under Incremental Learning with Concept Drift (Student Abstract)","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Data Stream Mining Techniques","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":"Université Laval","funders":"","keywords":"Concept drift; Space (punctuation); Computer science; Artificial intelligence; Latent heat; Machine learning; Physics","score_opus":0.061661534585221764,"score_gpt":0.3054133931580255,"score_spread":0.24375185857280374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382318382","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.6016717,0.0002707215,0.3952154,0.00084887334,0.00007431927,0.000050462524,0.00020169363,0.0003569418,0.0013099205],"genre_scores_gemma":[0.9802317,0.000066421606,0.0185217,0.00006609045,0.000029225968,0.000035618563,0.00013727498,0.000034791832,0.0008771568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939513,0.00017853969,0.000024683784,0.00014281062,0.00015343832,0.000105451494],"domain_scores_gemma":[0.99201185,0.004636498,0.0011633633,0.0007746101,0.000987505,0.00042618776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032371231,0.00036911023,0.00062498386,0.0006781924,0.0003482306,0.0010617505,0.0009620012,0.0008684645,0.0013359898],"category_scores_gemma":[0.018978884,0.0003085192,0.0004337582,0.0005944219,0.0010883185,0.0019216924,0.0012763737,0.0013259932,0.00019320894],"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.0005703309,0.00026123627,0.026693216,0.000105918065,0.0001419942,0.0005467943,0.0004297277,0.8046688,0.012956664,0.04913147,0.003160497,0.10133333],"study_design_scores_gemma":[0.000007023395,0.000044326105,0.001238663,0.0000044866083,0.0000058229934,0.000035825036,0.000017125472,0.9871982,0.001279563,0.010036175,0.0001268441,0.0000059342183],"about_ca_topic_score_codex":0.0022374461,"about_ca_topic_score_gemma":0.0017110672,"teacher_disagreement_score":0.0032371231,"about_ca_system_score_codex":0.00096618425,"about_ca_system_score_gemma":0.00059628417,"threshold_uncertainty_score":0.017119765},"labels":[],"label_agreement":null},{"id":"W4382318396","doi":"10.1609/aaai.v37i12.26698","title":"Everyone’s Voice Matters: Quantifying Annotation Disagreement Using Demographic Information","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Annotation; Computer science; Demographics; Variance (accounting); Perspective (graphical); Task (project management); Artificial intelligence; Natural language processing; Politeness; Process (computing); Linguistics; Sociology","score_opus":0.16776989053911234,"score_gpt":0.32880023641771317,"score_spread":0.16103034587860082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382318396","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.8937303,0.00066015613,0.08831621,0.0011804311,0.00017900899,0.0003497455,0.005396165,0.0010551458,0.0091329245],"genre_scores_gemma":[0.95668584,0.00010801083,0.03134607,0.00026118825,0.00011025045,0.00053736055,0.009488451,0.00017361245,0.0012891833],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9876358,0.0074198907,0.0010129721,0.0018387969,0.0017373089,0.000355175],"domain_scores_gemma":[0.92967683,0.049935315,0.0066021187,0.0046570026,0.008156794,0.00097193645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020297136,0.0009490692,0.000671521,0.0027799124,0.0018555357,0.0018431662,0.0011158984,0.0016502568,0.0011195238],"category_scores_gemma":[0.07717023,0.00036938745,0.0005632956,0.0021728603,0.0009947806,0.0035002755,0.0024815449,0.0014858511,0.0008994301],"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.0022606498,0.0007818303,0.74649644,0.00076637603,0.00042670366,0.0003680426,0.017860522,0.03340018,0.013486309,0.009139551,0.02054522,0.15446821],"study_design_scores_gemma":[0.0002243826,0.00045469817,0.4135848,0.00036947156,0.00028380408,0.00062374375,0.011836442,0.4794059,0.024502853,0.036066487,0.032284614,0.00036284918],"about_ca_topic_score_codex":0.0048962063,"about_ca_topic_score_gemma":0.0061719334,"teacher_disagreement_score":0.020297136,"about_ca_system_score_codex":0.0012737712,"about_ca_system_score_gemma":0.0008947938,"threshold_uncertainty_score":0.10734284},"labels":[],"label_agreement":null},{"id":"W4382318399","doi":"10.1609/aaai.v37i13.27071","title":"Augmenting Flight Training with AI to Efficiently Train Pilots","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta; Alberta Machine Intelligence Institute; Compute Canada; Mitacs; Canadian Institute for Advanced Research","keywords":"Trainer; Formative assessment; Focus (optics); Computer science; Aeronautics; Flight training; Training (meteorology); Simulation; Flight simulator; Human–computer interaction; Multimedia; Engineering; Psychology; Mathematics education","score_opus":0.09997352605775058,"score_gpt":0.2982907249150196,"score_spread":0.19831719885726906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382318399","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.22649115,0.00021917446,0.7432116,0.0010068922,0.00009294114,0.00040917468,0.00007450452,0.007866396,0.02062813],"genre_scores_gemma":[0.6786929,0.0001379422,0.3167684,0.00015616238,0.000027490292,0.00018351794,0.000088486224,0.000083888845,0.003861223],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995747,0.00016614063,0.000019602334,0.0000867682,0.00010098874,0.00005161981],"domain_scores_gemma":[0.9986027,0.00071644824,0.000115891075,0.00021067497,0.00024725034,0.000107009015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007044493,0.00052250514,0.0002546614,0.0003369223,0.0002734689,0.0006030931,0.00091138546,0.0006249796,0.0032312446],"category_scores_gemma":[0.0037685453,0.00030316843,0.00015703896,0.00016727383,0.00040130637,0.0009772577,0.0009581219,0.000728108,0.00087634404],"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.00035878585,0.0015857195,0.0064620674,0.000278588,0.00004292678,0.00027697446,0.0013804103,0.16876124,0.08397229,0.0063257646,0.0039457604,0.72660947],"study_design_scores_gemma":[0.00010119633,0.0010594534,0.0035672989,0.0000733525,0.000050834657,0.00023660148,0.0003183176,0.9185922,0.042778905,0.0065186587,0.026658267,0.000044940643],"about_ca_topic_score_codex":0.0025588474,"about_ca_topic_score_gemma":0.0031502156,"teacher_disagreement_score":0.0032312446,"about_ca_system_score_codex":0.0003107278,"about_ca_system_score_gemma":0.00081054907,"threshold_uncertainty_score":0.01080966},"labels":[],"label_agreement":null},{"id":"W4382318400","doi":"10.1609/aaai.v37i12.26667","title":"Walkability Optimization: Formulations, Algorithms, and a Case Study of Toronto","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Urban Transport and Accessibility","field":"Social Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Walkability; Zoning; Constraint (computer-aided design); Computer science; Land use; Scale (ratio); Transport engineering; Built environment; Geography; Mathematics; Civil engineering; Engineering","score_opus":0.1125531167849433,"score_gpt":0.3673743098274609,"score_spread":0.2548211930425176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382318400","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.7442479,0.004911314,0.11363032,0.003407142,0.00014921503,0.00081813993,0.004053728,0.00041343528,0.12836874],"genre_scores_gemma":[0.93375725,0.0018045732,0.049044546,0.00012338611,0.00002738147,0.00017937583,0.0014915,0.00006341816,0.013508632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959606,0.00012479062,0.00001440079,0.000054905126,0.0000742401,0.00013564082],"domain_scores_gemma":[0.999236,0.00044991905,0.000051203286,0.000032767784,0.00011974248,0.00011035687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052142603,0.001148599,0.00046699494,0.00057128817,0.001569611,0.0014084625,0.0011431006,0.0014872284,0.00521919],"category_scores_gemma":[0.0014963292,0.00031419165,0.00077609514,0.002249439,0.0011704816,0.0007198694,0.00089362013,0.0008774548,0.00021196701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010694646,0.00018121142,0.0038528882,0.00022013935,0.000036780875,0.0012252111,0.00024617199,0.94291687,0.00061815965,0.028863894,0.0069300253,0.014801702],"study_design_scores_gemma":[0.00007798563,0.00009346911,0.0037431547,0.00006652244,0.000034110974,0.00013337104,0.0010098505,0.9764292,0.00059730356,0.008179869,0.009605239,0.000029876632],"about_ca_topic_score_codex":0.7213129,"about_ca_topic_score_gemma":0.7985446,"teacher_disagreement_score":0.27868712,"about_ca_system_score_codex":0.012526433,"about_ca_system_score_gemma":0.0055796793,"threshold_uncertainty_score":0.56065667},"labels":[],"label_agreement":null},{"id":"W4382318486","doi":"10.1609/aaai.v37i13.26941","title":"Robust Training for AC-OPF (Student Abstract)","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Power System Reliability and Maintenance","field":"Engineering","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 Waterloo","funders":"","keywords":"Computer science; Univariate; Artificial neural network; Power flow; Training (meteorology); Training set; Machine learning; Multivariate statistics; Test data; Electric power system; Artificial intelligence; Mathematical optimization; Power (physics); Mathematics","score_opus":0.16946928669712757,"score_gpt":0.30517435312790936,"score_spread":0.13570506643078178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382318486","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.023669882,0.000343253,0.9706674,0.00025526475,0.00005712487,0.00004154429,0.00007774451,0.0015212953,0.0033664312],"genre_scores_gemma":[0.74943197,0.00019019184,0.2454516,0.00012617165,0.00007723126,0.00014880371,0.00031605773,0.00030033645,0.0039577684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994649,0.00015962281,0.000025888898,0.00014454519,0.00015618454,0.00004883337],"domain_scores_gemma":[0.9975695,0.0015057727,0.00016783849,0.0002593098,0.00044826,0.000049348608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014840234,0.00068904296,0.0005937435,0.00046178763,0.00032076644,0.00057157193,0.0009076608,0.0007938267,0.004562149],"category_scores_gemma":[0.007565636,0.00041911876,0.00044076148,0.00045215528,0.0004178215,0.00084411865,0.0007067059,0.0013794315,0.0008670445],"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.000093144634,0.000048636262,0.00072309765,0.00004856952,0.000030437044,0.000039467614,0.000026534373,0.85716945,0.002654489,0.0029703986,0.0017514441,0.13444428],"study_design_scores_gemma":[0.0000020938564,0.000010950306,0.000089822606,0.0000024622955,0.0000014633277,0.000004669693,0.0000014509158,0.9981353,0.00081449107,0.0007307925,0.00020470211,0.0000017328858],"about_ca_topic_score_codex":0.007907988,"about_ca_topic_score_gemma":0.0057811835,"teacher_disagreement_score":0.007907988,"about_ca_system_score_codex":0.0006652387,"about_ca_system_score_gemma":0.000691705,"threshold_uncertainty_score":0.015723944},"labels":[],"label_agreement":null},{"id":"W4382318539","doi":"10.1609/aaai.v37i13.26994","title":"A Highly Efficient Marine Mammals Classifier Based on a Cross-Covariance Attended Compact Feed-Forward Sequential Memory Network (Student Abstract)","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Identification and Quantification in Food","field":"Biochemistry, Genetics and Molecular Biology","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 British Columbia","funders":"","keywords":"Harm; Computer science; Classifier (UML); Marine ecosystem; Covariance; Livelihood; Artificial intelligence; Sonar; Machine learning; Convolutional neural network; Ecosystem; Ecology; Psychology; Mathematics; Biology; Statistics","score_opus":0.07448702800661255,"score_gpt":0.3426804481530056,"score_spread":0.268193420146393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382318539","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.2034432,0.0007307322,0.787846,0.00037085658,0.00028618233,0.00010834401,0.00025545785,0.0021835899,0.004775584],"genre_scores_gemma":[0.79982936,0.00021987807,0.18741116,0.0003109389,0.000092651564,0.000095806754,0.00055696326,0.000035185218,0.011448085],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998996,0.000009668864,0.000005384536,0.00003590412,0.000025442452,0.000024020068],"domain_scores_gemma":[0.99985754,0.000032083386,0.000012005377,0.000014232314,0.000069709095,0.000014404036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035880794,0.00050209236,0.00040793343,0.00033120188,0.0002708332,0.00040104767,0.0011049323,0.0006107978,0.0024919512],"category_scores_gemma":[0.00046623102,0.00018523088,0.00029068362,0.000273318,0.00021368414,0.0005931205,0.00041988137,0.00048847345,0.00068112795],"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.0005083546,0.0003173649,0.003606645,0.000070409034,0.00012489129,0.00015730897,0.000042972915,0.10039789,0.058875903,0.0023754477,0.005171197,0.8283517],"study_design_scores_gemma":[0.000017308106,0.00015164021,0.00084158365,0.000007652569,0.00002643282,0.000064600674,0.00001061742,0.9809884,0.016381705,0.00058852416,0.00091223407,0.000009335706],"about_ca_topic_score_codex":0.0065635904,"about_ca_topic_score_gemma":0.011221962,"teacher_disagreement_score":0.0065635904,"about_ca_system_score_codex":0.0003887828,"about_ca_system_score_gemma":0.0006157045,"threshold_uncertainty_score":0.013050795},"labels":[],"label_agreement":null},{"id":"W4382318552","doi":"10.1609/aaai.v37i11.26610","title":"Identify Event Causality with Knowledge and Analogy","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Canadian Institute for Advanced Research","keywords":"Analogy; Causality (physics); Computer science; Generalizability theory; Event (particle physics); Identification (biology); Artificial intelligence; Benchmark (surveying); Natural language processing; Sample (material); Machine learning; Data science; Epistemology; Mathematics; Statistics","score_opus":0.10856056689780202,"score_gpt":0.34402306486904427,"score_spread":0.23546249797124225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382318552","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.10616073,0.0053819474,0.85961384,0.0025738312,0.00038624022,0.00048136516,0.004882681,0.0063380343,0.014181287],"genre_scores_gemma":[0.76194465,0.0025099774,0.21507555,0.0007499836,0.00034973616,0.00035790293,0.011274753,0.00025321293,0.0074842884],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898213,0.0002067305,0.00008127431,0.00045530268,0.00020081637,0.00007384036],"domain_scores_gemma":[0.9972524,0.0018392381,0.00025757015,0.000310346,0.00026150554,0.00007890427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012029444,0.0015385814,0.00082490884,0.006205455,0.0008135751,0.0015208864,0.0020215656,0.001963779,0.004201444],"category_scores_gemma":[0.0068874853,0.00054272375,0.0018603278,0.0030146854,0.00091151224,0.0065898965,0.0020727601,0.0023540044,0.0013084979],"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.0006176695,0.000637858,0.020552946,0.00097339024,0.00039432477,0.0018382148,0.00079829985,0.1890496,0.004611815,0.053738806,0.030033218,0.6967539],"study_design_scores_gemma":[0.00005019902,0.0000715953,0.0029040086,0.00012174624,0.00012542738,0.00037526028,0.0001964897,0.87736475,0.002203946,0.10150208,0.015041199,0.000043336786],"about_ca_topic_score_codex":0.007667543,"about_ca_topic_score_gemma":0.010101672,"teacher_disagreement_score":0.007667543,"about_ca_system_score_codex":0.0012677298,"about_ca_system_score_gemma":0.0016384231,"threshold_uncertainty_score":0.015245795},"labels":[],"label_agreement":null},{"id":"W4382318681","doi":"10.1609/aaai.v37i13.26810","title":"Recent Developments in Data-Driven Algorithms for Discrete Optimization","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Data Classification","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":"Heuristics; Algorithm; Computer science; Integer programming; Heuristic; Suite; Mathematical optimization; Artificial intelligence; Machine learning; Mathematics","score_opus":0.19927631671507248,"score_gpt":0.36832322605371776,"score_spread":0.16904690933864527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382318681","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075891585,0.012835127,0.97410595,0.0017774093,0.00047198162,0.000054645716,0.00015382394,0.00054264127,0.009299415],"genre_scores_gemma":[0.075159736,0.031358454,0.8760072,0.0025113754,0.0023944932,0.0006206109,0.0012224708,0.0011561292,0.00956961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954548,0.001475598,0.0002991311,0.0009123918,0.0016986928,0.00015937841],"domain_scores_gemma":[0.9868549,0.009929632,0.0004483116,0.001281419,0.0012373789,0.00024840346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046009272,0.0025275226,0.0026049998,0.0015901021,0.00063507893,0.004198921,0.003754975,0.0023022878,0.0099569205],"category_scores_gemma":[0.01972425,0.0013571817,0.0025892952,0.0031360548,0.0021672195,0.003790424,0.0035952437,0.008310778,0.005225167],"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.0001696307,0.00019560604,0.0009603591,0.0015158275,0.00021619686,0.000112658105,0.00019196855,0.26244572,0.0009426023,0.4545376,0.013770466,0.26494148],"study_design_scores_gemma":[0.000057685058,0.00005070677,0.00016107557,0.00024737077,0.00003565813,0.00007488303,0.00003394488,0.6482089,0.0006560186,0.28092,0.069511555,0.00004226648],"about_ca_topic_score_codex":0.003894275,"about_ca_topic_score_gemma":0.0031867402,"teacher_disagreement_score":0.0099569205,"about_ca_system_score_codex":0.002272562,"about_ca_system_score_gemma":0.0024825567,"threshold_uncertainty_score":0.03330922},"labels":[],"label_agreement":null},{"id":"W4382318688","doi":"10.1609/aaai.v37i12.26650","title":"On the Challenges of Using Reinforcement Learning in Precision Drug Dosing: Delay and Prolongedness of Action Effects","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Receptor Mechanisms and Signaling","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Institut de Valorisation des Données","keywords":"Partially observable Markov decision process; Reinforcement learning; Markov decision process; Computer science; Dosing; Action (physics); Markov chain; Task (project management); Markov process; Artificial intelligence; Baseline (sea); Machine learning; Markov model; Medicine; Pharmacology; Mathematics; Biology","score_opus":0.07934898163826612,"score_gpt":0.31132576034773424,"score_spread":0.23197677870946812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382318688","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.02614199,0.00074375205,0.96902376,0.0010898298,0.000053149077,0.000053351807,0.00004865401,0.00040420558,0.0024413662],"genre_scores_gemma":[0.8711298,0.00053713616,0.12589228,0.0004168001,0.00007246009,0.00008783489,0.00005554002,0.00007379607,0.0017343055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991253,0.00034740215,0.00005540514,0.00022195179,0.00017813777,0.00007176949],"domain_scores_gemma":[0.9951716,0.003691366,0.00045592585,0.0002926732,0.00023284837,0.0001555973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002430322,0.0008450405,0.0011073501,0.00025080008,0.00038867255,0.0009928647,0.001088791,0.0012591993,0.0015845025],"category_scores_gemma":[0.007133449,0.0004316276,0.00056430214,0.0003561993,0.0014180655,0.0016064522,0.0010299466,0.0023974103,0.00020669604],"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.00011323402,0.00006457629,0.00060519297,0.000120345976,0.00004620657,0.00008329582,0.00006909556,0.9296833,0.0025459805,0.017721428,0.00063411065,0.04831317],"study_design_scores_gemma":[0.000027366126,0.00008376271,0.00016918968,0.000014742532,0.000013121398,0.000036488218,0.000012682172,0.97893906,0.0010174996,0.018899878,0.00077508925,0.000011205167],"about_ca_topic_score_codex":0.006015356,"about_ca_topic_score_gemma":0.004296019,"teacher_disagreement_score":0.006015356,"about_ca_system_score_codex":0.0010618996,"about_ca_system_score_gemma":0.0023465413,"threshold_uncertainty_score":0.012852907},"labels":[],"label_agreement":null},{"id":"W4382318719","doi":"10.1609/aaai.v37i12.26737","title":"Redactor: A Data-Centric and Individualized Defense against Inference Attacks","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Samsung; Ministry of Science and ICT, South Korea; National Research Foundation of Korea; National Research Foundation","keywords":"Computer science; Inference; Machine learning; Artificial intelligence; Process (computing); SAFER; Probabilistic logic; Mistake; Information leakage; Data mining; Private information retrieval; Computer security","score_opus":0.13448805924779417,"score_gpt":0.35398669900702107,"score_spread":0.2194986397592269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382318719","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.011133209,0.00030561088,0.97988325,0.0008821059,0.00011383656,0.00011783405,0.00014796568,0.004948579,0.002467563],"genre_scores_gemma":[0.50945836,0.0003340443,0.47865355,0.0019233275,0.0003170146,0.00027783107,0.00083453837,0.0008384277,0.0073629776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9915455,0.002454144,0.00031997036,0.0016784631,0.003364705,0.00063721393],"domain_scores_gemma":[0.98167795,0.0058287084,0.001625966,0.008814397,0.001493264,0.00055970356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008580742,0.0017342237,0.002063299,0.0020674455,0.0014345169,0.0031207188,0.005015669,0.0038427336,0.0025505375],"category_scores_gemma":[0.024559896,0.001003532,0.0017541217,0.0011307762,0.0028198627,0.006440113,0.009562231,0.0066568945,0.0021422796],"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.0013561503,0.00066458277,0.0053431545,0.00024053665,0.00036444844,0.00049574394,0.00060190517,0.30898914,0.032145385,0.12616342,0.033070706,0.4905648],"study_design_scores_gemma":[0.000044401404,0.00013680705,0.0003459471,0.000026022777,0.000031240852,0.000228281,0.000042425327,0.94141245,0.010067097,0.042708065,0.004919116,0.00003819556],"about_ca_topic_score_codex":0.0012904751,"about_ca_topic_score_gemma":0.0014101638,"teacher_disagreement_score":0.008580742,"about_ca_system_score_codex":0.0016098821,"about_ca_system_score_gemma":0.0022442343,"threshold_uncertainty_score":0.045379877},"labels":[],"label_agreement":null},{"id":"W4382318739","doi":"10.1609/aaai.v37i12.26684","title":"Neighbor Auto-Grouping Graph Neural Networks for Handover Parameter Configuration in Cellular Network","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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; University of Alberta","funders":"","keywords":"Handover; Computer science; Cellular network; Network performance; Key (lock); Graph; Distributed computing; Artificial intelligence; Machine learning; Theoretical computer science; Computer network","score_opus":0.04674955456329356,"score_gpt":0.26388443109024445,"score_spread":0.2171348765269509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382318739","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.14453702,0.0010907721,0.8484276,0.00061905244,0.00008578147,0.00005857838,0.00013290707,0.0011163962,0.0039318907],"genre_scores_gemma":[0.9658621,0.00019004615,0.03180116,0.00011942976,0.000024087276,0.000044658253,0.00014702964,0.000041245297,0.0017702657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997707,0.0000580765,0.000010081429,0.00006614069,0.000042929118,0.000052097337],"domain_scores_gemma":[0.99962044,0.00017553789,0.000064992826,0.000029884315,0.00008204776,0.000027102216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054198987,0.0008310311,0.00061474286,0.0004486788,0.00035392365,0.00045692245,0.0010359657,0.0009139068,0.0010405579],"category_scores_gemma":[0.0016011335,0.00034930004,0.00041543655,0.00047085586,0.0006204058,0.0008050803,0.00065227516,0.0009109721,0.00014962154],"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.000025247664,0.000017961473,0.0005540216,0.000012316704,0.000013179851,0.000019360898,0.00001603181,0.9833628,0.0005259965,0.0010404338,0.00030144636,0.014111149],"study_design_scores_gemma":[0.0000012489846,0.0000050580798,0.000066199544,9.3996414e-7,0.0000024318347,0.000002287532,0.0000016320712,0.99921274,0.00009700959,0.00057277246,0.000036490103,0.0000012015366],"about_ca_topic_score_codex":0.018121673,"about_ca_topic_score_gemma":0.017310102,"teacher_disagreement_score":0.018121673,"about_ca_system_score_codex":0.0011699053,"about_ca_system_score_gemma":0.00077372993,"threshold_uncertainty_score":0.03603238},"labels":[],"label_agreement":null},{"id":"W4382318834","doi":"10.1609/aaai.v37i10.26469","title":"Analyzing and Improving the Use of the FastMap Embedding in Pathfinding Tasks","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Heuristics; Embedding; Pathfinding; Heuristic; Metric (unit); Computer science; Theoretical computer science; Algorithm; Mathematics; Mathematical optimization; Artificial intelligence; Engineering","score_opus":0.10650877129967634,"score_gpt":0.2899347732696123,"score_spread":0.18342600196993597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382318834","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.15068495,0.0007744827,0.84233475,0.00040049484,0.000072206625,0.00013764898,0.00010501083,0.0011764885,0.0043139826],"genre_scores_gemma":[0.54939806,0.0004350261,0.44779283,0.00009625925,0.000030466505,0.00014904873,0.0002755985,0.00022422438,0.0015984885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99777055,0.0010485278,0.000108629894,0.0003754985,0.00044682052,0.0002500286],"domain_scores_gemma":[0.98950607,0.0072277216,0.0005784325,0.0014081344,0.0009979873,0.00028155028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002724638,0.0013042438,0.0010961525,0.0010845559,0.000933437,0.0019506299,0.0022711891,0.0018876394,0.0021926842],"category_scores_gemma":[0.022323897,0.00082445185,0.0006880993,0.0015430445,0.0011989813,0.0075663943,0.0028248685,0.0013804421,0.00057109544],"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.00036216655,0.00033093704,0.0026613765,0.0002818703,0.00009408441,0.0001358021,0.00048889266,0.6526567,0.0035295591,0.029270211,0.0024880534,0.30770034],"study_design_scores_gemma":[0.000024266013,0.00012672343,0.00035034772,0.000015359785,0.000020057023,0.000062435356,0.00011813657,0.98017544,0.0021081464,0.015764138,0.0012183735,0.000016533235],"about_ca_topic_score_codex":0.004771641,"about_ca_topic_score_gemma":0.004894025,"teacher_disagreement_score":0.004771641,"about_ca_system_score_codex":0.0011271089,"about_ca_system_score_gemma":0.0017232365,"threshold_uncertainty_score":0.014409423},"labels":[],"label_agreement":null},{"id":"W4382318960","doi":"10.1609/aaai.v37i12.26706","title":"Deep Learning on a Healthy Data Diet: Finding Important Examples for Fairness","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; McGill University; Polytechnique Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Counterfactual thinking; Spurious relationship; Computer science; Offensive; Machine learning; Pruning; Artificial intelligence; Odds; Equity (law); Tobit model; Focus (optics); Classifier (UML); Random forest; Psychology; Social psychology; Logistic regression; Mathematics; Operations research","score_opus":0.2653499557703358,"score_gpt":0.365566261370321,"score_spread":0.10021630559998518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382318960","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.32347217,0.0012717736,0.65927434,0.008306779,0.00027678793,0.00016431815,0.0007763902,0.00083222246,0.005625227],"genre_scores_gemma":[0.83984417,0.00023475541,0.15396209,0.0016016717,0.00019406047,0.00016365344,0.0011806015,0.00015700006,0.0026620368],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99508166,0.0028238615,0.00021811406,0.0009509493,0.00070286513,0.000222573],"domain_scores_gemma":[0.9798055,0.014019847,0.00087877444,0.0035819102,0.0012533402,0.00046064227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012770016,0.0007706379,0.0012956428,0.0009615591,0.001658178,0.002429106,0.0020867744,0.002009709,0.0022270267],"category_scores_gemma":[0.040299326,0.0005531681,0.0006889307,0.00087350165,0.0026917716,0.004543933,0.0033944792,0.003646202,0.0005139435],"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.0030539152,0.00097653124,0.07938587,0.00055121817,0.00042756414,0.0008941192,0.0018683804,0.2529038,0.0078079454,0.10950506,0.027653165,0.51497245],"study_design_scores_gemma":[0.000068705645,0.000106104206,0.002595392,0.00011694795,0.00004825272,0.00011206111,0.00025463276,0.860797,0.0039428123,0.12676622,0.0051683257,0.000023561393],"about_ca_topic_score_codex":0.0018010477,"about_ca_topic_score_gemma":0.00346343,"teacher_disagreement_score":0.012770016,"about_ca_system_score_codex":0.0011377762,"about_ca_system_score_gemma":0.00139901,"threshold_uncertainty_score":0.0675351},"labels":[],"label_agreement":null},{"id":"W4382318976","doi":"10.1609/aaai.v37i9.26238","title":"MetaZSCIL: A Meta-Learning Approach for Generalized Zero-Shot Class Incremental Learning","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Fundamental Research Funds for the Central Universities; China Postdoctoral Science Foundation; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Meta learning (computer science); Forgetting; Computer science; Artificial intelligence; Machine learning; Class (philosophy); Task (project management); Feature (linguistics); Process (computing); Generative grammar; Sample (material); Adaptation (eye); Engineering","score_opus":0.230948496481997,"score_gpt":0.3343297526525874,"score_spread":0.10338125617059041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382318976","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.019769,0.00081809936,0.9712407,0.00030376125,0.00009362213,0.00017806,0.0002804886,0.005414046,0.0019020629],"genre_scores_gemma":[0.59984964,0.00048306142,0.38982254,0.00093834574,0.00016821222,0.0005541338,0.0020504722,0.00071824464,0.0054154308],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988147,0.00023942246,0.000054661505,0.00045810727,0.00027437933,0.0001587966],"domain_scores_gemma":[0.99814343,0.0007796544,0.00014654372,0.00045682443,0.00033539557,0.00013806559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018799503,0.0019523556,0.0020759068,0.0015759966,0.0006625215,0.001525052,0.007964134,0.0023703463,0.003220102],"category_scores_gemma":[0.005078095,0.0011013189,0.0015086146,0.0013021388,0.0013672997,0.0034878517,0.0032523908,0.0030176148,0.0011468497],"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.00029313666,0.00042507506,0.003232199,0.00031431793,0.00027581968,0.00024451595,0.0002814998,0.4518659,0.008857517,0.009248217,0.008903802,0.5160579],"study_design_scores_gemma":[0.000012774751,0.000051486957,0.00014020293,0.000009934725,0.000020858335,0.000029152929,0.000013541011,0.99162185,0.0016580577,0.0057232403,0.00070794916,0.0000110025085],"about_ca_topic_score_codex":0.006703641,"about_ca_topic_score_gemma":0.011794688,"teacher_disagreement_score":0.007964134,"about_ca_system_score_codex":0.001921761,"about_ca_system_score_gemma":0.0017990926,"threshold_uncertainty_score":0.013943374},"labels":[],"label_agreement":null},{"id":"W4382449344","doi":"10.1609/aaai.v37i7.25968","title":"Confidence-Aware Training of Smoothed Classifiers for Certified Robustness","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","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":"Kootenay Association for Science & Technology","funders":"Defense Acquisition Program Administration; Agency for Defense Development","keywords":"Computer science; Robustness (evolution); Smoothing; Classifier (UML); Artificial intelligence; Machine learning; Gaussian; Adversarial system; Pattern recognition (psychology); Computer vision","score_opus":0.18571410764410629,"score_gpt":0.33755705963724886,"score_spread":0.15184295199314257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382449344","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.02176566,0.0001909446,0.9742347,0.00035999116,0.00006398882,0.000059190254,0.00008674844,0.001768951,0.0014698175],"genre_scores_gemma":[0.7435962,0.00018556273,0.2509424,0.0006374378,0.00019678612,0.00021727671,0.0005886086,0.0005825847,0.0030531257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960226,0.0010416666,0.0002385265,0.001015751,0.001283158,0.00039828397],"domain_scores_gemma":[0.9819385,0.009918015,0.0015713274,0.0038639691,0.0021137386,0.0005945397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052781957,0.001201398,0.0015520037,0.00094310514,0.00080907566,0.0017665313,0.0024677352,0.0024322616,0.002734612],"category_scores_gemma":[0.03865501,0.0007020266,0.0010545201,0.00061705924,0.002403788,0.0029968682,0.0036072533,0.0042127264,0.0013453793],"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.000462926,0.000128938,0.0039857957,0.00016199957,0.00011155558,0.00016478248,0.00025362402,0.76163965,0.015705165,0.04120142,0.0061365785,0.17004752],"study_design_scores_gemma":[0.000013782313,0.000047458532,0.00026288608,0.00001793171,0.000010265017,0.000045727953,0.000012313275,0.98112595,0.0045923395,0.013127261,0.00073162455,0.000012493924],"about_ca_topic_score_codex":0.001975636,"about_ca_topic_score_gemma":0.0024424663,"teacher_disagreement_score":0.0052781957,"about_ca_system_score_codex":0.0016736377,"about_ca_system_score_gemma":0.002317135,"threshold_uncertainty_score":0.027914107},"labels":[],"label_agreement":null},{"id":"W4382450003","doi":"10.1609/aaai.v37i1.25202","title":"Pixel-Wise Warping for Deep Image Stitching","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Ministry of Science and ICT, South Korea; National Research Foundation of Korea; National Research Foundation","keywords":"Image warping; Image stitching; Artificial intelligence; Computer vision; Homography; Computer science; Pixel; Parallax; Mathematics","score_opus":0.09120065884705537,"score_gpt":0.34740557020577756,"score_spread":0.2562049113587222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382450003","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.019606365,0.00033573,0.97704417,0.000052401734,0.000027647002,0.00004177938,0.00008377464,0.0019556084,0.0008526429],"genre_scores_gemma":[0.30445626,0.0005013282,0.69081074,0.00013718534,0.000045290126,0.00010665192,0.00073992927,0.00035892567,0.0028436743],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997112,0.000036052184,0.000014424663,0.00007950659,0.0001221456,0.00003662841],"domain_scores_gemma":[0.9996063,0.00010241078,0.00005965256,0.00013411437,0.00007034986,0.000027213382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004697942,0.0009458232,0.00059555715,0.0008083686,0.00023079703,0.00042912317,0.0012361929,0.000907765,0.0025432294],"category_scores_gemma":[0.0012645393,0.00052629894,0.0006777175,0.0008141277,0.00052126776,0.001193356,0.000902801,0.0016763452,0.0008026646],"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.00017673995,0.00008502248,0.00057606585,0.00015530128,0.000084805615,0.00014127202,0.000109573746,0.24616037,0.09970581,0.0061111194,0.002813829,0.6438801],"study_design_scores_gemma":[0.0000074156096,0.000064602704,0.00028682084,0.0000074342192,0.000010085546,0.000091053866,0.000011365881,0.96161795,0.03243601,0.0035086637,0.0019471016,0.000011456794],"about_ca_topic_score_codex":0.001953509,"about_ca_topic_score_gemma":0.0027921319,"teacher_disagreement_score":0.0025432294,"about_ca_system_score_codex":0.0004733875,"about_ca_system_score_gemma":0.0005286973,"threshold_uncertainty_score":0.008507967},"labels":[],"label_agreement":null},{"id":"W4382457524","doi":"10.1609/aaai.v37i1.25150","title":"RankDNN: Learning to Rank for Few-Shot Learning","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Science and Technology Commission of Shanghai Municipality; Fudan University","keywords":"Computer science; Ranking (information retrieval); Artificial intelligence; Learning to rank; Ranking SVM; Artificial neural network; Pipeline (software); Pattern recognition (psychology); Benchmark (surveying); Feature (linguistics); Machine learning; Rank (graph theory); Margin (machine learning); Domain (mathematical analysis); Similarity (geometry); Deep learning; Image (mathematics); Mathematics","score_opus":0.1333800895186134,"score_gpt":0.33416931476963424,"score_spread":0.20078922525102083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382457524","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.016130367,0.002040794,0.9615345,0.00043891458,0.000364394,0.00034725672,0.0020013922,0.012796382,0.004345909],"genre_scores_gemma":[0.32333955,0.0013886839,0.6365865,0.0015006706,0.0005164287,0.0007822272,0.013747676,0.0014565667,0.020681774],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985077,0.00027216508,0.00009416535,0.00050945836,0.00044239362,0.00017413333],"domain_scores_gemma":[0.9983707,0.00051521213,0.00012596189,0.00043875215,0.00040453929,0.00014487964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018270044,0.0021917848,0.0022463303,0.0019974846,0.0008644591,0.0019096297,0.0049578818,0.0022855557,0.008358046],"category_scores_gemma":[0.007374166,0.0009170635,0.0011336321,0.0015352943,0.00093375857,0.004076856,0.0025958898,0.003229605,0.0046655345],"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.000470894,0.00042188235,0.0023648927,0.0005190907,0.00020737502,0.00015577377,0.00011818139,0.09839203,0.006169274,0.01261083,0.04702151,0.83154815],"study_design_scores_gemma":[0.00004935998,0.00012900922,0.0003634093,0.00003665202,0.000034303794,0.000094868126,0.000033430464,0.97210735,0.004082028,0.017894011,0.005140147,0.000035399396],"about_ca_topic_score_codex":0.011248495,"about_ca_topic_score_gemma":0.018086363,"teacher_disagreement_score":0.011248495,"about_ca_system_score_codex":0.0017524685,"about_ca_system_score_gemma":0.0022860952,"threshold_uncertainty_score":0.02796042},"labels":[],"label_agreement":null},{"id":"W4382458079","doi":"10.1609/aaai.v37i1.25193","title":"Bidirectional Domain Mixup for Domain Adaptive Semantic Segmentation","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","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":"Kootenay Association for Science & Technology","funders":"Ministry of Science and ICT, South Korea; National Research Foundation of Korea; National Research Foundation","keywords":"Computer science; Segmentation; Domain (mathematical analysis); Task (project management); Context (archaeology); Generalization; Artificial intelligence; Domain adaptation; Class (philosophy); Adaptation (eye); Code (set theory); Pattern recognition (psychology); Machine learning; Mathematics; Geography","score_opus":0.10056096458046826,"score_gpt":0.3156389768482556,"score_spread":0.21507801226778733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382458079","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.023519931,0.000329316,0.9675894,0.00019442622,0.00007242742,0.0000824063,0.0002253558,0.0058872886,0.0020995056],"genre_scores_gemma":[0.4543956,0.0003481385,0.53553796,0.0006355646,0.00009024167,0.00029226844,0.0018065571,0.0015138551,0.0053797676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925786,0.00018307996,0.000030717354,0.00029885376,0.00013417377,0.00009530147],"domain_scores_gemma":[0.9988463,0.0004117006,0.000061242754,0.00042608593,0.00016732677,0.00008742453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015451646,0.0015887755,0.0009073235,0.0009675997,0.0005719499,0.0014052673,0.002181676,0.0015663957,0.004006016],"category_scores_gemma":[0.003565818,0.0007035,0.0012685601,0.00086703995,0.0012092936,0.0028200506,0.003652492,0.0031901728,0.002444454],"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.00059889886,0.00041487222,0.0035192294,0.00026145444,0.00018639195,0.00034143435,0.0006032951,0.28450903,0.081367776,0.022304637,0.0125055155,0.5933874],"study_design_scores_gemma":[0.000022420169,0.00005503006,0.00037847084,0.000018034552,0.000022062535,0.000117450094,0.00008579395,0.95016634,0.026393393,0.016581118,0.0061315577,0.000028414333],"about_ca_topic_score_codex":0.0032935839,"about_ca_topic_score_gemma":0.005231844,"teacher_disagreement_score":0.004006016,"about_ca_system_score_codex":0.00097100093,"about_ca_system_score_gemma":0.0011092863,"threshold_uncertainty_score":0.013401508},"labels":[],"label_agreement":null},{"id":"W4382458246","doi":"10.1609/aaai.v37i2.25341","title":"TopicFM: Robust and Interpretable Topic-Assisted Feature Matching","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Image and Video Retrieval Techniques","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":"Kootenay Association for Science & Technology","funders":"National Research Foundation of Korea; Ministry of Trade, Industry and Energy; National Research Foundation","keywords":"Interpretability; Computer science; Discriminative model; Artificial intelligence; ENCODE; Robustness (evolution); Pattern recognition (psychology); Probabilistic logic; Matching (statistics); Feature extraction; Machine learning; Mathematics","score_opus":0.07783017532151877,"score_gpt":0.31344536672352796,"score_spread":0.2356151914020092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382458246","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.007524186,0.00047241923,0.9885633,0.00008773891,0.000041872212,0.000054298664,0.00022916513,0.0025920046,0.00043494164],"genre_scores_gemma":[0.33527735,0.0006785418,0.6555254,0.0004789291,0.00032208714,0.000267402,0.002947943,0.0011313128,0.0033710166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804986,0.0004578235,0.00008211612,0.0007196107,0.00045473877,0.00023594688],"domain_scores_gemma":[0.998367,0.0006200739,0.00017632704,0.0004998075,0.00027739818,0.000059291222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002034605,0.0015173005,0.0020364474,0.0032293764,0.000628161,0.0012941479,0.0037703072,0.002609357,0.0022394324],"category_scores_gemma":[0.0056594224,0.00063732604,0.002174183,0.003381621,0.00086142623,0.0034340888,0.0025458883,0.0016679157,0.0015001241],"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.00044627034,0.00018788136,0.0017459132,0.00021660577,0.00027185658,0.00026353967,0.00025836594,0.096429385,0.020910557,0.012814413,0.013101419,0.8533538],"study_design_scores_gemma":[0.00004794316,0.00006319469,0.0006358664,0.000016809452,0.000044540342,0.0002825111,0.000053812466,0.96759886,0.0074241557,0.020177104,0.0036223426,0.000032844306],"about_ca_topic_score_codex":0.0046856613,"about_ca_topic_score_gemma":0.00470508,"teacher_disagreement_score":0.0046856613,"about_ca_system_score_codex":0.0008637987,"about_ca_system_score_gemma":0.0010666182,"threshold_uncertainty_score":0.0107601285},"labels":[],"label_agreement":null},{"id":"W4382460739","doi":"10.1609/aaai.v37i3.25378","title":"Towards Good Practices for Missing Modality Robust Action Recognition","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Agency for Defense Development","keywords":"Modality (human–computer interaction); Inference; Computer science; Modalities; Artificial intelligence; Missing data; Robustness (evolution); Modal; Machine learning","score_opus":0.3781025488013911,"score_gpt":0.38499307425977664,"score_spread":0.006890525458385532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382460739","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.0029707334,0.0005279785,0.99208415,0.00074099604,0.000035976882,0.00004672733,0.00006004613,0.0028580588,0.00067533733],"genre_scores_gemma":[0.16989176,0.0006687868,0.8253704,0.0005924122,0.00012426153,0.00026975546,0.0005880459,0.00065412413,0.0018404297],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941679,0.002182046,0.00034415416,0.0014178932,0.0015314474,0.00035648618],"domain_scores_gemma":[0.9879566,0.0055422843,0.00055207877,0.003985372,0.001545785,0.00041786133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011878162,0.0022260319,0.0017004658,0.001752788,0.00074531056,0.0026921802,0.007001375,0.004508012,0.0034929386],"category_scores_gemma":[0.02739887,0.0017924297,0.0016516431,0.0009644415,0.0033661646,0.007178798,0.006201039,0.00879716,0.0031512848],"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.00048087165,0.0005965799,0.0016999908,0.0005368479,0.00033179254,0.00023112453,0.00047809305,0.43851656,0.031156726,0.06153459,0.010936716,0.45350003],"study_design_scores_gemma":[0.000025909741,0.000076396645,0.00014221115,0.000053261123,0.00001865447,0.000055224053,0.000046833018,0.93529797,0.010039669,0.051273573,0.0029444194,0.000025937974],"about_ca_topic_score_codex":0.0038234661,"about_ca_topic_score_gemma":0.0055965288,"teacher_disagreement_score":0.011878162,"about_ca_system_score_codex":0.0018858433,"about_ca_system_score_gemma":0.0019365943,"threshold_uncertainty_score":0.06281847},"labels":[],"label_agreement":null},{"id":"W4382461569","doi":"10.1609/aaai.v37i1.25091","title":"Self-Contrastive Learning: Single-Viewed Supervised Contrastive Framework Using Sub-network","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Photoacoustic and Ultrasonic Imaging","field":"Engineering","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":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; Korea Advanced Institute of Science and Technology; SK Hynix","keywords":"Computer science; Artificial intelligence; Encoder; Code (set theory); Exploit; Contrast (vision); Machine learning; Pattern recognition (psychology); Set (abstract data type)","score_opus":0.05175035265957835,"score_gpt":0.26077609341595337,"score_spread":0.20902574075637503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382461569","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.044286147,0.00038979072,0.9483522,0.00034759217,0.00007343631,0.000089277986,0.00014658767,0.0029591185,0.0033557292],"genre_scores_gemma":[0.61187136,0.00023266544,0.37585598,0.0005648088,0.00015105793,0.00024225446,0.00082125206,0.000560041,0.009700682],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994116,0.00016355922,0.000018866698,0.00019325655,0.00014350681,0.00006926141],"domain_scores_gemma":[0.9990238,0.00030047906,0.000084716354,0.00027132433,0.0002451859,0.000074530566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015148261,0.0013989466,0.00093714363,0.0006624382,0.00042922053,0.0009907967,0.0027076334,0.0015937588,0.0025868851],"category_scores_gemma":[0.0026837436,0.00051953335,0.00074499816,0.00040974768,0.0011272363,0.0022587595,0.0018688446,0.0024370817,0.00095049635],"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.00055936415,0.00060317287,0.0032425732,0.00016628491,0.00019206325,0.000225743,0.00021795376,0.44164148,0.034545936,0.024152247,0.009917076,0.48453605],"study_design_scores_gemma":[0.000012773816,0.00006569327,0.00013144888,0.000005408712,0.000009345326,0.00002881079,0.000006947613,0.99023193,0.004302335,0.004541749,0.0006570768,0.0000065344448],"about_ca_topic_score_codex":0.0024759255,"about_ca_topic_score_gemma":0.0044292565,"teacher_disagreement_score":0.0027076334,"about_ca_system_score_codex":0.0010266966,"about_ca_system_score_gemma":0.0009527307,"threshold_uncertainty_score":0.008653939},"labels":[],"label_agreement":null},{"id":"W4382461867","doi":"10.1609/aaai.v37i7.25963","title":"XClusters: Explainability-First Clustering","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Rough Sets and Fuzzy Logic","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":"Kootenay Association for Science & Technology","funders":"Ministry of Science and ICT, South Korea; National Research Foundation of Korea; National Research Foundation","keywords":"Cluster analysis; Correlation clustering; Computer science; Decision tree; CURE data clustering algorithm; Fuzzy clustering; Artificial intelligence; Tree (set theory); Data mining; Pattern recognition (psychology); Mathematics; Machine learning; Combinatorics","score_opus":0.09964842612454315,"score_gpt":0.29374259640743633,"score_spread":0.19409417028289316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382461867","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.024110215,0.00042596486,0.9709665,0.0006795651,0.000057262816,0.00017147574,0.0002949804,0.0017175823,0.0015764579],"genre_scores_gemma":[0.27251565,0.00031595843,0.7194965,0.00048382152,0.00018014025,0.00034740416,0.002230144,0.0009588007,0.0034715496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99674255,0.0011806254,0.00014747989,0.0008820771,0.00079697993,0.0002503815],"domain_scores_gemma":[0.9877622,0.0066946833,0.0012958224,0.0022945195,0.0015611087,0.00039158936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005270816,0.0018235798,0.0021824173,0.0037808497,0.0018974347,0.0028618728,0.003890252,0.0028361024,0.0043284968],"category_scores_gemma":[0.021354504,0.0009794034,0.0019222732,0.0031938732,0.0019542295,0.0036157537,0.0031041026,0.003337462,0.001283275],"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.0006444488,0.00038086882,0.010645159,0.00059229834,0.0005975644,0.00044737832,0.0016068922,0.4038914,0.005039058,0.09771905,0.020723917,0.45771196],"study_design_scores_gemma":[0.000043625663,0.00006641913,0.0009092166,0.000043579297,0.00004381905,0.00011953335,0.00012650235,0.9236136,0.0021285706,0.069632106,0.0032428824,0.000030073314],"about_ca_topic_score_codex":0.0049427254,"about_ca_topic_score_gemma":0.006428812,"teacher_disagreement_score":0.005270816,"about_ca_system_score_codex":0.0020520946,"about_ca_system_score_gemma":0.0019408284,"threshold_uncertainty_score":0.027875006},"labels":[],"label_agreement":null},{"id":"W4382463470","doi":"10.1609/aaai.v37i13.26880","title":"An Analysis of Engineering Students’ Responses to an AI Ethics Scenario","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Ethics and Social Impacts of AI","field":"Social Sciences","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sociotechnical system; Misinformation; Engineering ethics; Computer science; Psychology; Artificial intelligence; Engineering","score_opus":0.21613223646496962,"score_gpt":0.4684465738098873,"score_spread":0.2523143373449177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382463470","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.99790716,0.000012816892,0.00062121596,0.00022478617,0.00001008303,0.00007351805,0.00007760975,0.000009173545,0.0010637284],"genre_scores_gemma":[0.9964251,0.000073418254,0.0012144991,0.00042463758,0.00001290788,0.00034926122,0.00026847472,0.000011077861,0.0012205397],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99180084,0.0048477747,0.0006908625,0.00057430036,0.0012883951,0.0007979183],"domain_scores_gemma":[0.9502589,0.028144633,0.0073805954,0.0016888905,0.009328741,0.0031982765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064035114,0.0003832019,0.00031810414,0.0019708157,0.0013051305,0.0022370876,0.00047936782,0.00146272,0.0020134766],"category_scores_gemma":[0.049894884,0.0003087608,0.00028589304,0.0014779874,0.00091500947,0.00097069755,0.0016215012,0.0015739197,0.0011025608],"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.0004975699,0.0018029986,0.6719976,0.00025887572,0.000087408174,0.00092965434,0.22725627,0.00095530006,0.010927196,0.0012149013,0.005321274,0.07875094],"study_design_scores_gemma":[0.00003934272,0.0015243072,0.5711682,0.0001609623,0.000029641446,0.00062796177,0.39953974,0.004145544,0.004430598,0.0008986836,0.017309466,0.00012555666],"about_ca_topic_score_codex":0.0012758431,"about_ca_topic_score_gemma":0.0018952298,"teacher_disagreement_score":0.0064035114,"about_ca_system_score_codex":0.0009681281,"about_ca_system_score_gemma":0.00095540826,"threshold_uncertainty_score":0.033865392},"labels":[],"label_agreement":null},{"id":"W4382463660","doi":"10.1609/aaai.v37i13.27091","title":"A Dataset for Learning University STEM Courses at Scale and Generating Questions at a Human Level","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Online Learning and Analytics","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":"Scale (ratio); Science and engineering; Mathematics education; Dozen; Foundation (evidence); Earth system science; Computer science; Data science; Engineering; Engineering ethics; Mathematics; Ecology; Geography; Biology; Cartography","score_opus":0.14612825709802754,"score_gpt":0.3351370423303442,"score_spread":0.18900878523231665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382463660","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054024283,0.0011898509,0.008984335,0.001849543,0.00031477585,0.0010443631,0.9172924,0.005532716,0.009767785],"genre_scores_gemma":[0.023924902,0.00014378036,0.011609778,0.0003329678,0.000056799385,0.0009485288,0.9601755,0.00012542063,0.002682294],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973787,0.0006955819,0.0003107324,0.00061242713,0.00081205205,0.0001905242],"domain_scores_gemma":[0.99231464,0.0033826013,0.0005341768,0.0012382698,0.0016175508,0.0009128039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017929246,0.0017560676,0.0008463427,0.0036517424,0.0012420855,0.0014807697,0.0021500213,0.0031828298,0.010294445],"category_scores_gemma":[0.011241767,0.0004007291,0.0012673059,0.0032398475,0.00064946915,0.001830461,0.0023555455,0.0025369,0.0114786085],"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.0006531769,0.0019280319,0.023258802,0.0020974774,0.00018303336,0.00047169803,0.00103534,0.0056909877,0.004338498,0.0033605692,0.86644244,0.09053991],"study_design_scores_gemma":[0.0011243089,0.00069663214,0.06825284,0.00044404497,0.000113912465,0.00079637143,0.0016324695,0.03204569,0.008844897,0.008300261,0.8775686,0.00017993248],"about_ca_topic_score_codex":0.0114363525,"about_ca_topic_score_gemma":0.03075565,"teacher_disagreement_score":0.0114363525,"about_ca_system_score_codex":0.0019573914,"about_ca_system_score_gemma":0.0019398208,"threshold_uncertainty_score":0.034438312},"labels":[],"label_agreement":null},{"id":"W4382463985","doi":"10.1609/aaai.v37i13.27068","title":"NL2LTL – a Python Package for Converting Natural Language (NL) Instructions to Linear Temporal Logic (LTL) Formulas","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Natural Language Processing Techniques","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":"York University","funders":"","keywords":"Computer science; Programming language; Python (programming language); Natural language; IBM; Linear temporal logic; Temporal logic; Extensibility; Natural language processing","score_opus":0.0672773486059246,"score_gpt":0.34221820759602817,"score_spread":0.27494085899010356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382463985","genre_codex":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001251842,0.00015063421,0.4082437,0.0006633846,0.00029576343,0.0003098788,0.030228304,0.53656125,0.022295322],"genre_scores_gemma":[0.042971775,0.0006527401,0.5507982,0.0024097515,0.00023163106,0.0020395669,0.09633682,0.26462352,0.039936084],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99877983,0.00018622148,0.00013496538,0.00022479144,0.00051122083,0.00016283132],"domain_scores_gemma":[0.99826366,0.0006551216,0.00016639382,0.00035743206,0.00043479362,0.00012258398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013379934,0.0016682325,0.0008883063,0.001587959,0.00084274873,0.002436793,0.003223037,0.0012151079,0.13830474],"category_scores_gemma":[0.006684301,0.0014945199,0.0023802288,0.0011629643,0.0011493794,0.0041272757,0.0032979602,0.0043596923,0.07990703],"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.00031683812,0.0001482295,0.0014051693,0.0015293424,0.00011134132,0.00050131,0.00048411786,0.0062636393,0.008838912,0.04810813,0.8066413,0.12565166],"study_design_scores_gemma":[0.0002252279,0.00005359451,0.0011437417,0.0002932999,0.00005211429,0.00061479793,0.00011452856,0.08700969,0.019044364,0.0919988,0.7992631,0.00018669396],"about_ca_topic_score_codex":0.005897383,"about_ca_topic_score_gemma":0.007933215,"teacher_disagreement_score":0.13830474,"about_ca_system_score_codex":0.0014362412,"about_ca_system_score_gemma":0.0032346915,"threshold_uncertainty_score":0.46267545},"labels":[],"label_agreement":null},{"id":"W4382463991","doi":"10.1609/aaai.v37i12.26771","title":"Conflicting Interactions among Protection Mechanisms for Machine Learning Models","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","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":"Computer science; Pairwise comparison; Robustness (evolution); Popularity; Mechanism (biology); Evasion (ethics); Computer security; Machine learning; Private information retrieval; Risk analysis (engineering); Artificial intelligence; Business","score_opus":0.1333083317816195,"score_gpt":0.3360014266141462,"score_spread":0.20269309483252673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382463991","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.2150703,0.0010357013,0.7752094,0.00253712,0.00008484917,0.00019608672,0.00016445789,0.0011953139,0.004506697],"genre_scores_gemma":[0.94337326,0.00015878596,0.055043317,0.00025198178,0.000039399816,0.0001059861,0.00010832083,0.00013781704,0.00078112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9662896,0.018999822,0.002078022,0.003933618,0.00637155,0.0023274275],"domain_scores_gemma":[0.80889225,0.12755638,0.013649001,0.042124536,0.0054026674,0.002375167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.028357351,0.0013476536,0.0015599524,0.0013521134,0.0013995504,0.0041199694,0.003650131,0.0030420795,0.0034203692],"category_scores_gemma":[0.16310222,0.0011169146,0.0018154192,0.00088519655,0.0034545395,0.008521039,0.0068048527,0.0057445597,0.00050904317],"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.0014594188,0.00041968172,0.023728605,0.0004915147,0.000536516,0.00055936887,0.0010173676,0.63186336,0.016817387,0.16767597,0.0024818566,0.1529489],"study_design_scores_gemma":[0.00006282622,0.00027743288,0.0021729458,0.00009244011,0.000120071454,0.0003257481,0.00017057426,0.8653936,0.011342537,0.1182995,0.0016892685,0.000053000826],"about_ca_topic_score_codex":0.0008423662,"about_ca_topic_score_gemma":0.0007968928,"teacher_disagreement_score":0.028357351,"about_ca_system_score_codex":0.0028589172,"about_ca_system_score_gemma":0.0023905423,"threshold_uncertainty_score":0.14996982},"labels":[],"label_agreement":null},{"id":"W4382464093","doi":"10.1609/aaai.v37i12.26738","title":"Improving Adversarial Robustness with Self-Paced Hard-Class Pair Reweighting","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","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 Alberta","funders":"","keywords":"Adversarial system; Computer science; Robustness (evolution); Discriminative model; Artificial intelligence; Class (philosophy); Deep neural networks; Machine learning; Theoretical computer science; Deep learning","score_opus":0.04198952150844852,"score_gpt":0.2643398717135558,"score_spread":0.22235035020510724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382464093","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.04910265,0.00033420316,0.9450218,0.00037769513,0.00010445074,0.00008573655,0.00006905597,0.0016688753,0.0032355743],"genre_scores_gemma":[0.88545626,0.00019391,0.10875614,0.0004452448,0.000087789034,0.00013555496,0.00024024975,0.00033859248,0.004346169],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988746,0.00032030654,0.000051453357,0.00028543614,0.0003169419,0.00015116551],"domain_scores_gemma":[0.9975956,0.0011173881,0.0002991481,0.0006124586,0.00024594416,0.00012952871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021510075,0.001604345,0.0010484803,0.0005712656,0.00048103856,0.0007857408,0.0019959584,0.0013258815,0.002310096],"category_scores_gemma":[0.0076777195,0.0005074859,0.0007645404,0.00038863978,0.0015929503,0.0024517274,0.0033408136,0.00321326,0.0007177838],"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.000164495,0.00011555382,0.0012532255,0.000058298327,0.00007317641,0.00010287396,0.00007500252,0.8926602,0.011210409,0.012446831,0.002746206,0.079093784],"study_design_scores_gemma":[0.0000064481387,0.00003304217,0.0000927123,0.000004872052,0.00000593437,0.000026555274,0.0000048543216,0.99287146,0.0021673576,0.004444721,0.0003364298,0.000005677183],"about_ca_topic_score_codex":0.001367053,"about_ca_topic_score_gemma":0.0015906049,"teacher_disagreement_score":0.002310096,"about_ca_system_score_codex":0.0008416256,"about_ca_system_score_gemma":0.00075808354,"threshold_uncertainty_score":0.011375785},"labels":[],"label_agreement":null},{"id":"W4382464228","doi":"10.1609/aaai.v37i10.26363","title":"Emergent Quantized Communication","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Memory and Neural Computing","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Azrieli Foundation; Israel Science Foundation","keywords":"Quantization (signal processing); Computer science; Communications system; Softmax function; Reinforcement learning; Telecommunications network; Models of communication; Artificial intelligence; Theoretical computer science; Distributed computing; Algorithm; Deep learning; Computer network","score_opus":0.11802550640098856,"score_gpt":0.31385917545410114,"score_spread":0.19583366905311256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382464228","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.09894422,0.0008734462,0.86664206,0.0027279803,0.00038462484,0.000075630516,0.00032798992,0.00075867755,0.029265404],"genre_scores_gemma":[0.95709866,0.00050503865,0.034308266,0.00047933648,0.000125052,0.00008873333,0.00016147533,0.00009559327,0.0071378914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939346,0.00020297295,0.000027077696,0.00013004187,0.00015295493,0.00009350277],"domain_scores_gemma":[0.9979342,0.0010883813,0.00023220015,0.00032626707,0.00023109624,0.00018773107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072259083,0.0003614875,0.00059415563,0.00039513985,0.0006542363,0.0015907979,0.0009579609,0.0010656365,0.0054779705],"category_scores_gemma":[0.0055337762,0.00029845344,0.00040160565,0.0003342139,0.0017625156,0.0030970485,0.002099878,0.0018609043,0.000561012],"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.00015960181,0.000066536,0.0011775828,0.00018590692,0.000049055325,0.00031281225,0.0004074621,0.20234953,0.00876162,0.7449221,0.006214344,0.035393447],"study_design_scores_gemma":[0.000023212177,0.00004352242,0.00037613054,0.000026107711,0.000010085521,0.000097490105,0.00008887646,0.6089883,0.0015546121,0.38467222,0.0040950566,0.000024423645],"about_ca_topic_score_codex":0.0009549154,"about_ca_topic_score_gemma":0.00083109766,"teacher_disagreement_score":0.0054779705,"about_ca_system_score_codex":0.0011108377,"about_ca_system_score_gemma":0.0006732563,"threshold_uncertainty_score":0.018325627},"labels":[],"label_agreement":null},{"id":"W4382464561","doi":"10.1609/aaai.v37i7.25998","title":"Deep Visual Forced Alignment: Learning to Align Transcription with Talking Face Video","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Ministry of Science and ICT, South Korea; National Research Foundation of Korea; National Research Foundation","keywords":"Computer science; Speech recognition; Sentence; Two-alternative forced choice; Artificial intelligence; Transcription (linguistics); Computer vision; Linguistics","score_opus":0.045305509801750396,"score_gpt":0.2904564255360821,"score_spread":0.24515091573433168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382464561","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.023930054,0.0006188167,0.96578395,0.00020094062,0.00032237155,0.00010294253,0.0003565018,0.005559552,0.0031247484],"genre_scores_gemma":[0.38587886,0.00054138707,0.5934506,0.0008169619,0.00030490715,0.0002852104,0.0037073523,0.0009728671,0.014041849],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990293,0.00014073837,0.000042513675,0.00045527404,0.00019736908,0.00013482926],"domain_scores_gemma":[0.9993549,0.00017444121,0.000085679625,0.00014798027,0.00017317962,0.00006382812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006978136,0.0014213062,0.0007924897,0.00062587706,0.00048436705,0.00084617216,0.0012950031,0.0012233218,0.0049508484],"category_scores_gemma":[0.0032538625,0.00042078536,0.00075831404,0.00064032554,0.0006003123,0.0014406274,0.0014248121,0.0018704713,0.003048087],"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.00035667318,0.00013880401,0.0013047945,0.00013312165,0.00007502625,0.00022101906,0.00017481564,0.052668713,0.05778498,0.0031737485,0.012601817,0.8713663],"study_design_scores_gemma":[0.00004790847,0.00026376438,0.0012975404,0.000043339474,0.000045436715,0.00028192007,0.00013844583,0.9374203,0.045098897,0.007342768,0.007980029,0.00003956399],"about_ca_topic_score_codex":0.00464017,"about_ca_topic_score_gemma":0.0066057392,"teacher_disagreement_score":0.0049508484,"about_ca_system_score_codex":0.00047746842,"about_ca_system_score_gemma":0.0011265873,"threshold_uncertainty_score":0.016562223},"labels":[],"label_agreement":null},{"id":"W4382466151","doi":"10.1609/aaai.v37i1.25194","title":"Frequency Selective Augmentation for Video Representation Learning","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Human Pose and Action Recognition","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":"Kootenay Association for Science & Technology","funders":"Korea Advanced Institute of Science and Technology","keywords":"Computer science; Generality; Representation (politics); Feature learning; Focus (optics); Artificial intelligence; Machine learning; Pattern recognition (psychology)","score_opus":0.1196440185864678,"score_gpt":0.34451776923757527,"score_spread":0.22487375065110748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382466151","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.025686232,0.00039029983,0.9698771,0.00020713391,0.00007140649,0.00005704805,0.00016074876,0.0022234723,0.0013265625],"genre_scores_gemma":[0.6710294,0.00044742212,0.3226696,0.00033794204,0.00017479977,0.0002447905,0.0012125853,0.000320775,0.0035627766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992675,0.00022392998,0.000027387576,0.00023644052,0.00017014491,0.0000746408],"domain_scores_gemma":[0.998362,0.0007706877,0.00017280392,0.00039329223,0.00023900717,0.00006219113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010164847,0.00094876724,0.00075930834,0.0007873587,0.0003107257,0.00053055503,0.00153005,0.0009430588,0.002023167],"category_scores_gemma":[0.004764172,0.0003803152,0.0007731764,0.00079056586,0.0008293664,0.0017707024,0.0013489864,0.0017711527,0.0007559641],"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.0003611689,0.0003619306,0.0016704233,0.0001863068,0.000088075794,0.00010842913,0.00017606113,0.31485948,0.041511796,0.010040051,0.00814909,0.62248707],"study_design_scores_gemma":[0.0000073019373,0.000056489098,0.0002393518,0.0000070867627,0.000006962954,0.000035456094,0.000011552159,0.9887898,0.005377653,0.004470708,0.0009893683,0.000008212937],"about_ca_topic_score_codex":0.0027956793,"about_ca_topic_score_gemma":0.0029757877,"teacher_disagreement_score":0.0027956793,"about_ca_system_score_codex":0.00063736766,"about_ca_system_score_gemma":0.0005847338,"threshold_uncertainty_score":0.006768167},"labels":[],"label_agreement":null},{"id":"W4382466676","doi":"10.1609/aaai.v37i7.25997","title":"Inverse-Reference Priors for Fisher Regularization of Bayesian Neural Networks","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Fault Detection and Control Systems","field":"Engineering","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":"Kootenay Association for Science & Technology","funders":"Ministry of Science and ICT, South Korea; National Research Foundation of Korea; National Research Foundation","keywords":"Prior probability; Bayesian probability; Generalization; Fisher information; Regularization (linguistics); Inverse problem; Computer science; Inverse; Artificial neural network; Artificial intelligence; Benchmark (surveying); Deep neural networks; Machine learning; Mathematics","score_opus":0.0468949273352039,"score_gpt":0.2601142447525476,"score_spread":0.21321931741734368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382466676","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.0030718606,0.00018243701,0.9946667,0.0001986543,0.000016562271,0.000019179673,0.000064236294,0.00015169325,0.0016287183],"genre_scores_gemma":[0.33778203,0.0013787787,0.653056,0.00061764114,0.0002467906,0.00045565222,0.0009421415,0.00043978146,0.0050812387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875486,0.00048870704,0.00005604146,0.00024183524,0.00039336368,0.00006515925],"domain_scores_gemma":[0.99625236,0.0024244916,0.00026850982,0.00044978515,0.0005107494,0.00009402939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045637605,0.0010947932,0.00083977956,0.0012983148,0.0005945275,0.0012879008,0.001775476,0.0017438618,0.0026786765],"category_scores_gemma":[0.01662946,0.0006421118,0.0008415651,0.0009827516,0.0017772991,0.0024138223,0.0016441725,0.0030222938,0.00066974317],"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.0000681747,0.000048956445,0.0005793816,0.000124497,0.00004720063,0.000074445416,0.00010494052,0.66443133,0.0036707167,0.26376045,0.00311825,0.0639717],"study_design_scores_gemma":[0.000004924988,0.000009239885,0.00014279282,0.00001873213,0.0000040707964,0.000018682105,0.0000057721004,0.9230256,0.00066716917,0.07499394,0.0010972728,0.000011876971],"about_ca_topic_score_codex":0.0041073696,"about_ca_topic_score_gemma":0.003941494,"teacher_disagreement_score":0.0045637605,"about_ca_system_score_codex":0.0014704333,"about_ca_system_score_gemma":0.0012159969,"threshold_uncertainty_score":0.024135768},"labels":[],"label_agreement":null},{"id":"W4382467791","doi":"10.1609/aaai.v37i7.26012","title":"The Effect of Diversity in Meta-Learning","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","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é de Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Task (project management); Diversity (politics); Computer science; Distribution (mathematics); Cognitive psychology; Empirical evidence; Machine learning; Artificial intelligence; Psychology; Mathematics; Epistemology; Engineering; Sociology","score_opus":0.14419556179439486,"score_gpt":0.3180096653225486,"score_spread":0.17381410352815374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382467791","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.82111496,0.006804678,0.15466389,0.0034709962,0.0002553993,0.00024978674,0.00022042301,0.00070770516,0.012512192],"genre_scores_gemma":[0.9798585,0.00037480186,0.018496454,0.00037785352,0.00012502006,0.00006510602,0.00014465494,0.00007086061,0.00048670446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9888216,0.007043626,0.00050650764,0.001920095,0.0012669304,0.00044124798],"domain_scores_gemma":[0.8659343,0.11412596,0.003579672,0.010659271,0.0028524206,0.0028483076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020563297,0.0012916243,0.0013230874,0.0012797322,0.001379356,0.003022903,0.0017641766,0.0026970895,0.0015983992],"category_scores_gemma":[0.1049333,0.00056509685,0.00077639025,0.00073610933,0.0028401646,0.008254057,0.0053624013,0.0041610324,0.00041385743],"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.006747642,0.0025984712,0.10029088,0.0014925458,0.0026130981,0.00075034774,0.003856447,0.42928708,0.0397624,0.03327208,0.0040933327,0.37523565],"study_design_scores_gemma":[0.00090940704,0.0067701996,0.035251755,0.00045029022,0.0010069804,0.0011344457,0.0012874571,0.7665305,0.028697377,0.15128088,0.0064232456,0.00025738572],"about_ca_topic_score_codex":0.0009148438,"about_ca_topic_score_gemma":0.0009983834,"teacher_disagreement_score":0.020563297,"about_ca_system_score_codex":0.00093316886,"about_ca_system_score_gemma":0.0007596724,"threshold_uncertainty_score":0.10875034},"labels":[],"label_agreement":null},{"id":"W4382468395","doi":"10.1609/aaai.v37i7.25952","title":"Self-Supervised Learning for Anomalous Channel Detection in EEG Graphs: Application to Seizure Analysis","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Mila - Quebec Artificial Intelligence Institute","funders":"Compute Canada; Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Electroencephalography; Computer science; Epileptic seizure; Artificial intelligence; Set (abstract data type); Machine learning; Pattern recognition (psychology); Data set; Psychology; Neuroscience","score_opus":0.061441566668411565,"score_gpt":0.30349141009984626,"score_spread":0.2420498434314347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382468395","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.10540887,0.00057738245,0.8892113,0.00047787,0.00007066674,0.00009108556,0.00024570644,0.0027723527,0.0011447276],"genre_scores_gemma":[0.79381657,0.00021009873,0.20266525,0.0002089418,0.000099724544,0.000080559315,0.00074217125,0.00026955173,0.0019070826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99923813,0.0003002628,0.000035264886,0.0002254826,0.00013026009,0.00007056014],"domain_scores_gemma":[0.99707854,0.0016436949,0.00030094085,0.00038288976,0.00046965948,0.00012432993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014531126,0.00091715704,0.0008046757,0.0013095284,0.0004696303,0.0005413804,0.0010879097,0.0008728552,0.00080176763],"category_scores_gemma":[0.0041898647,0.00026949611,0.0007073817,0.00085310504,0.00072319567,0.0009005347,0.0007229298,0.0010337427,0.00030639378],"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.00029944416,0.00036819177,0.007803426,0.00013492919,0.00019009564,0.0002605329,0.00020662295,0.5866938,0.009994716,0.0042700814,0.0065927934,0.3831853],"study_design_scores_gemma":[0.000005776695,0.000015649106,0.0004136529,0.000002324717,0.000005405902,0.000024109537,0.000011278079,0.9958299,0.0009386693,0.0025248239,0.00022433729,0.000004127772],"about_ca_topic_score_codex":0.004084179,"about_ca_topic_score_gemma":0.006236727,"teacher_disagreement_score":0.004084179,"about_ca_system_score_codex":0.0005810257,"about_ca_system_score_gemma":0.0006842085,"threshold_uncertainty_score":0.008120775},"labels":[],"label_agreement":null},{"id":"W4382468787","doi":"10.1609/aaai.v37i1.25197","title":"Multispectral Invisible Coating: Laminated Visible-Thermal Physical Attack against Multispectral Object Detectors Using Transparent Low-E Films","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Memory and Neural Computing","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":"Kootenay Association for Science & Technology","funders":"Defense Acquisition Program Administration; Agency for Defense Development","keywords":"Multispectral image; Computer science; Detector; Multispectral pattern recognition; Computer vision; Artificial intelligence; Remote sensing; Computer security; Telecommunications; Geology","score_opus":0.10752814953188385,"score_gpt":0.32277190178064863,"score_spread":0.2152437522487648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382468787","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.5737463,0.0011903074,0.4080558,0.00033507566,0.00030373718,0.0001591783,0.00017152274,0.00302779,0.013010258],"genre_scores_gemma":[0.8803903,0.0004770659,0.113464154,0.0002619039,0.000036789548,0.000037479538,0.00016203665,0.000115311865,0.005054889],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995258,0.000058467736,0.000020259513,0.00012843737,0.00020150037,0.000065632055],"domain_scores_gemma":[0.9992238,0.00012134248,0.0001818945,0.00030860963,0.0001275061,0.00003687574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030154927,0.0006188004,0.0003207328,0.0004150075,0.00031483962,0.0009714521,0.000567782,0.000954547,0.0010630571],"category_scores_gemma":[0.0010485871,0.00029668515,0.0005283698,0.00026567394,0.0006630515,0.0011330352,0.00085226784,0.0007054049,0.00053851894],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033148009,0.00016642627,0.0031327088,0.00022693774,0.000082575294,0.00079183304,0.00014324884,0.010055332,0.86847717,0.0028223542,0.002447485,0.111322306],"study_design_scores_gemma":[0.000025867655,0.0004067185,0.004219997,0.00002651404,0.000056689492,0.0013535017,0.00006696659,0.114720225,0.8694069,0.0006706473,0.009002656,0.00004331162],"about_ca_topic_score_codex":0.00041568454,"about_ca_topic_score_gemma":0.0006320637,"teacher_disagreement_score":0.0010630571,"about_ca_system_score_codex":0.00030162057,"about_ca_system_score_gemma":0.00020126575,"threshold_uncertainty_score":0.0035562515},"labels":[],"label_agreement":null},{"id":"W4382468866","doi":"10.1609/aaai.v37i7.26061","title":"Adaptive Discrete Communication Bottlenecks with Dynamic Vector Quantization for Heterogeneous Representational Coarseness","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Memory and Neural Computing","field":"Engineering","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":"Canadian Institute for Advanced Research; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Discretization; Vector quantization; Codebook; Computer science; Bottleneck; Reinforcement learning; Quantization (signal processing); Hyperparameter; Artificial intelligence; Learning vector quantization; Robustness (evolution); Generalization; Theoretical computer science; Machine learning; Algorithm; Mathematics","score_opus":0.07642449509526475,"score_gpt":0.3147651972544703,"score_spread":0.23834070215920553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382468866","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.053350475,0.00042765492,0.94379133,0.00046904868,0.000059593796,0.00006539545,0.00007615667,0.0006204465,0.0011398884],"genre_scores_gemma":[0.9193399,0.00017743125,0.07866446,0.00020698759,0.00004843568,0.00015900984,0.00014143853,0.000096707015,0.0011656163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998351,0.0005129505,0.00014604288,0.0003755824,0.00041315187,0.00020142445],"domain_scores_gemma":[0.9920773,0.004890634,0.0008304405,0.0011966614,0.0006800208,0.0003249615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035113734,0.00087256375,0.0015036064,0.0006097604,0.00064067193,0.0017400484,0.0022563064,0.0011571627,0.0018878469],"category_scores_gemma":[0.02110744,0.000589165,0.00047663876,0.00084220525,0.0016865509,0.0050672223,0.0033296756,0.0031219563,0.00035018142],"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.00023301087,0.00016106533,0.0015515855,0.00008861276,0.00003554722,0.000094097864,0.00028846748,0.88749874,0.004957766,0.039024528,0.0018221606,0.064244434],"study_design_scores_gemma":[0.000012001973,0.000020430147,0.00007199014,0.0000048549364,0.000002861041,0.000007823788,0.00001305725,0.9861683,0.00060995476,0.012908606,0.00017445332,0.0000057780726],"about_ca_topic_score_codex":0.0045729266,"about_ca_topic_score_gemma":0.0037913837,"teacher_disagreement_score":0.0045729266,"about_ca_system_score_codex":0.001931427,"about_ca_system_score_gemma":0.0017969229,"threshold_uncertainty_score":0.018570125},"labels":[],"label_agreement":null},{"id":"W4382469210","doi":"10.1609/aaai.v37i9.26320","title":"Foresee What You Will Learn: Data Augmentation for Domain Generalization in Non-stationary Environment","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Generalization; Domain (mathematical analysis); Artificial intelligence; Machine learning; Representation (politics); Mathematics","score_opus":0.1258014299904242,"score_gpt":0.32635200830429706,"score_spread":0.20055057831387285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382469210","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.036086917,0.0006081133,0.95976216,0.00048015657,0.00006758309,0.00007955902,0.00024080138,0.0015978628,0.0010768616],"genre_scores_gemma":[0.59701246,0.00047850207,0.3972412,0.00072159147,0.00012369109,0.00023981689,0.0014508244,0.0002341811,0.0024976614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99932075,0.00021587938,0.000031728203,0.00027719198,0.00009168681,0.00006279142],"domain_scores_gemma":[0.99836713,0.0006994865,0.000119763594,0.00056258834,0.00015118154,0.00009991461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016120533,0.0011066255,0.0011258416,0.00076505245,0.00044842137,0.00079171365,0.0021110494,0.0014271139,0.0013748333],"category_scores_gemma":[0.004237863,0.0005509064,0.0013509478,0.00086327584,0.0011838339,0.0031942786,0.0019479675,0.0027393848,0.000563403],"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.00032290272,0.00036434128,0.0033122392,0.00018269022,0.00013337101,0.00023949314,0.00034157338,0.6442824,0.012083129,0.011894018,0.006783757,0.32006007],"study_design_scores_gemma":[0.000010549174,0.0000438862,0.0001930525,0.00000918059,0.00001025275,0.000050411836,0.00002744506,0.9858947,0.0020482312,0.010624038,0.0010779996,0.000010274265],"about_ca_topic_score_codex":0.0029557997,"about_ca_topic_score_gemma":0.0033804693,"teacher_disagreement_score":0.0029557997,"about_ca_system_score_codex":0.0006430629,"about_ca_system_score_gemma":0.0008695982,"threshold_uncertainty_score":0.008525431},"labels":[],"label_agreement":null},{"id":"W4382469227","doi":"10.1609/aaai.v37i1.25088","title":"Denoising after Entropy-Based Debiasing a Robust Training Method for Dataset Bias with Noisy Labels","year":2023,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Data Classification","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":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea","keywords":"Debiasing; Computer science; Artificial intelligence; Noise reduction; Machine learning; Generalization; Entropy (arrow of time); Sampling bias; Sample (material); Pattern recognition (psychology); Statistics; Mathematics; Sample size determination; Psychology","score_opus":0.2141292935997887,"score_gpt":0.3536692546631078,"score_spread":0.1395399610633191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382469227","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.03130788,0.0004054198,0.9655406,0.00020128503,0.000066167435,0.000080156875,0.00008668529,0.001536642,0.00077517563],"genre_scores_gemma":[0.41246358,0.00036275943,0.5807418,0.00060655654,0.00011552225,0.00032599518,0.000827517,0.0006370106,0.0039192312],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985714,0.00026085268,0.0001288924,0.00050612725,0.00039823606,0.00013447448],"domain_scores_gemma":[0.99572986,0.0015481837,0.00048125436,0.0011271657,0.0009784555,0.00013515448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036493717,0.001132528,0.0013689206,0.00084503484,0.0006657315,0.0009309696,0.0016947178,0.0012843619,0.0017285419],"category_scores_gemma":[0.012516417,0.0006115504,0.0011037745,0.00061296957,0.0014108871,0.0017960337,0.0017748347,0.0023923614,0.00076539],"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.000733668,0.00022410975,0.008096849,0.0004744605,0.00023394376,0.0002897818,0.001139182,0.3354442,0.1006997,0.012367225,0.004729615,0.53556734],"study_design_scores_gemma":[0.00002270474,0.00011496775,0.0018456535,0.000038287642,0.00004275093,0.00011602127,0.000059021546,0.94949555,0.04011278,0.005872396,0.0022416695,0.00003827424],"about_ca_topic_score_codex":0.00225485,"about_ca_topic_score_gemma":0.0030399053,"teacher_disagreement_score":0.0036493717,"about_ca_system_score_codex":0.0006880954,"about_ca_system_score_gemma":0.001206987,"threshold_uncertainty_score":0.019299924},"labels":[],"label_agreement":null},{"id":"W4391911722","doi":"10.1609/aaai.v38i8.28641","title":"Composing Biases by Using CP to Decompose Minimal Functional Dependencies for Acquiring Complex Formulae","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Agence Nationale de la Recherche; Université Laval","keywords":"Computer science; Mathematics","score_opus":0.6027175003288999,"score_gpt":0.48437410910599876,"score_spread":0.11834339122290116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391911722","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.024041258,0.000067137946,0.9728001,0.00015485371,0.000016721075,0.00008947923,0.00011364064,0.0011996819,0.0015171528],"genre_scores_gemma":[0.16731168,0.00007561275,0.8303852,0.00012960508,0.000030342388,0.00021764441,0.00045864534,0.00035272352,0.0010385774],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981546,0.0003954586,0.00015921434,0.0005779192,0.0005607189,0.00015212476],"domain_scores_gemma":[0.9906661,0.0058822413,0.00050626113,0.0017479873,0.0009660459,0.00023136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028595931,0.0011521813,0.00092167815,0.0013115804,0.0005051182,0.0013815068,0.0022949686,0.0009508877,0.005122028],"category_scores_gemma":[0.018475575,0.00092514814,0.001607025,0.0009290198,0.0015177224,0.0050169113,0.0030427102,0.0034729226,0.0009557451],"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.00030938513,0.00027300406,0.006468795,0.000631114,0.00016230693,0.00027535183,0.00059892767,0.1224856,0.04056118,0.10335623,0.00404881,0.7208292],"study_design_scores_gemma":[0.000050564275,0.00012609962,0.00094476965,0.000047113113,0.000052839012,0.00015931473,0.0000619028,0.8304821,0.018660754,0.14527597,0.004101656,0.000036979225],"about_ca_topic_score_codex":0.0025641457,"about_ca_topic_score_gemma":0.0045218156,"teacher_disagreement_score":0.005122028,"about_ca_system_score_codex":0.0015932104,"about_ca_system_score_gemma":0.002556237,"threshold_uncertainty_score":0.017134905},"labels":[],"label_agreement":null},{"id":"W4392678259","doi":"10.1609/aaai.v38i16.29789","title":"Cross-Modal and Uni-Modal Soft-Label Alignment for Image-Text Retrieval","year":2024,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Image Retrieval and Classification Techniques","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 Ottawa","funders":"","keywords":"Modal; Computer science; Artificial intelligence; Image (mathematics); Computer vision; Information retrieval; Materials science","score_opus":0.07936549470850399,"score_gpt":0.34730041461263783,"score_spread":0.2679349199041339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392678259","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.017844208,0.0006510364,0.9712815,0.00025823264,0.000102117854,0.00015827881,0.0002807075,0.0063845976,0.0030394108],"genre_scores_gemma":[0.3945019,0.00059635664,0.5848121,0.00095834,0.00027785482,0.000512959,0.002796582,0.0010948903,0.014449056],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979272,0.00045358847,0.0001277308,0.0006278784,0.0006485954,0.00021497557],"domain_scores_gemma":[0.997775,0.00057321734,0.00024855285,0.00068479497,0.0006071816,0.0001112069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018882054,0.0012104362,0.0011982534,0.002198965,0.001054121,0.0017124319,0.0022756227,0.0017106534,0.0071398276],"category_scores_gemma":[0.006067685,0.00046703126,0.0012798748,0.00211609,0.0011426384,0.004046321,0.0026633511,0.0024546564,0.0060119103],"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.0006821731,0.00043379964,0.001573979,0.00046427554,0.00014682919,0.00017872867,0.00031702372,0.043869685,0.07418788,0.012085006,0.0199318,0.8461287],"study_design_scores_gemma":[0.00004926115,0.0001496354,0.0012279595,0.000028838425,0.00006960192,0.00026131643,0.00015718039,0.9135444,0.052451983,0.022980193,0.009009469,0.000070204565],"about_ca_topic_score_codex":0.0034432067,"about_ca_topic_score_gemma":0.005631846,"teacher_disagreement_score":0.0071398276,"about_ca_system_score_codex":0.0011235859,"about_ca_system_score_gemma":0.0013683425,"threshold_uncertainty_score":0.02388513},"labels":[],"label_agreement":null},{"id":"W4392934662","doi":"10.1609/aaai.v38i8.28743","title":"Towards Diverse Perspective Learning with Selection over Multiple Temporal Poolings","year":2024,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; Korea Advanced Institute of Science and Technology","keywords":"Perspective (graphical); Selection (genetic algorithm); Computer science; Artificial intelligence","score_opus":0.061713720100645166,"score_gpt":0.32907019170485785,"score_spread":0.26735647160421266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392934662","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.021315455,0.00046435336,0.97612834,0.0002673641,0.00003679689,0.000045659803,0.00008197184,0.0006116437,0.0010484463],"genre_scores_gemma":[0.666691,0.0006747706,0.32649374,0.0005731933,0.00026862262,0.00018339726,0.00087118347,0.00030650792,0.003937539],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850863,0.00050552527,0.00006248077,0.0004454961,0.00032352662,0.00015424665],"domain_scores_gemma":[0.9979042,0.00087312714,0.00024816507,0.00031672005,0.00047958855,0.00017821469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030713112,0.002225024,0.0014834548,0.001056704,0.00057888514,0.00150747,0.0020738856,0.00171459,0.0016687083],"category_scores_gemma":[0.005830423,0.00073517655,0.0017311515,0.0014137904,0.0010411186,0.004426177,0.003181431,0.0027759362,0.00069732364],"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.00045832343,0.00031080985,0.0055353236,0.00018943094,0.00039512588,0.00034140048,0.00041191597,0.368227,0.018567324,0.030560886,0.0078361835,0.5671662],"study_design_scores_gemma":[0.000011122418,0.00007393124,0.0002519519,0.000008370682,0.000025775696,0.000031906537,0.000023996281,0.98486245,0.0023588312,0.01172594,0.0006162117,0.000009500017],"about_ca_topic_score_codex":0.0031039638,"about_ca_topic_score_gemma":0.0034678287,"teacher_disagreement_score":0.0031039638,"about_ca_system_score_codex":0.0011378706,"about_ca_system_score_gemma":0.0011014091,"threshold_uncertainty_score":0.016242802},"labels":[],"label_agreement":null},{"id":"W4393145551","doi":"10.1609/aaai.v38i21.30455","title":"BertRLFuzzer: A BERT and Reinforcement Learning Based Fuzzer (Student Abstract)","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Data Stream Mining 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":"University of Waterloo","funders":"","keywords":"Reinforcement learning; Computer science; Fuzz testing; Reinforcement; Artificial intelligence; Programming language; Engineering; Software; Structural engineering","score_opus":0.05321952071557166,"score_gpt":0.31180403259385664,"score_spread":0.25858451187828496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393145551","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.0891881,0.00051973265,0.8493305,0.0006789451,0.00011671545,0.00028735242,0.00043313776,0.054667592,0.0047779637],"genre_scores_gemma":[0.6123728,0.00017408279,0.37904963,0.00047871695,0.000029790433,0.00022464395,0.0005528276,0.0011980669,0.005919532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99912244,0.00020941772,0.000054083343,0.00021912804,0.00031179292,0.00008310058],"domain_scores_gemma":[0.9973183,0.0015818708,0.00023012736,0.0005287055,0.00023881791,0.00010203516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017604195,0.0010322757,0.0005406206,0.0008292225,0.0003337118,0.00091208256,0.002376296,0.0016157874,0.006120617],"category_scores_gemma":[0.0069866152,0.0004761,0.00073099154,0.00030355513,0.0010750465,0.0020046455,0.0013378162,0.0015723379,0.0011649594],"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.0010374683,0.0005949894,0.011158599,0.00047740949,0.0002774183,0.00062277995,0.00036679613,0.51965815,0.05233317,0.024338547,0.01213901,0.37699568],"study_design_scores_gemma":[0.000063327636,0.00024401885,0.0006510624,0.000026369826,0.000026835665,0.00017464357,0.000015129407,0.9680684,0.02112717,0.004719995,0.0048518167,0.000031172396],"about_ca_topic_score_codex":0.0030295295,"about_ca_topic_score_gemma":0.0030314918,"teacher_disagreement_score":0.006120617,"about_ca_system_score_codex":0.000810263,"about_ca_system_score_gemma":0.00084109773,"threshold_uncertainty_score":0.020475507},"labels":[],"label_agreement":null},{"id":"W4393145623","doi":"10.1609/aaai.v38i21.30433","title":"Improving Faithfulness in Abstractive Text Summarization with EDUs Using BART (Student Abstract)","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","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 Lethbridge","funders":"","keywords":"Automatic summarization; Natural language processing; Computer science; Psychology; Linguistics; Mathematics education; Artificial intelligence; Philosophy","score_opus":0.06324586238832317,"score_gpt":0.3050327422802676,"score_spread":0.24178687989194445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393145623","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.15324856,0.002660886,0.82293665,0.00054575293,0.00037452963,0.0002505062,0.0009916035,0.015625719,0.0033657944],"genre_scores_gemma":[0.54517156,0.00076407596,0.4417507,0.00024993485,0.00034854372,0.00023059006,0.004021495,0.00068160635,0.0067815403],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992938,0.00021279283,0.000072226016,0.00020600627,0.00015859301,0.00005661942],"domain_scores_gemma":[0.99734604,0.0012683464,0.0002885668,0.00032999678,0.00065373175,0.00011339562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012133925,0.0009946589,0.0007864179,0.0012793465,0.00041992805,0.0011806199,0.00067223207,0.00063941564,0.0022381244],"category_scores_gemma":[0.0053016134,0.0002764002,0.00060616236,0.00084156025,0.00030502482,0.0019859937,0.0009955444,0.001079397,0.0016458365],"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.0006912819,0.00019070666,0.001089898,0.0005790553,0.000111362606,0.00018376498,0.00080631045,0.019903721,0.099534936,0.0021618234,0.007978269,0.86676884],"study_design_scores_gemma":[0.00024237881,0.0011263989,0.0048763356,0.000096665746,0.0004927271,0.00028989394,0.0008457529,0.77570814,0.18230326,0.007564406,0.026342466,0.00011157887],"about_ca_topic_score_codex":0.0013615212,"about_ca_topic_score_gemma":0.002223882,"teacher_disagreement_score":0.0022381244,"about_ca_system_score_codex":0.00029953866,"about_ca_system_score_gemma":0.00048419647,"threshold_uncertainty_score":0.007487297},"labels":[],"label_agreement":null},{"id":"W4393145726","doi":"10.1609/aaai.v38i21.30316","title":"IBCA: An Intelligent Platform for Social Insurance Benefit Qualification Status Assessment","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Healthcare Systems and Public Health","field":"Medicine","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":"University of British Columbia Hospital","funders":"National Natural Science Foundation of China; National Research Foundation Singapore; National Science Council; National Research Foundation","keywords":"Business; Actuarial science; Internet privacy; Risk analysis (engineering); Computer security; Computer science","score_opus":0.2328154711918726,"score_gpt":0.4471055671653415,"score_spread":0.2142900959734689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393145726","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.10445169,0.0014729456,0.57388276,0.0024047722,0.00065650395,0.0022266908,0.018182995,0.26640433,0.030317303],"genre_scores_gemma":[0.6522481,0.0006818061,0.30603647,0.0011209343,0.00022022419,0.0012359462,0.020882519,0.0019384341,0.015635662],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992428,0.0001322725,0.00006304501,0.0001662885,0.00030238088,0.00009329967],"domain_scores_gemma":[0.9981053,0.00047027404,0.00024493103,0.00037026606,0.00052723795,0.00028198297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015692246,0.0007226859,0.00051569194,0.0022555992,0.00042376717,0.0010726858,0.001518955,0.00056450174,0.005720331],"category_scores_gemma":[0.0052128113,0.0003219874,0.00041323414,0.0008250912,0.0002985189,0.0017303326,0.0019518046,0.00097300875,0.0028303822],"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.0019703435,0.00084750203,0.04352781,0.00044294738,0.00028704962,0.00081432663,0.000929191,0.04129028,0.018855575,0.015372845,0.19534053,0.6803215],"study_design_scores_gemma":[0.00017446966,0.00023856136,0.01752416,0.00008899964,0.0000950203,0.00019638556,0.0001866193,0.86303717,0.014857647,0.018285926,0.08516122,0.00015388452],"about_ca_topic_score_codex":0.011022928,"about_ca_topic_score_gemma":0.009980503,"teacher_disagreement_score":0.011022928,"about_ca_system_score_codex":0.0007990242,"about_ca_system_score_gemma":0.0017277687,"threshold_uncertainty_score":0.021917522},"labels":[],"label_agreement":null},{"id":"W4393145735","doi":"10.1609/aaai.v38i21.30449","title":"Towards a Transformer-Based Reverse Dictionary Model for Quality Estimation of Definitions (Student Abstract)","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Natural Language Processing Techniques","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":"Université du Québec à Montréal","funders":"","keywords":"Transformer; Computer science; Quality (philosophy); Engineering; Electrical engineering; Philosophy","score_opus":0.1585445641583282,"score_gpt":0.38410635970827417,"score_spread":0.22556179554994596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393145735","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.008740345,0.00009153606,0.9900601,0.00016742983,0.000015329893,0.000029607761,0.0000858675,0.00031574958,0.00049396744],"genre_scores_gemma":[0.59949625,0.0003531833,0.39560977,0.00023638328,0.000071190836,0.00019917317,0.0007050771,0.0002698856,0.003059151],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99823475,0.0007251566,0.00012579504,0.0004849468,0.00027378104,0.00015555437],"domain_scores_gemma":[0.99206537,0.00491006,0.000688264,0.00078655005,0.0012826413,0.00026702613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038910746,0.0008070936,0.0011148497,0.001838296,0.0003134455,0.0024041517,0.002614179,0.0013140754,0.004092854],"category_scores_gemma":[0.019554157,0.00064037676,0.0014946217,0.0016356418,0.0014003376,0.0050472263,0.0020731594,0.0025429947,0.0011403038],"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.00073942303,0.0003418428,0.00946365,0.00030971743,0.00025272713,0.00021419473,0.00065141334,0.45275614,0.008498164,0.17972136,0.005029407,0.34202194],"study_design_scores_gemma":[0.000009334723,0.000033701333,0.0002529206,0.0000093505105,0.000011873638,0.000025072879,0.000016442145,0.9744666,0.00048697356,0.024310457,0.00036850793,0.000008776037],"about_ca_topic_score_codex":0.00805811,"about_ca_topic_score_gemma":0.0071091363,"teacher_disagreement_score":0.00805811,"about_ca_system_score_codex":0.0010731845,"about_ca_system_score_gemma":0.0010600974,"threshold_uncertainty_score":0.020578265},"labels":[],"label_agreement":null},{"id":"W4393145756","doi":"10.1609/aaai.v38i21.30545","title":"Flow-Event Autoencoder: Event Stream Object Recognition Dataset Generation with Arbitrary High Temporal Resolution","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Data Stream Mining Techniques","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":"Autoencoder; Event (particle physics); High resolution; Computer science; Artificial intelligence; Flow (mathematics); Pattern recognition (psychology); Deep learning; Geology; Mathematics; Remote sensing; Geometry; Physics","score_opus":0.08118148701150109,"score_gpt":0.30405557191821586,"score_spread":0.2228740849067148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393145756","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.018208984,0.00019377682,0.9734072,0.00016697391,0.00017191743,0.0001725243,0.0014450465,0.005267046,0.0009664949],"genre_scores_gemma":[0.23568828,0.0003360586,0.7473767,0.00031017774,0.00016384736,0.0004653465,0.010273783,0.00030358875,0.005082194],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996051,0.0000445795,0.000025298737,0.00015600726,0.00011672865,0.000052246716],"domain_scores_gemma":[0.99940515,0.00013254215,0.00004745555,0.00015358218,0.00022022426,0.000041103365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010222879,0.0009941104,0.0006566272,0.0008588069,0.0002634261,0.00048643874,0.0012370733,0.00071533915,0.0022075525],"category_scores_gemma":[0.0025308307,0.00039763874,0.00063082937,0.00078521756,0.00027683724,0.0012745588,0.0009599943,0.0015937666,0.0012063563],"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.000499393,0.00047382576,0.0030398427,0.00014602991,0.00011013376,0.00015529395,0.000057942398,0.074880816,0.039126102,0.005748055,0.023362963,0.8523995],"study_design_scores_gemma":[0.000024690331,0.00006602033,0.0010685946,0.00000868506,0.000015919095,0.0000556729,0.000010286181,0.97213596,0.020320036,0.0023397524,0.003937974,0.000016291773],"about_ca_topic_score_codex":0.0040934235,"about_ca_topic_score_gemma":0.005605118,"teacher_disagreement_score":0.0040934235,"about_ca_system_score_codex":0.0005345716,"about_ca_system_score_gemma":0.0011209617,"threshold_uncertainty_score":0.008139193},"labels":[],"label_agreement":null},{"id":"W4393145938","doi":"10.1609/aaai.v38i21.30558","title":"Deep Learning for Style Transfer and Experimentation with Audio Effects and Music Creation","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Music and Audio Processing","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":"Melody; Computer science; Digital audio; Task (project management); Process (computing); Variety (cybernetics); Statement (logic); Set (abstract data type); Style (visual arts); Multimedia; Audio signal processing; Speech recognition; Audio signal; Artificial intelligence; Musical; Visual arts; Art; Engineering; Linguistics; Speech coding","score_opus":0.04066959846352938,"score_gpt":0.2871468751169741,"score_spread":0.24647727665344474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393145938","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.23102337,0.0013328764,0.732499,0.002453716,0.00051862904,0.00027807915,0.000994855,0.0029863159,0.027913151],"genre_scores_gemma":[0.71386015,0.00044725696,0.27628204,0.00057026726,0.000074995754,0.0003477764,0.0008754219,0.00029754438,0.0072445236],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985129,0.0007821516,0.00006142548,0.00024424854,0.00029491374,0.0001043188],"domain_scores_gemma":[0.99585897,0.0027859733,0.00014355444,0.0007140077,0.0003786252,0.000118958276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037888056,0.0008052027,0.00033352542,0.0005136729,0.0004376301,0.0012588341,0.0013047558,0.001011154,0.0037589832],"category_scores_gemma":[0.01462313,0.0003742834,0.0006894269,0.0006182041,0.0011037787,0.0021665052,0.0012823762,0.0024494168,0.0008277947],"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.0004934999,0.00095555885,0.0071509043,0.0006159073,0.00027706235,0.00016264837,0.0008746631,0.41932476,0.03248021,0.034106273,0.012463072,0.49109548],"study_design_scores_gemma":[0.000041604933,0.00019917739,0.0010140957,0.000050256585,0.000027917742,0.000036736958,0.00009154321,0.95059896,0.01529238,0.027348097,0.00527975,0.00001954113],"about_ca_topic_score_codex":0.00258183,"about_ca_topic_score_gemma":0.0042727194,"teacher_disagreement_score":0.0037888056,"about_ca_system_score_codex":0.00087739265,"about_ca_system_score_gemma":0.0005311101,"threshold_uncertainty_score":0.020037353},"labels":[],"label_agreement":null},{"id":"W4393146083","doi":"10.1609/aaai.v38i21.30468","title":"Attacking CNNs in Histopathology with SNAP: Sporadic and Naturalistic Adversarial Patches (Student Abstract)","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","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":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia; Western University","funders":"","keywords":"Adversarial system; Histopathology; Artificial intelligence; Computer science; Medicine; Pathology","score_opus":0.04090473530556537,"score_gpt":0.3024550889130241,"score_spread":0.2615503536074587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393146083","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.6680431,0.0011225961,0.31238744,0.004811513,0.0007841959,0.00013966125,0.00044659898,0.0026893544,0.009575609],"genre_scores_gemma":[0.9878321,0.000086470805,0.010482271,0.00035897378,0.000035057015,0.000018694882,0.000105254585,0.000039098413,0.0010421001],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999521,0.00017416813,0.000016473365,0.00009967641,0.000115149625,0.000073552736],"domain_scores_gemma":[0.99756914,0.0015529438,0.0001513719,0.0004587885,0.00017012742,0.00009759855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012737978,0.00045689545,0.00030560404,0.00021789402,0.00025245015,0.0003786406,0.00051036105,0.00078407885,0.0013755535],"category_scores_gemma":[0.0055580237,0.0001720445,0.00039661073,0.00009720676,0.0010981257,0.0007433794,0.0013083315,0.0012051917,0.00023277293],"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.0007476061,0.00013150189,0.01065603,0.00012711502,0.00020344641,0.0011714993,0.00021799239,0.8529057,0.028170194,0.014258657,0.0139997145,0.07741062],"study_design_scores_gemma":[0.000014642197,0.00021620015,0.0016614181,0.00002605337,0.00001562735,0.000279878,0.00004770053,0.97849405,0.011353077,0.006160358,0.0017175968,0.0000135119535],"about_ca_topic_score_codex":0.0014445488,"about_ca_topic_score_gemma":0.0021974067,"teacher_disagreement_score":0.0014445488,"about_ca_system_score_codex":0.00048276622,"about_ca_system_score_gemma":0.0002786976,"threshold_uncertainty_score":0.0067365766},"labels":[],"label_agreement":null},{"id":"W4393146360","doi":"10.1609/aaai.v38i20.30273","title":"Temporal Fairness in Multiwinner Voting","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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":"Carleton University","funders":"Alan Turing Institute","keywords":"Voting; Computer science; Business; Political science; Politics; Law","score_opus":0.11173800175273614,"score_gpt":0.28370867412422784,"score_spread":0.17197067237149172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393146360","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.12961547,0.0007328751,0.8426638,0.0016498765,0.00020576533,0.00012587904,0.00025572962,0.00017218065,0.024578402],"genre_scores_gemma":[0.939313,0.00026637007,0.053035587,0.0002409383,0.00015114533,0.00013676568,0.00014023938,0.000066315566,0.0066496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9906673,0.004495324,0.00045158196,0.0020723608,0.0011593162,0.0011540335],"domain_scores_gemma":[0.9800223,0.013569885,0.0016127421,0.00273196,0.0012530222,0.0008101268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01021775,0.0004410965,0.0014881408,0.00076956465,0.0021115125,0.003657625,0.0020538052,0.0016213298,0.006220638],"category_scores_gemma":[0.034426276,0.00040259308,0.0011742734,0.0011486384,0.0027932886,0.005955988,0.0020717632,0.0023049738,0.0006359081],"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.00011594592,0.000043030166,0.0015239526,0.00006512964,0.00003980991,0.00010165895,0.00033095124,0.031097008,0.00063820026,0.94903815,0.0009367133,0.016069513],"study_design_scores_gemma":[0.000026352498,0.00003575449,0.00046511088,0.000017655015,0.000014608129,0.00007587381,0.00009806858,0.11071658,0.0003576769,0.8859152,0.0022578274,0.000019294264],"about_ca_topic_score_codex":0.0023924273,"about_ca_topic_score_gemma":0.002807307,"teacher_disagreement_score":0.01021775,"about_ca_system_score_codex":0.0018778077,"about_ca_system_score_gemma":0.0019241249,"threshold_uncertainty_score":0.054037333},"labels":[],"label_agreement":null},{"id":"W4393146377","doi":"10.1609/aaai.v38i20.30233","title":"T-NET: Weakly Supervised Graph Learning for Combatting Human Trafficking","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Sex work and related issues","field":"Social Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Mila - Quebec Artificial Intelligence Institute","funders":"Fonds de recherche du Québec – Nature et technologies; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Human trafficking; Net (polyhedron); Graph; Computer science; Artificial intelligence; Mathematics; Theoretical computer science; Psychology; Criminology","score_opus":0.0905133421444046,"score_gpt":0.3552561035084165,"score_spread":0.2647427613640119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393146377","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.12347254,0.0036054852,0.8301135,0.004875682,0.00091852347,0.00067987083,0.0054500056,0.016839614,0.014044875],"genre_scores_gemma":[0.62592304,0.0010179527,0.32771274,0.0027363538,0.00064423337,0.0005207001,0.020660851,0.0008689329,0.01991519],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843854,0.00061152194,0.000060496004,0.0005015427,0.00025078794,0.00013710119],"domain_scores_gemma":[0.99516726,0.002826927,0.0004243372,0.00063196645,0.0006286192,0.00032085564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023196759,0.0025401625,0.0015696476,0.0027286862,0.0013065209,0.0014311955,0.0034777415,0.00360511,0.0031236692],"category_scores_gemma":[0.008964231,0.00059275294,0.001503676,0.0017015929,0.0016908975,0.0029532462,0.00194842,0.003195194,0.0021441989],"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.0009127705,0.0013361219,0.011954308,0.0006736696,0.00033148285,0.0004089494,0.00024752942,0.4201513,0.002666203,0.012819182,0.095572144,0.4529264],"study_design_scores_gemma":[0.00003516742,0.00008301158,0.00034423984,0.000028005525,0.000017252964,0.00004460672,0.000046733934,0.9845404,0.00067551335,0.011705672,0.0024702337,0.000009131574],"about_ca_topic_score_codex":0.010198835,"about_ca_topic_score_gemma":0.017386936,"teacher_disagreement_score":0.010198835,"about_ca_system_score_codex":0.0018239608,"about_ca_system_score_gemma":0.0016138471,"threshold_uncertainty_score":0.02027893},"labels":[],"label_agreement":null},{"id":"W4393146382","doi":"10.1609/aaai.v38i20.30613","title":"Reward-Respecting Subtasks for Model-Based Reinforcement Learning (Abstract Reprint)","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","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; Canadian Institute for Advanced Research","funders":"","keywords":"Reprint; Reinforcement learning; Reinforcement; Psychology; Computer science; Artificial intelligence; Social psychology; Physics","score_opus":0.10020869692937655,"score_gpt":0.3268577768747262,"score_spread":0.22664907994534966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393146382","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.0069100996,0.0002607348,0.9882515,0.00032637574,0.00007956726,0.00004110163,0.000079916164,0.00076662586,0.003284058],"genre_scores_gemma":[0.6709624,0.0004904431,0.3191465,0.00040932785,0.00014413969,0.00048689617,0.0004316566,0.00044364543,0.0074850037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994881,0.00021510596,0.000028215467,0.000105703366,0.00009991677,0.000062789295],"domain_scores_gemma":[0.99884194,0.00073222833,0.00008983675,0.00014868427,0.00008796524,0.00009934931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001165389,0.0011747809,0.00087149104,0.00030544618,0.00045714836,0.0010089619,0.001222663,0.001206673,0.007889611],"category_scores_gemma":[0.0041790996,0.000440855,0.000800336,0.00045303625,0.0013346296,0.0014038894,0.0018126155,0.0026851697,0.0012173946],"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.0001496795,0.00008813665,0.00036412707,0.00009931136,0.00002936593,0.00010512022,0.00007057498,0.85790586,0.0016223332,0.08279026,0.0047202795,0.052055012],"study_design_scores_gemma":[0.00001125808,0.000017060063,0.000030613435,0.000008486909,0.0000035027067,0.000006872921,0.000002318462,0.95333445,0.00025070464,0.04565765,0.000672573,0.0000044854937],"about_ca_topic_score_codex":0.004716786,"about_ca_topic_score_gemma":0.0045567867,"teacher_disagreement_score":0.007889611,"about_ca_system_score_codex":0.0013382483,"about_ca_system_score_gemma":0.0012075728,"threshold_uncertainty_score":0.026393354},"labels":[],"label_agreement":null},{"id":"W4393146386","doi":"10.1609/aaai.v38i20.30213","title":"Multi-Modal Discussion Transformer: Integrating Text, Images and Graph Transformers to Detect Hate Speech on Social Media","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Hate Speech and Cyberbullying Detection","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Transformer; Modal; Computer science; Natural language processing; Speech recognition; Artificial intelligence; Engineering; Electrical engineering; Voltage; Materials science","score_opus":0.04765902806975645,"score_gpt":0.2932541412982369,"score_spread":0.24559511322848046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393146386","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.5928792,0.00272271,0.34042472,0.0014049262,0.00050059636,0.0010828938,0.017459188,0.017441722,0.026084175],"genre_scores_gemma":[0.87422293,0.00049489114,0.102245435,0.00023702114,0.00023799695,0.00034861558,0.012252214,0.00045284038,0.009508061],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914765,0.00025663644,0.000038217004,0.00026846962,0.00019270039,0.00009624307],"domain_scores_gemma":[0.9967399,0.001377108,0.00045885457,0.0004565638,0.00073396286,0.0002335249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011525655,0.001043468,0.000324361,0.00410879,0.0007780367,0.0011870876,0.0008928057,0.0011241758,0.0029191915],"category_scores_gemma":[0.005382252,0.00028100878,0.00063738803,0.0013143746,0.0006333904,0.0037222886,0.0019663966,0.0012127102,0.0022075325],"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.0020597323,0.00090167986,0.06285453,0.001882833,0.00035380034,0.0015319613,0.008922371,0.011340981,0.1700194,0.010133182,0.054566532,0.6754331],"study_design_scores_gemma":[0.00012218999,0.0009774555,0.10923816,0.0002538552,0.00032713506,0.0028666176,0.010230902,0.6004119,0.15137857,0.026263643,0.09761502,0.0003145991],"about_ca_topic_score_codex":0.0032027496,"about_ca_topic_score_gemma":0.0073544923,"teacher_disagreement_score":0.00410879,"about_ca_system_score_codex":0.00069285656,"about_ca_system_score_gemma":0.00048900454,"threshold_uncertainty_score":0.009765685},"labels":[],"label_agreement":null},{"id":"W4393146392","doi":"10.1609/aaai.v38i20.30612","title":"Your Prompt Is My Command: On Assessing the Human-Centred Generality of Multimodal Models (Abstract Reprint)","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Speech and dialogue systems","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":"Reprint; Generality; Computer science; Cognitive science; Psychology; Human–computer interaction; Psychotherapist; Physics","score_opus":0.212102811081108,"score_gpt":0.3623498035420163,"score_spread":0.15024699246090828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393146392","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.86181605,0.0017614416,0.10231178,0.0021642712,0.00014843246,0.0010344114,0.00044591932,0.0006136691,0.029704047],"genre_scores_gemma":[0.9681341,0.00038736252,0.029867979,0.00026730984,0.00003410372,0.00026773615,0.00019115946,0.00008002968,0.0007702029],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9857896,0.010263138,0.00064538984,0.0012460898,0.0017855251,0.00027029274],"domain_scores_gemma":[0.7550524,0.21783079,0.006753521,0.011795117,0.0063880347,0.002180208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03715419,0.0006531034,0.0004528305,0.0019153921,0.0009237094,0.0054210755,0.0008951942,0.0016649908,0.004553299],"category_scores_gemma":[0.24521537,0.00040371894,0.0006354268,0.0011424735,0.004111698,0.008624887,0.0051652826,0.001721463,0.0006139264],"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.008052161,0.0014373712,0.18198344,0.0031748463,0.0007639152,0.0005966981,0.077035695,0.0681271,0.019275552,0.0592889,0.011996742,0.5682676],"study_design_scores_gemma":[0.0005029057,0.008309297,0.35484344,0.0025607815,0.00069884903,0.0015802418,0.058317833,0.3457135,0.023309072,0.1740206,0.029135182,0.0010083667],"about_ca_topic_score_codex":0.001941232,"about_ca_topic_score_gemma":0.0019015897,"teacher_disagreement_score":0.03715419,"about_ca_system_score_codex":0.0016481552,"about_ca_system_score_gemma":0.0005307523,"threshold_uncertainty_score":0.19649243},"labels":[],"label_agreement":null},{"id":"W4393146415","doi":"10.1609/aaai.v38i20.30594","title":"Temporal Logic Explanations for Dynamic Decision Systems Using Anchors and Monte Carlo Tree Search (Abstract Reprint)","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Reprint; Computer science; Monte Carlo method; Tree (set theory); Computation tree logic; Decision tree; Theoretical computer science; Artificial intelligence; Temporal logic; Mathematics; Statistics; Combinatorics","score_opus":0.1264871103022022,"score_gpt":0.3503657921298592,"score_spread":0.223878681827657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393146415","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.02514987,0.00012397187,0.97071046,0.0005047944,0.000027606993,0.000046927766,0.00010999064,0.0002780992,0.0030483005],"genre_scores_gemma":[0.68189996,0.00020423536,0.31526467,0.00013783124,0.0000648549,0.00024648363,0.0002376721,0.0001245881,0.0018196105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994648,0.00030279442,0.000029599983,0.000051488423,0.0001110377,0.0000402761],"domain_scores_gemma":[0.9932417,0.0058841105,0.00035427394,0.00020178128,0.00020778998,0.00011034054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018681518,0.000530748,0.0006552559,0.0013474307,0.0006700244,0.0012092503,0.0010124433,0.001129973,0.0070223347],"category_scores_gemma":[0.014999219,0.0004364457,0.0011091004,0.00096712646,0.0015094451,0.0018869395,0.0010895914,0.0013955855,0.00034785614],"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.00006152147,0.000034201938,0.0009529281,0.000058183286,0.000029342707,0.00013746048,0.00015258981,0.74391246,0.0003132875,0.23825204,0.00088624714,0.015209846],"study_design_scores_gemma":[0.0000066159864,0.000005505966,0.000047713165,0.0000048134757,0.0000024756746,0.000008071602,0.000009712673,0.93920255,0.000050795777,0.06048424,0.00017439807,0.0000031182906],"about_ca_topic_score_codex":0.006078075,"about_ca_topic_score_gemma":0.007863731,"teacher_disagreement_score":0.0070223347,"about_ca_system_score_codex":0.001485363,"about_ca_system_score_gemma":0.0013128533,"threshold_uncertainty_score":0.023491979},"labels":[],"label_agreement":null},{"id":"W4393146534","doi":"10.1609/aaai.v38i21.30328","title":"Using Adaptive Bandit Experiments to Increase and Investigate Engagement in Mental Health","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Mental Health Research Topics","field":"Psychology","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Institute of Mental Health; Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Department of Health and Social Care; National Institute for Health and Care Research; NIHR Cambridge Biomedical Research Centre; National Science Foundation","keywords":"Testbed; Computer science; Personalization; Psychological intervention; Mental health; Machine learning; Data science; Artificial intelligence; Human–computer interaction; World Wide Web; Psychology; Psychiatry","score_opus":0.4319903966886684,"score_gpt":0.49653516875335213,"score_spread":0.06454477206468373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393146534","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.70962983,0.00018398426,0.27597228,0.0006776531,0.00017803871,0.0050132684,0.0005327464,0.0012455321,0.006566611],"genre_scores_gemma":[0.82286954,0.00015037798,0.16669993,0.00055668864,0.00005912397,0.007728248,0.00035493908,0.00011755089,0.0014636045],"study_design_codex":"design_other","study_design_gemma":"randomized_trial","domain_scores_codex":[0.98920244,0.008605,0.00036482018,0.0010182807,0.00056260824,0.00024678238],"domain_scores_gemma":[0.93212897,0.058267944,0.0035295654,0.0043801893,0.0011081708,0.0005851714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013863661,0.0010791097,0.0007331403,0.0007773134,0.0006454988,0.001305524,0.0016831742,0.0011579881,0.0033354484],"category_scores_gemma":[0.05364015,0.0005100977,0.0006058493,0.0007174111,0.0012919127,0.001609649,0.0013009072,0.0016803674,0.0006793879],"study_design_candidate":"randomized_trial","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.013073167,0.043903742,0.09319364,0.0022606424,0.0016787775,0.0002913213,0.0070039416,0.26820272,0.060196545,0.026360175,0.005776593,0.4780587],"study_design_scores_gemma":[0.0041319304,0.043081317,0.08105195,0.00032240327,0.0007713866,0.000192538,0.0017943718,0.7505906,0.04672652,0.060877465,0.01008777,0.00037173563],"about_ca_topic_score_codex":0.0018793894,"about_ca_topic_score_gemma":0.0016427634,"teacher_disagreement_score":0.013863661,"about_ca_system_score_codex":0.0010923304,"about_ca_system_score_gemma":0.00078754587,"threshold_uncertainty_score":0.07331896},"labels":[],"label_agreement":null},{"id":"W4393146598","doi":"10.1609/aaai.v38i21.30555","title":"Multi-world Model in Continual Reinforcement Learning","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Elevator Systems and Control","field":"Engineering","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":"Reinforcement learning; Reinforcement; Computer science; Psychology; Artificial intelligence; Social psychology","score_opus":0.053021819813128965,"score_gpt":0.27612878579897016,"score_spread":0.22310696598584118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393146598","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.035131175,0.00046934778,0.9565989,0.0008526189,0.0001161031,0.000034492245,0.00015778236,0.00041320157,0.006226268],"genre_scores_gemma":[0.9257669,0.00031192435,0.0672961,0.00021886654,0.00008699046,0.00014206796,0.00017311209,0.000082152874,0.005921921],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935526,0.00027088914,0.000023718276,0.0001792226,0.00010740621,0.000063412466],"domain_scores_gemma":[0.9980165,0.0013128832,0.00016156728,0.00021222717,0.0001617401,0.00013510784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014476542,0.0006730751,0.00085071404,0.00048318884,0.0003420501,0.0010087221,0.0017464088,0.001256274,0.0030409228],"category_scores_gemma":[0.0050403927,0.00045183644,0.00066319533,0.0005113271,0.001630118,0.0025558067,0.0012196208,0.002504404,0.00040199538],"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.000042490807,0.000037304537,0.0006749139,0.00002934155,0.000043004387,0.00009495111,0.000082160404,0.9154528,0.0004604262,0.07077609,0.00065732736,0.011649202],"study_design_scores_gemma":[0.000004680319,0.000010508015,0.000055161865,0.000002843081,0.0000031957695,0.000009349615,0.0000033388653,0.9728635,0.00006644254,0.02672117,0.00025555675,0.000004176369],"about_ca_topic_score_codex":0.0047929008,"about_ca_topic_score_gemma":0.0050551323,"teacher_disagreement_score":0.0047929008,"about_ca_system_score_codex":0.0010215115,"about_ca_system_score_gemma":0.0006052191,"threshold_uncertainty_score":0.010172844},"labels":[],"label_agreement":null},{"id":"W4393146897","doi":"10.1609/aaai.v38i19.30182","title":"Responsible Bandit Learning via Privacy-Protected Mean-Volatility Utility","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","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":"Volatility (finance); Computer science; Internet privacy; Computer security; Artificial intelligence; Business; Econometrics; Economics","score_opus":0.23644016349401392,"score_gpt":0.4303859763608097,"score_spread":0.1939458128667958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393146897","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.022455929,0.00024599495,0.97471637,0.00044697057,0.000031498133,0.0000842421,0.000036701986,0.00025548,0.0017267399],"genre_scores_gemma":[0.9118868,0.00037333067,0.084217906,0.0003698985,0.00007593811,0.0002697315,0.00008604225,0.00009755054,0.002622762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947154,0.0028370384,0.00022417365,0.0008037911,0.0008309053,0.0005887443],"domain_scores_gemma":[0.9770313,0.017461995,0.0016394579,0.0019301551,0.0013287464,0.0006083798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076377015,0.0015517671,0.002690093,0.001109194,0.0011108826,0.0028488175,0.0024110498,0.0021911801,0.002350788],"category_scores_gemma":[0.03690648,0.0006379535,0.0009377014,0.0013086986,0.003738516,0.004615293,0.0035933722,0.0035116053,0.0006248998],"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.00057717756,0.00025067927,0.002049187,0.00016813139,0.00011683233,0.00021044885,0.00028647366,0.7455083,0.0019249521,0.17386074,0.001750287,0.0732967],"study_design_scores_gemma":[0.000028615876,0.00006438934,0.00010143506,0.000017989483,0.0000132138575,0.000048320042,0.000020339083,0.939706,0.000800891,0.058922112,0.00026241541,0.000014230147],"about_ca_topic_score_codex":0.0014308528,"about_ca_topic_score_gemma":0.0009905621,"teacher_disagreement_score":0.0076377015,"about_ca_system_score_codex":0.0016788393,"about_ca_system_score_gemma":0.002568635,"threshold_uncertainty_score":0.04039246},"labels":[],"label_agreement":null},{"id":"W4393146904","doi":"10.1609/aaai.v38i18.30063","title":"Rectangle Search: An Anytime Beam Search","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Astronomy and Astrophysical Research","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Science Foundation","keywords":"Rectangle; Beam search; Computer science; Beam (structure); Mathematics; Search algorithm; Optics; Physics; Algorithm; Geometry","score_opus":0.09988811671315286,"score_gpt":0.3482290153406076,"score_spread":0.24834089862745473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393146904","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.008095864,0.0011286427,0.976537,0.00048376186,0.00019005494,0.0002320807,0.00021247727,0.0019764889,0.0111436825],"genre_scores_gemma":[0.08853618,0.00081495114,0.90070933,0.00072623714,0.00011987295,0.00045988214,0.00050848856,0.00064178155,0.0074832346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977049,0.00089400716,0.00011200285,0.0004786508,0.00060016965,0.00021026989],"domain_scores_gemma":[0.9975739,0.0011082778,0.00020005555,0.0005354704,0.0004409146,0.00014131876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026753193,0.0013295461,0.0015896306,0.0015253352,0.0009895146,0.002162068,0.0037057826,0.0023084865,0.012939478],"category_scores_gemma":[0.0065752384,0.0008105001,0.0014119396,0.0021310071,0.0014745909,0.0032346651,0.0030768292,0.0018470155,0.0036392342],"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.00092584675,0.00034800603,0.0023781692,0.00060775405,0.00031702814,0.00027456967,0.0005122739,0.28817967,0.013198073,0.13583407,0.038535535,0.51888895],"study_design_scores_gemma":[0.00034574996,0.0004572338,0.0004087512,0.00014619491,0.00011484146,0.00030295816,0.00015350289,0.893009,0.005904379,0.05246667,0.0465998,0.00009083702],"about_ca_topic_score_codex":0.004140925,"about_ca_topic_score_gemma":0.0055961176,"teacher_disagreement_score":0.012939478,"about_ca_system_score_codex":0.00087997504,"about_ca_system_score_gemma":0.0024968619,"threshold_uncertainty_score":0.04328686},"labels":[],"label_agreement":null},{"id":"W4393147067","doi":"10.1609/aaai.v38i16.29747","title":"UniCATS: A Unified Context-Aware Text-to-Speech Framework with Contextual VQ-Diffusion and Vocoding","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Speech Recognition and Synthesis","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Context (archaeology); Computer science; Linguistics; Psychology; Speech recognition; Natural language processing; Biology; Paleontology","score_opus":0.06781807521491127,"score_gpt":0.29374818100819655,"score_spread":0.22593010579328526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393147067","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.009660997,0.00097465044,0.98316795,0.0000983269,0.00018016949,0.000087270295,0.00026965875,0.0043469863,0.0012140154],"genre_scores_gemma":[0.32486624,0.001331736,0.658631,0.00045078606,0.0004182476,0.00037256876,0.0024373296,0.0009263879,0.010565682],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959105,0.00007626681,0.000025386424,0.00012435518,0.00013487985,0.000048035276],"domain_scores_gemma":[0.9997291,0.00006657781,0.000023135352,0.00004391583,0.000105335945,0.00003191987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046024055,0.0013566687,0.000806117,0.00054957217,0.00035957497,0.0007672657,0.0012465733,0.00073744263,0.0032282544],"category_scores_gemma":[0.0010152115,0.00033953367,0.0009121773,0.0004037199,0.0005042045,0.0011099334,0.001442497,0.0012037279,0.001568318],"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.0006773459,0.00015080004,0.00074038113,0.0003144523,0.0001272486,0.0003885046,0.00022901317,0.15974927,0.12229075,0.012063101,0.009542239,0.693727],"study_design_scores_gemma":[0.000041963718,0.00019373094,0.00032424374,0.00002173404,0.000041917036,0.00017018223,0.00006219266,0.95137775,0.03206662,0.0044099144,0.011247298,0.000042466025],"about_ca_topic_score_codex":0.008996177,"about_ca_topic_score_gemma":0.014026484,"teacher_disagreement_score":0.008996177,"about_ca_system_score_codex":0.00043613958,"about_ca_system_score_gemma":0.0011936101,"threshold_uncertainty_score":0.017887652},"labels":[],"label_agreement":null},{"id":"W4393147133","doi":"10.1609/aaai.v38i17.29909","title":"Investigating the Effectiveness of Task-Agnostic Prefix Prompt for Instruction Following","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Intelligent Tutoring Systems and Adaptive Learning","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":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; Korea Advanced Institute of Science and Technology","keywords":"Prefix; Task (project management); Computer science; Linguistics; Engineering; Philosophy","score_opus":0.059484286769755805,"score_gpt":0.29823548329721417,"score_spread":0.23875119652745835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393147133","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.9148814,0.00081149,0.073638305,0.00031483555,0.00021508252,0.00022476315,0.00030952305,0.0056510596,0.003953497],"genre_scores_gemma":[0.9662299,0.00013567257,0.031988896,0.00023433313,0.00002679878,0.00007829335,0.0004286357,0.00020246043,0.0006750316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827373,0.00071382156,0.00013731852,0.0005950941,0.0001679704,0.00011206276],"domain_scores_gemma":[0.9699312,0.023468964,0.0016037714,0.0032233486,0.0008967072,0.0008761222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003130178,0.0010477678,0.0005537571,0.00025551824,0.00024928767,0.0013083434,0.001385629,0.0010366683,0.0029772173],"category_scores_gemma":[0.048734456,0.00033539408,0.00033075258,0.00022417044,0.0004375886,0.0030758874,0.0010442113,0.0021763367,0.0009699451],"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.0069214194,0.003247762,0.048342135,0.0017266353,0.00039705393,0.0005641622,0.0019209553,0.052795347,0.2701784,0.0026988008,0.0037622277,0.6074451],"study_design_scores_gemma":[0.0007537356,0.011238346,0.10236995,0.00028992412,0.0011092961,0.0015685584,0.0017944797,0.6306662,0.22191817,0.0147814,0.013140238,0.00036982054],"about_ca_topic_score_codex":0.0017323154,"about_ca_topic_score_gemma":0.0014623293,"teacher_disagreement_score":0.003130178,"about_ca_system_score_codex":0.00048736887,"about_ca_system_score_gemma":0.0010320683,"threshold_uncertainty_score":0.016554177},"labels":[],"label_agreement":null},{"id":"W4393147174","doi":"10.1609/aaai.v38i15.29631","title":"Class-Attribute Priors: Adapting Optimization to Heterogeneity and Fairness Objective","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Environmental Sustainability in Business","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Prior probability; Class (philosophy); Mathematical optimization; Computer science; Mathematics; Econometrics; Artificial intelligence; Bayesian probability","score_opus":0.04407060008561759,"score_gpt":0.2720362603132241,"score_spread":0.2279656602276065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393147174","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.03436742,0.00049126596,0.96046126,0.0008339861,0.00006844958,0.000094781855,0.00010472541,0.00072434,0.002853741],"genre_scores_gemma":[0.721249,0.00029123572,0.2727681,0.00089078356,0.00023204106,0.00026379872,0.00033964583,0.00047213334,0.0034932992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961493,0.0019787366,0.0001269875,0.00065037597,0.0008076133,0.0002870416],"domain_scores_gemma":[0.98841417,0.0076444917,0.0006983194,0.0016148316,0.0012339838,0.00039409622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01036866,0.0012394417,0.0014065298,0.00085892476,0.00057421124,0.0021329466,0.0023547155,0.0020688185,0.0019127504],"category_scores_gemma":[0.030530248,0.0005814892,0.0006659809,0.000904523,0.0016221026,0.0030541804,0.002734638,0.0037921795,0.0005810255],"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.00034534678,0.0002793746,0.0038439,0.00013654275,0.000097728,0.00007568525,0.00021081665,0.7900727,0.003191864,0.04274942,0.005637156,0.15335941],"study_design_scores_gemma":[0.000017260536,0.000033618267,0.0003198736,0.000015365504,0.000008252815,0.0000151665145,0.000012218046,0.97714615,0.0008851374,0.020739311,0.00079877465,0.000008919727],"about_ca_topic_score_codex":0.0024370004,"about_ca_topic_score_gemma":0.0021677373,"teacher_disagreement_score":0.01036866,"about_ca_system_score_codex":0.0018104592,"about_ca_system_score_gemma":0.0018776907,"threshold_uncertainty_score":0.05483538},"labels":[],"label_agreement":null},{"id":"W4393147176","doi":"10.1609/aaai.v38i15.29576","title":"PerFedRLNAS: One-for-All Personalized Federated Neural Architecture Search","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Neural Networks and Applications","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":"Architecture; Computer science; Computer architecture; Data science; World Wide Web; Information retrieval; Artificial intelligence; Geography","score_opus":0.1151290282026288,"score_gpt":0.3315411980751283,"score_spread":0.21641216987249948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393147176","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.03824724,0.00049460586,0.94139725,0.00039833653,0.00011659343,0.00020205877,0.0002863116,0.014265332,0.0045923125],"genre_scores_gemma":[0.5085294,0.00019722544,0.48070174,0.0006365052,0.000057837042,0.00029762762,0.0013464718,0.00067208894,0.007561202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989844,0.0002498069,0.000064582724,0.0002698631,0.00024827692,0.0001830351],"domain_scores_gemma":[0.99880373,0.0003404035,0.00007090099,0.00049088383,0.0002085952,0.00008546936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001857357,0.0013079247,0.0011992833,0.0008563901,0.0008168194,0.0011303751,0.0027581877,0.0017020662,0.0043404116],"category_scores_gemma":[0.0049016457,0.0005053027,0.0009443207,0.0007712197,0.00070958654,0.0027180214,0.0025700135,0.0015679051,0.0013522041],"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.00043513608,0.00043791824,0.0035678588,0.00014368778,0.00015036782,0.0002412632,0.00017430383,0.33726627,0.005357477,0.010741802,0.016662776,0.6248211],"study_design_scores_gemma":[0.000044656943,0.000076554046,0.00020035796,0.00001026576,0.000019024885,0.00009576468,0.000039020226,0.98337585,0.0024794037,0.011301925,0.0023430912,0.0000141589135],"about_ca_topic_score_codex":0.006658058,"about_ca_topic_score_gemma":0.014223155,"teacher_disagreement_score":0.006658058,"about_ca_system_score_codex":0.001230908,"about_ca_system_score_gemma":0.001899803,"threshold_uncertainty_score":0.014520109},"labels":[],"label_agreement":null},{"id":"W4393147203","doi":"10.1609/aaai.v38i15.29573","title":"Leveraging Normalization Layer in Adapters with Progressive Learning and Adaptive Distillation for Cross-Domain Few-Shot Learning","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","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":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; Korea Advanced Institute of Science and Technology","keywords":"Normalization (sociology); Computer science; Distillation; Shot (pellet); Layer (electronics); Artificial intelligence; Materials science; Chemistry; Chromatography; Nanotechnology","score_opus":0.07970498633852996,"score_gpt":0.32645086472122903,"score_spread":0.24674587838269907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393147203","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.03304473,0.0006016687,0.95667547,0.00020548163,0.00008946565,0.00017435059,0.00014616702,0.0074922633,0.0015703634],"genre_scores_gemma":[0.5290129,0.00032931482,0.4620069,0.00094373355,0.00010653424,0.0004667669,0.0015368775,0.00071635627,0.0048806104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979907,0.00047320852,0.000114036935,0.0008132651,0.00041830537,0.00019047047],"domain_scores_gemma":[0.99704677,0.0009796259,0.00019760641,0.0011532344,0.00042095853,0.00020174247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037594032,0.0018724022,0.0020155704,0.0011615012,0.0008093833,0.001512134,0.0047776387,0.002127219,0.0027585786],"category_scores_gemma":[0.010785534,0.00083829963,0.0011808639,0.0010864654,0.0019043946,0.0051656477,0.005836078,0.0043604835,0.0015973914],"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.00056128035,0.000675594,0.0051813205,0.00031381866,0.00029787363,0.0003013918,0.00068461726,0.1946832,0.032551773,0.013156439,0.0068082693,0.7447844],"study_design_scores_gemma":[0.000027098467,0.00013758536,0.0006094199,0.000021634636,0.000036298363,0.00010543946,0.000075235126,0.972431,0.0124500645,0.011956131,0.0021150154,0.00003500814],"about_ca_topic_score_codex":0.004811682,"about_ca_topic_score_gemma":0.008171631,"teacher_disagreement_score":0.004811682,"about_ca_system_score_codex":0.0012073277,"about_ca_system_score_gemma":0.0016481354,"threshold_uncertainty_score":0.019881845},"labels":[],"label_agreement":null},{"id":"W4393147226","doi":"10.1609/aaai.v38i13.29405","title":"SimPSI: A Simple Strategy to Preserve Spectral Information in Time Series Data Augmentation","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Time Series Analysis and Forecasting","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":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea","keywords":"Simple (philosophy); Series (stratigraphy); Computer science; Epistemology; Geology; Philosophy","score_opus":0.08581020756096937,"score_gpt":0.31135100357667467,"score_spread":0.2255407960157053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393147226","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.041650455,0.00042132472,0.94565886,0.0002331085,0.00022139815,0.00021997374,0.0007467358,0.0084619075,0.002386239],"genre_scores_gemma":[0.33186513,0.00045191048,0.6609338,0.0002892515,0.00014323325,0.0004669984,0.0021731034,0.00091927144,0.002757346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996456,0.00005752718,0.000028499835,0.000113712034,0.000116584626,0.00003818671],"domain_scores_gemma":[0.9990416,0.00032800538,0.00009764851,0.0002860532,0.00018233038,0.00006430077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009141942,0.0013589782,0.0007474344,0.0012156906,0.00045093824,0.0008198145,0.0013477112,0.00061279227,0.004121261],"category_scores_gemma":[0.0038903595,0.00042887538,0.00090841646,0.0014622186,0.00077973714,0.0018407317,0.00234967,0.001446146,0.0011688415],"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.0007518787,0.00045023044,0.0028580166,0.0005617237,0.00020400084,0.0003454411,0.0005780208,0.10271304,0.12693876,0.0076750712,0.01126712,0.7456568],"study_design_scores_gemma":[0.00007790795,0.00043420753,0.0031829698,0.000043376775,0.00009208656,0.00029947938,0.00014107898,0.89417034,0.0764286,0.013032303,0.012019524,0.000078114324],"about_ca_topic_score_codex":0.0015878751,"about_ca_topic_score_gemma":0.0026849217,"teacher_disagreement_score":0.004121261,"about_ca_system_score_codex":0.00027222442,"about_ca_system_score_gemma":0.00080403,"threshold_uncertainty_score":0.013787031},"labels":[],"label_agreement":null},{"id":"W4393147232","doi":"10.1609/aaai.v38i13.29404","title":"Scaling Up Semi-supervised Learning with Unconstrained Unlabelled Data","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Mitacs","keywords":"Scaling; Artificial intelligence; Computer science; Machine learning; Semi-supervised learning; Mathematics","score_opus":0.10527602704660391,"score_gpt":0.31731090033649584,"score_spread":0.21203487328989193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393147232","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.023502415,0.00027401577,0.9711902,0.00022122919,0.00007161938,0.00015353049,0.00015736153,0.002994677,0.0014349768],"genre_scores_gemma":[0.31260145,0.00021035418,0.6807243,0.0006499816,0.00017015565,0.00048872025,0.0017037966,0.0007171387,0.0027340963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939604,0.0025071837,0.00022570741,0.0014963011,0.0015627774,0.00024767677],"domain_scores_gemma":[0.9834772,0.008035016,0.0011089459,0.00445574,0.0024102887,0.0005128144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007366582,0.0020326076,0.001999297,0.0013787604,0.0008930499,0.0018215568,0.004551933,0.002228853,0.0019915958],"category_scores_gemma":[0.01978289,0.0010098456,0.0014068687,0.0010165569,0.002321343,0.004550408,0.0045967274,0.0033113286,0.0020369862],"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.00045987946,0.0006728616,0.0043592495,0.00052342983,0.00032045846,0.00023888276,0.00056771963,0.42524004,0.02548696,0.010843966,0.01076904,0.5205175],"study_design_scores_gemma":[0.000026102514,0.00008252767,0.0003536621,0.000023002196,0.000014639378,0.00006509005,0.00004083792,0.9754455,0.006197367,0.016205745,0.0015214243,0.000024128312],"about_ca_topic_score_codex":0.0017665178,"about_ca_topic_score_gemma":0.003334954,"teacher_disagreement_score":0.007366582,"about_ca_system_score_codex":0.0010519826,"about_ca_system_score_gemma":0.0015689736,"threshold_uncertainty_score":0.03895867},"labels":[],"label_agreement":null},{"id":"W4393147243","doi":"10.1609/aaai.v38i13.29407","title":"XKD: Cross-Modal Knowledge Distillation with Domain Alignment for Video Representation Learning","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Multimodal Machine Learning Applications","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Vector Institute","funders":"Mitacs","keywords":"Modal; Representation (politics); Computer science; Domain (mathematical analysis); Artificial intelligence; Computer vision; Mathematics; Chemistry","score_opus":0.05995314657169955,"score_gpt":0.36507794310485103,"score_spread":0.3051247965331515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393147243","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.015916096,0.00093017536,0.97052956,0.0003533414,0.00013293627,0.0001418611,0.0010674383,0.00872787,0.0022007625],"genre_scores_gemma":[0.38525066,0.0005932584,0.5918438,0.0011986949,0.0001951815,0.0006787919,0.01006352,0.0007805117,0.009395578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986628,0.00040275053,0.000062086125,0.00050819153,0.00022820148,0.00013583791],"domain_scores_gemma":[0.99877495,0.0005141965,0.00009637752,0.00032988607,0.00020751261,0.000077114804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001818627,0.0018662572,0.001091334,0.0010650291,0.0006220787,0.0011957188,0.00319856,0.0018446337,0.0043736775],"category_scores_gemma":[0.0044669886,0.00063089246,0.0011405108,0.0010036903,0.0010839521,0.0026284694,0.003897308,0.0037713856,0.002035519],"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.0005185932,0.0005339151,0.0018154804,0.00049658486,0.00022334653,0.00019208025,0.0002796903,0.16648822,0.018939817,0.011162733,0.028098805,0.7712507],"study_design_scores_gemma":[0.00004939598,0.00011334307,0.00029964992,0.000029198738,0.000022772729,0.000068689485,0.000047796115,0.9728767,0.009805495,0.012187341,0.0044759964,0.000023606251],"about_ca_topic_score_codex":0.004392272,"about_ca_topic_score_gemma":0.0062828157,"teacher_disagreement_score":0.004392272,"about_ca_system_score_codex":0.00111014,"about_ca_system_score_gemma":0.0014451762,"threshold_uncertainty_score":0.014631391},"labels":[],"label_agreement":null},{"id":"W4393147261","doi":"10.1609/aaai.v38i12.29207","title":"Adversarially Balanced Representation for Continuous Treatment Effect Estimation","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning in Healthcare","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Estimation; Representation (politics); Econometrics; Mathematics; Computer science; Statistics; Economics; Political science; Politics","score_opus":0.06216737595107504,"score_gpt":0.3629386076178497,"score_spread":0.30077123166677466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393147261","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.017635051,0.0010557545,0.97677064,0.0016422727,0.00010016031,0.00011562393,0.00061717187,0.0005153213,0.0015479829],"genre_scores_gemma":[0.7950919,0.0011175382,0.19149537,0.0022783042,0.0004083396,0.00092481216,0.0021762361,0.00016668437,0.00634073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959341,0.002759906,0.00011088079,0.0006666576,0.0003467005,0.0001817265],"domain_scores_gemma":[0.9834373,0.013919422,0.0009025882,0.0011532032,0.00036757963,0.00021996426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0109571945,0.0013388016,0.0019434098,0.000829217,0.00037174957,0.0010059184,0.0023055156,0.002389119,0.004176378],"category_scores_gemma":[0.025530877,0.0005732931,0.0012943378,0.0008415154,0.0019826575,0.0016502795,0.0017420456,0.003660344,0.00071295234],"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.0005591715,0.0001530427,0.00290273,0.00024165241,0.00022900233,0.00019138459,0.00011638867,0.840796,0.0009637974,0.062404945,0.006112812,0.08532908],"study_design_scores_gemma":[0.000039733102,0.000059877384,0.000337078,0.00003653058,0.00003499322,0.00003674655,0.0000070037113,0.9434818,0.0003943283,0.05460069,0.00095925096,0.000011929141],"about_ca_topic_score_codex":0.0026273583,"about_ca_topic_score_gemma":0.0024026518,"teacher_disagreement_score":0.0109571945,"about_ca_system_score_codex":0.0016794502,"about_ca_system_score_gemma":0.001383767,"threshold_uncertainty_score":0.057947874},"labels":[],"label_agreement":null},{"id":"W4393147283","doi":"10.1609/aaai.v38i13.29422","title":"Region-Disentangled Diffusion Model for High-Fidelity PPG-to-ECG Translation","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced MRI Techniques and Applications","field":"Medicine","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Mitacs","keywords":"Fidelity; Translation (biology); Diffusion; Computer science; High fidelity; Artificial intelligence; Physics; Biology; Telecommunications; Acoustics","score_opus":0.15067023525466722,"score_gpt":0.3775426997521993,"score_spread":0.22687246449753207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393147283","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.008480214,0.00068394246,0.98891443,0.0002812245,0.000061074505,0.000027720518,0.00015306805,0.0005110196,0.00088736246],"genre_scores_gemma":[0.52337545,0.0025117695,0.45957962,0.00065386645,0.0002382046,0.00026178913,0.0016081657,0.00051956845,0.011251554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965644,0.00010653419,0.000023865236,0.0001031317,0.0000797466,0.000030287916],"domain_scores_gemma":[0.9987012,0.00088587194,0.00009501213,0.00010943018,0.0001577438,0.000050694016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00108944,0.0010502187,0.0008908202,0.00045012034,0.00025637454,0.0009746598,0.0011890432,0.0017361317,0.002391731],"category_scores_gemma":[0.004433334,0.0004922187,0.0011713459,0.0005461349,0.0006026031,0.0012381361,0.001026588,0.0021537605,0.0012482724],"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.00023728122,0.00008336244,0.0008173936,0.00024924695,0.000076589364,0.00028790272,0.00012910382,0.83338535,0.019878289,0.017890604,0.0030510183,0.12391382],"study_design_scores_gemma":[0.000004938461,0.000014311881,0.00006464428,0.000005208245,0.0000050577723,0.00003544377,0.0000030800736,0.99623483,0.0009466887,0.0021534981,0.00052594143,0.000006371224],"about_ca_topic_score_codex":0.004515006,"about_ca_topic_score_gemma":0.0038647493,"teacher_disagreement_score":0.004515006,"about_ca_system_score_codex":0.000604663,"about_ca_system_score_gemma":0.00073209376,"threshold_uncertainty_score":0.008977413},"labels":[],"label_agreement":null},{"id":"W4393147294","doi":"10.1609/aaai.v38i14.29451","title":"DP-AdamBC: Your DP-Adam Is Actually DP-SGD (Unless You Apply Bias Correction)","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada","keywords":"Psychology; Economics; Computer science","score_opus":0.14335753073400995,"score_gpt":0.3261501804910673,"score_spread":0.18279264975705736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393147294","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.011248804,0.0011233757,0.93886596,0.0033453298,0.0014854519,0.0001820148,0.0013863547,0.028980969,0.013381772],"genre_scores_gemma":[0.16274014,0.0008731077,0.7878111,0.0024277477,0.00045475122,0.00051740627,0.0038264727,0.010603406,0.030745812],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989567,0.00030689934,0.00007415816,0.00026329866,0.00028191684,0.00011698559],"domain_scores_gemma":[0.998409,0.00048261482,0.00011040106,0.0004632742,0.00041117394,0.00012351367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019246094,0.0015517584,0.0010502192,0.0003912122,0.0005751616,0.0017068579,0.0018987752,0.0027460873,0.02156528],"category_scores_gemma":[0.009449648,0.0007870057,0.00059706555,0.0005686133,0.0009958607,0.0021476103,0.0019281738,0.0044266735,0.014510369],"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.00063995674,0.00017531805,0.0019426262,0.0005086403,0.0002240787,0.0003302847,0.00016732204,0.1700829,0.01094861,0.04391354,0.34203896,0.42902783],"study_design_scores_gemma":[0.00012217269,0.00007901034,0.00044281976,0.00007103471,0.000020369533,0.00026007168,0.000024975465,0.90768886,0.018731797,0.02177946,0.05073903,0.00004042891],"about_ca_topic_score_codex":0.0035344402,"about_ca_topic_score_gemma":0.005531895,"teacher_disagreement_score":0.02156528,"about_ca_system_score_codex":0.0007350164,"about_ca_system_score_gemma":0.0016878198,"threshold_uncertainty_score":0.07214308},"labels":[],"label_agreement":null},{"id":"W4393147413","doi":"10.1609/aaai.v38i10.29070","title":"Causal Adversarial Perturbations for Individual Fairness and Robustness in Heterogeneous Data Spaces","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"Bundesministerium für Bildung und Forschung; Compute Canada; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Adversarial system; Robustness (evolution); Computer science; Econometrics; Psychology; Mathematics; Artificial intelligence; Biology","score_opus":0.11249251735549742,"score_gpt":0.33436862176287313,"score_spread":0.2218761044073757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393147413","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.017228529,0.00014519984,0.98103714,0.00034719336,0.000030768882,0.000040670086,0.00003263003,0.00014595914,0.0009919633],"genre_scores_gemma":[0.8848751,0.00018631176,0.11258187,0.0002809173,0.00012156465,0.00013201885,0.00011672242,0.000072922754,0.0016326129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961165,0.0017568016,0.0001730493,0.00080781936,0.00088488887,0.00026099355],"domain_scores_gemma":[0.98422205,0.011298034,0.0013499255,0.002014223,0.00074121315,0.0003746165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006697183,0.00086798554,0.0010631608,0.0010036797,0.0009573067,0.0014343474,0.0014999427,0.0012166632,0.0011547909],"category_scores_gemma":[0.026472902,0.00035168344,0.00081624754,0.0006982287,0.0030697114,0.0026540323,0.002891864,0.0028044772,0.00018039056],"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.00012825815,0.00005882119,0.0025038193,0.00006471096,0.00007718329,0.00011526001,0.00012843711,0.85926193,0.0027534885,0.10015689,0.0009499136,0.033801217],"study_design_scores_gemma":[0.0000036924412,0.000021580452,0.00020152974,0.0000069527987,0.000006545636,0.000022313021,0.000009878584,0.9482461,0.00089349685,0.050220225,0.00035976962,0.000007820262],"about_ca_topic_score_codex":0.00162738,"about_ca_topic_score_gemma":0.0016539382,"teacher_disagreement_score":0.006697183,"about_ca_system_score_codex":0.001775318,"about_ca_system_score_gemma":0.0014775652,"threshold_uncertainty_score":0.03541851},"labels":[],"label_agreement":null},{"id":"W4393147477","doi":"10.1609/aaai.v38i9.28879","title":"Improving Transferability for Cross-Domain Trajectory Prediction via Neural Stochastic Differential Equation","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Traffic Prediction and Management Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; National Research Foundation of Korea; National Research Foundation","keywords":"Transferability; Trajectory; Stochastic differential equation; Domain (mathematical analysis); Computer science; Applied mathematics; Artificial intelligence; Mathematics; Machine learning; Mathematical analysis; Physics","score_opus":0.044258337241648,"score_gpt":0.27407424954725385,"score_spread":0.22981591230560583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393147477","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.044046987,0.00026244478,0.9527466,0.00038268758,0.00007306758,0.000048038954,0.00018908543,0.0009319467,0.0013190237],"genre_scores_gemma":[0.88393587,0.0002772562,0.11124032,0.00023454522,0.00007124766,0.00016109929,0.001026671,0.0001344307,0.0029185282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999521,0.00008796437,0.000040786435,0.00019564776,0.000095798736,0.000058832924],"domain_scores_gemma":[0.99806434,0.0011659587,0.00017672316,0.00014738507,0.0003819835,0.00006363618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016175807,0.0008720987,0.00097067317,0.0005275277,0.0004756901,0.00079793495,0.0013819358,0.0011557902,0.0012087962],"category_scores_gemma":[0.006709356,0.0005342965,0.00081806566,0.00061931106,0.00055320165,0.0014337813,0.0014183748,0.0023255532,0.0003554342],"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.00004161278,0.00004241224,0.0015958878,0.00002882447,0.00002956698,0.00005057168,0.000031879805,0.96106327,0.001134833,0.0026793426,0.0007250062,0.032576773],"study_design_scores_gemma":[9.170613e-7,0.0000022939057,0.000043164557,6.849999e-7,9.543662e-7,0.0000016573576,9.406021e-7,0.99954104,0.000085712745,0.00028556614,0.000036071222,9.4205006e-7],"about_ca_topic_score_codex":0.03297182,"about_ca_topic_score_gemma":0.017221458,"teacher_disagreement_score":0.03297182,"about_ca_system_score_codex":0.0011810304,"about_ca_system_score_gemma":0.0016952616,"threshold_uncertainty_score":0.065559804},"labels":[],"label_agreement":null},{"id":"W4393147499","doi":"10.1609/aaai.v38i9.28820","title":"How to Evaluate Behavioral Models","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Behavioral and Psychological Studies","field":"Psychology","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of British Columbia","funders":"Universities Space Research Association; Alberta Machine Intelligence Institute; Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; Canadian Institute for Advanced Research","keywords":"Psychology; Computer science","score_opus":0.5217428008825785,"score_gpt":0.43039893671749707,"score_spread":0.09134386416508145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393147499","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031543735,0.001372783,0.9281941,0.015086888,0.0006012099,0.00044647223,0.0011733499,0.0024291908,0.01915232],"genre_scores_gemma":[0.4206609,0.0011278291,0.56704736,0.003172794,0.00033473453,0.0010872921,0.0020671536,0.0011383846,0.0033635423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96484196,0.022403242,0.002198399,0.002853728,0.0067090155,0.000993586],"domain_scores_gemma":[0.8544774,0.09478331,0.0076424405,0.01746649,0.022803342,0.002826956],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.045953684,0.002238557,0.0022256717,0.0035060318,0.0013202721,0.010312105,0.0035329072,0.0038370518,0.0073682317],"category_scores_gemma":[0.26006275,0.0011085765,0.001886409,0.0019530691,0.004431979,0.015043039,0.0037179391,0.0064377976,0.0029473703],"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.000506161,0.00048506606,0.019658906,0.0009844992,0.0007147039,0.00016460489,0.001309355,0.17401136,0.0020295854,0.43489966,0.032277364,0.33295873],"study_design_scores_gemma":[0.00009514447,0.00020231877,0.002785576,0.0005321521,0.00010047276,0.00008255698,0.00054315187,0.32887414,0.0020422132,0.6521436,0.012469758,0.00012895976],"about_ca_topic_score_codex":0.0066853357,"about_ca_topic_score_gemma":0.004165202,"teacher_disagreement_score":0.9540463,"about_ca_system_score_codex":0.004058414,"about_ca_system_score_gemma":0.00530396,"threshold_uncertainty_score":0.24302918},"labels":[],"label_agreement":null},{"id":"W4393147537","doi":"10.1609/aaai.v38i9.28911","title":"Approximation Algorithms for Preference Aggregation Using CP-Nets","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Preference; Computer science; Algorithm; Mathematics; Statistics","score_opus":0.18741315148499102,"score_gpt":0.3373779337649477,"score_spread":0.14996478227995666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393147537","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.01041726,0.00013268496,0.98715836,0.00014686886,0.00002595734,0.00006004915,0.000068384965,0.00029663715,0.0016938004],"genre_scores_gemma":[0.25969467,0.00036167697,0.73631895,0.00016944016,0.00006688268,0.00025351316,0.0005184609,0.00013067423,0.0024856902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969489,0.0011104274,0.00019793819,0.0005606297,0.0008237167,0.00035840078],"domain_scores_gemma":[0.99467224,0.00360324,0.00035580175,0.0007615285,0.00044916235,0.0001580248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041165766,0.0012045262,0.0012027703,0.001045242,0.00077119947,0.001972656,0.0022742178,0.0011395242,0.0029109865],"category_scores_gemma":[0.014185511,0.00065797655,0.0014959972,0.0024060018,0.0011541306,0.0040156906,0.001888351,0.0033946324,0.00053092133],"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.00028812862,0.0001429783,0.0010229348,0.00020111531,0.00010006466,0.00006172293,0.00015543641,0.72216994,0.0016081794,0.15270251,0.002965088,0.11858196],"study_design_scores_gemma":[0.000016863807,0.000025856296,0.000060616825,0.0000099118015,0.000010745511,0.000025767578,0.000018108554,0.9369852,0.00066954555,0.061258703,0.0009133074,0.0000054414586],"about_ca_topic_score_codex":0.0041474863,"about_ca_topic_score_gemma":0.004462985,"teacher_disagreement_score":0.0041474863,"about_ca_system_score_codex":0.0030723347,"about_ca_system_score_gemma":0.0023907379,"threshold_uncertainty_score":0.022291481},"labels":[],"label_agreement":null},{"id":"W4393147607","doi":"10.1609/aaai.v38i14.29497","title":"Lost Domain Generalization Is a Natural Consequence of Lack of Training Domains","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","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 Waterloo","funders":"","keywords":"Generalization; Natural (archaeology); Training (meteorology); Domain (mathematical analysis); Computer science; Psychology; Artificial intelligence; Mathematics; History; Geography","score_opus":0.14685991232785084,"score_gpt":0.3403925985309042,"score_spread":0.19353268620305336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393147607","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.1566231,0.0012866154,0.8304766,0.003107807,0.0001460218,0.00022343989,0.000612159,0.0015957317,0.005928625],"genre_scores_gemma":[0.7453358,0.00060857856,0.24661413,0.0018669945,0.00018280774,0.00052362186,0.0013601704,0.00043953193,0.0030684115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9919851,0.0023624212,0.00067969697,0.002627431,0.001819772,0.0005254721],"domain_scores_gemma":[0.9350708,0.044069998,0.0026084164,0.014821212,0.0022573306,0.0011722632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010209936,0.001267979,0.002731046,0.0009517904,0.0013451619,0.0022303762,0.0034136355,0.0026616517,0.0023276939],"category_scores_gemma":[0.05860348,0.00090277434,0.0018735228,0.0010427078,0.0040172185,0.0057180994,0.00541513,0.005793569,0.0008539968],"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.0013114595,0.00067360554,0.024746092,0.00086431485,0.00037306364,0.0008668573,0.0006707516,0.58696675,0.018791866,0.06968399,0.015430275,0.27962098],"study_design_scores_gemma":[0.000105848114,0.00052024506,0.004508443,0.00007975387,0.00006641657,0.0009794362,0.00017270097,0.81384146,0.013041116,0.16122319,0.0054125544,0.000048876158],"about_ca_topic_score_codex":0.0016798394,"about_ca_topic_score_gemma":0.0013705258,"teacher_disagreement_score":0.010209936,"about_ca_system_score_codex":0.0016549794,"about_ca_system_score_gemma":0.0015096623,"threshold_uncertainty_score":0.053995907},"labels":[],"label_agreement":null},{"id":"W4393147688","doi":"10.1609/aaai.v38i9.28933","title":"Abstraction of Situation Calculus Concurrent Game Structures","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Research in Systems and Signal Processing","field":"Engineering","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":"University of Regina; York University","funders":"","keywords":"Abstraction; Computer science; Programming language; Calculus (dental); Situation calculus; Pi calculus; Theoretical computer science; Epistemology; Philosophy; Medicine","score_opus":0.07680000264086553,"score_gpt":0.33137887336298294,"score_spread":0.2545788707221174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393147688","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.012714268,0.00009392009,0.9799733,0.00016887198,0.000049650167,0.000117084135,0.00011612192,0.0008942717,0.0058724554],"genre_scores_gemma":[0.44617876,0.00028431686,0.5450075,0.00019508626,0.00010084494,0.0005232595,0.00038268487,0.00027686456,0.0070505636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967577,0.00088881125,0.0003082607,0.00046567406,0.0010614988,0.0005182],"domain_scores_gemma":[0.9974861,0.0009878163,0.00022528332,0.000638429,0.00046454318,0.000197731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002611223,0.0011394265,0.0007422376,0.0011509461,0.0011046529,0.0026815147,0.0022854283,0.00082081044,0.0036017492],"category_scores_gemma":[0.0052937437,0.00079166464,0.0025197961,0.0009477526,0.0031031924,0.0048034755,0.002846532,0.0029549594,0.00053805154],"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.00003829896,0.000032577176,0.00024299404,0.00005933703,0.000023123399,0.00020795903,0.00058375136,0.0282754,0.0020027817,0.9597684,0.0004609476,0.008304439],"study_design_scores_gemma":[0.000051027346,0.00005003547,0.00012823797,0.000034554992,0.000054280215,0.00012316045,0.00011205666,0.1721264,0.0035508443,0.8085748,0.015161158,0.00003340776],"about_ca_topic_score_codex":0.0068994327,"about_ca_topic_score_gemma":0.005379167,"teacher_disagreement_score":0.0068994327,"about_ca_system_score_codex":0.0022670298,"about_ca_system_score_gemma":0.0026260416,"threshold_uncertainty_score":0.016448557},"labels":[],"label_agreement":null},{"id":"W4393147733","doi":"10.1609/aaai.v38i9.28846","title":"Pay to (Not) Play: Monetizing Impatience in Mobile Games","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Digital Games and Media","field":"Social Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Machine Intelligence Institute; Defense Advanced Research Projects Agency; Shanghai Municipal Education Commission; National Natural Science Foundation of China; Canadian Institute for Advanced Research","keywords":"Economics; Business; Microeconomics; Computer science","score_opus":0.06794625463560242,"score_gpt":0.3431910483937216,"score_spread":0.27524479375811917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393147733","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.55109155,0.0012824495,0.3339876,0.0058754617,0.00022706513,0.00038610862,0.0001609792,0.0004679459,0.106520854],"genre_scores_gemma":[0.9873043,0.00014510908,0.008882751,0.00021053269,0.000033168202,0.00004762049,0.000018603441,0.00004376216,0.0033141694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.997624,0.001336609,0.0000690283,0.00026256675,0.000266695,0.00044108875],"domain_scores_gemma":[0.99167866,0.005235054,0.0009496949,0.0005805003,0.00040073894,0.0011553725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021938225,0.001007354,0.0008161542,0.00066747447,0.0014283899,0.0047605196,0.0021503833,0.0017856344,0.0071479646],"category_scores_gemma":[0.018202381,0.0007219005,0.00061168533,0.00065410195,0.0028998938,0.00511973,0.003618433,0.0028388991,0.0005928715],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013081871,0.0010943062,0.014090145,0.00032811816,0.00019951569,0.0011094518,0.0029920563,0.23190713,0.0072806333,0.6467871,0.006573472,0.08632989],"study_design_scores_gemma":[0.00015440767,0.00059404946,0.006059154,0.000098361124,0.00011845645,0.0007752153,0.0016276233,0.6963046,0.0018052137,0.28209004,0.010259337,0.00011352521],"about_ca_topic_score_codex":0.0042147795,"about_ca_topic_score_gemma":0.006289303,"teacher_disagreement_score":0.0071479646,"about_ca_system_score_codex":0.0029173559,"about_ca_system_score_gemma":0.0012769707,"threshold_uncertainty_score":0.02391231},"labels":[],"label_agreement":null},{"id":"W4393147811","doi":"10.1609/aaai.v38i10.29037","title":"Make Prompts Adaptable: Bayesian Modeling for Vision-Language Prompt Learning with Data-Dependent Prior","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Multimodal Machine Learning Applications","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":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea","keywords":"Computer science; Bayesian probability; Artificial intelligence; Machine learning; Bayesian statistics; Natural language processing; Bayesian inference; Psychology; Cognitive psychology","score_opus":0.07165001741030415,"score_gpt":0.3458690247856473,"score_spread":0.27421900737534316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393147811","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.0075922906,0.00017209961,0.99014926,0.00029084398,0.00003621502,0.000054383127,0.00015327612,0.0010017194,0.00054990186],"genre_scores_gemma":[0.54220384,0.00052068563,0.44728947,0.0008158844,0.00017701756,0.00062525197,0.001221243,0.0004961975,0.0066503915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991998,0.00029333454,0.00003316176,0.00024771402,0.00015196446,0.00007400225],"domain_scores_gemma":[0.9977621,0.0013244941,0.00016069548,0.00023295096,0.0003653506,0.00015438185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022330328,0.0009788241,0.0011061444,0.0006613277,0.00047268454,0.0011905635,0.0027227378,0.0018425215,0.0028562231],"category_scores_gemma":[0.012201844,0.00094143476,0.0009253184,0.0006475602,0.0010558743,0.0029609194,0.0019095769,0.003446839,0.00086974143],"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.00036764695,0.00024450792,0.0019963447,0.00018693147,0.00006337899,0.00015728784,0.00034765352,0.71359164,0.0056218607,0.059226736,0.008066742,0.21012917],"study_design_scores_gemma":[0.000013889093,0.000021595504,0.000101295824,0.0000075247267,0.0000039567376,0.000012643895,0.000008249413,0.97930086,0.00060703437,0.019287195,0.0006269434,0.000008844741],"about_ca_topic_score_codex":0.007575768,"about_ca_topic_score_gemma":0.010675109,"teacher_disagreement_score":0.007575768,"about_ca_system_score_codex":0.001476009,"about_ca_system_score_gemma":0.0019058607,"threshold_uncertainty_score":0.015063345},"labels":[],"label_agreement":null},{"id":"W4393147976","doi":"10.1609/aaai.v38i8.28750","title":"Anchoring Path for Inductive Relation Prediction in Knowledge Graphs","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","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":"BC Research (Canada)","funders":"National Research Foundation Singapore; National Research Foundation","keywords":"Relation (database); Path (computing); Computer science; Knowledge graph; Theoretical computer science; Artificial intelligence; Data mining; Computer network","score_opus":0.07779860327567567,"score_gpt":0.3145675342564972,"score_spread":0.23676893098082152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393147976","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.06533757,0.0016014823,0.904634,0.0009350736,0.000117769516,0.00043691197,0.0073575145,0.015337677,0.004241976],"genre_scores_gemma":[0.47085586,0.00085037074,0.501209,0.00048135215,0.000083269835,0.00030299954,0.022454996,0.00043356683,0.0033285343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874,0.00038032766,0.00007411691,0.00044392564,0.0002876051,0.00007387698],"domain_scores_gemma":[0.9952311,0.0032739267,0.00032499997,0.000556494,0.0004959419,0.000117630436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015128814,0.0014708325,0.0006759472,0.003694255,0.0007042053,0.0009249529,0.002024812,0.0015079094,0.0051625515],"category_scores_gemma":[0.010927114,0.00039415417,0.0012273706,0.0023082725,0.00074199005,0.0051211095,0.0016973523,0.0017049392,0.0017670821],"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.00055251253,0.00043763118,0.00811687,0.0011670811,0.00024597184,0.00079768174,0.001029746,0.16807158,0.010291187,0.027555274,0.036093045,0.7456413],"study_design_scores_gemma":[0.00004351731,0.00012636988,0.0014146386,0.00008285255,0.00010097431,0.00026067765,0.00023955667,0.91032547,0.007244397,0.07111812,0.009012139,0.000031305266],"about_ca_topic_score_codex":0.0072547924,"about_ca_topic_score_gemma":0.012696512,"teacher_disagreement_score":0.0072547924,"about_ca_system_score_codex":0.0013001288,"about_ca_system_score_gemma":0.0015214339,"threshold_uncertainty_score":0.017270386},"labels":[],"label_agreement":null},{"id":"W4393148340","doi":"10.1609/aaai.v38i6.28349","title":"Neural Physical Simulation with Multi-Resolution Hash Grid Encoding","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Neural Networks and Applications","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":"Artificial Intelligence in Medicine (Canada)","funders":"China Postdoctoral Science Foundation; Tsinghua University; National Natural Science Foundation of China","keywords":"Computer science; Hash function; Encoding (memory); Grid; Resolution (logic); Hash table; Parallel computing; Artificial intelligence; Programming language; Mathematics","score_opus":0.09871703021856838,"score_gpt":0.32721648795037256,"score_spread":0.2284994577318042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393148340","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.051572777,0.00017904303,0.94095665,0.00026976148,0.000100136596,0.00003500476,0.00009915996,0.0006573707,0.0061300606],"genre_scores_gemma":[0.71927273,0.0001620099,0.2762034,0.00015307021,0.000032424792,0.0001320337,0.00019657078,0.0001574876,0.0036903664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999871,0.000030000901,0.000008025997,0.000020449746,0.000054300377,0.000016137312],"domain_scores_gemma":[0.99966216,0.00012351043,0.000027188884,0.00009071963,0.000070038346,0.000026392483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026653073,0.00024875868,0.00045090468,0.0002705826,0.00029353873,0.0006016197,0.0010366787,0.0006831826,0.002665954],"category_scores_gemma":[0.0012450401,0.00018604599,0.00036948937,0.000356782,0.00051359483,0.0011766017,0.001101664,0.0007479157,0.0003772797],"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.000048761493,0.00003121682,0.0005613398,0.000039735467,0.000015897318,0.000073123825,0.00005551319,0.93008524,0.00356406,0.03450604,0.00077156373,0.030247647],"study_design_scores_gemma":[0.0000027152382,0.000004005563,0.000017526825,7.687454e-7,6.94821e-7,0.0000041837143,0.0000022021177,0.9968869,0.0003024544,0.0025835694,0.00019360274,0.0000013783471],"about_ca_topic_score_codex":0.0022086871,"about_ca_topic_score_gemma":0.0021953585,"teacher_disagreement_score":0.002665954,"about_ca_system_score_codex":0.00043969162,"about_ca_system_score_gemma":0.00051518145,"threshold_uncertainty_score":0.008918524},"labels":[],"label_agreement":null},{"id":"W4393148469","doi":"10.1609/aaai.v38i6.28470","title":"FACL-Attack: Frequency-Aware Contrastive Learning for Transferable Adversarial Attacks","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","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":"Kootenay Association for Science & Technology","funders":"Ministry of Science and ICT, South Korea; Agency for Defense Development; National Research Foundation of Korea; National Research Foundation","keywords":"Adversarial system; Computer science; Computer security; Artificial intelligence","score_opus":0.06289783033739495,"score_gpt":0.3213497346852908,"score_spread":0.2584519043478959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393148469","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.021297555,0.0001961807,0.9740795,0.0003023798,0.000055115477,0.00007681638,0.000051945543,0.0013886342,0.0025518835],"genre_scores_gemma":[0.8316927,0.00015993865,0.16379616,0.0005045435,0.00006586901,0.00015441996,0.00013612979,0.00021835537,0.0032719234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904066,0.00031363632,0.000035463858,0.00018117875,0.0003186456,0.00011036476],"domain_scores_gemma":[0.99804354,0.001025923,0.00019716326,0.0005203122,0.00013563127,0.000077450575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018281206,0.0010645879,0.00069118507,0.0004756958,0.00035731008,0.000767747,0.0014609422,0.0013399981,0.0026516807],"category_scores_gemma":[0.006124247,0.000313392,0.0005832966,0.00024980062,0.0017244468,0.0017575953,0.0028704065,0.0026059279,0.00069387484],"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.00047172263,0.00022132316,0.0015738789,0.0001596786,0.00013016886,0.00025180142,0.00010506309,0.7079104,0.0482442,0.07897717,0.004358984,0.15759566],"study_design_scores_gemma":[0.000017571054,0.000095360454,0.0001385125,0.000010627473,0.000007578406,0.0000884493,0.000006469173,0.9704405,0.010876468,0.01712314,0.0011838375,0.00001158038],"about_ca_topic_score_codex":0.00040001917,"about_ca_topic_score_gemma":0.0004633247,"teacher_disagreement_score":0.0026516807,"about_ca_system_score_codex":0.00063535984,"about_ca_system_score_gemma":0.0005199879,"threshold_uncertainty_score":0.009668112},"labels":[],"label_agreement":null},{"id":"W4393148525","doi":"10.1609/aaai.v38i5.28272","title":"SeTformer Is What You Need for Vision and Language","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Speech and dialogue systems","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":"École de Technologie Supérieure","funders":"Vetenskapsrådet; Knut och Alice Wallenbergs Stiftelse","keywords":"Computer science; Linguistics; Philosophy","score_opus":0.05020884113658372,"score_gpt":0.3140827375632839,"score_spread":0.2638738964267002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393148525","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.0051322337,0.0025254765,0.8307467,0.017940173,0.0026929874,0.00024114265,0.0034687938,0.09138823,0.04586418],"genre_scores_gemma":[0.11625134,0.0036319795,0.7336235,0.014165932,0.0013955523,0.00053506525,0.00850285,0.016833395,0.10506035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899894,0.00018105443,0.000063497675,0.00024592166,0.0003843116,0.00012629635],"domain_scores_gemma":[0.99774265,0.0005092188,0.00009158777,0.0009038027,0.0005332197,0.00021957756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015641416,0.0024135308,0.0011563788,0.00096044666,0.0008997554,0.0044011157,0.0025328335,0.0023383207,0.09233],"category_scores_gemma":[0.008125362,0.0012695532,0.0015571964,0.0010256119,0.0014354748,0.011248251,0.0037614394,0.004365063,0.07900098],"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.00043321398,0.0001238016,0.0009841636,0.00047960124,0.00010676192,0.0003033371,0.00031741904,0.0050002458,0.027063342,0.038528793,0.28265655,0.64400274],"study_design_scores_gemma":[0.00012702074,0.0002654798,0.0012840623,0.00028069684,0.00012066981,0.0010146489,0.00036945674,0.08380991,0.04852415,0.14345756,0.7205676,0.00017866968],"about_ca_topic_score_codex":0.0041272873,"about_ca_topic_score_gemma":0.0064679254,"teacher_disagreement_score":0.09233,"about_ca_system_score_codex":0.0012380925,"about_ca_system_score_gemma":0.0016972489,"threshold_uncertainty_score":0.30887467},"labels":[],"label_agreement":null},{"id":"W4393148616","doi":"10.1609/aaai.v38i5.28228","title":"Adversarial Attacks on the Interpretation of Neuron Activation Maximization","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Computational Drug Discovery Methods","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Mila - Quebec Artificial Intelligence Institute","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Interpretation (philosophy); Maximization; Adversarial system; Computer science; Artificial intelligence; Computer security; Mathematics; Mathematical optimization; Programming language","score_opus":0.07681338516569006,"score_gpt":0.32617709969073677,"score_spread":0.24936371452504671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393148616","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.046490055,0.0003566072,0.9430714,0.001428009,0.000086982844,0.000026369988,0.00008706209,0.0004639945,0.007989584],"genre_scores_gemma":[0.9410221,0.0002494855,0.05402474,0.0003556769,0.00007787237,0.000066364984,0.000067757675,0.00014661964,0.0039894576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924445,0.0003907924,0.000022250568,0.00010611731,0.00016032132,0.00007602198],"domain_scores_gemma":[0.99704343,0.0021607222,0.0002612698,0.0003574883,0.000115393515,0.00006168187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013309467,0.0009473775,0.00054220256,0.0003559968,0.000332487,0.0008361226,0.0008571207,0.0011501361,0.0016444754],"category_scores_gemma":[0.0067864372,0.00027148286,0.00050358655,0.00023327215,0.0023000666,0.0014573172,0.001865909,0.0025277429,0.00022936758],"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.00012796301,0.000022245098,0.0004104246,0.000032342054,0.00003652288,0.00014663127,0.00008607743,0.84447104,0.00688364,0.13137053,0.0018094559,0.01460317],"study_design_scores_gemma":[0.0000061015353,0.000019923797,0.000064493914,0.0000073243004,0.000002646402,0.00002980998,0.000005408755,0.95742023,0.0013326148,0.040705007,0.00040028495,0.0000060927555],"about_ca_topic_score_codex":0.00085188984,"about_ca_topic_score_gemma":0.00085235713,"teacher_disagreement_score":0.0016444754,"about_ca_system_score_codex":0.0010199152,"about_ca_system_score_gemma":0.0004484329,"threshold_uncertainty_score":0.0073999763},"labels":[],"label_agreement":null},{"id":"W4393150397","doi":"10.1609/aaai.v38i2.27901","title":"NILUT: Conditional Neural Implicit 3D Lookup Tables for Image Enhancement","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Lookup table; Image (mathematics); Computer science; Artificial intelligence; Artificial neural network; Pattern recognition (psychology); Algorithm; Arithmetic; Mathematics","score_opus":0.05887302667842721,"score_gpt":0.3264027947063941,"score_spread":0.2675297680279669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393150397","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.010549673,0.00022125231,0.9776278,0.00009122551,0.00008770754,0.000039445138,0.00033011395,0.008003037,0.0030496896],"genre_scores_gemma":[0.39772454,0.00034641533,0.59013313,0.0003415423,0.000052919717,0.00020813334,0.0012109615,0.001162385,0.008819961],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999874,0.000018987295,0.0000067989204,0.000032631488,0.000050118688,0.000017500324],"domain_scores_gemma":[0.9997969,0.00006599511,0.000021816159,0.000055643883,0.00004290957,0.000016686305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027706483,0.00061476335,0.0004184108,0.00032091662,0.0002227179,0.0007412286,0.0016833256,0.00051132246,0.006616922],"category_scores_gemma":[0.0011480909,0.00034934818,0.0005209248,0.00036338286,0.00036391555,0.0013564548,0.0010457883,0.0009775097,0.0016372147],"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.00033484213,0.00013544252,0.0012842626,0.00023353555,0.00007548886,0.00018845517,0.00011307672,0.37986112,0.03315521,0.038960114,0.02036517,0.5252933],"study_design_scores_gemma":[0.00000992862,0.000028741997,0.00011136514,0.000010311969,0.000007956049,0.000044439144,0.000008562916,0.9821307,0.0076480084,0.0066636414,0.0033255243,0.000010790971],"about_ca_topic_score_codex":0.0031781194,"about_ca_topic_score_gemma":0.0073439525,"teacher_disagreement_score":0.006616922,"about_ca_system_score_codex":0.0006108324,"about_ca_system_score_gemma":0.00062619324,"threshold_uncertainty_score":0.022135794},"labels":[],"label_agreement":null},{"id":"W4393152329","doi":"10.1609/aaai.v38i21.30542","title":"Evaluating AI Red Teaming’s Readiness to Address Environmental Harms: A Thematic Analysis of LLM Discourse","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Law, AI, and Intellectual Property","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 British Columbia","funders":"","keywords":"Thematic analysis; Thematic map; Psychology; Political science; Sociology; Geography; Qualitative research; Cartography; Social science","score_opus":0.12507225129463326,"score_gpt":0.3674303560178632,"score_spread":0.24235810472322997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393152329","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.96402,0.00021531114,0.006670594,0.0042349617,0.000090763955,0.00020302366,0.000111697795,0.00003775674,0.024415966],"genre_scores_gemma":[0.99406636,0.00018980834,0.0027776621,0.00038572773,0.000026671978,0.0001874223,0.00007769679,0.000058979997,0.0022297166],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.97521585,0.018870227,0.0007924648,0.0009434427,0.0031276722,0.001050279],"domain_scores_gemma":[0.9024679,0.08377148,0.004269716,0.002139862,0.005601231,0.0017498357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03733698,0.0005197159,0.0005151373,0.005551962,0.009067942,0.008782114,0.0016425827,0.0023264484,0.0027157627],"category_scores_gemma":[0.07884023,0.00037851825,0.00038441096,0.0040463223,0.011736098,0.009177155,0.010107567,0.0038171802,0.00030462258],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031176696,0.00002902365,0.0024049992,0.00009282627,0.00000467175,0.00018504067,0.9844661,0.00010008266,0.00066172524,0.0062429085,0.00040110855,0.0053803273],"study_design_scores_gemma":[0.0000031468032,0.00002007893,0.0020222897,0.0001313429,0.000004858832,0.00006780226,0.98642427,0.0005102474,0.0005455995,0.0020430803,0.008213736,0.000013488239],"about_ca_topic_score_codex":0.0050084353,"about_ca_topic_score_gemma":0.004715468,"teacher_disagreement_score":0.03733698,"about_ca_system_score_codex":0.0070610303,"about_ca_system_score_gemma":0.0046402225,"threshold_uncertainty_score":0.19745916},"labels":[],"label_agreement":null},{"id":"W4393152358","doi":"10.1609/aaai.v38i21.30557","title":"Adapted Weighted Aggregation in Federated Learning","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Privacy-Preserving Technologies in Data","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; Federated learning; Artificial intelligence","score_opus":0.07389633450015325,"score_gpt":0.30259628287295837,"score_spread":0.2286999483728051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393152358","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.022904476,0.00020752937,0.9751442,0.00014320367,0.00005422775,0.000045884273,0.000049337745,0.00073102856,0.00072020374],"genre_scores_gemma":[0.7333062,0.0001717626,0.26365262,0.00024940338,0.000073483636,0.00013263448,0.0002296619,0.00011546122,0.0020687636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961015,0.0015813261,0.00024798195,0.000852345,0.00084506825,0.00037175344],"domain_scores_gemma":[0.994662,0.0018947712,0.00033171143,0.0018761251,0.0010160025,0.00021929429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007473359,0.0009226948,0.001777443,0.0012130915,0.0010233793,0.0020314453,0.002881996,0.0014869021,0.0009735479],"category_scores_gemma":[0.013087084,0.00041992782,0.0008930626,0.002105629,0.0012232576,0.004441446,0.0028625778,0.0017401626,0.00030597608],"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.00043456088,0.00031361665,0.002596096,0.00009358471,0.00024363013,0.00015351147,0.00018569258,0.7487107,0.0022470253,0.037095476,0.0023383154,0.2055878],"study_design_scores_gemma":[0.000010645062,0.000037597652,0.00013884393,0.000006346123,0.000014090369,0.000035962697,0.000014337397,0.96761906,0.0012282879,0.030298462,0.00058935164,0.0000070344327],"about_ca_topic_score_codex":0.00295586,"about_ca_topic_score_gemma":0.0025885836,"teacher_disagreement_score":0.007473359,"about_ca_system_score_codex":0.0014718159,"about_ca_system_score_gemma":0.0014698292,"threshold_uncertainty_score":0.039523423},"labels":[],"label_agreement":null},{"id":"W4393152373","doi":"10.1609/aaai.v38i21.30515","title":"Learning to Build Solutions in Stochastic Matching Problems Using Flows (Student Abstract)","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Montréal","funders":"","keywords":"Matching (statistics); Computer science; Mathematics education; Mathematical optimization; Mathematics; Statistics","score_opus":0.06907772291841656,"score_gpt":0.3283144772424974,"score_spread":0.25923675432408083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393152373","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10467077,0.0002765363,0.88964945,0.001927798,0.00010452742,0.0000713534,0.00013116328,0.0002961264,0.0028721779],"genre_scores_gemma":[0.74297273,0.00039921535,0.24768318,0.00076697575,0.0002799188,0.00034182344,0.0005280401,0.00019361009,0.0068345326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926144,0.00034325768,0.000036198784,0.00020401964,0.00007518287,0.00007984901],"domain_scores_gemma":[0.9923685,0.0062327473,0.00049204234,0.00024115895,0.00028236693,0.00038318196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032437025,0.00070364616,0.0010749124,0.0011857665,0.0007187568,0.001291428,0.0011083373,0.001901311,0.0037806986],"category_scores_gemma":[0.01738529,0.0006568982,0.0011019281,0.0010059442,0.0020283184,0.0031417247,0.0021662908,0.0021906192,0.00035970338],"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.00016824664,0.00016870939,0.003684472,0.00014069496,0.00009405111,0.0001047075,0.0002198254,0.7049414,0.0007636053,0.21961306,0.004823279,0.065277904],"study_design_scores_gemma":[0.000018584497,0.000027059916,0.0001203493,0.000012731237,0.00000435143,0.000009248351,0.000014906457,0.88662124,0.00018890461,0.112583935,0.00039287875,0.0000058844257],"about_ca_topic_score_codex":0.0027727992,"about_ca_topic_score_gemma":0.0032771465,"teacher_disagreement_score":0.0037806986,"about_ca_system_score_codex":0.0012858112,"about_ca_system_score_gemma":0.00093868515,"threshold_uncertainty_score":0.017154515},"labels":[],"label_agreement":null},{"id":"W4393152437","doi":"10.1609/aaai.v38i20.30251","title":"HarvestNet: A Dataset for Detecting Smallholder Farming Activity Using Harvest Piles and Remote Sensing","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Food Supply Chain Traceability","field":"Agricultural and Biological 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 Waterloo","funders":"Office of Naval Research; Nuclear Safety and Security Commission; NASA Harvest; Mekelle University; National Aeronautics and Space Administration; National Science Foundation","keywords":"Remote sensing; Agriculture; Environmental science; Agroforestry; Agricultural engineering; Geography; Engineering; Archaeology","score_opus":0.1453542895177033,"score_gpt":0.3147015013562464,"score_spread":0.16934721183854312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393152437","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0638743,0.0010536114,0.0035731685,0.00040460334,0.00026700037,0.00023426517,0.9184883,0.005576358,0.006528314],"genre_scores_gemma":[0.04235304,0.0002726666,0.007582811,0.00015793576,0.000036286063,0.00018059515,0.94746065,0.00016601416,0.0017900375],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995505,0.00004477617,0.000047948248,0.00017012542,0.00010516617,0.00008144068],"domain_scores_gemma":[0.9995684,0.000085709034,0.00006468522,0.00010367649,0.000117631986,0.000059884675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034504704,0.0017962748,0.000623214,0.0026303802,0.00044847204,0.0008804913,0.0015736381,0.0015760725,0.004465899],"category_scores_gemma":[0.0011735499,0.00036329645,0.0008907783,0.002556508,0.00044939856,0.0012658559,0.001089195,0.0008024731,0.0054940223],"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.0006083061,0.0007059988,0.07329614,0.003227673,0.00045858318,0.0013689799,0.00071381766,0.014008564,0.014242358,0.0015386248,0.7953873,0.094443694],"study_design_scores_gemma":[0.00030861894,0.00032167978,0.31926998,0.0010003676,0.00025148684,0.0018563737,0.0032753902,0.0576661,0.014367837,0.004932611,0.5964369,0.0003125384],"about_ca_topic_score_codex":0.035263747,"about_ca_topic_score_gemma":0.086219996,"teacher_disagreement_score":0.035263747,"about_ca_system_score_codex":0.0010007094,"about_ca_system_score_gemma":0.00065097754,"threshold_uncertainty_score":0.070117},"labels":[],"label_agreement":null},{"id":"W4393152659","doi":"10.1609/aaai.v38i17.29906","title":"YTCommentQA: Video Question Answerability in Instructional Videos","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Multimodal Machine Learning Applications","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":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science","score_opus":0.047121977550224924,"score_gpt":0.32778641041260964,"score_spread":0.28066443286238474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393152659","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08553121,0.0037235513,0.011958641,0.0012475316,0.0005489584,0.001983584,0.85528207,0.024999566,0.014724994],"genre_scores_gemma":[0.04964767,0.00037476866,0.016679522,0.00038216685,0.0001004325,0.0012296186,0.92619884,0.00040564546,0.0049813422],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997063,0.0007597123,0.00032355124,0.00081622216,0.0007003525,0.0003372708],"domain_scores_gemma":[0.99473476,0.002384537,0.0005126477,0.0007386331,0.0011093876,0.000520141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015894156,0.003217053,0.0010257224,0.005011366,0.0012522772,0.0019093197,0.0027037004,0.0032104389,0.016862486],"category_scores_gemma":[0.012137567,0.0003864079,0.0016318371,0.0023123436,0.0007030268,0.003599055,0.0035228345,0.0023073754,0.011351906],"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.0016663217,0.0009897347,0.01762756,0.004510047,0.00020980804,0.0007311465,0.0013864762,0.0042257747,0.00835432,0.002645267,0.84107804,0.11657549],"study_design_scores_gemma":[0.0011899401,0.0013217282,0.100534454,0.0015363831,0.00027153405,0.0019058487,0.004076476,0.086098254,0.023932118,0.009213117,0.7695485,0.0003716542],"about_ca_topic_score_codex":0.036733806,"about_ca_topic_score_gemma":0.078072794,"teacher_disagreement_score":0.036733806,"about_ca_system_score_codex":0.0026845527,"about_ca_system_score_gemma":0.0018005987,"threshold_uncertainty_score":0.07304001},"labels":[],"label_agreement":null},{"id":"W4393152742","doi":"10.1609/aaai.v38i20.30234","title":"Promoting Fair Vaccination Strategies through Influence Maximization: A Case Study on COVID-19 Spread","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Vaccine Coverage and Hesitancy","field":"Social Sciences","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"Compute Canada; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Coronavirus disease 2019 (COVID-19); 2019-20 coronavirus outbreak; Vaccination; Severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2); Maximization; Virology; Computer science; Medicine; Mathematics; Mathematical optimization; Outbreak; Infectious disease (medical specialty)","score_opus":0.12643348128846443,"score_gpt":0.39779940750940307,"score_spread":0.27136592622093864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393152742","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.96611464,0.00018034666,0.028843636,0.0008062206,0.0000131342995,0.00018007374,0.00006748897,0.000043543445,0.0037509694],"genre_scores_gemma":[0.982714,0.000085947606,0.01639907,0.000066004606,0.000008530847,0.00007131975,0.00003759893,0.000007605865,0.00060991413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980855,0.0014058503,0.000036529385,0.00013836112,0.00013765003,0.0001961288],"domain_scores_gemma":[0.9902444,0.008222839,0.00045643465,0.00041096768,0.0003171853,0.00034811368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00368431,0.0005499369,0.00043621045,0.00052875147,0.0014480656,0.00082671834,0.0009188933,0.0012763664,0.000952551],"category_scores_gemma":[0.008435793,0.00022044424,0.00055683544,0.0005238733,0.00104315,0.0012642178,0.0012050925,0.0011411178,0.000077846904],"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.0008032556,0.0034678294,0.10210506,0.00039927778,0.00027470276,0.0048762006,0.00653583,0.7381708,0.008561778,0.037303746,0.0034464817,0.09405498],"study_design_scores_gemma":[0.0001825376,0.000735142,0.009672322,0.00002686018,0.00006435261,0.00034867076,0.0030559183,0.9685768,0.003435016,0.010769874,0.0030946913,0.00003781331],"about_ca_topic_score_codex":0.0109158335,"about_ca_topic_score_gemma":0.015973048,"teacher_disagreement_score":0.0109158335,"about_ca_system_score_codex":0.001244771,"about_ca_system_score_gemma":0.00079329504,"threshold_uncertainty_score":0.021704614},"labels":[],"label_agreement":null},{"id":"W4393152877","doi":"10.1609/aaai.v38i15.29584","title":"Near-Optimal Resilient Aggregation Rules for Distributed Learning Using 1-Center and 1-Mean Clustering with Outliers","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Fundamental Research Funds for the Central Universities; Sichuan University; National Science Foundation","keywords":"Outlier; Cluster analysis; Center (category theory); Computer science; Artificial intelligence; Data mining; Machine learning; Chemistry","score_opus":0.055863891624737975,"score_gpt":0.29119884103318433,"score_spread":0.23533494940844635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393152877","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.036461543,0.00022282627,0.9610916,0.0002795614,0.00005865013,0.00009564209,0.000055135704,0.0010171562,0.00071789057],"genre_scores_gemma":[0.6968206,0.000167852,0.3005176,0.00022421786,0.000097211545,0.00019819658,0.00020885516,0.00024175101,0.0015236697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99515176,0.0011755395,0.00039075996,0.0016033109,0.0011107612,0.0005678837],"domain_scores_gemma":[0.9857465,0.0057060737,0.001882807,0.0035570422,0.002454318,0.00065322866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006409683,0.0011715993,0.0023944553,0.0013548932,0.0016657694,0.0021315608,0.0037269918,0.0018518956,0.0011077219],"category_scores_gemma":[0.023576077,0.00061494793,0.0011129853,0.0013373011,0.0022075924,0.0034696897,0.0033692745,0.0025106596,0.0004892456],"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.00046305015,0.00017991006,0.0027034266,0.00009617152,0.000120895944,0.00011675628,0.00035609351,0.84052956,0.0049467604,0.033212703,0.0032933613,0.11398133],"study_design_scores_gemma":[0.000014336558,0.000047321406,0.00016295,0.0000062120203,0.000009048018,0.000029527167,0.000030624757,0.9816996,0.0017243242,0.015926745,0.00033720245,0.000012181501],"about_ca_topic_score_codex":0.0033147878,"about_ca_topic_score_gemma":0.0029740073,"teacher_disagreement_score":0.006409683,"about_ca_system_score_codex":0.0021464813,"about_ca_system_score_gemma":0.0020775008,"threshold_uncertainty_score":0.033898056},"labels":[],"label_agreement":null},{"id":"W4393152943","doi":"10.1609/aaai.v38i17.29845","title":"Accelerating the Global Aggregation of Local Explanations","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Evaluation and Performance Assessment","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Azrieli Foundation; German-Israeli Foundation for Scientific Research and Development; Deutsche Forschungsgemeinschaft; Open Philanthropy Project","keywords":"Economic geography; Economics","score_opus":0.3793026277643469,"score_gpt":0.48442412767895365,"score_spread":0.10512149991460673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393152943","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.0776004,0.00049986027,0.9125821,0.00049908936,0.00009168004,0.00014937104,0.00023435624,0.006423799,0.0019193573],"genre_scores_gemma":[0.586782,0.00026988517,0.40722167,0.0002349275,0.0001235265,0.00014653767,0.0008634455,0.0005501658,0.0038078225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983381,0.00036825266,0.000117558826,0.00040223234,0.00056989165,0.00020391823],"domain_scores_gemma":[0.99268496,0.0037502302,0.0005952633,0.0017807349,0.0009986712,0.00019018448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002639955,0.0015071543,0.0015355063,0.0017256852,0.00061983155,0.0016082268,0.001388003,0.0014412084,0.004149328],"category_scores_gemma":[0.014527795,0.0005135449,0.0010540371,0.0010950628,0.00090800115,0.003145109,0.0032908502,0.0020197309,0.0015237072],"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.00070782803,0.00026233256,0.0070636496,0.00031613786,0.00018899378,0.00027274262,0.00059744465,0.31876916,0.02217698,0.013956417,0.009087525,0.62660086],"study_design_scores_gemma":[0.00005333931,0.00016707774,0.001559453,0.000028219683,0.00007560172,0.00012069099,0.00011350883,0.96040726,0.012404608,0.022144608,0.0029026645,0.000023000055],"about_ca_topic_score_codex":0.0025637737,"about_ca_topic_score_gemma":0.004292406,"teacher_disagreement_score":0.004149328,"about_ca_system_score_codex":0.0010501131,"about_ca_system_score_gemma":0.0016013485,"threshold_uncertainty_score":0.013961554},"labels":[],"label_agreement":null},{"id":"W4393153038","doi":"10.1609/aaai.v38i16.29757","title":"BAND: Biomedical Alert News Dataset","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Health, Environment, Cognitive Aging","field":"Environmental Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"UK Research and Innovation","keywords":"Computer science; Data science","score_opus":0.07090483844763738,"score_gpt":0.3209699415368436,"score_spread":0.2500651030892062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393153038","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006067503,0.000983917,0.00075775175,0.00074294355,0.00015842971,0.0001694134,0.9871061,0.0014277111,0.002586193],"genre_scores_gemma":[0.0032204292,0.00027558624,0.0014475308,0.00019202361,0.00004484626,0.00022372806,0.9936911,0.000040694278,0.000864002],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99833703,0.00035212375,0.00036657107,0.0004101877,0.000403114,0.00013103393],"domain_scores_gemma":[0.99655354,0.0013535047,0.00040200877,0.00053218467,0.00080109,0.00035764775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015660885,0.0021664177,0.0011975687,0.006472133,0.0012173953,0.0016672593,0.0025729756,0.0034907795,0.014203852],"category_scores_gemma":[0.0075888243,0.00047221276,0.0010651357,0.005407559,0.00058538484,0.0014562177,0.002031827,0.0018644733,0.02183152],"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.000566945,0.0002658399,0.0055143726,0.0025002896,0.00013598727,0.0006873082,0.00023215445,0.0012075129,0.0026467282,0.0007689142,0.96274877,0.022725133],"study_design_scores_gemma":[0.0005652847,0.00026967566,0.033094652,0.0005449676,0.00023522424,0.0016242784,0.00078780006,0.0064821583,0.004713065,0.0018562521,0.9496909,0.00013568837],"about_ca_topic_score_codex":0.017286384,"about_ca_topic_score_gemma":0.029155398,"teacher_disagreement_score":0.017286384,"about_ca_system_score_codex":0.001469366,"about_ca_system_score_gemma":0.0022926063,"threshold_uncertainty_score":0.047516584},"labels":[],"label_agreement":null},{"id":"W4393153098","doi":"10.1609/aaai.v38i12.29210","title":"When Model Meets New Normals: Test-Time Adaptation for Unsupervised Time-Series Anomaly Detection","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Anomaly Detection Techniques and Applications","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":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; Korea Advanced Institute of Science and Technology; National Research Foundation of Korea; National Research Foundation","keywords":"Anomaly detection; Adaptation (eye); Series (stratigraphy); Anomaly (physics); Time series; Computer science; Artificial intelligence; Test (biology); Pattern recognition (psychology); Machine learning; Psychology; Geology; Neuroscience","score_opus":0.06147079474627257,"score_gpt":0.27815928186316863,"score_spread":0.21668848711689606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393153098","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.10057562,0.00024373946,0.8929877,0.00041233067,0.00009620239,0.000117350995,0.00018861075,0.0042487253,0.0011296923],"genre_scores_gemma":[0.89675194,0.00007196195,0.10083673,0.00023045264,0.0000797904,0.00012083719,0.0005424696,0.00033187744,0.001033904],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997995,0.0006166863,0.00011732413,0.00069399615,0.00040166336,0.00017542871],"domain_scores_gemma":[0.991824,0.004074894,0.00074425456,0.0016603152,0.0013378976,0.00035863818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004002359,0.001061171,0.0011618265,0.001076612,0.0004283048,0.0010177541,0.002727477,0.0015335002,0.001073106],"category_scores_gemma":[0.026107196,0.0004990722,0.00061054167,0.00069918024,0.0008509982,0.002794164,0.0017563902,0.002791747,0.0007129714],"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.00049809046,0.0006004071,0.030461615,0.00011252422,0.00028595442,0.0004231157,0.00043934453,0.42066848,0.016688365,0.005850089,0.0076874834,0.5162846],"study_design_scores_gemma":[0.0000082925035,0.000038673417,0.0014017624,0.000003977584,0.000008834179,0.00006166901,0.000025375906,0.9922563,0.0023894382,0.0034227744,0.0003709868,0.0000118995285],"about_ca_topic_score_codex":0.0040409225,"about_ca_topic_score_gemma":0.0049636606,"teacher_disagreement_score":0.0040409225,"about_ca_system_score_codex":0.00066518795,"about_ca_system_score_gemma":0.0010055859,"threshold_uncertainty_score":0.021166742},"labels":[],"label_agreement":null},{"id":"W4393153277","doi":"10.1609/aaai.v38i11.29073","title":"Feature Transportation Improves Graph Neural Networks","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Brain Tumor Detection and Classification","field":"Neuroscience","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 British Columbia","funders":"Division of Chemistry; Council for Higher Education","keywords":"Feature (linguistics); Computer science; Graph; Artificial neural network; Artificial intelligence; Pattern recognition (psychology); Theoretical computer science","score_opus":0.06561549310345406,"score_gpt":0.2919985138167523,"score_spread":0.22638302071329824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393153277","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.15709479,0.0028841347,0.821453,0.0024456147,0.0004339534,0.00010923833,0.00049482007,0.005465518,0.009618917],"genre_scores_gemma":[0.85519904,0.0012134529,0.1358339,0.00061177876,0.00017396545,0.00008568789,0.0010631847,0.00036403135,0.0054549896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959165,0.00009299834,0.00002274003,0.0001558288,0.00009805119,0.00003864972],"domain_scores_gemma":[0.9983485,0.00082247955,0.00016164985,0.00025365982,0.00034156456,0.00007219459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011791297,0.0014955414,0.0009343085,0.0011343954,0.00057357916,0.0009331973,0.0016291491,0.0015166996,0.002233746],"category_scores_gemma":[0.005310396,0.00040229477,0.0009191008,0.0008209543,0.0006498853,0.003433196,0.0015206567,0.0018196703,0.0007135774],"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.00012638075,0.00011260364,0.0016884957,0.00013854355,0.000088686815,0.000078701676,0.000076245655,0.83556575,0.004611952,0.0196129,0.004701157,0.13319857],"study_design_scores_gemma":[0.0000057936827,0.000026836922,0.00013231699,0.0000053589706,0.000013437241,0.0000149468715,0.0000074806767,0.9879418,0.00089862006,0.010229366,0.00071875344,0.000005368982],"about_ca_topic_score_codex":0.008821951,"about_ca_topic_score_gemma":0.007677723,"teacher_disagreement_score":0.008821951,"about_ca_system_score_codex":0.0015286308,"about_ca_system_score_gemma":0.00077454874,"threshold_uncertainty_score":0.01754123},"labels":[],"label_agreement":null},{"id":"W4393154023","doi":"10.1609/aaai.v38i6.28418","title":"MedSegDiff-V2: Diffusion-Based Medical Image Segmentation with Transformer","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Brain Tumor Detection and Classification","field":"Neuroscience","cited_by":235,"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 vision; Artificial intelligence; Computer science; Segmentation; Image segmentation","score_opus":0.0632182676501923,"score_gpt":0.30971506353558687,"score_spread":0.24649679588539458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393154023","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.006167725,0.0005377449,0.97616506,0.00039434215,0.00009940879,0.00013981556,0.0005432381,0.014362913,0.0015897779],"genre_scores_gemma":[0.15405385,0.00063786155,0.83429015,0.00075950474,0.00008833668,0.00026496314,0.002385071,0.003184782,0.004335459],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958724,0.0000805618,0.00003073041,0.00011390912,0.0001458954,0.00004170779],"domain_scores_gemma":[0.99949205,0.00021054571,0.000042930496,0.000105631225,0.000098571305,0.000050348946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015003027,0.0010392254,0.00090919324,0.0013721113,0.00043144025,0.0014915336,0.002929462,0.00217103,0.005109677],"category_scores_gemma":[0.0039554336,0.00070242974,0.0014079665,0.00089875166,0.00063042005,0.0014424559,0.002305384,0.0017927241,0.002079256],"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.0005682598,0.00020659665,0.002090845,0.00060549984,0.000357958,0.00033932438,0.00025009355,0.24198447,0.040789414,0.030375397,0.03673751,0.64569473],"study_design_scores_gemma":[0.000060962215,0.00007000653,0.00019823298,0.000017990022,0.00002243171,0.0003499135,0.000018035818,0.96849155,0.012198894,0.01145213,0.0070908465,0.000029029785],"about_ca_topic_score_codex":0.005665289,"about_ca_topic_score_gemma":0.008247607,"teacher_disagreement_score":0.005665289,"about_ca_system_score_codex":0.0011345289,"about_ca_system_score_gemma":0.0017321052,"threshold_uncertainty_score":0.01709354},"labels":[],"label_agreement":null},{"id":"W4393154523","doi":"10.1609/aaai.v38i4.28071","title":"Modeling Stereo-Confidence out of the End-to-End Stereo-Matching Network via Disparity Plane Sweep","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea","keywords":"End-to-end principle; Plane (geometry); Computer science; Matching (statistics); Computer vision; Artificial intelligence; Mathematics; Geometry; Statistics","score_opus":0.06879151434061373,"score_gpt":0.31746655512206556,"score_spread":0.24867504078145183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393154523","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.03670208,0.00008447316,0.96126646,0.00009441474,0.000014452372,0.00003467403,0.000075245,0.00040723075,0.0013209517],"genre_scores_gemma":[0.83294016,0.00010098317,0.16477448,0.000106153726,0.000034640016,0.00010023411,0.0002089355,0.00009655051,0.0016378358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918336,0.00013702706,0.000032535547,0.00022052991,0.00032559928,0.00010084865],"domain_scores_gemma":[0.9985227,0.0005669524,0.00025940067,0.00021693116,0.00033155995,0.0001025732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013068527,0.00067049015,0.0006213505,0.0006744884,0.0003164025,0.0012475786,0.002450361,0.001143315,0.0018730226],"category_scores_gemma":[0.0058379536,0.00037654833,0.00048263048,0.0005596362,0.00079556846,0.0027650597,0.0023289488,0.0013600406,0.00028532665],"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.0003601335,0.00013862249,0.0036829116,0.0000953722,0.00004995924,0.00015611199,0.00018397083,0.75909704,0.016886981,0.030904016,0.001113478,0.18733141],"study_design_scores_gemma":[0.000004820649,0.000026547705,0.00026103,0.0000041936405,0.0000047989433,0.000020654976,0.0000070987194,0.99227047,0.0027627645,0.0044222637,0.00020950923,0.0000057708826],"about_ca_topic_score_codex":0.0034186323,"about_ca_topic_score_gemma":0.0028317822,"teacher_disagreement_score":0.0034186323,"about_ca_system_score_codex":0.0010750439,"about_ca_system_score_gemma":0.00091216736,"threshold_uncertainty_score":0.0078000426},"labels":[],"label_agreement":null},{"id":"W4393154725","doi":"10.1609/aaai.v38i4.28069","title":"FRED: Towards a Full Rotation-Equivariance in Aerial Image Object Detection","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Image and Video Retrieval Techniques","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":"Kootenay Association for Science & Technology","funders":"Korea Health Industry Development Institute","keywords":"Computer vision; Rotation (mathematics); Artificial intelligence; Aerial image; Image (mathematics); Object (grammar); Computer science; Object detection; Computer graphics (images); Pattern recognition (psychology)","score_opus":0.0508841076598038,"score_gpt":0.3249505792229302,"score_spread":0.2740664715631264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393154725","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.024523672,0.00031747602,0.96703666,0.00013259232,0.000074606585,0.000061466875,0.00023872014,0.0060453303,0.0015693745],"genre_scores_gemma":[0.2844255,0.00043754678,0.7053061,0.00050624006,0.00009655221,0.00008526401,0.0019550389,0.0008340938,0.006353711],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916077,0.00012043169,0.000031228414,0.00031328833,0.00026053266,0.00011385607],"domain_scores_gemma":[0.99931765,0.00016367664,0.00007281048,0.0002210738,0.00016843721,0.00005642338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010955031,0.0011337574,0.001061028,0.0012552734,0.00031105828,0.0010732046,0.0019817348,0.0010206943,0.002020127],"category_scores_gemma":[0.002534887,0.0005854412,0.00086470257,0.0009426078,0.0008498354,0.0014866429,0.0017122615,0.0014308133,0.0020235896],"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.0003470196,0.00016372908,0.0022701214,0.00012100923,0.00021233386,0.00019318255,0.00011025784,0.15190713,0.054843526,0.009913771,0.0111243175,0.7687937],"study_design_scores_gemma":[0.000016992766,0.00006389055,0.0007462616,0.000009873122,0.000025286834,0.00015773269,0.00002119001,0.96548903,0.02373214,0.00552803,0.004187344,0.000022231605],"about_ca_topic_score_codex":0.004530769,"about_ca_topic_score_gemma":0.006101392,"teacher_disagreement_score":0.004530769,"about_ca_system_score_codex":0.0006097482,"about_ca_system_score_gemma":0.0010438652,"threshold_uncertainty_score":0.009008765},"labels":[],"label_agreement":null},{"id":"W4393154888","doi":"10.1609/aaai.v38i3.28021","title":"Rethinking Peculiar Images by Diffusion Models: Revealing Local Minima’s Role","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Handwritten Text Recognition Techniques","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":"Kootenay Association for Science & Technology","funders":"Korea Coast Guard; Korea Aerospace Industries; Korea Institute of Marine Science and Technology promotion","keywords":"Maxima and minima; Diffusion; Economic geography; Geography; Sociology; Physics; Mathematics; Mathematical analysis","score_opus":0.055439251804349,"score_gpt":0.28461566781915015,"score_spread":0.22917641601480115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393154888","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.16088553,0.0007271485,0.83346254,0.0009279436,0.00008577406,0.00006487799,0.00010494356,0.0008686319,0.002872625],"genre_scores_gemma":[0.8250929,0.00033993542,0.17201725,0.00024683302,0.00004687296,0.000049466464,0.00019057831,0.0002720103,0.0017441439],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996026,0.00012419545,0.000020037056,0.000115782976,0.000090229936,0.00004719059],"domain_scores_gemma":[0.9963685,0.002174751,0.00036510013,0.00064891373,0.00028022754,0.00016252621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001891124,0.00069974485,0.00083978515,0.00089916063,0.00061521557,0.0015436868,0.0009774994,0.0014300464,0.0014875032],"category_scores_gemma":[0.0099638365,0.00057534006,0.0006917756,0.00058258174,0.001496954,0.0030216288,0.0013319605,0.0017097081,0.00031595008],"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.0003139374,0.000114311566,0.007571514,0.00023943934,0.0001151229,0.00060932484,0.00055821496,0.7498811,0.02953504,0.06866128,0.0040592556,0.13834149],"study_design_scores_gemma":[0.000011107119,0.000023008954,0.0003540492,0.000008691362,0.000006717587,0.00006421833,0.000026560085,0.978691,0.0028370812,0.017392544,0.0005742597,0.000010622063],"about_ca_topic_score_codex":0.002783993,"about_ca_topic_score_gemma":0.0033048182,"teacher_disagreement_score":0.002783993,"about_ca_system_score_codex":0.00092487107,"about_ca_system_score_gemma":0.00073803426,"threshold_uncertainty_score":0.010001302},"labels":[],"label_agreement":null},{"id":"W4393156072","doi":"10.1609/aaai.v38i2.27846","title":"Spherical Pseudo-Cylindrical Representation for Omnidirectional Image Super-resolution","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Image Processing Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Shandong Province; China Postdoctoral Science Foundation; National Natural Science Foundation of China; University of Alberta; National Science Foundation","keywords":"Omnidirectional antenna; Representation (politics); Resolution (logic); Image (mathematics); Computer vision; Computer science; Artificial intelligence; Physics; Telecommunications","score_opus":0.08439333663475698,"score_gpt":0.3585141589910858,"score_spread":0.27412082235632884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393156072","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.0038078204,0.00018505334,0.99425113,0.00011500518,0.000021168056,0.000021803875,0.000087660956,0.00042629745,0.0010840645],"genre_scores_gemma":[0.18067463,0.0012380715,0.81281304,0.00037159328,0.00010461078,0.00016858586,0.0008882026,0.0002979035,0.0034433063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955016,0.00012578916,0.000021401973,0.00007501584,0.0001865796,0.00004099274],"domain_scores_gemma":[0.9994665,0.0001605764,0.000060930895,0.0001340809,0.00014259042,0.00003537269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006281817,0.0007396378,0.00062052405,0.00058926665,0.00021056761,0.0006669324,0.0010304556,0.00056158286,0.0024784848],"category_scores_gemma":[0.0023874661,0.00032347997,0.0005382531,0.000986832,0.00046091818,0.0012483995,0.0010719601,0.0010805406,0.0014143593],"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.00029162577,0.000077508055,0.000731727,0.00032808134,0.00005250077,0.00027586962,0.00020105307,0.26565185,0.08886587,0.047004182,0.015687197,0.5808326],"study_design_scores_gemma":[0.000009910266,0.00005379244,0.00031274726,0.000014475554,0.000012603102,0.00027154776,0.000033368742,0.9678007,0.013667465,0.008666749,0.00913663,0.000019979236],"about_ca_topic_score_codex":0.0018444493,"about_ca_topic_score_gemma":0.0029855175,"teacher_disagreement_score":0.0024784848,"about_ca_system_score_codex":0.00038966382,"about_ca_system_score_gemma":0.0007447196,"threshold_uncertainty_score":0.008291364},"labels":[],"label_agreement":null},{"id":"W4393156087","doi":"10.1609/aaai.v38i4.28151","title":"Test-Time Personalization with Meta Prompt for Gaze Estimation","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Gaze Tracking and Assistive Technology","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":"Concordia University; University of Toronto; University of Waterloo","funders":"","keywords":"Personalization; Gaze; Test (biology); Estimation; Meta-analysis; Computer science; Psychology; Artificial intelligence; Medicine; Engineering; World Wide Web; Geology","score_opus":0.07552402674694116,"score_gpt":0.2975394259052834,"score_spread":0.22201539915834223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393156087","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.3604545,0.0012555149,0.58337873,0.00042450946,0.00046852505,0.00034811965,0.0017795523,0.048185103,0.0037054173],"genre_scores_gemma":[0.86216646,0.00013925844,0.13116173,0.00020296386,0.00008287072,0.00030264925,0.0022746283,0.0008022957,0.0028672465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986105,0.00043356683,0.000073056195,0.00054595614,0.00021862864,0.0001181951],"domain_scores_gemma":[0.9961528,0.0013205181,0.0002065161,0.0014014116,0.0007501437,0.00016860418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001981583,0.0016600325,0.0008426379,0.0007924961,0.0003280515,0.0006197078,0.0013052461,0.0011596052,0.0030353232],"category_scores_gemma":[0.012748542,0.00038904604,0.0005299192,0.00043228953,0.00031318588,0.0018223015,0.0012747834,0.0016204023,0.0014082346],"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.0015396494,0.0010030506,0.02041951,0.0003869975,0.00032722086,0.00031152635,0.00043573874,0.11844729,0.06946706,0.0008658727,0.01754218,0.76925385],"study_design_scores_gemma":[0.00013584695,0.0006616218,0.014495435,0.000040262963,0.00007582062,0.00024206622,0.00017433081,0.93651,0.041497894,0.0028244609,0.0032852401,0.000056981837],"about_ca_topic_score_codex":0.0033961604,"about_ca_topic_score_gemma":0.005666006,"teacher_disagreement_score":0.0033961604,"about_ca_system_score_codex":0.0004759067,"about_ca_system_score_gemma":0.00057577534,"threshold_uncertainty_score":0.010479748},"labels":[],"label_agreement":null},{"id":"W4393156112","doi":"10.1609/aaai.v38i3.28020","title":"MagiCapture: High-Resolution Multi-Concept Portrait Customization","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Image Retrieval and Classification Techniques","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":"Kootenay Association for Science & Technology","funders":"Ministry of Science and ICT, South Korea; National Research Foundation of Korea; National Research Foundation","keywords":"Personalization; Portrait; Computer science; Resolution (logic); High resolution; Artificial intelligence; Art; Geology; World Wide Web; Remote sensing; Art history","score_opus":0.058864482778488283,"score_gpt":0.2939637011576332,"score_spread":0.23509921837914494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393156112","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.026280025,0.0010735603,0.9326736,0.00037738238,0.0002872332,0.00030604054,0.0012722028,0.030031864,0.0076981415],"genre_scores_gemma":[0.2835428,0.00086105615,0.68599164,0.0007168642,0.00010605286,0.00043915934,0.004743045,0.0052321237,0.018367324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970573,0.0000453363,0.000010812914,0.00012012288,0.00009021549,0.000027712807],"domain_scores_gemma":[0.9995191,0.00018316608,0.00002909787,0.00017059952,0.000058270627,0.000039843024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006082924,0.0014864865,0.0006165836,0.00064767007,0.00025406628,0.0009977074,0.002285398,0.001348284,0.015031492],"category_scores_gemma":[0.0019622815,0.0007106372,0.0016806602,0.0003803384,0.0005284922,0.0016110138,0.0015286382,0.0020230399,0.005031924],"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.00037246512,0.00027276648,0.0011444031,0.0009122877,0.000287917,0.0006722016,0.0004201164,0.25626066,0.11059477,0.00873786,0.042641323,0.5776833],"study_design_scores_gemma":[0.00005828324,0.00013118809,0.0004353114,0.00004131963,0.000030709394,0.00045100492,0.000053018885,0.9363681,0.035874452,0.0067762476,0.019736003,0.000044414846],"about_ca_topic_score_codex":0.0018193809,"about_ca_topic_score_gemma":0.0034282745,"teacher_disagreement_score":0.015031492,"about_ca_system_score_codex":0.00062947714,"about_ca_system_score_gemma":0.00033181565,"threshold_uncertainty_score":0.05028534},"labels":[],"label_agreement":null},{"id":"W4393156206","doi":"10.1609/aaai.v38i11.29085","title":"Latent Diffusion Transformer for Probabilistic Time Series Forecasting","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Time Series Analysis and Forecasting","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"BC Research (Canada)","funders":"National Research Foundation Singapore; National Research Foundation","keywords":"Probabilistic logic; Series (stratigraphy); Time series; Econometrics; Transformer; Computer science; Mathematics; Artificial intelligence; Machine learning; Engineering; Geology; Electrical engineering; Voltage","score_opus":0.07072635207207281,"score_gpt":0.2658121374493898,"score_spread":0.195085785377317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393156206","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.009527276,0.00028641705,0.9884114,0.0002080357,0.000049868082,0.00001844039,0.00016559877,0.0005505732,0.0007824541],"genre_scores_gemma":[0.8154135,0.0012942392,0.17599924,0.00021798316,0.00015918631,0.00012645482,0.000978672,0.00022673322,0.0055838907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953747,0.00012949413,0.00003211569,0.00012765075,0.00012771273,0.00004554385],"domain_scores_gemma":[0.9984486,0.0010712085,0.00013651351,0.00012321916,0.00016017944,0.0000602113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015063529,0.0007203563,0.00081318873,0.0007498315,0.0002519416,0.0008096706,0.0010759886,0.0006975008,0.002579547],"category_scores_gemma":[0.0050125695,0.00047238093,0.0010059994,0.0011761099,0.0005691512,0.0022033826,0.0009148564,0.0020141676,0.00067696034],"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.00014133552,0.0000564561,0.0010757116,0.00009775526,0.00006638378,0.00008643836,0.00007923986,0.8273265,0.004406465,0.06514902,0.0022197894,0.09929495],"study_design_scores_gemma":[0.0000023363514,0.0000048053894,0.00004667074,0.0000019407382,0.0000032329772,0.000009166415,0.0000017381028,0.99209774,0.0003316144,0.0072816396,0.00021599252,0.0000031935206],"about_ca_topic_score_codex":0.0049040327,"about_ca_topic_score_gemma":0.0042055417,"teacher_disagreement_score":0.0049040327,"about_ca_system_score_codex":0.0008573357,"about_ca_system_score_gemma":0.00081974186,"threshold_uncertainty_score":0.009750962},"labels":[],"label_agreement":null},{"id":"W4393156209","doi":"10.1609/aaai.v38i9.28936","title":"Auditable Algorithms for Approximate Model Counting","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Database Systems and Queries","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 Toronto","funders":"Ministry of Education, India; National Research Foundation Singapore; National Research Foundation","keywords":"Computer science; Algorithm","score_opus":0.10483359672075183,"score_gpt":0.3236140129499684,"score_spread":0.21878041622921657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393156209","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.010253907,0.00041055132,0.9792979,0.0011977575,0.00012080412,0.00013337996,0.0002701788,0.003537077,0.0047784843],"genre_scores_gemma":[0.3767339,0.00068265316,0.6134857,0.0008117754,0.00025806352,0.0004885597,0.0010866984,0.00083144,0.0056212563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9908217,0.0026788858,0.00064744265,0.0019134162,0.0029228902,0.0010156487],"domain_scores_gemma":[0.9734948,0.013059295,0.0014958831,0.010284741,0.0011728926,0.0004923527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004186999,0.0011466898,0.0014912658,0.0012819013,0.0014259999,0.0052054944,0.004852061,0.002562695,0.0070504434],"category_scores_gemma":[0.03603654,0.0011064695,0.0024037687,0.0024582937,0.0025218572,0.012199136,0.00682839,0.0058250553,0.0017734019],"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.00039494835,0.0002612327,0.0017820988,0.00032458486,0.000097065415,0.00015974257,0.0003789819,0.16265114,0.004668413,0.6771298,0.009905743,0.14224628],"study_design_scores_gemma":[0.00005456317,0.00003244507,0.00011439413,0.000043418037,0.000024250228,0.00011280582,0.000044581648,0.5537166,0.002625626,0.4380031,0.0052009015,0.000027302525],"about_ca_topic_score_codex":0.0027598867,"about_ca_topic_score_gemma":0.003910774,"teacher_disagreement_score":0.0070504434,"about_ca_system_score_codex":0.004635888,"about_ca_system_score_gemma":0.00446315,"threshold_uncertainty_score":0.033635855},"labels":[],"label_agreement":null},{"id":"W4393156222","doi":"10.1609/aaai.v38i7.28571","title":"A New Benchmark and Model for Challenging Image Manipulation Detection","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Image Processing Techniques and Applications","field":"Engineering","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":"Benchmark (surveying); Artificial intelligence; Computer science; Image (mathematics); Computer vision; Image manipulation; Pattern recognition (psychology); Cartography; Geography","score_opus":0.06288092941123159,"score_gpt":0.2993721743013264,"score_spread":0.23649124489009482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393156222","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.3136598,0.01482512,0.54277813,0.006145351,0.0020841751,0.0014400838,0.06771922,0.020396918,0.030951241],"genre_scores_gemma":[0.6333212,0.0029651378,0.23729241,0.0013822633,0.00072322466,0.0013563057,0.10777264,0.0008608498,0.014326038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989153,0.00021405634,0.000053517706,0.00043236776,0.0002260849,0.00015864275],"domain_scores_gemma":[0.99810815,0.00066817045,0.00019858911,0.00026896482,0.00062266743,0.00013344445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015752113,0.002916144,0.0013687146,0.0028282742,0.00081415515,0.0020628672,0.0045730458,0.0028159395,0.0031762077],"category_scores_gemma":[0.0059321746,0.00048756239,0.0012038059,0.0018277881,0.0008477249,0.0025744324,0.0014374001,0.0021850034,0.0014224458],"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.0009326882,0.0007249181,0.007415972,0.00075316743,0.00024267385,0.0004480775,0.00007513112,0.7520175,0.0050464612,0.007758819,0.07581216,0.14877231],"study_design_scores_gemma":[0.00002714657,0.000070713046,0.0008906941,0.000027938107,0.000022353981,0.00008820269,0.00002366863,0.9900417,0.00145137,0.0036232728,0.0037160828,0.000016916916],"about_ca_topic_score_codex":0.033323098,"about_ca_topic_score_gemma":0.029647263,"teacher_disagreement_score":0.033323098,"about_ca_system_score_codex":0.003402774,"about_ca_system_score_gemma":0.0014544519,"threshold_uncertainty_score":0.06625831},"labels":[],"label_agreement":null},{"id":"W4393156629","doi":"10.1609/aaai.v38i11.29140","title":"Foreseeing Reconstruction Quality of Gradient Inversion: An Optimization Perspective","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Photoacoustic and Ultrasonic Imaging","field":"Engineering","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":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Defense Acquisition Program Administration; Ministry of Science and ICT, South Korea; Korea Advanced Institute of Science and Technology; Agency for Defense Development","keywords":"Inversion (geology); Perspective (graphical); Computer science; Quality (philosophy); Geology; Mathematical optimization; Artificial intelligence; Mathematics; Epistemology; Paleontology; Philosophy","score_opus":0.06441169045379819,"score_gpt":0.30284195769489247,"score_spread":0.23843026724109428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393156629","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.11044595,0.0009540166,0.8830153,0.0016118948,0.00006236984,0.00007614447,0.000120809476,0.00076516706,0.0029484336],"genre_scores_gemma":[0.92795026,0.0003128618,0.0702035,0.000174475,0.000045943383,0.000047368212,0.00014152438,0.000118047246,0.0010061028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995804,0.0017951876,0.00023663572,0.00060490926,0.0010909307,0.0004683426],"domain_scores_gemma":[0.98693097,0.007339463,0.001420998,0.0025620833,0.0013497008,0.00039682153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007200088,0.001300841,0.0012195116,0.001106135,0.0005739229,0.002715369,0.0011555854,0.0015536553,0.0012262102],"category_scores_gemma":[0.03708713,0.00041120237,0.00049077225,0.000988343,0.0023511797,0.0051875594,0.0026722802,0.002240897,0.0003810443],"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.00060198107,0.00017606579,0.016051477,0.0002026441,0.0002009889,0.00025152936,0.0002254217,0.75209445,0.008965349,0.047276948,0.003816599,0.1701366],"study_design_scores_gemma":[0.000011229947,0.00012749413,0.0011994597,0.00002438353,0.000015925882,0.00013205066,0.000061158295,0.9682968,0.0046215095,0.024923872,0.0005654543,0.000020640106],"about_ca_topic_score_codex":0.0019402169,"about_ca_topic_score_gemma":0.0012834284,"teacher_disagreement_score":0.007200088,"about_ca_system_score_codex":0.0012368261,"about_ca_system_score_gemma":0.0017988965,"threshold_uncertainty_score":0.03807819},"labels":[],"label_agreement":null},{"id":"W4393156655","doi":"10.1609/aaai.v38i15.29603","title":"Efficient Asynchronous Federated Learning with Prospective Momentum Aggregation and Fine-Grained Correction","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Asynchronous communication; Computer science; Momentum (technical analysis); Computer network; Business","score_opus":0.030473913786981003,"score_gpt":0.2682071313148553,"score_spread":0.2377332175278743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393156655","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.021561267,0.00015438774,0.9723168,0.00026038243,0.00007519157,0.00007067152,0.00006352584,0.004424034,0.0010737145],"genre_scores_gemma":[0.7543906,0.00010827488,0.24060832,0.00040143033,0.00009678263,0.00017882707,0.0003218421,0.00029941116,0.0035945328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978364,0.00042244216,0.00015013921,0.00065417885,0.0006775593,0.00025934825],"domain_scores_gemma":[0.99608743,0.0009400369,0.0002853934,0.0014134704,0.0010446628,0.00022907199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033032245,0.0013384152,0.0016879444,0.0007553088,0.0010940352,0.0019223995,0.0041065174,0.0012740861,0.0018617344],"category_scores_gemma":[0.010513717,0.00059622846,0.00065324875,0.0009881718,0.0011479105,0.004461858,0.0030909127,0.0023413238,0.0008129029],"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.00055250974,0.0006146235,0.005374819,0.00009159569,0.000100152014,0.00022547737,0.0002538921,0.565702,0.0092067,0.0119074285,0.008162621,0.39780816],"study_design_scores_gemma":[0.000023275616,0.000025850168,0.00012726945,0.000002771162,0.000006275136,0.00002609302,0.000011285769,0.9934923,0.001998756,0.0038550887,0.00042340573,0.000007694847],"about_ca_topic_score_codex":0.0071155643,"about_ca_topic_score_gemma":0.009685458,"teacher_disagreement_score":0.0071155643,"about_ca_system_score_codex":0.0014604763,"about_ca_system_score_gemma":0.0029436678,"threshold_uncertainty_score":0.017469347},"labels":[],"label_agreement":null},{"id":"W4393156675","doi":"10.1609/aaai.v38i10.29065","title":"Turning Waste into Wealth: Leveraging Low-Quality Samples for Enhancing Continuous Conditional Generative Adversarial Networks","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Generative grammar; Adversarial system; Generative adversarial network; Quality (philosophy); Environmental economics; Computer science; Environmental science; Economics; Artificial intelligence; Deep learning","score_opus":0.06579381498993259,"score_gpt":0.3122054445825523,"score_spread":0.2464116295926197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393156675","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.0647869,0.00069457095,0.9256683,0.00061794685,0.000115203446,0.000053855558,0.00016478528,0.0018697735,0.006028638],"genre_scores_gemma":[0.87166494,0.00044377576,0.1211282,0.0005337588,0.00007188434,0.000089490175,0.00037482454,0.00039811188,0.0052949623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940574,0.0002016988,0.000017824104,0.00012328659,0.0001736419,0.00007782785],"domain_scores_gemma":[0.9982109,0.001060828,0.00014366422,0.000328061,0.00017256667,0.00008399061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014243488,0.0011427489,0.0006388662,0.00037818085,0.0002703544,0.0009498481,0.0010665186,0.0007513597,0.0024266487],"category_scores_gemma":[0.004954286,0.00040263086,0.00051055226,0.00026399535,0.0013263235,0.001460221,0.002067785,0.00223056,0.00069872197],"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.00035840046,0.000116690855,0.0031563237,0.00017915486,0.0000913485,0.00024324592,0.00017874203,0.7476126,0.03519158,0.03324364,0.0051959385,0.17443235],"study_design_scores_gemma":[0.000008955476,0.000039733754,0.00029744583,0.000018773642,0.000011198564,0.000065397406,0.000010481262,0.9823899,0.0069293864,0.008971201,0.0012465202,0.0000110165165],"about_ca_topic_score_codex":0.0013502307,"about_ca_topic_score_gemma":0.0024184207,"teacher_disagreement_score":0.0024266487,"about_ca_system_score_codex":0.0007543604,"about_ca_system_score_gemma":0.0005596427,"threshold_uncertainty_score":0.008117974},"labels":[],"label_agreement":null},{"id":"W4393156816","doi":"10.1609/aaai.v38i17.29892","title":"ConsistNER: Towards Instructive NER Demonstrations for LLMs with the Consistency of Ontology and Context","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Atomic Energy of Canada Limited; Southeast University; National Natural Science Foundation of China; National Science Foundation","keywords":"Consistency (knowledge bases); Context (archaeology); Ontology; Computer science; Political science; History; Epistemology; Artificial intelligence; Philosophy","score_opus":0.06822964360212178,"score_gpt":0.2939055312923517,"score_spread":0.22567588769022992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393156816","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.013902876,0.00041051462,0.95777565,0.00019701742,0.00006651447,0.00021882505,0.00062305544,0.02472914,0.0020764475],"genre_scores_gemma":[0.183588,0.0003970315,0.80175394,0.00039802576,0.00006493958,0.00045847817,0.004510461,0.0015512676,0.007277912],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894494,0.00026368257,0.00008147219,0.00041255308,0.0002212539,0.000076097094],"domain_scores_gemma":[0.99798477,0.00083739357,0.00015114238,0.00055407296,0.0003274079,0.00014523692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017640374,0.0015198578,0.0010795057,0.001104627,0.0005897825,0.0012191847,0.0031547693,0.0013674593,0.007103784],"category_scores_gemma":[0.0066858428,0.00069173996,0.0012710104,0.000602398,0.0009748733,0.005196963,0.0043442477,0.0020429066,0.004528595],"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.00066046254,0.00039971876,0.0023367533,0.0011973548,0.0001596444,0.0012708271,0.0015562364,0.037430964,0.12164464,0.025621537,0.028249504,0.7794723],"study_design_scores_gemma":[0.00007580629,0.00044354872,0.0017093145,0.00010545871,0.00012968278,0.00093628414,0.0004947939,0.8377792,0.08621502,0.034836628,0.037116855,0.00015738377],"about_ca_topic_score_codex":0.0021072037,"about_ca_topic_score_gemma":0.004789222,"teacher_disagreement_score":0.007103784,"about_ca_system_score_codex":0.0005404769,"about_ca_system_score_gemma":0.000965084,"threshold_uncertainty_score":0.023764491},"labels":[],"label_agreement":null},{"id":"W4393156935","doi":"10.1609/aaai.v38i21.30353","title":"How Teachers Can Use Large Language Models and Bloom’s Taxonomy to Create Educational Quizzes","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Online Learning and Analytics","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Canadian Institute for Advanced Research","funders":"Mitacs; Canadian Institute for Advanced Research","keywords":"Bloom; Taxonomy (biology); Bloom's taxonomy; Computer science; Mathematics education; Psychology; Biology; Ecology","score_opus":0.0861660931787799,"score_gpt":0.31073947643814903,"score_spread":0.22457338325936912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393156935","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.06725364,0.00034923895,0.9063112,0.0030559644,0.00009617912,0.000863643,0.00058836397,0.0064459876,0.015035766],"genre_scores_gemma":[0.31344312,0.00021770921,0.6800696,0.00040120486,0.000018445304,0.00047812235,0.00091518677,0.0004491137,0.00400737],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99441886,0.0033633453,0.00043918635,0.0007978763,0.0008156904,0.00016508439],"domain_scores_gemma":[0.98145664,0.013922603,0.0009816141,0.0016329926,0.0016654594,0.00034070143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0079752635,0.0009348873,0.00051480054,0.0014677332,0.0005959288,0.0043926663,0.0014776974,0.001440801,0.0036440475],"category_scores_gemma":[0.035492565,0.00060193427,0.00088929967,0.00070124224,0.0011881471,0.0077051166,0.0018123784,0.0015235078,0.0019899947],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005000732,0.00081529876,0.021901654,0.0012151242,0.00012609597,0.00067953754,0.017635996,0.053042423,0.020575922,0.17176089,0.026872886,0.6848741],"study_design_scores_gemma":[0.0002549204,0.00048180128,0.007363599,0.0005679501,0.00011618445,0.0009345156,0.0060671736,0.5107967,0.028190268,0.31734377,0.12763412,0.00024892733],"about_ca_topic_score_codex":0.0046329936,"about_ca_topic_score_gemma":0.007489019,"teacher_disagreement_score":0.0079752635,"about_ca_system_score_codex":0.0015905133,"about_ca_system_score_gemma":0.0018706182,"threshold_uncertainty_score":0.042177737},"labels":[],"label_agreement":null},{"id":"W4393157138","doi":"10.1609/aaai.v38i14.29443","title":"Learning Not to Regret","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Bandit Algorithms Research","field":"Decision 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":"University of Alberta","funders":"Grantová Agentura České Republiky","keywords":"Regret; Psychology; Computer science; Machine learning","score_opus":0.2905248091849463,"score_gpt":0.4733330005536306,"score_spread":0.18280819136868431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393157138","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.03828497,0.0009887287,0.9468472,0.0021047667,0.00022805014,0.00012236621,0.00017085574,0.001334416,0.009918585],"genre_scores_gemma":[0.76673853,0.0005219293,0.22361228,0.0015644872,0.00031082652,0.00030102933,0.0003771957,0.00041299543,0.0061606723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973213,0.0011418798,0.000111049536,0.00071476237,0.00043203283,0.0002789246],"domain_scores_gemma":[0.99273515,0.0048117796,0.0005202018,0.0011720363,0.0005244528,0.0002362917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003685625,0.0016685582,0.0016870246,0.0005818631,0.0006821787,0.0018582836,0.0021822504,0.0023157145,0.0041053724],"category_scores_gemma":[0.021423167,0.0006444035,0.0009601077,0.0006079009,0.0020708593,0.0029349867,0.0018172235,0.0039932625,0.0009938007],"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.00026832632,0.00020389141,0.002176178,0.00022644745,0.00017822624,0.00007955953,0.000119704615,0.8121713,0.0014259045,0.06805477,0.0074906345,0.107605],"study_design_scores_gemma":[0.0000319489,0.000068768844,0.00015274023,0.000025955998,0.000021374168,0.00003657434,0.000013553881,0.9539856,0.0007070367,0.043808803,0.0011390531,0.00000865703],"about_ca_topic_score_codex":0.0017811449,"about_ca_topic_score_gemma":0.0021659455,"teacher_disagreement_score":0.0041053724,"about_ca_system_score_codex":0.0017705972,"about_ca_system_score_gemma":0.0023250985,"threshold_uncertainty_score":0.019491673},"labels":[],"label_agreement":null},{"id":"W4393157213","doi":"10.1609/aaai.v38i20.30205","title":"MedAlign: A Clinician-Generated Dataset for Instruction Following with Electronic Medical Records","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Electronic Health Records Systems","field":"Health Professions","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":"Artificial Intelligence in Medicine (Canada)","funders":"National Institute of Biomedical Imaging and Bioengineering; National Institute of Arthritis and Musculoskeletal and Skin Diseases; National Institute of General Medical Sciences; National Heart, Lung, and Blood Institute","keywords":"Medical record; Electronic medical record; Computer science; Medical education; Psychology; Data science; Medicine; Information retrieval; Internet privacy; Internal medicine","score_opus":0.15085518138257925,"score_gpt":0.4613888072710266,"score_spread":0.31053362588844735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393157213","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103748865,0.001450534,0.015888728,0.003502182,0.0005956339,0.0018077133,0.8485671,0.017946118,0.0064931284],"genre_scores_gemma":[0.05502133,0.00023372837,0.028846217,0.00092427,0.00009280878,0.001281924,0.9106981,0.00044745632,0.0024541428],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99690706,0.0012475391,0.00049169484,0.00070272124,0.0005036004,0.00014743673],"domain_scores_gemma":[0.9876249,0.006718724,0.0008098228,0.002039019,0.0021561258,0.00065140665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024490757,0.0012829206,0.00058830116,0.002301291,0.00088904257,0.0009414214,0.0020980542,0.002894841,0.011844226],"category_scores_gemma":[0.02441013,0.00043095968,0.0010201931,0.0019044282,0.0005059198,0.001318032,0.0019296968,0.0019960506,0.013520633],"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.0014583756,0.0010839903,0.029029233,0.0032371664,0.00020407198,0.0015179313,0.0013851965,0.006518503,0.00674183,0.0018426077,0.8448171,0.102164],"study_design_scores_gemma":[0.0021305056,0.0014913607,0.077952184,0.00080314087,0.00024221513,0.00444488,0.002019373,0.06699869,0.029274836,0.006810811,0.8074213,0.00041064926],"about_ca_topic_score_codex":0.012363773,"about_ca_topic_score_gemma":0.026344422,"teacher_disagreement_score":0.012363773,"about_ca_system_score_codex":0.0014537125,"about_ca_system_score_gemma":0.002873401,"threshold_uncertainty_score":0.039622843},"labels":[],"label_agreement":null},{"id":"W4393157304","doi":"10.1609/aaai.v38i20.30606","title":"Exploiting Action Impact Regularity and Exogenous State Variables for Offline Reinforcement Learning (Abstract Reprint)","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","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":"Reprint; Reinforcement learning; Action (physics); Reinforcement; State action; Computer science; Cognitive psychology; Psychology; Artificial intelligence; Social psychology; Political science; Law; Physics","score_opus":0.11101470799603334,"score_gpt":0.3391604714125966,"score_spread":0.22814576341656323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393157304","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.016138358,0.000085998785,0.97990865,0.000286079,0.00005151566,0.000046824287,0.00005609716,0.00052527484,0.002901247],"genre_scores_gemma":[0.81941855,0.00014156457,0.17575683,0.00023784737,0.0000666218,0.00015984177,0.00015860847,0.0001850362,0.0038750204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994967,0.00017413699,0.000030041025,0.00012041038,0.000115436545,0.0000632592],"domain_scores_gemma":[0.9956648,0.0029141002,0.00032235237,0.0006998408,0.00022065233,0.00017830227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015928895,0.00058893627,0.00070368976,0.00028643376,0.00035029327,0.00074935466,0.00081519934,0.00070494495,0.0060725124],"category_scores_gemma":[0.008942412,0.0003453712,0.0003685837,0.00039248736,0.0014020762,0.0014261527,0.0013794545,0.0023154996,0.00077326846],"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.00018694249,0.00010154576,0.0011224693,0.00006399741,0.00002227824,0.00010273785,0.00006200623,0.88167983,0.0023050802,0.039129052,0.002172824,0.07305124],"study_design_scores_gemma":[0.000013017116,0.000029169374,0.000098841854,0.0000049383466,0.0000021318588,0.000012627804,0.000003361201,0.98592293,0.0006486625,0.012733348,0.0005277365,0.000003163361],"about_ca_topic_score_codex":0.003364386,"about_ca_topic_score_gemma":0.0033778497,"teacher_disagreement_score":0.0060725124,"about_ca_system_score_codex":0.0006798785,"about_ca_system_score_gemma":0.0012974135,"threshold_uncertainty_score":0.020314634},"labels":[],"label_agreement":null},{"id":"W4393157400","doi":"10.1609/aaai.v38i18.30001","title":"PRP Rebooted: Advancing the State of the Art in FOND Planning","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Vector Institute; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"State (computer science); Art; Political science; Aesthetics; Computer science","score_opus":0.04231844455838684,"score_gpt":0.2864380058647946,"score_spread":0.24411956130640777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393157400","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.052216873,0.012385199,0.89497876,0.002822281,0.00048607777,0.00020455691,0.00051008887,0.0064647337,0.029931445],"genre_scores_gemma":[0.5390083,0.004156548,0.44792056,0.00067046506,0.00018559383,0.00019369951,0.0011005129,0.00090098794,0.0058633406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740833,0.0009170289,0.00012846313,0.00038961388,0.0009371914,0.00021946778],"domain_scores_gemma":[0.9942702,0.0036701546,0.00021047854,0.001186145,0.0005134497,0.00014956511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029332708,0.0011483912,0.0010884803,0.0009637383,0.0007921578,0.0017187693,0.002335927,0.001329441,0.0056274068],"category_scores_gemma":[0.010407238,0.0005280265,0.00091382704,0.0011325824,0.0020123369,0.002844082,0.002951903,0.002437086,0.0011165135],"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.00041090447,0.00018671347,0.0014880094,0.0010077967,0.00008889984,0.00023945226,0.000345727,0.37676656,0.0034909195,0.07695779,0.0139039075,0.5251133],"study_design_scores_gemma":[0.00007763027,0.00019519262,0.00039934446,0.00020175337,0.00004991394,0.00014154514,0.0001271699,0.8945337,0.0037564794,0.07017886,0.030298416,0.00003999533],"about_ca_topic_score_codex":0.010619083,"about_ca_topic_score_gemma":0.012838027,"teacher_disagreement_score":0.010619083,"about_ca_system_score_codex":0.0010728923,"about_ca_system_score_gemma":0.0033973195,"threshold_uncertainty_score":0.021114528},"labels":[],"label_agreement":null},{"id":"W4393157426","doi":"10.1609/aaai.v38i17.29864","title":"Well, Now We Know! Unveiling Sarcasm: Initiating and Exploring Multimodal Conversations with Reasoning","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Language, Metaphor, and Cognition","field":"Psychology","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":"Sarcasm; Psychology; Irony; Cognitive science; Linguistics; Philosophy","score_opus":0.10483231900074641,"score_gpt":0.3278289249717097,"score_spread":0.22299660597096327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393157426","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.609919,0.013921656,0.27124453,0.0047938414,0.0010724243,0.0018377629,0.039271202,0.022847777,0.03509175],"genre_scores_gemma":[0.6520896,0.0019571567,0.26950207,0.0015948656,0.00024155506,0.0008641052,0.061318427,0.0006635859,0.011768742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702615,0.0016033778,0.00013803893,0.0006630869,0.00035576156,0.00021365884],"domain_scores_gemma":[0.9972179,0.0015021014,0.00032327295,0.00041084166,0.0003293542,0.00021655617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002388111,0.0021254688,0.00057360105,0.0018593816,0.0011562047,0.0022048014,0.0015393039,0.0024544613,0.00256952],"category_scores_gemma":[0.008495608,0.00034496072,0.0013465617,0.0008205617,0.0007558618,0.003179606,0.0029337897,0.001776757,0.0029974708],"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.0033098154,0.0011585174,0.057096306,0.0053505944,0.00084707513,0.003886323,0.03490745,0.010831158,0.08890809,0.008844733,0.15568335,0.6291766],"study_design_scores_gemma":[0.00029826228,0.0016124784,0.11584378,0.0018329246,0.00067665585,0.005531813,0.05374946,0.32623053,0.07248863,0.03601178,0.38509092,0.0006327857],"about_ca_topic_score_codex":0.0046517244,"about_ca_topic_score_gemma":0.010972843,"teacher_disagreement_score":0.0046517244,"about_ca_system_score_codex":0.0008027301,"about_ca_system_score_gemma":0.0007112087,"threshold_uncertainty_score":0.012629628},"labels":[],"label_agreement":null},{"id":"W4393157523","doi":"10.1609/aaai.v38i20.30256","title":"Fairness-Aware Structured Pruning in Transformers","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Manufacturing Process and Optimization","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research; Polytechnique Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Alliance de recherche numérique du Canada; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Transformer; Computer science; Pruning; Engineering; Biology; Electrical engineering; Agronomy","score_opus":0.034593465007740104,"score_gpt":0.2579532400486338,"score_spread":0.2233597750408937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393157523","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.08357113,0.0005784556,0.9035031,0.0007700445,0.00014203662,0.00016674414,0.0004181933,0.006809395,0.004040927],"genre_scores_gemma":[0.8057561,0.00025498378,0.18716927,0.0007869499,0.00009264797,0.00016968016,0.001091114,0.00091178506,0.003767477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983102,0.0006968779,0.00010119135,0.0003562073,0.0003142489,0.00022119451],"domain_scores_gemma":[0.9948731,0.0034629712,0.00018114207,0.0008573499,0.00046127968,0.00016418989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003052234,0.0011828183,0.0009847203,0.00089341967,0.000819276,0.001851276,0.0023912112,0.0011804749,0.0040042754],"category_scores_gemma":[0.015294355,0.00058201095,0.0013150759,0.00055920647,0.0010888018,0.0035685995,0.0028504056,0.002398291,0.0014476969],"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.0011804319,0.0003341167,0.010358122,0.00036374255,0.00020978713,0.000894825,0.0012356689,0.43355232,0.018005565,0.050246228,0.013805631,0.4698136],"study_design_scores_gemma":[0.000043711378,0.000059423375,0.00035236328,0.000025163794,0.000041053212,0.0001056479,0.00011036237,0.9607948,0.0049854736,0.031489275,0.0019809313,0.000011795607],"about_ca_topic_score_codex":0.007807688,"about_ca_topic_score_gemma":0.012741222,"teacher_disagreement_score":0.007807688,"about_ca_system_score_codex":0.001174552,"about_ca_system_score_gemma":0.0025295264,"threshold_uncertainty_score":0.016141951},"labels":[],"label_agreement":null},{"id":"W4393157541","doi":"10.1609/aaai.v38i20.30230","title":"Hear You Say You: An Efficient Framework for Marine Mammal Sounds’ Classification","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Marine animal studies overview","field":"Environmental Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Marine mammal; Mammal; Geography; Computer science; Ecology; Biology","score_opus":0.09597232664636289,"score_gpt":0.3235932367178038,"score_spread":0.22762091007144092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393157541","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.0057254997,0.0002487148,0.98988265,0.00021660975,0.00003691647,0.000043353113,0.00019763155,0.0028712463,0.00077727594],"genre_scores_gemma":[0.26092476,0.00047979402,0.7263987,0.00030953554,0.0001307197,0.00024555097,0.0019188769,0.00038731375,0.00920469],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997075,0.00004476258,0.000013908586,0.00008606287,0.0000937379,0.00005388857],"domain_scores_gemma":[0.9997334,0.000069544,0.000024398787,0.0000469839,0.00009773701,0.00002787548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007981585,0.0008461661,0.00069817016,0.0008446171,0.00048999256,0.00091016834,0.0024892997,0.0011386046,0.0036238716],"category_scores_gemma":[0.0016943645,0.0003956274,0.0008074147,0.0006265882,0.00053571595,0.0015663026,0.0012657075,0.0016175159,0.0015626402],"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.00030314768,0.00018794375,0.002023347,0.00011544774,0.00010222836,0.00016723636,0.000121592806,0.3327403,0.011373374,0.03446386,0.015604196,0.6027973],"study_design_scores_gemma":[0.0000054487837,0.000012751774,0.00010502972,0.0000040472623,0.0000051197917,0.000021547647,0.0000077122595,0.9904322,0.0011695471,0.006752601,0.0014794983,0.0000044508383],"about_ca_topic_score_codex":0.022376243,"about_ca_topic_score_gemma":0.029445056,"teacher_disagreement_score":0.022376243,"about_ca_system_score_codex":0.0010993812,"about_ca_system_score_gemma":0.0016753235,"threshold_uncertainty_score":0.044492006},"labels":[],"label_agreement":null},{"id":"W4393158423","doi":"10.1609/aaai.v38i2.27824","title":"DreamStyler: Paint by Style Inversion with Text-to-Image Diffusion Models","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Aesthetic Perception and Analysis","field":"Neuroscience","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":"Kootenay Association for Science & Technology","funders":"","keywords":"Style (visual arts); Inversion (geology); Image (mathematics); Diffusion; Geology; Computer science; Computer graphics (images); Computer vision; Art; Visual arts; Physics; Geomorphology; Thermodynamics","score_opus":0.060899429566693204,"score_gpt":0.28595415333053903,"score_spread":0.22505472376384583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393158423","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.008557495,0.00032539497,0.9852207,0.00017311519,0.000096946795,0.000060508795,0.00019681582,0.0030318566,0.0023371787],"genre_scores_gemma":[0.2961639,0.0007698732,0.68394166,0.0005005401,0.00016369176,0.00031126893,0.0010052038,0.0020738808,0.015069997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998293,0.000039400038,0.000008371521,0.000052855532,0.000051297833,0.00001879935],"domain_scores_gemma":[0.99963737,0.00016405957,0.000035213296,0.00006893212,0.00006072527,0.000033685592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006981605,0.001057298,0.000802251,0.00060352124,0.00028526218,0.0011476289,0.0018847183,0.0011574416,0.006948686],"category_scores_gemma":[0.0018725635,0.0006660003,0.0015057111,0.00049405475,0.00050922274,0.001316154,0.0012980698,0.0015201697,0.0018885578],"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.00024702327,0.00016202638,0.0005931282,0.00031266213,0.00016561586,0.00015505806,0.00020867154,0.64206356,0.02470455,0.023641355,0.0107739,0.29697245],"study_design_scores_gemma":[0.000014957683,0.000014650578,0.00002842007,0.000005148986,0.0000061484047,0.000017751529,0.00000492748,0.9934274,0.001246375,0.0042586667,0.0009688272,0.0000068577074],"about_ca_topic_score_codex":0.004073332,"about_ca_topic_score_gemma":0.005455155,"teacher_disagreement_score":0.006948686,"about_ca_system_score_codex":0.0006050221,"about_ca_system_score_gemma":0.0005964385,"threshold_uncertainty_score":0.023245633},"labels":[],"label_agreement":null},{"id":"W4393158677","doi":"10.1609/aaai.v38i2.27839","title":"Learning Generalized Medical Image Segmentation from Decoupled Feature Queries","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Image Retrieval and Classification Techniques","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 Alberta","funders":"","keywords":"Feature (linguistics); Artificial intelligence; Segmentation; Computer science; Image (mathematics); Pattern recognition (psychology); Computer vision; Image segmentation","score_opus":0.03911934002344062,"score_gpt":0.31302782293398745,"score_spread":0.2739084829105468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393158677","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.07810869,0.0011173368,0.89994174,0.0006483764,0.00010088753,0.0001682411,0.0017972124,0.015591346,0.0025262053],"genre_scores_gemma":[0.66164076,0.0005192898,0.31823075,0.0009174025,0.0001376439,0.00025241278,0.010384474,0.0008825603,0.007034633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992342,0.00010301963,0.000039280418,0.0003502353,0.00016971529,0.00010354383],"domain_scores_gemma":[0.9993974,0.00017619501,0.00006034639,0.0002065259,0.00011016879,0.00004922455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006575076,0.0017771298,0.0015224491,0.0009813327,0.00034528313,0.0013386359,0.0023636871,0.0020782878,0.0044148914],"category_scores_gemma":[0.0024616215,0.0005882081,0.0012193164,0.001404048,0.0006861904,0.0025614738,0.0021153348,0.0015749945,0.0016503972],"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.0007931242,0.0003366001,0.0024698407,0.00030979436,0.00018553702,0.0004937917,0.000251245,0.2848974,0.045599144,0.009606657,0.024161771,0.63089514],"study_design_scores_gemma":[0.000034387194,0.00009497924,0.00037535117,0.000008644441,0.000019323457,0.000166273,0.00005470003,0.97878224,0.0074058813,0.010942782,0.0020978206,0.000017618218],"about_ca_topic_score_codex":0.0047733667,"about_ca_topic_score_gemma":0.006826651,"teacher_disagreement_score":0.0047733667,"about_ca_system_score_codex":0.0010020727,"about_ca_system_score_gemma":0.0012929776,"threshold_uncertainty_score":0.014769256},"labels":[],"label_agreement":null},{"id":"W4393158691","doi":"10.1609/aaai.v38i1.27765","title":"ContraNovo: A Contrastive Learning Approach to Enhance De Novo Peptide Sequencing","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"vaccines and immunoinformatics approaches","field":"Biochemistry, Genetics and Molecular Biology","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 British Columbia","funders":"Fudan University; National Natural Science Foundation of China","keywords":"Computational biology; DNA sequencing; Peptide; Biology; Computer science; Natural language processing; Artificial intelligence; Genetics; Biochemistry; Gene","score_opus":0.03871356193591151,"score_gpt":0.2895098014544825,"score_spread":0.250796239518571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393158691","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.03126358,0.0015383188,0.9542685,0.0006038689,0.0002950849,0.00018685021,0.0003474257,0.0071134833,0.004382891],"genre_scores_gemma":[0.17835402,0.0003775585,0.81216234,0.0012927537,0.00014550959,0.00016088405,0.001343406,0.0010048299,0.00515863],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998836,0.00030851396,0.000053271695,0.00039263233,0.00031264997,0.000096933356],"domain_scores_gemma":[0.9974611,0.0014206865,0.00017045994,0.00037341288,0.00041619412,0.00015814434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031387394,0.0015352827,0.0011531914,0.001447271,0.00077643764,0.001632266,0.0032751209,0.0025239594,0.0026808404],"category_scores_gemma":[0.007993347,0.0006425685,0.0010610321,0.0008194618,0.0011610488,0.0023321097,0.0029997916,0.002995444,0.0012080566],"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.0010831895,0.0005187047,0.004693408,0.00036417192,0.0002670799,0.00036401584,0.00025720708,0.1783321,0.050356906,0.026699502,0.01587044,0.72119325],"study_design_scores_gemma":[0.00007485689,0.00018598266,0.0003547076,0.000033303062,0.00003836553,0.00018940213,0.000029020368,0.96151733,0.0143022025,0.015838126,0.0074054576,0.000031209758],"about_ca_topic_score_codex":0.0031412153,"about_ca_topic_score_gemma":0.0062822383,"teacher_disagreement_score":0.0032751209,"about_ca_system_score_codex":0.0011337218,"about_ca_system_score_gemma":0.002065531,"threshold_uncertainty_score":0.016599417},"labels":[],"label_agreement":null},{"id":"W4393158999","doi":"10.1609/aaai.v38i3.27960","title":"PoseGen: Learning to Generate 3D Human Pose Dataset with NeRF","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Human Pose and Action Recognition","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":"Artificial intelligence; Computer science","score_opus":0.07217025472238092,"score_gpt":0.3118457125422451,"score_spread":0.23967545781986416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393158999","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.010161508,0.000529538,0.9380453,0.00028683274,0.0002571802,0.00041308088,0.0046132104,0.043685593,0.002007807],"genre_scores_gemma":[0.14178135,0.00039753513,0.81557727,0.001045152,0.000119039476,0.0011398656,0.032788802,0.0022444525,0.0049064886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998793,0.00021009469,0.00003949411,0.0005492027,0.00031206812,0.00009609639],"domain_scores_gemma":[0.9988763,0.00036548972,0.00006995079,0.00041753493,0.00018430405,0.00008644041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001772892,0.0027535458,0.0012907739,0.0013766722,0.00047877186,0.0009037193,0.0035749786,0.0020735848,0.010434377],"category_scores_gemma":[0.005704587,0.0010767365,0.0019441674,0.0008549731,0.0009747768,0.0018519431,0.003063379,0.0027781257,0.007305637],"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.00061985344,0.0006357886,0.0042244643,0.0004400255,0.00024777369,0.00038256447,0.00022699336,0.2281317,0.01308212,0.0054921187,0.073298715,0.67321795],"study_design_scores_gemma":[0.00010300752,0.00026066732,0.001293702,0.00005384702,0.000023380031,0.00040064624,0.00007011678,0.9574038,0.010831602,0.012557978,0.01693623,0.00006503496],"about_ca_topic_score_codex":0.0049310266,"about_ca_topic_score_gemma":0.010268728,"teacher_disagreement_score":0.010434377,"about_ca_system_score_codex":0.00093658577,"about_ca_system_score_gemma":0.0010023606,"threshold_uncertainty_score":0.034906507},"labels":[],"label_agreement":null},{"id":"W4393159133","doi":"10.1609/aaai.v38i8.28650","title":"An Approximate Skolem Function Counter","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Function (biology); Physics; Mathematics; Biology","score_opus":0.06802914258940301,"score_gpt":0.3278646981445455,"score_spread":0.2598355555551425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393159133","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.031790383,0.00037604597,0.94684947,0.000689228,0.00012262468,0.00012882492,0.00055788324,0.012767042,0.006718401],"genre_scores_gemma":[0.32270685,0.0001640356,0.66975313,0.0005845677,0.0000832474,0.00031142117,0.0010575089,0.0010585755,0.0042807283],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761665,0.0005151425,0.00012655703,0.00068291713,0.0008016035,0.00025726054],"domain_scores_gemma":[0.9939545,0.0031095645,0.00040138248,0.0017705697,0.0006129929,0.00015104077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017887965,0.0011721557,0.0011607152,0.002057259,0.0010190023,0.002492972,0.0033204437,0.0022198162,0.008601532],"category_scores_gemma":[0.012056573,0.0005420426,0.0013310107,0.0015528499,0.0014033174,0.0059737517,0.001969953,0.0018047943,0.0027002],"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.0017154338,0.0003289908,0.005420581,0.00060276483,0.0001914946,0.00031493366,0.00040914465,0.13759232,0.04725058,0.30720332,0.023908583,0.4750618],"study_design_scores_gemma":[0.0000842779,0.00013116044,0.0003488268,0.00006774483,0.000053842672,0.0002715389,0.00004828769,0.8330693,0.031430703,0.12323456,0.011212337,0.000047463498],"about_ca_topic_score_codex":0.0015729945,"about_ca_topic_score_gemma":0.0026976177,"teacher_disagreement_score":0.008601532,"about_ca_system_score_codex":0.0028192634,"about_ca_system_score_gemma":0.003830023,"threshold_uncertainty_score":0.028775036},"labels":[],"label_agreement":null},{"id":"W4393159294","doi":"10.1609/aaai.v38i5.28212","title":"Improving Automatic VQA Evaluation Using Large Language Models","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Occupational Health and Safety Research","field":"Health Professions","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"Canadian Institute for Advanced Research; Samsung; Nvidia","keywords":"Computer science; Natural language processing; Artificial intelligence","score_opus":0.29702787312122925,"score_gpt":0.5141273970227914,"score_spread":0.21709952390156217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393159294","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.25048122,0.0050600613,0.6399953,0.002603545,0.0011295195,0.0012210591,0.004686307,0.08070717,0.014115766],"genre_scores_gemma":[0.77510107,0.00034060527,0.20751028,0.0010283884,0.0002137018,0.0005960123,0.008974481,0.002280897,0.003954504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.96226394,0.02496739,0.0022622582,0.0035178815,0.0061788606,0.00080966036],"domain_scores_gemma":[0.9164088,0.05476924,0.0023786896,0.0076374374,0.017484771,0.0013210726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020271441,0.0020406148,0.0015199054,0.0029697279,0.0011184004,0.004238503,0.0029332973,0.0023682106,0.005767157],"category_scores_gemma":[0.09513358,0.00067248807,0.0015236695,0.0012834491,0.00092383224,0.005589978,0.003960786,0.0028976032,0.003112664],"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.0016067917,0.0011616179,0.020887818,0.001726941,0.0005718581,0.0003845936,0.0028141988,0.099595025,0.044012424,0.01028898,0.08190804,0.7350417],"study_design_scores_gemma":[0.00023743541,0.0005377525,0.005057732,0.00014828147,0.000097925105,0.00019280419,0.000601669,0.9459836,0.022285802,0.009865707,0.014847847,0.00014350882],"about_ca_topic_score_codex":0.011562987,"about_ca_topic_score_gemma":0.013605859,"teacher_disagreement_score":0.020271441,"about_ca_system_score_codex":0.0023044322,"about_ca_system_score_gemma":0.0026012904,"threshold_uncertainty_score":0.10720688},"labels":[],"label_agreement":null},{"id":"W4393159356","doi":"10.1609/aaai.v38i6.28336","title":"Integrated Decision Gradients: Compute Your Attributions Where the Model Makes Its Decision","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"Defense Advanced Research Projects Agency; Florida High Tech Corridor Council; U.S. Department of Energy","keywords":"Attribution; Decision model; Computer science; Psychology; Machine learning; Social psychology","score_opus":0.11164177275541806,"score_gpt":0.30796418684497057,"score_spread":0.1963224140895525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393159356","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.049190845,0.0002947613,0.9423377,0.0009980951,0.000104806815,0.0001522637,0.0002960962,0.0027529765,0.0038724458],"genre_scores_gemma":[0.7386502,0.00022258531,0.25594297,0.0002506945,0.00007112944,0.00018815845,0.0006147999,0.00047592854,0.0035835372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933296,0.00019248007,0.000047297784,0.00017778168,0.00016223587,0.00008725483],"domain_scores_gemma":[0.99655825,0.0018979728,0.00036722366,0.0004381595,0.0005631974,0.00017517348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024323286,0.0015636613,0.0009681858,0.0014465827,0.0005494103,0.0019326664,0.0016851985,0.0014777087,0.0073622214],"category_scores_gemma":[0.015119398,0.00052919186,0.00066968356,0.0007665301,0.0011641579,0.0034016974,0.0018803048,0.0024013938,0.0011648312],"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.00036077184,0.00015540623,0.00639613,0.0001765458,0.0000970807,0.00012422592,0.00021307434,0.6245263,0.0023162873,0.04207724,0.008339112,0.31521782],"study_design_scores_gemma":[0.000011924718,0.000024632383,0.00034004182,0.000018231729,0.000009248842,0.000021302676,0.000023573752,0.9709409,0.0016284088,0.02621305,0.00075836014,0.000010398048],"about_ca_topic_score_codex":0.0067452355,"about_ca_topic_score_gemma":0.0061646844,"teacher_disagreement_score":0.0073622214,"about_ca_system_score_codex":0.0018652537,"about_ca_system_score_gemma":0.0020774493,"threshold_uncertainty_score":0.024629056},"labels":[],"label_agreement":null},{"id":"W4393159548","doi":"10.1609/aaai.v38i12.29263","title":"Narrowing the Gap between Supervised and Unsupervised Sentence Representation Learning with Large Language Model","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","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 Ottawa","funders":"Fundamental Research Funds for the Central Universities; State Key Laboratory of Software Development Environment; National Natural Science Foundation of China","keywords":"Sentence; Natural language processing; Artificial intelligence; Computer science; Representation (politics); Unsupervised learning; Language model; Linguistics; Machine learning; Philosophy","score_opus":0.09381631991397431,"score_gpt":0.3127379495608163,"score_spread":0.21892162964684198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393159548","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.36878905,0.002009144,0.61422354,0.0021328456,0.00017026407,0.00028976682,0.0006650152,0.0064122537,0.0053081857],"genre_scores_gemma":[0.818263,0.00035696683,0.17584325,0.00063190033,0.00009881634,0.0003080576,0.0023664602,0.00065436185,0.0014771825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9898784,0.0057236706,0.00051204045,0.0022812209,0.0012826876,0.00032199608],"domain_scores_gemma":[0.94565076,0.04243835,0.0014663441,0.0076956996,0.0019650804,0.0007836594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010861003,0.0016224857,0.0016411024,0.0011689807,0.0009732795,0.0019926263,0.002250228,0.002049373,0.0015252278],"category_scores_gemma":[0.05164589,0.0007202334,0.0009083318,0.0009391843,0.0013836187,0.00812452,0.004919515,0.004367847,0.0011283342],"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.0015232433,0.0019575441,0.013238631,0.000758388,0.00039255546,0.00035056437,0.00200546,0.21811877,0.022901356,0.014837943,0.010718808,0.7131967],"study_design_scores_gemma":[0.000059188595,0.00049262017,0.002111769,0.000035323916,0.000032204964,0.00012459458,0.0002451566,0.96514124,0.010301918,0.019785237,0.0016192121,0.000051503204],"about_ca_topic_score_codex":0.0018166034,"about_ca_topic_score_gemma":0.0034023605,"teacher_disagreement_score":0.010861003,"about_ca_system_score_codex":0.0010493296,"about_ca_system_score_gemma":0.0014162206,"threshold_uncertainty_score":0.057439208},"labels":[],"label_agreement":null},{"id":"W4393159569","doi":"10.1609/aaai.v38i10.28999","title":"Understanding Distributed Representations of Concepts in Deep Neural Networks without Supervision","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Neural Networks and Applications","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":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; Korea Advanced Institute of Science and Technology","keywords":"Computer science; Artificial neural network; Cognitive science; Artificial intelligence; Deep neural networks; Psychology","score_opus":0.14119041759848408,"score_gpt":0.34680996097052397,"score_spread":0.2056195433720399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393159569","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.13753845,0.00025341584,0.8605497,0.0003336127,0.000017128757,0.000036341793,0.00020635438,0.00036037012,0.00070464285],"genre_scores_gemma":[0.8868356,0.000203966,0.11131266,0.00011016591,0.00002637522,0.00007971329,0.0004206422,0.00004550641,0.00096547656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995777,0.00011128156,0.000020482623,0.00015373767,0.00008660519,0.000050104838],"domain_scores_gemma":[0.9987232,0.00065573823,0.00024871196,0.00019363021,0.000121867764,0.000056767192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009654767,0.0007787837,0.0006619759,0.0007907064,0.00027125288,0.0010498241,0.0011102876,0.0008137837,0.00062398065],"category_scores_gemma":[0.0038474237,0.0005389939,0.0006347374,0.0006118553,0.0011723572,0.0025710012,0.0013238209,0.0021640407,0.00015260381],"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.00020468805,0.000108799446,0.0040837033,0.0001681061,0.000102587495,0.00021859218,0.00044435554,0.8171069,0.018207947,0.041045237,0.0013738647,0.116935216],"study_design_scores_gemma":[0.000004196541,0.0000127109815,0.00037802328,0.0000061551937,0.000005131833,0.000013471246,0.000025232608,0.9668684,0.0011923037,0.03134672,0.00014362451,0.000004100579],"about_ca_topic_score_codex":0.0036785752,"about_ca_topic_score_gemma":0.0047018565,"teacher_disagreement_score":0.0036785752,"about_ca_system_score_codex":0.0010854878,"about_ca_system_score_gemma":0.0006708695,"threshold_uncertainty_score":0.0078758},"labels":[],"label_agreement":null},{"id":"W4393159638","doi":"10.1609/aaai.v38i11.29122","title":"Calibrated One Round Federated Learning with Bayesian Inference in the Predictive Space","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Waterloo","funders":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Inference; Bayesian inference; Bayesian probability; Machine learning; Computer science; Artificial intelligence; Space (punctuation); Predictive inference; Frequentist inference","score_opus":0.06808428047736824,"score_gpt":0.2993291290021323,"score_spread":0.23124484852476407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393159638","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.017620437,0.00025433823,0.9765114,0.0005766515,0.00005952977,0.00010878093,0.00022990345,0.0031543716,0.0014846169],"genre_scores_gemma":[0.5352701,0.00022207598,0.45634204,0.001117826,0.00020735065,0.00043558143,0.0016271399,0.000814932,0.0039630122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99542797,0.0017152111,0.00024590877,0.0013363422,0.00086047954,0.00041414102],"domain_scores_gemma":[0.98677325,0.006931106,0.0006644296,0.0034893763,0.0016571145,0.00048471877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007975361,0.0022383863,0.002858223,0.001409732,0.0015917153,0.0030633686,0.005262589,0.0031220973,0.0044615446],"category_scores_gemma":[0.03196273,0.0015747959,0.001830122,0.0014823005,0.0023428928,0.005703189,0.0054262048,0.0063809603,0.0016041158],"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.0005261667,0.00024949352,0.0041189664,0.0001367079,0.000212161,0.00017386436,0.0002836698,0.79828686,0.0016785613,0.021846715,0.0059993565,0.16648747],"study_design_scores_gemma":[0.0000238376,0.000027676873,0.0001599231,0.000018161136,0.000015843445,0.00003475565,0.000022866489,0.9766103,0.00083147734,0.021757806,0.00048462985,0.000012727155],"about_ca_topic_score_codex":0.010381674,"about_ca_topic_score_gemma":0.012601787,"teacher_disagreement_score":0.010381674,"about_ca_system_score_codex":0.0025745437,"about_ca_system_score_gemma":0.0046103355,"threshold_uncertainty_score":0.042178214},"labels":[],"label_agreement":null},{"id":"W4393159648","doi":"10.1609/aaai.v38i14.29524","title":"PORTAL: Automatic Curricula Generation for Multiagent Reinforcement Learning","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; University of Alberta; Alberta Machine Intelligence Institute; Compute Canada; National Natural Science Foundation of China; Canadian Institute for Advanced Research","keywords":"Curriculum; Reinforcement learning; Computer science; Artificial intelligence; Psychology; Pedagogy","score_opus":0.10407941351880122,"score_gpt":0.3231192467728909,"score_spread":0.21903983325408966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393159648","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.006817077,0.000095312476,0.9867747,0.0001143488,0.000043616972,0.00012127177,0.00006407215,0.004708738,0.001260896],"genre_scores_gemma":[0.3807248,0.00011860964,0.61436665,0.00019012403,0.00004917323,0.0007364412,0.00036552796,0.00045698642,0.0029917432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934167,0.000285203,0.00003379057,0.00013527847,0.0001358468,0.0000682138],"domain_scores_gemma":[0.9987575,0.0006596546,0.000114640956,0.00016534957,0.00017946438,0.00012345926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020336157,0.0008146049,0.0008935367,0.00052910566,0.000470581,0.00079927506,0.0021426976,0.0011363253,0.0073334593],"category_scores_gemma":[0.005406728,0.00048387397,0.0005062497,0.00032550254,0.00071442284,0.0012783447,0.0020295312,0.0017702248,0.0014793462],"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.00030371535,0.00037275717,0.002010838,0.0002397299,0.00007752037,0.00015514674,0.00019439284,0.66122067,0.004239808,0.025000628,0.0091593955,0.2970254],"study_design_scores_gemma":[0.000041008127,0.000028840497,0.000054318447,0.0000046759537,0.0000032198193,0.0000101581445,0.000006063646,0.9939394,0.00058337796,0.0042394446,0.0010856963,0.000003823316],"about_ca_topic_score_codex":0.0029302072,"about_ca_topic_score_gemma":0.0031232522,"teacher_disagreement_score":0.0073334593,"about_ca_system_score_codex":0.0008786513,"about_ca_system_score_gemma":0.0016251898,"threshold_uncertainty_score":0.024532855},"labels":[],"label_agreement":null},{"id":"W4393159670","doi":"10.1609/aaai.v38i10.28963","title":"Generating Universal Adversarial Perturbations for Quantum Classifiers","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of British Columbia","funders":"Alliance de recherche numérique du Canada; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Adversarial system; Quantum; Computer science; Theoretical computer science; Artificial intelligence; Quantum mechanics; Physics","score_opus":0.06538845442596776,"score_gpt":0.28933724359401086,"score_spread":0.22394878916804312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393159670","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.025526213,0.00012973645,0.9710633,0.0004972725,0.000041607553,0.00007440857,0.00005442502,0.0003680203,0.0022450613],"genre_scores_gemma":[0.8780802,0.00018774527,0.11828295,0.00046165887,0.00007677485,0.00019103712,0.00014602943,0.00013442089,0.0024392577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975031,0.0010727766,0.00008192733,0.0003721741,0.000770708,0.00019937096],"domain_scores_gemma":[0.9940778,0.0040300884,0.00051382737,0.00090692774,0.0003041033,0.00016722454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032238276,0.00076357054,0.0008899049,0.00057033147,0.00055692374,0.0011589488,0.0013895974,0.0015070409,0.0017820174],"category_scores_gemma":[0.013987789,0.000444241,0.0006612618,0.0003886444,0.0024054034,0.0023611833,0.003242146,0.002863382,0.00034942693],"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.00015151568,0.00006750793,0.0010772145,0.00008483791,0.00005423519,0.00015097867,0.00012879181,0.67790455,0.0073144548,0.26139602,0.0021110207,0.049558852],"study_design_scores_gemma":[0.000006542853,0.000022641156,0.0000618916,0.0000074337777,0.0000044465714,0.00002871581,0.000006327354,0.951884,0.0019633009,0.045552567,0.00045563493,0.0000064709575],"about_ca_topic_score_codex":0.0005229576,"about_ca_topic_score_gemma":0.00059395353,"teacher_disagreement_score":0.0032238276,"about_ca_system_score_codex":0.0014378497,"about_ca_system_score_gemma":0.0010099428,"threshold_uncertainty_score":0.017049372},"labels":[],"label_agreement":null},{"id":"W4393159733","doi":"10.1609/aaai.v38i7.28576","title":"PNeRFLoc: Visual Localization with Point-Based Neural Radiance Fields","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Vision and Imaging","field":"Computer Science","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":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Radiance; Artificial intelligence; Computer vision; Point (geometry); Computer science; Artificial neural network; Mathematics; Remote sensing; Geology; Geometry","score_opus":0.03955739142012143,"score_gpt":0.30777106545607197,"score_spread":0.26821367403595053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393159733","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.005187652,0.00019270153,0.98678917,0.00007389341,0.00004942099,0.00004293508,0.00017976531,0.006307639,0.0011768768],"genre_scores_gemma":[0.19965626,0.0003840139,0.79083365,0.0003471338,0.000085760046,0.00025623053,0.001955581,0.0017450074,0.004736422],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996953,0.00003621623,0.0000088070665,0.000097579425,0.00012549896,0.000036583704],"domain_scores_gemma":[0.99969304,0.0000768932,0.000034780063,0.000084193256,0.00008047434,0.000030699095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005021481,0.0014330293,0.0008652927,0.0010179185,0.00026951052,0.00083249307,0.0025767586,0.0010544439,0.00372144],"category_scores_gemma":[0.0016459203,0.0004771436,0.0009987715,0.0007353745,0.000549474,0.0012880102,0.0014812661,0.0018478262,0.0015343459],"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.00026617022,0.00018078968,0.0006595156,0.00018971266,0.000115873794,0.00015523173,0.000090324655,0.41094533,0.038524244,0.009875367,0.015152811,0.52384454],"study_design_scores_gemma":[0.000030411526,0.000034779547,0.000117059346,0.000010925557,0.000008117961,0.00004969678,0.000008536466,0.988514,0.005571139,0.0026424022,0.0029965492,0.000016288755],"about_ca_topic_score_codex":0.006823464,"about_ca_topic_score_gemma":0.008436252,"teacher_disagreement_score":0.006823464,"about_ca_system_score_codex":0.00073531596,"about_ca_system_score_gemma":0.0008699894,"threshold_uncertainty_score":0.013567448},"labels":[],"label_agreement":null},{"id":"W4393159749","doi":"10.1609/aaai.v38i9.28927","title":"Exact ASP Counting with Compact Encodings","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Web Data Mining and Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Supercomputing Centre Singapore; Ministry of Education, India; National Research Foundation Singapore; National Research Foundation","keywords":"Computer science; Mathematics","score_opus":0.06447184882877637,"score_gpt":0.29221073264395614,"score_spread":0.22773888381517976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393159749","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.078912675,0.0020084605,0.8680536,0.0026638717,0.0003633186,0.0004311414,0.006316217,0.01508263,0.026168117],"genre_scores_gemma":[0.40114802,0.0010829669,0.576365,0.0008430897,0.00018634995,0.0006573934,0.009558449,0.0016618331,0.008496884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992792,0.0018145671,0.0006430154,0.0011820795,0.002885026,0.0006832751],"domain_scores_gemma":[0.99134374,0.004381672,0.0006689907,0.0019414377,0.0013696526,0.00029450937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025031143,0.0014433503,0.0011630607,0.0021484075,0.0009287131,0.0057351086,0.003143293,0.0014204951,0.01061704],"category_scores_gemma":[0.019374313,0.0006274762,0.0018030986,0.0030372012,0.0015423483,0.009618459,0.0036589373,0.0031971098,0.0025180504],"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.0007114333,0.0005566831,0.0035012166,0.00090096705,0.00010696233,0.0004675261,0.00055876514,0.109584674,0.009694166,0.47307625,0.031961426,0.36887997],"study_design_scores_gemma":[0.00012391861,0.00016919519,0.0004620507,0.00015371937,0.00008444183,0.00030890692,0.00024183614,0.4583915,0.01027301,0.50274837,0.026987985,0.00005514705],"about_ca_topic_score_codex":0.0030211287,"about_ca_topic_score_gemma":0.005625601,"teacher_disagreement_score":0.01061704,"about_ca_system_score_codex":0.0026592277,"about_ca_system_score_gemma":0.0033344356,"threshold_uncertainty_score":0.035517573},"labels":[],"label_agreement":null},{"id":"W4393159781","doi":"10.1609/aaai.v38i11.29115","title":"From Past to Future: Rethinking Eligibility Traces","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Semantic Web and Ontologies","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":"History; Political science","score_opus":0.07799602367208078,"score_gpt":0.32796272479604116,"score_spread":0.24996670112396038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393159781","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.074191175,0.0005387379,0.9163687,0.0024171975,0.00012269829,0.000150601,0.0003821193,0.0010388813,0.004789793],"genre_scores_gemma":[0.8553813,0.0003016457,0.14085816,0.00036270535,0.000052043135,0.00018092607,0.00032785124,0.00025927933,0.0022761542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777645,0.00097268634,0.00016151147,0.0004779808,0.0004537092,0.00015773682],"domain_scores_gemma":[0.98494846,0.01096328,0.0009806107,0.0014920428,0.0010588227,0.0005567264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005579023,0.0006513151,0.001002234,0.0013094773,0.0009870083,0.003063188,0.0022652876,0.0015472008,0.0044040754],"category_scores_gemma":[0.05277132,0.00059925875,0.0005604273,0.0010626192,0.0017278477,0.008428226,0.002476405,0.0035942257,0.0005876379],"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.00040339405,0.00031351726,0.0142298,0.00034598325,0.00012269874,0.00042033996,0.0020615626,0.39511085,0.002931596,0.20766294,0.004485318,0.37191194],"study_design_scores_gemma":[0.00002376742,0.00006662039,0.00088718743,0.000101104015,0.000027095195,0.000057859495,0.00019742153,0.74175847,0.0021742263,0.25051838,0.004151335,0.00003654795],"about_ca_topic_score_codex":0.0071477215,"about_ca_topic_score_gemma":0.009136514,"teacher_disagreement_score":0.0071477215,"about_ca_system_score_codex":0.001641572,"about_ca_system_score_gemma":0.0029893736,"threshold_uncertainty_score":0.029505074},"labels":[],"label_agreement":null},{"id":"W4393159809","doi":"10.1609/aaai.v38i10.28970","title":"Contextual Pre-planning on Reward Machine Abstractions for Enhanced Transfer in Deep Reinforcement Learning","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Reinforcement learning; Computer science; Reinforcement; Artificial intelligence; Transfer of learning; Cognitive psychology; Machine learning; Psychology; Social psychology","score_opus":0.06539929613530107,"score_gpt":0.3236612521517399,"score_spread":0.25826195601643887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393159809","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.07160936,0.00024845547,0.92469925,0.00029127309,0.000040193365,0.000059304522,0.000070394366,0.0013113372,0.0016704574],"genre_scores_gemma":[0.92444396,0.00010291487,0.07359917,0.00010355096,0.000018829278,0.000116516785,0.00009991446,0.00007900817,0.0014360793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996177,0.00014540686,0.000019399436,0.00008865491,0.000069894115,0.0000588063],"domain_scores_gemma":[0.9983728,0.0010324921,0.00015027192,0.0002309935,0.000107852466,0.000105495434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010456064,0.0007436522,0.00074487925,0.0002718035,0.00030711995,0.0006107449,0.0011285665,0.0007602126,0.0025340575],"category_scores_gemma":[0.004879512,0.00042061973,0.00037562707,0.00027224104,0.0011258379,0.0014885234,0.0016025619,0.0020098917,0.00033984517],"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.000116296156,0.00010322752,0.00063566194,0.000053527077,0.000021159904,0.00006029937,0.00010340389,0.928771,0.002459962,0.012360986,0.0008023371,0.05451202],"study_design_scores_gemma":[0.000007910686,0.000029729435,0.000049144597,0.0000039160886,0.0000025416286,0.000004424575,0.000004601676,0.9910693,0.0005283452,0.008136575,0.00016057717,0.0000028224074],"about_ca_topic_score_codex":0.00306074,"about_ca_topic_score_gemma":0.0036897191,"teacher_disagreement_score":0.00306074,"about_ca_system_score_codex":0.0009782019,"about_ca_system_score_gemma":0.0012166,"threshold_uncertainty_score":0.008477271},"labels":[],"label_agreement":null},{"id":"W4393159942","doi":"10.1609/aaai.v38i11.29095","title":"QLABGrad: A Hyperparameter-Free and Convergence-Guaranteed Scheme for Deep Learning","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hyperparameter; Convergence (economics); Scheme (mathematics); Artificial intelligence; Computer science; Deep learning; Machine learning; Psychology; Mathematics; Economics","score_opus":0.0590356522462624,"score_gpt":0.29280082859496703,"score_spread":0.23376517634870464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393159942","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.003770632,0.00022595997,0.9922335,0.000186706,0.00006722564,0.00011775614,0.000044418095,0.0023229746,0.0010308124],"genre_scores_gemma":[0.20310673,0.00042674676,0.7882724,0.00081537553,0.00012713912,0.0007910394,0.00033642378,0.0017551415,0.004369041],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978903,0.0007582362,0.00018569827,0.00033651022,0.0006910667,0.00013828908],"domain_scores_gemma":[0.9963313,0.0013355467,0.00040402278,0.0008592946,0.00082066277,0.00024917795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006006829,0.0017002958,0.0013830062,0.001132001,0.0008881416,0.0015886705,0.0043219994,0.0028699017,0.004142941],"category_scores_gemma":[0.020167086,0.0010037902,0.000981537,0.0008718034,0.0022258817,0.0038856927,0.005234733,0.005730578,0.0025701027],"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.0006349937,0.00034140376,0.0024408395,0.0004400474,0.00015196235,0.00023257236,0.0005029081,0.49196833,0.016414484,0.07759841,0.015997764,0.39327633],"study_design_scores_gemma":[0.000063744184,0.000059951602,0.00010409472,0.000036375008,0.000010243264,0.000049256563,0.000011924272,0.9796951,0.003198523,0.014189308,0.0025586681,0.000022766197],"about_ca_topic_score_codex":0.0027671116,"about_ca_topic_score_gemma":0.0039401036,"teacher_disagreement_score":0.006006829,"about_ca_system_score_codex":0.0016660945,"about_ca_system_score_gemma":0.002857478,"threshold_uncertainty_score":0.031767488},"labels":[],"label_agreement":null},{"id":"W4393159963","doi":"10.1609/aaai.v38i11.29143","title":"A Sequentially Fair Mechanism for Multiple Sensitive Attributes","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada","keywords":"Mechanism (biology); Computer science; Epistemology; Philosophy","score_opus":0.26281526326130256,"score_gpt":0.4008321003431169,"score_spread":0.13801683708181434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393159963","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.0138462195,0.00007454211,0.98403674,0.00033560174,0.000051760366,0.000119893506,0.000054179305,0.00022240031,0.0012587406],"genre_scores_gemma":[0.70562804,0.000112728914,0.28828838,0.00033550133,0.00015601622,0.0003950566,0.000114521274,0.0001005558,0.0048691556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9857019,0.0071546324,0.000596852,0.0030434849,0.002430628,0.0010725677],"domain_scores_gemma":[0.97618085,0.013201623,0.0020259917,0.005470152,0.0020842622,0.0010370895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022310771,0.0012221227,0.001809869,0.001306027,0.0016121998,0.0034800195,0.0039238334,0.0020951033,0.005975451],"category_scores_gemma":[0.051402353,0.0006672035,0.0011163008,0.0012535045,0.0033133768,0.0068187215,0.004616121,0.0038340294,0.000820188],"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.0006792096,0.00030879246,0.005130763,0.00014920426,0.00017751104,0.00025102016,0.0009788849,0.25857854,0.0053689647,0.54728097,0.0039250692,0.17717111],"study_design_scores_gemma":[0.00006191846,0.00020267461,0.0007229022,0.000036001962,0.000044206754,0.00010516735,0.00008262643,0.654073,0.0025404757,0.33952314,0.0025449132,0.00006305881],"about_ca_topic_score_codex":0.0016817838,"about_ca_topic_score_gemma":0.0017811032,"teacher_disagreement_score":0.022310771,"about_ca_system_score_codex":0.0019560652,"about_ca_system_score_gemma":0.004404853,"threshold_uncertainty_score":0.1179921},"labels":[],"label_agreement":null},{"id":"W4393159976","doi":"10.1609/aaai.v38i7.28489","title":"STDiff: Spatio-Temporal Diffusion for Continuous Stochastic Video Prediction","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Image and Signal Denoising Methods","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":"Polytechnique Montréal","funders":"","keywords":"Diffusion; Computer science; Statistical physics; Physics","score_opus":0.06250447505530482,"score_gpt":0.3110464666237577,"score_spread":0.24854199156845286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393159976","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.004860425,0.00015041775,0.9922599,0.00014875822,0.00004223354,0.000025077632,0.00018026646,0.0018384997,0.0004943486],"genre_scores_gemma":[0.4375943,0.0006643506,0.5535456,0.00021567142,0.00010748365,0.00026918494,0.0015065392,0.00074227544,0.0053546275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961495,0.00007264893,0.000027822913,0.00010767281,0.00014425,0.00003261554],"domain_scores_gemma":[0.9990244,0.00053835346,0.000096629585,0.000118298565,0.00016226762,0.000060069375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013009184,0.00078263064,0.00084566354,0.0005956017,0.0003184428,0.00072892965,0.0017541653,0.0012359729,0.0028055909],"category_scores_gemma":[0.004929464,0.00048438204,0.00076206727,0.0006095202,0.00062071864,0.0012899553,0.0012604082,0.001826096,0.0007990756],"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.00019183138,0.000065387205,0.0015199574,0.0001046076,0.00006541153,0.00012808348,0.00007265061,0.8096096,0.006398946,0.04437008,0.006396954,0.13107648],"study_design_scores_gemma":[0.0000031858663,0.0000033285414,0.000031669293,0.0000018125947,0.0000012520526,0.000007064979,0.0000010137468,0.99649256,0.0003555669,0.0028271617,0.00027336448,0.0000019980305],"about_ca_topic_score_codex":0.011657938,"about_ca_topic_score_gemma":0.008466645,"teacher_disagreement_score":0.011657938,"about_ca_system_score_codex":0.0010616189,"about_ca_system_score_gemma":0.0010826982,"threshold_uncertainty_score":0.023180187},"labels":[],"label_agreement":null},{"id":"W4393160136","doi":"10.1609/aaai.v38i12.29215","title":"Stitching Sub-trajectories with Conditional Diffusion Model for Goal-Conditioned Offline RL","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Robotic Path Planning Algorithms","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":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; Korea Advanced Institute of Science and Technology","keywords":"Image stitching; Diffusion; Computer science; Applied mathematics; Artificial intelligence; Econometrics; Statistical physics; Mathematics; Physics; Thermodynamics","score_opus":0.06110543382956793,"score_gpt":0.2972952787388138,"score_spread":0.23618984490924586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393160136","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.014740119,0.00018343997,0.98230976,0.00015674822,0.000027018305,0.00005006669,0.00008664455,0.0013023501,0.0011438464],"genre_scores_gemma":[0.71154517,0.0002217345,0.28306758,0.00026006642,0.00003263294,0.00027751343,0.00053550483,0.00042108085,0.003638758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995435,0.00009842477,0.000027788681,0.00014226386,0.00013115839,0.000056875837],"domain_scores_gemma":[0.9983535,0.0010422593,0.00015293118,0.0001895024,0.00015636254,0.00010544149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095504057,0.0010578018,0.0011079119,0.0004611153,0.00032265915,0.00061555486,0.001548464,0.0010073795,0.0028836012],"category_scores_gemma":[0.0041581923,0.0005838689,0.0007257492,0.0004523786,0.0009945555,0.0013193142,0.0015292205,0.0024906357,0.00045778786],"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.000056954104,0.000034632285,0.000429315,0.000050779126,0.000021500147,0.00004383237,0.000056022152,0.9507288,0.0018313064,0.0046830233,0.00079629954,0.04126758],"study_design_scores_gemma":[0.000004592388,0.000010109995,0.00002489967,0.0000024600886,0.0000015413057,0.0000051449915,0.0000022808083,0.99792373,0.0003172998,0.0015588935,0.00014674249,0.0000023503987],"about_ca_topic_score_codex":0.00872255,"about_ca_topic_score_gemma":0.009752719,"teacher_disagreement_score":0.00872255,"about_ca_system_score_codex":0.00094950834,"about_ca_system_score_gemma":0.0018662323,"threshold_uncertainty_score":0.017343521},"labels":[],"label_agreement":null},{"id":"W4393160153","doi":"10.1609/aaai.v38i16.29800","title":"On Unsupervised Domain Adaptation: Pseudo Label Guided Mixup for Adversarial Prompt Tuning","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Anomaly Detection Techniques and Applications","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 Ottawa","funders":"Fundamental Research Funds for the Central Universities; State Key Laboratory of Software Development Environment; National Natural Science Foundation of China","keywords":"Adversarial system; Adaptation (eye); Domain adaptation; Computer science; Artificial intelligence; Domain (mathematical analysis); Machine learning; Psychology; Neuroscience; Mathematics","score_opus":0.10762809480916702,"score_gpt":0.3235439369031405,"score_spread":0.21591584209397346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393160153","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.012885124,0.00018376812,0.9840792,0.00017518328,0.00005049466,0.000068665526,0.000034657605,0.0011013102,0.0014216388],"genre_scores_gemma":[0.6823437,0.00021071288,0.3093741,0.0008616772,0.00012729535,0.00036137045,0.00029119418,0.00050755317,0.005922374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981123,0.00077614526,0.00006374206,0.0004889729,0.00038475092,0.00017395949],"domain_scores_gemma":[0.9968907,0.0015562837,0.00023549827,0.0007825434,0.00035470238,0.00018022492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027145725,0.0012546488,0.0011415401,0.00065624557,0.00076171913,0.0011329639,0.0020407285,0.0015090457,0.0023472],"category_scores_gemma":[0.0075870687,0.0004863115,0.00075138226,0.0006382241,0.0021152264,0.0028270695,0.0040911227,0.0031274045,0.0010091243],"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.00046452502,0.00031810784,0.002581743,0.00013142996,0.000111779445,0.00019539594,0.0003463476,0.656336,0.026681889,0.03941958,0.006082307,0.2673309],"study_design_scores_gemma":[0.000015840249,0.00006834766,0.00015820794,0.0000093698145,0.0000075833786,0.00005816106,0.000022326189,0.98057884,0.0037881765,0.013772415,0.0015042954,0.000016387332],"about_ca_topic_score_codex":0.000923602,"about_ca_topic_score_gemma":0.001215455,"teacher_disagreement_score":0.0027145725,"about_ca_system_score_codex":0.00073991274,"about_ca_system_score_gemma":0.00095472584,"threshold_uncertainty_score":0.014356196},"labels":[],"label_agreement":null},{"id":"W4393160207","doi":"10.1609/aaai.v38i15.29562","title":"Federated Partial Label Learning with Local-Adaptive Augmentation and Regularization","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Text and Document Classification Technologies","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":"Canadian Institute for Advanced Research; Carleton University","funders":"","keywords":"Regularization (linguistics); Computer science; Artificial intelligence","score_opus":0.06017459565364345,"score_gpt":0.2866706267842369,"score_spread":0.22649603113059344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393160207","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.012879307,0.000118830125,0.9837489,0.00021228332,0.000029797051,0.00004951716,0.00008590259,0.0021160722,0.0007593456],"genre_scores_gemma":[0.5213465,0.00012786509,0.4713597,0.000560092,0.000100498466,0.00032374208,0.00082806265,0.00044110705,0.0049124532],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968929,0.0010766041,0.00011952426,0.001015931,0.00067485985,0.00022006239],"domain_scores_gemma":[0.99518,0.0014339988,0.00035277815,0.002119518,0.00071483816,0.00019873239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030327835,0.0012077838,0.0018665238,0.00073947327,0.0011400861,0.0018428699,0.0037209906,0.0019278381,0.0023566016],"category_scores_gemma":[0.007944854,0.0006011672,0.0010759998,0.0013871177,0.0020031035,0.004953873,0.0046717566,0.0030980587,0.0013259737],"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.0006575271,0.00047345678,0.0031736467,0.00020434265,0.00011851928,0.00027283872,0.00058545684,0.44541103,0.015765287,0.030436298,0.011368562,0.4915331],"study_design_scores_gemma":[0.000021547827,0.00004237893,0.00011280481,0.000007326351,0.0000086142945,0.00004813551,0.00003552673,0.9804028,0.0032294225,0.014857455,0.00122027,0.0000137173765],"about_ca_topic_score_codex":0.0027295505,"about_ca_topic_score_gemma":0.0055110687,"teacher_disagreement_score":0.0037209906,"about_ca_system_score_codex":0.0012725155,"about_ca_system_score_gemma":0.002175818,"threshold_uncertainty_score":0.016039133},"labels":[],"label_agreement":null},{"id":"W4393160289","doi":"10.1609/aaai.v38i15.29558","title":"Multiobjective Lipschitz Bandits under Lexicographic Ordering","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","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 Waterloo","funders":"National Natural Science Foundation of China; City University of Hong Kong","keywords":"Lexicographical order; Lipschitz continuity; Mathematics; Mathematical economics; Mathematical optimization; Applied mathematics; Combinatorics; Pure mathematics","score_opus":0.2554005872919155,"score_gpt":0.44457654767578736,"score_spread":0.18917596038387186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393160289","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.03527399,0.0004060966,0.9582959,0.00038789163,0.0000348704,0.00012210914,0.00008454511,0.00035450436,0.0050401087],"genre_scores_gemma":[0.5850222,0.00049620523,0.40531284,0.0003797777,0.00008871586,0.0003832275,0.0002912655,0.00013655798,0.007889116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854565,0.0007530681,0.00006714871,0.00017762808,0.00024615935,0.00021043624],"domain_scores_gemma":[0.99737996,0.0018698473,0.0002682721,0.00014985328,0.00018367167,0.00014838313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025754988,0.001217474,0.0018350002,0.0006891717,0.0006549359,0.0014484291,0.0012145633,0.0014376417,0.0032589685],"category_scores_gemma":[0.0057470305,0.000569746,0.00070782244,0.00097110687,0.0010993509,0.002048656,0.0013425837,0.0020302015,0.0007439357],"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.00025551248,0.00013038967,0.00080128724,0.00011625634,0.000045381767,0.00009238116,0.00009153942,0.90423024,0.0010923243,0.042196345,0.0016249566,0.049323346],"study_design_scores_gemma":[0.00002972817,0.00004910208,0.000070131326,0.0000123549125,0.000005984271,0.000014904049,0.000013870524,0.98363566,0.00047927297,0.015388387,0.00029496444,0.0000055754435],"about_ca_topic_score_codex":0.003266673,"about_ca_topic_score_gemma":0.0031596692,"teacher_disagreement_score":0.003266673,"about_ca_system_score_codex":0.0014027728,"about_ca_system_score_gemma":0.0016213276,"threshold_uncertainty_score":0.013620734},"labels":[],"label_agreement":null},{"id":"W4393160465","doi":"10.1609/aaai.v38i16.29736","title":"Talk Funny! A Large-Scale Humor Response Dataset with Chain-of-Humor Interpretation","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Video Analysis and Summarization","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":"Université de Montréal","funders":"Science and Technology Commission of Shanghai Municipality; National Natural Science Foundation of China","keywords":"Interpretation (philosophy); Humor research; Scale (ratio); Psychology; Cognitive psychology; Philosophy; Social psychology; Linguistics; Geography; Cartography","score_opus":0.03418745627289088,"score_gpt":0.28866807901994296,"score_spread":0.2544806227470521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393160465","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27098697,0.0028520685,0.023530114,0.0024311817,0.0010646643,0.0016258818,0.64096135,0.018797962,0.037749767],"genre_scores_gemma":[0.1789035,0.0005183792,0.031625953,0.0007956592,0.00020349839,0.0015626879,0.7634001,0.00057141343,0.022418825],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991731,0.00027690083,0.000073095616,0.00018189255,0.00020841458,0.00008655238],"domain_scores_gemma":[0.99823594,0.0005856037,0.00011526521,0.0003963608,0.00045697443,0.00020976455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007696611,0.0012498236,0.0004002408,0.0014353476,0.0011460411,0.0005282704,0.0011776626,0.0015473467,0.008435833],"category_scores_gemma":[0.003688948,0.00016658907,0.0004879257,0.0010637242,0.0005413066,0.0008518906,0.0014305825,0.0011130213,0.0059697805],"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.001380022,0.00070459896,0.016094605,0.0032216911,0.00016708726,0.0014823298,0.0038145115,0.0029958638,0.026798276,0.0035020069,0.7694027,0.17043619],"study_design_scores_gemma":[0.00038523154,0.0004568074,0.087850265,0.00040799304,0.000107948734,0.0012492292,0.004388598,0.033668667,0.027950604,0.003039045,0.84022886,0.00026668768],"about_ca_topic_score_codex":0.008094587,"about_ca_topic_score_gemma":0.024823051,"teacher_disagreement_score":0.008435833,"about_ca_system_score_codex":0.0006418488,"about_ca_system_score_gemma":0.00088513875,"threshold_uncertainty_score":0.028220713},"labels":[],"label_agreement":null},{"id":"W4393160523","doi":"10.1609/aaai.v38i15.29604","title":"Generalizing across Temporal Domains with Koopman Operators","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Vector Institute; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics","score_opus":0.06073821942802012,"score_gpt":0.31625360553578663,"score_spread":0.25551538610776653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393160523","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.024065211,0.00023296202,0.973519,0.00029776865,0.000018648221,0.00004147398,0.00007223354,0.00018811008,0.0015647006],"genre_scores_gemma":[0.7432643,0.00094179704,0.25017565,0.00045431036,0.00009865703,0.0003365742,0.0005336976,0.00023548865,0.003959619],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895525,0.00036325015,0.000070084396,0.00028034774,0.00024115088,0.00008979675],"domain_scores_gemma":[0.9961618,0.0023871004,0.0004719075,0.0005494579,0.0003165955,0.000113080736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003766013,0.0010113554,0.00079071056,0.0010083013,0.00054143614,0.0011310811,0.0018212984,0.0011637338,0.0013359344],"category_scores_gemma":[0.009673153,0.0005208138,0.0015398397,0.0010233906,0.0017081258,0.004710735,0.0028772932,0.0032925664,0.00031715544],"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.000048328133,0.000038873543,0.0013602695,0.000075461525,0.00007149543,0.00012296719,0.00018591358,0.81871027,0.00243409,0.13560097,0.001003238,0.040348105],"study_design_scores_gemma":[0.0000024884657,0.00001460402,0.0001298436,0.000006302424,0.0000063435727,0.000019913756,0.000013723735,0.93860245,0.00032919567,0.06052647,0.00034228564,0.000006455254],"about_ca_topic_score_codex":0.0063781287,"about_ca_topic_score_gemma":0.005264015,"teacher_disagreement_score":0.0063781287,"about_ca_system_score_codex":0.001499146,"about_ca_system_score_gemma":0.0013352425,"threshold_uncertainty_score":0.019916832},"labels":[],"label_agreement":null},{"id":"W4393160540","doi":"10.1609/aaai.v38i15.29571","title":"A Transfer Approach Using Graph Neural Networks in Deep Reinforcement Learning","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Research in Systems and Signal Processing","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; University of Alberta; Alberta Machine Intelligence Institute; Compute Canada; National Natural Science Foundation of China; Canadian Institute for Advanced Research","keywords":"Reinforcement learning; Computer science; Transfer of learning; Artificial intelligence; Graph; Artificial neural network; Reinforcement; Theoretical computer science; Psychology; Social psychology","score_opus":0.07550551617635658,"score_gpt":0.2994715040283441,"score_spread":0.2239659878519875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393160540","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.014618601,0.0002949291,0.98207814,0.00024986666,0.000063530955,0.000048043523,0.000035885885,0.00076720526,0.0018438001],"genre_scores_gemma":[0.8536892,0.00030462554,0.14148751,0.0003190403,0.00006234944,0.00018856293,0.00015152933,0.00014057754,0.0036565438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962294,0.00012892518,0.000018660856,0.00010140407,0.00008313523,0.000044861612],"domain_scores_gemma":[0.99929225,0.0003844917,0.00007252643,0.00009414376,0.00010901066,0.000047563677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095668074,0.0010052985,0.00081067736,0.0005026097,0.0003262205,0.0005678943,0.0015386011,0.001140995,0.002131653],"category_scores_gemma":[0.0027838158,0.00037399595,0.0005702168,0.0005306724,0.00093442516,0.0015653037,0.0014951954,0.0018347909,0.00035200932],"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.000053498632,0.00008207353,0.00043259095,0.000059421698,0.000051124316,0.00006836246,0.000050660277,0.89185965,0.0020587633,0.012616808,0.0013643731,0.0913027],"study_design_scores_gemma":[0.000004024313,0.000019524377,0.000030196257,0.0000025940435,0.0000037289622,0.000006637477,0.000002772459,0.993061,0.0002844886,0.0063738287,0.00020817124,0.0000029327273],"about_ca_topic_score_codex":0.004340962,"about_ca_topic_score_gemma":0.0041217054,"teacher_disagreement_score":0.004340962,"about_ca_system_score_codex":0.0009189646,"about_ca_system_score_gemma":0.0009551761,"threshold_uncertainty_score":0.008631408},"labels":[],"label_agreement":null},{"id":"W4393160543","doi":"10.1609/aaai.v38i16.29707","title":"Large-Scale Multi-Robot Coverage Path Planning via Local Search","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scale (ratio); Motion planning; Computer science; Path (computing); Robot; Artificial intelligence; Geography; Cartography; Computer network","score_opus":0.08629451453765642,"score_gpt":0.32782028875780855,"score_spread":0.24152577422015215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393160543","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.037711304,0.0004924296,0.95643467,0.0001996002,0.000026458607,0.000083830186,0.00011153054,0.0016316362,0.0033086846],"genre_scores_gemma":[0.6473698,0.00034074887,0.3494205,0.00012651696,0.000026347469,0.00025663702,0.00036776598,0.00024397494,0.0018477539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966073,0.00007652014,0.000010802121,0.00010710912,0.000093681134,0.000051098094],"domain_scores_gemma":[0.99954647,0.00023817015,0.000057624373,0.00006182682,0.00005795814,0.000037927428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038610044,0.0009638536,0.0008454005,0.00047532862,0.00053375796,0.00063614786,0.0014348221,0.00081933575,0.0019251764],"category_scores_gemma":[0.0012379144,0.00043783913,0.00069875893,0.0007670142,0.0007003549,0.001071372,0.0012200547,0.0009406399,0.00041071855],"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.000041155767,0.00003138535,0.00035538716,0.00007614231,0.000024924577,0.00007095803,0.000047176003,0.96156496,0.0025427153,0.0030343046,0.0010732033,0.031137686],"study_design_scores_gemma":[0.000007905083,0.000027873088,0.000068633904,0.0000033007072,0.0000054110974,0.00001616844,0.0000144339965,0.99681735,0.00058363075,0.0019965959,0.0004551524,0.0000034137322],"about_ca_topic_score_codex":0.0072260355,"about_ca_topic_score_gemma":0.008312649,"teacher_disagreement_score":0.0072260355,"about_ca_system_score_codex":0.0007367581,"about_ca_system_score_gemma":0.001160989,"threshold_uncertainty_score":0.014367998},"labels":[],"label_agreement":null},{"id":"W4393160582","doi":"10.1609/aaai.v38i14.29527","title":"Test-Time Domain Adaptation by Learning Domain-Aware Batch Normalization","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Toronto","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada","keywords":"Domain adaptation; Normalization (sociology); Computer science; Adaptation (eye); Artificial intelligence; Time domain; Test (biology); Machine learning; Psychology; Biology; Neuroscience; Computer vision","score_opus":0.030661189123474517,"score_gpt":0.25976278337477976,"score_spread":0.22910159425130525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393160582","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.023526248,0.00045515224,0.96333516,0.00021259372,0.00018980436,0.00012882268,0.00031629973,0.009308472,0.0025274917],"genre_scores_gemma":[0.45746133,0.000471259,0.5214952,0.001078215,0.00027073716,0.00044557988,0.0041274973,0.0020662101,0.012583916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909496,0.00015591069,0.000039101542,0.00044027134,0.00016539801,0.00010440281],"domain_scores_gemma":[0.9983311,0.0003996402,0.00012951436,0.00056601444,0.00045853245,0.00011524915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014460752,0.0021244627,0.0015826005,0.0009692338,0.00057549827,0.0011577812,0.0033132413,0.0015526599,0.0039039706],"category_scores_gemma":[0.004700453,0.0006877515,0.0015215043,0.0010422092,0.0011653817,0.002770503,0.0019381294,0.0032559636,0.0036075602],"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.0005153857,0.00036644665,0.0035618038,0.00017455843,0.00018237444,0.0002070258,0.00020607062,0.2705147,0.03515228,0.0061817775,0.020303594,0.66263396],"study_design_scores_gemma":[0.000025882675,0.000040542083,0.00052262883,0.000010674059,0.000024957608,0.00006111592,0.000032626845,0.9819317,0.008894244,0.006047552,0.0023854973,0.000022720456],"about_ca_topic_score_codex":0.0074655353,"about_ca_topic_score_gemma":0.008942564,"teacher_disagreement_score":0.0074655353,"about_ca_system_score_codex":0.0012891146,"about_ca_system_score_gemma":0.0015293384,"threshold_uncertainty_score":0.014844179},"labels":[],"label_agreement":null},{"id":"W4393160711","doi":"10.1609/aaai.v38i20.30591","title":"Program Synthesis with Best-First Bottom-Up Search (Abstract Reprint)","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Parallel Computing and Optimization Techniques","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":"Reprint; Computer science; Physics","score_opus":0.08172566426243245,"score_gpt":0.32681051038839154,"score_spread":0.2450848461259591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393160711","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.019641666,0.0004000564,0.9641811,0.00023153664,0.00008132585,0.0001073618,0.0002720963,0.004125037,0.010959815],"genre_scores_gemma":[0.24213931,0.00027082278,0.7487485,0.0002389808,0.000022685892,0.00024989713,0.00061831565,0.0009992751,0.0067122076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971753,0.00006174347,0.000018845787,0.000053883818,0.000107351734,0.000040564362],"domain_scores_gemma":[0.9995146,0.00021270024,0.000036210506,0.00012449862,0.00009234568,0.000019630093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035826123,0.00091710204,0.0005049038,0.0007017446,0.0003952171,0.0009072748,0.0007971442,0.0007316536,0.009421165],"category_scores_gemma":[0.0014125193,0.00040015858,0.0007156136,0.0007406852,0.0006281168,0.0008705391,0.00089069374,0.0010313203,0.0014795954],"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.0002017843,0.00012237397,0.00074074103,0.00032872017,0.000060451264,0.00015522468,0.00009716834,0.4871035,0.025194084,0.04155797,0.0104506295,0.43398738],"study_design_scores_gemma":[0.00003558135,0.000075710734,0.00013275363,0.000024506651,0.000024373843,0.00005233907,0.000020234877,0.9578991,0.009307905,0.024400119,0.008014425,0.000012927763],"about_ca_topic_score_codex":0.0026792446,"about_ca_topic_score_gemma":0.0042885807,"teacher_disagreement_score":0.009421165,"about_ca_system_score_codex":0.0006924813,"about_ca_system_score_gemma":0.001150831,"threshold_uncertainty_score":0.03151697},"labels":[],"label_agreement":null},{"id":"W4393160714","doi":"10.1609/aaai.v38i18.29994","title":"Monte Carlo Tree Search in the Presence of Transition Uncertainty","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Modeling, Simulation, and Optimization","field":"Mathematics","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":"Huawei Technologies (Canada); University of Alberta","funders":"","keywords":"Monte Carlo method; Statistical physics; Monte Carlo tree search; Tree (set theory); Transition (genetics); Computer science; Mathematics; Physics; Statistics; Chemistry; Combinatorics","score_opus":0.15774185105240604,"score_gpt":0.35920839778182717,"score_spread":0.20146654672942113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393160714","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.1052787,0.0007309485,0.8888373,0.0006789683,0.000056925513,0.00008938404,0.00018436341,0.000804768,0.0033386783],"genre_scores_gemma":[0.83950865,0.00020048008,0.15829721,0.0002185033,0.000044668017,0.00013006554,0.00028001316,0.00013355617,0.0011867917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979438,0.001091229,0.00010018991,0.00028172287,0.00036895563,0.0002140957],"domain_scores_gemma":[0.98782545,0.010128332,0.0005586061,0.00068760006,0.00052428216,0.00027572326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037214682,0.00076460565,0.0016117248,0.00071987143,0.0005419235,0.0010877345,0.0013588448,0.0013276461,0.0013078862],"category_scores_gemma":[0.017316023,0.0006035497,0.00074263377,0.0010276384,0.0013649454,0.0016610713,0.0014215377,0.0016924936,0.00019857423],"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.000069930386,0.000017033548,0.00055387407,0.000021527125,0.000019109153,0.00003483693,0.000019929017,0.984797,0.00020566487,0.007249217,0.00033947197,0.006672397],"study_design_scores_gemma":[0.000006534075,0.000007940113,0.00004864438,0.000002636362,0.0000027265653,0.0000063559078,0.0000019926113,0.9955095,0.00008934145,0.0042347494,0.00008800249,0.0000016457357],"about_ca_topic_score_codex":0.009961767,"about_ca_topic_score_gemma":0.007756145,"teacher_disagreement_score":0.009961767,"about_ca_system_score_codex":0.0013963432,"about_ca_system_score_gemma":0.0021661557,"threshold_uncertainty_score":0.019807518},"labels":[],"label_agreement":null},{"id":"W4393160751","doi":"10.1609/aaai.v38i18.30062","title":"Parallel Beam Search Algorithms for Domain-Independent Dynamic Programming","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dynamic programming; Computer science; Domain (mathematical analysis); Algorithm; Parallel computing; Mathematics","score_opus":0.07861063744368464,"score_gpt":0.33554137191464556,"score_spread":0.25693073447096093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393160751","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.003269799,0.00020432229,0.99311876,0.00012424203,0.000037297745,0.000047793023,0.000060676168,0.0006908625,0.002446129],"genre_scores_gemma":[0.120892905,0.00033603248,0.87406397,0.00027209264,0.000055643715,0.0005458795,0.0003409722,0.00043158518,0.0030609765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988562,0.00040152908,0.00006630998,0.00021389572,0.0002996255,0.00016245876],"domain_scores_gemma":[0.99824595,0.0010209361,0.00011387708,0.00023437366,0.00031015373,0.000074793534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002204216,0.0012644443,0.0014118219,0.0010567941,0.00087043,0.0014308385,0.002024596,0.001359553,0.00700154],"category_scores_gemma":[0.0044819163,0.0008718013,0.0013284499,0.0017206135,0.0010463394,0.0020541511,0.0021689609,0.00227054,0.0013834658],"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.00016965164,0.00012569432,0.00066605257,0.00015068911,0.00011937622,0.00006316547,0.00011209654,0.7653571,0.0020383957,0.080914915,0.00857579,0.14170712],"study_design_scores_gemma":[0.00004334516,0.000016465277,0.000033629323,0.000007448717,0.000008004952,0.000010572849,0.00000967093,0.9768059,0.0004986669,0.020749923,0.0018099358,0.000006352381],"about_ca_topic_score_codex":0.0048140204,"about_ca_topic_score_gemma":0.006053125,"teacher_disagreement_score":0.00700154,"about_ca_system_score_codex":0.0011276916,"about_ca_system_score_gemma":0.0024339096,"threshold_uncertainty_score":0.02342254},"labels":[],"label_agreement":null},{"id":"W4393160778","doi":"10.1609/aaai.v38i16.29742","title":"Unsupervised Layer-Wise Score Aggregation for Textual OOD Detection","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Anomaly Detection Techniques and Applications","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":"Canadian Institute for Advanced Research; McGill University; Mila - Quebec Artificial Intelligence Institute","funders":"Grand Équipement National De Calcul Intensif","keywords":"Anomaly detection; Mahalanobis distance; Computer science; Oracle; Robustness (evolution); Encoder; Leverage (statistics); Layer (electronics); Artificial intelligence; Discriminator; Embedding; Benchmark (surveying); Data mining; Machine learning; Detector; Pattern recognition (psychology)","score_opus":0.08825742206946548,"score_gpt":0.30917179030660924,"score_spread":0.22091436823714378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393160778","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.24845628,0.0013768908,0.72402817,0.00039550159,0.0002070293,0.00023791776,0.0012769451,0.021151176,0.0028700044],"genre_scores_gemma":[0.753173,0.00018872299,0.23947793,0.00014292327,0.000112388,0.000116732364,0.0028791036,0.00045468577,0.003454504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794537,0.00040189625,0.00018241105,0.0004870106,0.000699736,0.00028357704],"domain_scores_gemma":[0.9953252,0.0015267472,0.00064910087,0.0009520224,0.0012958893,0.00025099688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024314297,0.0017090744,0.0014372864,0.0026150257,0.00051436573,0.0013381656,0.0019512781,0.0010330038,0.0014157614],"category_scores_gemma":[0.008455924,0.00034955738,0.00086340716,0.001654139,0.00058207085,0.0018020339,0.0020872739,0.0013910851,0.0010361982],"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.00086948124,0.0005035277,0.020479865,0.00020625102,0.0002916622,0.00021075869,0.00018734239,0.06987698,0.036679626,0.0016777609,0.007675004,0.8613417],"study_design_scores_gemma":[0.000029806706,0.00017126113,0.006079467,0.000013296332,0.00006207585,0.00011320058,0.000059902948,0.9570385,0.031095736,0.0035606558,0.001739095,0.000036983143],"about_ca_topic_score_codex":0.0050794347,"about_ca_topic_score_gemma":0.008657125,"teacher_disagreement_score":0.0050794347,"about_ca_system_score_codex":0.00090765045,"about_ca_system_score_gemma":0.0009776377,"threshold_uncertainty_score":0.012858748},"labels":[],"label_agreement":null},{"id":"W4393160790","doi":"10.1609/aaai.v38i20.30227","title":"AutoLTS: Automating Cycling Stress Assessment via Contrastive Learning and Spatial Post-processing","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Fire Detection and Safety Systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Canada; Canadian Institute for Advanced Research","keywords":"Cycling; Computer science; Stress (linguistics); Natural language processing; Artificial intelligence; Geography; Linguistics; Archaeology","score_opus":0.02082240897970628,"score_gpt":0.2772960067925049,"score_spread":0.2564735978127986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393160790","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.42269665,0.0012417658,0.5305351,0.00045221616,0.00037097107,0.00044125342,0.01131496,0.024523523,0.008423477],"genre_scores_gemma":[0.75106275,0.000350038,0.22669116,0.00029866988,0.000103251026,0.00027459554,0.01412674,0.00038788674,0.006704889],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976546,0.00002127854,0.000010187388,0.00011381551,0.000047547783,0.000041758452],"domain_scores_gemma":[0.99977356,0.00005291528,0.000025558304,0.00003377398,0.00008788915,0.000026436286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003461262,0.0011108177,0.0005739316,0.0012908119,0.00026452268,0.0005451623,0.0014879282,0.0006188113,0.002572753],"category_scores_gemma":[0.00089337927,0.00029256588,0.0005337068,0.00064705533,0.00028564726,0.0007452993,0.0011405444,0.0008369201,0.0014638243],"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.0006484194,0.0010068098,0.03858912,0.00029590726,0.00020591274,0.00025314174,0.00020954231,0.061691515,0.044581663,0.001009966,0.0259463,0.82556164],"study_design_scores_gemma":[0.00005574897,0.00024019912,0.024632236,0.00004252904,0.00005610664,0.00010006928,0.00013504876,0.9537603,0.01311214,0.0029090678,0.0049158875,0.000040657495],"about_ca_topic_score_codex":0.020424332,"about_ca_topic_score_gemma":0.06636254,"teacher_disagreement_score":0.020424332,"about_ca_system_score_codex":0.0005767761,"about_ca_system_score_gemma":0.0007140382,"threshold_uncertainty_score":0.04061091},"labels":[],"label_agreement":null},{"id":"W4393160844","doi":"10.1609/aaai.v38i20.30208","title":"Grey-Box Bayesian Optimization for Sensor Placement in Assisted Living Environments","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Context-Aware Activity Recognition Systems","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":"Bayesian probability; Bayesian optimization; Computer science; Artificial intelligence; Environmental science","score_opus":0.08024687492617955,"score_gpt":0.29948301705286773,"score_spread":0.21923614212668818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393160844","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.0110656945,0.00013325328,0.9875016,0.00012645245,0.00001172219,0.000037048263,0.000044855595,0.00037539474,0.0007038904],"genre_scores_gemma":[0.64414656,0.00023868642,0.35210207,0.00027087954,0.000038919254,0.00032751256,0.00034378745,0.0002691681,0.002262394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856156,0.0007294962,0.00005051099,0.00024904573,0.00029163834,0.00011778176],"domain_scores_gemma":[0.9957664,0.0033005956,0.0002627977,0.00016484808,0.00038498052,0.0001204018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030683647,0.0014374008,0.0021550304,0.0010360448,0.0005071222,0.0009898499,0.0017804117,0.0016729524,0.0025667825],"category_scores_gemma":[0.00949967,0.0012068483,0.0009951338,0.000987146,0.0016094614,0.0017216845,0.0016291381,0.0013847821,0.00062559225],"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.000043583488,0.000013258524,0.00021203079,0.000021775342,0.0000141665405,0.000019252517,0.000018537861,0.9893959,0.0004883147,0.0020831004,0.00022802861,0.0074620293],"study_design_scores_gemma":[0.0000053060558,0.000008171102,0.000045181238,0.0000028513352,0.0000015258285,0.000003355195,0.0000023301745,0.9980069,0.00016661808,0.0016993746,0.000055907123,0.0000024948727],"about_ca_topic_score_codex":0.010446209,"about_ca_topic_score_gemma":0.007119372,"teacher_disagreement_score":0.010446209,"about_ca_system_score_codex":0.0015363012,"about_ca_system_score_gemma":0.0016915471,"threshold_uncertainty_score":0.020770848},"labels":[],"label_agreement":null},{"id":"W4393160855","doi":"10.1609/aaai.v38i20.30190","title":"A Bayesian Spatial Model to Correct Under-Reporting in Urban Crowdsourcing","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institute for Advanced Research; National Science Foundation","keywords":"Crowdsourcing; Bayesian probability; Computer science; Data science; Bayesian inference; Econometrics; Geography; Artificial intelligence; Mathematics; World Wide Web","score_opus":0.0801160489789146,"score_gpt":0.309552394669152,"score_spread":0.2294363456902374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393160855","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.051217746,0.0004200337,0.9414907,0.001987318,0.00013941637,0.00018255586,0.00081647927,0.00065732934,0.0030883492],"genre_scores_gemma":[0.8634618,0.00042374895,0.12849043,0.000539309,0.00021484254,0.00037475582,0.0011586162,0.00016234032,0.0051742126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956664,0.0020820599,0.00021049648,0.001144474,0.0005599392,0.0003366375],"domain_scores_gemma":[0.9818071,0.013103393,0.0016390173,0.0015862267,0.0014813523,0.00038288557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010096294,0.0010269886,0.0018571331,0.0018088182,0.0011730432,0.0020288792,0.004588028,0.0023965496,0.0024242338],"category_scores_gemma":[0.034588438,0.001331547,0.0017082504,0.002399505,0.0022818833,0.003651024,0.0033008263,0.0025712056,0.0006879767],"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.0003044636,0.00012903524,0.012638172,0.00016794686,0.00017367149,0.00028513878,0.0011459717,0.8393946,0.001014096,0.07030896,0.0045988685,0.069838956],"study_design_scores_gemma":[0.000026286785,0.000018138893,0.0008122926,0.000022086897,0.000019452305,0.000024490999,0.00005693562,0.96592593,0.00017028682,0.031842884,0.0010613785,0.000019780526],"about_ca_topic_score_codex":0.048632707,"about_ca_topic_score_gemma":0.04099971,"teacher_disagreement_score":0.048632707,"about_ca_system_score_codex":0.0027254117,"about_ca_system_score_gemma":0.0026507932,"threshold_uncertainty_score":0.0966993},"labels":[],"label_agreement":null},{"id":"W4393160970","doi":"10.1609/aaai.v38i18.30040","title":"Bayesian Inference with Complex Knowledge Graph Evidence","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto","funders":"","keywords":"Inference; Computer science; Bayesian inference; Bayesian statistics; Graph; Bayesian probability; Artificial intelligence; Machine learning; Theoretical computer science","score_opus":0.1491436242663293,"score_gpt":0.344951512490777,"score_spread":0.1958078882244477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393160970","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.00413541,0.00030135468,0.9931987,0.00051651546,0.000021808562,0.000056957026,0.0004256032,0.0005101461,0.0008334487],"genre_scores_gemma":[0.34536386,0.0009732276,0.6470035,0.00082836254,0.00024821694,0.00032349644,0.0024264872,0.00026295183,0.0025699176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99386543,0.0024842818,0.00035404507,0.0015331161,0.0015030622,0.00026009648],"domain_scores_gemma":[0.9569372,0.036252573,0.001665777,0.0027291123,0.0019683698,0.00044704796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077537685,0.0012907229,0.0018658948,0.0039436608,0.0009508518,0.004890819,0.0043655313,0.0028829556,0.004749372],"category_scores_gemma":[0.05186849,0.0015603111,0.002882754,0.0034378571,0.0023091787,0.0074651996,0.004041788,0.0055291182,0.0009874814],"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.00024949486,0.00011840917,0.0035932777,0.0005226476,0.00033387425,0.00051819545,0.00057353725,0.611232,0.001382323,0.2108728,0.005709426,0.16489406],"study_design_scores_gemma":[0.000032880394,0.000017362527,0.00024497177,0.000061148574,0.000039974795,0.000068907415,0.000035986395,0.825563,0.00049746665,0.17122081,0.0021920819,0.000025404483],"about_ca_topic_score_codex":0.019332495,"about_ca_topic_score_gemma":0.024037087,"teacher_disagreement_score":0.019332495,"about_ca_system_score_codex":0.002914981,"about_ca_system_score_gemma":0.0032356817,"threshold_uncertainty_score":0.041006386},"labels":[],"label_agreement":null},{"id":"W4393161074","doi":"10.1609/aaai.v38i19.30101","title":"Solving Non-rectangular Reward-Robust MDPs via Frequency Regularization","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","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":"Université de Montréal","funders":"","keywords":"Regularization (linguistics); Computer science; Mathematical optimization; Mathematics; Applied mathematics; Artificial intelligence","score_opus":0.04416407608534164,"score_gpt":0.26345417520536557,"score_spread":0.21929009912002392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393161074","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.0412536,0.00017851217,0.95559263,0.00030673706,0.000025007696,0.000048956477,0.000042739997,0.00025605338,0.0022958268],"genre_scores_gemma":[0.87155163,0.00015751836,0.12532358,0.00018734047,0.00003491611,0.00018890345,0.00008910199,0.00011225703,0.002354737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999551,0.00017112705,0.00002156444,0.00010575055,0.00007317265,0.000077318735],"domain_scores_gemma":[0.9974722,0.002005162,0.00021662007,0.00010735167,0.00010991977,0.000088653986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014294581,0.0008671887,0.0010030665,0.00039753944,0.00037825023,0.00067217054,0.0008324307,0.0012830977,0.0015356037],"category_scores_gemma":[0.0048549054,0.0005832276,0.00067290926,0.00029429112,0.0011613757,0.00088955555,0.0014129101,0.0015169379,0.00017777803],"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.000025323912,0.000013165868,0.00020415871,0.00002088889,0.000012333276,0.000027766338,0.000020856525,0.9879556,0.00036201964,0.006920351,0.00019537522,0.0042422637],"study_design_scores_gemma":[0.000004508424,0.000009154123,0.000024752577,0.000002268708,0.0000018095483,0.0000040753216,0.0000035369212,0.9971106,0.00008674073,0.0026789685,0.00007177911,0.0000017583191],"about_ca_topic_score_codex":0.0065389737,"about_ca_topic_score_gemma":0.004472563,"teacher_disagreement_score":0.0065389737,"about_ca_system_score_codex":0.0010355652,"about_ca_system_score_gemma":0.0014942217,"threshold_uncertainty_score":0.013001859},"labels":[],"label_agreement":null},{"id":"W4393161100","doi":"10.1609/aaai.v38i19.30157","title":"Toward Robustness in Multi-Label Classification: A Data Augmentation Strategy against Imbalance and Noise","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Text and Document Classification Technologies","field":"Computer Science","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":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; National Research Foundation of Korea; National Research Foundation","keywords":"Robustness (evolution); Computer science; Artificial intelligence; Machine learning; Noise (video); Pattern recognition (psychology); Biology","score_opus":0.30698202867343055,"score_gpt":0.37346752807819505,"score_spread":0.0664854994047645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393161100","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.03182076,0.00062651525,0.9622165,0.00084399193,0.00019149683,0.00015641864,0.00027636203,0.0026386634,0.0012293825],"genre_scores_gemma":[0.40227765,0.0003418573,0.58914155,0.0014911968,0.0005394109,0.00061417616,0.0018069529,0.00076812995,0.0030190647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99394107,0.0022076939,0.00025747594,0.0018945313,0.0013840307,0.00031522434],"domain_scores_gemma":[0.98867667,0.0047197198,0.0011318699,0.0034821085,0.0015710621,0.00041849044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009330565,0.002289138,0.002053762,0.002035434,0.0014097724,0.0027741073,0.004278686,0.0026336086,0.0016683819],"category_scores_gemma":[0.02311863,0.00092387537,0.001636899,0.0019090354,0.002887212,0.0052746874,0.006001203,0.00501309,0.0016803328],"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.0012822328,0.00080535805,0.013352558,0.0005401669,0.00033387262,0.00028210075,0.001389704,0.18427505,0.044161193,0.01912088,0.015714614,0.7187423],"study_design_scores_gemma":[0.000090759946,0.00022663441,0.0013395752,0.00006386874,0.000063431995,0.00017370052,0.00019262666,0.9409692,0.01733915,0.033603176,0.005889133,0.00004869315],"about_ca_topic_score_codex":0.0011004746,"about_ca_topic_score_gemma":0.0015536945,"teacher_disagreement_score":0.009330565,"about_ca_system_score_codex":0.0009896763,"about_ca_system_score_gemma":0.0014402797,"threshold_uncertainty_score":0.049345374},"labels":[],"label_agreement":null},{"id":"W4393161108","doi":"10.1609/aaai.v38i18.30049","title":"Delegation-Relegation for Boolean Matrix Factorization","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut Universitaire de Gériatrie de Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Delegation; Factorization; Matrix (chemical analysis); Mathematics; Computer science; Logical matrix; Algebra over a field; Theoretical computer science; Pure mathematics; Political science; Algorithm; Physics; Materials science","score_opus":0.09672853750853222,"score_gpt":0.3595913327743344,"score_spread":0.2628627952658022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393161108","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.012526128,0.00030164554,0.977749,0.000453668,0.00010734701,0.00014996216,0.00017849237,0.002321085,0.0062127304],"genre_scores_gemma":[0.45544684,0.0004827987,0.5305682,0.00063407765,0.00026828202,0.00041039786,0.0009614148,0.0007008272,0.010527126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942555,0.0017257287,0.00036781467,0.0009978131,0.001940771,0.0007125284],"domain_scores_gemma":[0.98915696,0.0043092277,0.0006022432,0.0046768016,0.0009862062,0.00026852192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037599516,0.0012351531,0.0017479705,0.0011679194,0.0018209179,0.002557048,0.0020705282,0.0013603682,0.012314146],"category_scores_gemma":[0.021054314,0.000639306,0.0020578513,0.0014009352,0.0023674774,0.0052795657,0.004747612,0.0025710221,0.0031368018],"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.00077590585,0.0003987536,0.0016301083,0.0006877365,0.00013102355,0.00055385137,0.0006965956,0.14758438,0.013073948,0.33919674,0.026093068,0.4691779],"study_design_scores_gemma":[0.00010108742,0.00010892372,0.00024120287,0.00006672753,0.000045607878,0.0003075385,0.000113381306,0.65736395,0.009712021,0.3170103,0.01488571,0.000043564854],"about_ca_topic_score_codex":0.0030972653,"about_ca_topic_score_gemma":0.005381749,"teacher_disagreement_score":0.012314146,"about_ca_system_score_codex":0.0013956147,"about_ca_system_score_gemma":0.002091356,"threshold_uncertainty_score":0.041194916},"labels":[],"label_agreement":null},{"id":"W4393161149","doi":"10.1609/aaai.v38i20.30271","title":"Regeneration Learning: A Learning Paradigm for Data Generation","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Scientific Computing and Data Management","field":"Decision Sciences","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é de Montréal","funders":"","keywords":"Regeneration (biology); Paradigm shift; Cognitive science; Computer science; Psychology; Biology; Cell biology; Epistemology; Philosophy","score_opus":0.499049559113239,"score_gpt":0.44374676322357504,"score_spread":0.05530279588966397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393161149","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.0007849736,0.00012380746,0.99813396,0.00017159287,0.000020971922,0.000044643562,0.00004258886,0.00024821653,0.00042924],"genre_scores_gemma":[0.1014417,0.00066294946,0.8917513,0.00073673244,0.00020760664,0.0008365758,0.0007370487,0.00026005608,0.0033660256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99618644,0.0015316181,0.00024379614,0.0010954115,0.0007833512,0.00015937132],"domain_scores_gemma":[0.99380976,0.003849721,0.00029941526,0.0012792746,0.00060378027,0.00015819358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056333225,0.0012986028,0.0011741958,0.0014214801,0.0008065853,0.0018487348,0.004691053,0.0017712606,0.0033501592],"category_scores_gemma":[0.012533324,0.00077480933,0.0020102963,0.0015261612,0.003070361,0.0046637035,0.0046311533,0.0052596945,0.0011438166],"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.00023374836,0.000235157,0.0014942884,0.0004861874,0.00014551728,0.0002560722,0.00065662287,0.19117577,0.0056217276,0.36830002,0.008314954,0.42307988],"study_design_scores_gemma":[0.000035472203,0.00010436893,0.000107875814,0.000041605974,0.000018254337,0.000118614975,0.000036049678,0.79725146,0.003540112,0.19072473,0.007995059,0.00002636113],"about_ca_topic_score_codex":0.0017749335,"about_ca_topic_score_gemma":0.001889929,"teacher_disagreement_score":0.0056333225,"about_ca_system_score_codex":0.0013124145,"about_ca_system_score_gemma":0.0017707185,"threshold_uncertainty_score":0.02979225},"labels":[],"label_agreement":null},{"id":"W4393161160","doi":"10.1609/aaai.v38i19.30119","title":"Quilt: Robust Data Segment Selection against Concept Drifts","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; National Research Foundation; National Research Foundation of Korea; SK Hynix","keywords":"Quilt; Selection (genetic algorithm); Computer science; Artificial intelligence; Geography; Archaeology","score_opus":0.1330643392876211,"score_gpt":0.3261624571725404,"score_spread":0.1930981178849193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393161160","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.048045393,0.00132618,0.91442835,0.00045973386,0.0002853978,0.0004753601,0.0016546948,0.032188643,0.001136268],"genre_scores_gemma":[0.4630531,0.00049736426,0.512652,0.0014097887,0.00037097425,0.0010612338,0.01467657,0.0021480408,0.004130916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99688005,0.0007680378,0.00025386832,0.000957346,0.00087265624,0.00026809852],"domain_scores_gemma":[0.9917773,0.003446572,0.0005416812,0.0022340592,0.0015849482,0.00041534298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068835164,0.0019052186,0.0023214093,0.0024903207,0.0011894363,0.002340767,0.0043622893,0.0020026995,0.0021474743],"category_scores_gemma":[0.023399925,0.0007221568,0.0015119481,0.0026560086,0.00093415985,0.0034141531,0.0032700156,0.0024608944,0.0019964315],"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.0017725541,0.00079803664,0.011355316,0.0003520745,0.0005061491,0.00044119582,0.00045972673,0.16695616,0.0220989,0.003495506,0.051960133,0.7398043],"study_design_scores_gemma":[0.00014507344,0.00032801423,0.0020331198,0.000027170381,0.00007068447,0.00022612841,0.000079185964,0.9757111,0.009713011,0.0058435365,0.0057733976,0.00004953096],"about_ca_topic_score_codex":0.0064633917,"about_ca_topic_score_gemma":0.005870231,"teacher_disagreement_score":0.0068835164,"about_ca_system_score_codex":0.00097532064,"about_ca_system_score_gemma":0.0026428918,"threshold_uncertainty_score":0.036403954},"labels":[],"label_agreement":null},{"id":"W4393161199","doi":"10.1609/aaai.v38i19.30114","title":"Analysis of Differentially Private Synthetic Data: A Measurement Error Approach","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; University of Alberta","funders":"Alberta Machine Intelligence Institute; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science","score_opus":0.203321558868656,"score_gpt":0.3300269657218817,"score_spread":0.12670540685322573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393161199","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.059079345,0.0003266784,0.93721473,0.0009292291,0.000060430728,0.00013208276,0.0005382904,0.00023348848,0.0014857248],"genre_scores_gemma":[0.84665185,0.00029006935,0.15034547,0.00042155082,0.00009139684,0.0003312693,0.001111729,0.00007725852,0.0006793076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9860503,0.009665707,0.00038860147,0.0010955862,0.0024443257,0.00035536994],"domain_scores_gemma":[0.88645005,0.09012626,0.006607828,0.012033733,0.0042617517,0.00052030483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022272069,0.0006868666,0.00095041614,0.0012981868,0.00069168984,0.0016383397,0.0023313765,0.00173158,0.0012489425],"category_scores_gemma":[0.124694824,0.0004440795,0.0007504931,0.0017174059,0.0020761015,0.003335071,0.0025322565,0.0022952165,0.00018623305],"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.00040087927,0.00014281397,0.013661084,0.00028404023,0.0001900073,0.00032145038,0.00025784422,0.7277945,0.003394746,0.2053159,0.0030977076,0.045138936],"study_design_scores_gemma":[0.000027004158,0.00007476779,0.0010467819,0.000030506828,0.000017295553,0.000147844,0.000059619408,0.9375552,0.0023105515,0.05750521,0.0012039208,0.000021316806],"about_ca_topic_score_codex":0.00096637075,"about_ca_topic_score_gemma":0.0004991983,"teacher_disagreement_score":0.022272069,"about_ca_system_score_codex":0.0013627892,"about_ca_system_score_gemma":0.0011280682,"threshold_uncertainty_score":0.11778736},"labels":[],"label_agreement":null},{"id":"W4393161280","doi":"10.1609/aaai.v38i21.30310","title":"A Submodular Optimization Approach to Accountable Loan Approval","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Banking stability, regulation, efficiency","field":"Economics, Econometrics and Finance","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":"Kootenay Association for Science & Technology","funders":"","keywords":"Submodular set function; Loan; Business; Computer science; Actuarial science; Economics; Mathematical optimization; Mathematics; Finance","score_opus":0.07133280103729285,"score_gpt":0.26365037754970055,"score_spread":0.19231757651240772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393161280","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.009733372,0.0004169388,0.98314613,0.00061350595,0.000054066917,0.00011048094,0.00018011068,0.00037713867,0.005368207],"genre_scores_gemma":[0.4545812,0.00063833897,0.5330065,0.00066307303,0.00019184817,0.0004875775,0.00060235587,0.00037989597,0.009449229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965928,0.0018883251,0.00012902304,0.00056961953,0.0005234813,0.00029675852],"domain_scores_gemma":[0.9957663,0.0030601502,0.00030310717,0.00024019404,0.00048730784,0.00014303139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043060356,0.001398856,0.002380017,0.00097001815,0.00071105344,0.0020646623,0.0018538913,0.0016982721,0.0057502165],"category_scores_gemma":[0.008756341,0.00095962756,0.0014373179,0.0012621953,0.0018370794,0.0018775129,0.0018377264,0.002604103,0.00089887157],"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.000077038036,0.00010456619,0.00056594785,0.00012038194,0.00007752536,0.00014475455,0.00009942575,0.90041023,0.00058676244,0.05155081,0.0036815642,0.042581014],"study_design_scores_gemma":[0.000016772537,0.000029926412,0.00007770202,0.000011108683,0.000008450976,0.000020713138,0.00001333291,0.9577203,0.00020870924,0.040674157,0.0012109845,0.000007850372],"about_ca_topic_score_codex":0.0056539243,"about_ca_topic_score_gemma":0.00549856,"teacher_disagreement_score":0.0057502165,"about_ca_system_score_codex":0.001985784,"about_ca_system_score_gemma":0.0025812346,"threshold_uncertainty_score":0.02277273},"labels":[],"label_agreement":null},{"id":"W4393161366","doi":"10.1609/aaai.v38i21.30439","title":"Sequential Modeling of Complex Marine Navigation: Case Study on a Passenger Vessel (Student Abstract)","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Maritime Navigation and Safety","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"National Research Council Canada; Simon Fraser University","funders":"","keywords":"Computer science; Marine engineering; Aeronautics; Environmental science; Transport engineering; Engineering","score_opus":0.11606571463672846,"score_gpt":0.3407597572691214,"score_spread":0.22469404263239293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393161366","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.9752176,0.00027185312,0.017808266,0.0006394053,0.000046665235,0.000057349815,0.0023660683,0.00019719292,0.0033956354],"genre_scores_gemma":[0.98638934,0.00013729323,0.009599162,0.000041881973,0.00001964422,0.000045101566,0.0016762979,0.0000290297,0.0020622876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9997774,0.00006912532,0.000013179268,0.00006784045,0.000034585726,0.000037864404],"domain_scores_gemma":[0.9983997,0.0011364069,0.00009456966,0.00008972583,0.00017888755,0.000100683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078461325,0.00058285,0.00046285038,0.00059126836,0.00061418064,0.0007531145,0.0009796759,0.0011920274,0.002364155],"category_scores_gemma":[0.0026319667,0.0002606982,0.0007007141,0.0008724689,0.00046661563,0.00051733287,0.0005790187,0.0009720478,0.00023358373],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011142136,0.00018786035,0.019632924,0.000076230775,0.000047529214,0.000484207,0.00016047031,0.9665513,0.00049831404,0.0021199738,0.0020220305,0.008107736],"study_design_scores_gemma":[0.0000119766455,0.00004042361,0.0046726596,0.000007703937,0.0000124945445,0.000034916957,0.00014656813,0.99275744,0.00023546738,0.0009952348,0.0010736892,0.00001149098],"about_ca_topic_score_codex":0.23124902,"about_ca_topic_score_gemma":0.29760748,"teacher_disagreement_score":0.23124902,"about_ca_system_score_codex":0.0015847334,"about_ca_system_score_gemma":0.0011029914,"threshold_uncertainty_score":0.45980603},"labels":[],"label_agreement":null},{"id":"W4393161391","doi":"10.1609/aaai.v38i21.30411","title":"Does Robin Hood Use a Lightsaber?: Automated Planning for Storytelling","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","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":"Queen's University","funders":"","keywords":"Storytelling; Computer science; Art; Narrative; Literature","score_opus":0.09562430147882751,"score_gpt":0.32947293201672323,"score_spread":0.23384863053789573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393161391","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.05369968,0.004792932,0.63505244,0.09092477,0.001564377,0.000650613,0.0017362772,0.021787636,0.1897913],"genre_scores_gemma":[0.365889,0.0022873885,0.5648307,0.003172405,0.00026284982,0.0001939145,0.0016974299,0.0018187923,0.059847627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989484,0.00049921835,0.00005298937,0.0002026563,0.00021422008,0.000082484585],"domain_scores_gemma":[0.99723464,0.0015919774,0.00013944373,0.0003807945,0.0003306706,0.000322404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017283066,0.00055521476,0.00033057603,0.0008035662,0.0015961227,0.0034716984,0.0012788323,0.0016587678,0.019363254],"category_scores_gemma":[0.0102138305,0.00045719036,0.0005058947,0.00047031397,0.001859338,0.005407849,0.0020835467,0.0015824257,0.007241153],"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.0007626999,0.00027026358,0.0042949957,0.0005758625,0.0000711902,0.0012171208,0.0072602755,0.017373893,0.0069754096,0.21233727,0.16636817,0.5824929],"study_design_scores_gemma":[0.00014471235,0.00020936046,0.0020752081,0.0003236672,0.000061109684,0.0010151783,0.0045228307,0.1421752,0.007898514,0.26417613,0.5772456,0.00015258398],"about_ca_topic_score_codex":0.011082649,"about_ca_topic_score_gemma":0.015406033,"teacher_disagreement_score":0.019363254,"about_ca_system_score_codex":0.0012482319,"about_ca_system_score_gemma":0.0013841143,"threshold_uncertainty_score":0.06477654},"labels":[],"label_agreement":null},{"id":"W4393161476","doi":"10.1609/aaai.v38i21.30563","title":"Enhancing Machine Translation Experiences with Multilingual Knowledge Graphs","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Natural Language Processing Techniques","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 Calgary","funders":"","keywords":"Machine translation; Knowledge graph; Computer science; Translation (biology); Natural language processing; Artificial intelligence; Linguistics; Chemistry; Philosophy","score_opus":0.05207619920806413,"score_gpt":0.32616867748507294,"score_spread":0.27409247827700883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393161476","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.1933384,0.0014586196,0.7368977,0.0026330103,0.00054462237,0.00036207362,0.0012902656,0.011852261,0.05162299],"genre_scores_gemma":[0.70411015,0.00096950075,0.28045142,0.00064651103,0.00010347882,0.00013730933,0.0023029868,0.0017723967,0.009506165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741936,0.0016460526,0.00012207309,0.00036798322,0.00036200363,0.000082404134],"domain_scores_gemma":[0.993001,0.0050341957,0.00020997581,0.0009560895,0.00066855276,0.00013013759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023955968,0.00091546815,0.00046365446,0.0012182433,0.0009287065,0.0023706993,0.001030165,0.0009966262,0.009599519],"category_scores_gemma":[0.015420424,0.00035175317,0.0005263235,0.0014147386,0.00091988663,0.005416188,0.0030208863,0.001356075,0.0023572843],"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.0011608577,0.0009271194,0.0045310343,0.0015226202,0.00023341777,0.003500928,0.02642564,0.06277312,0.04983506,0.0673655,0.02858012,0.7531447],"study_design_scores_gemma":[0.00027295915,0.00075798377,0.0040080464,0.00049308484,0.0005854081,0.0023160318,0.011139861,0.37449533,0.08644749,0.17161301,0.34753472,0.00033607736],"about_ca_topic_score_codex":0.0027006895,"about_ca_topic_score_gemma":0.0057968134,"teacher_disagreement_score":0.009599519,"about_ca_system_score_codex":0.00094418315,"about_ca_system_score_gemma":0.00090133894,"threshold_uncertainty_score":0.032113552},"labels":[],"label_agreement":null},{"id":"W4393161522","doi":"10.1609/aaai.v38i21.30388","title":"Knowledge Distillation from Single-Task Teachers to Multi-Task Student for End-to-End Autonomous Driving","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Human-Automation Interaction and Safety","field":"Psychology","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":"Simon Fraser University","funders":"","keywords":"End-to-end principle; Task (project management); End user; Computer science; Distillation; Engineering; Chemistry; Chromatography; Artificial intelligence; World Wide Web; Systems engineering","score_opus":0.1273989250350635,"score_gpt":0.41280141737418635,"score_spread":0.28540249233912285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393161522","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.04779907,0.00012847221,0.94704014,0.00026733373,0.000038251397,0.000088235785,0.000068840236,0.0022829955,0.0022865962],"genre_scores_gemma":[0.8916925,0.000069809146,0.104255214,0.00016003172,0.00001743748,0.00013932667,0.00019228674,0.00012741491,0.0033459424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965024,0.00006274459,0.000014795462,0.000113033355,0.00007369242,0.00008557965],"domain_scores_gemma":[0.99938214,0.00022912236,0.00004377283,0.00013164268,0.0001217064,0.000091638234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082386483,0.00071739434,0.0006592664,0.00021728115,0.00036996295,0.0007799445,0.0015414702,0.0010921422,0.0030129992],"category_scores_gemma":[0.0024855093,0.00037102186,0.0005542107,0.00020404879,0.0006996048,0.0018225454,0.0025832905,0.0018843102,0.00081784435],"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.00059030904,0.00048159223,0.0017108301,0.00015877788,0.000058184392,0.00020351022,0.00043422155,0.69616365,0.01435209,0.012086104,0.0030205853,0.27074012],"study_design_scores_gemma":[0.00001930435,0.00007413818,0.0001200762,0.0000047263607,0.000005849332,0.000021153737,0.00002283903,0.9914261,0.0036558225,0.0039587338,0.0006849472,0.000006289239],"about_ca_topic_score_codex":0.004366074,"about_ca_topic_score_gemma":0.005059698,"teacher_disagreement_score":0.004366074,"about_ca_system_score_codex":0.00068197463,"about_ca_system_score_gemma":0.0016684445,"threshold_uncertainty_score":0.010079443},"labels":[],"label_agreement":null},{"id":"W4393161549","doi":"10.1609/aaai.v38i21.30345","title":"A Generalizable Theory-Driven Agent-Based Framework to Study Conflict-Induced Forced Migration","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"COVID-19 epidemiological studies","field":"Mathematics","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":"York University","funders":"Defense Threat Reduction Agency; National Science Foundation","keywords":"Forced migration; Computer science; Psychology; Political science; Law; Refugee","score_opus":0.40979477763544164,"score_gpt":0.4555087882791007,"score_spread":0.04571401064365904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393161549","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.026027516,0.00024335086,0.963801,0.0009844691,0.00009386003,0.000105731946,0.00032161272,0.00017801432,0.00824451],"genre_scores_gemma":[0.72461355,0.0005657308,0.2676915,0.00025144094,0.00012310699,0.00055823673,0.00042018775,0.00009334767,0.005682964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996586,0.00015156185,0.000020176376,0.00008546112,0.000045980927,0.00003830933],"domain_scores_gemma":[0.99942327,0.00028746718,0.00010137289,0.0000442158,0.00007729051,0.00006633218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007575661,0.0007471905,0.00076111214,0.000893862,0.0006933345,0.0013073065,0.0025345085,0.0013103524,0.0025868965],"category_scores_gemma":[0.002023916,0.000429523,0.0011981643,0.0008737194,0.0012996658,0.0013352418,0.0018202325,0.0011397614,0.0002630459],"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.000004804744,0.00001543424,0.0006821043,0.000019656343,0.000026940364,0.00008957311,0.00005988403,0.94522125,0.00022766698,0.0514497,0.00031307404,0.0018899193],"study_design_scores_gemma":[0.0000059519725,0.0000070718174,0.000100693695,0.0000040475825,0.0000068622267,0.00001021761,0.00002129535,0.9806322,0.000021637117,0.018498784,0.00068696,0.000004259626],"about_ca_topic_score_codex":0.024418948,"about_ca_topic_score_gemma":0.020173034,"teacher_disagreement_score":0.024418948,"about_ca_system_score_codex":0.0016484878,"about_ca_system_score_gemma":0.0023120663,"threshold_uncertainty_score":0.048553646},"labels":[],"label_agreement":null},{"id":"W4393161640","doi":"10.1609/aaai.v38i21.30497","title":"QuickRender: A Photorealistic Procedurally Generated Dataset with Applications to Super Resolution (Student Abstract)","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Royal University","funders":"Mount Royal University","keywords":"Computer science; Resolution (logic); Geology; Computer graphics (images); Artificial intelligence","score_opus":0.07618074926194278,"score_gpt":0.3506861849912374,"score_spread":0.2745054357292946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393161640","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042004287,0.0016135562,0.039335433,0.00089924654,0.00065757224,0.0007698554,0.81505764,0.08660119,0.0130613325],"genre_scores_gemma":[0.03157815,0.00035066038,0.04231603,0.00022165124,0.000064938475,0.00040712094,0.91852415,0.0043759253,0.0021613855],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992291,0.00009536618,0.00004498756,0.00018930285,0.0003269634,0.000114292394],"domain_scores_gemma":[0.9988643,0.00023070996,0.0000550907,0.00043544726,0.00027303846,0.00014140416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007790271,0.0023426365,0.0011705706,0.0021110917,0.00089602364,0.0015052288,0.003195129,0.0016948704,0.012794348],"category_scores_gemma":[0.0023545409,0.0009575876,0.0021520783,0.002174009,0.0006467091,0.0011412138,0.002302311,0.0028418044,0.013460701],"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.0009470996,0.00074959913,0.004430658,0.0017587086,0.00035361582,0.00063641195,0.0002785275,0.021108523,0.025532927,0.0024235647,0.8513686,0.09041174],"study_design_scores_gemma":[0.0011360745,0.0004970259,0.034498848,0.0004953354,0.00021492128,0.0020594413,0.0005256994,0.12463823,0.0601961,0.010413144,0.7649018,0.00042339382],"about_ca_topic_score_codex":0.012925861,"about_ca_topic_score_gemma":0.038211267,"teacher_disagreement_score":0.012925861,"about_ca_system_score_codex":0.0007466805,"about_ca_system_score_gemma":0.0009487198,"threshold_uncertainty_score":0.04280132},"labels":[],"label_agreement":null},{"id":"W4393161644","doi":"10.1609/aaai.v38i21.30437","title":"A SAT + Computer Algebra System Verification of the Ramsey Problem R(3, 8) (Student Abstract)","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Computability, Logic, AI Algorithms","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 Windsor; University of Waterloo","funders":"","keywords":"Computer science; Algebra over a field; Symbolic computation; Programming language; Calculus (dental); Theoretical computer science; Mathematics; Pure mathematics","score_opus":0.04920799804165031,"score_gpt":0.2839430372953485,"score_spread":0.23473503925369815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393161644","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.12689205,0.0003188788,0.79022425,0.006616825,0.0007844967,0.00081396016,0.0014196422,0.010081894,0.06284805],"genre_scores_gemma":[0.6472634,0.00015877571,0.338214,0.0013549753,0.00025146428,0.00029835192,0.0011932245,0.00046488608,0.010800883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99575305,0.0015380961,0.00019363666,0.000814985,0.0011922984,0.0005080652],"domain_scores_gemma":[0.98723197,0.009328538,0.0004357354,0.0014020083,0.0012680738,0.00033367408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037582691,0.000541082,0.0006468879,0.00068138016,0.0015922195,0.0025838679,0.0019136729,0.0011435574,0.016498378],"category_scores_gemma":[0.014276658,0.0006680469,0.00209003,0.000665033,0.0026062676,0.0038252359,0.003271045,0.003261933,0.0016974556],"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.0009854519,0.0008845803,0.004268061,0.00078139093,0.00026348652,0.0013287028,0.0005995196,0.08215056,0.034300737,0.6926872,0.053795986,0.12795435],"study_design_scores_gemma":[0.0005332008,0.00043495532,0.0014138685,0.00010390755,0.00016249435,0.0004712223,0.00020877665,0.63392884,0.05688861,0.28120527,0.024558138,0.00009068528],"about_ca_topic_score_codex":0.006332401,"about_ca_topic_score_gemma":0.008772328,"teacher_disagreement_score":0.016498378,"about_ca_system_score_codex":0.002075096,"about_ca_system_score_gemma":0.0049897237,"threshold_uncertainty_score":0.05519259},"labels":[],"label_agreement":null},{"id":"W4393161659","doi":"10.1609/aaai.v38i21.30392","title":"The Promise of Serverless Computing within Peer-to-Peer Architectures for Distributed ML Training","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Distributed and Parallel Computing Systems","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é du Québec à Chicoutimi","funders":"","keywords":"Computer science; Peer-to-peer; Training (meteorology); Distributed computing","score_opus":0.09058861553117961,"score_gpt":0.3226681357076716,"score_spread":0.232079520176492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393161659","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.036111414,0.002566922,0.9359401,0.0107525615,0.0006766384,0.00009847153,0.000105442006,0.0018125388,0.011936028],"genre_scores_gemma":[0.8106452,0.002487719,0.17509104,0.0010983091,0.0010330556,0.00017728283,0.0001748292,0.00029908848,0.008993435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984743,0.00056968105,0.000055086573,0.00029063475,0.0004665238,0.00014383087],"domain_scores_gemma":[0.9950407,0.0023550936,0.00014384883,0.0015312869,0.0006217646,0.0003072043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030560482,0.00058926386,0.0008613524,0.0003351667,0.0010825224,0.0044688783,0.0026589078,0.001885698,0.0045009945],"category_scores_gemma":[0.009136341,0.0004644806,0.0004214676,0.00071554777,0.0016989998,0.010039854,0.002780075,0.0039612693,0.0017430759],"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.0007921321,0.00043500005,0.0017985146,0.0003057663,0.00015059217,0.00024985682,0.0009341648,0.2631244,0.019732617,0.39344704,0.025317268,0.2937127],"study_design_scores_gemma":[0.000048919504,0.00019510633,0.0002817884,0.000037117174,0.000028688713,0.00008880584,0.00014568845,0.7481292,0.0060103997,0.2242912,0.020707013,0.000036066507],"about_ca_topic_score_codex":0.0012739433,"about_ca_topic_score_gemma":0.0014446328,"teacher_disagreement_score":0.0045009945,"about_ca_system_score_codex":0.0008380525,"about_ca_system_score_gemma":0.0011655338,"threshold_uncertainty_score":0.016162097},"labels":[],"label_agreement":null},{"id":"W4393161733","doi":"10.1609/aaai.v38i21.30419","title":"Incorporating Serverless Computing into P2P Networks for ML Training: In-Database Tasks and Their Scalability Implications (Student Abstract)","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Distributed and Parallel Computing Systems","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Scalability; Computer science; Training (meteorology); Database; Distributed computing; Artificial intelligence","score_opus":0.08806732443012481,"score_gpt":0.33011354093756434,"score_spread":0.24204621650743952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393161733","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.18153116,0.0010304844,0.7930467,0.003913354,0.00034124337,0.00019985903,0.00011790312,0.0036527663,0.016166504],"genre_scores_gemma":[0.8691096,0.00046539132,0.12478165,0.0002305243,0.00012992382,0.00008198452,0.000099257486,0.00010864728,0.004993127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992906,0.000264028,0.00004422904,0.00012135162,0.000184249,0.000095562515],"domain_scores_gemma":[0.99693644,0.0013854764,0.00008922351,0.0007243347,0.0006450325,0.00021945602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017383313,0.00042473737,0.00044587287,0.00025724055,0.0008219167,0.0019793287,0.0018348955,0.00076972117,0.003976417],"category_scores_gemma":[0.0043868744,0.00021700704,0.00021695656,0.00064441113,0.0006254987,0.004695245,0.0014040433,0.0011503734,0.0007772534],"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.0011135378,0.0015250893,0.012404669,0.0004376112,0.00009764332,0.00093163556,0.0010304268,0.22133124,0.08111858,0.07114129,0.01659203,0.59227633],"study_design_scores_gemma":[0.00005994372,0.00026936745,0.0010289587,0.00002621781,0.000031313026,0.00021687034,0.00028670763,0.91995674,0.044838347,0.02417392,0.009087195,0.000024463148],"about_ca_topic_score_codex":0.0024278215,"about_ca_topic_score_gemma":0.0023721773,"teacher_disagreement_score":0.003976417,"about_ca_system_score_codex":0.00055069954,"about_ca_system_score_gemma":0.00070820906,"threshold_uncertainty_score":0.013302386},"labels":[],"label_agreement":null},{"id":"W4393161746","doi":"10.1609/aaai.v38i21.30472","title":"A SAT Solver and Computer Algebra Attack on the Minimum Kochen-Specker Problem (Student Abstract)","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Solver; Boolean satisfiability problem; Algebra over a field; Computer science; Mathematics; Theoretical computer science; Programming language; Pure mathematics","score_opus":0.09548648366521736,"score_gpt":0.31365248732505113,"score_spread":0.21816600365983377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393161746","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.35131398,0.0008107682,0.49694103,0.024184521,0.0010072904,0.00043582378,0.00095630105,0.0040006274,0.12034972],"genre_scores_gemma":[0.8508706,0.00031865816,0.13171826,0.0017527769,0.00038847598,0.0002519558,0.00053398847,0.00028868974,0.0138766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641365,0.0014177316,0.00014434737,0.00049437094,0.0009910783,0.0005388854],"domain_scores_gemma":[0.9925045,0.0052069984,0.0002940805,0.0011660119,0.00052134925,0.00030710083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029731393,0.00047281635,0.0008768043,0.0007896579,0.0020240769,0.0025051176,0.0013647232,0.0015293594,0.010565453],"category_scores_gemma":[0.010110883,0.0004844661,0.002023218,0.00087245565,0.002712945,0.004616649,0.004196979,0.00533127,0.0011930094],"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.0005041563,0.00023971862,0.0008729748,0.00019319073,0.00009104665,0.00040508978,0.000405023,0.019690048,0.010219239,0.9005994,0.02241745,0.044362724],"study_design_scores_gemma":[0.00029849246,0.00020004282,0.00048614971,0.000048604004,0.000084181775,0.00023826824,0.00014018534,0.21587805,0.024327662,0.7414098,0.01682273,0.000065968256],"about_ca_topic_score_codex":0.0014685056,"about_ca_topic_score_gemma":0.0015372392,"teacher_disagreement_score":0.010565453,"about_ca_system_score_codex":0.0018566729,"about_ca_system_score_gemma":0.0027679973,"threshold_uncertainty_score":0.03534496},"labels":[],"label_agreement":null},{"id":"W4393178464","doi":"10.1609/aaai.v38i21.30447","title":"Engineering the Neural Collapse Geometry of Supervised-Contrastive Loss (Student Abstract)","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; King Abdullah University of Science and Technology; Universities Space Research Association; National Science Foundation","keywords":"Geometry; Computer science; Geology; Artificial intelligence; Mathematics","score_opus":0.0395650906801416,"score_gpt":0.28374946331395356,"score_spread":0.24418437263381196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393178464","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.09758906,0.0004805057,0.892452,0.0018020897,0.00014075887,0.00012764243,0.00024204123,0.00080415973,0.006361761],"genre_scores_gemma":[0.86331767,0.0002539179,0.129642,0.0006343363,0.00019965418,0.00026319892,0.00048198298,0.00027985897,0.0049274373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823344,0.0007710803,0.00007819651,0.0003413632,0.00043088547,0.00014501372],"domain_scores_gemma":[0.99451137,0.0029896528,0.0004761305,0.00078153075,0.0009011489,0.00034016612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00575884,0.00096229365,0.0008223033,0.00079552556,0.00048375753,0.0014250774,0.0015412787,0.0015727676,0.0027915027],"category_scores_gemma":[0.01973888,0.00038696616,0.0005153219,0.00047910446,0.0024208953,0.003375629,0.003258346,0.0029437095,0.0006889221],"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.00072713674,0.00035327236,0.0056589353,0.00021214857,0.00009051771,0.0004756373,0.00020401223,0.5931793,0.012333605,0.15800385,0.019234344,0.2095273],"study_design_scores_gemma":[0.000016916534,0.00013230737,0.0004235035,0.000020362237,0.0000051981497,0.000093464005,0.000013562156,0.96465564,0.0025773356,0.031342734,0.00070786546,0.000010975451],"about_ca_topic_score_codex":0.001504137,"about_ca_topic_score_gemma":0.0014920705,"teacher_disagreement_score":0.00575884,"about_ca_system_score_codex":0.0015532863,"about_ca_system_score_gemma":0.0011036335,"threshold_uncertainty_score":0.030456007},"labels":[],"label_agreement":null},{"id":"W4402028590","doi":"10.1609/aaai.v39i25.34894","title":"Scenario-Based Robust Optimization of Tree Structures","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Multi-Objective Optimization Algorithms","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":"Canadian Institute for International Peace and Security","funders":"Agence Nationale de la Recherche","keywords":"Regret; Mathematics; Huffman coding; Binary search tree; Tree (set theory); Combinatorics; Time complexity; Upper and lower bounds; Context (archaeology); Discrete mathematics; Algorithm; Computer science; Binary tree; Data compression; Statistics","score_opus":0.048309295751383735,"score_gpt":0.29297862948640047,"score_spread":0.24466933373501673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402028590","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.018079754,0.00032023113,0.97667605,0.00040400942,0.000037263755,0.0000901154,0.00025250457,0.00018804675,0.00395191],"genre_scores_gemma":[0.66028446,0.0008306832,0.33365613,0.0002862657,0.00008870627,0.00041155287,0.00068540324,0.00024807805,0.0035086707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978332,0.0010155935,0.000062440944,0.00035006515,0.00042809677,0.00031059398],"domain_scores_gemma":[0.9928893,0.0052852873,0.0006113522,0.00044140505,0.00043906362,0.00033349296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032764317,0.0013041676,0.0014855334,0.0010284676,0.0005607693,0.0020311263,0.0018284249,0.0015727773,0.0042226757],"category_scores_gemma":[0.012487706,0.0006696768,0.0013290017,0.0016420488,0.0013552784,0.003419105,0.0018652653,0.002303404,0.00048500946],"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.000034629185,0.000028744766,0.00016751274,0.000041822306,0.00002489636,0.000032383337,0.000021005504,0.96175414,0.00039986137,0.03064581,0.0006486233,0.0062005795],"study_design_scores_gemma":[0.0000091774455,0.0000405891,0.000068608155,0.000010542574,0.000006885071,0.000022193848,0.000016939413,0.9604341,0.0002835145,0.038453188,0.0006472646,0.0000069322714],"about_ca_topic_score_codex":0.0022636522,"about_ca_topic_score_gemma":0.0019114681,"teacher_disagreement_score":0.0042226757,"about_ca_system_score_codex":0.002391036,"about_ca_system_score_gemma":0.0019419731,"threshold_uncertainty_score":0.01734829},"labels":[],"label_agreement":null},{"id":"W4409346422","doi":"10.1609/aaai.v39i3.32282","title":"GarFast: Realistic and Fast Garment Transfer with a Simplified Parser-Free Approach","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Manufacturing Process and Optimization","field":"Engineering","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Parsing; Transfer (computing); Parallel computing; Programming language","score_opus":0.029478956602446954,"score_gpt":0.2324421449830147,"score_spread":0.20296318838056773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409346422","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.005324752,0.0001189711,0.98080486,0.0001388775,0.00004831934,0.00006724284,0.00016677527,0.012071411,0.0012587892],"genre_scores_gemma":[0.2396238,0.00037023248,0.74009866,0.00068509247,0.00009355632,0.00026930592,0.0021095623,0.005108516,0.011641309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993942,0.00010597453,0.000023348506,0.00023327595,0.00017451895,0.000068649555],"domain_scores_gemma":[0.99916637,0.00025707603,0.000049882587,0.00035966912,0.00011291089,0.000054038293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013055588,0.001837891,0.0012068546,0.0008331319,0.00053054217,0.0016233247,0.0038144866,0.0023590769,0.008985374],"category_scores_gemma":[0.0032995986,0.0014763486,0.0021475265,0.00054212887,0.00134536,0.0029353704,0.0030925057,0.002725474,0.0044270367],"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.0004153377,0.00018889827,0.0009337749,0.00023167267,0.00016709066,0.0005865851,0.00016537662,0.6023388,0.032680046,0.012378533,0.01444322,0.33547068],"study_design_scores_gemma":[0.00001600888,0.000031734307,0.00009813027,0.000009710294,0.000013011219,0.000091305636,0.000011505028,0.9838471,0.0075373105,0.0064659314,0.0018642495,0.00001392977],"about_ca_topic_score_codex":0.0043475144,"about_ca_topic_score_gemma":0.0066923155,"teacher_disagreement_score":0.008985374,"about_ca_system_score_codex":0.0009709205,"about_ca_system_score_gemma":0.0011605456,"threshold_uncertainty_score":0.03005904},"labels":[],"label_agreement":null},{"id":"W4409346467","doi":"10.1609/aaai.v39i2.32229","title":"Recoverable Compression: A Multimodal Vision Token Recovery Mechanism Guided by Text Information","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Steganography and Watermarking 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":"Artificial Intelligence in Medicine (Canada)","funders":"Chinese Academy of Sciences","keywords":"Security token; Computer science; Mechanism (biology); Compression (physics); Computer network","score_opus":0.02630364018134418,"score_gpt":0.2894378646478584,"score_spread":0.26313422446651424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409346467","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.021577084,0.000374637,0.9675134,0.000255428,0.00013693723,0.00015797421,0.00026644487,0.008023379,0.0016947561],"genre_scores_gemma":[0.3888796,0.00049761817,0.5972829,0.00055113045,0.00016910417,0.00033858922,0.0014547631,0.00070186285,0.010124431],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994887,0.000074187825,0.000029501689,0.00015143484,0.00017579837,0.00008040296],"domain_scores_gemma":[0.9988952,0.0003322792,0.00013280389,0.00037892905,0.00019315597,0.00006771734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007871707,0.0013231346,0.0008995159,0.0013490211,0.00051718694,0.000910272,0.002440513,0.0012153173,0.004734452],"category_scores_gemma":[0.004088229,0.00040689335,0.0009882881,0.0009203417,0.0009791543,0.0025517896,0.0019687694,0.0015792646,0.0021443856],"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.001121541,0.00028210398,0.0012445907,0.00022946816,0.00009568675,0.000610862,0.00037722514,0.06067449,0.08776278,0.015738204,0.012299923,0.81956303],"study_design_scores_gemma":[0.00006957714,0.0001809198,0.00054261833,0.000034728484,0.000068844754,0.00047503127,0.0000905517,0.87932956,0.09712162,0.014259456,0.00777116,0.000055823897],"about_ca_topic_score_codex":0.004143352,"about_ca_topic_score_gemma":0.0035370055,"teacher_disagreement_score":0.004734452,"about_ca_system_score_codex":0.0007858314,"about_ca_system_score_gemma":0.0013887746,"threshold_uncertainty_score":0.015838325},"labels":[],"label_agreement":null},{"id":"W4409346471","doi":"10.1609/aaai.v39i2.32138","title":"MIDI-GPT: A Controllable Generative Model for Computer-Assisted Multitrack Music Composition","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Music Technology and Sound Studies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada; Canada Council for the Arts","keywords":"MIDI; Composition (language); Generative grammar; Musical composition; Computer science; Computer music; Artificial intelligence; Art; Visual arts; Musical; Literature","score_opus":0.08934396846312403,"score_gpt":0.30267508778149904,"score_spread":0.213331119318375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409346471","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.004477404,0.00007011975,0.9826689,0.00008084345,0.000060566388,0.00012028958,0.00033272116,0.009686183,0.0025030547],"genre_scores_gemma":[0.23666209,0.00026645357,0.7450212,0.00026859192,0.00006435279,0.0007617517,0.0028026595,0.003304966,0.010847905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959785,0.00008546734,0.000021470949,0.00012799908,0.00013470993,0.000032580007],"domain_scores_gemma":[0.9995127,0.00024643514,0.000027060556,0.00011558148,0.000052106247,0.00004619749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009797002,0.00074166385,0.00048728636,0.0005248862,0.000498248,0.0012351301,0.0022290598,0.0010640839,0.01057392],"category_scores_gemma":[0.0027443185,0.0006796806,0.0014386566,0.00036729375,0.0008046217,0.0010465009,0.002220205,0.0014901118,0.0035357552],"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.00052517134,0.00034963325,0.0036763072,0.0004222364,0.0001650169,0.00073112873,0.00094150985,0.54830897,0.048359524,0.051208537,0.02204553,0.32326645],"study_design_scores_gemma":[0.000034100347,0.000042664436,0.000187648,0.000014430406,0.000015363137,0.00015901274,0.00002179394,0.9704935,0.007128485,0.009728253,0.012154698,0.000019996955],"about_ca_topic_score_codex":0.0023062595,"about_ca_topic_score_gemma":0.0046084938,"teacher_disagreement_score":0.01057392,"about_ca_system_score_codex":0.0006672538,"about_ca_system_score_gemma":0.00093643536,"threshold_uncertainty_score":0.03537327},"labels":[],"label_agreement":null},{"id":"W4409346487","doi":"10.1609/aaai.v39i2.32174","title":"Can Generative Models Improve Self-Supervised Representation Learning?","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","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":"York University; Vector Institute","funders":"","keywords":"Generative grammar; Computer science; Representation (politics); Generative model; Artificial intelligence; Machine learning","score_opus":0.07205294050913724,"score_gpt":0.30408855288021647,"score_spread":0.23203561237107923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409346487","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.015295086,0.0012396867,0.97778136,0.0015109901,0.00014461864,0.000052259347,0.0001302445,0.0017857413,0.0020600709],"genre_scores_gemma":[0.63369054,0.0014587138,0.355221,0.0015332663,0.00043812377,0.0002443296,0.0013433963,0.00087028334,0.0052004056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975721,0.0013086632,0.00008010473,0.0005134049,0.000379108,0.00014651069],"domain_scores_gemma":[0.9907782,0.005623824,0.00046676927,0.0020223372,0.0008502539,0.00025858945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00527504,0.0014985579,0.0014871145,0.0011567986,0.00061017286,0.0020866534,0.002512331,0.0023099259,0.0027995822],"category_scores_gemma":[0.019329581,0.0007651935,0.0013722138,0.0010579015,0.0019518592,0.004613387,0.0027132703,0.0036833948,0.0017468135],"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.00020270715,0.0002958967,0.0032498348,0.0002954426,0.0002742928,0.00011710395,0.00039469887,0.48747203,0.0041138786,0.047618218,0.0139733935,0.4419925],"study_design_scores_gemma":[0.000014686559,0.0000397373,0.00013489238,0.000021072385,0.000011711424,0.00003104241,0.000021017911,0.9582214,0.0010504904,0.039033327,0.0014089104,0.000011811926],"about_ca_topic_score_codex":0.0032641788,"about_ca_topic_score_gemma":0.0041839783,"teacher_disagreement_score":0.00527504,"about_ca_system_score_codex":0.0011149368,"about_ca_system_score_gemma":0.0009824857,"threshold_uncertainty_score":0.027897418},"labels":[],"label_agreement":null},{"id":"W4409346510","doi":"10.1609/aaai.v39i2.32228","title":"AoP-SAM: Automation of Prompts for Efficient Segmentation","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Fault Detection and Control Systems","field":"Engineering","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":"Kootenay Association for Science & Technology","funders":"","keywords":"Automation; Segmentation; Computer science; Artificial intelligence; Computer vision; Engineering","score_opus":0.032500841206735714,"score_gpt":0.28678335738961297,"score_spread":0.2542825161828772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409346510","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.015404821,0.00010873913,0.967947,0.00015374388,0.000060881423,0.00008305472,0.0002066608,0.015136738,0.0008984383],"genre_scores_gemma":[0.31666532,0.00015410209,0.6757425,0.00040258653,0.000066299974,0.0002221166,0.0013839077,0.0020129613,0.0033501384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906546,0.00019878431,0.00004352198,0.00039990654,0.00020242565,0.00008992938],"domain_scores_gemma":[0.9980552,0.00075418304,0.00015653108,0.0006585787,0.00024429496,0.00013125206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001359922,0.0014762981,0.0009929007,0.00063565996,0.0004793806,0.0012464883,0.0023705673,0.0015868812,0.004589899],"category_scores_gemma":[0.0064452654,0.0006132617,0.00093389023,0.0005281634,0.0010389343,0.0026353088,0.002726306,0.0024701133,0.0021189305],"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.0012323357,0.00030860442,0.0044920263,0.00046275457,0.00009306625,0.00044254513,0.0008249197,0.18774052,0.08784451,0.024566382,0.025361232,0.6666311],"study_design_scores_gemma":[0.00003781731,0.00015567846,0.000512592,0.000016677086,0.000014957315,0.00013714985,0.000095846706,0.9464899,0.02607097,0.020478435,0.005966428,0.000023581142],"about_ca_topic_score_codex":0.0018065271,"about_ca_topic_score_gemma":0.003679421,"teacher_disagreement_score":0.004589899,"about_ca_system_score_codex":0.0006858965,"about_ca_system_score_gemma":0.0012905071,"threshold_uncertainty_score":0.015354693},"labels":[],"label_agreement":null},{"id":"W4409347088","doi":"10.1609/aaai.v39i16.33920","title":"Structural Entropy Guided Probabilistic Coding","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Government of Jiangxi Province; National Natural Science Foundation of China","keywords":"Probabilistic logic; Computer science; Entropy (arrow of time); Statistical physics; Artificial intelligence; Physics; Thermodynamics","score_opus":0.07748366319757934,"score_gpt":0.3370337294223721,"score_spread":0.25955006622479276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409347088","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.0058123805,0.00022289685,0.9921325,0.00022808892,0.000027855822,0.000027967033,0.00012731567,0.0002595791,0.001161558],"genre_scores_gemma":[0.6035519,0.0012433741,0.38407874,0.00056445383,0.00021900459,0.00054424617,0.0015053625,0.00037360698,0.007919184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986834,0.00043023733,0.00007570516,0.0002640221,0.00042687295,0.0001196645],"domain_scores_gemma":[0.9964562,0.0020219276,0.00030477278,0.000613184,0.0005147509,0.00008915527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017638332,0.000992304,0.001030563,0.0013291207,0.00039246172,0.0012961635,0.0020350795,0.0012869561,0.0025595485],"category_scores_gemma":[0.008685242,0.0004786468,0.0009219926,0.0018924734,0.0014922523,0.004181694,0.0025649436,0.0023714697,0.0007680415],"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.00012422103,0.00009621915,0.0010460803,0.00017238506,0.000056403256,0.00010758279,0.00018381924,0.5400882,0.00468159,0.22011188,0.005231908,0.22809972],"study_design_scores_gemma":[0.0000058081273,0.000020265225,0.00010265662,0.000011830289,0.0000066529888,0.000032185057,0.000007936347,0.94717586,0.00094867265,0.050800662,0.0008765542,0.000010915298],"about_ca_topic_score_codex":0.002046201,"about_ca_topic_score_gemma":0.0022008563,"teacher_disagreement_score":0.0025595485,"about_ca_system_score_codex":0.0010647568,"about_ca_system_score_gemma":0.001600616,"threshold_uncertainty_score":0.0093281865},"labels":[],"label_agreement":null},{"id":"W4409347110","doi":"10.1609/aaai.v39i15.33678","title":"Little Is Enough: Boosting Privacy by Sharing Only Hard Labels in Federated Semi-Supervised Learning","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Privacy-Preserving Technologies in Data","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":"Cytodiagnostics (Canada)","funders":"National Science Foundation","keywords":"Boosting (machine learning); Computer science; Federated learning; Internet privacy; Artificial intelligence","score_opus":0.07413650052535349,"score_gpt":0.3081997285532591,"score_spread":0.23406322802790563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409347110","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.059303753,0.00023776808,0.9371087,0.0007775103,0.000040095285,0.000073405856,0.00011099799,0.0010689023,0.0012787792],"genre_scores_gemma":[0.87731755,0.00008677813,0.12051227,0.0004644407,0.000051451665,0.0001337896,0.0001719602,0.00012067199,0.0011409947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9858159,0.008205911,0.00049087993,0.0024315896,0.0023412965,0.0007143718],"domain_scores_gemma":[0.9680567,0.013086561,0.0017987014,0.014299357,0.0019342732,0.000824496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01365931,0.0008979761,0.0020668574,0.00072100223,0.0020043936,0.0028680968,0.0032384743,0.0024926944,0.0010026954],"category_scores_gemma":[0.03841601,0.0008021272,0.0010643748,0.0011667513,0.0042054616,0.008655922,0.006585422,0.0040444112,0.00043574334],"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.0020954593,0.00074177206,0.00860703,0.00019391412,0.00023726735,0.0006376505,0.0016073026,0.6155798,0.00813467,0.1251948,0.004950361,0.23201993],"study_design_scores_gemma":[0.00004621747,0.0000830299,0.0002802706,0.000019770312,0.000020799209,0.00013599571,0.0000742006,0.86545616,0.003893774,0.12917647,0.00079262425,0.000020624206],"about_ca_topic_score_codex":0.0014000563,"about_ca_topic_score_gemma":0.0015055406,"teacher_disagreement_score":0.01365931,"about_ca_system_score_codex":0.0015590413,"about_ca_system_score_gemma":0.0025718783,"threshold_uncertainty_score":0.07223821},"labels":[],"label_agreement":null},{"id":"W4409347159","doi":"10.1609/aaai.v39i16.33871","title":"Diffusion Model Patching via Mixture-of-Prompts","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","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":"Kootenay Association for Science & Technology","funders":"","keywords":"Diffusion; Computer science; Thermodynamics; Physics","score_opus":0.04230162263490327,"score_gpt":0.29507034395896703,"score_spread":0.25276872132406375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409347159","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.036352083,0.00033413913,0.9563256,0.00041266065,0.00011243041,0.000068802816,0.00015471439,0.0047167903,0.0015227038],"genre_scores_gemma":[0.7048087,0.00029180312,0.28632957,0.00066978496,0.00014628019,0.0002677741,0.00081472873,0.0012357271,0.0054356265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993868,0.00017573568,0.000026560323,0.00022462323,0.00010812378,0.000078047415],"domain_scores_gemma":[0.9981674,0.0010822765,0.00011278757,0.00033359457,0.00018498686,0.000118893266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014647027,0.0012632646,0.0013425082,0.00057740643,0.0004272425,0.0009169146,0.0022354086,0.001658013,0.0037388394],"category_scores_gemma":[0.007480591,0.00075438083,0.001269867,0.00043168792,0.0009823715,0.0024859773,0.0025093858,0.0029416461,0.0012631232],"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.0003340616,0.0001409561,0.002288623,0.00016127009,0.0000893675,0.00021744291,0.0003317163,0.7879093,0.013725211,0.018725323,0.0054283645,0.1706483],"study_design_scores_gemma":[0.000012988414,0.000025756357,0.000054901844,0.0000038335947,0.000006173548,0.000028687293,0.000008678891,0.9924476,0.0019772123,0.004772262,0.00065407617,0.000007887472],"about_ca_topic_score_codex":0.0034684269,"about_ca_topic_score_gemma":0.0038184552,"teacher_disagreement_score":0.0037388394,"about_ca_system_score_codex":0.000750874,"about_ca_system_score_gemma":0.0008308799,"threshold_uncertainty_score":0.012507677},"labels":[],"label_agreement":null},{"id":"W4409347223","doi":"10.1609/aaai.v39i15.33760","title":"Unveiling the Threat of Fraud Gangs to Graph Neural Networks: Multi-Target Graph Injection Attacks Against GNN-Based Fraud Detectors","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","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":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea","keywords":"Computer security; Graph; Computer science; Detector; Theoretical computer science; Telecommunications","score_opus":0.039585509154680384,"score_gpt":0.3006739021294139,"score_spread":0.2610883929747335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409347223","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.5642533,0.000718316,0.426384,0.0015432946,0.00014014123,0.00028638434,0.0001827124,0.0019258242,0.0045661945],"genre_scores_gemma":[0.9695794,0.00012967859,0.02932277,0.00019695275,0.000016944039,0.000045999197,0.00009126265,0.000035397326,0.00058161217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982377,0.0008859562,0.000058357706,0.00023528634,0.00041093523,0.00017176427],"domain_scores_gemma":[0.99185395,0.0048258947,0.0009347647,0.0014426907,0.0006454962,0.00029720375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023442237,0.00087818713,0.0006832598,0.001070796,0.0006333297,0.0007929527,0.0012002393,0.001183968,0.00063810276],"category_scores_gemma":[0.011314122,0.00032470166,0.00084145647,0.00061483256,0.0014330967,0.0025265336,0.0015998419,0.0017078698,0.00017331775],"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.0004367069,0.0003335415,0.010773096,0.00012170911,0.00017118112,0.00040395468,0.0002437238,0.87025905,0.009105265,0.020619689,0.003090597,0.08444155],"study_design_scores_gemma":[0.000010100709,0.00004380971,0.00028464096,0.00000412263,0.00001151137,0.00006373625,0.00001464222,0.99379563,0.0019355556,0.0035532482,0.00027798046,0.0000050581125],"about_ca_topic_score_codex":0.0027738437,"about_ca_topic_score_gemma":0.0029670296,"teacher_disagreement_score":0.0027738437,"about_ca_system_score_codex":0.0013405752,"about_ca_system_score_gemma":0.00067656947,"threshold_uncertainty_score":0.012397587},"labels":[],"label_agreement":null},{"id":"W4409347241","doi":"10.1609/aaai.v39i15.33770","title":"Few-Shot Audio-Visual Class-Incremental Learning with Temporal Prompting and Regularization","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Instituto de Ciencias del Mar y Limnología, Universidad Nacional Autónoma de México; Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China; Institute for Catastrophic Loss Reduction","keywords":"Audio visual; Shot (pellet); Class (philosophy); Computer science; Regularization (linguistics); Artificial intelligence; Computer vision; Computer graphics (images); Speech recognition; Multimedia; Chemistry","score_opus":0.041076477094091714,"score_gpt":0.2939509568040334,"score_spread":0.25287447970994165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409347241","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.055933364,0.0012527162,0.9326597,0.00042099942,0.00020771712,0.00022450069,0.00042242958,0.005905531,0.0029731698],"genre_scores_gemma":[0.7017283,0.00045931342,0.2878711,0.00079647853,0.00018208579,0.00037034132,0.0021578367,0.00041738144,0.006017138],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990006,0.00016715357,0.00004220734,0.00043480349,0.00023096049,0.00012442427],"domain_scores_gemma":[0.99806124,0.0008586254,0.00015540604,0.00039242714,0.00035100887,0.00018129188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015663794,0.0015273999,0.0013827757,0.0006863248,0.00045903845,0.0011961677,0.0044637667,0.0018552312,0.0036750154],"category_scores_gemma":[0.0059413337,0.0005634014,0.0009837183,0.0007666298,0.00086720474,0.002337838,0.0028098673,0.003148669,0.0010320015],"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.0005834822,0.0004882987,0.002622652,0.000549082,0.00015871691,0.00023078227,0.00027090372,0.26639137,0.024187619,0.0075693005,0.011263929,0.685684],"study_design_scores_gemma":[0.000024632507,0.0000832708,0.00026479765,0.00001149759,0.000017684695,0.000054832744,0.000022750017,0.99013186,0.0042229784,0.004258459,0.00089441135,0.000012779055],"about_ca_topic_score_codex":0.0051198774,"about_ca_topic_score_gemma":0.0070151268,"teacher_disagreement_score":0.0051198774,"about_ca_system_score_codex":0.0009606764,"about_ca_system_score_gemma":0.0017325735,"threshold_uncertainty_score":0.012294173},"labels":[],"label_agreement":null},{"id":"W4409347293","doi":"10.1609/aaai.v39i15.33790","title":"Bayesian Low-Rank Learning (Bella): A Practical Approach to Bayesian Neural Networks","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Fault Detection and Control Systems","field":"Engineering","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":"Concordia University","funders":"","keywords":"BELLA; Bayesian probability; Rank (graph theory); Artificial intelligence; Variable-order Bayesian network; Machine learning; Computer science; Artificial neural network; Bayesian network; Bayesian inference; Mathematics; Physics; Combinatorics","score_opus":0.026934596482041953,"score_gpt":0.27314071739974227,"score_spread":0.24620612091770033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409347293","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.00082680257,0.00023090215,0.9971199,0.00039896392,0.000025765912,0.000030020847,0.0000638788,0.00040187835,0.0009020136],"genre_scores_gemma":[0.12640034,0.0012164316,0.8643898,0.0011035481,0.00038772816,0.000496852,0.0005243806,0.00045938502,0.00502145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99510384,0.0025453514,0.0002121728,0.00057766464,0.001325551,0.0002354001],"domain_scores_gemma":[0.99090683,0.004865156,0.00070853083,0.0016200591,0.0015584831,0.00034104788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00775141,0.002082838,0.0017862465,0.0016460709,0.001247886,0.002936483,0.0040157554,0.0027209453,0.0060052522],"category_scores_gemma":[0.028579254,0.0013417643,0.0010982346,0.0017496428,0.002799762,0.0043299743,0.0055036703,0.0065810997,0.003068785],"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.00017578,0.00014048285,0.0013463029,0.00029973176,0.0001603092,0.0001105253,0.00023249921,0.39244857,0.002384751,0.29437986,0.018852005,0.28946912],"study_design_scores_gemma":[0.000013986983,0.00004738649,0.000090820686,0.000029866083,0.000012548305,0.000043097938,0.000013355894,0.89316183,0.00072048174,0.102246724,0.0035991136,0.000020786849],"about_ca_topic_score_codex":0.007107329,"about_ca_topic_score_gemma":0.012007911,"teacher_disagreement_score":0.00775141,"about_ca_system_score_codex":0.001900674,"about_ca_system_score_gemma":0.0033968124,"threshold_uncertainty_score":0.04099381},"labels":[],"label_agreement":null},{"id":"W4409347493","doi":"10.1609/aaai.v39i16.33807","title":"OAC: Output-adaptive Calibration for Accurate Post-training Quantization","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced MRI Techniques and Applications","field":"Medicine","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":"Calibration; Quantization (signal processing); Training (meteorology); Computer science; Mathematics; Artificial intelligence; Algorithm; Statistics; Geography; Meteorology","score_opus":0.15990956219731303,"score_gpt":0.3845926615814959,"score_spread":0.22468309938418288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409347493","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.006318689,0.0004405152,0.9850358,0.00020636336,0.0001269617,0.0001049029,0.00017106884,0.0062158755,0.0013798238],"genre_scores_gemma":[0.25916308,0.00048004193,0.72931105,0.0007629047,0.00017728232,0.00039200546,0.0013139778,0.0015832736,0.0068163555],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983308,0.00031077344,0.000121218305,0.0003851946,0.00069654745,0.00015542103],"domain_scores_gemma":[0.9966011,0.0010626619,0.00023378829,0.0009376688,0.0010718588,0.0000929083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021435062,0.001707826,0.001160134,0.0009697344,0.00067800627,0.0013806946,0.0029908319,0.0015696073,0.0073211184],"category_scores_gemma":[0.01305345,0.0006655872,0.00065035676,0.0010929144,0.0012021506,0.0029770473,0.0030381256,0.0030852535,0.0028931843],"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.0003925036,0.00017601857,0.0014195752,0.00023323986,0.00009390719,0.00014595345,0.00024621535,0.12997957,0.026476929,0.013740991,0.016444162,0.81065094],"study_design_scores_gemma":[0.0000269672,0.0000574319,0.00038032877,0.000024289964,0.00001511118,0.00009371822,0.000036120153,0.9737091,0.014811345,0.0066084396,0.0042069145,0.000030199959],"about_ca_topic_score_codex":0.007736629,"about_ca_topic_score_gemma":0.011484382,"teacher_disagreement_score":0.007736629,"about_ca_system_score_codex":0.0010442577,"about_ca_system_score_gemma":0.002351891,"threshold_uncertainty_score":0.024491608},"labels":[],"label_agreement":null},{"id":"W4409347538","doi":"10.1609/aaai.v39i20.35403","title":"Are Expressive Models Truly Necessary for Offline RL?","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Multi-Agent Systems and Negotiation","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":"McGill University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science","score_opus":0.12351486251043169,"score_gpt":0.3232024866937243,"score_spread":0.1996876241832926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409347538","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.012027928,0.0007226095,0.97546446,0.0023019232,0.00017593574,0.000054760505,0.00037181182,0.0010952059,0.0077854013],"genre_scores_gemma":[0.74532455,0.0015574844,0.24151826,0.0014191825,0.0003169171,0.00038159805,0.0009707717,0.00073409925,0.0077771205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880993,0.00036498392,0.000058271,0.00030961237,0.00030517238,0.00015208403],"domain_scores_gemma":[0.99595886,0.00245014,0.00025249316,0.00094446354,0.0002067778,0.00018719623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001668702,0.0011520539,0.001300359,0.00023955024,0.00050559605,0.0024220254,0.0016731285,0.001595192,0.0063876244],"category_scores_gemma":[0.012944937,0.000895477,0.00081701326,0.000377637,0.0020028157,0.006431853,0.0024314518,0.005500487,0.001860294],"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.00029290505,0.00013995437,0.0016496554,0.0005111761,0.00013068803,0.00030637372,0.0003611158,0.57123995,0.0054545007,0.2894419,0.009889732,0.12058205],"study_design_scores_gemma":[0.00003146113,0.000044511657,0.00015069319,0.000052456653,0.00001940243,0.00005568857,0.00005134373,0.78103274,0.0012344286,0.2120326,0.005277164,0.000017563072],"about_ca_topic_score_codex":0.002595943,"about_ca_topic_score_gemma":0.0035459255,"teacher_disagreement_score":0.0063876244,"about_ca_system_score_codex":0.0007935219,"about_ca_system_score_gemma":0.0018959246,"threshold_uncertainty_score":0.021368742},"labels":[],"label_agreement":null},{"id":"W4409347567","doi":"10.1609/aaai.v39i18.34159","title":"Constrained Generative Modeling with Manually Bridged Diffusion Models","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Alliance de recherche numérique du Canada; Compute Canada; Lawrence Berkeley National Laboratory; Canadian Institute for Advanced Research; U.S. Department of Energy","keywords":"Generative grammar; Computer science; Diffusion; Generative model; Artificial intelligence; Physics","score_opus":0.058810530888649175,"score_gpt":0.2801701110198855,"score_spread":0.2213595801312363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409347567","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.0060050995,0.00006589633,0.99166965,0.00016070493,0.000017379569,0.000025490534,0.00005347212,0.00021802992,0.0017842621],"genre_scores_gemma":[0.57481414,0.00030429504,0.413573,0.0003714203,0.00009133789,0.00049140246,0.00046458235,0.00052537874,0.009364388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985776,0.0005550317,0.00006421037,0.00036715207,0.00033011922,0.00010602162],"domain_scores_gemma":[0.9961415,0.0026192782,0.00031915426,0.0005263234,0.00022358654,0.00017017065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022547932,0.001084199,0.001167345,0.0011070584,0.0008513741,0.001977664,0.0025686582,0.0027436046,0.0059698],"category_scores_gemma":[0.010591834,0.0011960572,0.0018087942,0.0010273731,0.002354253,0.0036615457,0.0037436949,0.00309112,0.0009540847],"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.000032079886,0.000023945588,0.0004160143,0.00004284567,0.000030504705,0.00010854555,0.00017844362,0.8008261,0.0015464902,0.18245071,0.00075811456,0.01358622],"study_design_scores_gemma":[0.0000053116974,0.000008733214,0.000033171338,0.000005987945,0.0000035515109,0.00002149521,0.000008573499,0.95411146,0.00023860732,0.044802412,0.00075296714,0.000007821477],"about_ca_topic_score_codex":0.0047896975,"about_ca_topic_score_gemma":0.0053331614,"teacher_disagreement_score":0.0059698,"about_ca_system_score_codex":0.0014114939,"about_ca_system_score_gemma":0.0011493241,"threshold_uncertainty_score":0.019970953},"labels":[],"label_agreement":null},{"id":"W4409347668","doi":"10.1609/aaai.v39i20.35413","title":"SimProF: A Simple Probabilistic Framework for Unsupervised Domain Adaptation","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot 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":"Artificial Intelligence in Medicine (Canada)","funders":"Natural Science Foundation of Tianjin City; National Natural Science Foundation of China","keywords":"Simple (philosophy); Computer science; Adaptation (eye); Probabilistic logic; Domain adaptation; Domain (mathematical analysis); Artificial intelligence; Psychology; Mathematics; Neuroscience","score_opus":0.08333992167115802,"score_gpt":0.32239999611772824,"score_spread":0.23906007444657024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409347668","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.0010105073,0.000056269007,0.9980673,0.000036311714,0.000008570386,0.000023679102,0.00003745344,0.00044330352,0.00031652604],"genre_scores_gemma":[0.18000719,0.00035199322,0.8144501,0.000290891,0.000120260265,0.0004618512,0.00075040373,0.00053481205,0.0030325083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983364,0.00058948563,0.000070123526,0.00044507024,0.0004744682,0.00008450223],"domain_scores_gemma":[0.9976767,0.0010101498,0.00017757068,0.000655658,0.0003664698,0.0001135644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030536563,0.0010916736,0.0010864779,0.0016357189,0.0006867174,0.0013158564,0.0031634218,0.0015275875,0.002605759],"category_scores_gemma":[0.006781782,0.00079065893,0.0016234631,0.0011206768,0.0014444608,0.0028072312,0.0040110606,0.0025731188,0.0013111782],"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.00019937597,0.00020092944,0.0016636886,0.00022246696,0.00025931318,0.00019003327,0.0001910047,0.4988038,0.013954266,0.1028757,0.006611373,0.37482804],"study_design_scores_gemma":[0.000010112969,0.000035545512,0.00021962212,0.000008911286,0.000010107705,0.00008615507,0.000009586572,0.959968,0.0021383245,0.03454989,0.0029464667,0.000017254364],"about_ca_topic_score_codex":0.0017691869,"about_ca_topic_score_gemma":0.0029609124,"teacher_disagreement_score":0.0031634218,"about_ca_system_score_codex":0.00088256603,"about_ca_system_score_gemma":0.0012800174,"threshold_uncertainty_score":0.016149461},"labels":[],"label_agreement":null},{"id":"W4409347793","doi":"10.1609/aaai.v39i18.34058","title":"Till the Layers Collapse: Compressing a Deep Neural Network Through the Lenses of Batch Normalization Layers.","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"HORIZON EUROPE Framework Programme; Instituto de Ciencias del Mar y Limnología, Universidad Nacional Autónoma de México; China Scholarship Council; European Commission; Agence Nationale de la Recherche; Institute for Catastrophic Loss Reduction","keywords":"Normalization (sociology); Artificial neural network; Geology; Materials science; Computer science; Artificial intelligence","score_opus":0.05289706677164575,"score_gpt":0.2983619473187461,"score_spread":0.24546488054710036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409347793","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.018273149,0.0012803237,0.96551746,0.00084606593,0.00053075125,0.00017143875,0.0007442512,0.009125158,0.0035114205],"genre_scores_gemma":[0.20670943,0.0013273353,0.77032524,0.0014272601,0.00040122247,0.00042433388,0.0028963396,0.0022465189,0.014242328],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915874,0.00012805198,0.000060786962,0.00019924113,0.00035168033,0.00010152743],"domain_scores_gemma":[0.9985422,0.00041421823,0.00015924063,0.0005081762,0.00027141426,0.00010473056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014058957,0.0021096757,0.0009933,0.0011093625,0.00086131133,0.0017960542,0.002677874,0.0012264192,0.0060628206],"category_scores_gemma":[0.007816244,0.0008950027,0.0013229651,0.0013667165,0.0014588209,0.005249199,0.0030430355,0.0040076277,0.0022309453],"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.0009954168,0.00021183342,0.0027812917,0.00041808357,0.0004362091,0.00050713465,0.0005133911,0.11195285,0.056930985,0.051087074,0.053888757,0.720277],"study_design_scores_gemma":[0.00007459832,0.00015187582,0.0008553336,0.00007290682,0.00012712252,0.00027802147,0.00012219671,0.8729135,0.06203528,0.038633753,0.024660528,0.00007490772],"about_ca_topic_score_codex":0.0123649435,"about_ca_topic_score_gemma":0.017180081,"teacher_disagreement_score":0.0123649435,"about_ca_system_score_codex":0.0015912615,"about_ca_system_score_gemma":0.0026095381,"threshold_uncertainty_score":0.024585962},"labels":[],"label_agreement":null},{"id":"W4409347925","doi":"10.1609/aaai.v39i23.34673","title":"Evaluating LLM Reasoning in the Operations Research Domain with ORQA","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","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":"University of British Columbia; Huawei Technologies (Canada)","funders":"","keywords":"Domain (mathematical analysis); Computer science; Management science; Mathematics; Engineering","score_opus":0.21012541076435762,"score_gpt":0.40640091708382,"score_spread":0.19627550631946236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409347925","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.4645884,0.007277479,0.4328543,0.0148128485,0.00058905175,0.0015709125,0.024042048,0.022114579,0.032150418],"genre_scores_gemma":[0.677668,0.0011450389,0.28484842,0.0024434987,0.00025158902,0.00048026335,0.031188235,0.00046373522,0.0015112165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9791829,0.012614751,0.001590378,0.002686945,0.0033947353,0.0005301687],"domain_scores_gemma":[0.8832118,0.091786206,0.0053037875,0.012129762,0.00573132,0.0018370855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026096394,0.0017044725,0.0009842414,0.004574101,0.00085776375,0.004427287,0.0030463703,0.0028389546,0.004568594],"category_scores_gemma":[0.13067158,0.00046207823,0.0018657411,0.0034084388,0.0016471392,0.006999018,0.0045166505,0.0029206853,0.0012754543],"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.0017786704,0.0021906956,0.05834325,0.0032988419,0.0010826192,0.0005103541,0.0021631166,0.52819115,0.0049142335,0.0568512,0.044477757,0.29619816],"study_design_scores_gemma":[0.00023851979,0.00029681946,0.0052162763,0.0002606897,0.00010434984,0.00014878236,0.000718595,0.9123701,0.0031165846,0.063520096,0.013954781,0.00005440595],"about_ca_topic_score_codex":0.012299332,"about_ca_topic_score_gemma":0.013219476,"teacher_disagreement_score":0.026096394,"about_ca_system_score_codex":0.0032045448,"about_ca_system_score_gemma":0.0038642776,"threshold_uncertainty_score":0.13801253},"labels":[],"label_agreement":null},{"id":"W4409347970","doi":"10.1609/aaai.v39i22.34490","title":"Efficient Communication in Multi-Agent Reinforcement Learning with Implicit Consensus Generation","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Chinese Academy of Sciences","keywords":"Reinforcement learning; Reinforcement; Computer science; Artificial intelligence; Psychology; Social psychology","score_opus":0.08210690364603603,"score_gpt":0.31301082425299065,"score_spread":0.23090392060695464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409347970","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.05137446,0.00012246105,0.9463834,0.00019851548,0.000027644634,0.00006197063,0.000012662382,0.00040445093,0.0014145361],"genre_scores_gemma":[0.93145186,0.00004202844,0.06709504,0.00008223066,0.000023470964,0.00012657416,0.000031466054,0.000034657747,0.0011127327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853814,0.00058961683,0.00007676424,0.0002444542,0.0003847455,0.00016629488],"domain_scores_gemma":[0.9954965,0.0026358615,0.0006254495,0.0004804256,0.0005382965,0.00022345968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002461618,0.00082421425,0.0010810673,0.00043162433,0.00072526105,0.0006911317,0.002214879,0.001103066,0.00088303076],"category_scores_gemma":[0.0077287885,0.00040539232,0.00031187813,0.00041328598,0.0011822607,0.0015152942,0.0022196737,0.0014815087,0.000199261],"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.00017993376,0.00010261414,0.0006485946,0.000054164793,0.000024575238,0.00009752684,0.00018117802,0.93081385,0.002364674,0.008360893,0.00049721904,0.056674723],"study_design_scores_gemma":[0.000022166294,0.000030174288,0.000039751092,0.0000020052667,0.0000026906719,0.000008850157,0.000006231206,0.99680686,0.00050978636,0.0024421022,0.00012621719,0.0000032349492],"about_ca_topic_score_codex":0.0026011383,"about_ca_topic_score_gemma":0.002015983,"teacher_disagreement_score":0.0026011383,"about_ca_system_score_codex":0.0007447994,"about_ca_system_score_gemma":0.0013302591,"threshold_uncertainty_score":0.013018429},"labels":[],"label_agreement":null},{"id":"W4409348022","doi":"10.1609/aaai.v39i23.34667","title":"Task-Agnostic Language Model Watermarking via High Entropy Passthrough Layers","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Steganography and Watermarking Techniques","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":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Digital watermarking; Task (project management); Natural language processing; Artificial intelligence; Economics; Management","score_opus":0.0272856507003193,"score_gpt":0.28169796802103203,"score_spread":0.25441231732071273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409348022","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.07041981,0.00052142504,0.9142595,0.0006106736,0.00014757838,0.000153454,0.0002815376,0.011175704,0.0024303142],"genre_scores_gemma":[0.72601813,0.00042601605,0.26190376,0.0005970931,0.00014278082,0.00024800075,0.0010739351,0.0008716766,0.008718662],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989951,0.00029027654,0.000077247896,0.00023800744,0.00026703172,0.00013235566],"domain_scores_gemma":[0.9953117,0.0015101648,0.0005589481,0.0020729357,0.0004017238,0.00014451303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025337515,0.0017689377,0.0009158454,0.0006442994,0.00053924083,0.0014316856,0.0016790312,0.0018035012,0.0026714988],"category_scores_gemma":[0.010338437,0.0006450652,0.0010169031,0.0005001506,0.0015013802,0.005328805,0.003043442,0.0029349588,0.0019085038],"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.0014617433,0.00047965953,0.0029400396,0.0002830449,0.0002526234,0.00056444877,0.0004060384,0.25537747,0.11725121,0.017578736,0.0084858425,0.59491915],"study_design_scores_gemma":[0.00003897158,0.000176072,0.00036205375,0.00002942467,0.000037396414,0.00017043852,0.000031615815,0.9227966,0.06023596,0.013831779,0.0022592952,0.000030332892],"about_ca_topic_score_codex":0.0012090714,"about_ca_topic_score_gemma":0.0021218958,"teacher_disagreement_score":0.0026714988,"about_ca_system_score_codex":0.00073824386,"about_ca_system_score_gemma":0.00081750465,"threshold_uncertainty_score":0.013399899},"labels":[],"label_agreement":null},{"id":"W4409348077","doi":"10.1609/aaai.v39i22.34489","title":"Unsupervised Translation of Emergent Communication","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Cognitive Science and Education Research","field":"Neuroscience","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Azrieli Foundation; Open Philanthropy Project; Center for Evolutionary and Theoretical Immunology","keywords":"Translation (biology); Computer science; Artificial intelligence; Natural language processing; Biology","score_opus":0.24482441013484763,"score_gpt":0.40350170817947195,"score_spread":0.15867729804462433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409348077","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.31740004,0.0001618506,0.6673564,0.0003378034,0.00015022547,0.00012267784,0.00042138368,0.0009875329,0.013062121],"genre_scores_gemma":[0.8902437,0.000074936856,0.10605867,0.00008029283,0.000024350116,0.000127678,0.00045613316,0.00025572628,0.0026786022],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999278,0.00028415758,0.00004043281,0.00020800934,0.00012291994,0.000066480476],"domain_scores_gemma":[0.9973615,0.0012203924,0.0002736164,0.00068656536,0.00039891576,0.000059033795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007234422,0.0004322722,0.0002582934,0.00034906334,0.0004564484,0.0009797488,0.0004764491,0.00038372428,0.002432067],"category_scores_gemma":[0.0077659134,0.00022422685,0.0003909561,0.00034870047,0.0010186193,0.0013805426,0.0012283343,0.00086382346,0.0005464174],"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.0005626307,0.0002569879,0.009451122,0.0006779254,0.0001521287,0.0012076589,0.0055460255,0.15260151,0.19954525,0.19319233,0.004912021,0.43189448],"study_design_scores_gemma":[0.000029410987,0.00016418641,0.0059031514,0.000041157928,0.000030813284,0.00031914812,0.0009853962,0.79634476,0.04942469,0.13800956,0.008698032,0.00004969951],"about_ca_topic_score_codex":0.00077303126,"about_ca_topic_score_gemma":0.00082721,"teacher_disagreement_score":0.002432067,"about_ca_system_score_codex":0.0005554053,"about_ca_system_score_gemma":0.00066675217,"threshold_uncertainty_score":0.008136094},"labels":[],"label_agreement":null},{"id":"W4409348085","doi":"10.1609/aaai.v39i23.34697","title":"Error Diversity Matters: An Error-Resistant Ensemble Method for Unsupervised Dependency Parsing","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Northern Alberta Institute of Technology; Mila - Quebec Artificial Intelligence Institute; Queen's University; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada; Alberta Innovates; DeepMind","keywords":"Dependency (UML); Dependency grammar; Computer science; Diversity (politics); Ensemble learning; Parsing; Artificial intelligence; Natural language processing; Statistics; Mathematics; Sociology","score_opus":0.11819926005001369,"score_gpt":0.36268660632610566,"score_spread":0.24448734627609198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409348085","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.013061811,0.00018251738,0.9835068,0.00013188968,0.00005441461,0.00004459849,0.000105030645,0.00222718,0.0006857544],"genre_scores_gemma":[0.3685923,0.00029954928,0.6245982,0.0003902964,0.00020960219,0.00019841397,0.0013463096,0.00093218824,0.0034332098],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810374,0.00062249956,0.00010298201,0.00047390614,0.0005271897,0.00016957341],"domain_scores_gemma":[0.99560636,0.0017389598,0.0002528825,0.0011985116,0.0010402323,0.0001630002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003251119,0.0016189605,0.0016345442,0.0018851829,0.001219769,0.0012802723,0.002659531,0.0018226373,0.0015918078],"category_scores_gemma":[0.007704278,0.00069792266,0.0015691806,0.001986664,0.0005619354,0.0026417673,0.0023278587,0.002707331,0.0010344052],"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.00019642874,0.00023499939,0.005185351,0.000073347575,0.0006003461,0.0003415343,0.00037150813,0.3188568,0.01219087,0.007122304,0.0094889095,0.6453376],"study_design_scores_gemma":[0.000006328912,0.000027114873,0.00043208397,0.0000075179405,0.00005560497,0.000057719695,0.000020875543,0.98947716,0.0033232472,0.0053527793,0.0012213435,0.0000182677],"about_ca_topic_score_codex":0.0039473036,"about_ca_topic_score_gemma":0.0068567377,"teacher_disagreement_score":0.0039473036,"about_ca_system_score_codex":0.00048314044,"about_ca_system_score_gemma":0.0014374972,"threshold_uncertainty_score":0.017193794},"labels":[],"label_agreement":null},{"id":"W4409348132","doi":"10.1609/aaai.v39i23.34639","title":"Prompt Compression with Context-Aware Sentence Encoding for Fast and Improved LLM Inference","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Natural Language Processing 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":"Queen's University","funders":"","keywords":"Encoding (memory); Sentence; Inference; Computer science; Context (archaeology); Compression (physics); Natural language processing; Artificial intelligence; Speech recognition; History","score_opus":0.03933237982885971,"score_gpt":0.3119017386325069,"score_spread":0.2725693588036472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409348132","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.052535955,0.0026474455,0.90831244,0.0013194922,0.00058191165,0.00034791915,0.0043792822,0.026382832,0.0034927023],"genre_scores_gemma":[0.344532,0.0010385388,0.63144696,0.0011117052,0.0004763296,0.00060243165,0.0137281995,0.0010553437,0.0060084183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926513,0.00026847274,0.00005609379,0.00020762891,0.00014842219,0.0000542295],"domain_scores_gemma":[0.9978569,0.0011892699,0.00010326512,0.0003940733,0.00038546036,0.00007105766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011320319,0.001232145,0.00071275426,0.001027822,0.00038548585,0.00077687314,0.0011430483,0.001040201,0.0070593716],"category_scores_gemma":[0.0083423285,0.00030746887,0.0007010418,0.0007237176,0.00043130617,0.0024763872,0.0013916291,0.0024939158,0.0033547524],"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.0005536999,0.00024693727,0.0020908753,0.0005092771,0.00006098711,0.00029767223,0.00040512698,0.028154802,0.04157463,0.008111493,0.0336311,0.88436335],"study_design_scores_gemma":[0.0001719509,0.0004047826,0.0019137203,0.00011201613,0.00009637655,0.00041470272,0.0002923441,0.8776525,0.060260314,0.035001878,0.023610475,0.00006884844],"about_ca_topic_score_codex":0.002423014,"about_ca_topic_score_gemma":0.004939731,"teacher_disagreement_score":0.0070593716,"about_ca_system_score_codex":0.00070631,"about_ca_system_score_gemma":0.0012352661,"threshold_uncertainty_score":0.023615956},"labels":[],"label_agreement":null},{"id":"W4409348445","doi":"10.1609/aaai.v39i27.35005","title":"Enhancing Privacy in the Early Detection of Sexual Predators Through Federated Learning and Differential Privacy","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reproductive Health and Technologies","field":"Medicine","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; McGill University; Mila - Quebec Artificial Intelligence Institute","funders":"Fonds de recherche du Québec – Nature et technologies; Compute Canada; Canadian Institute for Advanced Research","keywords":"Internet privacy; Differential privacy; Predation; Computer science; Information privacy; Computer security; Psychology; Biology; Ecology; Data mining","score_opus":0.05818353052167443,"score_gpt":0.33779325074367655,"score_spread":0.27960972022200214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409348445","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.11676299,0.0004590756,0.87449425,0.0013122923,0.00006549546,0.00013842477,0.00023204483,0.0038723797,0.0026629735],"genre_scores_gemma":[0.9124352,0.00009759654,0.08575643,0.00033715973,0.000029178504,0.000057122907,0.00016723899,0.000057534806,0.0010625442],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99518836,0.0017212512,0.00029482009,0.0011284996,0.001055313,0.0006117856],"domain_scores_gemma":[0.98414314,0.007352728,0.001149501,0.0054487796,0.0014086385,0.00049713126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065985713,0.0009102967,0.0013289592,0.0009518181,0.0013612353,0.002744474,0.0025312027,0.0018035843,0.0010001952],"category_scores_gemma":[0.021526452,0.00049820024,0.0010899127,0.00080839323,0.0022763903,0.006673406,0.0048278724,0.0029260044,0.000581303],"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.0018468406,0.0016221359,0.052645773,0.00033733173,0.00029908604,0.0008536406,0.0015464122,0.32127723,0.022150328,0.032291345,0.0058076326,0.5593222],"study_design_scores_gemma":[0.000041439234,0.00020688618,0.0021872148,0.00003663562,0.000052663407,0.00042268584,0.00016737545,0.9293718,0.017290488,0.04843339,0.0017440565,0.000045514786],"about_ca_topic_score_codex":0.0023598806,"about_ca_topic_score_gemma":0.0021272202,"teacher_disagreement_score":0.0065985713,"about_ca_system_score_codex":0.0012492357,"about_ca_system_score_gemma":0.002482357,"threshold_uncertainty_score":0.03489703},"labels":[],"label_agreement":null},{"id":"W4409348492","doi":"10.1609/aaai.v39i27.35108","title":"Certified Trustworthiness in the Era of Large Language Models","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Access Control and Trust","field":"Social Sciences","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":"Simon Fraser University","funders":"","keywords":"Trustworthiness; Certification; Computer science; Linguistics; Political science; Computer security; Philosophy; Law","score_opus":0.0646789908497029,"score_gpt":0.35335183920176866,"score_spread":0.28867284835206575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409348492","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.01832154,0.0013904249,0.9590274,0.010064586,0.0002922081,0.00017001377,0.00016972751,0.0041434537,0.0064205127],"genre_scores_gemma":[0.6149691,0.0017964316,0.37060118,0.0034347253,0.0005907233,0.00049406674,0.0006105875,0.0019062936,0.0055969404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9566506,0.02274925,0.0025885417,0.004487182,0.012039955,0.0014845151],"domain_scores_gemma":[0.8080554,0.11601795,0.006301615,0.05536311,0.011836906,0.0024249612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.035452727,0.00093188765,0.0015237724,0.001506406,0.0025564702,0.009507867,0.003367739,0.0035310409,0.0040384573],"category_scores_gemma":[0.1851844,0.0014603407,0.001786454,0.0013069833,0.009548331,0.019312846,0.011091846,0.009928705,0.0016741739],"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.00047998648,0.00013175512,0.003210258,0.0005899109,0.00017572688,0.00033155252,0.0017122821,0.09546564,0.0053180563,0.724745,0.014290558,0.15354928],"study_design_scores_gemma":[0.000055322533,0.00007018894,0.00028877915,0.00014735802,0.000043552383,0.0001407047,0.00015726217,0.28354058,0.005564841,0.6950751,0.01485763,0.000058694844],"about_ca_topic_score_codex":0.004476962,"about_ca_topic_score_gemma":0.0044751004,"teacher_disagreement_score":0.035452727,"about_ca_system_score_codex":0.007877019,"about_ca_system_score_gemma":0.007315815,"threshold_uncertainty_score":0.18749416},"labels":[],"label_agreement":null},{"id":"W4409348534","doi":"10.1609/aaai.v39i27.35100","title":"Representation-driven Option Discovery in Reinforcement Learning","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Simulation Techniques and Applications","field":"Decision Sciences","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":"Reinforcement learning; Representation (politics); Computer science; Artificial intelligence; Machine learning; Data science; Political science","score_opus":0.19708603073946998,"score_gpt":0.4407234229514519,"score_spread":0.2436373922119819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409348534","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.026598617,0.00065013784,0.9645903,0.0010327251,0.0000632485,0.000063000894,0.00008837465,0.00024150069,0.006671998],"genre_scores_gemma":[0.8280747,0.0005126409,0.16614139,0.00028127036,0.00007090365,0.00023826234,0.00015035244,0.00007855724,0.004451872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984238,0.00079918804,0.000073741685,0.0002567439,0.00029425113,0.00015220237],"domain_scores_gemma":[0.99510336,0.003658089,0.00035547354,0.0003186982,0.00032352132,0.00024086931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031073152,0.0006497527,0.0012424404,0.00056911213,0.0005637785,0.0016797772,0.0019749205,0.0019430196,0.003365717],"category_scores_gemma":[0.012131188,0.0006367004,0.0009428787,0.0007054301,0.002745181,0.0033330035,0.0022310216,0.0029429386,0.00032528167],"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.00013406438,0.000060878723,0.0007598539,0.0001067243,0.000062732564,0.00013555183,0.00021774518,0.66104424,0.00092292496,0.30734888,0.0011817152,0.028024593],"study_design_scores_gemma":[0.000024200526,0.00002628388,0.000049836388,0.0000121830235,0.0000082913675,0.000017080769,0.000011037116,0.86972606,0.0002511157,0.1292617,0.0006007808,0.000011501449],"about_ca_topic_score_codex":0.0034633575,"about_ca_topic_score_gemma":0.0028394244,"teacher_disagreement_score":0.0034633575,"about_ca_system_score_codex":0.0017640489,"about_ca_system_score_gemma":0.0015581116,"threshold_uncertainty_score":0.016433239},"labels":[],"label_agreement":null},{"id":"W4409348617","doi":"10.1609/aaai.v39i27.35071","title":"Fair Graph U-Net: A Fair Graph Learning Framework Integrating Group and Individual Awareness","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Ethics and Social Impacts of AI","field":"Social Sciences","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 Manitoba","funders":"National Science Foundation","keywords":"Graph; Computer science; Theoretical computer science","score_opus":0.09602027164076475,"score_gpt":0.3724456571107644,"score_spread":0.2764253854699996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409348617","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.007944178,0.0002908299,0.98787075,0.00045792927,0.00007732529,0.000107828346,0.0002536303,0.0011097838,0.0018877463],"genre_scores_gemma":[0.49487266,0.0005936339,0.49138117,0.0010435265,0.0002683852,0.0004309439,0.0014940572,0.000543865,0.009371729],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827576,0.00065467786,0.000047786183,0.0005595572,0.0002986722,0.0001634341],"domain_scores_gemma":[0.99696916,0.0012860952,0.00025331223,0.0008177831,0.00042599716,0.0002477853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004538126,0.0016513286,0.0017637191,0.0021955997,0.0015335061,0.002138078,0.0047931923,0.002170402,0.0037940734],"category_scores_gemma":[0.010364566,0.00067723973,0.0012267148,0.0019910668,0.0021500958,0.005889787,0.0033755007,0.0029252658,0.0008969363],"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.00038984857,0.00034304938,0.003515919,0.00019654866,0.00024257145,0.00018647972,0.00038468232,0.5377187,0.0022204134,0.1316888,0.017087417,0.30602556],"study_design_scores_gemma":[0.0000134201555,0.000039135095,0.00015976372,0.000014336834,0.000023981465,0.000025957783,0.000026231073,0.9021618,0.00087577413,0.09472032,0.0019276873,0.0000115993],"about_ca_topic_score_codex":0.009665889,"about_ca_topic_score_gemma":0.016505938,"teacher_disagreement_score":0.009665889,"about_ca_system_score_codex":0.0028090067,"about_ca_system_score_gemma":0.0026187457,"threshold_uncertainty_score":0.024000168},"labels":[],"label_agreement":null},{"id":"W4409348648","doi":"10.1609/aaai.v39i27.35002","title":"FoMo: Multi-Modal, Multi-Scale and Multi-Task Remote Sensing Foundation Models for Forest Monitoring","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Remote Sensing and LiDAR Applications","field":"Environmental 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":"McGill University; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Modal; Foundation (evidence); Scale (ratio); Task (project management); Computer science; Remote sensing; Environmental science; Geography; Engineering; Systems engineering; Cartography","score_opus":0.08754993736504134,"score_gpt":0.32542202840129647,"score_spread":0.23787209103625512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409348648","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.19441749,0.0034368602,0.7398091,0.002283082,0.00045145897,0.00051243877,0.016124409,0.034811497,0.008153677],"genre_scores_gemma":[0.68798184,0.00073687744,0.27233732,0.0009666784,0.00018496014,0.0006775207,0.0315389,0.0007662035,0.004809739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970895,0.000067476285,0.000016438637,0.00009243687,0.0000580928,0.000056610115],"domain_scores_gemma":[0.99937904,0.00033966714,0.00005160651,0.0000841762,0.00010094884,0.00004455871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001093433,0.0015566242,0.0006522773,0.00078095106,0.00044170092,0.0006721385,0.002323125,0.0014784152,0.0023827052],"category_scores_gemma":[0.0029268751,0.00047563575,0.0012824972,0.0007167264,0.00042908738,0.0016409835,0.001254696,0.0020438072,0.00081787235],"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.0002713644,0.0002960154,0.006030599,0.0002032042,0.00018617265,0.00013344768,0.00006539608,0.80955726,0.0026422658,0.0033195466,0.026265483,0.15102924],"study_design_scores_gemma":[0.000012931733,0.000030438725,0.00057008857,0.000012162648,0.00000864659,0.000019239875,0.00000840608,0.99596906,0.00047646632,0.0016441835,0.0012408994,0.00000745997],"about_ca_topic_score_codex":0.024618953,"about_ca_topic_score_gemma":0.034726154,"teacher_disagreement_score":0.024618953,"about_ca_system_score_codex":0.0010539351,"about_ca_system_score_gemma":0.0011596781,"threshold_uncertainty_score":0.048951328},"labels":[],"label_agreement":null},{"id":"W4409348649","doi":"10.1609/aaai.v39i27.35056","title":"GIST: Gear Type Identification by Spatiotemporal Trajectory Transformation for Monitoring Fisheries","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Marine animal studies overview","field":"Environmental 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":"Simon Fraser University","funders":"","keywords":"Identification (biology); GiST; Trajectory; Fishery; Transformation (genetics); Computer science; Artificial intelligence; Biology; Medicine; Ecology; Gene; Internal medicine; Physics; Genetics","score_opus":0.0665136676952379,"score_gpt":0.2992368102386213,"score_spread":0.23272314254338342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409348649","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.04012289,0.00029397677,0.9387626,0.00011896916,0.00010563671,0.0001507324,0.00486907,0.013465124,0.0021110142],"genre_scores_gemma":[0.3484745,0.00054983184,0.6293153,0.00010725981,0.000059738544,0.00034207787,0.016510671,0.00063509744,0.0040055057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997353,0.00002212473,0.000020367916,0.00010077222,0.000090611094,0.000030782954],"domain_scores_gemma":[0.9997445,0.00004449923,0.00005160259,0.000061032122,0.00007792434,0.000020451644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027061123,0.0008106167,0.0002926178,0.0016313058,0.0002001304,0.0005170376,0.000684231,0.0003801035,0.0024881293],"category_scores_gemma":[0.00121146,0.00020625329,0.00071764906,0.0010888127,0.0002453503,0.0009587539,0.0008796993,0.00055638154,0.0015804748],"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.00028993748,0.0001822985,0.024602663,0.00029035725,0.000162692,0.00051819,0.00034124232,0.048956484,0.06868498,0.0056162393,0.018073602,0.8322812],"study_design_scores_gemma":[0.000021495298,0.000122032834,0.01827716,0.000056375316,0.000050627314,0.00053294585,0.00031983704,0.8911289,0.05439206,0.0090307575,0.02601239,0.00005552803],"about_ca_topic_score_codex":0.0074099265,"about_ca_topic_score_gemma":0.010130154,"teacher_disagreement_score":0.0074099265,"about_ca_system_score_codex":0.000380282,"about_ca_system_score_gemma":0.0007009529,"threshold_uncertainty_score":0.014733613},"labels":[],"label_agreement":null},{"id":"W4409348651","doi":"10.1609/aaai.v39i27.35103","title":"Automated, Interpretable, and Scalable Scientific Machine Learning","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Scientific Computing and Data Management","field":"Decision Sciences","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":"Simon Fraser University","funders":"","keywords":"Computer science; Scalability; Machine learning; Artificial intelligence; Data science; Operating system","score_opus":0.11891463501758465,"score_gpt":0.3751937663386241,"score_spread":0.25627913132103947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409348651","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.005905221,0.00052345823,0.96694875,0.0020615757,0.0001442513,0.0001616202,0.001312056,0.016474402,0.006468639],"genre_scores_gemma":[0.12267425,0.0007966911,0.86692935,0.0003871073,0.00026406697,0.00034498615,0.004430198,0.001354754,0.0028185255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99657094,0.0008388159,0.00022864266,0.00055972463,0.0016148019,0.0001869408],"domain_scores_gemma":[0.99121815,0.0028517146,0.00049046223,0.0035942597,0.0016512834,0.0001940333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034964737,0.001382386,0.0011716193,0.0017283058,0.001050682,0.0038610208,0.0042275186,0.001607616,0.00596316],"category_scores_gemma":[0.016428733,0.00092338247,0.0014400039,0.0021805302,0.0016419597,0.006539358,0.0035356896,0.0030566102,0.0040428923],"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.00027363776,0.00037657018,0.0021130964,0.0006659256,0.00017847183,0.0003171477,0.00026875245,0.23406668,0.021533169,0.18004592,0.05990687,0.50025374],"study_design_scores_gemma":[0.000042760596,0.000025041232,0.00020967165,0.000028069277,0.000020024292,0.000043615037,0.000052523945,0.75652534,0.0065663583,0.22182353,0.014644848,0.000018289498],"about_ca_topic_score_codex":0.002820021,"about_ca_topic_score_gemma":0.0054000807,"teacher_disagreement_score":0.00596316,"about_ca_system_score_codex":0.001809483,"about_ca_system_score_gemma":0.0043331576,"threshold_uncertainty_score":0.019948721},"labels":[],"label_agreement":null},{"id":"W4409348661","doi":"10.1609/aaai.v39i27.35029","title":"J&H: Evaluating the Robustness of Large Language Models Under Knowledge-Injection Attacks in Legal Domain","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Robustness (evolution); Computer science; Computer security; Chemistry; Biochemistry","score_opus":0.12608340550399452,"score_gpt":0.3864990687183631,"score_spread":0.2604156632143686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409348661","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.84738815,0.0014916083,0.12591523,0.0015360268,0.00043610128,0.0010965654,0.0034976385,0.013252314,0.005386269],"genre_scores_gemma":[0.9184914,0.00014175505,0.07607382,0.00043547046,0.000058928137,0.0002680238,0.0033833645,0.00031835993,0.0008288327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97263116,0.013568765,0.0026070615,0.00381951,0.00624784,0.001125711],"domain_scores_gemma":[0.8271473,0.13525984,0.009048958,0.019833704,0.0056934557,0.0030167534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026228398,0.001694125,0.00095285196,0.003118367,0.0011463261,0.002817942,0.0028270264,0.0034778721,0.0018342119],"category_scores_gemma":[0.13080223,0.0007218606,0.0017127726,0.0012606364,0.003183741,0.007326817,0.0040066913,0.003698647,0.0007757114],"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.008037885,0.003546554,0.115631245,0.0019338392,0.0026219506,0.0012328529,0.002995183,0.5490549,0.030523002,0.011997568,0.020387404,0.2520376],"study_design_scores_gemma":[0.00017294603,0.0009172425,0.008643008,0.000046803656,0.00016388873,0.00021792465,0.00034349618,0.9684803,0.013819602,0.0056074723,0.001496343,0.000091026195],"about_ca_topic_score_codex":0.015017259,"about_ca_topic_score_gemma":0.009502847,"teacher_disagreement_score":0.026228398,"about_ca_system_score_codex":0.002116651,"about_ca_system_score_gemma":0.0027506524,"threshold_uncertainty_score":0.13871068},"labels":[],"label_agreement":null},{"id":"W4409360763","doi":"10.1609/aaai.v39i28.35290","title":"Acoustic-to-Hyper-Spectral: Hyper-Spectral Image Construction from Frequency Spectrums Through Simulated Annealing (Student Abstract)","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Image and Signal Denoising Methods","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":"Future Earth","funders":"Buddhist Tzu Chi Medical Foundation; Australian Government","keywords":"Acoustics; Spectral analysis; Image (mathematics); Simulated annealing; Materials science; Physics; Optics; Computer science; Artificial intelligence; Algorithm; Spectroscopy","score_opus":0.05001609639171381,"score_gpt":0.330579311607215,"score_spread":0.2805632152155012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409360763","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.020888781,0.00006055949,0.97635084,0.00011190638,0.000025538679,0.000038452486,0.000032788404,0.0007450191,0.0017461162],"genre_scores_gemma":[0.34560344,0.000097462056,0.6507822,0.00014424813,0.000017836175,0.00017442294,0.00015485988,0.00046163957,0.0025639012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996954,0.00010748612,0.000014550953,0.00007791725,0.000076057586,0.000028632898],"domain_scores_gemma":[0.99914575,0.00043140064,0.00006855138,0.00017967238,0.00013159962,0.000042990505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007825494,0.0004824697,0.00046710024,0.0004410847,0.00035895503,0.0007957242,0.0010427212,0.0008666575,0.0030323768],"category_scores_gemma":[0.0024346667,0.00043108338,0.00083881983,0.00032060227,0.00093952613,0.0008484514,0.0008991294,0.0010324784,0.0005950556],"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.00008752875,0.00007736654,0.0007635046,0.000072346775,0.00005874296,0.00005172778,0.00013395815,0.89750534,0.01899716,0.0186843,0.0011442214,0.06242385],"study_design_scores_gemma":[0.0000051422835,0.000015273894,0.00009049703,0.00000424201,0.0000043261175,0.000011272632,0.00000791708,0.99060553,0.0044601997,0.004078086,0.00071253453,0.000005013567],"about_ca_topic_score_codex":0.002334765,"about_ca_topic_score_gemma":0.003154726,"teacher_disagreement_score":0.0030323768,"about_ca_system_score_codex":0.0008947252,"about_ca_system_score_gemma":0.0006545166,"threshold_uncertainty_score":0.010144353},"labels":[],"label_agreement":null},{"id":"W4409360777","doi":"10.1609/aaai.v39i28.35369","title":"StarVector: Generating Scalable Vector Graphics Code from Images and Text","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Astronomical Observations and Instrumentation","field":"Engineering","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":"Mila - Quebec Artificial Intelligence Institute; École de Technologie Supérieure","funders":"","keywords":"Scalable Vector Graphics; Computer science; Vector graphics; Graphics; Code (set theory); Computer graphics (images); Scalability; Programming language; Artificial intelligence; Information retrieval; World Wide Web; Database","score_opus":0.03673453085147426,"score_gpt":0.25712400856119444,"score_spread":0.22038947770972017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409360777","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.011312042,0.000104202154,0.83225834,0.00019662133,0.00012652452,0.00026687203,0.0018618744,0.14793405,0.005939546],"genre_scores_gemma":[0.1808527,0.00026354738,0.7711635,0.00032311262,0.000045895566,0.0005678453,0.011508714,0.026295906,0.008978798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941254,0.00008522834,0.00004266669,0.00014115548,0.00026116084,0.00005732108],"domain_scores_gemma":[0.99884534,0.00044811176,0.0000677907,0.00026353408,0.0003100802,0.00006516342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091650797,0.0012726501,0.00038932185,0.0006839226,0.00034568761,0.0012247277,0.002493259,0.0008629074,0.016081998],"category_scores_gemma":[0.0049859583,0.0006482793,0.0010480988,0.000566846,0.00094689615,0.0018083492,0.0016768363,0.0013431419,0.006661279],"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.00088104804,0.00045013631,0.0077783363,0.0012668037,0.00014622534,0.0007936593,0.0010691884,0.17848662,0.058577333,0.104314305,0.19565038,0.45058605],"study_design_scores_gemma":[0.00012212245,0.00012643478,0.0004601072,0.000054049015,0.000019752222,0.00014648688,0.000065892695,0.8950757,0.04990582,0.021265307,0.032714564,0.000043753906],"about_ca_topic_score_codex":0.0038945228,"about_ca_topic_score_gemma":0.0046971724,"teacher_disagreement_score":0.016081998,"about_ca_system_score_codex":0.00065808283,"about_ca_system_score_gemma":0.0011442973,"threshold_uncertainty_score":0.05379963},"labels":[],"label_agreement":null},{"id":"W4409360835","doi":"10.1609/aaai.v39i28.35275","title":"Algorithm Selection for Word-Level Hardware Model Checking (Student Abstract)","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Deutsche Forschungsgemeinschaft","keywords":"Selection (genetic algorithm); Computer science; Word (group theory); Programming language; Arithmetic; Natural language processing; Artificial intelligence; Mathematics","score_opus":0.15450902196768995,"score_gpt":0.37692259502137576,"score_spread":0.2224135730536858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409360835","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.016252723,0.00027595263,0.9557929,0.0004029141,0.00012369842,0.00012756274,0.0003461977,0.023272214,0.003405812],"genre_scores_gemma":[0.357534,0.00014784953,0.63374686,0.0005404018,0.00013736951,0.00028234549,0.001284187,0.0032018295,0.0031252678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99155444,0.0034146872,0.0007228331,0.0012539687,0.0023477173,0.00070639915],"domain_scores_gemma":[0.9897357,0.0060222275,0.0006864029,0.0023922632,0.0010185353,0.00014474711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039259363,0.0014023848,0.00092854985,0.0015108249,0.0006307876,0.002250589,0.0025730552,0.0010563838,0.011496856],"category_scores_gemma":[0.015714651,0.00070783455,0.002035207,0.0011884419,0.0012065731,0.0040997444,0.0024759737,0.0017374669,0.0031911011],"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.0014531683,0.00032603435,0.0046715653,0.0010397426,0.0002505561,0.00029043513,0.0002220958,0.10930038,0.03487075,0.11914599,0.037136454,0.69129294],"study_design_scores_gemma":[0.00020835243,0.00025858416,0.00039380745,0.00012584706,0.000070206544,0.00019015935,0.00004472868,0.80675584,0.06718089,0.11282786,0.011879964,0.000063753076],"about_ca_topic_score_codex":0.0010577398,"about_ca_topic_score_gemma":0.0018847308,"teacher_disagreement_score":0.011496856,"about_ca_system_score_codex":0.0013775765,"about_ca_system_score_gemma":0.0018825649,"threshold_uncertainty_score":0.03846079},"labels":[],"label_agreement":null},{"id":"W4409361076","doi":"10.1609/aaai.v39i28.35176","title":"Comparing Artificial Intelligence Curricula in Canadian and US Universities","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Curriculum; Mathematics education; Political science; Engineering ethics; Computer science; Psychology; Artificial intelligence; Engineering; Pedagogy","score_opus":0.17897359819545466,"score_gpt":0.37383681083383874,"score_spread":0.19486321263838408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409361076","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"incentives","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"incentives","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89857495,0.0018709494,0.00062937546,0.0053224047,0.00014140665,0.00012353978,0.0069408608,0.00013595908,0.08626045],"genre_scores_gemma":[0.9813596,0.0013181282,0.00066500995,0.0006528301,0.000029467381,0.00005289449,0.004297568,0.000045550616,0.011578927],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9934842,0.0003389512,0.00023002361,0.00043426448,0.0029086901,0.0026038692],"domain_scores_gemma":[0.97480804,0.0014232659,0.0018026382,0.00036550485,0.011965617,0.009635048],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0023069386,0.0003873465,0.00044195552,0.009148742,0.0069710836,0.0045260377,0.0018593372,0.0007225799,0.007508794],"category_scores_gemma":[0.014441092,0.00033933914,0.00072048674,0.017561212,0.0015484124,0.0011434283,0.0026053542,0.0010034173,0.0008092549],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000740119,0.00044272435,0.750081,0.00033966196,0.0001304009,0.00026815434,0.020436931,0.0031163772,0.0013246794,0.03172785,0.046515122,0.14487699],"study_design_scores_gemma":[0.00003121002,0.0000683775,0.92864376,0.00022270119,0.0000433138,0.00007389225,0.01895294,0.0010326344,0.0005646564,0.0005903226,0.049708348,0.000067818015],"about_ca_topic_score_codex":0.98755395,"about_ca_topic_score_gemma":0.99544,"teacher_disagreement_score":0.99769306,"about_ca_system_score_codex":0.12949422,"about_ca_system_score_gemma":0.1358286,"threshold_uncertainty_score":0.9395507},"labels":[],"label_agreement":null},{"id":"W4409361081","doi":"10.1609/aaai.v39i28.35203","title":"Stress-Testing of Multimodal Models in Medical Image-Based Report Generation","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Fundação para a Ciência e a Tecnologia; Ministério da Ciência, Tecnologia e Ensino Superior; European Commission","keywords":"Stress testing (software); Computer science; Stress (linguistics); Artificial intelligence; Computer vision; Linguistics; Programming language; Philosophy","score_opus":0.11769881698210594,"score_gpt":0.33288271202371394,"score_spread":0.215183895041608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409361081","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.298064,0.00024592265,0.6920182,0.0019785059,0.00015985424,0.0002629325,0.00019202201,0.003512545,0.0035659582],"genre_scores_gemma":[0.93449557,0.00006489663,0.06419389,0.00020273613,0.00004413789,0.00012422154,0.00015523785,0.00022459749,0.00049474987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9881052,0.0071461154,0.0005970603,0.0012141092,0.002481341,0.000456088],"domain_scores_gemma":[0.9062104,0.070538454,0.004325886,0.0121510215,0.0053812517,0.0013929701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01568874,0.0008912881,0.0006323767,0.0007382428,0.00056416716,0.0028289938,0.002378462,0.0021354894,0.0035529344],"category_scores_gemma":[0.13948667,0.0006399833,0.0008124232,0.00044578093,0.0025313233,0.005305213,0.0033907099,0.0018327555,0.0009620388],"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.0044171666,0.0016080632,0.04590237,0.0005810865,0.0003534731,0.0015807776,0.0080623925,0.28517506,0.061946455,0.10486687,0.0062648035,0.47924152],"study_design_scores_gemma":[0.000058780268,0.0004305099,0.0019633938,0.000050074388,0.000042283766,0.00016919927,0.00034569376,0.9292371,0.024921725,0.04136897,0.0013529386,0.000059234335],"about_ca_topic_score_codex":0.0017175947,"about_ca_topic_score_gemma":0.0010335088,"teacher_disagreement_score":0.01568874,"about_ca_system_score_codex":0.0011521993,"about_ca_system_score_gemma":0.0013247448,"threshold_uncertainty_score":0.08297092},"labels":[],"label_agreement":null},{"id":"W4409361110","doi":"10.1609/aaai.v39i28.35174","title":"Bridging the AI Gap: Evaluating the Impact of an AI Education Program for Caregivers on Parental Leave","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Intergenerational Family Dynamics and Caregiving","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institute for Advanced Research","keywords":"Bridging (networking); Psychology; Computer science; Computer security","score_opus":0.07601354849400364,"score_gpt":0.43553427242186954,"score_spread":0.3595207239278659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409361110","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.9956671,0.0002148453,0.00018676108,0.00047149975,0.000073121766,0.002371225,0.00012264514,0.000013049451,0.0008797525],"genre_scores_gemma":[0.9877324,0.00065114524,0.002150995,0.00040399347,0.00006209714,0.0082044955,0.00018921291,0.000007644546,0.0005980473],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99337363,0.0034715766,0.0003940553,0.00032412313,0.00077662943,0.0016599637],"domain_scores_gemma":[0.98588437,0.004328219,0.0014140947,0.00076795707,0.002001261,0.005604198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011175085,0.00094094157,0.0010104789,0.0012019359,0.0046901046,0.0020454505,0.0017657157,0.0016211794,0.0029916086],"category_scores_gemma":[0.02809965,0.0005510729,0.0013938725,0.0008118199,0.0015741332,0.0021081867,0.0035004301,0.0028225833,0.00043388474],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.030524397,0.2840535,0.1534657,0.00368751,0.0005110111,0.0014368844,0.07002578,0.0025699409,0.0016603571,0.002569066,0.004963969,0.44453198],"study_design_scores_gemma":[0.017566727,0.4068245,0.30335495,0.0045249965,0.0011638943,0.00045815654,0.2308964,0.0029858956,0.0060320543,0.0027452533,0.023123123,0.00032406504],"about_ca_topic_score_codex":0.012535473,"about_ca_topic_score_gemma":0.01862425,"teacher_disagreement_score":0.012535473,"about_ca_system_score_codex":0.0060304655,"about_ca_system_score_gemma":0.01743554,"threshold_uncertainty_score":0.05910021},"labels":[],"label_agreement":null},{"id":"W4409361128","doi":"10.1609/aaai.v39i28.35265","title":"High School Course Scheduling: Student Preferences and Fairness Constraints (Student Abstract)","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","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":"Course (navigation); Computer science; Scheduling (production processes); Mathematics education; Psychology; Operations management; Economics; Engineering","score_opus":0.15069941612155238,"score_gpt":0.417552881993605,"score_spread":0.2668534658720526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409361128","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.6798919,0.00010179254,0.2992834,0.0011800267,0.000049591505,0.000097868375,0.00022430813,0.00008954651,0.019081544],"genre_scores_gemma":[0.98815656,0.000021902213,0.010196001,0.00003343596,0.000009347181,0.0000223599,0.000031096624,0.0000070449187,0.0015224066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989052,0.0006786609,0.00003321027,0.00014104454,0.00010335389,0.0001385733],"domain_scores_gemma":[0.99669504,0.0021237663,0.00039173302,0.00020500625,0.00026394989,0.0003204179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022379723,0.0002157432,0.00022736267,0.00023342857,0.00048255367,0.0011744587,0.0005465416,0.00044336697,0.0045196726],"category_scores_gemma":[0.0067188516,0.0001424252,0.00026732168,0.0004356989,0.0005651275,0.0010639447,0.00052756065,0.0006581459,0.00017136015],"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.0006345073,0.00057350297,0.04243459,0.00010132674,0.00006620185,0.00023497356,0.0006238944,0.67131424,0.0033517582,0.17946841,0.0055046543,0.095691904],"study_design_scores_gemma":[0.000043550306,0.00021190716,0.008261689,0.000016458605,0.000024162193,0.00006662475,0.0004980837,0.9201893,0.0016644447,0.06566704,0.003332587,0.000024170582],"about_ca_topic_score_codex":0.0045248605,"about_ca_topic_score_gemma":0.0064528366,"teacher_disagreement_score":0.0045248605,"about_ca_system_score_codex":0.0011452226,"about_ca_system_score_gemma":0.001077227,"threshold_uncertainty_score":0.015119791},"labels":[],"label_agreement":null},{"id":"W4409361287","doi":"10.1609/aaai.v39i28.35232","title":"Kernel Representation Learning for Time Sequence: Algorithm, Theory, and Applications","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Time Series Analysis and Forecasting","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Sequence (biology); Kernel (algebra); Algorithm; Representation (politics); Artificial intelligence; Theoretical computer science; Machine learning; Mathematics; Discrete mathematics","score_opus":0.05029150248393942,"score_gpt":0.31867657723848647,"score_spread":0.26838507475454704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409361287","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.003151452,0.0007523877,0.99497306,0.00030713828,0.000034290733,0.000025379466,0.000043431508,0.00031758644,0.00039533584],"genre_scores_gemma":[0.3795649,0.0034784742,0.6084941,0.00034083016,0.0002754607,0.00041068235,0.0008631046,0.00036559813,0.006206822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990501,0.00039034084,0.000063054125,0.00021144218,0.00020110354,0.00008401186],"domain_scores_gemma":[0.99585044,0.0026642382,0.00035076466,0.00039980724,0.00059890794,0.00013582625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002381614,0.00078299845,0.0012593584,0.0010661818,0.00046358377,0.0015862874,0.0015830857,0.0014519701,0.0029879385],"category_scores_gemma":[0.011683926,0.00044794034,0.00083926594,0.0020058793,0.0009508966,0.0032535442,0.0021044922,0.0034862857,0.0013468548],"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.00015890627,0.00015294514,0.0019411684,0.000314278,0.000104298626,0.00009432972,0.00021728706,0.46235308,0.0023146009,0.12021317,0.008605082,0.4035308],"study_design_scores_gemma":[0.0000058576866,0.000017203765,0.0000949674,0.000011184822,0.000005385506,0.000021461294,0.000010197852,0.96472055,0.00033675178,0.033806555,0.0009610161,0.00000878581],"about_ca_topic_score_codex":0.005081276,"about_ca_topic_score_gemma":0.0026553874,"teacher_disagreement_score":0.005081276,"about_ca_system_score_codex":0.001485629,"about_ca_system_score_gemma":0.0015879899,"threshold_uncertainty_score":0.012595296},"labels":[],"label_agreement":null},{"id":"W4409361347","doi":"10.1609/aaai.v39i27.35008","title":"Leveraging Computer Vision and Visual LLMs for Cost-Effective and Consistent Street Food Safety Assessment in Kolkata India","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Smart Agriculture and AI","field":"Agricultural and Biological Sciences","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":"Université Laval","funders":"","keywords":"Optometry; Business; Computer science; Advertising; Risk analysis (engineering); Medicine","score_opus":0.040112041335847524,"score_gpt":0.3035250406704919,"score_spread":0.2634129993346444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409361347","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.64180726,0.0005608629,0.3031246,0.0016503136,0.00017003676,0.0006712212,0.002552701,0.033564586,0.015898371],"genre_scores_gemma":[0.84438163,0.0002621797,0.14401987,0.00045851318,0.0000261135,0.00026099596,0.0015313355,0.00022802257,0.0088314265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994512,0.000097090044,0.000029647526,0.00017337497,0.0001468361,0.00010191829],"domain_scores_gemma":[0.9995437,0.000130566,0.000044538607,0.00007999773,0.00015595811,0.000045178374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048414295,0.0005157281,0.00036610916,0.0010124202,0.00044618902,0.0011811694,0.0011631232,0.00060192746,0.002727111],"category_scores_gemma":[0.0009569351,0.00029094255,0.0004655768,0.0005452125,0.0004698085,0.00077822653,0.0015896207,0.00050302764,0.0018860499],"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.001189943,0.0007044017,0.017536962,0.0007515678,0.00015562713,0.0021343601,0.0018222576,0.03310569,0.22597192,0.0023262189,0.017252428,0.6970486],"study_design_scores_gemma":[0.00016830025,0.00085131754,0.070027374,0.0001823905,0.0002665144,0.0012610132,0.0040703947,0.67933804,0.20813599,0.0041924464,0.03117,0.00033625064],"about_ca_topic_score_codex":0.039412297,"about_ca_topic_score_gemma":0.05649308,"teacher_disagreement_score":0.039412297,"about_ca_system_score_codex":0.0012671086,"about_ca_system_score_gemma":0.0018097104,"threshold_uncertainty_score":0.07836574},"labels":[],"label_agreement":null},{"id":"W4409361355","doi":"10.1609/aaai.v39i27.35016","title":"Constraint Optimisation Approaches for Designing Group-Living Captive Breeding Programmes","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Optimization and Mathematical Programming","field":"Engineering","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":"MacEwan University","funders":"","keywords":"Group (periodic table); Constraint (computer-aided design); Computer science; Engineering; Chemistry; Mechanical engineering","score_opus":0.10264776827526068,"score_gpt":0.28391618218217407,"score_spread":0.1812684139069134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409361355","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.0126666585,0.00067706755,0.9772922,0.0004090544,0.000052924766,0.00023605998,0.00040901444,0.00026877978,0.007988214],"genre_scores_gemma":[0.20293522,0.0009264184,0.78990024,0.00034541337,0.00006454082,0.0011203957,0.0009147429,0.00038694183,0.0034061696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983157,0.0009044339,0.0000780957,0.00027844857,0.00027894322,0.00014445584],"domain_scores_gemma":[0.994873,0.0041557928,0.00028554475,0.00015557984,0.0003802178,0.00014977757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025982216,0.0021894823,0.0010403199,0.0011839996,0.00074266957,0.0019791534,0.0024770845,0.0017393501,0.0058853803],"category_scores_gemma":[0.007915323,0.0010742069,0.0014011667,0.0017441564,0.0013019156,0.0013339925,0.0017523182,0.002166667,0.0005439812],"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.000016067159,0.00003148135,0.00045654742,0.00013796515,0.00004421548,0.00009123646,0.00006285583,0.9750949,0.0004101082,0.009479051,0.0008632404,0.013312353],"study_design_scores_gemma":[0.000016041211,0.000028831282,0.00015626557,0.00003794973,0.000016934027,0.0000273381,0.000080116544,0.9838119,0.00027270903,0.012175874,0.003366454,0.000009496131],"about_ca_topic_score_codex":0.01203086,"about_ca_topic_score_gemma":0.013057905,"teacher_disagreement_score":0.01203086,"about_ca_system_score_codex":0.001411748,"about_ca_system_score_gemma":0.0018374188,"threshold_uncertainty_score":0.023921669},"labels":[],"label_agreement":null},{"id":"W4409361367","doi":"10.1609/aaai.v39i26.34929","title":"Scaling Trends for Data Poisoning in LLMs","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institut de Valorisation des Données","keywords":"Scaling; Environmental health; Environmental science; Medicine; Mathematics","score_opus":0.4474056700080657,"score_gpt":0.47659557237862205,"score_spread":0.029189902370556353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409361367","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.93367225,0.0013850151,0.0430931,0.0037052024,0.00024348545,0.00015178787,0.001247469,0.011415744,0.005085964],"genre_scores_gemma":[0.9814243,0.00019689441,0.015839132,0.00039192734,0.000027681175,0.000058447895,0.0009643858,0.00041699328,0.000680229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949307,0.0016758372,0.00038244738,0.0011380785,0.0014765048,0.00039633465],"domain_scores_gemma":[0.9640507,0.015421138,0.0023373673,0.01427453,0.0029293988,0.0009868855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007427972,0.00094742357,0.0007041634,0.0013195606,0.0008524838,0.0020204182,0.0016969742,0.0013006477,0.0016841962],"category_scores_gemma":[0.055518575,0.0006410354,0.00094439136,0.00094365474,0.0022047712,0.0052072187,0.0030881604,0.0036855917,0.00071072555],"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.0016432675,0.00087111094,0.20423315,0.0007307006,0.0007111726,0.0011244109,0.00238094,0.54972285,0.033399276,0.015183671,0.028339116,0.16166031],"study_design_scores_gemma":[0.00013881578,0.0011179405,0.021755317,0.000120942954,0.00014497258,0.0006497977,0.0009010086,0.913922,0.028480856,0.020253116,0.012423524,0.00009163899],"about_ca_topic_score_codex":0.004394704,"about_ca_topic_score_gemma":0.004044876,"teacher_disagreement_score":0.007427972,"about_ca_system_score_codex":0.0011820546,"about_ca_system_score_gemma":0.0012149423,"threshold_uncertainty_score":0.039283335},"labels":[],"label_agreement":null},{"id":"W4409361388","doi":"10.1609/aaai.v39i26.34944","title":"Joint Scoring Rules: Competition Between Agents Avoids Performative Prediction","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Multi-Agent Systems and Negotiation","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":"Performative utterance; Joint (building); Competition (biology); Computer science; Artificial intelligence; Epistemology; Engineering; Philosophy; Structural engineering","score_opus":0.10790966753100602,"score_gpt":0.3036342043271588,"score_spread":0.19572453679615281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409361388","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.18324861,0.00013901135,0.7989988,0.00094141497,0.00007696641,0.00026121142,0.00010053881,0.00074357796,0.015489951],"genre_scores_gemma":[0.9413502,0.000033187243,0.05519649,0.00019150795,0.000029501865,0.00019040472,0.0000701296,0.00006417626,0.002874298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9900643,0.004663251,0.00049867184,0.001745773,0.0020165194,0.0010114124],"domain_scores_gemma":[0.9795068,0.01020795,0.0021685374,0.0047184243,0.0018475782,0.0015506798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010648295,0.001440135,0.001971206,0.0005947531,0.0011672709,0.0025730368,0.0037014524,0.0019573532,0.0043847132],"category_scores_gemma":[0.031020403,0.0007301192,0.0006516442,0.00064367516,0.0029575245,0.0036477437,0.0038794982,0.0027786011,0.0011576423],"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.0010010948,0.000782724,0.0074473033,0.00024689824,0.00028188413,0.00046983286,0.0008081296,0.5452967,0.010991142,0.2551211,0.0045949155,0.17295821],"study_design_scores_gemma":[0.00009380344,0.00017868681,0.0004869075,0.00001598301,0.00003287185,0.000070526134,0.00003696375,0.90495384,0.0020787697,0.09117959,0.00084243034,0.0000295969],"about_ca_topic_score_codex":0.002037501,"about_ca_topic_score_gemma":0.002296171,"teacher_disagreement_score":0.010648295,"about_ca_system_score_codex":0.0010717594,"about_ca_system_score_gemma":0.002253889,"threshold_uncertainty_score":0.05631423},"labels":[],"label_agreement":null},{"id":"W4409361542","doi":"10.1609/aaai.v39i26.34980","title":"Can Go AIs Be Adversarially Robust?","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","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":"McGill University","funders":"","keywords":"Computer science","score_opus":0.05512165996248178,"score_gpt":0.296670524556318,"score_spread":0.2415488645938362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409361542","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.3058251,0.0014142538,0.6319591,0.0064743804,0.0003067701,0.0002646355,0.00034460842,0.004252555,0.049158532],"genre_scores_gemma":[0.9695313,0.00022160429,0.026115458,0.0006525586,0.000034494675,0.00007683078,0.0001487832,0.00013799989,0.003081027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989048,0.000306807,0.00004067966,0.00024184203,0.00028146812,0.00022433468],"domain_scores_gemma":[0.991888,0.004161737,0.0009911446,0.0021262022,0.00047920828,0.00035367202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025794376,0.00074870937,0.0007305915,0.0005956273,0.00095170236,0.0015097484,0.0014150444,0.002702605,0.004621656],"category_scores_gemma":[0.017969416,0.00041641828,0.0005712022,0.00027383078,0.0044266777,0.0043694125,0.002724581,0.0023486118,0.0014741858],"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.00028449038,0.000111219706,0.005861625,0.0002899709,0.00021366049,0.00029947073,0.00045491447,0.7680901,0.023795296,0.13296658,0.0056270068,0.06200561],"study_design_scores_gemma":[0.00003627511,0.00031858034,0.001766428,0.0000818164,0.000044759705,0.00040528658,0.00030902567,0.7543991,0.009906402,0.22320949,0.009467757,0.00005503081],"about_ca_topic_score_codex":0.001305501,"about_ca_topic_score_gemma":0.0013464752,"teacher_disagreement_score":0.004621656,"about_ca_system_score_codex":0.0006239928,"about_ca_system_score_gemma":0.000799861,"threshold_uncertainty_score":0.015460968},"labels":[],"label_agreement":null},{"id":"W4409361576","doi":"10.1609/aaai.v39i25.34864","title":"ModelDiff: Symbolic Dynamic Programming for Model-Aware Policy Transfer in Deep Q-Learning","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","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":"Computer science; Transfer of learning; Transfer (computing); Dynamic programming; Artificial intelligence; Programming language; Parallel computing; Algorithm","score_opus":0.04088646043850981,"score_gpt":0.31499908200665955,"score_spread":0.27411262156814975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409361576","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.0039194,0.0001670061,0.9931344,0.00026436843,0.000037579543,0.000043016596,0.000049013852,0.0006564404,0.0017287118],"genre_scores_gemma":[0.5557053,0.0003467247,0.43744537,0.00063438714,0.00008505116,0.00053957733,0.0003288749,0.00047386994,0.0044407854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990834,0.00040359778,0.000037919872,0.00017072253,0.00020788396,0.00009657807],"domain_scores_gemma":[0.9971999,0.0020974618,0.0001545725,0.00021728851,0.00019257562,0.00013827605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025187107,0.0010564835,0.0011799172,0.00046990794,0.00043120896,0.0011426797,0.0021614474,0.0016008271,0.0056743883],"category_scores_gemma":[0.008564932,0.0007339686,0.0006888112,0.00056004047,0.0015085168,0.0016072118,0.0028422326,0.0034195744,0.00072670943],"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.00006206595,0.00006071868,0.00036563983,0.00008771971,0.000025554977,0.000047087502,0.00006400926,0.90571254,0.00048590588,0.040265586,0.0022582342,0.050564904],"study_design_scores_gemma":[0.000007958289,0.00000891213,0.000008847668,0.0000041361586,0.0000013657892,0.0000029059106,0.0000021193273,0.9878902,0.00010001165,0.011682794,0.00028926088,0.000001549884],"about_ca_topic_score_codex":0.0055527836,"about_ca_topic_score_gemma":0.006738093,"teacher_disagreement_score":0.0056743883,"about_ca_system_score_codex":0.0015285749,"about_ca_system_score_gemma":0.0034206165,"threshold_uncertainty_score":0.018982708},"labels":[],"label_agreement":null},{"id":"W4409361642","doi":"10.1609/aaai.v39i25.34887","title":"Flow Factorization for Efficient Generative Flow Networks","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"University of Toronto","keywords":"Flow (mathematics); Computer science; Generative grammar; Artificial intelligence; Mathematics; Geometry","score_opus":0.05156236654893604,"score_gpt":0.29477046231317067,"score_spread":0.24320809576423463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409361642","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.00410635,0.000098757475,0.9941462,0.00008746641,0.000020729753,0.000045573568,0.000070678136,0.0004632373,0.0009609729],"genre_scores_gemma":[0.3714318,0.00039901453,0.6179561,0.00042789563,0.00009755935,0.0006956468,0.0012248476,0.0004958396,0.0072713504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927956,0.00021640188,0.000035923524,0.0002006757,0.0001721516,0.000095290634],"domain_scores_gemma":[0.9976428,0.0015876004,0.00015203489,0.00018525074,0.0003083468,0.0001239419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00186261,0.0013206953,0.0011560159,0.0012202761,0.000707523,0.0010036425,0.0016901675,0.0015605489,0.0062490953],"category_scores_gemma":[0.0077864802,0.0008292664,0.0010704313,0.0009154938,0.0013079896,0.0018965716,0.0021616307,0.002577879,0.0013739811],"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.00006929553,0.00005380697,0.00084144674,0.0000676639,0.000021378903,0.00006533266,0.00007778826,0.87708956,0.0012866843,0.035347715,0.0023045726,0.08277476],"study_design_scores_gemma":[0.00000501905,0.0000067542373,0.000025128134,0.000004729422,0.0000020930638,0.000008245129,0.0000030319493,0.9882967,0.00022551721,0.010998088,0.00042208715,0.0000026428895],"about_ca_topic_score_codex":0.007560636,"about_ca_topic_score_gemma":0.010759827,"teacher_disagreement_score":0.007560636,"about_ca_system_score_codex":0.0018308347,"about_ca_system_score_gemma":0.0019477672,"threshold_uncertainty_score":0.020905316},"labels":[],"label_agreement":null},{"id":"W4409361716","doi":"10.1609/aaai.v39i26.34954","title":"Internal Activation Revision: Safeguarding Vision Language Models Without Parameter Update","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Safeguarding; Computer science; Linguistics; Natural language processing; Philosophy; Medicine","score_opus":0.039922484497689106,"score_gpt":0.32915447166851264,"score_spread":0.28923198717082355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409361716","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.083094664,0.0002535483,0.9027569,0.0006684785,0.00013165432,0.00020437902,0.000126168,0.009302385,0.0034618056],"genre_scores_gemma":[0.8992461,0.00008540506,0.096078545,0.0005109033,0.00006625339,0.00014461331,0.00018504563,0.0006582353,0.0030249038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807525,0.0006644094,0.00010060805,0.00039297267,0.00053030194,0.00023642209],"domain_scores_gemma":[0.993159,0.002846095,0.00064509414,0.0023369158,0.0008112434,0.00020165675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030679537,0.0014468327,0.0008800921,0.00049041404,0.0004891784,0.001416425,0.0029320312,0.0014306654,0.002777761],"category_scores_gemma":[0.019448789,0.0005792219,0.0008719039,0.00021807794,0.0016544407,0.0029554458,0.002947614,0.0029318277,0.0011214991],"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.0010858998,0.00021219472,0.005355862,0.00022677856,0.00015009067,0.0006213098,0.0010240396,0.51227826,0.052157667,0.030761266,0.008852791,0.38727388],"study_design_scores_gemma":[0.000023995071,0.00009936427,0.00017331023,0.000014842887,0.000021759866,0.00007973431,0.000041327912,0.9720129,0.0155871045,0.010640264,0.0012871778,0.000018146247],"about_ca_topic_score_codex":0.0023378157,"about_ca_topic_score_gemma":0.0020112072,"teacher_disagreement_score":0.0030679537,"about_ca_system_score_codex":0.0007870369,"about_ca_system_score_gemma":0.0013443097,"threshold_uncertainty_score":0.0162251},"labels":[],"label_agreement":null},{"id":"W4409361746","doi":"10.1609/aaai.v39i26.34971","title":"Increased Compute Efficiency and the Diffusion of AI Capabilities","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Computability, Logic, AI 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":"Institute on Governance","funders":"","keywords":"Diffusion; Computer science; Physics; Thermodynamics","score_opus":0.02748081946654944,"score_gpt":0.2721899647761037,"score_spread":0.24470914530955423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409361746","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.8336605,0.001345663,0.060616355,0.006181988,0.00006436188,0.00007900121,0.00017074795,0.00033391823,0.097547434],"genre_scores_gemma":[0.9900057,0.00034886829,0.006091022,0.00016420714,0.00003105378,0.00002710851,0.000076478056,0.00007646464,0.0031791506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975611,0.00084876246,0.0001296096,0.0003532494,0.00056323316,0.0005441036],"domain_scores_gemma":[0.97096574,0.01655737,0.004736303,0.0037579818,0.0026193967,0.001363206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037990888,0.00035096233,0.00035470576,0.0013648026,0.0009377474,0.0037471608,0.0010488678,0.0010217198,0.007243022],"category_scores_gemma":[0.038732484,0.00032213295,0.00045033725,0.001648162,0.003908315,0.0075444486,0.0033183456,0.001974461,0.00079478644],"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.0009110527,0.00043459353,0.087425955,0.00027721646,0.00024484223,0.00048434004,0.0038595577,0.13191347,0.0095206825,0.63724506,0.005237667,0.12244558],"study_design_scores_gemma":[0.00033618408,0.00056933856,0.09367657,0.000272413,0.00021854708,0.00097365235,0.0035960919,0.22185682,0.020076185,0.59277016,0.06551596,0.00013802887],"about_ca_topic_score_codex":0.0049505243,"about_ca_topic_score_gemma":0.0032492743,"teacher_disagreement_score":0.007243022,"about_ca_system_score_codex":0.0017867754,"about_ca_system_score_gemma":0.0014547679,"threshold_uncertainty_score":0.024230301},"labels":[],"label_agreement":null},{"id":"W4409361811","doi":"10.1609/aaai.v39i28.35353","title":"An LLM-Guided Tutoring System for Social Skills Training","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"University of Alberta; Natural Sciences and Engineering Research Council of Canada; Mitacs; Canadian Institute for Advanced Research","keywords":"Training (meteorology); Computer science; Medical education; Psychology; Social skills; Mathematics education; Medicine; Developmental psychology; Geography","score_opus":0.10938426289376671,"score_gpt":0.33940349481521426,"score_spread":0.23001923192144755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409361811","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.054443534,0.00034591978,0.7236332,0.00035981392,0.00014608132,0.00074570026,0.0010843866,0.20712388,0.0121174585],"genre_scores_gemma":[0.3611483,0.00017024598,0.61425376,0.00051183533,0.00006756906,0.0011691059,0.0024598904,0.0014943213,0.018725075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996599,0.000117850155,0.000026931402,0.00009260394,0.000075045195,0.000027624596],"domain_scores_gemma":[0.9994112,0.00025812845,0.000048526996,0.00008556605,0.000086991706,0.00010957557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006594556,0.00059499237,0.00038969767,0.00043473576,0.00039368123,0.00063820044,0.0014756031,0.0009803454,0.009810308],"category_scores_gemma":[0.0026919574,0.00022821578,0.000277044,0.00016447346,0.00018317715,0.00081346853,0.0014041101,0.0007587467,0.0032952935],"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.0010429701,0.0014894085,0.005173869,0.0005863888,0.000080486454,0.0006157865,0.0010868682,0.016400147,0.07757914,0.0062206443,0.06689725,0.82282704],"study_design_scores_gemma":[0.00077363657,0.0015072031,0.0059216907,0.00012768341,0.00015210647,0.0012235283,0.0001808067,0.7183351,0.0682703,0.01016451,0.1931629,0.00018049398],"about_ca_topic_score_codex":0.0013096168,"about_ca_topic_score_gemma":0.0023905288,"teacher_disagreement_score":0.009810308,"about_ca_system_score_codex":0.00061032263,"about_ca_system_score_gemma":0.0007896906,"threshold_uncertainty_score":0.032818735},"labels":[],"label_agreement":null},{"id":"W4409361880","doi":"10.1609/aaai.v39i25.34860","title":"On Shallow Planning Under Partial Observability","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Canadian Institute for Advanced Research","keywords":"Observability; Geology; Environmental science; Mathematics; Applied mathematics","score_opus":0.10194769705417127,"score_gpt":0.3230137919969241,"score_spread":0.2210660949427528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409361880","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.0366607,0.00038364358,0.95704144,0.0011539201,0.000037726855,0.00004723847,0.00011271605,0.0002134396,0.0043491754],"genre_scores_gemma":[0.86276644,0.000705899,0.13287652,0.00036154746,0.00009641868,0.00013167715,0.00015814538,0.00012190532,0.0027815413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984464,0.0006527831,0.00008725545,0.00026723425,0.00028881303,0.00025749614],"domain_scores_gemma":[0.9862716,0.011435331,0.0007316595,0.00060167135,0.00054639496,0.00041339628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032409392,0.000884901,0.0011761793,0.0005741767,0.00047669807,0.0014388821,0.0010932164,0.0012756353,0.0038812025],"category_scores_gemma":[0.021213865,0.00078498345,0.0008514451,0.00062601094,0.002733902,0.0040846677,0.0026220232,0.0026295446,0.00023360692],"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.00013819503,0.000030389745,0.0006660708,0.00013784583,0.00004161073,0.00015802067,0.00016921596,0.7783004,0.00145202,0.1998794,0.0005289535,0.018497916],"study_design_scores_gemma":[0.000018514706,0.000033709315,0.00015754304,0.000022849947,0.000010167839,0.0000147750825,0.000013560189,0.7459998,0.00024733358,0.25317925,0.00029235464,0.0000101207825],"about_ca_topic_score_codex":0.008525495,"about_ca_topic_score_gemma":0.0077427225,"teacher_disagreement_score":0.008525495,"about_ca_system_score_codex":0.002392391,"about_ca_system_score_gemma":0.0025470657,"threshold_uncertainty_score":0.017358124},"labels":[],"label_agreement":null},{"id":"W4409361896","doi":"10.1609/aaai.v39i25.34911","title":"Anchor Search: A Unified Framework for Suboptimal Bidirectional Search","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alliance de recherche numérique du Canada; Israel Science Foundation; Israel National Road Safety Authority; Canadian Institute for Advanced Research","keywords":"Computer science","score_opus":0.15076007786207432,"score_gpt":0.3779439235649356,"score_spread":0.2271838457028613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409361896","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.0039672926,0.00043154342,0.9918139,0.000167312,0.000032274547,0.00006741802,0.000048242222,0.00022454829,0.0032475984],"genre_scores_gemma":[0.18456091,0.00072949444,0.8107478,0.0002459033,0.000068748355,0.00047606407,0.00026862475,0.0002607275,0.002641764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729675,0.0012186635,0.00018822512,0.00038648592,0.0006694584,0.0002404834],"domain_scores_gemma":[0.99734783,0.0014011879,0.00021956646,0.0005015479,0.00039696821,0.0001328521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004126327,0.0012889593,0.0021009382,0.0016898409,0.0009686226,0.0025722953,0.003011364,0.0021854558,0.004865339],"category_scores_gemma":[0.011676215,0.0007769276,0.001316077,0.002323723,0.0017697773,0.0031449744,0.0036842332,0.0023785888,0.00092095305],"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.00012321062,0.000093786446,0.00084203994,0.00025984747,0.00006808952,0.00010918188,0.00022830145,0.5860981,0.0013059798,0.28846484,0.003690908,0.118715785],"study_design_scores_gemma":[0.000029419902,0.000066201224,0.00006216521,0.000046746678,0.000017563556,0.000053270225,0.000045607867,0.89969814,0.0004393155,0.09545244,0.0040721633,0.00001696495],"about_ca_topic_score_codex":0.0037184816,"about_ca_topic_score_gemma":0.0030439903,"teacher_disagreement_score":0.004865339,"about_ca_system_score_codex":0.0017001494,"about_ca_system_score_gemma":0.0032459185,"threshold_uncertainty_score":0.021822333},"labels":[],"label_agreement":null},{"id":"W4409362029","doi":"10.1609/aaai.v39i27.35119","title":"Learning Language Structures Through Grounding","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"EFL/ESL Teaching and Learning","field":"Arts and Humanities","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":"Vector Institute","funders":"","keywords":"Ground; Computer science; Linguistics; Cognitive science; Psychology; Engineering; Philosophy; Electrical engineering","score_opus":0.08005444771141898,"score_gpt":0.3196862597847269,"score_spread":0.23963181207330794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409362029","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.037275296,0.000094430776,0.95792997,0.000694355,0.000020188323,0.000059412938,0.00015111078,0.00096017745,0.0028150866],"genre_scores_gemma":[0.5925004,0.00017845829,0.40364325,0.00023321186,0.00004656992,0.000118536045,0.000964523,0.00017965378,0.0021354586],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811745,0.0006989605,0.00010105841,0.0006198426,0.00029076732,0.00017198404],"domain_scores_gemma":[0.99447614,0.0032759795,0.00048051734,0.0012419616,0.00035033203,0.00017511332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028330968,0.0007446862,0.00070307904,0.0010726511,0.0009413205,0.0025209615,0.0015246193,0.0012809151,0.0024323473],"category_scores_gemma":[0.0128928805,0.0006008401,0.0011207733,0.0008909536,0.0034311381,0.008158683,0.0048057074,0.0025390212,0.0005436212],"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.00017262387,0.00020267238,0.005609009,0.00019938414,0.000081400256,0.00022731502,0.0020381624,0.14551714,0.014229256,0.38046622,0.0037822048,0.44747463],"study_design_scores_gemma":[0.000016328433,0.00007388308,0.00059782347,0.00004627861,0.000019074349,0.000047062204,0.00023773267,0.4485458,0.006507847,0.5397068,0.0041816956,0.000019707668],"about_ca_topic_score_codex":0.001990688,"about_ca_topic_score_gemma":0.002721428,"teacher_disagreement_score":0.0028330968,"about_ca_system_score_codex":0.0011772134,"about_ca_system_score_gemma":0.0011901135,"threshold_uncertainty_score":0.014983058},"labels":[],"label_agreement":null},{"id":"W4409362077","doi":"10.1609/aaai.v39i26.34961","title":"Bias Unveiled: Investigating Social Bias in LLM-Generated Code","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Law","field":"Social Sciences","cited_by":16,"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; Concordia University","funders":"","keywords":"Code (set theory); Computer science; Psychology; Programming language","score_opus":0.30739482546627606,"score_gpt":0.40538641925828317,"score_spread":0.09799159379200711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409362077","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.8256488,0.0010287398,0.14997095,0.0016823927,0.0002564072,0.00053323514,0.0031101923,0.010065225,0.007704105],"genre_scores_gemma":[0.8974456,0.00011519428,0.09430865,0.0005497724,0.000070445865,0.00044092874,0.004483294,0.0008509099,0.0017352124],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99107635,0.0053736134,0.00034610863,0.0011369361,0.0018117198,0.0002551916],"domain_scores_gemma":[0.9420425,0.039427742,0.0034144341,0.010896703,0.0035517318,0.0006668019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009853753,0.00065237243,0.00038456256,0.0014945762,0.0009135168,0.0012335377,0.0013253255,0.0011739122,0.0012275629],"category_scores_gemma":[0.066179484,0.000246852,0.000523142,0.0008601189,0.0019389004,0.0017601497,0.002111784,0.0014051066,0.00055775966],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021321105,0.0013873649,0.16406384,0.0016336961,0.00034119672,0.0008658582,0.0062517785,0.17267545,0.04058018,0.036396112,0.046291582,0.52738076],"study_design_scores_gemma":[0.00036496366,0.0006054719,0.018861355,0.0001470612,0.000065528926,0.0003716218,0.0008088101,0.8753134,0.043531753,0.037710726,0.022118019,0.000101315636],"about_ca_topic_score_codex":0.0021854348,"about_ca_topic_score_gemma":0.0044233566,"teacher_disagreement_score":0.009853753,"about_ca_system_score_codex":0.0013918412,"about_ca_system_score_gemma":0.001794892,"threshold_uncertainty_score":0.05211222},"labels":[],"label_agreement":null},{"id":"W4409362112","doi":"10.1609/aaai.v39i26.34987","title":"Evaluating Mathematical Reasoning Beyond Accuracy","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Mathematics Education and Teaching Techniques","field":"Social Sciences","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Management science; Artificial intelligence; Engineering","score_opus":0.17806885726210744,"score_gpt":0.46625857357558154,"score_spread":0.2881897163134741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409362112","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.39278525,0.016683226,0.42842072,0.00715702,0.0019424431,0.0013721985,0.029055342,0.069886595,0.05269727],"genre_scores_gemma":[0.72001475,0.001067948,0.22993411,0.0014929611,0.00023290639,0.0006638132,0.038740892,0.003021808,0.0048307003],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9637626,0.01912989,0.0027915903,0.0045587146,0.008658589,0.001098622],"domain_scores_gemma":[0.8920812,0.07613218,0.0038241753,0.015257858,0.0108455885,0.0018589346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024557844,0.0034219867,0.0014568683,0.0047184206,0.0011644358,0.0064592343,0.003582394,0.003667388,0.0076083853],"category_scores_gemma":[0.15134695,0.000816071,0.0023193979,0.0023805152,0.0021162904,0.008779842,0.005423318,0.0043565664,0.003320084],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032880874,0.0014508627,0.039720945,0.006646371,0.0022059474,0.0003180552,0.0021372684,0.23740537,0.013596325,0.025870286,0.10252366,0.5648368],"study_design_scores_gemma":[0.0005694729,0.0012167812,0.013656875,0.001035111,0.0006068972,0.00030249628,0.0009966183,0.8379625,0.040890027,0.05275679,0.049760398,0.00024613045],"about_ca_topic_score_codex":0.0056213266,"about_ca_topic_score_gemma":0.010485044,"teacher_disagreement_score":0.024557844,"about_ca_system_score_codex":0.002839947,"about_ca_system_score_gemma":0.0040508485,"threshold_uncertainty_score":0.12987584},"labels":[],"label_agreement":null},{"id":"W4409362363","doi":"10.1609/aaai.v39i25.34821","title":"Perception-Guided Jailbreak Against Text-to-Image Models","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","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":"Ministry of Education and Child Care","funders":"Fundamental Research Funds for the Central Universities; Ministry of Education of the People's Republic of China; National Natural Science Foundation of China; National Research Foundation Singapore; National Research Foundation","keywords":"Perception; Image (mathematics); Computer science; Psychology; Artificial intelligence; Cognitive psychology; Natural language processing; Neuroscience","score_opus":0.05902485939270401,"score_gpt":0.31977056404222415,"score_spread":0.2607457046495201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409362363","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.19400392,0.00063738285,0.7818087,0.0014116918,0.00035411847,0.00037230493,0.00022752066,0.01426685,0.006917581],"genre_scores_gemma":[0.8928362,0.000085103406,0.10265816,0.00057403697,0.0000680911,0.00011561519,0.0002490826,0.0005082079,0.002905417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979965,0.00068343,0.000080269914,0.00041296816,0.0005698526,0.0002569017],"domain_scores_gemma":[0.9925282,0.003897703,0.0009337112,0.0016661114,0.00059444126,0.00037976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029356482,0.0012030182,0.0009772377,0.0005881388,0.00069524103,0.0012284091,0.0017163705,0.0015041485,0.003264123],"category_scores_gemma":[0.013157554,0.00036189923,0.00073329295,0.00022884985,0.0020495483,0.0029026016,0.0032059925,0.0030963877,0.0011845671],"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.0037626498,0.0010521205,0.0076338104,0.0006974345,0.00025820686,0.00097128615,0.0019237344,0.4133468,0.09383372,0.05509788,0.028423687,0.3929987],"study_design_scores_gemma":[0.00006212306,0.00027504982,0.00042369438,0.000021070435,0.000016063224,0.00017868787,0.00015653731,0.9631468,0.017897261,0.015664529,0.0021264276,0.000031751817],"about_ca_topic_score_codex":0.00095341,"about_ca_topic_score_gemma":0.0010875019,"teacher_disagreement_score":0.003264123,"about_ca_system_score_codex":0.0007664505,"about_ca_system_score_gemma":0.0009044912,"threshold_uncertainty_score":0.015525401},"labels":[],"label_agreement":null},{"id":"W4409362458","doi":"10.1609/aaai.v39i25.34851","title":"PDBs Go Numeric: Pattern-Database Heuristics for Simple Numeric Planning","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Bar-Ilan University; Israel Academy of Sciences and Humanities; Vetenskapsrådet; Azrieli Foundation; Israel Science Foundation; Knut och Alice Wallenbergs Stiftelse","keywords":"Heuristics; Simple (philosophy); Computer science; Database","score_opus":0.08290416091599657,"score_gpt":0.3262654503586444,"score_spread":0.24336128944264784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409362458","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.01791338,0.0002467916,0.96100533,0.0004628347,0.000100621466,0.00034302886,0.0009711076,0.0026269453,0.01632992],"genre_scores_gemma":[0.18460725,0.00024271598,0.8085046,0.0003053392,0.000027772627,0.00040894817,0.001232537,0.00039349604,0.0042773616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992242,0.0002617042,0.00009215331,0.00014071683,0.00018864144,0.00009255617],"domain_scores_gemma":[0.99789196,0.0012880329,0.00014599007,0.00037421766,0.00019555965,0.0001043317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010882113,0.00063186855,0.00070015376,0.00096409465,0.0006300738,0.0015486504,0.0015520015,0.0010009072,0.009985054],"category_scores_gemma":[0.0065582413,0.00049531355,0.0009238691,0.001348411,0.0010690984,0.0019860968,0.001912462,0.0012808656,0.0013680063],"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.0004313071,0.00025991572,0.0021714782,0.00064919493,0.00007519393,0.000522029,0.00042008856,0.3144443,0.004161041,0.31790012,0.024778629,0.3341867],"study_design_scores_gemma":[0.000104016915,0.00013142652,0.00036524626,0.00012087872,0.0000438229,0.00024654815,0.00021615012,0.7157241,0.004821455,0.253188,0.024993064,0.000045258257],"about_ca_topic_score_codex":0.0064576864,"about_ca_topic_score_gemma":0.012127257,"teacher_disagreement_score":0.009985054,"about_ca_system_score_codex":0.0011430188,"about_ca_system_score_gemma":0.0023650369,"threshold_uncertainty_score":0.033403337},"labels":[],"label_agreement":null},{"id":"W4409362477","doi":"10.1609/aaai.v39i24.34752","title":"UniMuMo: Unified Text, Music, and Motion Generation","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Human Motion and Animation","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":"University of British Columbia","funders":"","keywords":"Motion (physics); Computer science; Artificial intelligence","score_opus":0.07050037426385194,"score_gpt":0.26882503531764856,"score_spread":0.19832466105379662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409362477","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.015146929,0.00073345157,0.9548018,0.00042849002,0.000355372,0.00032312507,0.0018881615,0.01892811,0.0073945657],"genre_scores_gemma":[0.35648263,0.0005769572,0.6051361,0.0009110198,0.00019531978,0.0011539963,0.009064242,0.0021255808,0.02435418],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995228,0.00009363428,0.000024533396,0.00015344682,0.00013969853,0.00006589992],"domain_scores_gemma":[0.99955636,0.00017217893,0.0000252058,0.00011730972,0.00008345529,0.000045459226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010800333,0.001231499,0.0009345863,0.0006682248,0.0004042745,0.0010180149,0.0027687305,0.0011095401,0.008358687],"category_scores_gemma":[0.0028523812,0.0005084722,0.0010893117,0.00046506987,0.0005710198,0.0018852307,0.0026361234,0.0015320078,0.0032300104],"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.0008600237,0.0003650508,0.0018830724,0.00045466085,0.00015040225,0.0003628758,0.0002473785,0.17272128,0.027387198,0.02541153,0.04171741,0.7284391],"study_design_scores_gemma":[0.00006430987,0.00013185879,0.00027866443,0.000026494094,0.000028420163,0.00015135284,0.000028611941,0.9629285,0.014981111,0.009804738,0.01154614,0.00002991023],"about_ca_topic_score_codex":0.0040362407,"about_ca_topic_score_gemma":0.007598056,"teacher_disagreement_score":0.008358687,"about_ca_system_score_codex":0.0007474822,"about_ca_system_score_gemma":0.0013147377,"threshold_uncertainty_score":0.027962565},"labels":[],"label_agreement":null},{"id":"W4409362513","doi":"10.1609/aaai.v39i24.34737","title":"EBBS: An Ensemble with Bi-Level Beam Search for Zero-Shot Machine Translation","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Northern Alberta Institute of Technology; University of Alberta","funders":"Alliance de recherche numérique du Canada; Alberta Innovates; Natural Sciences and Engineering Research Council of Canada; Mitacs; Canadian Institute for Advanced Research","keywords":"Zero (linguistics); Shot (pellet); Translation (biology); Machine translation; Beam (structure); Computer science; Physics; Artificial intelligence; Optics; Materials science; Linguistics","score_opus":0.13573189638109215,"score_gpt":0.3552919551217023,"score_spread":0.21956005874061016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409362513","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.0170069,0.0007760199,0.976846,0.0002259555,0.00010401723,0.0000644906,0.00014117634,0.0036317024,0.0012038387],"genre_scores_gemma":[0.40900925,0.0005339719,0.5789361,0.0011458719,0.00025971944,0.0003488605,0.0022899339,0.0010431955,0.0064331437],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985623,0.00057500065,0.000072812356,0.00033596248,0.00031051956,0.00014339661],"domain_scores_gemma":[0.9980719,0.00097592355,0.0000985527,0.0003580448,0.0003765146,0.000119054916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024870252,0.0018665796,0.0025698694,0.0012977393,0.001032382,0.0011897853,0.0037401167,0.0022516383,0.0033102618],"category_scores_gemma":[0.005419554,0.0011809545,0.0013725851,0.0017718441,0.0011346758,0.0031915924,0.0028263787,0.002870491,0.0022182486],"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.0004465949,0.0002593142,0.0021286323,0.0001485565,0.00044580194,0.00015955884,0.0002873229,0.47687304,0.0075874124,0.01158737,0.011638342,0.48843804],"study_design_scores_gemma":[0.00001901013,0.000040297018,0.00007814843,0.000007240287,0.000020319369,0.000017237986,0.0000124390945,0.9927907,0.0009845691,0.005382832,0.00063891534,0.000008214865],"about_ca_topic_score_codex":0.00893619,"about_ca_topic_score_gemma":0.016727833,"teacher_disagreement_score":0.00893619,"about_ca_system_score_codex":0.0007399251,"about_ca_system_score_gemma":0.00195588,"threshold_uncertainty_score":0.017768383},"labels":[],"label_agreement":null},{"id":"W4409362560","doi":"10.1609/aaai.v39i24.34804","title":"BindGPT: A Scalable Framework for 3D Molecular Design via Language Modeling and Reinforcement Learning","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning in Materials Science","field":"Materials Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Reinforcement learning; Computer science; Scalability; Reinforcement; Human–computer interaction; Cognitive science; Natural language processing; Artificial intelligence; Psychology; Social psychology","score_opus":0.04331414351777456,"score_gpt":0.3168851664140138,"score_spread":0.27357102289623925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409362560","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.0029703944,0.00017644707,0.98591137,0.00021842544,0.000052024665,0.00008792976,0.00037585365,0.0081500625,0.0020574213],"genre_scores_gemma":[0.13753936,0.00047097125,0.85283244,0.00036372207,0.000057168276,0.00086238584,0.001700469,0.0024349834,0.0037385027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954236,0.00013268949,0.000020984415,0.00010183042,0.00016199231,0.00004010429],"domain_scores_gemma":[0.9993117,0.00034603802,0.000045389577,0.00015817143,0.00007581899,0.000062904604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001177095,0.0014529867,0.0013216855,0.00072828284,0.00066216773,0.0016535847,0.004612873,0.0022213748,0.00983603],"category_scores_gemma":[0.0028254245,0.001137728,0.0024280883,0.0006708954,0.0011944774,0.001872412,0.002115774,0.0031327205,0.0032066614],"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.000061002072,0.00007408713,0.00046724433,0.00016229456,0.00007827885,0.00012214648,0.00006113346,0.9066498,0.0027353447,0.034152273,0.006829114,0.04860724],"study_design_scores_gemma":[0.000015460568,0.000008835341,0.000014194696,0.000004339682,0.000003803854,0.000013888679,0.0000030845588,0.98755103,0.00040190812,0.010205757,0.0017734879,0.00000422456],"about_ca_topic_score_codex":0.0077630407,"about_ca_topic_score_gemma":0.012647109,"teacher_disagreement_score":0.00983603,"about_ca_system_score_codex":0.0015034813,"about_ca_system_score_gemma":0.0017924563,"threshold_uncertainty_score":0.032904744},"labels":[],"label_agreement":null},{"id":"W4409362569","doi":"10.1609/aaai.v39i24.34717","title":"CodeHalu: Investigating Code Hallucinations in LLMs via Execution-based Verification","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":13,"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; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Code (set theory); Computer science; Programming language; Psychology","score_opus":0.07942367299217998,"score_gpt":0.320831477344202,"score_spread":0.241407804352022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409362569","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.7725768,0.0015980651,0.19467658,0.0007137606,0.00016761551,0.00048763733,0.0025765023,0.023429943,0.003773123],"genre_scores_gemma":[0.88386005,0.0001734497,0.10980435,0.00022282623,0.000024692044,0.00024353701,0.0037519936,0.0009629264,0.00095630536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99400204,0.001987712,0.00043395185,0.0010050414,0.002250867,0.00032039284],"domain_scores_gemma":[0.9550491,0.029893521,0.004302145,0.0063196984,0.0037515673,0.00068387773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004700056,0.0010695497,0.00047446924,0.0025328249,0.00064128404,0.0013891741,0.0018026205,0.0010476336,0.0008764029],"category_scores_gemma":[0.04671404,0.00042975644,0.0006808885,0.0013901019,0.0015291433,0.0022651237,0.002251224,0.0014931585,0.00041690262],"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.0025373895,0.0010750778,0.18211201,0.002636707,0.0004836268,0.0017797399,0.004416314,0.18442112,0.05538717,0.014633083,0.029324304,0.5211935],"study_design_scores_gemma":[0.00013407409,0.0006173998,0.019323919,0.00011548641,0.000075209384,0.00073409633,0.0007317234,0.92084885,0.037458766,0.011402462,0.008488168,0.00006978801],"about_ca_topic_score_codex":0.005238434,"about_ca_topic_score_gemma":0.007557634,"teacher_disagreement_score":0.005238434,"about_ca_system_score_codex":0.0010316805,"about_ca_system_score_gemma":0.0017562639,"threshold_uncertainty_score":0.024856508},"labels":[],"label_agreement":null},{"id":"W4409362689","doi":"10.1609/aaai.v39i24.34764","title":"MABR: Multilayer Adversarial Bias Removal Without Prior Bias Knowledge","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Adversarial system; Computer science; Artificial intelligence","score_opus":0.10742692767320933,"score_gpt":0.342294024298861,"score_spread":0.2348670966256517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409362689","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.011530467,0.0003485363,0.9839483,0.00039945496,0.000095828465,0.00007271928,0.0001280076,0.0018467925,0.0016299324],"genre_scores_gemma":[0.63597083,0.0005154493,0.3506719,0.001488124,0.00034541878,0.00037345296,0.0008547248,0.0006746088,0.009105534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986125,0.00056884054,0.000055606804,0.00026161858,0.00035268965,0.00014863849],"domain_scores_gemma":[0.9969938,0.0014826662,0.00031774017,0.00076448015,0.00031854358,0.00012285095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033383807,0.0017724204,0.0012442945,0.0007002962,0.00050145213,0.0007887363,0.0024096463,0.0014775314,0.0025407146],"category_scores_gemma":[0.008867457,0.00066202733,0.0011529388,0.00041437693,0.0012474955,0.001579003,0.003352792,0.0029219505,0.0015565687],"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.00024688558,0.00011579448,0.0032491009,0.0001659195,0.0002511606,0.00021753619,0.00016990812,0.73498666,0.012320968,0.021586243,0.012198616,0.21449119],"study_design_scores_gemma":[0.000010612882,0.000048720467,0.00019447139,0.000017514612,0.000016350907,0.000056168014,0.000008824968,0.98636067,0.002476562,0.009504018,0.0012951654,0.000010945115],"about_ca_topic_score_codex":0.0020443227,"about_ca_topic_score_gemma":0.0023437978,"teacher_disagreement_score":0.0033383807,"about_ca_system_score_codex":0.0007018409,"about_ca_system_score_gemma":0.0010961901,"threshold_uncertainty_score":0.017655253},"labels":[],"label_agreement":null},{"id":"W4409362756","doi":"10.1609/aaai.v39i25.34844","title":"Privacy-and-Utility-Aware Publishing of Schedules","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Bundesministerium für Bildung und Forschung","keywords":"Computer science; Publishing; Data publishing; Internet privacy; Computer security; Political science; Law","score_opus":0.04644402706094024,"score_gpt":0.27292492077061753,"score_spread":0.22648089370967728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409362756","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.049924076,0.00018315579,0.9453479,0.0005924052,0.00006905884,0.00020021507,0.00016209317,0.0007815678,0.0027396027],"genre_scores_gemma":[0.7489028,0.0002775379,0.2474098,0.00015281636,0.0000936515,0.00019827779,0.00024162795,0.00020842865,0.002514994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935015,0.0030658417,0.0004408402,0.00089701754,0.0016421931,0.0004526457],"domain_scores_gemma":[0.9740917,0.008866646,0.002720146,0.012440133,0.0013218498,0.0005595639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072132153,0.0007746698,0.0011192178,0.00075097993,0.00109233,0.0016120494,0.0023192863,0.0011602383,0.0014468059],"category_scores_gemma":[0.028866354,0.00065443554,0.000939468,0.0017029317,0.001727471,0.0036002453,0.0019495089,0.002444477,0.00044386092],"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.0007316495,0.00034279315,0.0032584423,0.00025175582,0.00014040103,0.00034509794,0.0007365102,0.6163503,0.019797342,0.17556576,0.0035142363,0.17896572],"study_design_scores_gemma":[0.00005782688,0.00022155327,0.0005156886,0.000025863877,0.000047214577,0.00023056971,0.0001046876,0.88131267,0.022259187,0.08783458,0.007356125,0.000034177163],"about_ca_topic_score_codex":0.0010434084,"about_ca_topic_score_gemma":0.00096405833,"teacher_disagreement_score":0.0072132153,"about_ca_system_score_codex":0.0015860323,"about_ca_system_score_gemma":0.0027733871,"threshold_uncertainty_score":0.03814763},"labels":[],"label_agreement":null},{"id":"W4409362862","doi":"10.1609/aaai.v39i25.34900","title":"Learn2Aggregate: Supervised Generation of Chvatal-Gomory Cuts Using Graph Neural Networks","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Multimodal Machine Learning Applications","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":"Huawei Technologies (Canada); University of Toronto","funders":"","keywords":"Graph; Mathematics; Artificial neural network; Artificial intelligence; Computer science; Combinatorics; Pattern recognition (psychology)","score_opus":0.09341661046799989,"score_gpt":0.3222071388322298,"score_spread":0.22879052836422992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409362862","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.023709582,0.00025387044,0.965556,0.00027205277,0.00009018253,0.00016890561,0.0003216473,0.005229801,0.0043979613],"genre_scores_gemma":[0.25798342,0.000116632065,0.7340687,0.00038137616,0.000045806555,0.00037285069,0.0015057849,0.0018842518,0.0036412522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948335,0.0001360847,0.000018987388,0.00013124621,0.0001579089,0.000072501294],"domain_scores_gemma":[0.9989249,0.0005905984,0.00009180095,0.0001622411,0.00016560423,0.00006476273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009791721,0.0016991679,0.0009922273,0.00090512563,0.00055225147,0.001151789,0.0017409471,0.0016081173,0.0071019907],"category_scores_gemma":[0.0033761184,0.0006707298,0.0009860896,0.0006091543,0.000952931,0.0012196772,0.0016339553,0.0025203258,0.001285483],"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.00016562674,0.00012655953,0.0011298475,0.00018346695,0.00006177709,0.00014876775,0.00008519086,0.7780841,0.004460869,0.017304184,0.01210558,0.18614393],"study_design_scores_gemma":[0.000023239394,0.000034352808,0.000054555716,0.00001130625,0.0000050609588,0.000018868268,0.000014040841,0.9896172,0.0014461286,0.0073546306,0.0014155967,0.0000049176147],"about_ca_topic_score_codex":0.004073514,"about_ca_topic_score_gemma":0.010865168,"teacher_disagreement_score":0.0071019907,"about_ca_system_score_codex":0.0010279783,"about_ca_system_score_gemma":0.0016786893,"threshold_uncertainty_score":0.023758471},"labels":[],"label_agreement":null},{"id":"W4409362866","doi":"10.1609/aaai.v39i25.34905","title":"Suboptimal Search with Dynamic Distribution of Suboptimality","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms 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 Alberta","funders":"","keywords":"Distribution (mathematics); Mathematics","score_opus":0.05123822905305393,"score_gpt":0.3277991023609898,"score_spread":0.2765608733079359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409362866","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.05718539,0.0005128419,0.93585247,0.00033966047,0.00006050158,0.00012194389,0.00007284012,0.000552475,0.0053019035],"genre_scores_gemma":[0.75689757,0.00030826696,0.2390896,0.0002406872,0.000037353933,0.0003386154,0.000147684,0.00019336092,0.0027468607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815255,0.0007209872,0.00013300368,0.0004211592,0.0003780981,0.00019409957],"domain_scores_gemma":[0.99327433,0.004139927,0.0005079512,0.0010882143,0.00073621835,0.00025333295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026687067,0.001003949,0.0013206237,0.00089935126,0.00082687516,0.0018315389,0.0014884965,0.0011668258,0.0029173254],"category_scores_gemma":[0.014107756,0.00076447777,0.0006818167,0.0010049308,0.0016572878,0.0028435965,0.002870813,0.0020807458,0.0005271942],"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.00024907576,0.0001296344,0.0018955128,0.0001125554,0.00010021372,0.000120755816,0.00019234458,0.85484946,0.0034335614,0.062053822,0.0020058313,0.0748572],"study_design_scores_gemma":[0.000040133164,0.00008511599,0.0001489654,0.000019107798,0.000019923766,0.000042933752,0.000039445786,0.9553045,0.0011655067,0.041564047,0.0015553781,0.000014926964],"about_ca_topic_score_codex":0.0025761214,"about_ca_topic_score_gemma":0.0028295857,"teacher_disagreement_score":0.0029173254,"about_ca_system_score_codex":0.001232108,"about_ca_system_score_gemma":0.002360771,"threshold_uncertainty_score":0.014113665},"labels":[],"label_agreement":null},{"id":"W4409362925","doi":"10.1609/aaai.v39i21.34460","title":"Causally Consistent Normalizing Flow","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Flow (mathematics); Geology; Econometrics; Mathematics; Geometry","score_opus":0.061864180208544006,"score_gpt":0.2980902601648691,"score_spread":0.2362260799563251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409362925","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.008786467,0.00017829156,0.9798733,0.00087584404,0.00007236813,0.00012950384,0.0009585514,0.0013529802,0.0077726906],"genre_scores_gemma":[0.49199167,0.0004914613,0.4951665,0.0011881767,0.00022172715,0.00047910883,0.0029564593,0.0008963574,0.006608547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924811,0.0031193292,0.0004383853,0.0019731629,0.0015434048,0.00044469285],"domain_scores_gemma":[0.97008836,0.017534195,0.0025155179,0.006902919,0.0025775612,0.0003814465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010084616,0.001165041,0.0011620999,0.002629851,0.0019767277,0.0033564684,0.0026918435,0.002248903,0.009263325],"category_scores_gemma":[0.059276037,0.0008691077,0.0022845773,0.002146135,0.0037641386,0.008042883,0.002791723,0.0037029898,0.0010086352],"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.00007856484,0.000053718184,0.00392587,0.00013422575,0.000092799,0.00024724248,0.0005462632,0.08638382,0.0006908245,0.83839643,0.004882503,0.064567745],"study_design_scores_gemma":[0.000017439696,0.00001092848,0.00030758785,0.000050878916,0.000042007203,0.000114249844,0.000057461904,0.204366,0.00093430927,0.7861097,0.007964758,0.000024609255],"about_ca_topic_score_codex":0.01272514,"about_ca_topic_score_gemma":0.013200015,"teacher_disagreement_score":0.01272514,"about_ca_system_score_codex":0.0036014824,"about_ca_system_score_gemma":0.0067462292,"threshold_uncertainty_score":0.053333163},"labels":[],"label_agreement":null},{"id":"W4409363136","doi":"10.1609/aaai.v39i20.35385","title":"ICE-T: Interactions-aware Cross-column Contrastive Embedding for Heterogeneous Tabular Datasets","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Mitacs","keywords":"Column (typography); Computer science; Embedding; Artificial intelligence","score_opus":0.06925681773120876,"score_gpt":0.4013077380625092,"score_spread":0.33205092033130046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409363136","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.041725602,0.001199982,0.9378018,0.0005071627,0.00019707554,0.00025921303,0.0037038792,0.012273485,0.002331753],"genre_scores_gemma":[0.3059525,0.0006958682,0.6584182,0.0009092744,0.00022253783,0.00070834346,0.02524421,0.0018155171,0.0060335337],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983656,0.0005036442,0.000116486655,0.0005405995,0.00033583256,0.00013776745],"domain_scores_gemma":[0.9952206,0.0016716471,0.00040461868,0.0019197019,0.00057393283,0.00020950421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002448025,0.002301681,0.0016091259,0.0021098775,0.00086255104,0.0026792996,0.003179165,0.0016984976,0.005139333],"category_scores_gemma":[0.012674917,0.0006610592,0.0018308312,0.0031141425,0.0012071293,0.0068489136,0.0038581667,0.003573985,0.0028760978],"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.0010328621,0.0006970067,0.0092467535,0.0007065379,0.00052320375,0.00034661058,0.00057974545,0.20186773,0.019172058,0.03153003,0.06586318,0.66843426],"study_design_scores_gemma":[0.00007796839,0.00019789946,0.0008123037,0.000045106313,0.000049911858,0.00016123164,0.00016842506,0.95280135,0.00556071,0.033392314,0.0066801487,0.000052526724],"about_ca_topic_score_codex":0.003066876,"about_ca_topic_score_gemma":0.00609398,"teacher_disagreement_score":0.005139333,"about_ca_system_score_codex":0.0011743126,"about_ca_system_score_gemma":0.0015606581,"threshold_uncertainty_score":0.017192721},"labels":[],"label_agreement":null},{"id":"W4409363183","doi":"10.1609/aaai.v39i20.35412","title":"Subgraph Invariant Learning Towards Large-Scale Graph Node Classification","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","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":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Graph; Computer science; Invariant (physics); Induced subgraph isomorphism problem; Mathematics; Combinatorics; Theoretical computer science; Artificial intelligence; Line graph; Voltage graph","score_opus":0.05231126368394066,"score_gpt":0.2983596347543106,"score_spread":0.24604837107036995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409363183","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.06313065,0.0005326239,0.9290488,0.0004770983,0.000071307666,0.000105774554,0.0006349046,0.0041821264,0.0018167152],"genre_scores_gemma":[0.7331168,0.0005110629,0.25651515,0.000516295,0.00014002394,0.00018918213,0.004103065,0.00052294123,0.004385462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992575,0.00021094324,0.000025735595,0.00028345778,0.00014970316,0.000072571864],"domain_scores_gemma":[0.9979522,0.00095668586,0.00024871627,0.0005163892,0.0002349379,0.00009096167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091695297,0.001358145,0.0010551594,0.0017710429,0.00047425355,0.00081916404,0.0022448644,0.0011922783,0.0018316967],"category_scores_gemma":[0.005202441,0.00044675314,0.001190109,0.0018765265,0.0009913949,0.002679627,0.0013610285,0.0020972546,0.00084326364],"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.00018340652,0.00021550023,0.0053375415,0.00022956084,0.00015478348,0.00023912085,0.00017767692,0.6074315,0.0085756,0.025527136,0.015987359,0.33594084],"study_design_scores_gemma":[0.000006393954,0.000020302781,0.00032705837,0.0000056378954,0.000011853558,0.000025426638,0.000017888868,0.97500503,0.0011044653,0.022792675,0.0006781992,0.0000050528556],"about_ca_topic_score_codex":0.0072464207,"about_ca_topic_score_gemma":0.011266212,"teacher_disagreement_score":0.0072464207,"about_ca_system_score_codex":0.0012949426,"about_ca_system_score_gemma":0.0009031882,"threshold_uncertainty_score":0.014408529},"labels":[],"label_agreement":null},{"id":"W4409363292","doi":"10.1609/aaai.v39i20.35489","title":"Revisiting Interpolation for Noisy Label Correction","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Digital Filter Design and Implementation","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 Calgary","funders":"Wuhan University","keywords":"Interpolation (computer graphics); Computer science; Artificial intelligence; Mathematics; Algorithm","score_opus":0.09964741772583845,"score_gpt":0.34447447673813475,"score_spread":0.2448270590122963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409363292","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.014534144,0.00045709842,0.9808257,0.00033804015,0.00011712821,0.000049090013,0.00006801629,0.002207808,0.0014028656],"genre_scores_gemma":[0.3051687,0.0005904311,0.68692565,0.00068665604,0.00033022178,0.00013641434,0.00036862624,0.00067731424,0.0051159994],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776566,0.0005689975,0.0001044019,0.0005936171,0.0008217522,0.0001455633],"domain_scores_gemma":[0.9942967,0.0022121486,0.0005330093,0.001627033,0.0011387307,0.00019231772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003920162,0.0013779452,0.0011788994,0.001527589,0.00090452784,0.0014341336,0.0028504478,0.0017296433,0.002411785],"category_scores_gemma":[0.013519615,0.0005672308,0.00081239105,0.00125694,0.0021802867,0.0033696394,0.0030033332,0.003407598,0.0015259811],"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.0004332562,0.00020436775,0.0031368504,0.00034496223,0.0001031509,0.0001913734,0.00047111665,0.1347688,0.052400738,0.039279792,0.0080269035,0.7606387],"study_design_scores_gemma":[0.000032420492,0.0001278948,0.00067103794,0.00003661285,0.000027143644,0.00019212304,0.000050404502,0.9323226,0.030958515,0.029607594,0.0059289606,0.000044591143],"about_ca_topic_score_codex":0.0023439508,"about_ca_topic_score_gemma":0.0034430493,"teacher_disagreement_score":0.003920162,"about_ca_system_score_codex":0.0012505053,"about_ca_system_score_gemma":0.0017564938,"threshold_uncertainty_score":0.020732105},"labels":[],"label_agreement":null},{"id":"W4409363315","doi":"10.1609/aaai.v39i19.34247","title":"Open-Set Cross-Network Node Classification via Unknown-Excluded Adversarial Graph Domain Alignment","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Hainan University; National Natural Science Foundation of China","keywords":"Adversarial system; Node (physics); Computer science; Graph; Set (abstract data type); Theoretical computer science; Mathematics; Combinatorics; Artificial intelligence; Physics","score_opus":0.09075551443125945,"score_gpt":0.3440935025057437,"score_spread":0.25333798807448427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409363315","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.055103634,0.0005144623,0.9386492,0.0004198981,0.00013862706,0.00013569396,0.0002045417,0.0016880463,0.003145901],"genre_scores_gemma":[0.8255001,0.00028154135,0.16369997,0.0006735799,0.00010571503,0.0002507266,0.0014702022,0.00029116127,0.0077271117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986785,0.00040940262,0.000041770138,0.0005274878,0.00020681297,0.00013597925],"domain_scores_gemma":[0.99722254,0.0012689393,0.00029934864,0.00061582914,0.00044436663,0.00014897276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00195477,0.0015832394,0.0012218847,0.00086224533,0.0006945126,0.0010493791,0.0033517675,0.0018814604,0.00234106],"category_scores_gemma":[0.004984686,0.00050551054,0.0010672158,0.00085323106,0.0014453268,0.0028332246,0.0027609013,0.0029402787,0.00093195646],"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.00022895067,0.0001923917,0.0035411923,0.00010690354,0.000117071795,0.00024203163,0.00019472862,0.7956955,0.0040704045,0.014712847,0.008245152,0.17265284],"study_design_scores_gemma":[0.000005191708,0.000021064794,0.00016852343,0.000005524047,0.000008031235,0.000028101571,0.00001610558,0.99254334,0.0010588819,0.0056251753,0.0005145829,0.0000055228775],"about_ca_topic_score_codex":0.0037222055,"about_ca_topic_score_gemma":0.004466624,"teacher_disagreement_score":0.0037222055,"about_ca_system_score_codex":0.0015621352,"about_ca_system_score_gemma":0.000783702,"threshold_uncertainty_score":0.011334121},"labels":[],"label_agreement":null},{"id":"W4409363352","doi":"10.1609/aaai.v39i22.34542","title":"Nuance Matters: Probing Epistemic Consistency in Causal Reasoning","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Epistemology, Ethics, and Metaphysics","field":"Arts and Humanities","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 Waterloo","funders":"École Polytechnique Fédérale de Lausanne","keywords":"Epistemology; Consistency (knowledge bases); Causal reasoning; Psychology; Philosophy; Computer science; Artificial intelligence; Cognition","score_opus":0.10365670077106878,"score_gpt":0.3092672336486346,"score_spread":0.20561053287756584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409363352","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.38846955,0.00048510218,0.59047157,0.002569056,0.00007162408,0.00018769689,0.0004450516,0.00094468176,0.016355636],"genre_scores_gemma":[0.95780516,0.000049842805,0.04125139,0.00012985316,0.000026119684,0.000066202374,0.0002194366,0.00014218027,0.00030972832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9709,0.016894685,0.0021152925,0.004609173,0.0046304306,0.00085042114],"domain_scores_gemma":[0.711532,0.22357696,0.021238457,0.03151862,0.009938695,0.0021952505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.031124627,0.00066325726,0.0012647217,0.004440784,0.0034017344,0.008347813,0.0028798387,0.0024986346,0.0038121014],"category_scores_gemma":[0.28419945,0.00088824664,0.0014635168,0.002916525,0.009147225,0.020731146,0.008354309,0.004786344,0.00047455385],"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.0012120265,0.0003862181,0.12517394,0.00088615925,0.00061366946,0.0007529775,0.040338982,0.049036518,0.0070066913,0.62687725,0.0018415439,0.14587413],"study_design_scores_gemma":[0.00007214939,0.00013013608,0.014998369,0.0001761796,0.00017000419,0.00033547927,0.0038701356,0.12593916,0.005369514,0.84487903,0.003945359,0.00011438855],"about_ca_topic_score_codex":0.0035909878,"about_ca_topic_score_gemma":0.002841688,"teacher_disagreement_score":0.031124627,"about_ca_system_score_codex":0.0027200177,"about_ca_system_score_gemma":0.0023192335,"threshold_uncertainty_score":0.16460472},"labels":[],"label_agreement":null},{"id":"W4409363443","doi":"10.1609/aaai.v39i20.35488","title":"Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning?","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Graph; Multiple edges; Artificial intelligence; Enhanced Data Rates for GSM Evolution; Theoretical computer science","score_opus":0.03621241705176568,"score_gpt":0.28505742627367237,"score_spread":0.2488450092219067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409363443","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.12661915,0.0014461798,0.86291766,0.0023668013,0.00025359268,0.00019823597,0.00017547498,0.0017782898,0.0042446367],"genre_scores_gemma":[0.682616,0.00057841185,0.31248358,0.0009966317,0.00014682944,0.00012943968,0.00047657583,0.0004445055,0.0021279894],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99655664,0.0014769454,0.0001461306,0.00094441284,0.00065220444,0.00022364518],"domain_scores_gemma":[0.9875257,0.0075549483,0.0008168714,0.0022480383,0.0013150774,0.0005393478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064805467,0.0014682064,0.0014976263,0.0012309713,0.00078264816,0.0017240503,0.00273514,0.0025541722,0.0019342299],"category_scores_gemma":[0.028617794,0.0004666472,0.0007941574,0.000945646,0.0024693685,0.005815296,0.002432112,0.0032918858,0.0007542576],"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.0008756705,0.0006826997,0.014602904,0.0006134526,0.0003130963,0.00028842848,0.00037434572,0.29484227,0.019206943,0.061597064,0.008864685,0.5977384],"study_design_scores_gemma":[0.000075476266,0.00046231376,0.0012574455,0.000059951533,0.000071433875,0.0001936943,0.00010201153,0.9237006,0.013297645,0.05820483,0.0025442492,0.000030332043],"about_ca_topic_score_codex":0.0014439896,"about_ca_topic_score_gemma":0.0026081123,"teacher_disagreement_score":0.0064805467,"about_ca_system_score_codex":0.0009460318,"about_ca_system_score_gemma":0.00085387076,"threshold_uncertainty_score":0.03427279},"labels":[],"label_agreement":null},{"id":"W4409363477","doi":"10.1609/aaai.v39i20.35483","title":"Textualize Visual Prompt for Image Editing via Diffusion Bridge","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bridge (graph theory); Image (mathematics); Computer science; Image editing; Diffusion; Computer graphics (images); Computer vision; Medicine; Anatomy; Physics","score_opus":0.05310875112277651,"score_gpt":0.33802019779304227,"score_spread":0.28491144667026574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409363477","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.028369205,0.00025534938,0.9657805,0.00020150159,0.00007715065,0.00007153249,0.00008577246,0.0031494717,0.0020095888],"genre_scores_gemma":[0.639405,0.0003532222,0.34623927,0.00041758624,0.00011947524,0.00022751908,0.00046044835,0.0011262222,0.011651243],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963593,0.00007435792,0.000016446656,0.0001524501,0.000087531866,0.00003326599],"domain_scores_gemma":[0.9992092,0.0002993652,0.00009826966,0.00020750109,0.00010823837,0.00007742584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073487713,0.0010646593,0.00064181816,0.00045631416,0.00025662643,0.00077915774,0.0015308267,0.0011588328,0.003881426],"category_scores_gemma":[0.0037306729,0.00034225004,0.000670763,0.00033015432,0.00079138414,0.0022430099,0.0014726853,0.0017097603,0.0011951175],"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.00044311807,0.00037857174,0.00093677087,0.00038519222,0.00007492123,0.00031131375,0.00055061275,0.323811,0.13816708,0.036388807,0.0092178155,0.4893347],"study_design_scores_gemma":[0.000025450028,0.00010162201,0.00018046453,0.000008614588,0.000011828286,0.00008664094,0.000031851087,0.970553,0.015456383,0.011049033,0.0024764123,0.000018710669],"about_ca_topic_score_codex":0.0012589312,"about_ca_topic_score_gemma":0.0018374012,"teacher_disagreement_score":0.003881426,"about_ca_system_score_codex":0.0005096678,"about_ca_system_score_gemma":0.00045889016,"threshold_uncertainty_score":0.012984633},"labels":[],"label_agreement":null},{"id":"W4409363516","doi":"10.1609/aaai.v39i19.34200","title":"Leveraging Group Classification with Descending Soft Labeling for Deep Imbalanced Regression","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Artificial intelligence; Regression; Group (periodic table); Computer science; Pattern recognition (psychology); Natural language processing; Statistics; Mathematics; Chemistry","score_opus":0.07752779049181162,"score_gpt":0.3199438742680034,"score_spread":0.24241608377619178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409363516","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.025478544,0.00021482611,0.97207975,0.00040243362,0.000048464262,0.00005918077,0.0000697268,0.0007837027,0.0008634052],"genre_scores_gemma":[0.583121,0.00023652347,0.40965626,0.00081002456,0.00021966662,0.00031722093,0.00083800487,0.00035743113,0.0044437735],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971655,0.0011014045,0.00013165105,0.00065278495,0.000667073,0.00028147982],"domain_scores_gemma":[0.99496377,0.0020835728,0.0007293453,0.0011879837,0.000631892,0.00040338532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056626652,0.0017177247,0.0021221854,0.00129311,0.0009438445,0.0015960399,0.002962012,0.0019590736,0.002044957],"category_scores_gemma":[0.012246654,0.0006311331,0.0009194599,0.0014445184,0.0020302245,0.0035849528,0.003977106,0.0037636275,0.001024121],"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.0009098075,0.0006313982,0.008389244,0.00022767171,0.00016877757,0.00027555978,0.0007413681,0.43056396,0.009703865,0.053617124,0.009238401,0.48553276],"study_design_scores_gemma":[0.000023112232,0.00008017209,0.00024042811,0.000014532964,0.000012467233,0.00002479207,0.000033438206,0.97053325,0.0014719162,0.026706485,0.0008490235,0.000010478858],"about_ca_topic_score_codex":0.0022462306,"about_ca_topic_score_gemma":0.0040096953,"teacher_disagreement_score":0.0056626652,"about_ca_system_score_codex":0.0014907959,"about_ca_system_score_gemma":0.0019381285,"threshold_uncertainty_score":0.0299474},"labels":[],"label_agreement":null},{"id":"W4409363537","doi":"10.1609/aaai.v39i19.34197","title":"Federated Unsupervised Domain Generalization Using Global and Local Alignment of Gradients","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Generalization; Domain (mathematical analysis); Computer science; Artificial intelligence; Mathematics","score_opus":0.05622118777486132,"score_gpt":0.3013968096862158,"score_spread":0.24517562191135447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409363537","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.03066895,0.00018895969,0.9651487,0.00017810978,0.00002822633,0.00006887903,0.00009988396,0.0028062698,0.0008120563],"genre_scores_gemma":[0.60999316,0.00017410493,0.38488021,0.00044761607,0.00007233657,0.00017952936,0.0008901658,0.00038879953,0.0029740343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987679,0.00037130032,0.00005606331,0.00048746594,0.00021075786,0.00010647605],"domain_scores_gemma":[0.9971547,0.0008667086,0.00023706132,0.0012667475,0.00033507132,0.00013971582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017762876,0.001118866,0.0018271279,0.0011654211,0.0008127584,0.0012758973,0.002325345,0.0014421523,0.0010910991],"category_scores_gemma":[0.0055434443,0.0005575306,0.0012098415,0.001262146,0.0014676313,0.0033796467,0.002857584,0.0023150041,0.00074064004],"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.0002647138,0.00044593227,0.0061667105,0.00013736381,0.00026615366,0.00032077235,0.00048421236,0.52022403,0.018020395,0.016132437,0.0075459844,0.4299914],"study_design_scores_gemma":[0.000011409589,0.000034388453,0.00036230686,0.0000067772053,0.0000106419775,0.00008466012,0.000039092512,0.98020613,0.003651074,0.014700748,0.00087852357,0.000014237335],"about_ca_topic_score_codex":0.004002918,"about_ca_topic_score_gemma":0.0066066217,"teacher_disagreement_score":0.004002918,"about_ca_system_score_codex":0.00103836,"about_ca_system_score_gemma":0.0013118765,"threshold_uncertainty_score":0.00939405},"labels":[],"label_agreement":null},{"id":"W4409363563","doi":"10.1609/aaai.v39i21.34449","title":"ConFREE: Conflict-free Client Update Aggregation for Personalized Federated Learning","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"China Scholarship Council; Central South University; National Natural Science Foundation of China","keywords":"Computer science; Federated learning; World Wide Web; Information retrieval; Artificial intelligence","score_opus":0.07828572336310798,"score_gpt":0.32253392309055373,"score_spread":0.24424819972744577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409363563","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.030770622,0.0003004133,0.96275705,0.00034361644,0.00005933025,0.0001194582,0.000081291044,0.0038811779,0.0016871621],"genre_scores_gemma":[0.6993769,0.0001616652,0.29556033,0.00044227522,0.00008863694,0.00017286546,0.0003367407,0.00028625468,0.0035743844],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968059,0.001038262,0.00020148515,0.00058963423,0.0010068404,0.00035782022],"domain_scores_gemma":[0.99335116,0.0020700675,0.00047502067,0.0028526476,0.0009003715,0.00035081958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004728679,0.00092305266,0.0015861192,0.0007603681,0.0010744823,0.0016995976,0.0038797078,0.0015576006,0.0019738607],"category_scores_gemma":[0.014082582,0.00046145276,0.0007269429,0.0013804625,0.001099682,0.004558253,0.0038475809,0.0024776526,0.0007517808],"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.0005364595,0.0005708169,0.0056370073,0.00013321415,0.00015529165,0.00021401593,0.00059548824,0.36182982,0.0062006433,0.02805231,0.011239429,0.5848355],"study_design_scores_gemma":[0.000024992714,0.00007247865,0.00021308105,0.000007701165,0.000015377884,0.00009425623,0.000054873675,0.98337656,0.0024028132,0.012261636,0.0014629262,0.000013249613],"about_ca_topic_score_codex":0.0036631743,"about_ca_topic_score_gemma":0.0056779413,"teacher_disagreement_score":0.004728679,"about_ca_system_score_codex":0.0011803072,"about_ca_system_score_gemma":0.0022658943,"threshold_uncertainty_score":0.025007904},"labels":[],"label_agreement":null},{"id":"W4409363599","doi":"10.1609/aaai.v39i25.34873","title":"Inapproximability of Optimal Multi-Agent Pathfinding Problems","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada; Lakehead University","keywords":"Pathfinding; Computer science; Theoretical computer science; Shortest path problem","score_opus":0.09230795298380508,"score_gpt":0.3135191796714521,"score_spread":0.22121122668764703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409363599","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.225233,0.0032789204,0.71593016,0.008307128,0.00016779017,0.00033249668,0.0015713794,0.0012037111,0.04397544],"genre_scores_gemma":[0.8016281,0.002271004,0.1865194,0.0006631247,0.00030807857,0.0005658613,0.0016584197,0.00031909387,0.0060668467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99595463,0.0015007869,0.00020549144,0.0009036779,0.0008064489,0.0006289522],"domain_scores_gemma":[0.9619928,0.033743735,0.0014747473,0.0014910664,0.0007570458,0.0005406017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044387206,0.0016868471,0.0021115567,0.0014160986,0.0014419353,0.005487994,0.0035347189,0.0024603219,0.00647841],"category_scores_gemma":[0.034778897,0.0011723215,0.002180827,0.0021496285,0.0031627496,0.00630824,0.0027423813,0.0049739485,0.0008472137],"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.00044254097,0.0003735968,0.0028315804,0.0008193555,0.00014246086,0.00022342967,0.0006153971,0.76252365,0.0017551912,0.18281971,0.007778211,0.039674908],"study_design_scores_gemma":[0.0000768447,0.00008937712,0.00042514745,0.00009210274,0.00003830869,0.00013545832,0.00023044104,0.6978073,0.0013435503,0.29736942,0.002371119,0.00002091067],"about_ca_topic_score_codex":0.0032785018,"about_ca_topic_score_gemma":0.0028666856,"teacher_disagreement_score":0.00647841,"about_ca_system_score_codex":0.0029806092,"about_ca_system_score_gemma":0.0023052262,"threshold_uncertainty_score":0.023474455},"labels":[],"label_agreement":null},{"id":"W4409363673","doi":"10.1609/aaai.v39i18.34151","title":"OmniCount: Multi-label Object Counting with Semantic-Geometric Priors","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Data Management and Algorithms","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":"Simon Fraser University","funders":"","keywords":"Prior probability; Object (grammar); Computer science; Artificial intelligence; Mathematics; Pattern recognition (psychology); Bayesian probability","score_opus":0.06264939534395512,"score_gpt":0.29685181977362796,"score_spread":0.23420242442967282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409363673","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.05918763,0.0054241884,0.5033812,0.0013467921,0.0010432224,0.0015744497,0.07619249,0.32900855,0.022841442],"genre_scores_gemma":[0.11869384,0.0008039332,0.67094475,0.0011355453,0.00020479182,0.0009197733,0.18810157,0.011236948,0.007958889],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950612,0.0006328169,0.00027415156,0.0018609655,0.0016613501,0.0005094608],"domain_scores_gemma":[0.99364024,0.0019485378,0.00042461423,0.0024649377,0.0011580272,0.00036365743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003315787,0.0053212307,0.0027705545,0.0059695966,0.002177273,0.0054630535,0.009993491,0.0045515224,0.008236581],"category_scores_gemma":[0.01368552,0.001633051,0.0028047706,0.0054582236,0.0017632489,0.006451815,0.006620713,0.0043643294,0.0076968158],"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.0013183418,0.00074449956,0.012749476,0.0027114647,0.0005404026,0.00041032166,0.00047230028,0.059944496,0.017052973,0.016335772,0.41240862,0.47531134],"study_design_scores_gemma":[0.00034351228,0.00029620592,0.005606516,0.0003197761,0.00012602883,0.00086752063,0.0004015242,0.7913219,0.02595071,0.02760039,0.1469981,0.00016787625],"about_ca_topic_score_codex":0.043468602,"about_ca_topic_score_gemma":0.090151,"teacher_disagreement_score":0.043468602,"about_ca_system_score_codex":0.0040340675,"about_ca_system_score_gemma":0.0034840698,"threshold_uncertainty_score":0.086431146},"labels":[],"label_agreement":null},{"id":"W4409363731","doi":"10.1609/aaai.v39i18.34118","title":"Effects of Momentum in Implicit Bias of Gradient Flow for Diagonal Linear Networks","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Traffic control and management","field":"Engineering","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Diagonal; Mechanics; Momentum (technical analysis); Flow (mathematics); Mathematics; Statistical physics; Physics; Classical mechanics; Applied mathematics; Geometry; Economics; Financial economics","score_opus":0.02666595113840755,"score_gpt":0.25295396601291187,"score_spread":0.2262880148745043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409363731","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.08756829,0.0012482812,0.9054041,0.0012581316,0.00017328198,0.000073055286,0.00007505933,0.0006952723,0.003504484],"genre_scores_gemma":[0.80090934,0.0011371415,0.19255291,0.0005892775,0.00022157827,0.0001653147,0.00019664378,0.00042902527,0.0037987716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985808,0.0006549023,0.00008526826,0.00027479083,0.00027903088,0.0001252914],"domain_scores_gemma":[0.9890075,0.007783667,0.00069846277,0.0010955454,0.0011161234,0.00029869506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052050822,0.0013024464,0.0010534337,0.00056281185,0.00069935655,0.0015111882,0.00124634,0.0016694386,0.0017877145],"category_scores_gemma":[0.030544695,0.0005464439,0.0005955407,0.00045212897,0.0024792242,0.0036516364,0.0027646506,0.0028783123,0.0003526981],"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.0005817427,0.00019562019,0.0078025716,0.0004413472,0.00017726641,0.00029102524,0.00044820545,0.6674063,0.012790059,0.14475237,0.0033604833,0.16175306],"study_design_scores_gemma":[0.000022742961,0.00007987037,0.00052878336,0.000036714435,0.000015832116,0.000050041217,0.00001934543,0.9723929,0.0023142942,0.023881763,0.0006440312,0.000013707097],"about_ca_topic_score_codex":0.0024631615,"about_ca_topic_score_gemma":0.0030178404,"teacher_disagreement_score":0.0052050822,"about_ca_system_score_codex":0.0012236428,"about_ca_system_score_gemma":0.0013281475,"threshold_uncertainty_score":0.027527452},"labels":[],"label_agreement":null},{"id":"W4409363778","doi":"10.1609/aaai.v39i24.34710","title":"Tuning-Free Accountable Intervention for LLM Deployment – a Metacognitive Approach","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Software deployment; Metacognition; Intervention (counseling); Psychology; Psychotherapist; Computer science; Neuroscience; Cognition; Psychiatry","score_opus":0.0874622275211003,"score_gpt":0.3196241001394326,"score_spread":0.2321618726183323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409363778","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.01219599,0.000048730257,0.97824484,0.00096251187,0.00002713608,0.00012106188,0.00005816484,0.0044424064,0.0038991377],"genre_scores_gemma":[0.596769,0.00008269432,0.39936802,0.0003429103,0.000037964463,0.0003409081,0.00015284817,0.0005494665,0.0023561702],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99527586,0.0024059822,0.00025875084,0.0009975486,0.00072674017,0.00033515677],"domain_scores_gemma":[0.9837177,0.008580399,0.0013246819,0.00472632,0.0009662324,0.0006846797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005541226,0.0014608923,0.0007498354,0.0011144186,0.00091823784,0.003593857,0.0037241955,0.001808023,0.0063358047],"category_scores_gemma":[0.0383561,0.0008145855,0.0009586867,0.0004851817,0.0029289508,0.006504168,0.0061382665,0.0033090191,0.0012028401],"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.0008058372,0.0008195982,0.010311922,0.0005254583,0.00025646944,0.001047172,0.009552148,0.15691538,0.024815425,0.3481556,0.0076261265,0.43916884],"study_design_scores_gemma":[0.000071377035,0.00012634056,0.0008777018,0.00009917207,0.000075717595,0.00016836164,0.000449328,0.70404744,0.01107446,0.2717128,0.011217315,0.00007994215],"about_ca_topic_score_codex":0.002913059,"about_ca_topic_score_gemma":0.002925303,"teacher_disagreement_score":0.0063358047,"about_ca_system_score_codex":0.0014370832,"about_ca_system_score_gemma":0.0024286348,"threshold_uncertainty_score":0.0293051},"labels":[],"label_agreement":null},{"id":"W4409363781","doi":"10.1609/aaai.v39i20.35426","title":"Cluster Based Heterogeneous Federated Foundation Model Adaptation and Fine-Tuning","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Simulation and Modeling Applications","field":"Engineering","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":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Foundation (evidence); Cluster (spacecraft); Adaptation (eye); Computer science; Distributed computing; Computer network; Geography; Biology","score_opus":0.08646378582454668,"score_gpt":0.29678786343941055,"score_spread":0.21032407761486388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409363781","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.06058567,0.00034855353,0.92754763,0.00031368696,0.000060219823,0.000098805955,0.00020757847,0.007905981,0.0029319327],"genre_scores_gemma":[0.8169507,0.00015100476,0.17828184,0.00026898156,0.000031116484,0.00013860979,0.000909507,0.0004256365,0.0028425294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897873,0.0002013202,0.000042212007,0.00036606414,0.00023661171,0.00017510445],"domain_scores_gemma":[0.9986926,0.00036447166,0.000091764276,0.00046974595,0.00027112395,0.00011034062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014830141,0.001209906,0.0017063869,0.00070145074,0.00085910934,0.0011470376,0.003870674,0.0012631292,0.0028080922],"category_scores_gemma":[0.0037537513,0.00064081326,0.0010918305,0.000971087,0.0008740216,0.0023604082,0.0027664367,0.0016809561,0.0007106223],"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.00020343612,0.00017401477,0.0014232883,0.000054985485,0.00008052391,0.00011585671,0.00010226251,0.90354526,0.002947203,0.0041070622,0.0041015963,0.08314456],"study_design_scores_gemma":[0.000007930823,0.000012355826,0.000073701565,0.0000021521514,0.000004885172,0.000011747765,0.000014075366,0.99704343,0.0005439065,0.0019418757,0.0003398682,0.0000040467453],"about_ca_topic_score_codex":0.015073944,"about_ca_topic_score_gemma":0.014656443,"teacher_disagreement_score":0.015073944,"about_ca_system_score_codex":0.0014217361,"about_ca_system_score_gemma":0.0020308972,"threshold_uncertainty_score":0.029972434},"labels":[],"label_agreement":null},{"id":"W4409363782","doi":"10.1609/aaai.v39i18.34131","title":"Sequential Conditional Transport on Probabilistic Graphs for Interpretable Counterfactual Fairness","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche; Aix-Marseille Université","keywords":"Counterfactual thinking; Probabilistic logic; Econometrics; Computer science; Mathematics; Artificial intelligence; Psychology; Social psychology","score_opus":0.048220289045339586,"score_gpt":0.31205897222308016,"score_spread":0.26383868317774056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409363782","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.0038860452,0.00010269545,0.99357754,0.00031475106,0.000036794034,0.00005257841,0.0000713733,0.000097179574,0.0018609822],"genre_scores_gemma":[0.5236061,0.00061525975,0.46903375,0.0006929297,0.0002720535,0.0007555103,0.0005147776,0.00048237812,0.004027162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9883272,0.0075010587,0.0006270155,0.0016298216,0.0014311865,0.00048375124],"domain_scores_gemma":[0.9426078,0.04567082,0.003209916,0.0062627527,0.0017277813,0.0005209477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022470651,0.0015186382,0.0019661346,0.0031739378,0.0014484918,0.0037627977,0.0032956677,0.002910209,0.00991197],"category_scores_gemma":[0.08893368,0.0010636725,0.0033255336,0.0026714695,0.0065884264,0.010826892,0.0045780083,0.005452801,0.0007615903],"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.00003818531,0.0000187767,0.00028618998,0.00005632718,0.000038503593,0.000066617446,0.00010078571,0.11653951,0.00014418656,0.8736498,0.0004350805,0.008626054],"study_design_scores_gemma":[0.000009132101,0.000010983999,0.000054510227,0.000019105239,0.000011228499,0.000020165919,0.000012300123,0.21860611,0.00018438709,0.78037345,0.0006870665,0.000011526434],"about_ca_topic_score_codex":0.0030484363,"about_ca_topic_score_gemma":0.002059311,"teacher_disagreement_score":0.022470651,"about_ca_system_score_codex":0.004334409,"about_ca_system_score_gemma":0.0037475098,"threshold_uncertainty_score":0.118837595},"labels":[],"label_agreement":null},{"id":"W4409363815","doi":"10.1609/aaai.v39i21.34421","title":"HVAdam: A Full-Dimension Adaptive Optimizer","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Parallel Computing and Optimization Techniques","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 Calgary","funders":"Wuhan University","keywords":"Dimension (graph theory); Fourth Dimension; Mathematics; Computer science; Mathematical optimization; Physics; Combinatorics","score_opus":0.055197277646863774,"score_gpt":0.2981781979622881,"score_spread":0.24298092031542434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409363815","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.007685094,0.0009436469,0.9826082,0.0002640285,0.00015910776,0.00006575035,0.00019439077,0.0053157522,0.0027639766],"genre_scores_gemma":[0.30959192,0.00063225906,0.6758462,0.001127935,0.00017308738,0.00042452282,0.0010901863,0.0018926954,0.009221218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939895,0.00020952482,0.000030377183,0.00017200904,0.00014168522,0.00004743191],"domain_scores_gemma":[0.99941885,0.00026913424,0.00004558772,0.0001237514,0.0001016593,0.000040972194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013417124,0.0014297651,0.0012624689,0.00053279777,0.0003487462,0.0008944588,0.0019717333,0.0017510733,0.0034924308],"category_scores_gemma":[0.002768429,0.00068782596,0.0010308861,0.00043554234,0.00071636384,0.0011662635,0.0015204381,0.0025066445,0.0016599637],"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.00020002283,0.000083270505,0.0009919035,0.00017519094,0.00020747217,0.00012395182,0.000075990945,0.72081405,0.0060702497,0.013769628,0.018967424,0.23852092],"study_design_scores_gemma":[0.00001864019,0.000024231535,0.00007631305,0.0000076138836,0.0000078628145,0.000025929046,0.0000033767462,0.9938114,0.0009397916,0.0032140594,0.0018620789,0.000008577558],"about_ca_topic_score_codex":0.002734166,"about_ca_topic_score_gemma":0.003896349,"teacher_disagreement_score":0.0034924308,"about_ca_system_score_codex":0.0005612008,"about_ca_system_score_gemma":0.00097226136,"threshold_uncertainty_score":0.011683404},"labels":[],"label_agreement":null},{"id":"W4409363931","doi":"10.1609/aaai.v39i19.34224","title":"Cherry-Picking in Time Series Forecasting: How to Select Datasets to Make Your Model Shine","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Time Series Analysis and Forecasting","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":"Dalhousie University","funders":"European Regional Development Fund; Fundação para a Ciência e a Tecnologia; HORIZON EUROPE Framework Programme; European Commission","keywords":"Series (stratigraphy); Time series; Computer science; Artificial intelligence; Machine learning; Data mining; Geology","score_opus":0.08945305177106444,"score_gpt":0.2955514333811198,"score_spread":0.20609838161005534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409363931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22737682,0.009383584,0.69913715,0.041152567,0.0018372983,0.0021710824,0.0049894075,0.004659078,0.009293099],"genre_scores_gemma":[0.48052508,0.0020269372,0.5061094,0.0040038223,0.0005777101,0.0015104683,0.0036927264,0.0006104847,0.0009433017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9696408,0.021817524,0.0017681689,0.0028059462,0.003404476,0.00056301954],"domain_scores_gemma":[0.84218854,0.11440181,0.008362076,0.022395968,0.010685155,0.0019664827],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.062323015,0.0020384775,0.0027773634,0.0040194057,0.0019074033,0.006127466,0.0032159905,0.0039796173,0.0019337705],"category_scores_gemma":[0.27373374,0.0010689431,0.0014789983,0.003900593,0.0021549258,0.012454069,0.0035116184,0.005154202,0.0017215507],"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.0027810596,0.0010999036,0.089420795,0.0020457113,0.0012207156,0.00041710088,0.0025208,0.12050924,0.008582003,0.036840912,0.07544374,0.659118],"study_design_scores_gemma":[0.0013928019,0.0019019479,0.029872542,0.0039315936,0.00053732464,0.0006444542,0.003968202,0.60373706,0.021464815,0.28034592,0.05146805,0.0007352356],"about_ca_topic_score_codex":0.002575281,"about_ca_topic_score_gemma":0.003385173,"teacher_disagreement_score":0.93767697,"about_ca_system_score_codex":0.0013160808,"about_ca_system_score_gemma":0.0026482579,"threshold_uncertainty_score":0.32959956},"labels":[],"label_agreement":null},{"id":"W4409364009","doi":"10.1609/aaai.v39i17.33927","title":"COMMIT: Certifying Robustness of Multi-Sensor Fusion Systems Against Semantic Attacks","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI 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":"Simon Fraser University","funders":"Defense Advanced Research Projects Agency; Nuclear Safety and Security Commission; National Aeronautics and Space Administration; National Science Foundation","keywords":"Commit; Robustness (evolution); Computer science; Fusion; Sensor fusion; Computer security; Artificial intelligence; Chemistry; Database; Philosophy","score_opus":0.08277057206455064,"score_gpt":0.32410618425320586,"score_spread":0.24133561218865524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409364009","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.06696615,0.000363569,0.92369854,0.000463149,0.00013081546,0.00018843374,0.00024055986,0.0045555937,0.0033932033],"genre_scores_gemma":[0.9437275,0.0001192511,0.054452658,0.00015946302,0.000039616454,0.0001116455,0.00040265656,0.00021623487,0.00077093305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953702,0.0010641629,0.00028673885,0.0007706187,0.001856195,0.00065205194],"domain_scores_gemma":[0.98325366,0.0067013483,0.0015658367,0.0052525876,0.0026919264,0.00053465803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055704615,0.0012371453,0.0012556734,0.0010969933,0.001010957,0.0019340853,0.0021820976,0.0019658727,0.002417856],"category_scores_gemma":[0.03402281,0.0004388351,0.0012006052,0.00057263527,0.0026858528,0.0031209858,0.004429934,0.0024821728,0.00056639797],"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.00041339363,0.0000878033,0.0041858843,0.0002149531,0.00010738912,0.0002534949,0.00020951228,0.8635282,0.015533023,0.043728348,0.0039146994,0.06782336],"study_design_scores_gemma":[0.000031318057,0.00012776504,0.00046544723,0.000019747473,0.000013578389,0.00008071824,0.00005356608,0.9731495,0.009856341,0.014954567,0.0012231389,0.000024341101],"about_ca_topic_score_codex":0.0034100928,"about_ca_topic_score_gemma":0.0020036974,"teacher_disagreement_score":0.0055704615,"about_ca_system_score_codex":0.0021086903,"about_ca_system_score_gemma":0.003024447,"threshold_uncertainty_score":0.029459715},"labels":[],"label_agreement":null},{"id":"W4409364177","doi":"10.1609/aaai.v39i17.33989","title":"TimeCAP: Learning to Contextualize, Augment, and Predict Time Series Events with Large Language Model Agents","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","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":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; Korea Advanced Institute of Science and Technology; National Research Foundation of Korea; National Research Foundation","keywords":"Augment; Series (stratigraphy); Computer science; Linguistics; Philosophy; Biology","score_opus":0.034253247239254575,"score_gpt":0.2902851378484357,"score_spread":0.2560318906091811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409364177","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.033833124,0.0012498872,0.94599664,0.0008154284,0.00031790382,0.00016911254,0.0020067918,0.013234845,0.0023763825],"genre_scores_gemma":[0.45466065,0.0009882041,0.52970564,0.0009765124,0.00034896896,0.0005161205,0.0067546056,0.00064766116,0.005401657],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948883,0.00016320928,0.000027387241,0.00020330094,0.00007955724,0.00003759086],"domain_scores_gemma":[0.99830437,0.0011122399,0.00014042249,0.00019001444,0.00017304625,0.00007991378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011250676,0.0018132336,0.00066583714,0.00087389705,0.00047815003,0.0011166752,0.001413855,0.0009967164,0.002386753],"category_scores_gemma":[0.0049700513,0.0004906588,0.001288145,0.0008326974,0.0004561987,0.0027372325,0.0018123207,0.0025005224,0.0014205578],"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.0005754271,0.0007434528,0.008652894,0.0005168556,0.00039482914,0.00062148646,0.00067160657,0.31049913,0.018947653,0.014729146,0.031441655,0.6122059],"study_design_scores_gemma":[0.000011137735,0.00005329177,0.00032308194,0.000018469946,0.000030924555,0.000035092977,0.000039342733,0.98767763,0.0022700445,0.0069118356,0.0026106471,0.000018542676],"about_ca_topic_score_codex":0.0072253854,"about_ca_topic_score_gemma":0.012785613,"teacher_disagreement_score":0.0072253854,"about_ca_system_score_codex":0.00058590976,"about_ca_system_score_gemma":0.0012372738,"threshold_uncertainty_score":0.014366686},"labels":[],"label_agreement":null},{"id":"W4409364181","doi":"10.1609/aaai.v39i16.33809","title":"Learning Regularization for Graph Inverse Problems","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and ELM","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":"Engineering and Physical Sciences Research Council","keywords":"Regularization (linguistics); Inverse problem; Graph; Inverse; Mathematics; Computer science; Artificial intelligence; Applied mathematics; Theoretical computer science; Mathematical analysis","score_opus":0.04268476056366192,"score_gpt":0.2866678817304282,"score_spread":0.24398312116676626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409364181","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.0062714703,0.00071737764,0.98822916,0.0010963585,0.00007823501,0.000027170932,0.000055645854,0.00014606136,0.0033786246],"genre_scores_gemma":[0.4103908,0.0024268103,0.56743044,0.001560627,0.0006920969,0.0005885971,0.00084532803,0.0005738112,0.015491454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913955,0.00041715635,0.000029802843,0.00015411628,0.00019879905,0.00006056654],"domain_scores_gemma":[0.9969902,0.0022642424,0.00018417739,0.00017415511,0.00027544532,0.00011167505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021119185,0.0016530014,0.0014554489,0.0010491806,0.0005969674,0.0011729985,0.0012835994,0.0026290321,0.0029707514],"category_scores_gemma":[0.008604099,0.00075763435,0.0009799298,0.00090672256,0.0023822372,0.0020174407,0.0024645692,0.003863059,0.0005326607],"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.00004912526,0.00007077215,0.0006537778,0.000324227,0.00008913514,0.00013244669,0.000116388714,0.7491216,0.0015643742,0.1996862,0.0074268277,0.04076517],"study_design_scores_gemma":[0.000008591393,0.000011005223,0.000056547833,0.00001788528,0.0000043225214,0.000017998023,0.000012390049,0.90994054,0.00014221127,0.08841973,0.0013628977,0.0000058196842],"about_ca_topic_score_codex":0.0037172702,"about_ca_topic_score_gemma":0.0048039905,"teacher_disagreement_score":0.0037172702,"about_ca_system_score_codex":0.0013546454,"about_ca_system_score_gemma":0.0012278219,"threshold_uncertainty_score":0.011169016},"labels":[],"label_agreement":null},{"id":"W4409364186","doi":"10.1609/aaai.v39i17.33935","title":"Association Pattern-enhanced Molecular Representation Learning","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Computational Drug Discovery Methods","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":"Artificial Intelligence in Medicine (Canada)","funders":"National Natural Science Foundation of China","keywords":"Association (psychology); Representation (politics); Computational biology; Computer science; Chemistry; Artificial intelligence; Psychology; Biology; Psychotherapist","score_opus":0.04673274341988388,"score_gpt":0.3413920713814685,"score_spread":0.2946593279615846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409364186","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.036036573,0.00032392528,0.9573823,0.00032027377,0.000061772516,0.00008450923,0.00042635534,0.0040564835,0.0013077247],"genre_scores_gemma":[0.5970077,0.00050256687,0.3937376,0.00045637967,0.00011329958,0.0003122981,0.003250716,0.00025358438,0.0043656956],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993814,0.00015047811,0.00003805637,0.00018901996,0.00016852765,0.00007248561],"domain_scores_gemma":[0.99850816,0.0006738643,0.00016875417,0.0003393737,0.00025447799,0.000055295724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009409995,0.00091179326,0.0010060737,0.0011296108,0.0002798759,0.0008353163,0.0021439868,0.0011926293,0.0027065908],"category_scores_gemma":[0.0038761368,0.00036503593,0.0009666963,0.0015849198,0.00042992833,0.0019601432,0.0013099625,0.001962203,0.0011081594],"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.00021553283,0.0002611185,0.0018472652,0.00018568894,0.000095795,0.00011908302,0.000067248235,0.25505307,0.008699722,0.00880684,0.0068452144,0.71780354],"study_design_scores_gemma":[0.0000102731055,0.00003558583,0.00014877459,0.0000043609425,0.0000102545955,0.000027019372,0.000005861483,0.9920711,0.0020810778,0.004891489,0.00070918875,0.0000049625073],"about_ca_topic_score_codex":0.002451382,"about_ca_topic_score_gemma":0.0025538807,"teacher_disagreement_score":0.0027065908,"about_ca_system_score_codex":0.00053108024,"about_ca_system_score_gemma":0.0008895192,"threshold_uncertainty_score":0.009054422},"labels":[],"label_agreement":null},{"id":"W4409364220","doi":"10.1609/aaai.v39i17.33957","title":"GenPlan: Generative Sequence Models as Adaptive Planners","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Model-Driven Software Engineering Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Generative grammar; Sequence (biology); Computer science; Artificial intelligence; Biology","score_opus":0.10348139390471484,"score_gpt":0.31053444150108045,"score_spread":0.2070530475963656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409364220","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.004047333,0.00025803281,0.9923475,0.00020450696,0.000034757846,0.00004176697,0.00018708572,0.0014431815,0.00143593],"genre_scores_gemma":[0.39663944,0.00094031804,0.5922936,0.00046141018,0.000115600385,0.00074849144,0.0015370817,0.0010838313,0.006180142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941206,0.0002109986,0.000025364143,0.00014990105,0.00014863355,0.000052960906],"domain_scores_gemma":[0.99823284,0.001339994,0.00010642277,0.00014154824,0.00008809506,0.000091092305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011613353,0.0012796182,0.00095432333,0.0007238649,0.00038566595,0.001100005,0.0023091282,0.0014518843,0.0040480085],"category_scores_gemma":[0.004708308,0.0010031238,0.0012093794,0.0007717998,0.0014655497,0.0015369575,0.0018484163,0.0025576842,0.0009389937],"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.00004264864,0.000016338381,0.00024124613,0.000048430957,0.00001789623,0.00004569522,0.00005026963,0.9518292,0.00060790166,0.024350923,0.0013529063,0.021396521],"study_design_scores_gemma":[0.000008757323,0.00000737193,0.000019425172,0.0000052421483,0.0000026583962,0.000008639199,0.000002934276,0.9798656,0.00023132787,0.018955255,0.0008890316,0.0000036247848],"about_ca_topic_score_codex":0.0077246646,"about_ca_topic_score_gemma":0.010258837,"teacher_disagreement_score":0.0077246646,"about_ca_system_score_codex":0.001383958,"about_ca_system_score_gemma":0.0019170329,"threshold_uncertainty_score":0.015359402},"labels":[],"label_agreement":null},{"id":"W4409364279","doi":"10.1609/aaai.v39i16.33917","title":"Analytical-Chemistry-Informed Transformer for Infrared Spectra Modeling","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Spectroscopy and Chemometric Analyses","field":"Chemistry","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":"University of Alberta","funders":"","keywords":"Transformer; Infrared spectroscopy; Infrared; Spectral line; Analytical Chemistry (journal); Chemistry; Computer science; Engineering; Environmental chemistry; Physics; Electrical engineering; Organic chemistry; Optics; Voltage; Astronomy","score_opus":0.07794249129309727,"score_gpt":0.3422450982234941,"score_spread":0.2643026069303968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409364279","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.008024212,0.00016851604,0.98902273,0.00019591332,0.00003095185,0.000033201228,0.00011932551,0.0011229245,0.0012822427],"genre_scores_gemma":[0.64455676,0.000619218,0.34528032,0.0006999727,0.0001037038,0.00020180321,0.0010425141,0.00030410208,0.0071915397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999548,0.00009068159,0.000023678007,0.00014157467,0.00014500569,0.000050946608],"domain_scores_gemma":[0.9993318,0.00027692053,0.000085387415,0.000114779315,0.00014173963,0.00004928271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010298761,0.0010299545,0.00072166114,0.00087754516,0.00033293644,0.0009599303,0.002313459,0.0009946385,0.003088203],"category_scores_gemma":[0.0028144214,0.00044617627,0.0012841149,0.0007493964,0.00092502654,0.0028359243,0.0017212492,0.0017821454,0.0009807537],"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.00026780445,0.00022822643,0.0018515507,0.00020373313,0.000098258424,0.00021809817,0.00011136093,0.7012839,0.018334484,0.046423394,0.003859228,0.22711998],"study_design_scores_gemma":[0.000004390942,0.000015367255,0.00005863586,0.0000030770934,0.0000073387882,0.000025076964,0.0000047777185,0.9862758,0.002312214,0.010702904,0.00058579276,0.0000046100668],"about_ca_topic_score_codex":0.0033003024,"about_ca_topic_score_gemma":0.0045133284,"teacher_disagreement_score":0.0033003024,"about_ca_system_score_codex":0.0012090045,"about_ca_system_score_gemma":0.0016084472,"threshold_uncertainty_score":0.010331094},"labels":[],"label_agreement":null},{"id":"W4409364328","doi":"10.1609/aaai.v39i16.33811","title":"Free Lunch in the Forest: Functionally-Identical Pruning of Boosted Tree Ensembles","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Insect and Arachnid Ecology and Behavior","field":"Biochemistry, Genetics and Molecular Biology","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":"Polytechnique Montréal","funders":"","keywords":"Pruning; Tree (set theory); Forestry; Mathematics; Artificial intelligence; Computer science; Geography; Biology; Botany; Combinatorics","score_opus":0.03789325234707073,"score_gpt":0.29375491382085944,"score_spread":0.2558616614737887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409364328","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.047784593,0.00046300062,0.94827825,0.00024544346,0.000109430985,0.000055252254,0.000088321576,0.0010066512,0.0019689905],"genre_scores_gemma":[0.67903763,0.0002270764,0.31590667,0.00054565293,0.00017220977,0.00015706278,0.00059281493,0.00041173273,0.0029491684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871075,0.00048010395,0.00005639207,0.00024396586,0.00035518565,0.00015362423],"domain_scores_gemma":[0.99675435,0.0017570701,0.00017140048,0.00079403364,0.00037579713,0.00014731043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030199771,0.0009294354,0.0017914054,0.0006637707,0.00083474256,0.0009345832,0.0020924998,0.0015273839,0.001654239],"category_scores_gemma":[0.00873381,0.0006288691,0.0010217995,0.00063959055,0.0009390734,0.0016509459,0.0019413854,0.002344602,0.0005497356],"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.00017535652,0.000117813586,0.002143105,0.000070139155,0.00015067466,0.00017563484,0.00012485734,0.84392536,0.0039946386,0.017629636,0.004885597,0.12660715],"study_design_scores_gemma":[0.00000871812,0.000027326705,0.00012352713,0.0000061097053,0.000012885234,0.000030105739,0.000005161947,0.9898868,0.00068923936,0.008775574,0.0004299004,0.0000044818744],"about_ca_topic_score_codex":0.0025355623,"about_ca_topic_score_gemma":0.005169288,"teacher_disagreement_score":0.0030199771,"about_ca_system_score_codex":0.0006314775,"about_ca_system_score_gemma":0.0009354478,"threshold_uncertainty_score":0.015971363},"labels":[],"label_agreement":null},{"id":"W4409364361","doi":"10.1609/aaai.v39i16.33887","title":"Bi-Level Optimization for Semi-Supervised Learning with Pseudo-Labeling","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Measurement and Metrology Techniques","field":"Engineering","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":"Canadian Institute for Advanced Research; Carleton University","funders":"","keywords":"Computer science; Semi-supervised learning; Artificial intelligence; Machine learning; Natural language processing","score_opus":0.07135756392470662,"score_gpt":0.2866357382010716,"score_spread":0.21527817427636498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409364361","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.0028271086,0.00010779777,0.9957371,0.00012328562,0.00001681959,0.000041462674,0.000047225494,0.0006600024,0.0004392096],"genre_scores_gemma":[0.2218431,0.0002201024,0.7720673,0.0006235827,0.00011299461,0.0007195723,0.0009493048,0.0007933282,0.0026706292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947496,0.0025737192,0.00022955763,0.0011355332,0.0010651957,0.00024630336],"domain_scores_gemma":[0.99099463,0.00526123,0.0007244264,0.0013204945,0.0013959324,0.00030329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068379426,0.0023505555,0.0023936077,0.0013228852,0.001050659,0.0023091391,0.0039180918,0.0029490578,0.0032796487],"category_scores_gemma":[0.014288776,0.0012374258,0.0016318603,0.0013555217,0.0029795775,0.003447778,0.003902676,0.0043923054,0.0016335151],"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.00020371177,0.00017430108,0.0010861671,0.00029330968,0.00012442774,0.0000894011,0.00017005681,0.85714316,0.004118145,0.02232837,0.0050684614,0.10920054],"study_design_scores_gemma":[0.0000068153536,0.000020104526,0.00004387783,0.0000069851103,0.0000030389817,0.000009219599,0.0000055444953,0.9921916,0.0005466846,0.006857043,0.00030335816,0.000005695348],"about_ca_topic_score_codex":0.003411571,"about_ca_topic_score_gemma":0.005043959,"teacher_disagreement_score":0.0068379426,"about_ca_system_score_codex":0.0022487894,"about_ca_system_score_gemma":0.0028594339,"threshold_uncertainty_score":0.036162972},"labels":[],"label_agreement":null},{"id":"W4409364374","doi":"10.1609/aaai.v39i16.33918","title":"Enhance Vision-Language Alignment with Noise","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Multimodal Machine Learning Applications","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Noise (video); Computer vision; Artificial intelligence; Image (mathematics)","score_opus":0.019751031522510835,"score_gpt":0.3212355657977287,"score_spread":0.3014845342752179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409364374","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.04987692,0.0007105251,0.9419777,0.00054656994,0.00018856113,0.0000977899,0.00022015678,0.0035834508,0.0027983163],"genre_scores_gemma":[0.74129456,0.00042198386,0.24640875,0.0014670885,0.00023375513,0.00026851808,0.0013459532,0.0007637276,0.0077956654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989761,0.00023290368,0.000037096837,0.00041895005,0.00019908507,0.00013579115],"domain_scores_gemma":[0.9984597,0.0007048565,0.00014053035,0.00030785147,0.00026419593,0.0001227488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019883665,0.0017960969,0.001176877,0.00065147685,0.00062535115,0.0013673401,0.0022182232,0.0017263726,0.002442104],"category_scores_gemma":[0.010215157,0.0005683072,0.00092174317,0.0005513503,0.0012593194,0.0034052413,0.003060539,0.0031465625,0.0010955104],"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.000785639,0.0006007099,0.0045637405,0.0003518442,0.00023750344,0.00032357892,0.0005140876,0.5083686,0.060013566,0.025572062,0.009892175,0.38877645],"study_design_scores_gemma":[0.000020455187,0.0000743781,0.0002953796,0.000014327998,0.000022157166,0.00004964303,0.000027298784,0.9787472,0.010736821,0.008918301,0.001078359,0.000015704416],"about_ca_topic_score_codex":0.004608662,"about_ca_topic_score_gemma":0.0053695575,"teacher_disagreement_score":0.004608662,"about_ca_system_score_codex":0.0010469811,"about_ca_system_score_gemma":0.0014313605,"threshold_uncertainty_score":0.01051563},"labels":[],"label_agreement":null},{"id":"W4409364512","doi":"10.1609/aaai.v39i16.33808","title":"Designing Ambiguity Sets for Distributionally Robust Optimization Using Structural Causal Optimal Transport","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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":"Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Ambiguity; Robust optimization; Mathematical optimization; Computer science; Optimal design; Operations research; Mathematics; Machine learning","score_opus":0.20700598772163933,"score_gpt":0.40282897794249023,"score_spread":0.1958229902208509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409364512","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.0029749856,0.000060623468,0.9960305,0.00019492513,0.000013271655,0.000024307283,0.000022698534,0.00008479375,0.00059386564],"genre_scores_gemma":[0.41116172,0.0005195411,0.5823868,0.00058375986,0.000138264,0.0004735951,0.0003721824,0.0004697241,0.0038943705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976185,0.0011627367,0.00014460574,0.00042664408,0.00049102475,0.00015647123],"domain_scores_gemma":[0.9906448,0.0071054543,0.00072537723,0.0006960118,0.0005893076,0.00023903731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070709498,0.0016753544,0.0019365234,0.0014985229,0.00076944137,0.0021376915,0.0018933248,0.0026923262,0.003354861],"category_scores_gemma":[0.024958732,0.0011799796,0.0016499566,0.0010243625,0.0028422798,0.0041796435,0.0050051645,0.0046494706,0.0005525081],"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.00006352233,0.000052680898,0.00047145976,0.0001117026,0.000049454447,0.00009675825,0.00009693318,0.7971911,0.001302776,0.17173247,0.0013124099,0.027518712],"study_design_scores_gemma":[0.000008780427,0.000021181251,0.000042812288,0.000015265015,0.00000527321,0.000016236669,0.000009617476,0.94159526,0.00043858786,0.057312097,0.00052551576,0.000009482613],"about_ca_topic_score_codex":0.0015027262,"about_ca_topic_score_gemma":0.0013365382,"teacher_disagreement_score":0.0070709498,"about_ca_system_score_codex":0.0018782251,"about_ca_system_score_gemma":0.0024742642,"threshold_uncertainty_score":0.03739518},"labels":[],"label_agreement":null},{"id":"W4409364515","doi":"10.1609/aaai.v39i14.33648","title":"An Alternative Theory of Stable Revision for Nondeterministic Approximation Fixpoint Theory and the Relationships","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Alberta Innovates; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Nondeterministic algorithm; Mathematics; Fixed point; Mathematical economics; Computer science; Discrete mathematics; Mathematical analysis","score_opus":0.09644723973191656,"score_gpt":0.35604852402609033,"score_spread":0.2596012842941738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409364515","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.009208407,0.00059668574,0.97782487,0.0014764797,0.000102839134,0.000052307747,0.000098527016,0.0001791659,0.010460741],"genre_scores_gemma":[0.59314203,0.0010002209,0.39444,0.0010346152,0.00050686457,0.00037740925,0.0003236915,0.00021098148,0.008964226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943047,0.0017834321,0.00043488952,0.0014125645,0.0016528243,0.0004116242],"domain_scores_gemma":[0.9890188,0.0052995463,0.00076042546,0.002664872,0.0019047995,0.00035151743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069817607,0.00077733345,0.0011508683,0.0028446203,0.0018315885,0.0055142636,0.0034935426,0.0025212504,0.006264649],"category_scores_gemma":[0.016074969,0.0007787896,0.0029298754,0.0029830814,0.0073031923,0.0137212165,0.0039840993,0.005077348,0.0007703024],"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.0000073432734,0.0000058787828,0.00010912357,0.000017654362,0.000009322318,0.000024042698,0.00013186876,0.0019406166,0.0001603205,0.99380714,0.00019438358,0.0035922353],"study_design_scores_gemma":[0.000011420836,0.00002386794,0.00008603238,0.000018670291,0.000019256615,0.000073968746,0.00004919164,0.029044162,0.00033694037,0.9657047,0.004615047,0.00001672318],"about_ca_topic_score_codex":0.0025785018,"about_ca_topic_score_gemma":0.002024021,"teacher_disagreement_score":0.0069817607,"about_ca_system_score_codex":0.0035131022,"about_ca_system_score_gemma":0.0018166422,"threshold_uncertainty_score":0.036923528},"labels":[],"label_agreement":null},{"id":"W4409364628","doi":"10.1609/aaai.v39i14.33659","title":"Checking Consistency of CP-Theory Preferences in Polynomial Time","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Formal Methods in Verification","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":"Artificial Intelligence in Medicine (Canada)","funders":"National Science Foundation","keywords":"Consistency (knowledge bases); Mathematics; Polynomial; Time consistency; Mathematical economics; Computer science; Discrete mathematics; Economics; Mathematical analysis; Actuarial science","score_opus":0.0639208776143401,"score_gpt":0.32031585337393076,"score_spread":0.2563949757595907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409364628","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.099881634,0.000117896074,0.8914877,0.0014073503,0.0000626688,0.00019370842,0.0008918256,0.0016087911,0.004348333],"genre_scores_gemma":[0.7191644,0.00014607413,0.2766532,0.0003886753,0.00006403581,0.00030328607,0.0015538111,0.0002929438,0.0014336236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9902333,0.00332118,0.0006785485,0.0020153995,0.0026111905,0.0011404575],"domain_scores_gemma":[0.95581126,0.03430247,0.0026150662,0.003906884,0.0026858677,0.00067840563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006452347,0.0009056114,0.0017912134,0.0009974854,0.0012802546,0.0037769275,0.0029011061,0.0013325302,0.005373786],"category_scores_gemma":[0.04041839,0.0010302018,0.002255836,0.0017423806,0.0022818812,0.008300704,0.0033707013,0.003965512,0.0007608939],"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.0015370826,0.00058398605,0.008672781,0.0012697668,0.0005239852,0.000863459,0.0009855719,0.4317502,0.019796127,0.40569457,0.007877086,0.1204453],"study_design_scores_gemma":[0.00021993842,0.00012403734,0.0005550204,0.000054757158,0.000096023934,0.00021032804,0.0002696027,0.5083614,0.013136922,0.4744911,0.0024367818,0.00004411958],"about_ca_topic_score_codex":0.0046273167,"about_ca_topic_score_gemma":0.005936996,"teacher_disagreement_score":0.006452347,"about_ca_system_score_codex":0.0025730112,"about_ca_system_score_gemma":0.004901469,"threshold_uncertainty_score":0.03412372},"labels":[],"label_agreement":null},{"id":"W4409364637","doi":"10.1609/aaai.v39i13.33499","title":"Constrained Fair and Efficient Allocations","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science","score_opus":0.06781769022624423,"score_gpt":0.26858720731393954,"score_spread":0.2007695170876953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409364637","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.03750405,0.0008216145,0.8718245,0.002674797,0.0001552863,0.00017606684,0.0005007392,0.0002311798,0.08611179],"genre_scores_gemma":[0.7538691,0.000884257,0.21983759,0.0008310998,0.0003255554,0.00061214546,0.0004201629,0.00020222101,0.023017721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992603,0.003069406,0.0003761986,0.0015173851,0.0015240548,0.0009100131],"domain_scores_gemma":[0.9913044,0.004696731,0.0006335586,0.002386527,0.0007047819,0.00027411117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055395784,0.0009304349,0.0010602276,0.00093840074,0.0019600126,0.005123987,0.0017915692,0.0021110787,0.013236561],"category_scores_gemma":[0.02499321,0.0007328106,0.0009166643,0.0017716687,0.0041766968,0.007785382,0.003210515,0.0026495846,0.0010398042],"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.000022557986,0.000015911626,0.00010109991,0.000032811975,0.000012587182,0.000017678565,0.00007757656,0.016767856,0.00028566743,0.97296697,0.0011498157,0.008549514],"study_design_scores_gemma":[0.00001278457,0.00000663373,0.00006199995,0.00001925239,0.000005798051,0.000017741595,0.000024928559,0.029858582,0.0002682205,0.9649322,0.00478546,0.0000064886067],"about_ca_topic_score_codex":0.002240027,"about_ca_topic_score_gemma":0.002479012,"teacher_disagreement_score":0.013236561,"about_ca_system_score_codex":0.0031164377,"about_ca_system_score_gemma":0.0028426852,"threshold_uncertainty_score":0.044280708},"labels":[],"label_agreement":null},{"id":"W4409364742","doi":"10.1609/aaai.v39i13.33576","title":"Forward KL Regularized Preference Optimization for Aligning Diffusion Policies","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"National Natural Science Foundation of China","keywords":"Preference; Diffusion; Computer science; Mathematical optimization; Mathematics; Statistics; Physics; Thermodynamics","score_opus":0.0602084729461822,"score_gpt":0.310791092154396,"score_spread":0.2505826192082138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409364742","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.01895857,0.00017586429,0.97826684,0.00023987256,0.00003579905,0.000056636956,0.00008133661,0.0008673052,0.001317784],"genre_scores_gemma":[0.6584073,0.00023099926,0.33449507,0.000538095,0.00006723336,0.0003169397,0.0005901175,0.0005237301,0.004830477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858785,0.0005122615,0.00009821427,0.00035559863,0.00029010038,0.0001559826],"domain_scores_gemma":[0.9974819,0.0014678821,0.00027743517,0.00027253604,0.00035671899,0.00014360243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023464921,0.001550689,0.001490708,0.0008744851,0.000544067,0.0012396541,0.0013321546,0.0017296349,0.0030083046],"category_scores_gemma":[0.008027262,0.0007929636,0.0009805023,0.0010232647,0.0011815334,0.0028460312,0.0017039152,0.00282319,0.0008177913],"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.00010842306,0.000104612765,0.00081067736,0.00008765625,0.000039803093,0.000060011473,0.0000670688,0.9050245,0.002618057,0.010230356,0.001959916,0.07888887],"study_design_scores_gemma":[0.000009445017,0.000022606719,0.000044438897,0.000004107048,0.0000028300838,0.000010347702,0.0000064204833,0.9942008,0.0006194442,0.0048658145,0.00020895807,0.00000477168],"about_ca_topic_score_codex":0.003981606,"about_ca_topic_score_gemma":0.0045838337,"teacher_disagreement_score":0.003981606,"about_ca_system_score_codex":0.0013376112,"about_ca_system_score_gemma":0.002087411,"threshold_uncertainty_score":0.012409568},"labels":[],"label_agreement":null},{"id":"W4409364798","doi":"10.1609/aaai.v39i12.33365","title":"AlphaForge: A Framework to Mine and Dynamically Combine Formulaic Alpha Factors","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Natural Language Processing Techniques","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; York University","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Alpha (finance); Computer science; Data science; Human–computer interaction; Psychology; Developmental psychology","score_opus":0.030045716920110585,"score_gpt":0.3118845256309136,"score_spread":0.281838808710803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409364798","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.0050189923,0.0002613019,0.9908223,0.00012180742,0.000017890203,0.00007668201,0.00014824748,0.0027606906,0.00077196694],"genre_scores_gemma":[0.14638469,0.00031396936,0.85001856,0.00018958979,0.000048270365,0.00023670285,0.0008020127,0.00036210995,0.0016440427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909997,0.00021670599,0.000063368585,0.00025795435,0.00027129508,0.000090761445],"domain_scores_gemma":[0.9980913,0.0010161691,0.0002318742,0.00024818344,0.00032215365,0.00009023565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026965186,0.0015524153,0.0011315116,0.0025768285,0.00053868524,0.0019490172,0.0025478012,0.0011030261,0.0025544115],"category_scores_gemma":[0.00849791,0.0008057338,0.0014598018,0.0015050691,0.0009926482,0.002519464,0.0017926686,0.001811247,0.00088109396],"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.00022643483,0.00014263915,0.008987346,0.00020510577,0.0002424291,0.0002987324,0.0002798107,0.32768658,0.004922417,0.021823,0.0071768877,0.6280085],"study_design_scores_gemma":[0.000017096532,0.000037709506,0.0003464753,0.000022325998,0.000020502774,0.00008581681,0.000021249398,0.9730992,0.0018646991,0.020934293,0.0035352746,0.000015418438],"about_ca_topic_score_codex":0.0044927867,"about_ca_topic_score_gemma":0.009111359,"teacher_disagreement_score":0.0044927867,"about_ca_system_score_codex":0.00086506974,"about_ca_system_score_gemma":0.0018795971,"threshold_uncertainty_score":0.014260709},"labels":[],"label_agreement":null},{"id":"W4409364836","doi":"10.1609/aaai.v39i14.33647","title":"Reasoning About Actual Causes in Nondeterministic Domains","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Regina","funders":"York University; University of Regina","keywords":"Nondeterministic algorithm; Computer science; Artificial intelligence; Cognitive science; Psychology; Theoretical computer science","score_opus":0.05482580542092242,"score_gpt":0.3162511458401474,"score_spread":0.261425340419225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409364836","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.028856479,0.0002731431,0.96467155,0.0012455359,0.00005832553,0.00009962809,0.00014527244,0.00047686772,0.0041732746],"genre_scores_gemma":[0.6436392,0.0005891571,0.3525826,0.0003751701,0.00014991999,0.0002108683,0.00040734737,0.00016655575,0.0018791065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9876901,0.005437325,0.0010953138,0.0019328515,0.0029049497,0.00093949755],"domain_scores_gemma":[0.96722156,0.025074294,0.0024638555,0.002919898,0.0018235289,0.0004968555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012560322,0.0011476399,0.001142843,0.0023174633,0.0026122252,0.0048952373,0.0025771484,0.0020493339,0.0026895327],"category_scores_gemma":[0.03727777,0.0013208363,0.0035589817,0.0013605569,0.0064896,0.0128650665,0.005566437,0.0050633484,0.00030396637],"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.000038531944,0.000033476463,0.0017417287,0.00011236799,0.00008057859,0.0004434082,0.0008678357,0.066872336,0.0008707842,0.9194172,0.0004458064,0.009076],"study_design_scores_gemma":[0.000016996304,0.000015747775,0.00025319387,0.000037396527,0.000049898495,0.00010564267,0.00022455533,0.10961504,0.0016202335,0.8840231,0.004007815,0.00003051133],"about_ca_topic_score_codex":0.0064050653,"about_ca_topic_score_gemma":0.007039775,"teacher_disagreement_score":0.012560322,"about_ca_system_score_codex":0.0027715361,"about_ca_system_score_gemma":0.003670264,"threshold_uncertainty_score":0.06642616},"labels":[],"label_agreement":null},{"id":"W4409364838","doi":"10.1609/aaai.v39i11.33225","title":"DCC: Differentiable Cardinality Constraints for Partial Index Tracking","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Topics in Algebra","field":"Mathematics","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":"Artificial Intelligence in Medicine (Canada)","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; National Research Foundation of Korea; National Research Foundation","keywords":"Differentiable function; Cardinality (data modeling); Index (typography); Tracking (education); Mathematics; Computer science; Pure mathematics; Data mining; Psychology; Programming language","score_opus":0.15305673783931154,"score_gpt":0.385270675456156,"score_spread":0.23221393761684447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409364838","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.006264765,0.00045313046,0.9864846,0.00035742906,0.00009917858,0.000112043526,0.0005318105,0.0011483995,0.004548669],"genre_scores_gemma":[0.24348672,0.0005279376,0.74799126,0.0004314341,0.00019056481,0.00042698928,0.0015016068,0.00088327035,0.004560259],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956346,0.0011836301,0.00038717646,0.0008994271,0.0016021916,0.00029303395],"domain_scores_gemma":[0.9858549,0.007087453,0.0014208802,0.0033508833,0.0018616656,0.00042415055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041174386,0.0014372775,0.0012526249,0.0014759232,0.0009743112,0.0036619632,0.0026663686,0.0019247412,0.007106969],"category_scores_gemma":[0.032322183,0.0007695089,0.0010479445,0.0023150656,0.0015785069,0.00483024,0.0028825596,0.0034774654,0.0018880634],"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.00023819659,0.00011978373,0.0027417606,0.00042676655,0.00007362664,0.0002552225,0.00021837749,0.55873865,0.0067521026,0.14845553,0.022076732,0.25990325],"study_design_scores_gemma":[0.000026788039,0.000028841674,0.00023130236,0.000061014693,0.000009908031,0.000109631284,0.000024890529,0.94788724,0.0031005933,0.040129032,0.008362762,0.000028053124],"about_ca_topic_score_codex":0.0050011408,"about_ca_topic_score_gemma":0.0057769646,"teacher_disagreement_score":0.007106969,"about_ca_system_score_codex":0.0019523584,"about_ca_system_score_gemma":0.0035353051,"threshold_uncertainty_score":0.02377516},"labels":[],"label_agreement":null},{"id":"W4409364876","doi":"10.1609/aaai.v39i13.33540","title":"On the Power of Randomization for Obviously Strategy-Proof Mechanisms","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Azrieli Foundation; Israel Science Foundation; Alfred P. Sloan Foundation; National Science Foundation","keywords":"Randomization; Power (physics); Proof of concept; Computer science; Mathematics; Medicine; Internal medicine; Clinical trial; Physics; Operating system; Thermodynamics","score_opus":0.054668175319098955,"score_gpt":0.2927368003343926,"score_spread":0.23806862501529363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409364876","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.042275388,0.0030378231,0.9371534,0.0042582788,0.0001982809,0.00025875014,0.00015122427,0.00068566966,0.011981144],"genre_scores_gemma":[0.6860329,0.0035621831,0.30186382,0.002274958,0.0008044915,0.0009861011,0.00024856356,0.00039648244,0.00383048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96626395,0.02430247,0.0010661719,0.0034264983,0.0034747766,0.0014661514],"domain_scores_gemma":[0.7856702,0.1769029,0.011818018,0.019703453,0.004285784,0.001619686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.038585927,0.002108368,0.0029741204,0.0022246335,0.00154265,0.0060016466,0.0046147383,0.004034748,0.005713579],"category_scores_gemma":[0.12849657,0.0015286213,0.0039412207,0.0021084084,0.007205741,0.017157786,0.0038985892,0.0066307466,0.0014032392],"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.00053450675,0.0002847708,0.0014894131,0.00045454153,0.0002279968,0.00010133317,0.00023720786,0.09291502,0.001768705,0.8528847,0.0022588407,0.046843003],"study_design_scores_gemma":[0.00029560068,0.00036601874,0.00028290585,0.00013732667,0.00009082471,0.00016103388,0.000036065474,0.20350282,0.0017082808,0.7895732,0.003782983,0.000062876636],"about_ca_topic_score_codex":0.0006369365,"about_ca_topic_score_gemma":0.00030502974,"teacher_disagreement_score":0.038585927,"about_ca_system_score_codex":0.002912904,"about_ca_system_score_gemma":0.0034802395,"threshold_uncertainty_score":0.20406437},"labels":[],"label_agreement":null},{"id":"W4409364886","doi":"10.1609/aaai.v39i13.33567","title":"HiPoser: 3D Human Pose Estimation with Hierarchical Shared Learning at Parts-Level Using Inertial Measurement Units","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Human Pose and Action Recognition","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":"Centre Scientifique et Technique du Bâtiment; National Natural Science Foundation of China","keywords":"Pose; Estimation; Artificial intelligence; Units of measurement; Inertial measurement unit; Inertial frame of reference; Computer science; Computer vision; Engineering; Systems engineering","score_opus":0.19123234400854594,"score_gpt":0.32052940495125787,"score_spread":0.12929706094271193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409364886","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.008813409,0.0005061941,0.9850428,0.00007041971,0.000059285205,0.00007131683,0.00029015474,0.004477084,0.0006692217],"genre_scores_gemma":[0.33596036,0.000783571,0.65200984,0.0005414172,0.00017505787,0.00036799416,0.0037365896,0.00051744765,0.005907742],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99931204,0.00012856357,0.000025962023,0.00026839192,0.00019126051,0.000073738905],"domain_scores_gemma":[0.99950707,0.00014975555,0.00005815318,0.00017061243,0.0000790761,0.000035354227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088400603,0.001749219,0.0015933248,0.0008951311,0.0002685909,0.000733998,0.0023621067,0.0012048779,0.003002895],"category_scores_gemma":[0.0020606646,0.00086139137,0.0013903592,0.0010188896,0.0006543018,0.0014520856,0.0025035096,0.0015528619,0.0023999813],"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.00030847147,0.00018716627,0.0022906289,0.0001948277,0.00035288127,0.0002235036,0.0001457387,0.28044572,0.014464065,0.0033178327,0.0073807593,0.69068843],"study_design_scores_gemma":[0.00002519447,0.000112067355,0.0010693619,0.000018098055,0.000034424873,0.00015484288,0.000028460834,0.98622024,0.004571707,0.0050131716,0.0027249164,0.000027475598],"about_ca_topic_score_codex":0.0043287636,"about_ca_topic_score_gemma":0.007038946,"teacher_disagreement_score":0.0043287636,"about_ca_system_score_codex":0.0003294993,"about_ca_system_score_gemma":0.00084529456,"threshold_uncertainty_score":0.010045648},"labels":[],"label_agreement":null},{"id":"W4409364892","doi":"10.1609/aaai.v39i13.33484","title":"Fair Division with Market Values","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","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":"Science and Engineering Research Board","keywords":"Division (mathematics); Economics; Mathematics; Arithmetic","score_opus":0.12440747817161726,"score_gpt":0.38736924329337924,"score_spread":0.26296176512176195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409364892","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.029367251,0.00048754306,0.90225387,0.003150124,0.00019165194,0.00016704928,0.0001759353,0.00012986419,0.064076684],"genre_scores_gemma":[0.8253878,0.000527125,0.14529836,0.0006165861,0.00031315204,0.00041076075,0.00013146807,0.000096233554,0.027218515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952915,0.0019433844,0.00017697661,0.00093493925,0.0010231116,0.0006300605],"domain_scores_gemma":[0.9954491,0.002105922,0.0005299705,0.001118196,0.00040872666,0.00038811055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057113827,0.0009721289,0.001367137,0.00078278733,0.001728518,0.0064077727,0.002919548,0.0026928268,0.011359567],"category_scores_gemma":[0.012760057,0.0005735939,0.001292538,0.0012971468,0.006362672,0.010662527,0.0032966093,0.003470049,0.0009855124],"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.000014529735,0.000012001519,0.000054194203,0.000012485724,0.0000062300774,0.000025166235,0.00004974188,0.013408002,0.00013090848,0.9834731,0.0004295076,0.002384021],"study_design_scores_gemma":[0.00001478206,0.000013533536,0.00002604886,0.0000109682605,0.000004161681,0.000020460224,0.000022005572,0.039276324,0.00012381506,0.9576251,0.0028563468,0.000006401581],"about_ca_topic_score_codex":0.0018108186,"about_ca_topic_score_gemma":0.001529203,"teacher_disagreement_score":0.011359567,"about_ca_system_score_codex":0.0037235073,"about_ca_system_score_gemma":0.0024455192,"threshold_uncertainty_score":0.038001537},"labels":[],"label_agreement":null},{"id":"W4409365114","doi":"10.1609/aaai.v39i10.33105","title":"Transtreaming: Adaptive Delay-aware Transformer for Real-time Streaming Perception","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Energy Efficient Wireless Sensor Networks","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":"McGill University","funders":"Key Laboratory of Computer Network and Information Integration; Fundamental Research Funds for the Central Universities; Natural Science Foundation of Jiangsu Province; Government of Jiangsu Province; Southeast University; National Natural Science Foundation of China","keywords":"Computer science; Transformer; Real-time computing; Electrical engineering; Engineering; Voltage","score_opus":0.03891162320857499,"score_gpt":0.2787024319721402,"score_spread":0.23979080876356518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409365114","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.010186118,0.00019950468,0.9875437,0.0000569989,0.00006242125,0.00003724717,0.00002990754,0.000746551,0.0011375345],"genre_scores_gemma":[0.6800507,0.0005460559,0.31425697,0.00019974915,0.00007436711,0.00009010614,0.0001569324,0.00025043954,0.004374791],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99981624,0.0000244668,0.000007447698,0.00005346722,0.000075933705,0.000022530674],"domain_scores_gemma":[0.9997452,0.00008718043,0.00002675011,0.000040011488,0.00007158495,0.000029319239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039384657,0.0005273754,0.00038768598,0.00029905615,0.00018323289,0.0005543652,0.0013512798,0.00039349325,0.0015815195],"category_scores_gemma":[0.0011661641,0.00022696587,0.00040919476,0.00024369455,0.0003499697,0.0011075838,0.00074979186,0.0007749537,0.0004482393],"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.000591866,0.00021639555,0.0014064714,0.0001975657,0.000069678055,0.00029189937,0.00021874892,0.23850407,0.2128717,0.020715171,0.0050789183,0.5198375],"study_design_scores_gemma":[0.000009297859,0.00007385856,0.00018228829,0.000004973075,0.000010193136,0.00012078364,0.0000140187585,0.97845125,0.016368512,0.0024821998,0.0022683549,0.00001416392],"about_ca_topic_score_codex":0.0026533143,"about_ca_topic_score_gemma":0.0027666157,"teacher_disagreement_score":0.0026533143,"about_ca_system_score_codex":0.000475171,"about_ca_system_score_gemma":0.00060668343,"threshold_uncertainty_score":0.005290687},"labels":[],"label_agreement":null},{"id":"W4409365156","doi":"10.1609/aaai.v39i13.33500","title":"Temporal Fair Division","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Division (mathematics); Computer science; Mathematics; Arithmetic","score_opus":0.08890704066024799,"score_gpt":0.2810345126970807,"score_spread":0.1921274720368327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409365156","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.041096084,0.00081310765,0.8784488,0.002190825,0.0004317328,0.00022943418,0.00034786714,0.00024939235,0.0761928],"genre_scores_gemma":[0.8201155,0.00087811553,0.14361618,0.0007188388,0.00058395695,0.000425618,0.00032292973,0.00016413613,0.03317473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952618,0.0016147458,0.00018297319,0.0011906611,0.0009800049,0.0007698186],"domain_scores_gemma":[0.9891962,0.005187608,0.0013166533,0.0022993016,0.0011177947,0.0008824372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061009526,0.0010794305,0.0013057124,0.00083634054,0.0029420028,0.004022679,0.003187772,0.0016468443,0.015259882],"category_scores_gemma":[0.018428449,0.00044791854,0.0013548067,0.0018235814,0.0038983873,0.0084846895,0.0033596985,0.0028568085,0.001247145],"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.00011423305,0.000059382524,0.0005031187,0.00005735082,0.00003456097,0.00009040293,0.00023606111,0.04031462,0.0007294329,0.9390357,0.0023585176,0.016466565],"study_design_scores_gemma":[0.000052683994,0.00007137952,0.00020159123,0.000028828716,0.000026205198,0.00011108892,0.00010677593,0.14817141,0.00073277485,0.8344891,0.015989617,0.000018516443],"about_ca_topic_score_codex":0.0046504857,"about_ca_topic_score_gemma":0.003761118,"teacher_disagreement_score":0.015259882,"about_ca_system_score_codex":0.00438867,"about_ca_system_score_gemma":0.0031676663,"threshold_uncertainty_score":0.05104941},"labels":[],"label_agreement":null},{"id":"W4409365249","doi":"10.1609/aaai.v39i13.33486","title":"The Distortion of Public-Spirited Participatory Budgeting","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Local Government Finance and Decentralization","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Harvard Data Science Initiative, Harvard University","keywords":"Participatory budgeting; Distortion (music); Citizen journalism; Business; Computer science; Political science; World Wide Web; Telecommunications; Democracy","score_opus":0.13442371603834802,"score_gpt":0.36013967761772764,"score_spread":0.22571596157937962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409365249","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.0959958,0.0012384756,0.815219,0.0047995276,0.00024634833,0.00055674824,0.0011349553,0.0005542832,0.08025487],"genre_scores_gemma":[0.88797176,0.0005436757,0.09764629,0.0005651786,0.0001014789,0.0007643479,0.000426166,0.0002452591,0.011735789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.97443116,0.013339302,0.0015099437,0.0033379912,0.0053174486,0.0020641189],"domain_scores_gemma":[0.95249885,0.023421515,0.004707083,0.015675185,0.0026787226,0.0010186174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015118774,0.0013699275,0.0018044412,0.0009806774,0.0019699512,0.0044178586,0.0034076709,0.0019341883,0.009132923],"category_scores_gemma":[0.060307775,0.0010784356,0.0015045567,0.001752899,0.005126525,0.006908845,0.0054666162,0.004316286,0.0015623233],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009942664,0.0001556525,0.0029528134,0.00039088627,0.00016717607,0.00020836215,0.0010391282,0.116473965,0.0041352804,0.79863524,0.0050988835,0.069748335],"study_design_scores_gemma":[0.00018689448,0.00026442402,0.0014324049,0.00015880675,0.00009116105,0.000275781,0.00037642528,0.13177386,0.006678469,0.8405234,0.018148595,0.00008978454],"about_ca_topic_score_codex":0.0031014846,"about_ca_topic_score_gemma":0.0024469143,"teacher_disagreement_score":0.015118774,"about_ca_system_score_codex":0.0056083314,"about_ca_system_score_gemma":0.0031811662,"threshold_uncertainty_score":0.07995671},"labels":[],"label_agreement":null},{"id":"W4409365255","doi":"10.1609/aaai.v39i13.33509","title":"Verifying Proportionality in Temporal Voting","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Internet Traffic Analysis and Secure E-voting","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":"Carleton University","funders":"Engineering and Physical Sciences Research Council; Ministry of Education, India; Alan Turing Institute","keywords":"Proportionality (law); Voting; Computer science; Political science; Law","score_opus":0.05991866952502942,"score_gpt":0.3073288252519741,"score_spread":0.24741015572694466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409365255","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.09758064,0.00012537268,0.89553195,0.0013193515,0.00007225217,0.00013549028,0.0002602238,0.00051966775,0.0044549904],"genre_scores_gemma":[0.8710986,0.00016016758,0.12430243,0.00035373648,0.0001318586,0.00018759143,0.00047935962,0.00011614573,0.0031700528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9846517,0.0062356615,0.00091898773,0.0030849488,0.0033032626,0.0018054907],"domain_scores_gemma":[0.93263686,0.050051432,0.005148181,0.008076164,0.0028441413,0.0012431598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011033471,0.0009413129,0.0016668878,0.0009808457,0.0018616297,0.0044739093,0.0035642597,0.0024232145,0.005560277],"category_scores_gemma":[0.08576468,0.0009818362,0.0020534222,0.0018668311,0.0034682048,0.015319477,0.0055643367,0.004206766,0.0006241079],"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.00057984295,0.00018249247,0.0024713539,0.00018592933,0.00011848936,0.00038438564,0.0005805021,0.14743285,0.0034845017,0.80288625,0.0016754997,0.04001789],"study_design_scores_gemma":[0.00006601204,0.0000687954,0.00016912527,0.000016778553,0.000025540356,0.000088928326,0.000072641225,0.38179272,0.0021470208,0.61454934,0.0009821077,0.000020987536],"about_ca_topic_score_codex":0.0027034034,"about_ca_topic_score_gemma":0.0020713166,"teacher_disagreement_score":0.011033471,"about_ca_system_score_codex":0.0021579291,"about_ca_system_score_gemma":0.0031686525,"threshold_uncertainty_score":0.05835128},"labels":[],"label_agreement":null},{"id":"W4409365296","doi":"10.1609/aaai.v39i13.33504","title":"Eliminating Majority Illusion Is Easy","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Illusion; Computer science; Psychology; Cognitive psychology","score_opus":0.04328878055188072,"score_gpt":0.2932474765714565,"score_spread":0.24995869601957577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409365296","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.19555348,0.0012505183,0.756335,0.0053342897,0.00035713174,0.00055134186,0.0009047254,0.0033213247,0.036392156],"genre_scores_gemma":[0.7922806,0.00067929394,0.1918437,0.0014362069,0.00023219203,0.00032460582,0.0010553157,0.00074192975,0.011406092],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99622405,0.00081650197,0.000240609,0.0009837621,0.0010513549,0.0006837169],"domain_scores_gemma":[0.98132515,0.010342981,0.0010230079,0.0048986482,0.0016325698,0.0007775437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020903233,0.001337987,0.0017661586,0.0006411096,0.0022620654,0.0027421906,0.0022003413,0.001704535,0.011167932],"category_scores_gemma":[0.021709692,0.0008413442,0.0017197782,0.0009866257,0.0022419153,0.007731085,0.005539497,0.0032363061,0.0022031886],"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.0018656319,0.0007022045,0.0074537545,0.0014877717,0.0004463368,0.0010909593,0.0012074943,0.18245547,0.029141849,0.26381907,0.056362547,0.4539669],"study_design_scores_gemma":[0.00029763955,0.00022169671,0.00094001036,0.00012910643,0.0001778294,0.0007571569,0.0006184612,0.34896508,0.01761106,0.60944873,0.020770151,0.00006307537],"about_ca_topic_score_codex":0.0014801966,"about_ca_topic_score_gemma":0.0020857202,"teacher_disagreement_score":0.011167932,"about_ca_system_score_codex":0.0010282388,"about_ca_system_score_gemma":0.0025198678,"threshold_uncertainty_score":0.03736049},"labels":[],"label_agreement":null},{"id":"W4409365321","doi":"10.1609/aaai.v39i11.33208","title":"Learning Valid Dual Bounds in Constraint Programming: Boosted Lagrangian Decomposition with Self-Supervised Learning","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI 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":"Polytechnique Montréal","funders":"","keywords":"Dual (grammatical number); Decomposition; Lagrangian; Constraint (computer-aided design); Computer science; Mathematical optimization; Constraint programming; Artificial intelligence; Mathematics; Applied mathematics; Stochastic programming; Chemistry","score_opus":0.02759433636576968,"score_gpt":0.2845751334361449,"score_spread":0.2569807970703752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409365321","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.005493869,0.00025549874,0.9916306,0.00019461209,0.000035189205,0.0000397892,0.00003966319,0.0005251636,0.0017855281],"genre_scores_gemma":[0.33585322,0.00042657825,0.65812415,0.0006199359,0.00016602517,0.00038861792,0.000518147,0.0006051413,0.0032982063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873,0.00049138675,0.00005235353,0.00022350728,0.00036858628,0.00013408935],"domain_scores_gemma":[0.99564666,0.0025039203,0.00046908073,0.0005194234,0.000661915,0.00019900559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025022654,0.0015309149,0.0015505864,0.0009019846,0.0004913765,0.0014503864,0.0021613047,0.0017604195,0.0026773901],"category_scores_gemma":[0.008517969,0.0009118527,0.0010642057,0.0010156633,0.0015107386,0.0022056135,0.002456378,0.003968706,0.00087441015],"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.00006953102,0.000117517535,0.00078841095,0.00011141828,0.000050377348,0.00006170355,0.000084520725,0.89225477,0.001115753,0.021483745,0.0041112853,0.079750955],"study_design_scores_gemma":[0.0000048793363,0.0000066399866,0.000018928682,0.000006694503,0.0000017761503,0.0000035971316,0.000002764811,0.9956474,0.00015680812,0.0039272006,0.00022120154,0.0000020965322],"about_ca_topic_score_codex":0.003460007,"about_ca_topic_score_gemma":0.004152602,"teacher_disagreement_score":0.003460007,"about_ca_system_score_codex":0.0013514066,"about_ca_system_score_gemma":0.0021905683,"threshold_uncertainty_score":0.013233364},"labels":[],"label_agreement":null},{"id":"W4409365358","doi":"10.1609/aaai.v39i14.33628","title":"Situation Calculus Temporally Lifted Abstractions for Generalized Planning","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","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":"York University","funders":"","keywords":"Calculus (dental); Computer science","score_opus":0.08656763443536475,"score_gpt":0.3345368105981227,"score_spread":0.24796917616275793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409365358","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.0033964522,0.00020024378,0.99069947,0.0002617229,0.00006310253,0.00007393845,0.00011509192,0.0007011369,0.004488898],"genre_scores_gemma":[0.17546012,0.00052848976,0.8183335,0.00027714184,0.00011138198,0.0005683467,0.0004103799,0.0003148171,0.0039957706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799573,0.00063481875,0.00020613952,0.0002979345,0.0006694633,0.00019591377],"domain_scores_gemma":[0.998412,0.0006760932,0.00016072074,0.00044845935,0.00020970994,0.00009296446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021151488,0.0009277716,0.0006587646,0.00090055785,0.0008765474,0.0022531964,0.0016394765,0.0009656648,0.004087],"category_scores_gemma":[0.0038338895,0.0007884154,0.002679803,0.00089014025,0.0034082963,0.0038348255,0.0027726265,0.004251146,0.00068622245],"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.000029422417,0.000022620436,0.00012482503,0.0001072463,0.00002526897,0.00020057736,0.0003474035,0.06523607,0.0018532205,0.91617936,0.000872298,0.015001578],"study_design_scores_gemma":[0.00004215476,0.000044279335,0.00008672739,0.000074052514,0.00004851326,0.00009505041,0.00006159407,0.22992532,0.0022267916,0.7437953,0.023568856,0.000031392432],"about_ca_topic_score_codex":0.005614731,"about_ca_topic_score_gemma":0.0058200755,"teacher_disagreement_score":0.005614731,"about_ca_system_score_codex":0.0024069645,"about_ca_system_score_gemma":0.0026632498,"threshold_uncertainty_score":0.017463863},"labels":[],"label_agreement":null},{"id":"W4409365436","doi":"10.1609/aaai.v39i12.33362","title":"Hyperparametric Robust and Dynamic Influence Maximization","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Statistical Methods and Inference","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Supercomputing Centre Singapore; National Research Foundation","keywords":"Maximization; Computer science; Mathematical optimization; Mathematics","score_opus":0.11265888743247299,"score_gpt":0.36782551256542795,"score_spread":0.25516662513295496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409365436","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.009028257,0.00027633042,0.9886431,0.00024367779,0.000019488003,0.000025306903,0.000047173406,0.00013837269,0.001578308],"genre_scores_gemma":[0.7724362,0.00090005086,0.21978068,0.00031929897,0.0002528912,0.00026149536,0.00036987843,0.00033523858,0.005344236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997198,0.0012993922,0.00009791037,0.000711815,0.00046957826,0.00022332986],"domain_scores_gemma":[0.9829038,0.012927548,0.0018228434,0.0011512593,0.00081499835,0.00037954637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048908424,0.0019193388,0.002143343,0.0014356121,0.000685671,0.0022585585,0.0027134109,0.0023386213,0.0019689782],"category_scores_gemma":[0.03137261,0.0011674438,0.001415074,0.0015471353,0.0029766806,0.003379406,0.00297487,0.002554974,0.00058528746],"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.000055078526,0.000028902503,0.0004655291,0.00010005786,0.00009581766,0.00010365449,0.00006908613,0.93435484,0.0013926193,0.050005455,0.00062579,0.012703213],"study_design_scores_gemma":[0.000006632741,0.000019379431,0.00009213423,0.0000070973833,0.000010579448,0.000026305954,0.000005887653,0.97315764,0.0004836286,0.02583075,0.00035102712,0.0000089445775],"about_ca_topic_score_codex":0.0029198993,"about_ca_topic_score_gemma":0.0019877478,"teacher_disagreement_score":0.0048908424,"about_ca_system_score_codex":0.0016168731,"about_ca_system_score_gemma":0.0011229776,"threshold_uncertainty_score":0.025865555},"labels":[],"label_agreement":null},{"id":"W4409365439","doi":"10.1609/aaai.v39i10.33168","title":"Low-Light Image Enhancement via Generative Perceptual Priors","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Image Enhancement Techniques","field":"Computer Science","cited_by":13,"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","funders":"","keywords":"Prior probability; Artificial intelligence; Perception; Generative grammar; Image (mathematics); Computer science; Computer vision; Generative model; Pattern recognition (psychology); Psychology; Bayesian probability","score_opus":0.029731458059625418,"score_gpt":0.29693778354428346,"score_spread":0.26720632548465806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409365439","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.013296,0.00037990857,0.9823637,0.00028906687,0.00003750103,0.00005162439,0.00008216099,0.0011124347,0.0023875488],"genre_scores_gemma":[0.5463765,0.0011220885,0.4392744,0.0007429128,0.0001387112,0.00015706921,0.0004185332,0.00061459764,0.011155075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99978036,0.000046678517,0.000007956173,0.00006621081,0.00006520638,0.000033609573],"domain_scores_gemma":[0.99945456,0.00024183717,0.00006273888,0.00008629239,0.000111986534,0.00004251292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007951356,0.0009799841,0.00065512507,0.00062663143,0.00023815311,0.0010568394,0.0015191959,0.00083949394,0.0024193355],"category_scores_gemma":[0.0022187394,0.0005060218,0.0009400563,0.00037694036,0.00084779476,0.0016632591,0.0015775026,0.0019222175,0.0009810345],"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.0003210579,0.00016838007,0.0011610078,0.0003406794,0.000114732255,0.00023065749,0.00027455908,0.46294,0.10930443,0.03665862,0.0056584817,0.3828274],"study_design_scores_gemma":[0.00001272631,0.00003901209,0.00021809098,0.000016771068,0.000023099772,0.00008397258,0.00001378685,0.9731419,0.013209345,0.01136873,0.0018583401,0.000014194002],"about_ca_topic_score_codex":0.0026838253,"about_ca_topic_score_gemma":0.004088066,"teacher_disagreement_score":0.0026838253,"about_ca_system_score_codex":0.0007315888,"about_ca_system_score_gemma":0.00062017667,"threshold_uncertainty_score":0.008093417},"labels":[],"label_agreement":null},{"id":"W4409365459","doi":"10.1609/aaai.v39i13.33506","title":"Last-iterate Convergence in Regularized Graphon Mean Field Game","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Canadian Institute for Advanced Research","keywords":"Convergence (economics); Field (mathematics); Mean field theory; Mathematical economics; Mathematics; Economics; Physics; Pure mathematics","score_opus":0.02990100604921609,"score_gpt":0.27764924909161637,"score_spread":0.24774824304240028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409365459","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.1089084,0.0005052303,0.8800629,0.0010793809,0.00009488759,0.0001675798,0.0002015777,0.0005256144,0.0084544495],"genre_scores_gemma":[0.83018637,0.00046249386,0.16113007,0.00056531746,0.00006268642,0.00040847727,0.00030510363,0.00026038836,0.0066191126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986504,0.00072996056,0.00004377667,0.0002107833,0.00016324726,0.00020189397],"domain_scores_gemma":[0.98948216,0.008495442,0.0005495086,0.00041113925,0.00053335686,0.000528331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037707498,0.0016352673,0.002007904,0.0009364059,0.000998507,0.0010719723,0.0019688827,0.002200469,0.0034566002],"category_scores_gemma":[0.017241873,0.00059301563,0.001246245,0.0004311483,0.0023481,0.0022191785,0.0017142743,0.0024269603,0.000520966],"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.00034694673,0.00017731362,0.0023374448,0.00022262603,0.00010634277,0.00027632373,0.00033833232,0.7847173,0.0025309273,0.18511063,0.004288564,0.019547207],"study_design_scores_gemma":[0.000019031158,0.000039644074,0.00009389888,0.000013506366,0.000007837696,0.000028770717,0.000020693049,0.947843,0.00029122923,0.051320493,0.00031114067,0.000010652722],"about_ca_topic_score_codex":0.0057125986,"about_ca_topic_score_gemma":0.0049436726,"teacher_disagreement_score":0.0057125986,"about_ca_system_score_codex":0.0019616615,"about_ca_system_score_gemma":0.002061923,"threshold_uncertainty_score":0.019941866},"labels":[],"label_agreement":null},{"id":"W4409365527","doi":"10.1609/aaai.v39i11.33306","title":"RouterRetriever: Routing over a Mixture of Expert Embedding Models","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Kootenay Association for Science & Technology","funders":"","keywords":"Embedding; Computer science; Routing (electronic design automation); Artificial intelligence; Computer network","score_opus":0.04657043587603436,"score_gpt":0.3282586354173401,"score_spread":0.28168819954130575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409365527","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.04557912,0.0022280843,0.9108145,0.0010817247,0.00019099728,0.00060352625,0.0021958833,0.032431357,0.004874799],"genre_scores_gemma":[0.34843844,0.0010473377,0.62256676,0.0017209308,0.00023603828,0.00073705777,0.009653064,0.0018663921,0.013733878],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99841416,0.00054857234,0.00010704004,0.00054755574,0.0002626908,0.00012001632],"domain_scores_gemma":[0.9970988,0.0013217003,0.00016105351,0.0009595256,0.00034273844,0.000116221636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032521512,0.0024179053,0.0014872553,0.0019191909,0.00059637765,0.0017137186,0.0031406065,0.0026491636,0.005236325],"category_scores_gemma":[0.008974557,0.0009488378,0.0018069363,0.0013114618,0.00067573175,0.006773741,0.0024315536,0.0027118667,0.005164626],"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.0008899194,0.00064603507,0.0037800772,0.0007549948,0.00051401346,0.0004678285,0.00040792354,0.24526031,0.017174045,0.014085587,0.063714966,0.6523044],"study_design_scores_gemma":[0.00007813091,0.00021197188,0.00021676887,0.00002265698,0.00007296491,0.00023338934,0.000056122622,0.97636193,0.0057980735,0.010230261,0.00667903,0.000038694434],"about_ca_topic_score_codex":0.0058973245,"about_ca_topic_score_gemma":0.009288092,"teacher_disagreement_score":0.0058973245,"about_ca_system_score_codex":0.0014230948,"about_ca_system_score_gemma":0.0012689402,"threshold_uncertainty_score":0.017517269},"labels":[],"label_agreement":null},{"id":"W4409365538","doi":"10.1609/aaai.v39i11.33321","title":"SSL-STMFormer Self-Supervised Learning Spatio-Temporal Entanglement Transformer for Traffic Flow Prediction","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Traffic Prediction and Management Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Sichuan Province; National Natural Science Foundation of China; Institute for Catastrophic Loss Reduction","keywords":"Computer science; Transformer; Artificial intelligence; Engineering; Electrical engineering; Voltage","score_opus":0.02583942127724122,"score_gpt":0.2527350357961219,"score_spread":0.22689561451888066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409365538","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.07887274,0.00040206662,0.9134708,0.00040907203,0.0000818274,0.00008911892,0.00041776628,0.00460194,0.0016546622],"genre_scores_gemma":[0.88453865,0.00020043564,0.1090989,0.000293151,0.00010850684,0.00014222803,0.00195584,0.0001865561,0.0034757527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995122,0.00010559427,0.000026692176,0.00019427297,0.00009439628,0.00006685348],"domain_scores_gemma":[0.9988795,0.00041877132,0.00012635738,0.00020962293,0.00028038264,0.00008535902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011508327,0.00096329674,0.0011727146,0.0010442267,0.0004191835,0.00065441435,0.002077842,0.0009371043,0.001406485],"category_scores_gemma":[0.002667306,0.00044516093,0.00089081435,0.0010384327,0.0005965826,0.0023328355,0.0013594591,0.0017506641,0.0005055064],"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.00019681217,0.00043411143,0.0064005214,0.00009052724,0.00011727638,0.00010529142,0.00010186729,0.6650738,0.004876342,0.0053212214,0.00854244,0.3087398],"study_design_scores_gemma":[0.0000030128301,0.000010194538,0.00013465565,0.0000014843954,0.0000034042368,0.0000053429394,0.000004094476,0.99805707,0.00039686126,0.0012476349,0.00013387088,0.000002273488],"about_ca_topic_score_codex":0.008071118,"about_ca_topic_score_gemma":0.010054091,"teacher_disagreement_score":0.008071118,"about_ca_system_score_codex":0.0010174297,"about_ca_system_score_gemma":0.001453705,"threshold_uncertainty_score":0.016048312},"labels":[],"label_agreement":null},{"id":"W4409365557","doi":"10.1609/aaai.v39i13.33539","title":"Constant-Factor Distortion Mechanisms for k-Committee Election","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Distortion (music); Constant (computer programming); Political science; Factor (programming language); Mathematics; Computer science; Telecommunications; Bandwidth (computing)","score_opus":0.042382488549700364,"score_gpt":0.2864493843239364,"score_spread":0.24406689577423604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409365557","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.020618228,0.000583108,0.96845275,0.00074926304,0.00008422411,0.00042180627,0.0003390686,0.0013220467,0.0074294317],"genre_scores_gemma":[0.5351336,0.0005208852,0.45104975,0.00051885244,0.00021340624,0.0010959038,0.0008128534,0.0004451209,0.010209726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9902104,0.0041780416,0.0006544325,0.0017507443,0.0021556912,0.0010507086],"domain_scores_gemma":[0.98416096,0.0071879523,0.0015725457,0.0052351397,0.0011668878,0.0006764809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009256571,0.0015223222,0.003335783,0.0014429628,0.0015690051,0.0036378219,0.0065644267,0.0028891372,0.010963909],"category_scores_gemma":[0.03306434,0.00092632126,0.0020722512,0.0034045957,0.0021019313,0.0069549773,0.0054207365,0.0034805585,0.0030508863],"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.001993112,0.00044930252,0.0016399131,0.0004333156,0.00021895242,0.00013689806,0.00058804854,0.37489066,0.0052017244,0.39588812,0.018832333,0.1997277],"study_design_scores_gemma":[0.0003855748,0.00024910728,0.00040193353,0.000043596843,0.000057904956,0.00017211605,0.000105454215,0.7574563,0.003349178,0.23036903,0.007340894,0.00006892403],"about_ca_topic_score_codex":0.0021909487,"about_ca_topic_score_gemma":0.0023159315,"teacher_disagreement_score":0.010963909,"about_ca_system_score_codex":0.0036067187,"about_ca_system_score_gemma":0.0025519538,"threshold_uncertainty_score":0.04895401},"labels":[],"label_agreement":null},{"id":"W4409365726","doi":"10.1609/aaai.v39i13.33507","title":"Every Bit Helps: Achieving the Optimal Distortion with a Few Queries","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bit (key); Distortion (music); Computer science; Arithmetic; Algorithm; Theoretical computer science; Mathematics; Computer security; Telecommunications","score_opus":0.15755457449808338,"score_gpt":0.41326942252001436,"score_spread":0.255714848021931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409365726","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.14884691,0.007489408,0.76922095,0.015167679,0.0006121897,0.0006108577,0.0015604481,0.003092333,0.053399246],"genre_scores_gemma":[0.6941957,0.001562878,0.28953168,0.0020744249,0.0003231052,0.0004019855,0.00086860097,0.00068672624,0.010354923],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9890674,0.0053051612,0.00053053384,0.0014335947,0.002548908,0.0011144108],"domain_scores_gemma":[0.9623988,0.023752224,0.0015086741,0.009051255,0.0020338064,0.0012552218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007285973,0.002390324,0.0037682857,0.0012937523,0.0026620938,0.0048210365,0.0047870255,0.003442649,0.01155754],"category_scores_gemma":[0.05179727,0.0010407374,0.0015022442,0.0027807665,0.00334855,0.013546524,0.005623896,0.004949115,0.0038979982],"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.0062618577,0.0013365974,0.007002068,0.00091793376,0.000342205,0.00077651726,0.0017522391,0.18091227,0.019599155,0.28923193,0.047582526,0.4442847],"study_design_scores_gemma":[0.00043270076,0.0005930344,0.0017499273,0.0001517714,0.00016826566,0.0012447106,0.0010276686,0.5528362,0.010567792,0.4165839,0.014521779,0.00012225848],"about_ca_topic_score_codex":0.0050248224,"about_ca_topic_score_gemma":0.00492402,"teacher_disagreement_score":0.01155754,"about_ca_system_score_codex":0.0035858117,"about_ca_system_score_gemma":0.004248408,"threshold_uncertainty_score":0.038663864},"labels":[],"label_agreement":null},{"id":"W4409365735","doi":"10.1609/aaai.v39i9.32978","title":"Towards Adversarially Robust Dataset Distillation by Curvature Regularization","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","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 Toronto","funders":"","keywords":"Regularization (linguistics); Curvature; Mathematics; Econometrics; Computer science; Artificial intelligence; Geometry","score_opus":0.03516254684882889,"score_gpt":0.2926540415758772,"score_spread":0.2574914947270483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409365735","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.027302695,0.00033772076,0.9678429,0.0006268239,0.00006856791,0.00008366081,0.00022325426,0.0019052519,0.001609098],"genre_scores_gemma":[0.65656424,0.0003171594,0.33464563,0.0010554563,0.00014605948,0.00029081196,0.0014782798,0.000728262,0.004774135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99789053,0.0009182942,0.000102315265,0.0004883621,0.00040848585,0.00019204998],"domain_scores_gemma":[0.994028,0.003175674,0.0005738523,0.0015993895,0.00039072838,0.00023240164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038536792,0.0017884559,0.0015349159,0.0009167325,0.0006054871,0.0012727343,0.0022414236,0.0018963334,0.0018134079],"category_scores_gemma":[0.012871306,0.0008813709,0.0012725827,0.00095054344,0.0025401695,0.0037601085,0.0050622984,0.0043928265,0.0007687272],"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.00031360876,0.00012865764,0.0014241647,0.00012289273,0.00011861273,0.00015142368,0.00014274172,0.8610494,0.009745357,0.037904866,0.005190876,0.083707385],"study_design_scores_gemma":[0.000014528701,0.000039244707,0.000098907534,0.00000937447,0.00000759353,0.000034518514,0.000008197161,0.9815414,0.0024292094,0.015089339,0.00071584224,0.0000119659235],"about_ca_topic_score_codex":0.0022872428,"about_ca_topic_score_gemma":0.002754346,"teacher_disagreement_score":0.0038536792,"about_ca_system_score_codex":0.0011321963,"about_ca_system_score_gemma":0.001519229,"threshold_uncertainty_score":0.020380437},"labels":[],"label_agreement":null},{"id":"W4409365759","doi":"10.1609/aaai.v39i9.33059","title":"Efficient Neural Network Encoding for 3D Color Lookup Tables","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Vision and Imaging","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":"York University; University of Toronto; Vector Institute","funders":"Samsung","keywords":"Lookup table; Computer science; Encoding (memory); Artificial neural network; Artificial intelligence; Programming language","score_opus":0.05474742245764885,"score_gpt":0.32057009565360506,"score_spread":0.2658226731959562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409365759","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.07432413,0.00040989174,0.9125675,0.0003304055,0.00015415656,0.00005134645,0.00041355455,0.002596247,0.009152631],"genre_scores_gemma":[0.7323503,0.00032127762,0.25914854,0.00015170466,0.000037188245,0.00011262052,0.0005891553,0.0001557653,0.0071335207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99987626,0.000020533613,0.000008683689,0.000025268726,0.000048516344,0.000020675938],"domain_scores_gemma":[0.99971193,0.00010154462,0.000023919925,0.00005474871,0.00009619352,0.0000116251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020128457,0.00036731982,0.0002786004,0.00031625445,0.00021425086,0.00060978014,0.00088005385,0.0004266611,0.0039164713],"category_scores_gemma":[0.0012232828,0.00018469455,0.00023230733,0.00047425355,0.0002799848,0.0010768253,0.0005073756,0.00064230006,0.0006374248],"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.00027571764,0.00011477563,0.00075542205,0.00019821552,0.000038311613,0.00019119905,0.00010790381,0.51893044,0.048689175,0.046410173,0.007050789,0.37723786],"study_design_scores_gemma":[0.00000692753,0.00001873075,0.00009178559,0.0000073315705,0.000005218583,0.0000272522,0.000007933383,0.9857964,0.007179868,0.005365368,0.001486597,0.000006546381],"about_ca_topic_score_codex":0.004193348,"about_ca_topic_score_gemma":0.006507376,"teacher_disagreement_score":0.004193348,"about_ca_system_score_codex":0.00066102203,"about_ca_system_score_gemma":0.0005389487,"threshold_uncertainty_score":0.013101876},"labels":[],"label_agreement":null},{"id":"W4409366064","doi":"10.1609/aaai.v39i11.33240","title":"Towards Projected and Incremental Pseudo-Boolean Model Counting","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education, India; National Research Foundation Singapore; National Supercomputing Centre Singapore; National University of Singapore; National Research Foundation","keywords":"Computer science; Mathematics","score_opus":0.06561222624970106,"score_gpt":0.304535531653894,"score_spread":0.23892330540419296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409366064","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.021856373,0.0006139139,0.9612852,0.0012215697,0.00018081216,0.00020331412,0.00094920537,0.00852446,0.0051652133],"genre_scores_gemma":[0.1901122,0.000335433,0.803043,0.00072137994,0.0001483977,0.0002747825,0.0020036956,0.0011305884,0.0022304535],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933674,0.0021566711,0.000360878,0.0009145295,0.0027523506,0.00044814553],"domain_scores_gemma":[0.97740763,0.011883392,0.0010633832,0.0055944384,0.0034043682,0.0006468477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038062457,0.0013127238,0.0015168035,0.002267716,0.0009599673,0.0038153727,0.004796198,0.0015070016,0.009866924],"category_scores_gemma":[0.043900352,0.0010044608,0.001812105,0.002801296,0.0013680239,0.011227741,0.004470771,0.0033646757,0.002030077],"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.0006387746,0.00035844793,0.0049812356,0.0008677464,0.00018220657,0.00033813628,0.00041662098,0.14689313,0.006609918,0.25650343,0.03248686,0.5497235],"study_design_scores_gemma":[0.00006488011,0.00006707906,0.00022206536,0.000053477237,0.000045069213,0.00015927335,0.000067728746,0.8416539,0.0034232177,0.14678971,0.007425121,0.0000283899],"about_ca_topic_score_codex":0.006951467,"about_ca_topic_score_gemma":0.016142206,"teacher_disagreement_score":0.009866924,"about_ca_system_score_codex":0.0023137564,"about_ca_system_score_gemma":0.0060419096,"threshold_uncertainty_score":0.03300816},"labels":[],"label_agreement":null},{"id":"W4409366272","doi":"10.1609/aaai.v39i10.33111","title":"CAMSIC: Content-aware Masked Image Modeling Transformer for Stereo Image Compression","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Data Compression Techniques","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Transformer; Computer vision; Artificial intelligence; Image compression; Image (mathematics); Image processing; Engineering; Electrical engineering; Voltage","score_opus":0.11625040593403868,"score_gpt":0.3454110092072813,"score_spread":0.2291606032732426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409366272","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.010218574,0.00012587928,0.98631996,0.00007035316,0.000032092652,0.00004985885,0.00015926798,0.0016870587,0.0013369255],"genre_scores_gemma":[0.33779943,0.00032518184,0.65479434,0.00031277505,0.00008792609,0.0001828133,0.0011857656,0.0004711125,0.0048407204],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996741,0.00003485086,0.00001288657,0.00003937732,0.00021007097,0.000028726317],"domain_scores_gemma":[0.9995415,0.00009943482,0.000048768135,0.00014439081,0.00013837242,0.00002762857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037392872,0.0006333674,0.00035598036,0.0006747777,0.00021102867,0.00042497372,0.0009871348,0.00042485664,0.002266538],"category_scores_gemma":[0.0014079054,0.00017232672,0.00042085597,0.00065066206,0.00039935374,0.0010155012,0.000883542,0.00094020355,0.0007704855],"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.00043734285,0.00018451731,0.0012044645,0.00014150226,0.00006433353,0.00020298373,0.00011920514,0.11058105,0.16500627,0.037322104,0.00979766,0.6749386],"study_design_scores_gemma":[0.000020609315,0.00007362489,0.00029581212,0.000007671209,0.000011908593,0.0001906289,0.000013407092,0.9131521,0.07584346,0.006102278,0.004271559,0.00001693437],"about_ca_topic_score_codex":0.002476922,"about_ca_topic_score_gemma":0.004012629,"teacher_disagreement_score":0.002476922,"about_ca_system_score_codex":0.0004828097,"about_ca_system_score_gemma":0.0008092302,"threshold_uncertainty_score":0.007582307},"labels":[],"label_agreement":null},{"id":"W4409366285","doi":"10.1609/aaai.v39i9.33026","title":"Personalized Lip Reading: Adapting to Your Unique Lip Movements with Vision and Language","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Subtitles and Audiovisual Media","field":"Arts and Humanities","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":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; National Research Foundation of Korea; National Research Foundation","keywords":"Reading (process); Computer science; Communication; Linguistics; Psychology; Artificial intelligence; Philosophy","score_opus":0.07853644866455922,"score_gpt":0.3207978085600127,"score_spread":0.2422613598954535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409366285","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.18063682,0.0043033175,0.7562303,0.00063640194,0.0007939514,0.0004044102,0.0028684488,0.042135272,0.0119909905],"genre_scores_gemma":[0.6587014,0.0016762268,0.30751285,0.0010024101,0.00033870773,0.0003122826,0.009037975,0.001668137,0.019750018],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994104,0.00010271687,0.000026396005,0.00028613507,0.00011885824,0.00005540869],"domain_scores_gemma":[0.99951136,0.00017361935,0.000030970972,0.00013467336,0.00011059719,0.00003883919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007165372,0.0015352315,0.0010332115,0.0006838161,0.0002394194,0.0008815939,0.0013848863,0.0010922758,0.0035448337],"category_scores_gemma":[0.0020058441,0.00032880894,0.0010229723,0.00030528315,0.00037227926,0.0014652021,0.0013996063,0.0013161366,0.0045841685],"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.00065439445,0.00027052817,0.003021384,0.00039005143,0.00021397948,0.0004719018,0.00025585433,0.025656594,0.14713028,0.00086439773,0.01764579,0.8034248],"study_design_scores_gemma":[0.0001239938,0.000638015,0.011449123,0.00009999287,0.00026454582,0.0016601416,0.00039024922,0.829118,0.13508777,0.0038062115,0.017195761,0.00016616084],"about_ca_topic_score_codex":0.0023664301,"about_ca_topic_score_gemma":0.003984385,"teacher_disagreement_score":0.0035448337,"about_ca_system_score_codex":0.00032802182,"about_ca_system_score_gemma":0.00035666587,"threshold_uncertainty_score":0.011858642},"labels":[],"label_agreement":null},{"id":"W4409366391","doi":"10.1609/aaai.v39i8.32932","title":"ReMask-Animate: Refined Character Image Animation Using Mask-Guided Adapters","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Human Motion and Animation","field":"Engineering","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":"Carleton University","funders":"","keywords":"Character (mathematics); Computer science; Animation; Computer graphics (images); Computer vision; Artificial intelligence; Mathematics; Geometry","score_opus":0.08381788267972491,"score_gpt":0.3050052018700787,"score_spread":0.22118731919035378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409366391","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.03174738,0.0002741677,0.9524249,0.00013306725,0.000099246114,0.00017388874,0.00020505287,0.011355641,0.0035866164],"genre_scores_gemma":[0.35320362,0.00045184308,0.6340304,0.00028045085,0.00009469104,0.00019440499,0.0012388963,0.0018498624,0.008655751],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99979323,0.0000351561,0.000007996182,0.00007255283,0.000060140894,0.000030888874],"domain_scores_gemma":[0.9996691,0.0000960018,0.000030497717,0.000112008755,0.000045093944,0.000047384678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004211383,0.0012171952,0.0006800642,0.000680941,0.00027334064,0.0007906243,0.0013863293,0.00070532993,0.004797129],"category_scores_gemma":[0.001585716,0.0004160707,0.00072187505,0.00036346845,0.00043967212,0.0010404077,0.0013001914,0.0009838284,0.0017033021],"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.0007093086,0.00022909298,0.0012830507,0.00020140407,0.00009857997,0.00032342185,0.00033440336,0.15661317,0.13749062,0.0077061974,0.012676245,0.6823346],"study_design_scores_gemma":[0.000022153114,0.000091005764,0.0003052828,0.000012091557,0.000017905168,0.00015767544,0.00003492141,0.9690214,0.021125779,0.002399212,0.006796376,0.000016246098],"about_ca_topic_score_codex":0.0035357398,"about_ca_topic_score_gemma":0.004765854,"teacher_disagreement_score":0.004797129,"about_ca_system_score_codex":0.00041854088,"about_ca_system_score_gemma":0.00040993484,"threshold_uncertainty_score":0.016048014},"labels":[],"label_agreement":null},{"id":"W4409366430","doi":"10.1609/aaai.v39i8.32898","title":"Multi-axis Prompt and Multi-dimension Fusion Network for All-in-one Weather-degraded Image Restoration","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Image Fusion Techniques","field":"Engineering","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":"Artificial Intelligence in Medicine (Canada)","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Dimension (graph theory); Image (mathematics); Fusion; Image fusion; Artificial intelligence; Computer science; Computer vision; Mathematics","score_opus":0.08361940241962,"score_gpt":0.3249781678598214,"score_spread":0.2413587654402014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409366430","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.02743804,0.0005376761,0.9685157,0.00020522527,0.00007665681,0.000042506654,0.00009468326,0.0015316105,0.0015579644],"genre_scores_gemma":[0.71780485,0.00035219966,0.27526525,0.00028367102,0.00008544277,0.000112416354,0.00037796155,0.00012757893,0.0055906023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977094,0.000044248358,0.000010218172,0.00007059238,0.00006216041,0.000041737498],"domain_scores_gemma":[0.99973136,0.000069473,0.000036929712,0.000045150497,0.00009275509,0.000024372506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077448523,0.00083201367,0.0007078855,0.00033413712,0.00034209708,0.00045689018,0.0012342993,0.0010038362,0.0020484515],"category_scores_gemma":[0.0012631387,0.00032307373,0.00046187875,0.0003706365,0.00053263124,0.0012612189,0.0010212313,0.0013073313,0.00042758905],"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.0003825894,0.00014839545,0.0012705271,0.00009813552,0.000073457646,0.00011573451,0.000093001676,0.5532494,0.022109399,0.0072993506,0.004842233,0.41031775],"study_design_scores_gemma":[0.000005743193,0.000037011752,0.00016864712,0.0000030632814,0.000008445619,0.00002135606,0.0000052758173,0.9946549,0.0027500591,0.0018240842,0.00051505666,0.0000064677474],"about_ca_topic_score_codex":0.0047949897,"about_ca_topic_score_gemma":0.006958541,"teacher_disagreement_score":0.0047949897,"about_ca_system_score_codex":0.00062323565,"about_ca_system_score_gemma":0.0009187104,"threshold_uncertainty_score":0.009534121},"labels":[],"label_agreement":null},{"id":"W4409366480","doi":"10.1609/aaai.v39i7.32768","title":"Leveraging Large Vision-Language Model as User Intent-Aware Encoder for Composed Image Retrieval","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institute of Aging","funders":"National Natural Science Foundation of China","keywords":"Computer science; Encoder; Computer vision; Image (mathematics); Artificial intelligence; Image retrieval; Information retrieval; Language model; Natural language processing","score_opus":0.04652793084147333,"score_gpt":0.34243717341487645,"score_spread":0.2959092425734031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409366480","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.022531549,0.0010007181,0.9647029,0.000471395,0.00008378574,0.00012320768,0.00036587013,0.008673193,0.002047476],"genre_scores_gemma":[0.47965613,0.00080598856,0.5067603,0.0011738176,0.00016522025,0.00031080135,0.0026115002,0.0004930235,0.008023209],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994647,0.00013380883,0.00003141073,0.00017862806,0.00013227905,0.00005918695],"domain_scores_gemma":[0.99895465,0.00050018943,0.0000759495,0.00020849884,0.00019884114,0.00006180601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009965892,0.00090116897,0.00081729825,0.0005933636,0.00022329114,0.0008505888,0.001946835,0.00096733886,0.002380752],"category_scores_gemma":[0.003907625,0.00033612837,0.0007488328,0.00050129875,0.00057255453,0.0025485125,0.001225722,0.002068658,0.0017127091],"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.0004699819,0.00047351033,0.0018714871,0.0004087454,0.00010423141,0.00026540304,0.00032542789,0.11803312,0.053791337,0.016695544,0.017213494,0.79034775],"study_design_scores_gemma":[0.000025886782,0.00014068207,0.00025772423,0.000017416281,0.000030813608,0.00008284884,0.00003600868,0.9721327,0.014965936,0.009750679,0.0025353765,0.000023907887],"about_ca_topic_score_codex":0.003974327,"about_ca_topic_score_gemma":0.0064976546,"teacher_disagreement_score":0.003974327,"about_ca_system_score_codex":0.0008164949,"about_ca_system_score_gemma":0.0013233029,"threshold_uncertainty_score":0.007964432},"labels":[],"label_agreement":null},{"id":"W4409366558","doi":"10.1609/aaai.v39i8.32946","title":"PointTalk: Audio-Driven Dynamic Lip Point Cloud for 3D Gaussian-based Talking Head Synthesis","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Face recognition and analysis","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Head (geology); Point cloud; Computer science; Point (geometry); Gaussian; Computer graphics (images); Artificial intelligence; Mathematics; Geology; Physics; Geometry","score_opus":0.04245403131363625,"score_gpt":0.3049185289491347,"score_spread":0.26246449763549845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409366558","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.0067152167,0.00006237692,0.99071336,0.000033902943,0.000023985549,0.00004363944,0.00007192286,0.0015123243,0.00082317955],"genre_scores_gemma":[0.24236009,0.00025990067,0.75145185,0.00014155121,0.000048295966,0.00019136834,0.0007059188,0.00062944327,0.0042116274],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997634,0.000032850494,0.000008135652,0.000043707045,0.00012939822,0.000022455051],"domain_scores_gemma":[0.9998018,0.00006641423,0.000018369823,0.000042662712,0.00004272468,0.000028122973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034316536,0.00057772046,0.00042517186,0.00044355742,0.0001958244,0.000423767,0.0008401325,0.0005000791,0.004749737],"category_scores_gemma":[0.0007927211,0.00036660285,0.0006482651,0.00032139118,0.000355338,0.00053190195,0.0014021171,0.00075772643,0.0015661332],"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.0004716097,0.00011889629,0.00071861164,0.00024347859,0.00007428457,0.00030681718,0.0003172991,0.119650625,0.25648057,0.009855204,0.006396126,0.6053664],"study_design_scores_gemma":[0.000071541355,0.00015703167,0.00081781484,0.000021994536,0.000025427755,0.00039957798,0.000080370395,0.8935152,0.09036149,0.0039769877,0.010521988,0.000050586397],"about_ca_topic_score_codex":0.001352519,"about_ca_topic_score_gemma":0.0021899743,"teacher_disagreement_score":0.004749737,"about_ca_system_score_codex":0.00030524647,"about_ca_system_score_gemma":0.00054037716,"threshold_uncertainty_score":0.015889466},"labels":[],"label_agreement":null},{"id":"W4409366637","doi":"10.1609/aaai.v39i7.32808","title":"RealisHuman: A Two-Stage Approach for Refining Malformed Human Parts in Generated Images","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Human Pose and Action Recognition","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Refining (metallurgy); Stage (stratigraphy); Computer science; Artificial intelligence; Biology; Materials science; Metallurgy; Paleontology","score_opus":0.11396421710402253,"score_gpt":0.3439316654377409,"score_spread":0.22996744833371835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409366637","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.006037178,0.00017529634,0.9898381,0.00013259726,0.00009066317,0.00009345767,0.000059082024,0.002065467,0.0015080083],"genre_scores_gemma":[0.21928895,0.00027893117,0.76884276,0.00060429185,0.00010906374,0.00021035965,0.00057623285,0.0015486056,0.008540876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992362,0.00014086327,0.000024198813,0.00018426219,0.00034052375,0.00007389959],"domain_scores_gemma":[0.9988661,0.00046579115,0.000110026245,0.00031260093,0.00016906776,0.0000764289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017358483,0.0015914319,0.0008129602,0.00082375534,0.00036527961,0.0011452569,0.0026387926,0.0015964274,0.00635253],"category_scores_gemma":[0.0031873262,0.00079987774,0.0012855412,0.00034663887,0.0013005047,0.0011592789,0.0029031578,0.0018192147,0.0016263803],"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.00055397087,0.00019073329,0.0010222584,0.00032443122,0.00018684645,0.00057732075,0.0004572906,0.4458942,0.098712966,0.022609107,0.012527171,0.41694367],"study_design_scores_gemma":[0.000038862985,0.00015195593,0.00024987393,0.000028827768,0.000025686277,0.0003545861,0.000035216286,0.95275885,0.029057479,0.009723543,0.007538045,0.0000371834],"about_ca_topic_score_codex":0.0016229308,"about_ca_topic_score_gemma":0.0034115305,"teacher_disagreement_score":0.00635253,"about_ca_system_score_codex":0.0006445542,"about_ca_system_score_gemma":0.0007104848,"threshold_uncertainty_score":0.02125138},"labels":[],"label_agreement":null},{"id":"W4409366792","doi":"10.1609/aaai.v39i7.32725","title":"FunEditor: Achieving Complex Image Edits via Function Aggregation with Diffusion Models","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Image Retrieval and Classification Techniques","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; Huawei Technologies (Canada)","funders":"","keywords":"Diffusion; Function (biology); Computer science; Image (mathematics); Computer graphics (images); Biological system; Computer vision; Physics; Biology; Thermodynamics","score_opus":0.05099039595220399,"score_gpt":0.2792226312104285,"score_spread":0.2282322352582245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409366792","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.013698915,0.0002664334,0.977679,0.00016483775,0.000055144796,0.0000525601,0.000082777166,0.00658863,0.0014117303],"genre_scores_gemma":[0.32950696,0.0003577071,0.661605,0.0003192966,0.00007821809,0.00017082461,0.00044797323,0.0014885578,0.0060254927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944156,0.00012288943,0.000027581766,0.00019215232,0.00015873904,0.000057044836],"domain_scores_gemma":[0.9978161,0.0012887735,0.00012465028,0.00047426796,0.00018828275,0.000107883134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014194221,0.0013675889,0.0013290283,0.00084345206,0.00060019654,0.0014657805,0.002480845,0.0018223121,0.0033043064],"category_scores_gemma":[0.005605867,0.0006930029,0.0013472037,0.00061441894,0.0009107873,0.002968175,0.0015781056,0.002611409,0.0010895706],"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.00020382305,0.00018275967,0.0011454262,0.00021178626,0.0001261829,0.0001664887,0.00022903933,0.6541416,0.016357537,0.020590581,0.007719205,0.29892564],"study_design_scores_gemma":[0.000011059289,0.000016200942,0.00004453053,0.000003001796,0.000006290249,0.00002700465,0.0000070735045,0.99172723,0.0029819857,0.0042963065,0.00087291916,0.0000063986604],"about_ca_topic_score_codex":0.007673292,"about_ca_topic_score_gemma":0.011010206,"teacher_disagreement_score":0.007673292,"about_ca_system_score_codex":0.0012801229,"about_ca_system_score_gemma":0.001177354,"threshold_uncertainty_score":0.015257239},"labels":[],"label_agreement":null},{"id":"W4409366958","doi":"10.1609/aaai.v39i7.32792","title":"Stitch, Contrast, and Segment: Learning a Human Action Segmentation Model Using Trimmed Skeleton Videos","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Human Pose and Action Recognition","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Contrast (vision); Skeleton (computer programming); Segmentation; Artificial intelligence; Human skeleton; Computer vision; Computer science; Pattern recognition (psychology)","score_opus":0.11139220873615362,"score_gpt":0.3464779246771,"score_spread":0.23508571594094635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409366958","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.10607906,0.00098854,0.87994087,0.0003502328,0.00016954946,0.0003220888,0.0008530211,0.008397494,0.0028991117],"genre_scores_gemma":[0.53398204,0.00058011524,0.4495384,0.0005111996,0.000113531445,0.0003569471,0.0044929865,0.0005177626,0.009907103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953115,0.000054153068,0.000014653958,0.0002843404,0.000061897495,0.000053931242],"domain_scores_gemma":[0.99948764,0.00019936755,0.000060231785,0.00011430921,0.00007377015,0.000064658416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077663665,0.0016059865,0.00091031316,0.0011439469,0.00032545722,0.00066499563,0.0016769344,0.0015900908,0.0029521172],"category_scores_gemma":[0.001953773,0.0006840175,0.001188982,0.00060588773,0.000860125,0.0013272959,0.0008829865,0.0020651035,0.0012394607],"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.0006170086,0.00034072142,0.003130625,0.00018374127,0.0001450915,0.00023570674,0.00016585257,0.24521321,0.034638356,0.0041409717,0.00899087,0.70219785],"study_design_scores_gemma":[0.000012821874,0.00013655696,0.00071351754,0.000014174653,0.000014201633,0.000072320276,0.000016745267,0.99068403,0.0058460273,0.0016430713,0.000835311,0.0000113370725],"about_ca_topic_score_codex":0.009310316,"about_ca_topic_score_gemma":0.015279821,"teacher_disagreement_score":0.009310316,"about_ca_system_score_codex":0.001078845,"about_ca_system_score_gemma":0.0011608503,"threshold_uncertainty_score":0.018512249},"labels":[],"label_agreement":null},{"id":"W4409367093","doi":"10.1609/aaai.v39i5.32535","title":"RCTrans: Radar-Camera Transformer via Radar Densifier and Sequential Decoder for 3D Object Detection","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced SAR Imaging Techniques","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Radar; Computer science; Transformer; Computer vision; Artificial intelligence; Engineering; Telecommunications; Electrical engineering; Voltage","score_opus":0.032193484715730476,"score_gpt":0.28897253058318956,"score_spread":0.2567790458674591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409367093","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.00930962,0.0003014143,0.9837488,0.000098887685,0.0000636445,0.000090717695,0.00027790578,0.0049940036,0.0011149165],"genre_scores_gemma":[0.20054159,0.00045049237,0.7848487,0.00055497134,0.00012652439,0.00023635819,0.0029579299,0.00096328655,0.009320146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988047,0.00013181278,0.00006453214,0.00035778937,0.0005061702,0.00013501251],"domain_scores_gemma":[0.99911934,0.00024452276,0.00007613361,0.0002263777,0.00027013084,0.00006347185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076184835,0.0016216139,0.0012675142,0.0010282942,0.00042885594,0.0010244733,0.0023415613,0.0011851726,0.0038602892],"category_scores_gemma":[0.002681631,0.000592243,0.0008914651,0.00095362123,0.00078842405,0.002158543,0.002365695,0.001609302,0.0034011318],"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.0008052217,0.00022695844,0.0019329145,0.00023046657,0.00009300419,0.00044220698,0.00025585314,0.048749007,0.09410109,0.013520971,0.013722707,0.8259196],"study_design_scores_gemma":[0.000055243756,0.0002001807,0.0006561388,0.000017806247,0.000048214155,0.00059032533,0.000073622556,0.9033219,0.078840196,0.0075234473,0.008628361,0.000044431497],"about_ca_topic_score_codex":0.006270565,"about_ca_topic_score_gemma":0.009104999,"teacher_disagreement_score":0.006270565,"about_ca_system_score_codex":0.0006810413,"about_ca_system_score_gemma":0.0017364003,"threshold_uncertainty_score":0.012914002},"labels":[],"label_agreement":null},{"id":"W4409367117","doi":"10.1609/aaai.v39i7.32838","title":"Alignment-Free RGB-T Salient Object Detection: A Large-Scale Dataset and Progressive Correlation Network","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Visual Attention and Saliency Detection","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":"Artificial Intelligence in Medicine (Canada)","funders":"Natural Science Foundation of Anhui Province; National Natural Science Foundation of China","keywords":"Scale (ratio); Correlation; Artificial intelligence; Salient; Computer science; RGB color model; Pattern recognition (psychology); Object (grammar); Computer vision; Cartography; Geography; Mathematics; Geometry","score_opus":0.03036189820820484,"score_gpt":0.29652952802164534,"score_spread":0.2661676298134405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409367117","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.565208,0.007965572,0.26235312,0.001153799,0.00097371015,0.00201346,0.09693836,0.04170994,0.021683997],"genre_scores_gemma":[0.4463127,0.0010651178,0.26397336,0.0005786885,0.0001775512,0.0010408681,0.27879587,0.0009924478,0.0070633455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982377,0.00018136442,0.000065374305,0.00089463004,0.0004082513,0.00021264155],"domain_scores_gemma":[0.9989116,0.00016749227,0.00012754333,0.00037581855,0.00031472353,0.00010280856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011362832,0.0028264094,0.0013513158,0.0026536249,0.0012089907,0.0012172346,0.0032107397,0.0015250716,0.0019698688],"category_scores_gemma":[0.0036816667,0.00070853037,0.0012531702,0.002784303,0.00092733727,0.001920247,0.0026597842,0.0015344716,0.002340727],"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.001545179,0.0017066946,0.026691651,0.0022804178,0.0007028935,0.0010931009,0.00058819365,0.07527062,0.0784533,0.0031148933,0.1909889,0.61756414],"study_design_scores_gemma":[0.00027214308,0.0006925761,0.06096549,0.00024756542,0.00033226982,0.0017515376,0.00072692084,0.80742735,0.056729127,0.008613603,0.06201242,0.0002291172],"about_ca_topic_score_codex":0.02249079,"about_ca_topic_score_gemma":0.043690074,"teacher_disagreement_score":0.02249079,"about_ca_system_score_codex":0.0013528321,"about_ca_system_score_gemma":0.0013494098,"threshold_uncertainty_score":0.044719756},"labels":[],"label_agreement":null},{"id":"W4409367125","doi":"10.1609/aaai.v39i7.32769","title":"RealisID: Scale-Robust and Fine-Controllable Identity Customization via Local and Global Complementation","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Cognitive Computing and Networks","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Complementation; Personalization; Scale (ratio); Identity (music); Computer science; Human–computer interaction; World Wide Web; Biology; Geography; Art; Genetics; Aesthetics; Cartography","score_opus":0.04033418163011707,"score_gpt":0.3016133730694952,"score_spread":0.2612791914393781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409367125","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.032470293,0.0001538079,0.9600998,0.00010349855,0.000056473866,0.00008226527,0.00006353949,0.0032946037,0.003675678],"genre_scores_gemma":[0.48341116,0.00020064796,0.5016071,0.00036481518,0.00006448573,0.00022038697,0.00047009162,0.0009355693,0.012725693],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994349,0.000073583156,0.000020806408,0.0002230841,0.00017562235,0.000071912684],"domain_scores_gemma":[0.999566,0.00009436608,0.00005072253,0.00016285336,0.00008265642,0.000043331605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085093244,0.00085056934,0.00080834044,0.0006054819,0.0004416643,0.0008437146,0.0022047416,0.00073637516,0.002472456],"category_scores_gemma":[0.0015072253,0.00045511586,0.00070467853,0.00039384037,0.0012640788,0.0013531148,0.0021220339,0.001430908,0.0009971063],"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.00035091361,0.00026238075,0.0016381182,0.00015057175,0.00006789539,0.00028603052,0.00045606136,0.19915657,0.13487034,0.019368324,0.0069931773,0.63639957],"study_design_scores_gemma":[0.00003161509,0.00009520983,0.00044504777,0.000009654223,0.000012703157,0.0001029238,0.000059940747,0.9574817,0.030670244,0.0065265554,0.0045386367,0.00002576992],"about_ca_topic_score_codex":0.0032487246,"about_ca_topic_score_gemma":0.004066017,"teacher_disagreement_score":0.0032487246,"about_ca_system_score_codex":0.0007423423,"about_ca_system_score_gemma":0.0007605427,"threshold_uncertainty_score":0.008271217},"labels":[],"label_agreement":null},{"id":"W4409367322","doi":"10.1609/aaai.v39i6.32658","title":"Qua2SeDiMo: Quantifiable Quantization Sensitivity of Diffusion Models","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Rare-earth and actinide compounds","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Huawei Technologies (Canada)","funders":"Alberta Innovates","keywords":"Sensitivity (control systems); Quantization (signal processing); Diffusion; Statistical physics; Computer science; Physics; Algorithm; Engineering; Electronic engineering; Quantum mechanics","score_opus":0.05416286477246459,"score_gpt":0.293259238627441,"score_spread":0.23909637385497642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409367322","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.05965604,0.00086207443,0.9290112,0.0005525725,0.00014731908,0.00007655739,0.0002169512,0.003926291,0.005550945],"genre_scores_gemma":[0.7162864,0.0003270955,0.27829024,0.00040095713,0.000044308345,0.00009286776,0.0003195165,0.00044366033,0.003794859],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991302,0.00021711986,0.00005793809,0.00016681707,0.0003427594,0.00008519841],"domain_scores_gemma":[0.9978855,0.0010594132,0.00015837421,0.00045214174,0.00037322103,0.00007146175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021194809,0.00079456985,0.00068932475,0.0006075601,0.0004899524,0.0015068558,0.0016556027,0.0011435742,0.0034002138],"category_scores_gemma":[0.009935255,0.0004193082,0.000532598,0.00043482133,0.0009918564,0.0029958014,0.0020149606,0.0021353278,0.0005522354],"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.0005042164,0.00013025297,0.0022018836,0.00027818242,0.00010821587,0.00017020885,0.00019697899,0.5831411,0.03765573,0.08086855,0.0053497357,0.2893949],"study_design_scores_gemma":[0.000020413318,0.00006030492,0.00014121948,0.00001633475,0.000012361316,0.000040203588,0.000014857081,0.96480757,0.013079301,0.02065847,0.001135067,0.000013933609],"about_ca_topic_score_codex":0.0029934095,"about_ca_topic_score_gemma":0.0063295756,"teacher_disagreement_score":0.0034002138,"about_ca_system_score_codex":0.0012126208,"about_ca_system_score_gemma":0.0010053574,"threshold_uncertainty_score":0.011374831},"labels":[],"label_agreement":null},{"id":"W4409367667","doi":"10.1609/aaai.v39i6.32683","title":"VHM: Versatile and Honest Vision Language Model for Remote Sensing Image Analysis","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Image Retrieval and Classification Techniques","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":"Artificial Intelligence in Medicine (Canada)","funders":"National Natural Science Foundation of China","keywords":"Computer science; Artificial intelligence; Image (mathematics); Computer vision; Natural language processing; Remote sensing; Geology","score_opus":0.042294635150848095,"score_gpt":0.33095356952217353,"score_spread":0.28865893437132545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409367667","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.012562664,0.000723647,0.94287413,0.0012599871,0.00021921053,0.00064284465,0.007856265,0.029625643,0.004235565],"genre_scores_gemma":[0.2115661,0.00044654537,0.7527769,0.0018194056,0.00021579853,0.0015189312,0.023712931,0.0013153155,0.0066280854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776626,0.00065707584,0.00017695873,0.0006514895,0.0005816691,0.0001665285],"domain_scores_gemma":[0.9965815,0.001676283,0.00024196484,0.0006843351,0.0006679481,0.00014802247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002665371,0.0013958506,0.00083440903,0.001751362,0.00064188696,0.002334894,0.0043017524,0.0017657191,0.0065154117],"category_scores_gemma":[0.0092116725,0.00069356774,0.0025709842,0.0008445578,0.0009937249,0.0054104193,0.0025744971,0.0034859544,0.0054306816],"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.0009806544,0.0009029026,0.005591009,0.0012020259,0.00027515422,0.00063756615,0.0012483522,0.11794238,0.027666008,0.09309001,0.14438158,0.60608226],"study_design_scores_gemma":[0.000033447068,0.00010709647,0.0005909538,0.00004939377,0.000029208906,0.00014590158,0.00013004494,0.92936105,0.006655272,0.04303086,0.019809606,0.00005719929],"about_ca_topic_score_codex":0.008603046,"about_ca_topic_score_gemma":0.011909146,"teacher_disagreement_score":0.008603046,"about_ca_system_score_codex":0.0019748227,"about_ca_system_score_gemma":0.0021849743,"threshold_uncertainty_score":0.021796227},"labels":[],"label_agreement":null},{"id":"W4409368133","doi":"10.1609/aaai.v39i4.32397","title":"L4DR: LiDAR-4DRadar Fusion for Weather-Robust 3D Object Detection","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":13,"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":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Lidar; Fusion; Computer vision; Object (grammar); Computer science; Remote sensing; Artificial intelligence; Object based; Meteorology; Environmental science; Geography","score_opus":0.060215994674781066,"score_gpt":0.3033208690342145,"score_spread":0.24310487435943345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409368133","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.021731228,0.00090427295,0.96226835,0.0002473647,0.000166957,0.00014794717,0.0009741846,0.01139079,0.0021689846],"genre_scores_gemma":[0.24911118,0.00053342513,0.73958075,0.00067617616,0.00013301981,0.00023696119,0.0048069973,0.00075349817,0.0041679842],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99899036,0.00010606281,0.00004700229,0.00029424293,0.00043575297,0.00012655184],"domain_scores_gemma":[0.99959844,0.00005964833,0.00004199487,0.0001157953,0.00015664563,0.00002743979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010367957,0.0012946534,0.0009739033,0.0016963045,0.0004217176,0.0010521234,0.0018183464,0.0011474082,0.0029089153],"category_scores_gemma":[0.0016867789,0.00057619583,0.0011967438,0.0010569531,0.0004828488,0.0016771212,0.0034419405,0.0012094099,0.002440145],"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.0003517178,0.00024099852,0.0023545371,0.00034710005,0.00022827116,0.0002491181,0.00019654928,0.05192971,0.13537344,0.0031722295,0.016851831,0.78870445],"study_design_scores_gemma":[0.000065640255,0.00023173913,0.003552874,0.00005214367,0.00009577307,0.00049435464,0.00013353617,0.87189925,0.09119611,0.006876358,0.025302246,0.00009991569],"about_ca_topic_score_codex":0.0034967363,"about_ca_topic_score_gemma":0.0058864155,"teacher_disagreement_score":0.0034967363,"about_ca_system_score_codex":0.0005658986,"about_ca_system_score_gemma":0.0008622343,"threshold_uncertainty_score":0.009731293},"labels":[],"label_agreement":null},{"id":"W4409368222","doi":"10.1609/aaai.v39i4.32403","title":"EGSRAL:An Enhanced 3D Gaussian Splatting Based Renderer with Automated Labeling for Large-Scale Driving Scene","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Computer Graphics and Visualization Techniques","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":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Computer graphics (images); Scale (ratio); Artificial intelligence; Computer vision; Cartography; Geography","score_opus":0.041195018625442635,"score_gpt":0.3319058310828365,"score_spread":0.2907108124573939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409368222","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.0126171755,0.00020488458,0.94553596,0.00014741569,0.00009007904,0.00014463282,0.0007035533,0.03758069,0.0029755314],"genre_scores_gemma":[0.095695674,0.00030557875,0.890446,0.00029922367,0.00004376005,0.00015784787,0.0028395334,0.0059377947,0.0042745746],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99947375,0.00006310578,0.000019118559,0.000096857795,0.00028691118,0.00006039551],"domain_scores_gemma":[0.9996031,0.00010632045,0.00002700698,0.0001324227,0.00008167552,0.000049489594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006213668,0.0017808015,0.00076148834,0.001100101,0.00035690155,0.00121914,0.0020070472,0.0008161535,0.008078084],"category_scores_gemma":[0.0012469805,0.0006681567,0.0015013961,0.0006352385,0.0005461263,0.0011900238,0.0020157278,0.0020882208,0.0028171316],"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.0007974908,0.0003262077,0.0016713766,0.00045670825,0.00020922114,0.0004781252,0.000625197,0.088676624,0.1997844,0.013650671,0.045135003,0.64818895],"study_design_scores_gemma":[0.00015225618,0.0001480869,0.00077287457,0.000035302834,0.00003812697,0.00037790294,0.0001230445,0.86487806,0.08604715,0.0070651076,0.04026306,0.00009901208],"about_ca_topic_score_codex":0.005039187,"about_ca_topic_score_gemma":0.013291849,"teacher_disagreement_score":0.008078084,"about_ca_system_score_codex":0.00075836823,"about_ca_system_score_gemma":0.0010008509,"threshold_uncertainty_score":0.027023911},"labels":[],"label_agreement":null},{"id":"W4409368447","doi":"10.1609/aaai.v39i4.32420","title":"PixelMan: Consistent Object Editing with Diffusion Models via Pixel Manipulation and Generation","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"3D Shape Modeling and Analysis","field":"Engineering","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":"University of Alberta; Huawei Technologies (Canada)","funders":"","keywords":"Object (grammar); Computer science; Diffusion; Pixel; Image editing; Computer graphics (images); Artificial intelligence; Computer vision; Physics; Image (mathematics)","score_opus":0.058567491827208856,"score_gpt":0.25010985462281315,"score_spread":0.1915423627956043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409368447","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.0033836535,0.00021077595,0.993306,0.00007375381,0.00004226754,0.000036155274,0.000042360232,0.0022034214,0.00070165703],"genre_scores_gemma":[0.12282504,0.0003071747,0.8707294,0.0003241699,0.00007026817,0.0001311516,0.00041249418,0.0010812379,0.004119022],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993057,0.00012497336,0.000030357292,0.00022553827,0.00026419165,0.00004911514],"domain_scores_gemma":[0.99852633,0.00065865094,0.00014485138,0.00043612413,0.00017134253,0.00006273863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013761098,0.0012311009,0.0011407526,0.00074492145,0.00047122763,0.0013550151,0.003535243,0.0017168665,0.002496926],"category_scores_gemma":[0.0038869071,0.00081196305,0.0012696511,0.0005773159,0.0010380638,0.0019452132,0.0017895313,0.002247151,0.0011147759],"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.0002706267,0.00012872636,0.0009385145,0.0003039507,0.0001738963,0.00020263108,0.0002822076,0.42850745,0.040335033,0.021165717,0.007937812,0.49975342],"study_design_scores_gemma":[0.00002142452,0.000034921322,0.00007592147,0.000009361375,0.000012604919,0.000090921836,0.0000117035825,0.9812553,0.009327134,0.0063619725,0.0027843688,0.000014454036],"about_ca_topic_score_codex":0.004210259,"about_ca_topic_score_gemma":0.0063919537,"teacher_disagreement_score":0.004210259,"about_ca_system_score_codex":0.0008084668,"about_ca_system_score_gemma":0.0010038265,"threshold_uncertainty_score":0.008371532},"labels":[],"label_agreement":null},{"id":"W4409368571","doi":"10.1609/aaai.v39i4.32373","title":"Motion Decoupled 3D Gaussian Splatting for Dynamic Object Representation","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Robotics and Sensor-Based Localization","field":"Engineering","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 Ottawa","funders":"","keywords":"Computer science; Representation (politics); Motion (physics); Object (grammar); Artificial intelligence; Computer vision","score_opus":0.039380375592217354,"score_gpt":0.3009753932315805,"score_spread":0.26159501763936316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409368571","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.006183337,0.00015362946,0.98798954,0.00008148041,0.000028745548,0.000046561196,0.00034102914,0.0041139578,0.0010617713],"genre_scores_gemma":[0.1277796,0.0005468039,0.86313075,0.00024238351,0.000038168822,0.00013446783,0.0040195384,0.0017769478,0.002331325],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990075,0.00010142576,0.000049807728,0.0001965972,0.00055698084,0.00008775106],"domain_scores_gemma":[0.9992373,0.00012635565,0.00005468698,0.00033770906,0.0001884012,0.000055532975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009088382,0.0016695418,0.0011595903,0.0014432624,0.00049101276,0.0018750125,0.002320931,0.0011726068,0.003548855],"category_scores_gemma":[0.0021993355,0.00072465756,0.0018809832,0.0020182165,0.000846029,0.0022609744,0.0024858203,0.0020433054,0.001945953],"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.00029772733,0.00017729771,0.002441974,0.00031434098,0.00016797532,0.00024660767,0.00030190725,0.3461487,0.061513044,0.02696268,0.015993359,0.5454344],"study_design_scores_gemma":[0.0000145280965,0.000033207194,0.0003618289,0.000010290013,0.000013274551,0.00012713192,0.000032854077,0.9714636,0.014852091,0.00660351,0.0064631267,0.000024487876],"about_ca_topic_score_codex":0.008629366,"about_ca_topic_score_gemma":0.015805457,"teacher_disagreement_score":0.008629366,"about_ca_system_score_codex":0.0012076101,"about_ca_system_score_gemma":0.0016274521,"threshold_uncertainty_score":0.01715827},"labels":[],"label_agreement":null},{"id":"W4409369201","doi":"10.1609/aaai.v39i1.32020","title":"ChemVLM: Exploring the Power of Multimodal Large Language Models in Chemistry Area","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Power (physics); Computer science; Chemistry; Linguistics; Philosophy; Physics; Thermodynamics","score_opus":0.0846630502594492,"score_gpt":0.29566091103300757,"score_spread":0.21099786077355837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409369201","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.22214508,0.013155772,0.5806561,0.0073690037,0.0014482094,0.0014062151,0.059124853,0.09246098,0.022233812],"genre_scores_gemma":[0.4777415,0.002712648,0.39781997,0.0028213975,0.00039812716,0.0015570936,0.10359769,0.003130578,0.010220998],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986615,0.00061341195,0.00007665068,0.00039197886,0.00018218056,0.00007431577],"domain_scores_gemma":[0.9951762,0.0035905675,0.00014751448,0.00057122187,0.0003539512,0.0001605798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030709447,0.0024621508,0.00093493715,0.0019474605,0.00089513836,0.0021199016,0.002726026,0.0022532865,0.0063905967],"category_scores_gemma":[0.010738044,0.0006515051,0.0022790777,0.0012789207,0.000570807,0.0042168032,0.0025059031,0.003541608,0.0036757085],"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.0009805865,0.0011751787,0.008672677,0.0017339556,0.00094162964,0.0006852472,0.00064526795,0.37839827,0.008280212,0.01605445,0.12629074,0.45614174],"study_design_scores_gemma":[0.00012959147,0.00014128152,0.00069186476,0.00006510373,0.00008189741,0.00010922597,0.00013246691,0.96983117,0.0033273464,0.012105628,0.0133360615,0.000048448168],"about_ca_topic_score_codex":0.023977246,"about_ca_topic_score_gemma":0.034413382,"teacher_disagreement_score":0.023977246,"about_ca_system_score_codex":0.002165279,"about_ca_system_score_gemma":0.0022907767,"threshold_uncertainty_score":0.04767537},"labels":[],"label_agreement":null},{"id":"W4409369304","doi":"10.1609/aaai.v39i1.32061","title":"dyAb: Flow Matching for Flexible Antibody Design with AlphaFold-driven Pre-binding Antigen","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Monoclonal and Polyclonal Antibodies Research","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mila - Quebec Artificial Intelligence Institute","funders":"National Science and Technology Major Project; National Natural Science Foundation of China; Westlake University; Tencent","keywords":"Matching (statistics); Antigen; Antibody; Computer science; Chemistry; Computational biology; Immunology; Mathematics; Biology; Statistics","score_opus":0.09856403750296867,"score_gpt":0.3834008556059928,"score_spread":0.28483681810302414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409369304","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.04190999,0.00044298312,0.9503106,0.0002406865,0.00009090143,0.0001086123,0.00019611858,0.0011616688,0.0055384696],"genre_scores_gemma":[0.63205785,0.0006194139,0.35957825,0.00037381618,0.000056482437,0.00048034298,0.000531711,0.00044203314,0.005860027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997938,0.00006206143,0.0000078206895,0.000032625016,0.00006329954,0.000040395233],"domain_scores_gemma":[0.999602,0.00019388377,0.00004618532,0.000043516462,0.00006192538,0.00005244244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089215394,0.0006841443,0.00084039033,0.00037934893,0.00044976862,0.00078691123,0.0011825535,0.0010786462,0.0035275363],"category_scores_gemma":[0.001523348,0.00042550275,0.00068326696,0.00029029947,0.0006316722,0.00065102556,0.0009909993,0.0009154018,0.00060581666],"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.000085311294,0.00004778903,0.00053237425,0.000054532826,0.000017127339,0.000043825836,0.000027629407,0.9663019,0.003914621,0.01125422,0.0008881167,0.016832493],"study_design_scores_gemma":[0.000011334794,0.00001400376,0.000021013195,0.0000023188068,0.0000018701885,0.0000046245077,0.0000018694182,0.99679416,0.00049757824,0.0019652285,0.00068369624,0.0000023395535],"about_ca_topic_score_codex":0.0050267153,"about_ca_topic_score_gemma":0.0028744598,"teacher_disagreement_score":0.0050267153,"about_ca_system_score_codex":0.001057762,"about_ca_system_score_gemma":0.0017319336,"threshold_uncertainty_score":0.011800766},"labels":[],"label_agreement":null},{"id":"W4409369453","doi":"10.1609/aaai.v39i3.32306","title":"Weakly Supervised Gland Segmentation with Class Semantic Consistency and Purified Labels Filtration","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI 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":"Artificial Intelligence in Medicine (Canada)","funders":"Natural Science Foundation of Guangxi Province; National Natural Science Foundation of China","keywords":"Consistency (knowledge bases); Segmentation; Class (philosophy); Artificial intelligence; Filtration (mathematics); Computer science; Pattern recognition (psychology); Natural language processing; Mathematics; Statistics","score_opus":0.04124428987364722,"score_gpt":0.2967333376570722,"score_spread":0.255489047783425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409369453","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.051434312,0.0002187983,0.9438523,0.00026404325,0.000032906166,0.00010416301,0.00020218041,0.0024832059,0.0014080736],"genre_scores_gemma":[0.6394787,0.00023114958,0.35266888,0.00048581808,0.00016068641,0.00024567594,0.0014850573,0.00063824205,0.0046057696],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99900824,0.00019047565,0.000047755435,0.000397958,0.00021856537,0.00013702722],"domain_scores_gemma":[0.99863654,0.00036296045,0.00020133339,0.00038003264,0.00031797125,0.00010116575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016578214,0.0016375156,0.0014325421,0.0014625312,0.00070825126,0.0014083339,0.0023815609,0.0020908793,0.0014489569],"category_scores_gemma":[0.0037463212,0.000623134,0.0015281383,0.0010949783,0.0015155216,0.0019875925,0.0023856778,0.0017561427,0.0007491794],"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.0008445306,0.00041126015,0.0060472754,0.00033582438,0.0003088547,0.00042275141,0.00058375456,0.27525848,0.12105765,0.015616049,0.008014617,0.5710989],"study_design_scores_gemma":[0.000022140968,0.00008865193,0.0012632725,0.000014538651,0.000054198554,0.00010217114,0.000042039064,0.9670752,0.018812558,0.011081159,0.0014197361,0.000024350817],"about_ca_topic_score_codex":0.0047664107,"about_ca_topic_score_gemma":0.0067014378,"teacher_disagreement_score":0.0047664107,"about_ca_system_score_codex":0.0010115544,"about_ca_system_score_gemma":0.001906072,"threshold_uncertainty_score":0.009477317},"labels":[],"label_agreement":null},{"id":"W4409369895","doi":"10.1609/aaai.v39i3.32283","title":"Latent Diffusion-Enhanced Virtual Try-On via Optimized Pseudo-Label Generation","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Handwritten Text Recognition Techniques","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":"Artificial Intelligence in Medicine (Canada)","funders":"National Key Research and Development Program of China; Wuhan University of Technology; Wuhan University; National Natural Science Foundation of China","keywords":"Diffusion; Computer science; Physics; Thermodynamics","score_opus":0.05674266309541768,"score_gpt":0.29898978350991107,"score_spread":0.2422471204144934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409369895","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.02920543,0.00014742339,0.9658017,0.0001785997,0.000055425095,0.000075508855,0.000065653614,0.0020431518,0.0024270883],"genre_scores_gemma":[0.57680166,0.0001417761,0.41325822,0.0003813651,0.00006363469,0.00021017231,0.00050075195,0.0006127596,0.0080296695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953794,0.000107317515,0.000015051367,0.00013905745,0.00013339154,0.00006734325],"domain_scores_gemma":[0.99855274,0.00062129565,0.0001449601,0.00033765734,0.00023589203,0.00010732784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086366746,0.0010702714,0.0010314323,0.00061607425,0.0004281303,0.00085650606,0.0019357107,0.0015005628,0.0035612974],"category_scores_gemma":[0.0028460273,0.0005434189,0.0007913358,0.0004332656,0.0010540129,0.0014853432,0.001684337,0.0014912148,0.0009006908],"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.00039594114,0.00020717125,0.0013096842,0.00019991602,0.00006905892,0.0002184978,0.00029782671,0.58782303,0.039227113,0.01275333,0.00621501,0.35128343],"study_design_scores_gemma":[0.000012682769,0.000028667406,0.00006474714,0.0000043257414,0.0000052875093,0.00003434617,0.000009075522,0.991734,0.0052236835,0.0023997193,0.00047776185,0.000005699365],"about_ca_topic_score_codex":0.0019720937,"about_ca_topic_score_gemma":0.0037342845,"teacher_disagreement_score":0.0035612974,"about_ca_system_score_codex":0.00064548344,"about_ca_system_score_gemma":0.00074803224,"threshold_uncertainty_score":0.011913717},"labels":[],"label_agreement":null},{"id":"W4409370123","doi":"10.1609/aaai.v39i3.32263","title":"AttackBench: Evaluating Gradient-based Attacks for Adversarial Examples","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","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":"École de Technologie Supérieure","funders":"HORIZON EUROPE Framework Programme","keywords":"Adversarial system; Computer science; Computer security; Artificial intelligence","score_opus":0.12169054576986986,"score_gpt":0.373906943296021,"score_spread":0.2522163975261511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409370123","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.3141421,0.0070299017,0.62788016,0.0018912759,0.001194755,0.0010153534,0.00253068,0.017418768,0.02689713],"genre_scores_gemma":[0.7789901,0.0011260494,0.2098341,0.00060520496,0.00013759625,0.00046503128,0.0036363606,0.0010709156,0.0041346545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959174,0.0015968651,0.0002509803,0.00058066525,0.0012961138,0.00035802263],"domain_scores_gemma":[0.99103796,0.00536888,0.00059488363,0.001915196,0.0007657168,0.00031744252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005326367,0.0025461584,0.0012377287,0.0016732966,0.0005904644,0.0015977914,0.0019778768,0.0021225116,0.0034515387],"category_scores_gemma":[0.017610107,0.0004773303,0.00088350667,0.00072873035,0.001708326,0.0029581953,0.0022002922,0.0025332742,0.0011543663],"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.00068782415,0.00039818234,0.004300515,0.0005923458,0.00038551257,0.0001183936,0.00006594702,0.86506355,0.0072426554,0.013907548,0.0134994,0.093738124],"study_design_scores_gemma":[0.000058758385,0.0004435474,0.00060477905,0.00004087875,0.00003065127,0.00010872842,0.000021283575,0.98633295,0.005833577,0.0043898467,0.0021111756,0.000023813729],"about_ca_topic_score_codex":0.0023950052,"about_ca_topic_score_gemma":0.003085453,"teacher_disagreement_score":0.005326367,"about_ca_system_score_codex":0.0014663426,"about_ca_system_score_gemma":0.0013105746,"threshold_uncertainty_score":0.028168797},"labels":[],"label_agreement":null},{"id":"W4409370181","doi":"10.1609/aaai.v39i3.32278","title":"SSLFusion: Scale and Space Aligned Latent Fusion Model for Multimodal 3D Object Detection","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Neural Network Applications","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":"Artificial Intelligence in Medicine (Canada)","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Scale (ratio); Space (punctuation); Computer science; Object (grammar); Artificial intelligence; Scale space; Computer vision; Fusion; Pattern recognition (psychology); Geography; Cartography; Image processing; Image (mathematics)","score_opus":0.04760777573300134,"score_gpt":0.2998149483334228,"score_spread":0.25220717260042147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409370181","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.009861586,0.0004427929,0.98691326,0.00023210392,0.00004052864,0.00003994245,0.00020293485,0.0013971931,0.00086965377],"genre_scores_gemma":[0.6456023,0.00083537446,0.34222737,0.0008513123,0.00015085728,0.00028358397,0.0016994992,0.00040883003,0.007940948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993185,0.00013196324,0.000029315615,0.00019877646,0.00019798942,0.00012346738],"domain_scores_gemma":[0.9995239,0.0001698931,0.000068095185,0.000077037104,0.000119526165,0.000041669882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001259191,0.0011800904,0.0012244642,0.0009920974,0.00042005672,0.0011129555,0.0026479948,0.0015496019,0.0027019023],"category_scores_gemma":[0.002215601,0.00055429153,0.0016294018,0.0009757041,0.0009020134,0.002230333,0.0026170923,0.0022801592,0.0009207623],"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.00036685506,0.00020058079,0.0030438437,0.000154324,0.00026072457,0.00020672748,0.00024456956,0.4776352,0.017658856,0.022224773,0.00926024,0.46874332],"study_design_scores_gemma":[0.000003880968,0.00002041655,0.00019201763,0.0000056001177,0.000010293967,0.000023154249,0.0000075019084,0.9940147,0.0010800338,0.004059986,0.00057432335,0.000008184954],"about_ca_topic_score_codex":0.011711517,"about_ca_topic_score_gemma":0.011525374,"teacher_disagreement_score":0.011711517,"about_ca_system_score_codex":0.0013923369,"about_ca_system_score_gemma":0.0011387949,"threshold_uncertainty_score":0.0232867},"labels":[],"label_agreement":null},{"id":"W4409381795","doi":"10.1609/aaai.v39i27.35070","title":"VQLTI: Long-Term Tropical Cyclone Intensity Forecasting with Physical Constraints","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Tropical and Extratropical Cyclones Research","field":"Earth and Planetary Sciences","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":"Artificial Intelligence in Medicine (Canada)","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Anhui Province; Science and Technology Commission of Shanghai Municipality; National Natural Science Foundation of China","keywords":"Tropical cyclone; Term (time); Tropical cyclone forecast model; Climatology; Intensity (physics); Meteorology; Environmental science; Geography; Geology; Physics; Astronomy","score_opus":0.07779090663596391,"score_gpt":0.29054237833399993,"score_spread":0.21275147169803602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409381795","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.22858374,0.0018572125,0.70702285,0.002935298,0.0009783189,0.00031206565,0.01906438,0.02144862,0.017797627],"genre_scores_gemma":[0.8711876,0.00064872764,0.10242362,0.00044197618,0.00041242738,0.0002333741,0.021153206,0.0003641822,0.0031349459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980754,0.00002364121,0.000016475162,0.00005704483,0.000061710816,0.000033599074],"domain_scores_gemma":[0.99968076,0.000065383756,0.000042353688,0.000058878704,0.0001052739,0.000047519276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050307874,0.0009971908,0.0007454104,0.0004808662,0.00038761727,0.0010585776,0.0023983298,0.0006905467,0.0022676273],"category_scores_gemma":[0.0015821402,0.00040270726,0.0007620382,0.0009863855,0.00026406607,0.0014638465,0.0012018335,0.0015669812,0.0004923501],"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.00015548691,0.00012399182,0.011195075,0.00014276584,0.00017731881,0.00017937495,0.00006577248,0.8632408,0.003050859,0.0050151628,0.029351657,0.08730182],"study_design_scores_gemma":[0.000016430147,0.000007181305,0.00047111337,0.000002906295,0.0000057499556,0.0000058664673,0.0000050614617,0.99788046,0.0002004381,0.0008139208,0.00058555737,0.000005310587],"about_ca_topic_score_codex":0.05589868,"about_ca_topic_score_gemma":0.037286922,"teacher_disagreement_score":0.05589868,"about_ca_system_score_codex":0.00065607607,"about_ca_system_score_gemma":0.0018990438,"threshold_uncertainty_score":0.11114663},"labels":[],"label_agreement":null},{"id":"W4409381863","doi":"10.1609/aaai.v39i28.35158","title":"Exploring the Efficacy of Multi-Agent Reinforcement Learning for Autonomous Cyber Defence: A CAGE Challenge 4 Perspective","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Perspective (graphical); Reinforcement learning; Reinforcement; Cage; Computer science; Psychology; Cognitive science; Human–computer interaction; Engineering; Social psychology; Artificial intelligence; Structural engineering","score_opus":0.15027208273879147,"score_gpt":0.3429535311925003,"score_spread":0.19268144845370885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409381863","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.5800608,0.0010915681,0.3805922,0.0067828996,0.0001585865,0.00033386747,0.000106520616,0.00048018442,0.030393457],"genre_scores_gemma":[0.97881144,0.00011774963,0.019808117,0.0001825764,0.000025586884,0.00006841159,0.000019835412,0.000016350356,0.00094998925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896646,0.00063945574,0.000028917804,0.00012789211,0.00013821712,0.00009899641],"domain_scores_gemma":[0.98887396,0.009002507,0.00063082343,0.00054610823,0.0006114535,0.0003351785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038919304,0.0004584829,0.0006056126,0.0003373382,0.00035873937,0.0010435873,0.00087215396,0.0012513185,0.0016168001],"category_scores_gemma":[0.011355391,0.00022564257,0.00035041806,0.00013409088,0.001431141,0.001976737,0.001264961,0.0016707457,0.0001728858],"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.00020801123,0.00025073768,0.0027528694,0.00012470008,0.000062086554,0.000054498527,0.00009069303,0.95709777,0.0027342248,0.018946685,0.0006794205,0.016998298],"study_design_scores_gemma":[0.000020896563,0.00024820078,0.00025016913,0.000008041314,0.000006003135,0.000010180908,0.000034897712,0.99172497,0.00065226015,0.006719946,0.0003185943,0.0000058114056],"about_ca_topic_score_codex":0.0020238804,"about_ca_topic_score_gemma":0.0015658165,"teacher_disagreement_score":0.0038919304,"about_ca_system_score_codex":0.0008691247,"about_ca_system_score_gemma":0.0010070518,"threshold_uncertainty_score":0.020582736},"labels":[],"label_agreement":null},{"id":"W4409392797","doi":"10.1609/aaai.v39i25.34822","title":"Learning to Rewind via Iterative Prediction of Past Weights for Practical Unlearning","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Intelligent Tutoring Systems and Adaptive 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":"Kootenay Association for Science & Technology","funders":"Korea Coast Guard; Korea Institute of Marine Science and Technology promotion; Electronics and Telecommunications Research Institute","keywords":"Computer science; Artificial intelligence","score_opus":0.0657511188787005,"score_gpt":0.31921666519971803,"score_spread":0.25346554632101753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409392797","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.026530676,0.0003030103,0.9703432,0.00017705443,0.0000612422,0.00007339119,0.00003384978,0.0010756669,0.0014019047],"genre_scores_gemma":[0.6082551,0.00027003317,0.38628548,0.00032272356,0.00009685557,0.0003103374,0.00025157284,0.00034758958,0.0038603207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928707,0.0001688172,0.000059565642,0.0002205772,0.00016170293,0.00010240101],"domain_scores_gemma":[0.99614954,0.002266188,0.00033415086,0.0006358027,0.00046641874,0.00014787084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017149224,0.0014668711,0.0014090006,0.00077199214,0.0006945054,0.0008596477,0.0022711493,0.0012738475,0.003815186],"category_scores_gemma":[0.013759353,0.0008836443,0.0006052041,0.00078582315,0.0016182569,0.0025015539,0.0019954473,0.002662875,0.0010470105],"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.00013688263,0.00015674405,0.001853235,0.00009233324,0.000048549406,0.00009059763,0.00017711699,0.78604275,0.0036596095,0.010891552,0.0016371001,0.19521348],"study_design_scores_gemma":[0.000008243615,0.00002245421,0.000056147226,0.0000062799472,0.000004046272,0.000010540901,0.0000072468592,0.9930326,0.0006069689,0.0059897997,0.00025137726,0.0000043292125],"about_ca_topic_score_codex":0.0068552117,"about_ca_topic_score_gemma":0.009827702,"teacher_disagreement_score":0.0068552117,"about_ca_system_score_codex":0.0008239983,"about_ca_system_score_gemma":0.0017968966,"threshold_uncertainty_score":0.013630629},"labels":[],"label_agreement":null},{"id":"W44477046","doi":"10.1609/aaai.v26i1.8213","title":"A Well-Founded Semantics for Basic Logic Programs with Arbitrary Abstract Constraint Atoms","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI 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":"University of Alberta","funders":"State Key Laboratory of Computer Science; National Natural Science Foundation of China","keywords":"Programming language; Axiomatic semantics; Higher-order logic; Computer science; Stable model semantics; Theoretical computer science; Well-founded semantics; Constraint (computer-aided design); Set (abstract data type); Logic programming; Multimodal logic; Intermediate logic; Logic program; Semantics (computer science); Description logic; Mathematics; Operational semantics; Denotational semantics","score_opus":0.08219916397020502,"score_gpt":0.2885253281602842,"score_spread":0.20632616419007918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W44477046","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.011715822,0.00020098552,0.9836912,0.00047850533,0.000057001096,0.000117827876,0.00012260505,0.0006753389,0.0029406138],"genre_scores_gemma":[0.274331,0.00051358267,0.71858525,0.00053910026,0.000115898736,0.0003255831,0.00044077166,0.00027440346,0.0048745167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971258,0.00058460195,0.0002954422,0.0005695472,0.0011069985,0.000317708],"domain_scores_gemma":[0.99722075,0.0008483314,0.0002362093,0.0005696953,0.00087544805,0.000249645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032699818,0.0008634149,0.0005935081,0.0013634462,0.0011834849,0.0029192094,0.0020546447,0.0014664953,0.0022941781],"category_scores_gemma":[0.0033138082,0.00096255913,0.0017065728,0.0009005286,0.0042532175,0.008233395,0.0026265276,0.003555375,0.00042835195],"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.00003761865,0.000077479854,0.00033193137,0.00010521674,0.000030131763,0.0001258983,0.00058286166,0.0090070665,0.0053326897,0.9620196,0.00094880204,0.021400586],"study_design_scores_gemma":[0.00009647278,0.00016344614,0.00027404545,0.00006782518,0.00011100762,0.00037233336,0.0002625778,0.10854203,0.017077126,0.83323133,0.039708514,0.0000933091],"about_ca_topic_score_codex":0.002644812,"about_ca_topic_score_gemma":0.0042959256,"teacher_disagreement_score":0.0032699818,"about_ca_system_score_codex":0.0017561528,"about_ca_system_score_gemma":0.0032541088,"threshold_uncertainty_score":0.017293513},"labels":[],"label_agreement":null},{"id":"W565269975","doi":"10.1609/aaai.v29i1.9594","title":"SoF: Soft-Cluster Matrix Factorization for Probabilistic Clustering","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Baidu","keywords":"Cluster analysis; Non-negative matrix factorization; Probabilistic logic; Algorithm; Computer science; Mathematics; Fuzzy clustering; Correlation clustering; Data mining; Pattern recognition (psychology); Matrix decomposition; Artificial intelligence","score_opus":0.1442253030763614,"score_gpt":0.3621481781069662,"score_spread":0.2179228750306048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W565269975","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.00070852187,0.0000683214,0.9983575,0.00005921347,0.000023617957,0.000033522425,0.00008991529,0.0004125085,0.00024681786],"genre_scores_gemma":[0.053879235,0.00024055163,0.9424523,0.00021856483,0.00010843192,0.00036073948,0.0011840648,0.00029825137,0.0012579121],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967765,0.001170573,0.00015733471,0.0006763947,0.0010395736,0.00017960173],"domain_scores_gemma":[0.99706453,0.0011485048,0.00033426582,0.0005476585,0.0007598475,0.00014518328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003477444,0.00209221,0.0018207437,0.002562144,0.0013014178,0.0016745677,0.002951646,0.0017797489,0.004284437],"category_scores_gemma":[0.008973165,0.0009629889,0.0022226814,0.0027505504,0.0015724525,0.002619883,0.0027841905,0.0025135847,0.0026651733],"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.00020108659,0.00010584368,0.0012150608,0.00044078915,0.00030579083,0.00018325483,0.00032269483,0.54149354,0.006256235,0.083708934,0.02038877,0.345378],"study_design_scores_gemma":[0.000014149282,0.00002264346,0.00014424272,0.000017660359,0.000009774151,0.000047608817,0.00002343816,0.9545846,0.0009415334,0.041058782,0.0031145008,0.000020974518],"about_ca_topic_score_codex":0.0056738616,"about_ca_topic_score_gemma":0.0075143036,"teacher_disagreement_score":0.0056738616,"about_ca_system_score_codex":0.0013910996,"about_ca_system_score_gemma":0.0024439297,"threshold_uncertainty_score":0.018390656},"labels":[],"label_agreement":null},{"id":"W57159709","doi":"10.1609/aaai.v25i1.7873","title":"Complexity of and Algorithms for Borda Manipulation","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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 Toronto","funders":"Agence Nationale de la Recherche; Asian Office of Aerospace Research and Development","keywords":"Voting; Computer science; Computational complexity theory; Bin packing problem; Approximation algorithm; Algorithm; Theoretical computer science; Bin","score_opus":0.41443430081306726,"score_gpt":0.31196339613060653,"score_spread":0.10247090468246073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W57159709","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.06399635,0.0009806855,0.89376837,0.005031495,0.00021884743,0.0006329958,0.0007549168,0.0022865273,0.032329828],"genre_scores_gemma":[0.5512739,0.00080551906,0.43390393,0.00075842446,0.0003368637,0.001058696,0.0018523926,0.00070237217,0.009307964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9919572,0.002763892,0.0005110013,0.0016550791,0.0019398003,0.0011731103],"domain_scores_gemma":[0.9742727,0.018404711,0.0014611573,0.0042797998,0.00088004215,0.0007015465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005056394,0.0014720045,0.0024376728,0.0014286946,0.0024711743,0.0075952513,0.00484575,0.004306324,0.013118642],"category_scores_gemma":[0.030123428,0.0013005022,0.0038322138,0.0025056407,0.0030374855,0.009546216,0.0051847375,0.0063719545,0.0021750985],"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.0009511504,0.000536769,0.0029104648,0.00074141717,0.00028946146,0.0002276261,0.0008021889,0.44100332,0.0037004224,0.36907995,0.018485248,0.1612719],"study_design_scores_gemma":[0.00014513088,0.000071952156,0.0003689296,0.000041183514,0.000054843604,0.00013416549,0.00011235055,0.5564611,0.0012783342,0.43726766,0.0040303385,0.000034006567],"about_ca_topic_score_codex":0.0033554398,"about_ca_topic_score_gemma":0.003326,"teacher_disagreement_score":0.013118642,"about_ca_system_score_codex":0.0052421154,"about_ca_system_score_gemma":0.004701571,"threshold_uncertainty_score":0.043886244},"labels":[],"label_agreement":null},{"id":"W582033733","doi":"10.1609/aaai.v27i1.8700","title":"A Hierarchical Aspect-Sentiment Model for Online Reviews","year":2013,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Sentiment Analysis and Opinion Mining","field":"Computer Science","cited_by":126,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Korea Evaluation Institute of Industrial Technology; Ministry of Knowledge Economy","keywords":"Computer science; Sentiment analysis; Tree (set theory); Tree structure; Hierarchical database model; Artificial intelligence; Sentence; Topic model; Polarity (international relations); Bayesian probability; Process (computing); Machine learning; Natural language processing; Data mining; Data structure; Mathematics","score_opus":0.14674591981338353,"score_gpt":0.33825623807699573,"score_spread":0.1915103182636122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W582033733","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.07351638,0.0010168258,0.9178928,0.0009441445,0.00008952873,0.00014932864,0.0012973299,0.0009802459,0.004113409],"genre_scores_gemma":[0.83915263,0.0009770243,0.14834113,0.00035948562,0.00031664918,0.00045593717,0.0025851154,0.00015494518,0.007657019],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929774,0.00025428314,0.000042214815,0.00021628883,0.00012373639,0.00006568313],"domain_scores_gemma":[0.99863213,0.00077901466,0.00018663022,0.00007751082,0.00026934023,0.000055425877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013984079,0.0008486879,0.0009192295,0.0013966863,0.0004134495,0.0010644408,0.0015322019,0.0011493663,0.0020547877],"category_scores_gemma":[0.0046631433,0.0007806739,0.0012860451,0.0013696143,0.00053648115,0.002025257,0.0005896147,0.0012988676,0.0012534412],"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.0007326361,0.00028325443,0.023666095,0.0004551089,0.0004143002,0.0007197384,0.0014271032,0.58687776,0.008533045,0.11574944,0.017374713,0.24376677],"study_design_scores_gemma":[0.000011132807,0.000020412514,0.0009059087,0.00000733835,0.00002250571,0.00004511329,0.0000125879515,0.9852937,0.0001399682,0.0127607,0.0007717901,0.000008883054],"about_ca_topic_score_codex":0.009678348,"about_ca_topic_score_gemma":0.014471528,"teacher_disagreement_score":0.009678348,"about_ca_system_score_codex":0.0008660049,"about_ca_system_score_gemma":0.0008401217,"threshold_uncertainty_score":0.019244015},"labels":[],"label_agreement":null},{"id":"W62910600","doi":"10.1609/aaai.v27i1.8483","title":"Resource Sharing for Control of Wildland Fires","year":2013,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Fire effects on ecosystems","field":"Environmental 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":"Ministry of Natural Resources and Forestry; University of Waterloo","funders":"","keywords":"Economic shortage; Environmental resource management; Resource (disambiguation); Fire control; Tipping point (physics); Natural resource; Ecosystem management; Resource management (computing); Sustainability; Business; Ecosystem; Environmental science; Computer science; Geography; Ecology; Engineering","score_opus":0.03184543770474919,"score_gpt":0.24846544664799927,"score_spread":0.2166200089432501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W62910600","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.110824786,0.0015570627,0.7661538,0.0028940958,0.00029463385,0.00025466684,0.000113187634,0.00028412117,0.11762372],"genre_scores_gemma":[0.97213846,0.00033907476,0.02207956,0.0001335067,0.000058021793,0.00009763769,0.000022059163,0.000032546286,0.005099135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903834,0.0003055261,0.000051425977,0.00018446303,0.00019321938,0.0002270919],"domain_scores_gemma":[0.99787176,0.0011332239,0.00036696656,0.00023673008,0.0001894968,0.00020186223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017917695,0.00063230644,0.00054168026,0.00044604807,0.0009671647,0.0018983271,0.0012813312,0.0010652229,0.010362297],"category_scores_gemma":[0.0045305924,0.00023380476,0.00061044685,0.00042271154,0.0017957243,0.0033643974,0.002898678,0.0010670277,0.00040191604],"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.00020153384,0.00015270436,0.0010717779,0.0002466112,0.00008046234,0.000252206,0.0005359326,0.29654828,0.0069385734,0.62008435,0.0031487083,0.07073887],"study_design_scores_gemma":[0.000052375195,0.00014308187,0.00061168865,0.00006206341,0.00003512554,0.00010958704,0.00042407002,0.47723928,0.0026769121,0.5080481,0.010568577,0.000029075887],"about_ca_topic_score_codex":0.002243092,"about_ca_topic_score_gemma":0.0020910397,"teacher_disagreement_score":0.010362297,"about_ca_system_score_codex":0.0013686143,"about_ca_system_score_gemma":0.001591291,"threshold_uncertainty_score":0.034665346},"labels":[],"label_agreement":null},{"id":"W77960026","doi":"10.1609/aaai.v27i1.8553","title":"Towards Cohesive Anomaly Mining","year":2013,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Office of International Science and Engineering; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Science Foundation","keywords":"Cluster analysis; Computer science; Task (project management); Data mining; Set (abstract data type); Anomaly detection; Anomaly (physics); Data set; Big data; Artificial intelligence; Engineering; Physics","score_opus":0.06691446556035674,"score_gpt":0.2859611338256471,"score_spread":0.21904666826529035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W77960026","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.010586541,0.00033773298,0.98769647,0.00024407815,0.000030970303,0.00008885897,0.000078001874,0.0004473911,0.0004900064],"genre_scores_gemma":[0.24023354,0.00056664634,0.7556237,0.00045106126,0.00028112892,0.00034940743,0.0009274632,0.000208702,0.0013583213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99278283,0.0022387505,0.00039904122,0.0018983003,0.0023350515,0.00034599676],"domain_scores_gemma":[0.98595375,0.006771447,0.0017018286,0.0026991102,0.0024786857,0.0003952169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006332002,0.002019874,0.002829867,0.006546276,0.0020392411,0.0034570962,0.004551879,0.0025938854,0.00082844496],"category_scores_gemma":[0.024421023,0.0012206296,0.001910374,0.006526904,0.0027876308,0.0046699233,0.007605898,0.0038784812,0.00070550106],"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.00029528173,0.0005586751,0.027179448,0.0007490765,0.00091544446,0.0010354891,0.00245912,0.2080688,0.016519835,0.13310358,0.010129781,0.59898555],"study_design_scores_gemma":[0.000026242838,0.000095188465,0.0017829288,0.00005700096,0.00008276192,0.00044174748,0.0002808992,0.8066686,0.002975051,0.18101765,0.0065314104,0.000040485545],"about_ca_topic_score_codex":0.0017743136,"about_ca_topic_score_gemma":0.002266593,"teacher_disagreement_score":0.006546276,"about_ca_system_score_codex":0.0006710632,"about_ca_system_score_gemma":0.0015655265,"threshold_uncertainty_score":0.0334872},"labels":[],"label_agreement":null},{"id":"W785130179","doi":"10.1609/aaai.v28i1.8893","title":"Robust Winners and Winner Determination Policies under Candidate Uncertainty","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Ciencia e Innovación","keywords":"Unavailability; Voting; Computer science; Computation; Condorcet method; Majority rule; Mathematical optimization; Artificial intelligence; Algorithm; Mathematics; Statistics","score_opus":0.0977726672521633,"score_gpt":0.2617441265676452,"score_spread":0.16397145931548188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W785130179","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.17375998,0.0004416669,0.817453,0.0012990625,0.00007353081,0.00027486877,0.000351595,0.00041840735,0.005927929],"genre_scores_gemma":[0.90335417,0.00016807727,0.09300212,0.00013552235,0.000056349487,0.00015662446,0.00021840735,0.000082599305,0.0028261978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939322,0.0023124106,0.0003420288,0.0013155806,0.0009806997,0.0011170299],"domain_scores_gemma":[0.97225857,0.019893872,0.0027440053,0.0024890394,0.0014973155,0.0011171463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00825788,0.00076970394,0.0024537258,0.0009814135,0.0011820974,0.0035084162,0.0027735692,0.0018099567,0.0052820453],"category_scores_gemma":[0.041563,0.0006320182,0.0010298039,0.0013298139,0.001960424,0.0047912365,0.002432478,0.002388602,0.00059288903],"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.0007170491,0.00019797511,0.004033338,0.00016817574,0.00015223886,0.0002976126,0.00035356564,0.7332762,0.0023507099,0.20005946,0.0030025535,0.055391125],"study_design_scores_gemma":[0.00006306031,0.000108699714,0.00055704184,0.00001739658,0.000028556835,0.00008425094,0.00011648127,0.85585064,0.0012505981,0.14103277,0.00086631684,0.00002420935],"about_ca_topic_score_codex":0.0025976372,"about_ca_topic_score_gemma":0.001907553,"teacher_disagreement_score":0.00825788,"about_ca_system_score_codex":0.0018227198,"about_ca_system_score_gemma":0.0020992814,"threshold_uncertainty_score":0.043672383},"labels":[],"label_agreement":null},{"id":"W83659058","doi":"10.1609/aaai.v25i1.7851","title":"Causal Theories of Actions Revisited","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Successor cardinal; Axiom; Causal theory of reference; Theory; Computer science; Causality (physics); Representation (politics); Action (physics); Causal structure; Semantics (computer science); Mathematics; Theoretical computer science; Epistemology; Programming language","score_opus":0.13105901636841177,"score_gpt":0.3014871308080306,"score_spread":0.1704281144396188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W83659058","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.024688335,0.009235762,0.6650368,0.018404616,0.0009617274,0.000089792746,0.00030361494,0.00053600036,0.28074342],"genre_scores_gemma":[0.8507358,0.004938336,0.098454624,0.0030913455,0.00093266985,0.00019309737,0.00030259497,0.00021914023,0.041132376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773324,0.0009916729,0.00012548255,0.0003692241,0.0005841765,0.00019611364],"domain_scores_gemma":[0.997223,0.0016063079,0.00016867927,0.00039568153,0.000475093,0.00013125558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027274496,0.00060481083,0.00047554917,0.0017174026,0.0015535044,0.0027043393,0.0013915303,0.0017918556,0.007894314],"category_scores_gemma":[0.004706898,0.00039564326,0.0012982875,0.001249763,0.0071726358,0.006749624,0.0016816565,0.003974502,0.0008301779],"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.000002025547,0.0000015206163,0.000024520637,0.000009559949,0.000001917126,0.000016917342,0.00009728149,0.0004887107,0.000042443324,0.9974189,0.00030424903,0.0015920369],"study_design_scores_gemma":[0.000005150866,0.0000035152864,0.000042366333,0.000016565471,0.0000068022237,0.00002893484,0.000044398606,0.002679561,0.00011390229,0.9858834,0.01117167,0.000003722196],"about_ca_topic_score_codex":0.0056849634,"about_ca_topic_score_gemma":0.0044048824,"teacher_disagreement_score":0.007894314,"about_ca_system_score_codex":0.003334976,"about_ca_system_score_gemma":0.002124762,"threshold_uncertainty_score":0.02640909},"labels":[],"label_agreement":null},{"id":"W857330509","doi":"10.1609/aaai.v26i1.8447","title":"Interactive Narrative: A Novel Application of Artificial Intelligence for Computer Games","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":38,"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":"Narrative; Computer science; Action (physics); Storytelling; Computer game; Game mechanics; Context (archaeology); Interactive storytelling; Multimedia; Character (mathematics); Video game design; Artificial intelligence; Metagaming; Human–computer interaction; Simultaneous game; Non-cooperative game; Game theory; Art","score_opus":0.080795233509761,"score_gpt":0.3375106080337602,"score_spread":0.2567153745239992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W857330509","genre_codex":"other","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.04614749,0.0051780315,0.3805298,0.0055667837,0.0010346778,0.00033841617,0.00034233558,0.0010114063,0.55985105],"genre_scores_gemma":[0.6967907,0.0032868509,0.21847203,0.0015838295,0.00039099847,0.00046551088,0.00038827516,0.000390574,0.07823123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993191,0.00034195924,0.000028166285,0.00010393116,0.00015499497,0.00005192765],"domain_scores_gemma":[0.9992466,0.00046203207,0.000055169,0.000085459964,0.00005234411,0.000098485085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055903674,0.0005873,0.0002760789,0.00069132703,0.0015515758,0.004661528,0.0011254557,0.0011665974,0.008549478],"category_scores_gemma":[0.0027286953,0.0002005107,0.0005144846,0.00051089743,0.002696684,0.003876021,0.0032477984,0.0011238117,0.0010398048],"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.00009127015,0.00005914029,0.0006615006,0.00029924558,0.0000284329,0.00089415844,0.011870413,0.003097932,0.003796864,0.90819365,0.014430188,0.05657727],"study_design_scores_gemma":[0.000054117187,0.00012738642,0.0008874126,0.00027765174,0.000037014015,0.0023536652,0.0037134904,0.031895712,0.002790274,0.30834576,0.64946395,0.000053584776],"about_ca_topic_score_codex":0.00096735905,"about_ca_topic_score_gemma":0.001526907,"teacher_disagreement_score":0.008549478,"about_ca_system_score_codex":0.0007397478,"about_ca_system_score_gemma":0.0006185006,"threshold_uncertainty_score":0.028600872},"labels":[],"label_agreement":null},{"id":"W859245369","doi":"10.1609/aaai.v29i1.9188","title":"Extended Property Paths: Writing More SPARQL Queries in a Succinct Way","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Semantic Web and Ontologies","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":"University of Toronto","funders":"Horizon 2020; European Social Fund; Regione Calabria; European Commission","keywords":"SPARQL; Computer science; Property (philosophy); Syntax; Class (philosophy); Semantics (computer science); Named graph; Programming language; Information retrieval; Theoretical computer science; RDF; Semantic Web; Artificial intelligence","score_opus":0.12563776563194534,"score_gpt":0.3099432699179239,"score_spread":0.18430550428597858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W859245369","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.007381704,0.00009306788,0.97384214,0.00050114194,0.00013270382,0.0002738515,0.0020375338,0.013069575,0.0026682622],"genre_scores_gemma":[0.09637698,0.00027729553,0.8860313,0.0010028867,0.00011512608,0.00054415147,0.0060551697,0.004994048,0.0046029664],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9936739,0.0015646963,0.00086017564,0.0008987879,0.00266748,0.00033491486],"domain_scores_gemma":[0.9846311,0.007125131,0.0007299616,0.004278153,0.0029781226,0.00025755944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006073249,0.0013919438,0.00077065517,0.0012484483,0.0006259075,0.0035055666,0.0021585473,0.0012537977,0.012228926],"category_scores_gemma":[0.0192882,0.0009338635,0.0014046658,0.001896466,0.0014229612,0.012124269,0.003729909,0.0029919026,0.0029086208],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001539792,0.00082098553,0.007406695,0.0022853378,0.00036476593,0.001632281,0.002547714,0.053535163,0.06949975,0.30469832,0.076419964,0.4792493],"study_design_scores_gemma":[0.00029603447,0.00048206878,0.001110778,0.0002798789,0.00017235611,0.0013169636,0.00065410306,0.3510701,0.1102344,0.29701656,0.23711717,0.0002495154],"about_ca_topic_score_codex":0.0023029735,"about_ca_topic_score_gemma":0.0030660043,"teacher_disagreement_score":0.012228926,"about_ca_system_score_codex":0.0008162619,"about_ca_system_score_gemma":0.0016057533,"threshold_uncertainty_score":0.040909886},"labels":[],"label_agreement":null},{"id":"W862919699","doi":"10.1609/aaai.v29i1.9544","title":"On the Equivalence of Linear Discriminant Analysis and Least Squares","year":2015,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Face and Expression Recognition","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":"Kootenay Association for Science & Technology","funders":"National Research Foundation of Korea; Ministry of Science, ICT and Future Planning; National Research Foundation","keywords":"Linear discriminant analysis; Mathematics; Eigenvalues and eigenvectors; Equivalence (formal languages); Equivalence class (music); Dimensionality reduction; Matrix (chemical analysis); Discriminant; Principal component analysis; Cluster analysis; Eigendecomposition of a matrix; Range (aeronautics); Pattern recognition (psychology); Algorithm; Artificial intelligence; Computer science; Statistics; Discrete mathematics; Physics","score_opus":0.142375336487628,"score_gpt":0.31384443950322466,"score_spread":0.17146910301559665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W862919699","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.005017951,0.0011091598,0.98804575,0.00072450074,0.00016354701,0.000047424397,0.000040080715,0.00014148632,0.004710186],"genre_scores_gemma":[0.2850113,0.0026884587,0.70491594,0.0013426541,0.0011192696,0.00043509857,0.00037767136,0.00041358866,0.0036960896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9834458,0.008294892,0.00076986017,0.0023742102,0.0047207624,0.0003944912],"domain_scores_gemma":[0.96659005,0.024062052,0.0012935821,0.0032577128,0.00446976,0.00032682027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013582074,0.0014806617,0.0016143343,0.002349718,0.0012987865,0.0030459156,0.0015168396,0.0017819343,0.002695548],"category_scores_gemma":[0.061409116,0.0006318035,0.0011464412,0.0024793467,0.0072906925,0.0050958134,0.00542551,0.00426837,0.0012940518],"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.00024661527,0.00009390972,0.0018477307,0.0002281805,0.00012976781,0.00023091745,0.0008416829,0.047136955,0.0036244981,0.68025494,0.0027041717,0.26266065],"study_design_scores_gemma":[0.00008156527,0.00017977186,0.0017921665,0.00012609399,0.000034272485,0.00026749194,0.0002143557,0.26652148,0.0033759805,0.7139173,0.013384793,0.00010469173],"about_ca_topic_score_codex":0.003021518,"about_ca_topic_score_gemma":0.0012825504,"teacher_disagreement_score":0.013582074,"about_ca_system_score_codex":0.0012766151,"about_ca_system_score_gemma":0.001324616,"threshold_uncertainty_score":0.071829796},"labels":[],"label_agreement":null},{"id":"W889023230","doi":"10.1609/aaai.v30i1.9883","title":"Building End-To-End Dialogue Systems Using Generative Hierarchical Neural Network Models","year":2016,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":126,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Montréal","funders":"Compute Canada; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Canadian Institute for Advanced Research","keywords":"Generative grammar; Computer science; Bootstrapping (finance); Word (group theory); Artificial intelligence; Language model; Domain (mathematical analysis); Encoder; Artificial neural network; Recurrent neural network; Task (project management); Natural language processing; Generative model; Linguistics","score_opus":0.1601300793042809,"score_gpt":0.32294574129573195,"score_spread":0.16281566199145106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W889023230","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.030559365,0.0001700492,0.96203154,0.0001902148,0.000062056446,0.00010386159,0.00014071743,0.0049258256,0.0018163568],"genre_scores_gemma":[0.5969196,0.0001778022,0.3952686,0.00030631266,0.00006049784,0.00039434142,0.0009611749,0.0005833046,0.0053284024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988331,0.0004775123,0.000050034156,0.00042243442,0.00013501378,0.0000819214],"domain_scores_gemma":[0.9975249,0.0016633817,0.00010828627,0.0002735271,0.0002953269,0.00013448713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019007889,0.00094293937,0.0009059009,0.00044999033,0.0006188741,0.0013923283,0.0016964291,0.0015314238,0.0030926778],"category_scores_gemma":[0.0068872827,0.00082318374,0.0010903775,0.00034854893,0.00088494946,0.0030223816,0.0023185993,0.0021511335,0.002295271],"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.00042661367,0.00040644145,0.0016584239,0.00037584934,0.00024842992,0.0005450995,0.0016828135,0.72626144,0.035927318,0.027760144,0.005268332,0.1994391],"study_design_scores_gemma":[0.000009768892,0.000022562595,0.000059928523,0.000005812348,0.000011236122,0.000020347094,0.000030566258,0.98999,0.0025568772,0.0066250563,0.00065913587,0.000008665908],"about_ca_topic_score_codex":0.0028949499,"about_ca_topic_score_gemma":0.0046408656,"teacher_disagreement_score":0.0030926778,"about_ca_system_score_codex":0.0008334301,"about_ca_system_score_gemma":0.0008417488,"threshold_uncertainty_score":0.010346055},"labels":[],"label_agreement":null},{"id":"W972909139","doi":"10.1609/aaai.v27i1.8612","title":"Progression of Decomposed Situation Calculus Theories","year":2013,"lang":"en","type":"article","venue":"Proceedings of the AAAI 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Russian Academy of Sciences; Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Forgetting; Decomposition; Situation calculus; Computer science; Scope (computer science); Subject (documents); Theory; Signature (topology); Action (physics); Calculus (dental); Theoretical computer science; Artificial intelligence; Mathematics; Cognitive psychology; Programming language; Psychology","score_opus":0.04310182647796734,"score_gpt":0.29605306193335074,"score_spread":0.2529512354553834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W972909139","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.104642294,0.0008602451,0.86401665,0.0010129028,0.00016174067,0.00033923885,0.0005564299,0.001378772,0.027031759],"genre_scores_gemma":[0.6766508,0.0010394811,0.30575517,0.0003483375,0.00019949455,0.00036629554,0.0011611178,0.0003625778,0.0141167585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99610823,0.00079069217,0.00031238783,0.00080744526,0.0014542722,0.0005268944],"domain_scores_gemma":[0.9950047,0.0019342575,0.0004292244,0.0010072846,0.0011088138,0.00051571266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048924694,0.00087367353,0.00082163204,0.0032435006,0.0019714884,0.004511647,0.0018949385,0.0011869057,0.0072610797],"category_scores_gemma":[0.0113274595,0.0009912768,0.0032523088,0.0017864505,0.0049913744,0.01043415,0.0048357667,0.004542363,0.0010813047],"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.000083402636,0.000026572332,0.0005395373,0.00009139891,0.000029402683,0.00048190422,0.0014881953,0.005193341,0.0020574105,0.978613,0.00055219175,0.010843637],"study_design_scores_gemma":[0.000043105203,0.000045034194,0.00021976703,0.000050173727,0.000041285795,0.00018525787,0.00017610057,0.020615373,0.0015058644,0.9711112,0.005979924,0.000026964695],"about_ca_topic_score_codex":0.0038953847,"about_ca_topic_score_gemma":0.0024059755,"teacher_disagreement_score":0.0072610797,"about_ca_system_score_codex":0.0029995395,"about_ca_system_score_gemma":0.0021174024,"threshold_uncertainty_score":0.025874138},"labels":[],"label_agreement":null}]}